/export/starexec/sandbox2/solver/bin/starexec_run_default /export/starexec/sandbox2/benchmark/theBenchmark.c /export/starexec/sandbox2/output/output_files -------------------------------------------------------------------------------- Ultimate: Cannot open display: This is Ultimate 0.1.25-34f2e62 [2020-07-01 13:11:07,207 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-01 13:11:07,209 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-01 13:11:07,220 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-01 13:11:07,220 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-01 13:11:07,221 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-01 13:11:07,222 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-01 13:11:07,224 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-01 13:11:07,225 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-01 13:11:07,226 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-01 13:11:07,227 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-01 13:11:07,228 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-01 13:11:07,228 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-01 13:11:07,229 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-01 13:11:07,230 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-01 13:11:07,231 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-01 13:11:07,232 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-01 13:11:07,233 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-01 13:11:07,234 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-01 13:11:07,236 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-01 13:11:07,237 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-01 13:11:07,238 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-01 13:11:07,239 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-01 13:11:07,240 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-01 13:11:07,242 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-01 13:11:07,242 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-01 13:11:07,243 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-01 13:11:07,243 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-01 13:11:07,244 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-01 13:11:07,245 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-01 13:11:07,245 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-01 13:11:07,246 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-01 13:11:07,246 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-01 13:11:07,247 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-01 13:11:07,248 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-01 13:11:07,248 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-01 13:11:07,249 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-01 13:11:07,249 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-01 13:11:07,249 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-01 13:11:07,250 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-01 13:11:07,251 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-01 13:11:07,251 INFO L101 SettingsManager]: Beginning loading settings from /export/starexec/sandbox2/solver/bin/./../termcomp2017.epf [2020-07-01 13:11:07,265 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-01 13:11:07,266 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-01 13:11:07,267 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-07-01 13:11:07,267 INFO L138 SettingsManager]: * Rewrite not-equals=true [2020-07-01 13:11:07,267 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-07-01 13:11:07,267 INFO L138 SettingsManager]: * Minimize states using LBE with the strategy=SINGLE [2020-07-01 13:11:07,268 INFO L138 SettingsManager]: * Use SBE=true [2020-07-01 13:11:07,268 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2020-07-01 13:11:07,268 INFO L138 SettingsManager]: * Use old map elimination=false [2020-07-01 13:11:07,268 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2020-07-01 13:11:07,268 INFO L138 SettingsManager]: * Buchi interpolant automaton construction strategy=DANDELION [2020-07-01 13:11:07,268 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2020-07-01 13:11:07,269 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2020-07-01 13:11:07,269 INFO L138 SettingsManager]: * Construct termination proof for TermComp=true [2020-07-01 13:11:07,269 INFO L138 SettingsManager]: * Command for external solver (GNTA synthesis)=z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-07-01 13:11:07,269 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-01 13:11:07,269 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2020-07-01 13:11:07,270 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-01 13:11:07,270 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-01 13:11:07,270 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2020-07-01 13:11:07,270 INFO L138 SettingsManager]: * How to treat unsigned ints differently from normal ones=IGNORE [2020-07-01 13:11:07,270 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-01 13:11:07,270 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-07-01 13:11:07,271 INFO L138 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2020-07-01 13:11:07,271 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:5000 [2020-07-01 13:11:07,271 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-01 13:11:07,271 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-07-01 13:11:07,271 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-07-01 13:11:07,271 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-07-01 13:11:07,437 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-01 13:11:07,451 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-01 13:11:07,455 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-01 13:11:07,456 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-01 13:11:07,457 INFO L275 PluginConnector]: CDTParser initialized [2020-07-01 13:11:07,458 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /export/starexec/sandbox2/benchmark/theBenchmark.c [2020-07-01 13:11:07,549 INFO L220 CDTParser]: Created temporary CDT project at /export/starexec/sandbox2/tmp/BenchExec_run_fFrsIr/tmp/c0a44ba9b12140d7b824d5ef9f913405/FLAG3a186a381 [2020-07-01 13:11:07,881 INFO L306 CDTParser]: Found 1 translation units. [2020-07-01 13:11:07,882 INFO L160 CDTParser]: Scanning /export/starexec/sandbox2/benchmark/theBenchmark.c [2020-07-01 13:11:07,883 WARN L117 ultiparseSymbolTable]: System include stdlib.h could not be resolved by CDT -- only built-in system includes are available. [2020-07-01 13:11:07,889 INFO L349 CDTParser]: About to delete temporary CDT project at /export/starexec/sandbox2/tmp/BenchExec_run_fFrsIr/tmp/c0a44ba9b12140d7b824d5ef9f913405/FLAG3a186a381 [2020-07-01 13:11:08,288 INFO L357 CDTParser]: Successfully deleted /export/starexec/sandbox2/tmp/BenchExec_run_fFrsIr/tmp/c0a44ba9b12140d7b824d5ef9f913405 [2020-07-01 13:11:08,299 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-01 13:11:08,300 INFO L131 ToolchainWalker]: Walking toolchain with 7 elements. [2020-07-01 13:11:08,301 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-01 13:11:08,301 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-01 13:11:08,305 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-01 13:11:08,306 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.07 01:11:08" (1/1) ... [2020-07-01 13:11:08,309 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@68b5f7f3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 01:11:08, skipping insertion in model container [2020-07-01 13:11:08,309 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.07 01:11:08" (1/1) ... [2020-07-01 13:11:08,317 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-01 13:11:08,335 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-01 13:11:08,566 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-01 13:11:08,579 INFO L203 MainTranslator]: Completed pre-run [2020-07-01 13:11:08,597 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-01 13:11:08,613 INFO L208 MainTranslator]: Completed translation [2020-07-01 13:11:08,613 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 01:11:08 WrapperNode [2020-07-01 13:11:08,614 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-01 13:11:08,614 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-07-01 13:11:08,614 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-07-01 13:11:08,615 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-07-01 13:11:08,624 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 01:11:08" (1/1) ... [2020-07-01 13:11:08,633 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 01:11:08" (1/1) ... [2020-07-01 13:11:08,655 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-07-01 13:11:08,656 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-01 13:11:08,656 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-01 13:11:08,656 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-01 13:11:08,665 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 01:11:08" (1/1) ... [2020-07-01 13:11:08,666 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 01:11:08" (1/1) ... [2020-07-01 13:11:08,667 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 01:11:08" (1/1) ... [2020-07-01 13:11:08,668 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 01:11:08" (1/1) ... [2020-07-01 13:11:08,672 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 01:11:08" (1/1) ... [2020-07-01 13:11:08,677 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 01:11:08" (1/1) ... [2020-07-01 13:11:08,678 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 01:11:08" (1/1) ... [2020-07-01 13:11:08,680 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-01 13:11:08,681 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-01 13:11:08,681 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-01 13:11:08,681 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-01 13:11:08,682 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 01:11:08" (1/1) ... No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:5000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:5000 [2020-07-01 13:11:08,754 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-07-01 13:11:08,754 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-01 13:11:08,754 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-01 13:11:08,754 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-07-01 13:11:08,755 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-07-01 13:11:08,755 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-07-01 13:11:09,085 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-01 13:11:09,085 INFO L295 CfgBuilder]: Removed 5 assume(true) statements. [2020-07-01 13:11:09,089 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.07 01:11:09 BoogieIcfgContainer [2020-07-01 13:11:09,090 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-01 13:11:09,090 INFO L113 PluginConnector]: ------------------------BlockEncodingV2---------------------------- [2020-07-01 13:11:09,090 INFO L271 PluginConnector]: Initializing BlockEncodingV2... [2020-07-01 13:11:09,092 INFO L275 PluginConnector]: BlockEncodingV2 initialized [2020-07-01 13:11:09,093 INFO L185 PluginConnector]: Executing the observer BlockEncodingObserver from plugin BlockEncodingV2 for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.07 01:11:09" (1/1) ... [2020-07-01 13:11:09,112 INFO L313 BlockEncoder]: Initial Icfg 67 locations, 72 edges [2020-07-01 13:11:09,114 INFO L258 BlockEncoder]: Using Remove infeasible edges [2020-07-01 13:11:09,114 INFO L263 BlockEncoder]: Using Maximize final states [2020-07-01 13:11:09,115 INFO L270 BlockEncoder]: Using Minimize states even if more edges are added than removed.=false [2020-07-01 13:11:09,115 INFO L276 BlockEncoder]: Using Minimize states using LBE with the strategy=SINGLE [2020-07-01 13:11:09,117 INFO L296 BlockEncoder]: Using Remove sink states [2020-07-01 13:11:09,118 INFO L171 BlockEncoder]: Using Apply optimizations until nothing changes=true [2020-07-01 13:11:09,118 INFO L179 BlockEncoder]: Using Rewrite not-equals [2020-07-01 13:11:09,147 INFO L185 BlockEncoder]: Using Use SBE [2020-07-01 13:11:09,182 INFO L200 BlockEncoder]: SBE split 36 edges [2020-07-01 13:11:09,187 INFO L70 emoveInfeasibleEdges]: Removed 1 edges and 0 locations because of local infeasibility [2020-07-01 13:11:09,189 INFO L71 MaximizeFinalStates]: 0 new accepting states [2020-07-01 13:11:09,240 INFO L100 BaseMinimizeStates]: Removed 18 edges and 9 locations by large block encoding [2020-07-01 13:11:09,243 INFO L70 RemoveSinkStates]: Removed 1 edges and 1 locations by removing sink states [2020-07-01 13:11:09,244 INFO L70 emoveInfeasibleEdges]: Removed 0 edges and 0 locations because of local infeasibility [2020-07-01 13:11:09,245 INFO L71 MaximizeFinalStates]: 0 new accepting states [2020-07-01 13:11:09,245 INFO L100 BaseMinimizeStates]: Removed 0 edges and 0 locations by large block encoding [2020-07-01 13:11:09,246 INFO L70 RemoveSinkStates]: Removed 0 edges and 0 locations by removing sink states [2020-07-01 13:11:09,246 INFO L313 BlockEncoder]: Encoded RCFG 57 locations, 99 edges [2020-07-01 13:11:09,247 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 01.07 01:11:09 BasicIcfg [2020-07-01 13:11:09,247 INFO L132 PluginConnector]: ------------------------ END BlockEncodingV2---------------------------- [2020-07-01 13:11:09,248 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-07-01 13:11:09,248 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-07-01 13:11:09,251 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-07-01 13:11:09,252 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 01.07 01:11:08" (1/4) ... [2020-07-01 13:11:09,253 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4cbc4267 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 01.07 01:11:09, skipping insertion in model container [2020-07-01 13:11:09,253 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 01:11:08" (2/4) ... [2020-07-01 13:11:09,253 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4cbc4267 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 01.07 01:11:09, skipping insertion in model container [2020-07-01 13:11:09,253 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.07 01:11:09" (3/4) ... [2020-07-01 13:11:09,254 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4cbc4267 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 01.07 01:11:09, skipping insertion in model container [2020-07-01 13:11:09,254 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 01.07 01:11:09" (4/4) ... [2020-07-01 13:11:09,255 INFO L109 eAbstractionObserver]: Analyzing ICFG theBenchmark.c_BEv2 [2020-07-01 13:11:09,266 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:ForwardPredicates Determinization: PREDICATE_ABSTRACTION [2020-07-01 13:11:09,274 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 32 error locations. [2020-07-01 13:11:09,287 INFO L251 AbstractCegarLoop]: Starting to check reachability of 32 error locations. [2020-07-01 13:11:09,311 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-07-01 13:11:09,311 INFO L376 AbstractCegarLoop]: Hoare is true [2020-07-01 13:11:09,311 INFO L377 AbstractCegarLoop]: Compute interpolants for ForwardPredicates [2020-07-01 13:11:09,311 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-01 13:11:09,311 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-01 13:11:09,312 INFO L380 AbstractCegarLoop]: Difference is false [2020-07-01 13:11:09,312 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-01 13:11:09,312 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-07-01 13:11:09,328 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states. [2020-07-01 13:11:09,334 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2020-07-01 13:11:09,334 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 13:11:09,335 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1] [2020-07-01 13:11:09,335 INFO L427 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION]=== [2020-07-01 13:11:09,341 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 13:11:09,341 INFO L82 PathProgramCache]: Analyzing trace with hash 153725, now seen corresponding path program 1 times [2020-07-01 13:11:09,351 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 13:11:09,351 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [330236835] [2020-07-01 13:11:09,352 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 13:11:09,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 13:11:09,502 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 13:11:09,502 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [330236835] [2020-07-01 13:11:09,503 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-01 13:11:09,504 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-07-01 13:11:09,504 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1872442825] [2020-07-01 13:11:09,509 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-01 13:11:09,510 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 13:11:09,524 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-01 13:11:09,525 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 13:11:09,527 INFO L87 Difference]: Start difference. First operand 57 states. Second operand 3 states. [2020-07-01 13:11:09,701 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 13:11:09,701 INFO L93 Difference]: Finished difference Result 112 states and 193 transitions. [2020-07-01 13:11:09,702 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-01 13:11:09,703 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2020-07-01 13:11:09,704 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 13:11:09,716 INFO L225 Difference]: With dead ends: 112 [2020-07-01 13:11:09,716 INFO L226 Difference]: Without dead ends: 57 [2020-07-01 13:11:09,720 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 13:11:09,737 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2020-07-01 13:11:09,755 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 57. [2020-07-01 13:11:09,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2020-07-01 13:11:09,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 96 transitions. [2020-07-01 13:11:09,760 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 96 transitions. Word has length 3 [2020-07-01 13:11:09,760 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 13:11:09,760 INFO L479 AbstractCegarLoop]: Abstraction has 57 states and 96 transitions. [2020-07-01 13:11:09,760 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-01 13:11:09,760 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 96 transitions. [2020-07-01 13:11:09,760 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2020-07-01 13:11:09,761 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 13:11:09,761 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1] [2020-07-01 13:11:09,762 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-07-01 13:11:09,763 INFO L427 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION]=== [2020-07-01 13:11:09,763 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 13:11:09,763 INFO L82 PathProgramCache]: Analyzing trace with hash 153787, now seen corresponding path program 1 times [2020-07-01 13:11:09,763 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 13:11:09,764 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [412495515] [2020-07-01 13:11:09,764 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 13:11:09,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 13:11:09,815 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 13:11:09,816 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [412495515] [2020-07-01 13:11:09,839 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-01 13:11:09,839 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-07-01 13:11:09,840 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [134946003] [2020-07-01 13:11:09,841 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-01 13:11:09,842 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 13:11:09,842 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-01 13:11:09,842 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 13:11:09,842 INFO L87 Difference]: Start difference. First operand 57 states and 96 transitions. Second operand 3 states. [2020-07-01 13:11:09,990 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 13:11:09,991 INFO L93 Difference]: Finished difference Result 57 states and 96 transitions. [2020-07-01 13:11:09,992 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-01 13:11:09,993 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2020-07-01 13:11:09,993 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 13:11:09,994 INFO L225 Difference]: With dead ends: 57 [2020-07-01 13:11:09,994 INFO L226 Difference]: Without dead ends: 49 [2020-07-01 13:11:09,995 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 13:11:09,995 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2020-07-01 13:11:10,000 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2020-07-01 13:11:10,000 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2020-07-01 13:11:10,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 80 transitions. [2020-07-01 13:11:10,001 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 80 transitions. Word has length 3 [2020-07-01 13:11:10,001 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 13:11:10,002 INFO L479 AbstractCegarLoop]: Abstraction has 49 states and 80 transitions. [2020-07-01 13:11:10,002 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-01 13:11:10,002 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 80 transitions. [2020-07-01 13:11:10,002 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2020-07-01 13:11:10,002 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 13:11:10,002 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1] [2020-07-01 13:11:10,003 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-07-01 13:11:10,003 INFO L427 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION]=== [2020-07-01 13:11:10,003 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 13:11:10,003 INFO L82 PathProgramCache]: Analyzing trace with hash 153789, now seen corresponding path program 1 times [2020-07-01 13:11:10,004 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 13:11:10,004 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1287916530] [2020-07-01 13:11:10,004 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 13:11:10,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 13:11:10,027 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 13:11:10,027 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1287916530] [2020-07-01 13:11:10,027 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-01 13:11:10,028 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-07-01 13:11:10,028 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1171899404] [2020-07-01 13:11:10,028 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-01 13:11:10,028 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 13:11:10,029 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-01 13:11:10,029 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 13:11:10,029 INFO L87 Difference]: Start difference. First operand 49 states and 80 transitions. Second operand 3 states. [2020-07-01 13:11:10,123 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 13:11:10,123 INFO L93 Difference]: Finished difference Result 57 states and 80 transitions. [2020-07-01 13:11:10,124 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-01 13:11:10,124 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2020-07-01 13:11:10,124 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 13:11:10,125 INFO L225 Difference]: With dead ends: 57 [2020-07-01 13:11:10,125 INFO L226 Difference]: Without dead ends: 49 [2020-07-01 13:11:10,126 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 13:11:10,126 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2020-07-01 13:11:10,130 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2020-07-01 13:11:10,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2020-07-01 13:11:10,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 72 transitions. [2020-07-01 13:11:10,131 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 72 transitions. Word has length 3 [2020-07-01 13:11:10,132 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 13:11:10,132 INFO L479 AbstractCegarLoop]: Abstraction has 49 states and 72 transitions. [2020-07-01 13:11:10,132 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-01 13:11:10,132 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 72 transitions. [2020-07-01 13:11:10,132 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2020-07-01 13:11:10,132 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 13:11:10,132 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1] [2020-07-01 13:11:10,133 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-07-01 13:11:10,133 INFO L427 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION]=== [2020-07-01 13:11:10,133 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 13:11:10,133 INFO L82 PathProgramCache]: Analyzing trace with hash 153790, now seen corresponding path program 1 times [2020-07-01 13:11:10,134 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 13:11:10,134 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1734694340] [2020-07-01 13:11:10,134 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 13:11:10,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 13:11:10,171 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 13:11:10,171 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1734694340] [2020-07-01 13:11:10,171 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-01 13:11:10,172 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-07-01 13:11:10,172 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1995199295] [2020-07-01 13:11:10,172 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-01 13:11:10,173 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 13:11:10,173 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-01 13:11:10,173 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 13:11:10,173 INFO L87 Difference]: Start difference. First operand 49 states and 72 transitions. Second operand 3 states. [2020-07-01 13:11:10,297 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 13:11:10,298 INFO L93 Difference]: Finished difference Result 49 states and 72 transitions. [2020-07-01 13:11:10,298 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-01 13:11:10,298 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2020-07-01 13:11:10,298 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 13:11:10,299 INFO L225 Difference]: With dead ends: 49 [2020-07-01 13:11:10,299 INFO L226 Difference]: Without dead ends: 41 [2020-07-01 13:11:10,300 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 13:11:10,300 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2020-07-01 13:11:10,303 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2020-07-01 13:11:10,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2020-07-01 13:11:10,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 64 transitions. [2020-07-01 13:11:10,304 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 64 transitions. Word has length 3 [2020-07-01 13:11:10,305 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 13:11:10,305 INFO L479 AbstractCegarLoop]: Abstraction has 41 states and 64 transitions. [2020-07-01 13:11:10,305 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-01 13:11:10,305 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 64 transitions. [2020-07-01 13:11:10,305 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2020-07-01 13:11:10,306 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 13:11:10,306 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2020-07-01 13:11:10,306 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-07-01 13:11:10,307 INFO L427 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION]=== [2020-07-01 13:11:10,307 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 13:11:10,307 INFO L82 PathProgramCache]: Analyzing trace with hash 284330293, now seen corresponding path program 1 times [2020-07-01 13:11:10,307 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 13:11:10,307 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [75869352] [2020-07-01 13:11:10,308 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 13:11:10,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 13:11:10,342 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 13:11:10,343 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [75869352] [2020-07-01 13:11:10,343 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-01 13:11:10,343 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-07-01 13:11:10,343 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [732254767] [2020-07-01 13:11:10,344 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-01 13:11:10,344 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 13:11:10,344 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-01 13:11:10,344 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 13:11:10,345 INFO L87 Difference]: Start difference. First operand 41 states and 64 transitions. Second operand 3 states. [2020-07-01 13:11:10,428 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 13:11:10,428 INFO L93 Difference]: Finished difference Result 41 states and 64 transitions. [2020-07-01 13:11:10,429 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-01 13:11:10,429 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 6 [2020-07-01 13:11:10,429 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 13:11:10,430 INFO L225 Difference]: With dead ends: 41 [2020-07-01 13:11:10,430 INFO L226 Difference]: Without dead ends: 33 [2020-07-01 13:11:10,430 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 13:11:10,431 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2020-07-01 13:11:10,434 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2020-07-01 13:11:10,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2020-07-01 13:11:10,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 48 transitions. [2020-07-01 13:11:10,435 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 48 transitions. Word has length 6 [2020-07-01 13:11:10,435 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 13:11:10,435 INFO L479 AbstractCegarLoop]: Abstraction has 33 states and 48 transitions. [2020-07-01 13:11:10,435 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-01 13:11:10,435 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 48 transitions. [2020-07-01 13:11:10,435 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2020-07-01 13:11:10,436 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 13:11:10,436 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2020-07-01 13:11:10,436 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-07-01 13:11:10,436 INFO L427 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION]=== [2020-07-01 13:11:10,436 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 13:11:10,437 INFO L82 PathProgramCache]: Analyzing trace with hash 284330295, now seen corresponding path program 1 times [2020-07-01 13:11:10,437 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 13:11:10,437 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1970669439] [2020-07-01 13:11:10,437 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 13:11:10,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 13:11:10,472 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 13:11:10,473 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1970669439] [2020-07-01 13:11:10,473 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-01 13:11:10,473 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-07-01 13:11:10,473 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1676290186] [2020-07-01 13:11:10,474 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-01 13:11:10,474 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 13:11:10,474 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-01 13:11:10,474 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 13:11:10,474 INFO L87 Difference]: Start difference. First operand 33 states and 48 transitions. Second operand 3 states. [2020-07-01 13:11:10,535 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 13:11:10,535 INFO L93 Difference]: Finished difference Result 33 states and 48 transitions. [2020-07-01 13:11:10,536 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-01 13:11:10,536 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 6 [2020-07-01 13:11:10,536 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 13:11:10,536 INFO L225 Difference]: With dead ends: 33 [2020-07-01 13:11:10,536 INFO L226 Difference]: Without dead ends: 0 [2020-07-01 13:11:10,537 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 13:11:10,537 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2020-07-01 13:11:10,537 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2020-07-01 13:11:10,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2020-07-01 13:11:10,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2020-07-01 13:11:10,538 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 6 [2020-07-01 13:11:10,538 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 13:11:10,538 INFO L479 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-07-01 13:11:10,538 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-01 13:11:10,538 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-01 13:11:10,538 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-01 13:11:10,539 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-07-01 13:11:10,541 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2020-07-01 13:11:10,569 INFO L268 CegarLoopResult]: For program point L11(line 11) no Hoare annotation was computed. [2020-07-01 13:11:10,570 INFO L268 CegarLoopResult]: For program point L11-1(line 11) no Hoare annotation was computed. [2020-07-01 13:11:10,570 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr29REQUIRES_VIOLATION(line 20) no Hoare annotation was computed. [2020-07-01 13:11:10,570 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr31REQUIRES_VIOLATION(line 22) no Hoare annotation was computed. [2020-07-01 13:11:10,570 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr25REQUIRES_VIOLATION(line 18) no Hoare annotation was computed. [2020-07-01 13:11:10,570 INFO L268 CegarLoopResult]: For program point L-1(line -1) no Hoare annotation was computed. [2020-07-01 13:11:10,570 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr27REQUIRES_VIOLATION(line 20) no Hoare annotation was computed. [2020-07-01 13:11:10,570 INFO L268 CegarLoopResult]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2020-07-01 13:11:10,571 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr21REQUIRES_VIOLATION(line 17) no Hoare annotation was computed. [2020-07-01 13:11:10,571 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr23REQUIRES_VIOLATION(line 18) no Hoare annotation was computed. [2020-07-01 13:11:10,571 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr17REQUIRES_VIOLATION(line 15) no Hoare annotation was computed. [2020-07-01 13:11:10,571 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr19REQUIRES_VIOLATION(line 17) no Hoare annotation was computed. [2020-07-01 13:11:10,571 INFO L268 CegarLoopResult]: For program point L20(line 20) no Hoare annotation was computed. [2020-07-01 13:11:10,571 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr13REQUIRES_VIOLATION(line 13) no Hoare annotation was computed. [2020-07-01 13:11:10,571 INFO L268 CegarLoopResult]: For program point L20-1(line 20) no Hoare annotation was computed. [2020-07-01 13:11:10,571 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr15REQUIRES_VIOLATION(line 13) no Hoare annotation was computed. [2020-07-01 13:11:10,572 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr9REQUIRES_VIOLATION(line 11) no Hoare annotation was computed. [2020-07-01 13:11:10,572 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr11REQUIRES_VIOLATION(line 11) no Hoare annotation was computed. [2020-07-01 13:11:10,572 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr5REQUIRES_VIOLATION(line 10) no Hoare annotation was computed. [2020-07-01 13:11:10,572 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr7REQUIRES_VIOLATION(line 10) no Hoare annotation was computed. [2020-07-01 13:11:10,572 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr1REQUIRES_VIOLATION(line 8) no Hoare annotation was computed. [2020-07-01 13:11:10,573 INFO L268 CegarLoopResult]: For program point L8-1(line 8) no Hoare annotation was computed. [2020-07-01 13:11:10,573 INFO L268 CegarLoopResult]: For program point L8-2(line 8) no Hoare annotation was computed. [2020-07-01 13:11:10,573 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr3REQUIRES_VIOLATION(line 8) no Hoare annotation was computed. [2020-07-01 13:11:10,573 INFO L268 CegarLoopResult]: For program point L8-3(line 8) no Hoare annotation was computed. [2020-07-01 13:11:10,573 INFO L268 CegarLoopResult]: For program point L8-4(line 8) no Hoare annotation was computed. [2020-07-01 13:11:10,573 INFO L268 CegarLoopResult]: For program point L8-6(lines 8 24) no Hoare annotation was computed. [2020-07-01 13:11:10,573 INFO L268 CegarLoopResult]: For program point L17(line 17) no Hoare annotation was computed. [2020-07-01 13:11:10,573 INFO L268 CegarLoopResult]: For program point L17-1(line 17) no Hoare annotation was computed. [2020-07-01 13:11:10,574 INFO L268 CegarLoopResult]: For program point L17-2(lines 17 21) no Hoare annotation was computed. [2020-07-01 13:11:10,574 INFO L268 CegarLoopResult]: For program point L13(line 13) no Hoare annotation was computed. [2020-07-01 13:11:10,574 INFO L268 CegarLoopResult]: For program point L17-4(lines 17 21) no Hoare annotation was computed. [2020-07-01 13:11:10,574 INFO L268 CegarLoopResult]: For program point L13-1(line 13) no Hoare annotation was computed. [2020-07-01 13:11:10,574 INFO L268 CegarLoopResult]: For program point L9(lines 9 23) no Hoare annotation was computed. [2020-07-01 13:11:10,575 INFO L264 CegarLoopResult]: At program point L9-2(lines 8 24) the Hoare annotation is: (and (= 4 (select |#length| ULTIMATE.start_main_~y~0.base)) (= (select |#valid| ULTIMATE.start_main_~x~0.base) 1) (= 0 ULTIMATE.start_main_~y~0.offset) (= (select |#length| ULTIMATE.start_main_~x~0.base) 4) (<= 1 |#StackHeapBarrier|) (= 1 (select |#valid| ULTIMATE.start_main_~y~0.base)) (= 0 ULTIMATE.start_main_~x~0.offset)) [2020-07-01 13:11:10,575 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr30REQUIRES_VIOLATION(line 22) no Hoare annotation was computed. [2020-07-01 13:11:10,575 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr26REQUIRES_VIOLATION(line 20) no Hoare annotation was computed. [2020-07-01 13:11:10,575 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr28REQUIRES_VIOLATION(line 20) no Hoare annotation was computed. [2020-07-01 13:11:10,575 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr22REQUIRES_VIOLATION(line 18) no Hoare annotation was computed. [2020-07-01 13:11:10,575 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr24REQUIRES_VIOLATION(line 18) no Hoare annotation was computed. [2020-07-01 13:11:10,575 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr18REQUIRES_VIOLATION(line 17) no Hoare annotation was computed. [2020-07-01 13:11:10,575 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr20REQUIRES_VIOLATION(line 17) no Hoare annotation was computed. [2020-07-01 13:11:10,576 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr14REQUIRES_VIOLATION(line 13) no Hoare annotation was computed. [2020-07-01 13:11:10,576 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr16REQUIRES_VIOLATION(line 15) no Hoare annotation was computed. [2020-07-01 13:11:10,576 INFO L268 CegarLoopResult]: For program point L18(line 18) no Hoare annotation was computed. [2020-07-01 13:11:10,576 INFO L268 CegarLoopResult]: For program point L18-1(line 18) no Hoare annotation was computed. [2020-07-01 13:11:10,576 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr10REQUIRES_VIOLATION(line 11) no Hoare annotation was computed. [2020-07-01 13:11:10,576 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr12REQUIRES_VIOLATION(line 13) no Hoare annotation was computed. [2020-07-01 13:11:10,576 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr6REQUIRES_VIOLATION(line 10) no Hoare annotation was computed. [2020-07-01 13:11:10,576 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr8REQUIRES_VIOLATION(line 11) no Hoare annotation was computed. [2020-07-01 13:11:10,576 INFO L268 CegarLoopResult]: For program point L10(line 10) no Hoare annotation was computed. [2020-07-01 13:11:10,577 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr2REQUIRES_VIOLATION(line 8) no Hoare annotation was computed. [2020-07-01 13:11:10,577 INFO L268 CegarLoopResult]: For program point L10-1(line 10) no Hoare annotation was computed. [2020-07-01 13:11:10,577 INFO L268 CegarLoopResult]: For program point L10-2(lines 10 14) no Hoare annotation was computed. [2020-07-01 13:11:10,577 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr4REQUIRES_VIOLATION(line 10) no Hoare annotation was computed. [2020-07-01 13:11:10,578 INFO L268 CegarLoopResult]: For program point L10-4(lines 10 14) no Hoare annotation was computed. [2020-07-01 13:11:10,578 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr0REQUIRES_VIOLATION(line 8) no Hoare annotation was computed. [2020-07-01 13:11:10,581 INFO L308 ceAbstractionStarter]: Did not count any witness invariants because Icfg is not BoogieIcfg [2020-07-01 13:11:10,589 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 13:11:10,590 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 13:11:10,591 WARN L1295 BoogieBacktranslator]: unknown boogie variable #StackHeapBarrier [2020-07-01 13:11:10,596 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 13:11:10,596 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 13:11:10,597 WARN L1295 BoogieBacktranslator]: unknown boogie variable #StackHeapBarrier [2020-07-01 13:11:10,599 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 01.07 01:11:10 BasicIcfg [2020-07-01 13:11:10,599 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-07-01 13:11:10,600 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2020-07-01 13:11:10,600 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2020-07-01 13:11:10,604 INFO L275 PluginConnector]: BuchiAutomizer initialized [2020-07-01 13:11:10,604 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-07-01 13:11:10,605 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 01.07 01:11:08" (1/5) ... [2020-07-01 13:11:10,605 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@60de9ac7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 01.07 01:11:10, skipping insertion in model container [2020-07-01 13:11:10,605 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-07-01 13:11:10,605 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 01:11:08" (2/5) ... [2020-07-01 13:11:10,606 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@60de9ac7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 01.07 01:11:10, skipping insertion in model container [2020-07-01 13:11:10,606 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-07-01 13:11:10,606 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.07 01:11:09" (3/5) ... [2020-07-01 13:11:10,606 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@60de9ac7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 01.07 01:11:10, skipping insertion in model container [2020-07-01 13:11:10,606 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-07-01 13:11:10,606 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 01.07 01:11:09" (4/5) ... [2020-07-01 13:11:10,607 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@60de9ac7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 01.07 01:11:10, skipping insertion in model container [2020-07-01 13:11:10,607 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-07-01 13:11:10,607 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 01.07 01:11:10" (5/5) ... [2020-07-01 13:11:10,608 INFO L371 chiAutomizerObserver]: Analyzing ICFG theBenchmark.c_BEv2 [2020-07-01 13:11:10,630 INFO L356 BuchiCegarLoop]: Interprodecural is true [2020-07-01 13:11:10,630 INFO L357 BuchiCegarLoop]: Hoare is true [2020-07-01 13:11:10,630 INFO L358 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2020-07-01 13:11:10,630 INFO L359 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-01 13:11:10,630 INFO L360 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-01 13:11:10,630 INFO L361 BuchiCegarLoop]: Difference is false [2020-07-01 13:11:10,630 INFO L362 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-01 13:11:10,630 INFO L365 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2020-07-01 13:11:10,634 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 57 states. [2020-07-01 13:11:10,640 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 23 [2020-07-01 13:11:10,641 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-01 13:11:10,641 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-01 13:11:10,647 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2020-07-01 13:11:10,647 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-01 13:11:10,647 INFO L424 BuchiCegarLoop]: ======== Iteration 1============ [2020-07-01 13:11:10,647 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 57 states. [2020-07-01 13:11:10,650 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 23 [2020-07-01 13:11:10,650 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-01 13:11:10,650 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-01 13:11:10,651 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2020-07-01 13:11:10,651 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-01 13:11:10,656 INFO L794 eck$LassoCheckResult]: Stem: 24#ULTIMATE.startENTRYtrue [122] ULTIMATE.startENTRY-->L-1: Formula: (and (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= |v_#valid_1| (store |v_#valid_2| 0 0)) (= |v_#NULL.offset_1| 0)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_2|} OutVars{#NULL.offset=|v_#NULL.offset_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #NULL.base=|v_#NULL.base_1|, #valid=|v_#valid_1|} AuxVars[] AssignedVars[#valid, #NULL.offset, #NULL.base] 9#L-1true [212] L-1-->L9-2: Formula: (let ((.cse0 (store |v_#valid_5| |v_ULTIMATE.start_main_#t~malloc0.base_1| 1))) (and (= 0 (select |v_#valid_5| |v_ULTIMATE.start_main_#t~malloc0.base_1|)) (= v_ULTIMATE.start_main_~y~0.offset_1 |v_ULTIMATE.start_main_#t~malloc1.offset_1|) (= 0 (select .cse0 |v_ULTIMATE.start_main_#t~malloc1.base_1|)) (> 0 |v_ULTIMATE.start_main_#t~malloc1.base_1|) (= 0 |v_ULTIMATE.start_main_#t~malloc0.offset_1|) (= v_ULTIMATE.start_main_~x~0.offset_1 |v_ULTIMATE.start_main_#t~malloc0.offset_1|) (= 0 |v_ULTIMATE.start_main_#t~malloc1.offset_1|) (= |v_#valid_3| (store .cse0 |v_ULTIMATE.start_main_#t~malloc1.base_1| 1)) (< |v_#StackHeapBarrier_2| |v_ULTIMATE.start_main_#t~malloc1.base_1|) (= v_ULTIMATE.start_main_~x~0.base_1 |v_ULTIMATE.start_main_#t~malloc0.base_1|) (< |v_#StackHeapBarrier_2| |v_ULTIMATE.start_main_#t~malloc0.base_1|) (= (store (store |v_#length_3| |v_ULTIMATE.start_main_#t~malloc0.base_1| 4) |v_ULTIMATE.start_main_#t~malloc1.base_1| 4) |v_#length_1|) (= v_ULTIMATE.start_main_~y~0.base_1 |v_ULTIMATE.start_main_#t~malloc1.base_1|) (> 0 |v_ULTIMATE.start_main_#t~malloc0.base_1|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_2|, #length=|v_#length_3|, #valid=|v_#valid_5|} OutVars{ULTIMATE.start_main_#t~malloc1.offset=|v_ULTIMATE.start_main_#t~malloc1.offset_1|, ULTIMATE.start_main_#t~nondet10=|v_ULTIMATE.start_main_#t~nondet10_1|, ULTIMATE.start_main_#t~nondet5=|v_ULTIMATE.start_main_#t~nondet5_1|, ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_1, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_1, ULTIMATE.start_main_#t~malloc0.base=|v_ULTIMATE.start_main_#t~malloc0.base_1|, ULTIMATE.start_main_#t~malloc1.base=|v_ULTIMATE.start_main_#t~malloc1.base_1|, #length=|v_#length_1|, ULTIMATE.start_main_~y~0.base=v_ULTIMATE.start_main_~y~0.base_1, ULTIMATE.start_main_#t~mem14=|v_ULTIMATE.start_main_#t~mem14_1|, ULTIMATE.start_main_#t~mem11=|v_ULTIMATE.start_main_#t~mem11_1|, ULTIMATE.start_main_#t~mem13=|v_ULTIMATE.start_main_#t~mem13_1|, ULTIMATE.start_main_#t~mem12=|v_ULTIMATE.start_main_#t~mem12_1|, ULTIMATE.start_main_#t~malloc0.offset=|v_ULTIMATE.start_main_#t~malloc0.offset_1|, ULTIMATE.start_main_#t~mem9=|v_ULTIMATE.start_main_#t~mem9_1|, #StackHeapBarrier=|v_#StackHeapBarrier_2|, ULTIMATE.start_main_#t~short4=|v_ULTIMATE.start_main_#t~short4_1|, ULTIMATE.start_main_#t~mem8=|v_ULTIMATE.start_main_#t~mem8_1|, ULTIMATE.start_main_#t~mem7=|v_ULTIMATE.start_main_#t~mem7_1|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_1|, #valid=|v_#valid_3|, ULTIMATE.start_main_#t~mem2=|v_ULTIMATE.start_main_#t~mem2_1|, ULTIMATE.start_main_#t~nondet15=|v_ULTIMATE.start_main_#t~nondet15_1|, ULTIMATE.start_main_~y~0.offset=v_ULTIMATE.start_main_~y~0.offset_1, ULTIMATE.start_main_#t~mem6=|v_ULTIMATE.start_main_#t~mem6_1|, ULTIMATE.start_main_#t~mem3=|v_ULTIMATE.start_main_#t~mem3_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~malloc1.offset, ULTIMATE.start_main_#t~nondet10, ULTIMATE.start_main_#t~nondet5, ULTIMATE.start_main_~x~0.offset, ULTIMATE.start_main_~x~0.base, ULTIMATE.start_main_#t~malloc0.base, ULTIMATE.start_main_#t~malloc1.base, #length, ULTIMATE.start_main_~y~0.base, ULTIMATE.start_main_#t~mem14, ULTIMATE.start_main_#t~mem11, ULTIMATE.start_main_#t~mem13, ULTIMATE.start_main_#t~mem12, ULTIMATE.start_main_#t~malloc0.offset, ULTIMATE.start_main_#t~mem9, ULTIMATE.start_main_#t~short4, ULTIMATE.start_main_#t~mem8, ULTIMATE.start_main_#t~mem7, ULTIMATE.start_main_#res, #valid, ULTIMATE.start_main_#t~mem2, ULTIMATE.start_main_#t~nondet15, ULTIMATE.start_main_~y~0.offset, ULTIMATE.start_main_#t~mem6, ULTIMATE.start_main_#t~mem3] 34#L9-2true [2020-07-01 13:11:10,657 INFO L796 eck$LassoCheckResult]: Loop: 34#L9-2true [133] L9-2-->L8-1: Formula: (and (<= (+ v_ULTIMATE.start_main_~x~0.offset_4 4) (select |v_#length_4| v_ULTIMATE.start_main_~x~0.base_4)) (<= 0 v_ULTIMATE.start_main_~x~0.offset_4) (= (select |v_#valid_6| v_ULTIMATE.start_main_~x~0.base_4) 1) (= |v_ULTIMATE.start_main_#t~mem2_2| (select (select |v_#memory_int_1| v_ULTIMATE.start_main_~x~0.base_4) v_ULTIMATE.start_main_~x~0.offset_4))) InVars {ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_4, #memory_int=|v_#memory_int_1|, #length=|v_#length_4|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_4, #valid=|v_#valid_6|} OutVars{#valid=|v_#valid_6|, ULTIMATE.start_main_#t~mem2=|v_ULTIMATE.start_main_#t~mem2_2|, ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_4, #memory_int=|v_#memory_int_1|, #length=|v_#length_4|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_4} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem2] 21#L8-1true [217] L8-1-->L8-2: Formula: (and (< 0 |v_ULTIMATE.start_main_#t~mem2_3|) |v_ULTIMATE.start_main_#t~short4_2|) InVars {ULTIMATE.start_main_#t~mem2=|v_ULTIMATE.start_main_#t~mem2_3|} OutVars{ULTIMATE.start_main_#t~mem2=|v_ULTIMATE.start_main_#t~mem2_3|, ULTIMATE.start_main_#t~short4=|v_ULTIMATE.start_main_#t~short4_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~short4] 19#L8-2true [117] L8-2-->L8-6: Formula: (not |v_ULTIMATE.start_main_#t~short4_5|) InVars {ULTIMATE.start_main_#t~short4=|v_ULTIMATE.start_main_#t~short4_5|} OutVars{ULTIMATE.start_main_#t~short4=|v_ULTIMATE.start_main_#t~short4_5|} AuxVars[] AssignedVars[] 27#L8-6true [129] L8-6-->L9: Formula: |v_ULTIMATE.start_main_#t~short4_9| InVars {ULTIMATE.start_main_#t~short4=|v_ULTIMATE.start_main_#t~short4_9|} OutVars{ULTIMATE.start_main_#t~mem2=|v_ULTIMATE.start_main_#t~mem2_5|, ULTIMATE.start_main_#t~short4=|v_ULTIMATE.start_main_#t~short4_8|, ULTIMATE.start_main_#t~mem3=|v_ULTIMATE.start_main_#t~mem3_5|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~short4, ULTIMATE.start_main_#t~mem2, ULTIMATE.start_main_#t~mem3] 37#L9true [141] L9-->L17: Formula: (= 0 |v_ULTIMATE.start_main_#t~nondet5_5|) InVars {ULTIMATE.start_main_#t~nondet5=|v_ULTIMATE.start_main_#t~nondet5_5|} OutVars{ULTIMATE.start_main_#t~nondet5=|v_ULTIMATE.start_main_#t~nondet5_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet5] 50#L17true [153] L17-->L17-1: Formula: (and (<= (+ v_ULTIMATE.start_main_~x~0.offset_12 4) (select |v_#length_22| v_ULTIMATE.start_main_~x~0.base_16)) (= (select (select |v_#memory_int_13| v_ULTIMATE.start_main_~x~0.base_16) v_ULTIMATE.start_main_~x~0.offset_12) |v_ULTIMATE.start_main_#t~mem11_2|) (<= 0 v_ULTIMATE.start_main_~x~0.offset_12) (= 1 (select |v_#valid_24| v_ULTIMATE.start_main_~x~0.base_16))) InVars {ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_12, #memory_int=|v_#memory_int_13|, #length=|v_#length_22|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_16, #valid=|v_#valid_24|} OutVars{ULTIMATE.start_main_#t~mem11=|v_ULTIMATE.start_main_#t~mem11_2|, #valid=|v_#valid_24|, ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_12, #memory_int=|v_#memory_int_13|, #length=|v_#length_22|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_16} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem11] 47#L17-1true [147] L17-1-->L17-2: Formula: (and (<= (+ v_ULTIMATE.start_main_~y~0.offset_14 4) (select |v_#length_24| v_ULTIMATE.start_main_~y~0.base_19)) (= 1 (select |v_#valid_26| v_ULTIMATE.start_main_~y~0.base_19)) (<= 0 v_ULTIMATE.start_main_~y~0.offset_14) (= (select (select |v_#memory_int_14| v_ULTIMATE.start_main_~y~0.base_19) v_ULTIMATE.start_main_~y~0.offset_14) |v_ULTIMATE.start_main_#t~mem12_2|)) InVars {#memory_int=|v_#memory_int_14|, ULTIMATE.start_main_~y~0.base=v_ULTIMATE.start_main_~y~0.base_19, ULTIMATE.start_main_~y~0.offset=v_ULTIMATE.start_main_~y~0.offset_14, #length=|v_#length_24|, #valid=|v_#valid_26|} OutVars{ULTIMATE.start_main_#t~mem12=|v_ULTIMATE.start_main_#t~mem12_2|, #valid=|v_#valid_26|, #memory_int=|v_#memory_int_14|, ULTIMATE.start_main_~y~0.base=v_ULTIMATE.start_main_~y~0.base_19, ULTIMATE.start_main_~y~0.offset=v_ULTIMATE.start_main_~y~0.offset_14, #length=|v_#length_24|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem12] 46#L17-2true [188] L17-2-->L20: Formula: (>= |v_ULTIMATE.start_main_#t~mem11_6| |v_ULTIMATE.start_main_#t~mem12_6|) InVars {ULTIMATE.start_main_#t~mem11=|v_ULTIMATE.start_main_#t~mem11_6|, ULTIMATE.start_main_#t~mem12=|v_ULTIMATE.start_main_#t~mem12_6|} OutVars{ULTIMATE.start_main_#t~mem11=|v_ULTIMATE.start_main_#t~mem11_5|, ULTIMATE.start_main_#t~mem12=|v_ULTIMATE.start_main_#t~mem12_5|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem11, ULTIMATE.start_main_#t~mem12] 39#L20true [142] L20-->L20-1: Formula: (and (<= 0 v_ULTIMATE.start_main_~y~0.offset_16) (= 1 (select |v_#valid_32| v_ULTIMATE.start_main_~y~0.base_22)) (= (select (select |v_#memory_int_18| v_ULTIMATE.start_main_~y~0.base_22) v_ULTIMATE.start_main_~y~0.offset_16) |v_ULTIMATE.start_main_#t~mem14_2|) (<= (+ v_ULTIMATE.start_main_~y~0.offset_16 4) (select |v_#length_30| v_ULTIMATE.start_main_~y~0.base_22))) InVars {#memory_int=|v_#memory_int_18|, ULTIMATE.start_main_~y~0.base=v_ULTIMATE.start_main_~y~0.base_22, ULTIMATE.start_main_~y~0.offset=v_ULTIMATE.start_main_~y~0.offset_16, #length=|v_#length_30|, #valid=|v_#valid_32|} OutVars{#valid=|v_#valid_32|, #memory_int=|v_#memory_int_18|, ULTIMATE.start_main_~y~0.base=v_ULTIMATE.start_main_~y~0.base_22, ULTIMATE.start_main_~y~0.offset=v_ULTIMATE.start_main_~y~0.offset_16, #length=|v_#length_30|, ULTIMATE.start_main_#t~mem14=|v_ULTIMATE.start_main_#t~mem14_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem14] 36#L20-1true [287] L20-1-->L17-4: Formula: (and (= |v_#memory_int_25| (store |v_#memory_int_26| v_ULTIMATE.start_main_~x~0.base_29 (store (select |v_#memory_int_26| v_ULTIMATE.start_main_~x~0.base_29) v_ULTIMATE.start_main_~x~0.offset_21 (+ |v_ULTIMATE.start_main_#t~mem14_6| (- 1))))) (= 1 (select |v_#valid_48| v_ULTIMATE.start_main_~x~0.base_29)) (<= 0 v_ULTIMATE.start_main_~x~0.offset_21) (<= (+ v_ULTIMATE.start_main_~x~0.offset_21 4) (select |v_#length_37| v_ULTIMATE.start_main_~x~0.base_29))) InVars {#valid=|v_#valid_48|, #memory_int=|v_#memory_int_26|, ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_21, #length=|v_#length_37|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_29, ULTIMATE.start_main_#t~mem14=|v_ULTIMATE.start_main_#t~mem14_6|} OutVars{#valid=|v_#valid_48|, #memory_int=|v_#memory_int_25|, ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_21, #length=|v_#length_37|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_29, ULTIMATE.start_main_#t~mem14=|v_ULTIMATE.start_main_#t~mem14_5|} AuxVars[] AssignedVars[#memory_int, ULTIMATE.start_main_#t~mem14] 58#L17-4true [290] L17-4-->L9-2: Formula: (and (<= 0 v_ULTIMATE.start_main_~y~0.offset_22) (= (store |v_#memory_int_32| v_ULTIMATE.start_main_~y~0.base_30 (store (select |v_#memory_int_32| v_ULTIMATE.start_main_~y~0.base_30) v_ULTIMATE.start_main_~y~0.offset_22 |v_ULTIMATE.start_main_#t~nondet15_5|)) |v_#memory_int_31|) (<= (+ v_ULTIMATE.start_main_~y~0.offset_22 4) (select |v_#length_40| v_ULTIMATE.start_main_~y~0.base_30)) (= 1 (select |v_#valid_51| v_ULTIMATE.start_main_~y~0.base_30))) InVars {#valid=|v_#valid_51|, #memory_int=|v_#memory_int_32|, ULTIMATE.start_main_#t~nondet15=|v_ULTIMATE.start_main_#t~nondet15_5|, ULTIMATE.start_main_~y~0.base=v_ULTIMATE.start_main_~y~0.base_30, ULTIMATE.start_main_~y~0.offset=v_ULTIMATE.start_main_~y~0.offset_22, #length=|v_#length_40|} OutVars{#valid=|v_#valid_51|, ULTIMATE.start_main_#t~nondet15=|v_ULTIMATE.start_main_#t~nondet15_4|, #memory_int=|v_#memory_int_31|, ULTIMATE.start_main_~y~0.base=v_ULTIMATE.start_main_~y~0.base_30, ULTIMATE.start_main_~y~0.offset=v_ULTIMATE.start_main_~y~0.offset_22, #length=|v_#length_40|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet15, #memory_int] 34#L9-2true [2020-07-01 13:11:10,658 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 13:11:10,658 INFO L82 PathProgramCache]: Analyzing trace with hash 4955, now seen corresponding path program 1 times [2020-07-01 13:11:10,659 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 13:11:10,659 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [319779459] [2020-07-01 13:11:10,659 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 13:11:10,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 13:11:10,683 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 13:11:10,684 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [319779459] [2020-07-01 13:11:10,684 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-01 13:11:10,684 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-07-01 13:11:10,684 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1980953419] [2020-07-01 13:11:10,685 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-07-01 13:11:10,685 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 13:11:10,686 INFO L82 PathProgramCache]: Analyzing trace with hash -1059781029, now seen corresponding path program 1 times [2020-07-01 13:11:10,686 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 13:11:10,686 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [192559748] [2020-07-01 13:11:10,686 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 13:11:10,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 13:11:10,707 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 13:11:10,707 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [192559748] [2020-07-01 13:11:10,707 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-01 13:11:10,707 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-01 13:11:10,708 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [481513153] [2020-07-01 13:11:10,708 INFO L811 eck$LassoCheckResult]: loop already infeasible [2020-07-01 13:11:10,709 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 13:11:10,709 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-01 13:11:10,710 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 13:11:10,710 INFO L87 Difference]: Start difference. First operand 57 states. Second operand 3 states. [2020-07-01 13:11:10,810 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 13:11:10,811 INFO L93 Difference]: Finished difference Result 57 states and 96 transitions. [2020-07-01 13:11:10,811 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-01 13:11:10,813 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer has thrown an exception: java.lang.AssertionError: unknown kind of automaton at de.uni_freiburg.informatik.ultimate.automata.AutomatonDefinitionPrinter.printAutomaton(AutomatonDefinitionPrinter.java:349) at de.uni_freiburg.informatik.ultimate.automata.AutomatonDefinitionPrinter.toString(AutomatonDefinitionPrinter.java:186) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.TermcompProofBenchmark.reportFiniteModule(TermcompProofBenchmark.java:61) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiCegarLoop.refineFinite(BuchiCegarLoop.java:978) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiCegarLoop.iterate(BuchiCegarLoop.java:532) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver.doTerminationAnalysis(BuchiAutomizerObserver.java:141) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver.finish(BuchiAutomizerObserver.java:380) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:317) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) [2020-07-01 13:11:10,818 INFO L168 Benchmark]: Toolchain (without parser) took 2516.79 ms. Allocated memory was 649.6 MB in the beginning and 692.6 MB in the end (delta: 43.0 MB). Free memory was 561.7 MB in the beginning and 430.7 MB in the end (delta: 131.0 MB). Peak memory consumption was 174.0 MB. Max. memory is 50.3 GB. [2020-07-01 13:11:10,818 INFO L168 Benchmark]: CDTParser took 0.17 ms. Allocated memory is still 649.6 MB. Free memory is still 583.3 MB. There was no memory consumed. Max. memory is 50.3 GB. [2020-07-01 13:11:10,819 INFO L168 Benchmark]: CACSL2BoogieTranslator took 312.64 ms. Allocated memory was 649.6 MB in the beginning and 692.6 MB in the end (delta: 43.0 MB). Free memory was 561.7 MB in the beginning and 654.5 MB in the end (delta: -92.8 MB). Peak memory consumption was 28.7 MB. Max. memory is 50.3 GB. [2020-07-01 13:11:10,820 INFO L168 Benchmark]: Boogie Procedure Inliner took 40.98 ms. Allocated memory is still 692.6 MB. Free memory was 654.5 MB in the beginning and 653.2 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 50.3 GB. [2020-07-01 13:11:10,820 INFO L168 Benchmark]: Boogie Preprocessor took 24.70 ms. Allocated memory is still 692.6 MB. Free memory was 653.2 MB in the beginning and 651.8 MB in the end (delta: 1.4 MB). Peak memory consumption was 1.4 MB. Max. memory is 50.3 GB. [2020-07-01 13:11:10,821 INFO L168 Benchmark]: RCFGBuilder took 409.15 ms. Allocated memory is still 692.6 MB. Free memory was 650.4 MB in the beginning and 622.5 MB in the end (delta: 27.9 MB). Peak memory consumption was 27.9 MB. Max. memory is 50.3 GB. [2020-07-01 13:11:10,821 INFO L168 Benchmark]: BlockEncodingV2 took 156.83 ms. Allocated memory is still 692.6 MB. Free memory was 622.5 MB in the beginning and 610.4 MB in the end (delta: 12.1 MB). Peak memory consumption was 12.1 MB. Max. memory is 50.3 GB. [2020-07-01 13:11:10,822 INFO L168 Benchmark]: TraceAbstraction took 1351.22 ms. Allocated memory is still 692.6 MB. Free memory was 609.0 MB in the beginning and 459.1 MB in the end (delta: 150.0 MB). Peak memory consumption was 150.0 MB. Max. memory is 50.3 GB. [2020-07-01 13:11:10,822 INFO L168 Benchmark]: BuchiAutomizer took 215.07 ms. Allocated memory is still 692.6 MB. Free memory was 459.1 MB in the beginning and 430.7 MB in the end (delta: 28.4 MB). Peak memory consumption was 28.4 MB. Max. memory is 50.3 GB. [2020-07-01 13:11:10,826 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.plugins.blockencoding: - StatisticsResult: Initial Icfg 67 locations, 72 edges - StatisticsResult: Encoded RCFG 57 locations, 99 edges * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.17 ms. Allocated memory is still 649.6 MB. Free memory is still 583.3 MB. There was no memory consumed. Max. memory is 50.3 GB. * CACSL2BoogieTranslator took 312.64 ms. Allocated memory was 649.6 MB in the beginning and 692.6 MB in the end (delta: 43.0 MB). Free memory was 561.7 MB in the beginning and 654.5 MB in the end (delta: -92.8 MB). Peak memory consumption was 28.7 MB. Max. memory is 50.3 GB. * Boogie Procedure Inliner took 40.98 ms. Allocated memory is still 692.6 MB. Free memory was 654.5 MB in the beginning and 653.2 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 50.3 GB. * Boogie Preprocessor took 24.70 ms. Allocated memory is still 692.6 MB. Free memory was 653.2 MB in the beginning and 651.8 MB in the end (delta: 1.4 MB). Peak memory consumption was 1.4 MB. Max. memory is 50.3 GB. * RCFGBuilder took 409.15 ms. Allocated memory is still 692.6 MB. Free memory was 650.4 MB in the beginning and 622.5 MB in the end (delta: 27.9 MB). Peak memory consumption was 27.9 MB. Max. memory is 50.3 GB. * BlockEncodingV2 took 156.83 ms. Allocated memory is still 692.6 MB. Free memory was 622.5 MB in the beginning and 610.4 MB in the end (delta: 12.1 MB). Peak memory consumption was 12.1 MB. Max. memory is 50.3 GB. * TraceAbstraction took 1351.22 ms. Allocated memory is still 692.6 MB. Free memory was 609.0 MB in the beginning and 459.1 MB in the end (delta: 150.0 MB). Peak memory consumption was 150.0 MB. Max. memory is 50.3 GB. * BuchiAutomizer took 215.07 ms. Allocated memory is still 692.6 MB. Free memory was 459.1 MB in the beginning and 430.7 MB in the end (delta: 28.4 MB). Peak memory consumption was 28.4 MB. Max. memory is 50.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #StackHeapBarrier - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #StackHeapBarrier * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 8]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 18]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 18]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 8]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 18]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 17]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 10]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 8]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 8]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 18]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 10]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 20]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 10]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 22]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 10]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 22]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 20]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 11]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 20]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 11]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 20]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 13]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 11]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 11]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 13]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 13]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 13]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 15]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 15]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 17]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 17]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 17]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - AllSpecificationsHoldResult: All specifications hold 32 specifications checked. All of them hold - InvariantResult [Line: 8]: Loop Invariant [2020-07-01 13:11:10,836 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 13:11:10,836 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 13:11:10,837 WARN L1295 BoogieBacktranslator]: unknown boogie variable #StackHeapBarrier [2020-07-01 13:11:10,838 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 13:11:10,838 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 13:11:10,838 WARN L1295 BoogieBacktranslator]: unknown boogie variable #StackHeapBarrier Derived loop invariant: (((((4 == unknown-#length-unknown[y] && \valid[x] == 1) && 0 == y) && unknown-#length-unknown[x] == 4) && 1 <= unknown-#StackHeapBarrier-unknown) && 1 == \valid[y]) && 0 == x - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 57 locations, 32 error locations. Started 1 CEGAR loops. VerificationResult: SAFE, OverallTime: 1.2s, OverallIterations: 6, TraceHistogramMax: 1, AutomataDifference: 0.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 66 SDtfs, 375 SDslu, 3 SDs, 0 SdLazy, 328 SolverSat, 61 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 12 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=57occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 6 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 1 LocationsWithAnnotation, 1 PreInvPairs, 2 NumberOfFragments, 30 HoareAnnotationTreeSize, 1 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 1 FomulaSimplificationsInter, 0 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.1s InterpolantComputationTime, 24 NumberOfCodeBlocks, 24 NumberOfCodeBlocksAsserted, 6 NumberOfCheckSat, 18 ConstructedInterpolants, 0 QuantifiedInterpolants, 338 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 6 InterpolantComputations, 6 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer: - ExceptionOrErrorResult: AssertionError: unknown kind of automaton de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer: AssertionError: unknown kind of automaton: de.uni_freiburg.informatik.ultimate.automata.AutomatonDefinitionPrinter.printAutomaton(AutomatonDefinitionPrinter.java:349) RESULT: Ultimate could not prove your program: Toolchain returned no result. !SESSION 2020-07-01 13:11:05.032 ----------------------------------------------- eclipse.buildId=unknown java.version=1.8.0_242 java.vendor=Oracle Corporation BootLoader constants: OS=linux, ARCH=x86_64, WS=gtk, NL=en_US Framework arguments: -tc ./../AutomizerAndBuchiAutomizerCInlineWithBlockEncoding.xml -s ./../termcomp2017.epf -i /export/starexec/sandbox2/benchmark/theBenchmark.c Command-line arguments: -os linux -ws gtk -arch x86_64 -consoleLog -data @user.home/.ultimate -tc ./../AutomizerAndBuchiAutomizerCInlineWithBlockEncoding.xml -s ./../termcomp2017.epf -data /export/starexec/sandbox2/tmp/BenchExec_run_fFrsIr/tmp -i /export/starexec/sandbox2/benchmark/theBenchmark.c !ENTRY org.eclipse.core.resources 2 10035 2020-07-01 13:11:11.064 !MESSAGE The workspace will exit with unsaved changes in this session. Received shutdown request... Ultimate: GTK+ Version Check