/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:02:51,489 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-01 13:02:51,491 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-01 13:02:51,502 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-01 13:02:51,503 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-01 13:02:51,504 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-01 13:02:51,505 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-01 13:02:51,506 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-01 13:02:51,508 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-01 13:02:51,509 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-01 13:02:51,509 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-01 13:02:51,510 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-01 13:02:51,511 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-01 13:02:51,512 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-01 13:02:51,513 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-01 13:02:51,514 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-01 13:02:51,514 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-01 13:02:51,515 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-01 13:02:51,517 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-01 13:02:51,519 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-01 13:02:51,520 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-01 13:02:51,521 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-01 13:02:51,522 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-01 13:02:51,523 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-01 13:02:51,525 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-01 13:02:51,525 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-01 13:02:51,526 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-01 13:02:51,526 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-01 13:02:51,527 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-01 13:02:51,528 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-01 13:02:51,528 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-01 13:02:51,528 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-01 13:02:51,529 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-01 13:02:51,530 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-01 13:02:51,531 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-01 13:02:51,531 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-01 13:02:51,531 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-01 13:02:51,532 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-01 13:02:51,532 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-01 13:02:51,533 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-01 13:02:51,533 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-01 13:02:51,534 INFO L101 SettingsManager]: Beginning loading settings from /export/starexec/sandbox2/solver/bin/./../termcomp2017.epf [2020-07-01 13:02:51,548 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-01 13:02:51,549 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-01 13:02:51,550 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-07-01 13:02:51,550 INFO L138 SettingsManager]: * Rewrite not-equals=true [2020-07-01 13:02:51,550 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-07-01 13:02:51,550 INFO L138 SettingsManager]: * Minimize states using LBE with the strategy=SINGLE [2020-07-01 13:02:51,550 INFO L138 SettingsManager]: * Use SBE=true [2020-07-01 13:02:51,551 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2020-07-01 13:02:51,551 INFO L138 SettingsManager]: * Use old map elimination=false [2020-07-01 13:02:51,551 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2020-07-01 13:02:51,551 INFO L138 SettingsManager]: * Buchi interpolant automaton construction strategy=DANDELION [2020-07-01 13:02:51,551 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2020-07-01 13:02:51,551 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2020-07-01 13:02:51,552 INFO L138 SettingsManager]: * Construct termination proof for TermComp=true [2020-07-01 13:02:51,552 INFO L138 SettingsManager]: * Command for external solver (GNTA synthesis)=z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-07-01 13:02:51,552 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-01 13:02:51,552 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2020-07-01 13:02:51,552 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-01 13:02:51,552 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-01 13:02:51,553 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2020-07-01 13:02:51,553 INFO L138 SettingsManager]: * How to treat unsigned ints differently from normal ones=IGNORE [2020-07-01 13:02:51,553 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-01 13:02:51,553 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-07-01 13:02:51,553 INFO L138 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2020-07-01 13:02:51,553 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:5000 [2020-07-01 13:02:51,554 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-01 13:02:51,554 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-07-01 13:02:51,554 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-07-01 13:02:51,554 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-07-01 13:02:51,719 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-01 13:02:51,733 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-01 13:02:51,736 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-01 13:02:51,738 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-01 13:02:51,738 INFO L275 PluginConnector]: CDTParser initialized [2020-07-01 13:02:51,739 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /export/starexec/sandbox2/benchmark/theBenchmark.c [2020-07-01 13:02:51,804 INFO L220 CDTParser]: Created temporary CDT project at /export/starexec/sandbox2/tmp/BenchExec_run_EwxMZs/tmp/e3961b9c1363497bb9c0b2837ff28d10/FLAG98d739692 [2020-07-01 13:02:52,162 INFO L306 CDTParser]: Found 1 translation units. [2020-07-01 13:02:52,162 INFO L160 CDTParser]: Scanning /export/starexec/sandbox2/benchmark/theBenchmark.c [2020-07-01 13:02:52,163 WARN L117 ultiparseSymbolTable]: System include stdlib.h could not be resolved by CDT -- only built-in system includes are available. [2020-07-01 13:02:52,169 INFO L349 CDTParser]: About to delete temporary CDT project at /export/starexec/sandbox2/tmp/BenchExec_run_EwxMZs/tmp/e3961b9c1363497bb9c0b2837ff28d10/FLAG98d739692 [2020-07-01 13:02:52,552 INFO L357 CDTParser]: Successfully deleted /export/starexec/sandbox2/tmp/BenchExec_run_EwxMZs/tmp/e3961b9c1363497bb9c0b2837ff28d10 [2020-07-01 13:02:52,563 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-01 13:02:52,564 INFO L131 ToolchainWalker]: Walking toolchain with 7 elements. [2020-07-01 13:02:52,565 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-01 13:02:52,565 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-01 13:02:52,569 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-01 13:02:52,570 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.07 01:02:52" (1/1) ... [2020-07-01 13:02:52,573 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4866e661 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 01:02:52, skipping insertion in model container [2020-07-01 13:02:52,573 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.07 01:02:52" (1/1) ... [2020-07-01 13:02:52,581 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-01 13:02:52,598 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-01 13:02:52,823 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-01 13:02:52,835 INFO L203 MainTranslator]: Completed pre-run [2020-07-01 13:02:52,853 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-01 13:02:52,868 INFO L208 MainTranslator]: Completed translation [2020-07-01 13:02:52,869 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 01:02:52 WrapperNode [2020-07-01 13:02:52,869 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-01 13:02:52,870 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-07-01 13:02:52,870 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-07-01 13:02:52,870 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-07-01 13:02:52,879 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:02:52" (1/1) ... [2020-07-01 13:02:52,888 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:02:52" (1/1) ... [2020-07-01 13:02:52,911 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-07-01 13:02:52,912 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-01 13:02:52,912 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-01 13:02:52,912 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-01 13:02:52,922 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 01:02:52" (1/1) ... [2020-07-01 13:02:52,922 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 01:02:52" (1/1) ... [2020-07-01 13:02:52,924 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 01:02:52" (1/1) ... [2020-07-01 13:02:52,924 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 01:02:52" (1/1) ... [2020-07-01 13:02:52,929 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 01:02:52" (1/1) ... [2020-07-01 13:02:52,933 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 01:02:52" (1/1) ... [2020-07-01 13:02:52,935 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 01:02:52" (1/1) ... [2020-07-01 13:02:52,937 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-01 13:02:52,937 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-01 13:02:52,937 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-01 13:02:52,938 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-01 13:02:52,939 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 01:02:52" (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:02:53,011 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-07-01 13:02:53,011 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-01 13:02:53,012 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-01 13:02:53,012 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-07-01 13:02:53,012 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-07-01 13:02:53,012 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-07-01 13:02:53,356 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-01 13:02:53,356 INFO L295 CfgBuilder]: Removed 8 assume(true) statements. [2020-07-01 13:02:53,361 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.07 01:02:53 BoogieIcfgContainer [2020-07-01 13:02:53,361 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-01 13:02:53,362 INFO L113 PluginConnector]: ------------------------BlockEncodingV2---------------------------- [2020-07-01 13:02:53,362 INFO L271 PluginConnector]: Initializing BlockEncodingV2... [2020-07-01 13:02:53,364 INFO L275 PluginConnector]: BlockEncodingV2 initialized [2020-07-01 13:02:53,365 INFO L185 PluginConnector]: Executing the observer BlockEncodingObserver from plugin BlockEncodingV2 for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.07 01:02:53" (1/1) ... [2020-07-01 13:02:53,380 INFO L313 BlockEncoder]: Initial Icfg 62 locations, 67 edges [2020-07-01 13:02:53,382 INFO L258 BlockEncoder]: Using Remove infeasible edges [2020-07-01 13:02:53,382 INFO L263 BlockEncoder]: Using Maximize final states [2020-07-01 13:02:53,383 INFO L270 BlockEncoder]: Using Minimize states even if more edges are added than removed.=false [2020-07-01 13:02:53,383 INFO L276 BlockEncoder]: Using Minimize states using LBE with the strategy=SINGLE [2020-07-01 13:02:53,385 INFO L296 BlockEncoder]: Using Remove sink states [2020-07-01 13:02:53,386 INFO L171 BlockEncoder]: Using Apply optimizations until nothing changes=true [2020-07-01 13:02:53,386 INFO L179 BlockEncoder]: Using Rewrite not-equals [2020-07-01 13:02:53,415 INFO L185 BlockEncoder]: Using Use SBE [2020-07-01 13:02:53,464 INFO L200 BlockEncoder]: SBE split 35 edges [2020-07-01 13:02:53,469 INFO L70 emoveInfeasibleEdges]: Removed 2 edges and 0 locations because of local infeasibility [2020-07-01 13:02:53,471 INFO L71 MaximizeFinalStates]: 0 new accepting states [2020-07-01 13:02:53,510 INFO L100 BaseMinimizeStates]: Removed 16 edges and 8 locations by large block encoding [2020-07-01 13:02:53,513 INFO L70 RemoveSinkStates]: Removed 1 edges and 1 locations by removing sink states [2020-07-01 13:02:53,514 INFO L70 emoveInfeasibleEdges]: Removed 0 edges and 0 locations because of local infeasibility [2020-07-01 13:02:53,515 INFO L71 MaximizeFinalStates]: 0 new accepting states [2020-07-01 13:02:53,515 INFO L100 BaseMinimizeStates]: Removed 0 edges and 0 locations by large block encoding [2020-07-01 13:02:53,516 INFO L70 RemoveSinkStates]: Removed 0 edges and 0 locations by removing sink states [2020-07-01 13:02:53,516 INFO L313 BlockEncoder]: Encoded RCFG 53 locations, 135 edges [2020-07-01 13:02:53,517 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 01.07 01:02:53 BasicIcfg [2020-07-01 13:02:53,517 INFO L132 PluginConnector]: ------------------------ END BlockEncodingV2---------------------------- [2020-07-01 13:02:53,518 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-07-01 13:02:53,518 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-07-01 13:02:53,522 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-07-01 13:02:53,522 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 01.07 01:02:52" (1/4) ... [2020-07-01 13:02:53,523 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@70682307 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 01.07 01:02:53, skipping insertion in model container [2020-07-01 13:02:53,523 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 01:02:52" (2/4) ... [2020-07-01 13:02:53,523 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@70682307 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 01.07 01:02:53, skipping insertion in model container [2020-07-01 13:02:53,523 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.07 01:02:53" (3/4) ... [2020-07-01 13:02:53,524 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@70682307 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 01.07 01:02:53, skipping insertion in model container [2020-07-01 13:02:53,524 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 01.07 01:02:53" (4/4) ... [2020-07-01 13:02:53,526 INFO L109 eAbstractionObserver]: Analyzing ICFG theBenchmark.c_BEv2 [2020-07-01 13:02:53,536 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:ForwardPredicates Determinization: PREDICATE_ABSTRACTION [2020-07-01 13:02:53,544 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 30 error locations. [2020-07-01 13:02:53,558 INFO L251 AbstractCegarLoop]: Starting to check reachability of 30 error locations. [2020-07-01 13:02:53,582 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-07-01 13:02:53,582 INFO L376 AbstractCegarLoop]: Hoare is true [2020-07-01 13:02:53,582 INFO L377 AbstractCegarLoop]: Compute interpolants for ForwardPredicates [2020-07-01 13:02:53,582 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-01 13:02:53,582 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-01 13:02:53,582 INFO L380 AbstractCegarLoop]: Difference is false [2020-07-01 13:02:53,583 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-01 13:02:53,583 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-07-01 13:02:53,598 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states. [2020-07-01 13:02:53,604 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2020-07-01 13:02:53,604 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 13:02:53,605 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1] [2020-07-01 13:02:53,605 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.startErr5REQUIRES_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:02:53,611 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 13:02:53,611 INFO L82 PathProgramCache]: Analyzing trace with hash 147523, now seen corresponding path program 1 times [2020-07-01 13:02:53,621 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 13:02:53,622 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [607286879] [2020-07-01 13:02:53,622 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 13:02:53,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 13:02:53,781 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:02:53,782 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [607286879] [2020-07-01 13:02:53,783 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-01 13:02:53,783 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-07-01 13:02:53,784 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [859206281] [2020-07-01 13:02:53,789 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-01 13:02:53,789 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 13:02:53,803 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-01 13:02:53,804 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 13:02:53,806 INFO L87 Difference]: Start difference. First operand 53 states. Second operand 3 states. [2020-07-01 13:02:54,064 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 13:02:54,065 INFO L93 Difference]: Finished difference Result 104 states and 253 transitions. [2020-07-01 13:02:54,065 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-01 13:02:54,067 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2020-07-01 13:02:54,067 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 13:02:54,081 INFO L225 Difference]: With dead ends: 104 [2020-07-01 13:02:54,081 INFO L226 Difference]: Without dead ends: 53 [2020-07-01 13:02:54,084 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:02:54,102 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2020-07-01 13:02:54,122 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2020-07-01 13:02:54,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2020-07-01 13:02:54,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 90 transitions. [2020-07-01 13:02:54,126 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 90 transitions. Word has length 3 [2020-07-01 13:02:54,126 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 13:02:54,126 INFO L479 AbstractCegarLoop]: Abstraction has 53 states and 90 transitions. [2020-07-01 13:02:54,127 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-01 13:02:54,127 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 90 transitions. [2020-07-01 13:02:54,127 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2020-07-01 13:02:54,127 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 13:02:54,127 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1] [2020-07-01 13:02:54,129 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-07-01 13:02:54,129 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.startErr5REQUIRES_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:02:54,129 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 13:02:54,130 INFO L82 PathProgramCache]: Analyzing trace with hash 147771, now seen corresponding path program 1 times [2020-07-01 13:02:54,130 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 13:02:54,130 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1499759221] [2020-07-01 13:02:54,130 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 13:02:54,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 13:02:54,196 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:02:54,197 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1499759221] [2020-07-01 13:02:54,197 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-01 13:02:54,197 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-07-01 13:02:54,197 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [838606863] [2020-07-01 13:02:54,199 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-01 13:02:54,199 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 13:02:54,200 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-01 13:02:54,200 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 13:02:54,200 INFO L87 Difference]: Start difference. First operand 53 states and 90 transitions. Second operand 3 states. [2020-07-01 13:02:54,332 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 13:02:54,333 INFO L93 Difference]: Finished difference Result 53 states and 90 transitions. [2020-07-01 13:02:54,355 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-01 13:02:54,355 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2020-07-01 13:02:54,356 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 13:02:54,357 INFO L225 Difference]: With dead ends: 53 [2020-07-01 13:02:54,357 INFO L226 Difference]: Without dead ends: 51 [2020-07-01 13:02:54,358 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:02:54,358 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2020-07-01 13:02:54,363 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2020-07-01 13:02:54,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2020-07-01 13:02:54,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 86 transitions. [2020-07-01 13:02:54,365 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 86 transitions. Word has length 3 [2020-07-01 13:02:54,365 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 13:02:54,365 INFO L479 AbstractCegarLoop]: Abstraction has 51 states and 86 transitions. [2020-07-01 13:02:54,365 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-01 13:02:54,365 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 86 transitions. [2020-07-01 13:02:54,366 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2020-07-01 13:02:54,366 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 13:02:54,366 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1] [2020-07-01 13:02:54,366 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-07-01 13:02:54,366 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.startErr5REQUIRES_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:02:54,367 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 13:02:54,367 INFO L82 PathProgramCache]: Analyzing trace with hash 147773, now seen corresponding path program 1 times [2020-07-01 13:02:54,367 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 13:02:54,367 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [493765316] [2020-07-01 13:02:54,367 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 13:02:54,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 13:02:54,413 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:02:54,414 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [493765316] [2020-07-01 13:02:54,414 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-01 13:02:54,414 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-07-01 13:02:54,414 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1157025438] [2020-07-01 13:02:54,415 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-01 13:02:54,415 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 13:02:54,415 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-01 13:02:54,415 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 13:02:54,415 INFO L87 Difference]: Start difference. First operand 51 states and 86 transitions. Second operand 3 states. [2020-07-01 13:02:54,559 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 13:02:54,560 INFO L93 Difference]: Finished difference Result 51 states and 86 transitions. [2020-07-01 13:02:54,560 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-01 13:02:54,560 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2020-07-01 13:02:54,561 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 13:02:54,562 INFO L225 Difference]: With dead ends: 51 [2020-07-01 13:02:54,562 INFO L226 Difference]: Without dead ends: 49 [2020-07-01 13:02:54,563 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:02:54,563 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2020-07-01 13:02:54,568 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2020-07-01 13:02:54,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2020-07-01 13:02:54,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 82 transitions. [2020-07-01 13:02:54,569 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 82 transitions. Word has length 3 [2020-07-01 13:02:54,569 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 13:02:54,570 INFO L479 AbstractCegarLoop]: Abstraction has 49 states and 82 transitions. [2020-07-01 13:02:54,570 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-01 13:02:54,570 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 82 transitions. [2020-07-01 13:02:54,570 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2020-07-01 13:02:54,570 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 13:02:54,570 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2020-07-01 13:02:54,571 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-07-01 13:02:54,571 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.startErr5REQUIRES_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:02:54,571 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 13:02:54,572 INFO L82 PathProgramCache]: Analyzing trace with hash 4578202, now seen corresponding path program 1 times [2020-07-01 13:02:54,572 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 13:02:54,572 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1190388411] [2020-07-01 13:02:54,572 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 13:02:54,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 13:02:54,609 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:02:54,610 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1190388411] [2020-07-01 13:02:54,610 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-01 13:02:54,610 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-07-01 13:02:54,610 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1821525652] [2020-07-01 13:02:54,611 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-01 13:02:54,611 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 13:02:54,612 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-01 13:02:54,612 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 13:02:54,612 INFO L87 Difference]: Start difference. First operand 49 states and 82 transitions. Second operand 3 states. [2020-07-01 13:02:54,749 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 13:02:54,749 INFO L93 Difference]: Finished difference Result 49 states and 82 transitions. [2020-07-01 13:02:54,751 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-01 13:02:54,751 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 4 [2020-07-01 13:02:54,752 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 13:02:54,752 INFO L225 Difference]: With dead ends: 49 [2020-07-01 13:02:54,753 INFO L226 Difference]: Without dead ends: 48 [2020-07-01 13:02:54,753 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:02:54,753 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2020-07-01 13:02:54,758 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2020-07-01 13:02:54,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2020-07-01 13:02:54,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 80 transitions. [2020-07-01 13:02:54,759 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 80 transitions. Word has length 4 [2020-07-01 13:02:54,759 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 13:02:54,759 INFO L479 AbstractCegarLoop]: Abstraction has 48 states and 80 transitions. [2020-07-01 13:02:54,759 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-01 13:02:54,760 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 80 transitions. [2020-07-01 13:02:54,760 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2020-07-01 13:02:54,760 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 13:02:54,761 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2020-07-01 13:02:54,761 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-07-01 13:02:54,761 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.startErr5REQUIRES_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:02:54,761 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 13:02:54,761 INFO L82 PathProgramCache]: Analyzing trace with hash 4578204, now seen corresponding path program 1 times [2020-07-01 13:02:54,762 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 13:02:54,762 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [462253826] [2020-07-01 13:02:54,762 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 13:02:54,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 13:02:54,806 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:02:54,806 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [462253826] [2020-07-01 13:02:54,807 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-01 13:02:54,807 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-07-01 13:02:54,807 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [640244906] [2020-07-01 13:02:54,807 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-01 13:02:54,808 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 13:02:54,808 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-01 13:02:54,808 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 13:02:54,808 INFO L87 Difference]: Start difference. First operand 48 states and 80 transitions. Second operand 3 states. [2020-07-01 13:02:54,918 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 13:02:54,919 INFO L93 Difference]: Finished difference Result 48 states and 80 transitions. [2020-07-01 13:02:54,919 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-01 13:02:54,919 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 4 [2020-07-01 13:02:54,920 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 13:02:54,921 INFO L225 Difference]: With dead ends: 48 [2020-07-01 13:02:54,921 INFO L226 Difference]: Without dead ends: 47 [2020-07-01 13:02:54,921 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:02:54,922 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2020-07-01 13:02:54,926 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2020-07-01 13:02:54,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2020-07-01 13:02:54,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 78 transitions. [2020-07-01 13:02:54,927 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 78 transitions. Word has length 4 [2020-07-01 13:02:54,927 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 13:02:54,927 INFO L479 AbstractCegarLoop]: Abstraction has 47 states and 78 transitions. [2020-07-01 13:02:54,927 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-01 13:02:54,928 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 78 transitions. [2020-07-01 13:02:54,928 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2020-07-01 13:02:54,928 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 13:02:54,928 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2020-07-01 13:02:54,928 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-07-01 13:02:54,929 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.startErr5REQUIRES_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:02:54,929 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 13:02:54,929 INFO L82 PathProgramCache]: Analyzing trace with hash 141921257, now seen corresponding path program 1 times [2020-07-01 13:02:54,930 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 13:02:54,930 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1592365884] [2020-07-01 13:02:54,930 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 13:02:54,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 13:02:54,965 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:02:54,965 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1592365884] [2020-07-01 13:02:54,966 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-01 13:02:54,966 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-07-01 13:02:54,966 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [931822799] [2020-07-01 13:02:54,967 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-01 13:02:54,967 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 13:02:54,967 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-01 13:02:54,967 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 13:02:54,968 INFO L87 Difference]: Start difference. First operand 47 states and 78 transitions. Second operand 3 states. [2020-07-01 13:02:55,065 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 13:02:55,065 INFO L93 Difference]: Finished difference Result 47 states and 78 transitions. [2020-07-01 13:02:55,065 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-01 13:02:55,066 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2020-07-01 13:02:55,066 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 13:02:55,067 INFO L225 Difference]: With dead ends: 47 [2020-07-01 13:02:55,067 INFO L226 Difference]: Without dead ends: 40 [2020-07-01 13:02:55,068 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:02:55,068 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2020-07-01 13:02:55,072 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2020-07-01 13:02:55,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2020-07-01 13:02:55,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 64 transitions. [2020-07-01 13:02:55,073 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 64 transitions. Word has length 5 [2020-07-01 13:02:55,073 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 13:02:55,073 INFO L479 AbstractCegarLoop]: Abstraction has 40 states and 64 transitions. [2020-07-01 13:02:55,073 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-01 13:02:55,073 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 64 transitions. [2020-07-01 13:02:55,074 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2020-07-01 13:02:55,074 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 13:02:55,074 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2020-07-01 13:02:55,074 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-07-01 13:02:55,074 INFO L427 AbstractCegarLoop]: === Iteration 7 === [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.startErr5REQUIRES_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:02:55,074 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 13:02:55,074 INFO L82 PathProgramCache]: Analyzing trace with hash 141921259, now seen corresponding path program 1 times [2020-07-01 13:02:55,075 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 13:02:55,075 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [274345890] [2020-07-01 13:02:55,075 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 13:02:55,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 13:02:55,111 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:02:55,112 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [274345890] [2020-07-01 13:02:55,112 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-01 13:02:55,112 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-07-01 13:02:55,112 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1336795333] [2020-07-01 13:02:55,113 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-01 13:02:55,113 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 13:02:55,113 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-01 13:02:55,113 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 13:02:55,113 INFO L87 Difference]: Start difference. First operand 40 states and 64 transitions. Second operand 3 states. [2020-07-01 13:02:55,192 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 13:02:55,192 INFO L93 Difference]: Finished difference Result 40 states and 64 transitions. [2020-07-01 13:02:55,193 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-01 13:02:55,193 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2020-07-01 13:02:55,193 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 13:02:55,193 INFO L225 Difference]: With dead ends: 40 [2020-07-01 13:02:55,194 INFO L226 Difference]: Without dead ends: 33 [2020-07-01 13:02:55,194 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:02:55,194 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2020-07-01 13:02:55,198 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2020-07-01 13:02:55,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2020-07-01 13:02:55,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 50 transitions. [2020-07-01 13:02:55,199 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 50 transitions. Word has length 5 [2020-07-01 13:02:55,199 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 13:02:55,199 INFO L479 AbstractCegarLoop]: Abstraction has 33 states and 50 transitions. [2020-07-01 13:02:55,200 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-01 13:02:55,200 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 50 transitions. [2020-07-01 13:02:55,200 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2020-07-01 13:02:55,200 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 13:02:55,200 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2020-07-01 13:02:55,200 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-07-01 13:02:55,201 INFO L427 AbstractCegarLoop]: === Iteration 8 === [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.startErr5REQUIRES_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:02:55,201 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 13:02:55,201 INFO L82 PathProgramCache]: Analyzing trace with hash 104589291, now seen corresponding path program 1 times [2020-07-01 13:02:55,201 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 13:02:55,201 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [491005434] [2020-07-01 13:02:55,202 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 13:02:55,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 13:02:55,236 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:02:55,236 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [491005434] [2020-07-01 13:02:55,236 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-01 13:02:55,236 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-07-01 13:02:55,237 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [141990368] [2020-07-01 13:02:55,237 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-01 13:02:55,237 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 13:02:55,237 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-01 13:02:55,238 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 13:02:55,238 INFO L87 Difference]: Start difference. First operand 33 states and 50 transitions. Second operand 3 states. [2020-07-01 13:02:55,323 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 13:02:55,323 INFO L93 Difference]: Finished difference Result 33 states and 50 transitions. [2020-07-01 13:02:55,324 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-01 13:02:55,324 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 6 [2020-07-01 13:02:55,324 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 13:02:55,324 INFO L225 Difference]: With dead ends: 33 [2020-07-01 13:02:55,325 INFO L226 Difference]: Without dead ends: 28 [2020-07-01 13:02:55,325 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:02:55,325 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2020-07-01 13:02:55,329 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2020-07-01 13:02:55,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2020-07-01 13:02:55,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 40 transitions. [2020-07-01 13:02:55,329 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 40 transitions. Word has length 6 [2020-07-01 13:02:55,330 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 13:02:55,330 INFO L479 AbstractCegarLoop]: Abstraction has 28 states and 40 transitions. [2020-07-01 13:02:55,330 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-01 13:02:55,330 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 40 transitions. [2020-07-01 13:02:55,330 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2020-07-01 13:02:55,330 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 13:02:55,330 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2020-07-01 13:02:55,331 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-07-01 13:02:55,331 INFO L427 AbstractCegarLoop]: === Iteration 9 === [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.startErr5REQUIRES_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:02:55,331 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 13:02:55,331 INFO L82 PathProgramCache]: Analyzing trace with hash 104589292, now seen corresponding path program 1 times [2020-07-01 13:02:55,332 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 13:02:55,332 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [588628741] [2020-07-01 13:02:55,332 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 13:02:55,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 13:02:55,359 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:02:55,359 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [588628741] [2020-07-01 13:02:55,359 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-01 13:02:55,360 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-07-01 13:02:55,360 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [919853815] [2020-07-01 13:02:55,360 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-01 13:02:55,360 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 13:02:55,361 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-01 13:02:55,361 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 13:02:55,361 INFO L87 Difference]: Start difference. First operand 28 states and 40 transitions. Second operand 3 states. [2020-07-01 13:02:55,396 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 13:02:55,397 INFO L93 Difference]: Finished difference Result 33 states and 40 transitions. [2020-07-01 13:02:55,397 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-01 13:02:55,397 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 6 [2020-07-01 13:02:55,397 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 13:02:55,398 INFO L225 Difference]: With dead ends: 33 [2020-07-01 13:02:55,398 INFO L226 Difference]: Without dead ends: 28 [2020-07-01 13:02:55,399 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:02:55,399 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2020-07-01 13:02:55,402 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2020-07-01 13:02:55,402 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2020-07-01 13:02:55,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 35 transitions. [2020-07-01 13:02:55,403 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 35 transitions. Word has length 6 [2020-07-01 13:02:55,403 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 13:02:55,403 INFO L479 AbstractCegarLoop]: Abstraction has 28 states and 35 transitions. [2020-07-01 13:02:55,403 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-01 13:02:55,403 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 35 transitions. [2020-07-01 13:02:55,404 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2020-07-01 13:02:55,404 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 13:02:55,404 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2020-07-01 13:02:55,404 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-07-01 13:02:55,404 INFO L427 AbstractCegarLoop]: === Iteration 10 === [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.startErr5REQUIRES_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:02:55,404 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 13:02:55,405 INFO L82 PathProgramCache]: Analyzing trace with hash 104589293, now seen corresponding path program 1 times [2020-07-01 13:02:55,405 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 13:02:55,405 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1989048834] [2020-07-01 13:02:55,405 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 13:02:55,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 13:02:55,439 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:02:55,439 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1989048834] [2020-07-01 13:02:55,439 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-01 13:02:55,439 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-07-01 13:02:55,440 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1858455695] [2020-07-01 13:02:55,440 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-01 13:02:55,440 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 13:02:55,440 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-01 13:02:55,440 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 13:02:55,441 INFO L87 Difference]: Start difference. First operand 28 states and 35 transitions. Second operand 3 states. [2020-07-01 13:02:55,488 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 13:02:55,488 INFO L93 Difference]: Finished difference Result 28 states and 35 transitions. [2020-07-01 13:02:55,488 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-01 13:02:55,489 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 6 [2020-07-01 13:02:55,489 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 13:02:55,489 INFO L225 Difference]: With dead ends: 28 [2020-07-01 13:02:55,489 INFO L226 Difference]: Without dead ends: 0 [2020-07-01 13:02:55,490 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:02:55,490 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2020-07-01 13:02:55,490 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2020-07-01 13:02:55,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2020-07-01 13:02:55,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2020-07-01 13:02:55,490 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 6 [2020-07-01 13:02:55,491 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 13:02:55,491 INFO L479 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-07-01 13:02:55,491 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-01 13:02:55,491 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-01 13:02:55,491 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-01 13:02:55,491 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-07-01 13:02:55,494 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2020-07-01 13:02:55,637 INFO L264 CegarLoopResult]: At program point L27(lines 6 30) the Hoare annotation is: (and (= 4 (select |#length| ULTIMATE.start_f_~k_ref~0.base)) (= 1 (select |#valid| ULTIMATE.start_f_~l_ref~0.base)) (= 0 ULTIMATE.start_f_~i~0.offset) (= 4 (select |#length| ULTIMATE.start_f_~l_ref~0.base)) (= 0 ULTIMATE.start_f_~l_ref~0.offset) (= 1 (select |#valid| ULTIMATE.start_f_~j~0.base)) (<= 1 |#StackHeapBarrier|) (= 1 (select |#valid| ULTIMATE.start_f_~i~0.base)) (= 0 ULTIMATE.start_f_~j~0.offset) (= 4 (select |#length| ULTIMATE.start_f_~i~0.base)) (= 1 (select |#valid| ULTIMATE.start_f_~k_ref~0.base)) (= 4 (select |#length| ULTIMATE.start_f_~j~0.base)) (= 0 ULTIMATE.start_f_~k_ref~0.offset)) [2020-07-01 13:02:55,637 INFO L268 CegarLoopResult]: For program point L23(line 23) no Hoare annotation was computed. [2020-07-01 13:02:55,637 INFO L268 CegarLoopResult]: For program point L23-2(line 23) no Hoare annotation was computed. [2020-07-01 13:02:55,637 INFO L268 CegarLoopResult]: For program point L15(line 15) no Hoare annotation was computed. [2020-07-01 13:02:55,637 INFO L268 CegarLoopResult]: For program point L15-1(lines 15 21) no Hoare annotation was computed. [2020-07-01 13:02:55,637 INFO L268 CegarLoopResult]: For program point L11(line 11) no Hoare annotation was computed. [2020-07-01 13:02:55,637 INFO L268 CegarLoopResult]: For program point L11-1(line 11) no Hoare annotation was computed. [2020-07-01 13:02:55,638 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr29REQUIRES_VIOLATION(line 29) no Hoare annotation was computed. [2020-07-01 13:02:55,638 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr25REQUIRES_VIOLATION(line 24) no Hoare annotation was computed. [2020-07-01 13:02:55,638 INFO L268 CegarLoopResult]: For program point L-1(line -1) no Hoare annotation was computed. [2020-07-01 13:02:55,638 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr27REQUIRES_VIOLATION(line 29) no Hoare annotation was computed. [2020-07-01 13:02:55,638 INFO L268 CegarLoopResult]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2020-07-01 13:02:55,638 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr21REQUIRES_VIOLATION(line 23) no Hoare annotation was computed. [2020-07-01 13:02:55,638 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr23REQUIRES_VIOLATION(line 23) no Hoare annotation was computed. [2020-07-01 13:02:55,638 INFO L268 CegarLoopResult]: For program point L24(line 24) no Hoare annotation was computed. [2020-07-01 13:02:55,638 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr17REQUIRES_VIOLATION(line 17) no Hoare annotation was computed. [2020-07-01 13:02:55,639 INFO L268 CegarLoopResult]: For program point L24-1(lines 24 26) no Hoare annotation was computed. [2020-07-01 13:02:55,639 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr19REQUIRES_VIOLATION(line 22) no Hoare annotation was computed. [2020-07-01 13:02:55,639 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr13REQUIRES_VIOLATION(line 16) no Hoare annotation was computed. [2020-07-01 13:02:55,639 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr15REQUIRES_VIOLATION(line 16) no Hoare annotation was computed. [2020-07-01 13:02:55,639 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr9REQUIRES_VIOLATION(line 15) no Hoare annotation was computed. [2020-07-01 13:02:55,639 INFO L268 CegarLoopResult]: For program point L16(line 16) no Hoare annotation was computed. [2020-07-01 13:02:55,639 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr11REQUIRES_VIOLATION(line 15) no Hoare annotation was computed. [2020-07-01 13:02:55,639 INFO L268 CegarLoopResult]: For program point L16-2(line 16) no Hoare annotation was computed. [2020-07-01 13:02:55,640 INFO L268 CegarLoopResult]: For program point L12(line 12) no Hoare annotation was computed. [2020-07-01 13:02:55,640 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr5REQUIRES_VIOLATION(line 13) no Hoare annotation was computed. [2020-07-01 13:02:55,640 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr7REQUIRES_VIOLATION(line 14) no Hoare annotation was computed. [2020-07-01 13:02:55,640 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr1REQUIRES_VIOLATION(line 11) no Hoare annotation was computed. [2020-07-01 13:02:55,640 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr3REQUIRES_VIOLATION(line 12) no Hoare annotation was computed. [2020-07-01 13:02:55,640 INFO L268 CegarLoopResult]: For program point L29(line 29) no Hoare annotation was computed. [2020-07-01 13:02:55,640 INFO L264 CegarLoopResult]: At program point L25(lines 22 28) the Hoare annotation is: (and (= 4 (select |#length| ULTIMATE.start_f_~k_ref~0.base)) (= 1 (select |#valid| ULTIMATE.start_f_~l_ref~0.base)) (= 0 ULTIMATE.start_f_~i~0.offset) (= 4 (select |#length| ULTIMATE.start_f_~l_ref~0.base)) (= 0 ULTIMATE.start_f_~l_ref~0.offset) (= 1 (select |#valid| ULTIMATE.start_f_~j~0.base)) (<= 1 |#StackHeapBarrier|) (= 1 (select |#valid| ULTIMATE.start_f_~i~0.base)) (= 0 ULTIMATE.start_f_~j~0.offset) (= 4 (select |#length| ULTIMATE.start_f_~i~0.base)) (= 1 (select |#valid| ULTIMATE.start_f_~k_ref~0.base)) (= 4 (select |#length| ULTIMATE.start_f_~j~0.base)) (= 0 ULTIMATE.start_f_~k_ref~0.offset)) [2020-07-01 13:02:55,640 INFO L268 CegarLoopResult]: For program point L17(line 17) no Hoare annotation was computed. [2020-07-01 13:02:55,641 INFO L268 CegarLoopResult]: For program point L17-1(lines 17 19) no Hoare annotation was computed. [2020-07-01 13:02:55,641 INFO L268 CegarLoopResult]: For program point L13(line 13) no Hoare annotation was computed. [2020-07-01 13:02:55,641 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr26REQUIRES_VIOLATION(line 29) no Hoare annotation was computed. [2020-07-01 13:02:55,641 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr28REQUIRES_VIOLATION(line 29) no Hoare annotation was computed. [2020-07-01 13:02:55,641 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr22REQUIRES_VIOLATION(line 23) no Hoare annotation was computed. [2020-07-01 13:02:55,641 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr24REQUIRES_VIOLATION(line 24) no Hoare annotation was computed. [2020-07-01 13:02:55,641 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr18REQUIRES_VIOLATION(line 22) no Hoare annotation was computed. [2020-07-01 13:02:55,641 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr20REQUIRES_VIOLATION(line 23) no Hoare annotation was computed. [2020-07-01 13:02:55,642 INFO L264 CegarLoopResult]: At program point L22(lines 6 30) the Hoare annotation is: (and (= 4 (select |#length| ULTIMATE.start_f_~k_ref~0.base)) (= 1 (select |#valid| ULTIMATE.start_f_~l_ref~0.base)) (= 0 ULTIMATE.start_f_~i~0.offset) (= 4 (select |#length| ULTIMATE.start_f_~l_ref~0.base)) (= 0 ULTIMATE.start_f_~l_ref~0.offset) (= 1 (select |#valid| ULTIMATE.start_f_~j~0.base)) (<= 1 |#StackHeapBarrier|) (= 1 (select |#valid| ULTIMATE.start_f_~i~0.base)) (= 0 ULTIMATE.start_f_~j~0.offset) (= 4 (select |#length| ULTIMATE.start_f_~i~0.base)) (= 1 (select |#valid| ULTIMATE.start_f_~k_ref~0.base)) (= 4 (select |#length| ULTIMATE.start_f_~j~0.base)) (= 0 ULTIMATE.start_f_~k_ref~0.offset)) [2020-07-01 13:02:55,642 INFO L268 CegarLoopResult]: For program point L22-1(lines 22 28) no Hoare annotation was computed. [2020-07-01 13:02:55,642 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr14REQUIRES_VIOLATION(line 16) no Hoare annotation was computed. [2020-07-01 13:02:55,642 INFO L268 CegarLoopResult]: For program point L22-3(lines 22 28) no Hoare annotation was computed. [2020-07-01 13:02:55,642 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr16REQUIRES_VIOLATION(line 17) no Hoare annotation was computed. [2020-07-01 13:02:55,642 INFO L264 CegarLoopResult]: At program point L18(lines 15 21) the Hoare annotation is: (and (= 4 (select |#length| ULTIMATE.start_f_~k_ref~0.base)) (= 1 (select |#valid| ULTIMATE.start_f_~l_ref~0.base)) (= 0 ULTIMATE.start_f_~i~0.offset) (= 4 (select |#length| ULTIMATE.start_f_~l_ref~0.base)) (= 0 ULTIMATE.start_f_~l_ref~0.offset) (= 1 (select |#valid| ULTIMATE.start_f_~j~0.base)) (<= 1 |#StackHeapBarrier|) (= 1 (select |#valid| ULTIMATE.start_f_~i~0.base)) (= 0 ULTIMATE.start_f_~j~0.offset) (= 4 (select |#length| ULTIMATE.start_f_~i~0.base)) (= 1 (select |#valid| ULTIMATE.start_f_~k_ref~0.base)) (= 4 (select |#length| ULTIMATE.start_f_~j~0.base)) (= 0 ULTIMATE.start_f_~k_ref~0.offset)) [2020-07-01 13:02:55,642 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr10REQUIRES_VIOLATION(line 15) no Hoare annotation was computed. [2020-07-01 13:02:55,643 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr12REQUIRES_VIOLATION(line 16) no Hoare annotation was computed. [2020-07-01 13:02:55,643 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr6REQUIRES_VIOLATION(line 14) no Hoare annotation was computed. [2020-07-01 13:02:55,643 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr8REQUIRES_VIOLATION(line 15) no Hoare annotation was computed. [2020-07-01 13:02:55,643 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr2REQUIRES_VIOLATION(line 12) no Hoare annotation was computed. [2020-07-01 13:02:55,643 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr4REQUIRES_VIOLATION(line 13) no Hoare annotation was computed. [2020-07-01 13:02:55,643 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr0REQUIRES_VIOLATION(line 11) no Hoare annotation was computed. [2020-07-01 13:02:55,646 INFO L308 ceAbstractionStarter]: Did not count any witness invariants because Icfg is not BoogieIcfg [2020-07-01 13:02:55,655 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 13:02:55,657 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 13:02:55,657 WARN L1295 BoogieBacktranslator]: unknown boogie variable #StackHeapBarrier [2020-07-01 13:02:55,657 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 13:02:55,657 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 13:02:55,663 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 13:02:55,664 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 13:02:55,664 WARN L1295 BoogieBacktranslator]: unknown boogie variable #StackHeapBarrier [2020-07-01 13:02:55,664 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 13:02:55,664 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 13:02:55,666 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 13:02:55,666 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 13:02:55,667 WARN L1295 BoogieBacktranslator]: unknown boogie variable #StackHeapBarrier [2020-07-01 13:02:55,667 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 13:02:55,667 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 13:02:55,668 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 13:02:55,668 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 13:02:55,669 WARN L1295 BoogieBacktranslator]: unknown boogie variable #StackHeapBarrier [2020-07-01 13:02:55,669 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 13:02:55,669 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 13:02:55,670 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 13:02:55,670 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 13:02:55,671 WARN L1295 BoogieBacktranslator]: unknown boogie variable #StackHeapBarrier [2020-07-01 13:02:55,671 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 13:02:55,671 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 13:02:55,672 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 13:02:55,672 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 13:02:55,673 WARN L1295 BoogieBacktranslator]: unknown boogie variable #StackHeapBarrier [2020-07-01 13:02:55,673 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 13:02:55,673 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 13:02:55,674 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 13:02:55,674 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 13:02:55,674 WARN L1295 BoogieBacktranslator]: unknown boogie variable #StackHeapBarrier [2020-07-01 13:02:55,675 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 13:02:55,675 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 13:02:55,676 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 13:02:55,676 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 13:02:55,676 WARN L1295 BoogieBacktranslator]: unknown boogie variable #StackHeapBarrier [2020-07-01 13:02:55,677 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 13:02:55,677 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 13:02:55,679 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 01.07 01:02:55 BasicIcfg [2020-07-01 13:02:55,679 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-07-01 13:02:55,680 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2020-07-01 13:02:55,680 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2020-07-01 13:02:55,683 INFO L275 PluginConnector]: BuchiAutomizer initialized [2020-07-01 13:02:55,684 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-07-01 13:02:55,684 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 01.07 01:02:52" (1/5) ... [2020-07-01 13:02:55,685 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@461974f6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 01.07 01:02:55, skipping insertion in model container [2020-07-01 13:02:55,685 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-07-01 13:02:55,685 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 01:02:52" (2/5) ... [2020-07-01 13:02:55,686 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@461974f6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 01.07 01:02:55, skipping insertion in model container [2020-07-01 13:02:55,686 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-07-01 13:02:55,686 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.07 01:02:53" (3/5) ... [2020-07-01 13:02:55,686 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@461974f6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 01.07 01:02:55, skipping insertion in model container [2020-07-01 13:02:55,686 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-07-01 13:02:55,686 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 01.07 01:02:53" (4/5) ... [2020-07-01 13:02:55,687 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@461974f6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 01.07 01:02:55, skipping insertion in model container [2020-07-01 13:02:55,687 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-07-01 13:02:55,687 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 01.07 01:02:55" (5/5) ... [2020-07-01 13:02:55,688 INFO L371 chiAutomizerObserver]: Analyzing ICFG theBenchmark.c_BEv2 [2020-07-01 13:02:55,710 INFO L356 BuchiCegarLoop]: Interprodecural is true [2020-07-01 13:02:55,710 INFO L357 BuchiCegarLoop]: Hoare is true [2020-07-01 13:02:55,711 INFO L358 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2020-07-01 13:02:55,711 INFO L359 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-01 13:02:55,711 INFO L360 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-01 13:02:55,711 INFO L361 BuchiCegarLoop]: Difference is false [2020-07-01 13:02:55,711 INFO L362 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-01 13:02:55,711 INFO L365 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2020-07-01 13:02:55,715 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 53 states. [2020-07-01 13:02:55,721 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 15 [2020-07-01 13:02:55,721 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-01 13:02:55,722 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-01 13:02:55,726 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2020-07-01 13:02:55,726 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-01 13:02:55,727 INFO L424 BuchiCegarLoop]: ======== Iteration 1============ [2020-07-01 13:02:55,727 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 53 states. [2020-07-01 13:02:55,729 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 15 [2020-07-01 13:02:55,730 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-01 13:02:55,730 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-01 13:02:55,730 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2020-07-01 13:02:55,730 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-01 13:02:55,736 INFO L794 eck$LassoCheckResult]: Stem: 23#ULTIMATE.startENTRYtrue [116] 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] 10#L-1true [210] L-1-->L11: Formula: (let ((.cse0 (store |v_#valid_7| |v_ULTIMATE.start_f_#t~malloc0.base_1| 1))) (let ((.cse2 (store .cse0 |v_ULTIMATE.start_f_#t~malloc1.base_1| 1))) (let ((.cse1 (store .cse2 |v_ULTIMATE.start_f_#t~malloc2.base_1| 1))) (and (< |v_#StackHeapBarrier_2| |v_ULTIMATE.start_f_#t~malloc0.base_1|) (< |v_#StackHeapBarrier_2| |v_ULTIMATE.start_f_#t~malloc2.base_1|) (= 0 |v_ULTIMATE.start_f_#t~malloc0.offset_1|) (< |v_#StackHeapBarrier_2| |v_ULTIMATE.start_f_#t~malloc1.base_1|) (< |v_#StackHeapBarrier_2| |v_ULTIMATE.start_f_#t~malloc3.base_1|) (= v_ULTIMATE.start_f_~j~0.offset_1 |v_ULTIMATE.start_f_#t~malloc3.offset_1|) (= |v_ULTIMATE.start_f_#in~l_1| |v_ULTIMATE.start_main_#t~nondet16_1|) (= v_ULTIMATE.start_f_~l_ref~0.offset_1 |v_ULTIMATE.start_f_#t~malloc1.offset_1|) (= 0 (select .cse0 |v_ULTIMATE.start_f_#t~malloc1.base_1|)) (< 0 |v_ULTIMATE.start_f_#t~malloc2.base_1|) (= v_ULTIMATE.start_f_~i~0.offset_1 |v_ULTIMATE.start_f_#t~malloc2.offset_1|) (= |v_#valid_3| (store .cse1 |v_ULTIMATE.start_f_#t~malloc3.base_1| 1)) (> 0 |v_ULTIMATE.start_f_#t~malloc0.base_1|) (= 0 (select .cse2 |v_ULTIMATE.start_f_#t~malloc2.base_1|)) (= 0 (select .cse1 |v_ULTIMATE.start_f_#t~malloc3.base_1|)) (= v_ULTIMATE.start_f_~l_1 |v_ULTIMATE.start_f_#in~l_1|) (= |v_ULTIMATE.start_f_#t~malloc1.offset_1| 0) (< 0 |v_ULTIMATE.start_f_#t~malloc1.base_1|) (= v_ULTIMATE.start_f_~k_1 |v_ULTIMATE.start_f_#in~k_1|) (= |v_ULTIMATE.start_f_#t~malloc2.offset_1| 0) (= v_ULTIMATE.start_f_~k_ref~0.base_1 |v_ULTIMATE.start_f_#t~malloc0.base_1|) (= |v_ULTIMATE.start_f_#in~k_1| |v_ULTIMATE.start_main_#t~nondet15_1|) (= v_ULTIMATE.start_f_~k_ref~0.offset_1 |v_ULTIMATE.start_f_#t~malloc0.offset_1|) (= |v_#length_1| (store (store (store (store |v_#length_5| |v_ULTIMATE.start_f_#t~malloc0.base_1| 4) |v_ULTIMATE.start_f_#t~malloc1.base_1| 4) |v_ULTIMATE.start_f_#t~malloc2.base_1| 4) |v_ULTIMATE.start_f_#t~malloc3.base_1| 4)) (< 0 |v_ULTIMATE.start_f_#t~malloc3.base_1|) (= v_ULTIMATE.start_f_~i~0.base_1 |v_ULTIMATE.start_f_#t~malloc2.base_1|) (= 0 (select |v_#valid_7| |v_ULTIMATE.start_f_#t~malloc0.base_1|)) (= 0 |v_ULTIMATE.start_f_#t~malloc3.offset_1|) (= v_ULTIMATE.start_f_~j~0.base_1 |v_ULTIMATE.start_f_#t~malloc3.base_1|) (= v_ULTIMATE.start_f_~l_ref~0.base_1 |v_ULTIMATE.start_f_#t~malloc1.base_1|))))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_2|, #length=|v_#length_5|, #valid=|v_#valid_7|} OutVars{ULTIMATE.start_f_~l_ref~0.offset=v_ULTIMATE.start_f_~l_ref~0.offset_1, ULTIMATE.start_f_#t~post7=|v_ULTIMATE.start_f_#t~post7_1|, ULTIMATE.start_f_#t~malloc1.offset=|v_ULTIMATE.start_f_#t~malloc1.offset_1|, ULTIMATE.start_f_~l_ref~0.base=v_ULTIMATE.start_f_~l_ref~0.base_1, ULTIMATE.start_f_~i~0.base=v_ULTIMATE.start_f_~i~0.base_1, ULTIMATE.start_f_~k_ref~0.base=v_ULTIMATE.start_f_~k_ref~0.base_1, ULTIMATE.start_f_#in~k=|v_ULTIMATE.start_f_#in~k_1|, ULTIMATE.start_f_#in~l=|v_ULTIMATE.start_f_#in~l_1|, ULTIMATE.start_f_#res=|v_ULTIMATE.start_f_#res_1|, ULTIMATE.start_f_#t~mem6=|v_ULTIMATE.start_f_#t~mem6_1|, ULTIMATE.start_f_#t~mem8=|v_ULTIMATE.start_f_#t~mem8_1|, ULTIMATE.start_f_~j~0.base=v_ULTIMATE.start_f_~j~0.base_1, ULTIMATE.start_f_#t~mem9=|v_ULTIMATE.start_f_#t~mem9_1|, ULTIMATE.start_f_~k=v_ULTIMATE.start_f_~k_1, ULTIMATE.start_f_~k_ref~0.offset=v_ULTIMATE.start_f_~k_ref~0.offset_1, ULTIMATE.start_f_#t~mem4=|v_ULTIMATE.start_f_#t~mem4_1|, ULTIMATE.start_f_~l=v_ULTIMATE.start_f_~l_1, ULTIMATE.start_f_#t~mem5=|v_ULTIMATE.start_f_#t~mem5_1|, ULTIMATE.start_f_#t~malloc2.offset=|v_ULTIMATE.start_f_#t~malloc2.offset_1|, #length=|v_#length_1|, ULTIMATE.start_f_#t~post11=|v_ULTIMATE.start_f_#t~post11_1|, ULTIMATE.start_f_~j~0.offset=v_ULTIMATE.start_f_~j~0.offset_1, ULTIMATE.start_f_#t~mem12=|v_ULTIMATE.start_f_#t~mem12_1|, ULTIMATE.start_f_#t~mem13=|v_ULTIMATE.start_f_#t~mem13_1|, ULTIMATE.start_f_#t~mem14=|v_ULTIMATE.start_f_#t~mem14_1|, ULTIMATE.start_f_#t~malloc3.base=|v_ULTIMATE.start_f_#t~malloc3.base_1|, ULTIMATE.start_main_#t~ret17=|v_ULTIMATE.start_main_#t~ret17_1|, #StackHeapBarrier=|v_#StackHeapBarrier_2|, ULTIMATE.start_f_#t~malloc3.offset=|v_ULTIMATE.start_f_#t~malloc3.offset_1|, ULTIMATE.start_f_#t~malloc0.offset=|v_ULTIMATE.start_f_#t~malloc0.offset_1|, ULTIMATE.start_f_#t~mem10=|v_ULTIMATE.start_f_#t~mem10_1|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_1|, #valid=|v_#valid_3|, ULTIMATE.start_main_#t~nondet15=|v_ULTIMATE.start_main_#t~nondet15_1|, ULTIMATE.start_f_#t~malloc0.base=|v_ULTIMATE.start_f_#t~malloc0.base_1|, ULTIMATE.start_main_#t~nondet16=|v_ULTIMATE.start_main_#t~nondet16_1|, ULTIMATE.start_f_~i~0.offset=v_ULTIMATE.start_f_~i~0.offset_1, ULTIMATE.start_f_#t~malloc1.base=|v_ULTIMATE.start_f_#t~malloc1.base_1|, ULTIMATE.start_f_#t~malloc2.base=|v_ULTIMATE.start_f_#t~malloc2.base_1|} AuxVars[] AssignedVars[ULTIMATE.start_f_~l_ref~0.offset, ULTIMATE.start_f_#t~post7, ULTIMATE.start_f_#t~malloc1.offset, ULTIMATE.start_f_~l_ref~0.base, ULTIMATE.start_f_~i~0.base, ULTIMATE.start_f_~k_ref~0.base, ULTIMATE.start_f_#in~k, ULTIMATE.start_f_#in~l, ULTIMATE.start_f_#res, ULTIMATE.start_f_#t~mem6, ULTIMATE.start_f_#t~mem8, ULTIMATE.start_f_~j~0.base, ULTIMATE.start_f_#t~mem9, ULTIMATE.start_f_~k, ULTIMATE.start_f_~k_ref~0.offset, ULTIMATE.start_f_#t~mem4, ULTIMATE.start_f_~l, ULTIMATE.start_f_#t~mem5, ULTIMATE.start_f_#t~malloc2.offset, #length, ULTIMATE.start_f_#t~post11, ULTIMATE.start_f_~j~0.offset, ULTIMATE.start_f_#t~mem12, ULTIMATE.start_f_#t~mem13, ULTIMATE.start_f_#t~mem14, ULTIMATE.start_f_#t~malloc3.base, ULTIMATE.start_main_#t~ret17, ULTIMATE.start_f_#t~malloc3.offset, ULTIMATE.start_f_#t~malloc0.offset, ULTIMATE.start_f_#t~mem10, ULTIMATE.start_main_#res, #valid, ULTIMATE.start_main_#t~nondet15, ULTIMATE.start_f_#t~malloc0.base, ULTIMATE.start_main_#t~nondet16, ULTIMATE.start_f_~i~0.offset, ULTIMATE.start_f_#t~malloc1.base, ULTIMATE.start_f_#t~malloc2.base] 24#L11true [117] L11-->L11-1: Formula: (and (= |v_#memory_int_1| (store |v_#memory_int_2| v_ULTIMATE.start_f_~k_ref~0.base_3 (store (select |v_#memory_int_2| v_ULTIMATE.start_f_~k_ref~0.base_3) v_ULTIMATE.start_f_~k_ref~0.offset_3 v_ULTIMATE.start_f_~k_3))) (<= (+ v_ULTIMATE.start_f_~k_ref~0.offset_3 4) (select |v_#length_6| v_ULTIMATE.start_f_~k_ref~0.base_3)) (<= 0 v_ULTIMATE.start_f_~k_ref~0.offset_3) (= 1 (select |v_#valid_8| v_ULTIMATE.start_f_~k_ref~0.base_3))) InVars {ULTIMATE.start_f_~k=v_ULTIMATE.start_f_~k_3, ULTIMATE.start_f_~k_ref~0.offset=v_ULTIMATE.start_f_~k_ref~0.offset_3, ULTIMATE.start_f_~k_ref~0.base=v_ULTIMATE.start_f_~k_ref~0.base_3, #valid=|v_#valid_8|, #memory_int=|v_#memory_int_2|, #length=|v_#length_6|} OutVars{ULTIMATE.start_f_~k=v_ULTIMATE.start_f_~k_3, ULTIMATE.start_f_~k_ref~0.offset=v_ULTIMATE.start_f_~k_ref~0.offset_3, ULTIMATE.start_f_~k_ref~0.base=v_ULTIMATE.start_f_~k_ref~0.base_3, #valid=|v_#valid_8|, #memory_int=|v_#memory_int_1|, #length=|v_#length_6|} AuxVars[] AssignedVars[#memory_int] 21#L11-1true [111] L11-1-->L12: Formula: (and (<= 0 v_ULTIMATE.start_f_~l_ref~0.offset_3) (<= (+ v_ULTIMATE.start_f_~l_ref~0.offset_3 4) (select |v_#length_8| v_ULTIMATE.start_f_~l_ref~0.base_3)) (= |v_#memory_int_3| (store |v_#memory_int_4| v_ULTIMATE.start_f_~l_ref~0.base_3 (store (select |v_#memory_int_4| v_ULTIMATE.start_f_~l_ref~0.base_3) v_ULTIMATE.start_f_~l_ref~0.offset_3 v_ULTIMATE.start_f_~l_3))) (= 1 (select |v_#valid_10| v_ULTIMATE.start_f_~l_ref~0.base_3))) InVars {ULTIMATE.start_f_~l_ref~0.offset=v_ULTIMATE.start_f_~l_ref~0.offset_3, ULTIMATE.start_f_~l_ref~0.base=v_ULTIMATE.start_f_~l_ref~0.base_3, ULTIMATE.start_f_~l=v_ULTIMATE.start_f_~l_3, #valid=|v_#valid_10|, #memory_int=|v_#memory_int_4|, #length=|v_#length_8|} OutVars{ULTIMATE.start_f_~l_ref~0.offset=v_ULTIMATE.start_f_~l_ref~0.offset_3, ULTIMATE.start_f_~l_ref~0.base=v_ULTIMATE.start_f_~l_ref~0.base_3, ULTIMATE.start_f_~l=v_ULTIMATE.start_f_~l_3, #valid=|v_#valid_10|, #memory_int=|v_#memory_int_3|, #length=|v_#length_8|} AuxVars[] AssignedVars[#memory_int] 41#L12true [135] L12-->L13: Formula: (and (<= 0 v_ULTIMATE.start_f_~i~0.offset_3) (= (store |v_#memory_int_6| v_ULTIMATE.start_f_~i~0.base_3 (store (select |v_#memory_int_6| v_ULTIMATE.start_f_~i~0.base_3) v_ULTIMATE.start_f_~i~0.offset_3 0)) |v_#memory_int_5|) (= 1 (select |v_#valid_12| v_ULTIMATE.start_f_~i~0.base_3)) (<= (+ v_ULTIMATE.start_f_~i~0.offset_3 4) (select |v_#length_10| v_ULTIMATE.start_f_~i~0.base_3))) InVars {#memory_int=|v_#memory_int_6|, ULTIMATE.start_f_~i~0.offset=v_ULTIMATE.start_f_~i~0.offset_3, #length=|v_#length_10|, ULTIMATE.start_f_~i~0.base=v_ULTIMATE.start_f_~i~0.base_3, #valid=|v_#valid_12|} OutVars{#memory_int=|v_#memory_int_5|, ULTIMATE.start_f_~i~0.offset=v_ULTIMATE.start_f_~i~0.offset_3, #length=|v_#length_10|, ULTIMATE.start_f_~i~0.base=v_ULTIMATE.start_f_~i~0.base_3, #valid=|v_#valid_12|} AuxVars[] AssignedVars[#memory_int] 53#L13true [152] L13-->L27: Formula: (and (= |v_#memory_int_7| (store |v_#memory_int_8| v_ULTIMATE.start_f_~j~0.base_3 (store (select |v_#memory_int_8| v_ULTIMATE.start_f_~j~0.base_3) v_ULTIMATE.start_f_~j~0.offset_3 0))) (= 1 (select |v_#valid_14| v_ULTIMATE.start_f_~j~0.base_3)) (<= (+ v_ULTIMATE.start_f_~j~0.offset_3 4) (select |v_#length_12| v_ULTIMATE.start_f_~j~0.base_3)) (<= 0 v_ULTIMATE.start_f_~j~0.offset_3)) InVars {#memory_int=|v_#memory_int_8|, #length=|v_#length_12|, ULTIMATE.start_f_~j~0.base=v_ULTIMATE.start_f_~j~0.base_3, ULTIMATE.start_f_~j~0.offset=v_ULTIMATE.start_f_~j~0.offset_3, #valid=|v_#valid_14|} OutVars{#memory_int=|v_#memory_int_7|, #length=|v_#length_12|, ULTIMATE.start_f_~j~0.base=v_ULTIMATE.start_f_~j~0.base_3, ULTIMATE.start_f_~j~0.offset=v_ULTIMATE.start_f_~j~0.offset_3, #valid=|v_#valid_14|} AuxVars[] AssignedVars[#memory_int] 31#L27true [2020-07-01 13:02:55,737 INFO L796 eck$LassoCheckResult]: Loop: 31#L27true [129] L27-->L18: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 6#L18true [93] L18-->L15: Formula: (and (= |v_ULTIMATE.start_f_#t~mem4_2| (select (select |v_#memory_int_9| v_ULTIMATE.start_f_~i~0.base_6) v_ULTIMATE.start_f_~i~0.offset_5)) (<= 0 v_ULTIMATE.start_f_~i~0.offset_5) (<= (+ v_ULTIMATE.start_f_~i~0.offset_5 4) (select |v_#length_14| v_ULTIMATE.start_f_~i~0.base_6)) (= 1 (select |v_#valid_16| v_ULTIMATE.start_f_~i~0.base_6))) InVars {#memory_int=|v_#memory_int_9|, ULTIMATE.start_f_~i~0.offset=v_ULTIMATE.start_f_~i~0.offset_5, #length=|v_#length_14|, ULTIMATE.start_f_~i~0.base=v_ULTIMATE.start_f_~i~0.base_6, #valid=|v_#valid_16|} OutVars{ULTIMATE.start_f_~i~0.base=v_ULTIMATE.start_f_~i~0.base_6, ULTIMATE.start_f_#t~mem4=|v_ULTIMATE.start_f_#t~mem4_2|, #valid=|v_#valid_16|, #memory_int=|v_#memory_int_9|, ULTIMATE.start_f_~i~0.offset=v_ULTIMATE.start_f_~i~0.offset_5, #length=|v_#length_14|} AuxVars[] AssignedVars[ULTIMATE.start_f_#t~mem4] 17#L15true [107] L15-->L15-1: Formula: (and (<= 0 v_ULTIMATE.start_f_~k_ref~0.offset_5) (= 1 (select |v_#valid_18| v_ULTIMATE.start_f_~k_ref~0.base_6)) (= |v_ULTIMATE.start_f_#t~mem5_2| (select (select |v_#memory_int_10| v_ULTIMATE.start_f_~k_ref~0.base_6) v_ULTIMATE.start_f_~k_ref~0.offset_5)) (<= (+ v_ULTIMATE.start_f_~k_ref~0.offset_5 4) (select |v_#length_16| v_ULTIMATE.start_f_~k_ref~0.base_6))) InVars {#memory_int=|v_#memory_int_10|, #length=|v_#length_16|, ULTIMATE.start_f_~k_ref~0.offset=v_ULTIMATE.start_f_~k_ref~0.offset_5, ULTIMATE.start_f_~k_ref~0.base=v_ULTIMATE.start_f_~k_ref~0.base_6, #valid=|v_#valid_18|} OutVars{ULTIMATE.start_f_~k_ref~0.offset=v_ULTIMATE.start_f_~k_ref~0.offset_5, ULTIMATE.start_f_#t~mem5=|v_ULTIMATE.start_f_#t~mem5_2|, ULTIMATE.start_f_~k_ref~0.base=v_ULTIMATE.start_f_~k_ref~0.base_6, #valid=|v_#valid_18|, #memory_int=|v_#memory_int_10|, #length=|v_#length_16|} AuxVars[] AssignedVars[ULTIMATE.start_f_#t~mem5] 28#L15-1true [175] L15-1-->L22: Formula: (>= |v_ULTIMATE.start_f_#t~mem4_4| |v_ULTIMATE.start_f_#t~mem5_4|) InVars {ULTIMATE.start_f_#t~mem4=|v_ULTIMATE.start_f_#t~mem4_4|, ULTIMATE.start_f_#t~mem5=|v_ULTIMATE.start_f_#t~mem5_4|} OutVars{ULTIMATE.start_f_#t~mem4=|v_ULTIMATE.start_f_#t~mem4_3|, ULTIMATE.start_f_#t~mem5=|v_ULTIMATE.start_f_#t~mem5_3|} AuxVars[] AssignedVars[ULTIMATE.start_f_#t~mem4, ULTIMATE.start_f_#t~mem5] 25#L22true [120] L22-->L25: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 15#L25true [104] L25-->L22-1: Formula: (and (<= (+ v_ULTIMATE.start_f_~j~0.offset_5 4) (select |v_#length_24| v_ULTIMATE.start_f_~j~0.base_6)) (= 1 (select |v_#valid_26| v_ULTIMATE.start_f_~j~0.base_6)) (<= 0 v_ULTIMATE.start_f_~j~0.offset_5) (= |v_ULTIMATE.start_f_#t~mem9_2| (select (select |v_#memory_int_15| v_ULTIMATE.start_f_~j~0.base_6) v_ULTIMATE.start_f_~j~0.offset_5))) InVars {#memory_int=|v_#memory_int_15|, #length=|v_#length_24|, ULTIMATE.start_f_~j~0.base=v_ULTIMATE.start_f_~j~0.base_6, ULTIMATE.start_f_~j~0.offset=v_ULTIMATE.start_f_~j~0.offset_5, #valid=|v_#valid_26|} OutVars{ULTIMATE.start_f_#t~mem9=|v_ULTIMATE.start_f_#t~mem9_2|, ULTIMATE.start_f_~j~0.base=v_ULTIMATE.start_f_~j~0.base_6, #valid=|v_#valid_26|, #memory_int=|v_#memory_int_15|, #length=|v_#length_24|, ULTIMATE.start_f_~j~0.offset=v_ULTIMATE.start_f_~j~0.offset_5} AuxVars[] AssignedVars[ULTIMATE.start_f_#t~mem9] 22#L22-1true [115] L22-1-->L23: Formula: (< |v_ULTIMATE.start_f_#t~mem9_6| 1) InVars {ULTIMATE.start_f_#t~mem9=|v_ULTIMATE.start_f_#t~mem9_6|} OutVars{ULTIMATE.start_f_#t~mem9=|v_ULTIMATE.start_f_#t~mem9_5|} AuxVars[] AssignedVars[ULTIMATE.start_f_#t~mem9] 42#L23true [311] L23-->L23-2: Formula: (and (= |v_ULTIMATE.start_f_#t~mem10_5| |v_ULTIMATE.start_f_#t~post11_5|) (<= 0 v_ULTIMATE.start_f_~j~0.offset_13) (= |v_ULTIMATE.start_f_#t~mem10_5| (select (select |v_#memory_int_25| v_ULTIMATE.start_f_~j~0.base_18) v_ULTIMATE.start_f_~j~0.offset_13)) (= (select |v_#valid_45| v_ULTIMATE.start_f_~j~0.base_18) 1) (<= (+ v_ULTIMATE.start_f_~j~0.offset_13 4) (select |v_#length_38| v_ULTIMATE.start_f_~j~0.base_18))) InVars {ULTIMATE.start_f_~j~0.base=v_ULTIMATE.start_f_~j~0.base_18, #valid=|v_#valid_45|, #memory_int=|v_#memory_int_25|, #length=|v_#length_38|, ULTIMATE.start_f_~j~0.offset=v_ULTIMATE.start_f_~j~0.offset_13} OutVars{ULTIMATE.start_f_#t~mem10=|v_ULTIMATE.start_f_#t~mem10_5|, ULTIMATE.start_f_~j~0.base=v_ULTIMATE.start_f_~j~0.base_18, ULTIMATE.start_f_#t~post11=|v_ULTIMATE.start_f_#t~post11_5|, #valid=|v_#valid_45|, #memory_int=|v_#memory_int_25|, #length=|v_#length_38|, ULTIMATE.start_f_~j~0.offset=v_ULTIMATE.start_f_~j~0.offset_13} AuxVars[] AssignedVars[ULTIMATE.start_f_#t~mem10, ULTIMATE.start_f_#t~post11] 39#L23-2true [313] L23-2-->L24: Formula: (and (= (store |v_#memory_int_28| v_ULTIMATE.start_f_~j~0.base_20 (store (select |v_#memory_int_28| v_ULTIMATE.start_f_~j~0.base_20) v_ULTIMATE.start_f_~j~0.offset_15 (+ |v_ULTIMATE.start_f_#t~post11_7| 1))) |v_#memory_int_27|) (= 1 (select |v_#valid_48| v_ULTIMATE.start_f_~j~0.base_20)) (<= (+ v_ULTIMATE.start_f_~j~0.offset_15 4) (select |v_#length_40| v_ULTIMATE.start_f_~j~0.base_20)) (<= 0 v_ULTIMATE.start_f_~j~0.offset_15)) InVars {ULTIMATE.start_f_~j~0.base=v_ULTIMATE.start_f_~j~0.base_20, ULTIMATE.start_f_#t~post11=|v_ULTIMATE.start_f_#t~post11_7|, #valid=|v_#valid_48|, #memory_int=|v_#memory_int_28|, #length=|v_#length_40|, ULTIMATE.start_f_~j~0.offset=v_ULTIMATE.start_f_~j~0.offset_15} OutVars{ULTIMATE.start_f_#t~mem10=|v_ULTIMATE.start_f_#t~mem10_6|, ULTIMATE.start_f_~j~0.base=v_ULTIMATE.start_f_~j~0.base_20, ULTIMATE.start_f_#t~post11=|v_ULTIMATE.start_f_#t~post11_6|, #valid=|v_#valid_48|, #memory_int=|v_#memory_int_27|, #length=|v_#length_40|, ULTIMATE.start_f_~j~0.offset=v_ULTIMATE.start_f_~j~0.offset_15} AuxVars[] AssignedVars[ULTIMATE.start_f_#t~mem10, ULTIMATE.start_f_#t~post11, #memory_int] 54#L24true [155] L24-->L24-1: Formula: (and (<= 0 v_ULTIMATE.start_f_~i~0.offset_13) (= 1 (select |v_#valid_32| v_ULTIMATE.start_f_~i~0.base_18)) (<= (+ v_ULTIMATE.start_f_~i~0.offset_13 4) (select |v_#length_30| v_ULTIMATE.start_f_~i~0.base_18)) (= |v_ULTIMATE.start_f_#t~mem12_2| (select (select |v_#memory_int_19| v_ULTIMATE.start_f_~i~0.base_18) v_ULTIMATE.start_f_~i~0.offset_13))) InVars {#memory_int=|v_#memory_int_19|, ULTIMATE.start_f_~i~0.offset=v_ULTIMATE.start_f_~i~0.offset_13, #length=|v_#length_30|, ULTIMATE.start_f_~i~0.base=v_ULTIMATE.start_f_~i~0.base_18, #valid=|v_#valid_32|} OutVars{ULTIMATE.start_f_~i~0.base=v_ULTIMATE.start_f_~i~0.base_18, #valid=|v_#valid_32|, #memory_int=|v_#memory_int_19|, ULTIMATE.start_f_~i~0.offset=v_ULTIMATE.start_f_~i~0.offset_13, #length=|v_#length_30|, ULTIMATE.start_f_#t~mem12=|v_ULTIMATE.start_f_#t~mem12_2|} AuxVars[] AssignedVars[ULTIMATE.start_f_#t~mem12] 52#L24-1true [306] L24-1-->L27: Formula: (= 0 (mod |v_ULTIMATE.start_f_#t~mem12_6| 2)) InVars {ULTIMATE.start_f_#t~mem12=|v_ULTIMATE.start_f_#t~mem12_6|} OutVars{ULTIMATE.start_f_#t~mem12=|v_ULTIMATE.start_f_#t~mem12_5|} AuxVars[] AssignedVars[ULTIMATE.start_f_#t~mem12] 31#L27true [2020-07-01 13:02:55,738 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 13:02:55,738 INFO L82 PathProgramCache]: Analyzing trace with hash 111053866, now seen corresponding path program 1 times [2020-07-01 13:02:55,738 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 13:02:55,739 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2138715643] [2020-07-01 13:02:55,739 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 13:02:55,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 13:02:55,757 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:02:55,757 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2138715643] [2020-07-01 13:02:55,758 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-01 13:02:55,758 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-07-01 13:02:55,758 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1309743114] [2020-07-01 13:02:55,759 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-07-01 13:02:55,759 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 13:02:55,759 INFO L82 PathProgramCache]: Analyzing trace with hash 1299202843, now seen corresponding path program 1 times [2020-07-01 13:02:55,759 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 13:02:55,760 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [563013457] [2020-07-01 13:02:55,760 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 13:02:55,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-01 13:02:55,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-01 13:02:55,798 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-01 13:02:55,928 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 13:02:55,928 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-01 13:02:55,928 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 13:02:55,929 INFO L87 Difference]: Start difference. First operand 53 states. Second operand 3 states. [2020-07-01 13:02:56,098 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 13:02:56,098 INFO L93 Difference]: Finished difference Result 53 states and 90 transitions. [2020-07-01 13:02:56,099 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-01 13:02:56,101 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:02:56,106 INFO L168 Benchmark]: Toolchain (without parser) took 3541.13 ms. Allocated memory was 649.6 MB in the beginning and 744.5 MB in the end (delta: 94.9 MB). Free memory was 561.8 MB in the beginning and 576.3 MB in the end (delta: -14.5 MB). Peak memory consumption was 80.4 MB. Max. memory is 50.3 GB. [2020-07-01 13:02:56,107 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:02:56,107 INFO L168 Benchmark]: CACSL2BoogieTranslator took 303.95 ms. Allocated memory was 649.6 MB in the beginning and 671.1 MB in the end (delta: 21.5 MB). Free memory was 561.8 MB in the beginning and 632.8 MB in the end (delta: -71.1 MB). Peak memory consumption was 28.0 MB. Max. memory is 50.3 GB. [2020-07-01 13:02:56,108 INFO L168 Benchmark]: Boogie Procedure Inliner took 41.85 ms. Allocated memory is still 671.1 MB. Free memory was 632.8 MB in the beginning and 630.7 MB in the end (delta: 2.2 MB). Peak memory consumption was 2.2 MB. Max. memory is 50.3 GB. [2020-07-01 13:02:56,108 INFO L168 Benchmark]: Boogie Preprocessor took 25.28 ms. Allocated memory is still 671.1 MB. Free memory was 630.7 MB in the beginning and 629.6 MB in the end (delta: 1.1 MB). Peak memory consumption was 1.1 MB. Max. memory is 50.3 GB. [2020-07-01 13:02:56,109 INFO L168 Benchmark]: RCFGBuilder took 423.91 ms. Allocated memory is still 671.1 MB. Free memory was 628.5 MB in the beginning and 598.8 MB in the end (delta: 29.7 MB). Peak memory consumption was 29.7 MB. Max. memory is 50.3 GB. [2020-07-01 13:02:56,110 INFO L168 Benchmark]: BlockEncodingV2 took 155.49 ms. Allocated memory is still 671.1 MB. Free memory was 598.8 MB in the beginning and 583.7 MB in the end (delta: 15.1 MB). Peak memory consumption was 15.1 MB. Max. memory is 50.3 GB. [2020-07-01 13:02:56,110 INFO L168 Benchmark]: TraceAbstraction took 2161.22 ms. Allocated memory was 671.1 MB in the beginning and 744.5 MB in the end (delta: 73.4 MB). Free memory was 582.6 MB in the beginning and 632.2 MB in the end (delta: -49.5 MB). Peak memory consumption was 23.9 MB. Max. memory is 50.3 GB. [2020-07-01 13:02:56,111 INFO L168 Benchmark]: BuchiAutomizer took 423.60 ms. Allocated memory is still 744.5 MB. Free memory was 632.2 MB in the beginning and 576.3 MB in the end (delta: 55.9 MB). Peak memory consumption was 55.9 MB. Max. memory is 50.3 GB. [2020-07-01 13:02:56,114 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.plugins.blockencoding: - StatisticsResult: Initial Icfg 62 locations, 67 edges - StatisticsResult: Encoded RCFG 53 locations, 135 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 303.95 ms. Allocated memory was 649.6 MB in the beginning and 671.1 MB in the end (delta: 21.5 MB). Free memory was 561.8 MB in the beginning and 632.8 MB in the end (delta: -71.1 MB). Peak memory consumption was 28.0 MB. Max. memory is 50.3 GB. * Boogie Procedure Inliner took 41.85 ms. Allocated memory is still 671.1 MB. Free memory was 632.8 MB in the beginning and 630.7 MB in the end (delta: 2.2 MB). Peak memory consumption was 2.2 MB. Max. memory is 50.3 GB. * Boogie Preprocessor took 25.28 ms. Allocated memory is still 671.1 MB. Free memory was 630.7 MB in the beginning and 629.6 MB in the end (delta: 1.1 MB). Peak memory consumption was 1.1 MB. Max. memory is 50.3 GB. * RCFGBuilder took 423.91 ms. Allocated memory is still 671.1 MB. Free memory was 628.5 MB in the beginning and 598.8 MB in the end (delta: 29.7 MB). Peak memory consumption was 29.7 MB. Max. memory is 50.3 GB. * BlockEncodingV2 took 155.49 ms. Allocated memory is still 671.1 MB. Free memory was 598.8 MB in the beginning and 583.7 MB in the end (delta: 15.1 MB). Peak memory consumption was 15.1 MB. Max. memory is 50.3 GB. * TraceAbstraction took 2161.22 ms. Allocated memory was 671.1 MB in the beginning and 744.5 MB in the end (delta: 73.4 MB). Free memory was 582.6 MB in the beginning and 632.2 MB in the end (delta: -49.5 MB). Peak memory consumption was 23.9 MB. Max. memory is 50.3 GB. * BuchiAutomizer took 423.60 ms. Allocated memory is still 744.5 MB. Free memory was 632.2 MB in the beginning and 576.3 MB in the end (delta: 55.9 MB). Peak memory consumption was 55.9 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 #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 #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 #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 #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 #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 #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 #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 * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 11]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 24]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 23]: 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: 24]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 23]: 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: 12]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 12]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 23]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 14]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 29]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 14]: 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: 29]: 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: 29]: 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: 29]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 16]: 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: 16]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 16]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 16]: 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: 23]: 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: 22]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - AllSpecificationsHoldResult: All specifications hold 30 specifications checked. All of them hold - InvariantResult [Line: 6]: Loop Invariant [2020-07-01 13:02:56,126 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 13:02:56,126 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 13:02:56,127 WARN L1295 BoogieBacktranslator]: unknown boogie variable #StackHeapBarrier [2020-07-01 13:02:56,127 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 13:02:56,127 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 13:02:56,128 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 13:02:56,128 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 13:02:56,128 WARN L1295 BoogieBacktranslator]: unknown boogie variable #StackHeapBarrier [2020-07-01 13:02:56,129 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 13:02:56,129 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length Derived loop invariant: (((((((((((4 == unknown-#length-unknown[k_ref] && 1 == \valid[l_ref]) && 0 == i) && 4 == unknown-#length-unknown[l_ref]) && 0 == l_ref) && 1 == \valid[j]) && 1 <= unknown-#StackHeapBarrier-unknown) && 1 == \valid[i]) && 0 == j) && 4 == unknown-#length-unknown[i]) && 1 == \valid[k_ref]) && 4 == unknown-#length-unknown[j]) && 0 == k_ref - InvariantResult [Line: 6]: Loop Invariant [2020-07-01 13:02:56,130 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 13:02:56,130 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 13:02:56,130 WARN L1295 BoogieBacktranslator]: unknown boogie variable #StackHeapBarrier [2020-07-01 13:02:56,130 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 13:02:56,130 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 13:02:56,131 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 13:02:56,132 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 13:02:56,132 WARN L1295 BoogieBacktranslator]: unknown boogie variable #StackHeapBarrier [2020-07-01 13:02:56,132 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 13:02:56,132 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length Derived loop invariant: (((((((((((4 == unknown-#length-unknown[k_ref] && 1 == \valid[l_ref]) && 0 == i) && 4 == unknown-#length-unknown[l_ref]) && 0 == l_ref) && 1 == \valid[j]) && 1 <= unknown-#StackHeapBarrier-unknown) && 1 == \valid[i]) && 0 == j) && 4 == unknown-#length-unknown[i]) && 1 == \valid[k_ref]) && 4 == unknown-#length-unknown[j]) && 0 == k_ref - InvariantResult [Line: 15]: Loop Invariant [2020-07-01 13:02:56,133 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 13:02:56,133 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 13:02:56,134 WARN L1295 BoogieBacktranslator]: unknown boogie variable #StackHeapBarrier [2020-07-01 13:02:56,134 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 13:02:56,134 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 13:02:56,135 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 13:02:56,135 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 13:02:56,135 WARN L1295 BoogieBacktranslator]: unknown boogie variable #StackHeapBarrier [2020-07-01 13:02:56,135 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 13:02:56,135 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length Derived loop invariant: (((((((((((4 == unknown-#length-unknown[k_ref] && 1 == \valid[l_ref]) && 0 == i) && 4 == unknown-#length-unknown[l_ref]) && 0 == l_ref) && 1 == \valid[j]) && 1 <= unknown-#StackHeapBarrier-unknown) && 1 == \valid[i]) && 0 == j) && 4 == unknown-#length-unknown[i]) && 1 == \valid[k_ref]) && 4 == unknown-#length-unknown[j]) && 0 == k_ref - InvariantResult [Line: 22]: Loop Invariant [2020-07-01 13:02:56,136 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 13:02:56,137 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 13:02:56,137 WARN L1295 BoogieBacktranslator]: unknown boogie variable #StackHeapBarrier [2020-07-01 13:02:56,137 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 13:02:56,137 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 13:02:56,138 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 13:02:56,138 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 13:02:56,138 WARN L1295 BoogieBacktranslator]: unknown boogie variable #StackHeapBarrier [2020-07-01 13:02:56,139 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 13:02:56,139 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length Derived loop invariant: (((((((((((4 == unknown-#length-unknown[k_ref] && 1 == \valid[l_ref]) && 0 == i) && 4 == unknown-#length-unknown[l_ref]) && 0 == l_ref) && 1 == \valid[j]) && 1 <= unknown-#StackHeapBarrier-unknown) && 1 == \valid[i]) && 0 == j) && 4 == unknown-#length-unknown[i]) && 1 == \valid[k_ref]) && 4 == unknown-#length-unknown[j]) && 0 == k_ref - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 53 locations, 30 error locations. Started 1 CEGAR loops. VerificationResult: SAFE, OverallTime: 1.9s, OverallIterations: 10, TraceHistogramMax: 1, AutomataDifference: 1.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.1s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 74 SDtfs, 601 SDslu, 5 SDs, 0 SdLazy, 565 SolverSat, 95 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 20 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=53occurred 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, 10 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 4 LocationsWithAnnotation, 4 PreInvPairs, 8 NumberOfFragments, 224 HoareAnnotationTreeSize, 4 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 4 FomulaSimplificationsInter, 0 FormulaSimplificationTreeSizeReductionInter, 0.1s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.2s InterpolantComputationTime, 45 NumberOfCodeBlocks, 45 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 35 ConstructedInterpolants, 0 QuantifiedInterpolants, 661 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 10 InterpolantComputations, 10 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:02:49.281 ----------------------------------------------- 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_EwxMZs/tmp -i /export/starexec/sandbox2/benchmark/theBenchmark.c !ENTRY org.eclipse.core.resources 2 10035 2020-07-01 13:02:56.366 !MESSAGE The workspace will exit with unsaved changes in this session. Received shutdown request... Ultimate: GTK+ Version Check