java -ea -Xmx8000000000 -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc ../../../trunk/examples/toolchains/AutomizerCInline_WitnessPrinter.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/ldv-regression/test24_true-unreach-call_true-termination.c -------------------------------------------------------------------------------- This is Ultimate 0.1.23-61f4311 [2018-11-23 12:54:41,360 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-23 12:54:41,363 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-23 12:54:41,377 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-23 12:54:41,377 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-23 12:54:41,379 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-23 12:54:41,380 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-23 12:54:41,382 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-23 12:54:41,383 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-23 12:54:41,384 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-23 12:54:41,386 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-23 12:54:41,386 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-23 12:54:41,387 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-23 12:54:41,388 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-23 12:54:41,392 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-23 12:54:41,393 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-23 12:54:41,395 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-23 12:54:41,397 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-23 12:54:41,399 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-23 12:54:41,401 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-23 12:54:41,402 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-23 12:54:41,403 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-23 12:54:41,405 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-23 12:54:41,406 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-23 12:54:41,406 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-23 12:54:41,407 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-23 12:54:41,408 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-23 12:54:41,410 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-23 12:54:41,412 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-23 12:54:41,413 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-23 12:54:41,413 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-23 12:54:41,414 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-23 12:54:41,414 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-23 12:54:41,414 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-23 12:54:41,415 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-23 12:54:41,416 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-23 12:54:41,416 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2018-11-23 12:54:41,432 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-23 12:54:41,432 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-23 12:54:41,433 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-23 12:54:41,433 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-11-23 12:54:41,435 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-23 12:54:41,436 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-23 12:54:41,436 INFO L133 SettingsManager]: * Use SBE=true [2018-11-23 12:54:41,437 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-23 12:54:41,437 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-23 12:54:41,437 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-23 12:54:41,437 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-23 12:54:41,438 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-23 12:54:41,440 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-23 12:54:41,440 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-23 12:54:41,440 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-23 12:54:41,440 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-23 12:54:41,441 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-23 12:54:41,441 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-23 12:54:41,441 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-23 12:54:41,441 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-23 12:54:41,441 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-23 12:54:41,442 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-23 12:54:41,442 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-23 12:54:41,442 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-23 12:54:41,442 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-23 12:54:41,442 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-23 12:54:41,443 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-23 12:54:41,444 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-23 12:54:41,444 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-23 12:54:41,445 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-23 12:54:41,445 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-23 12:54:41,495 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-23 12:54:41,507 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-23 12:54:41,511 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-23 12:54:41,513 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-23 12:54:41,513 INFO L276 PluginConnector]: CDTParser initialized [2018-11-23 12:54:41,514 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/ldv-regression/test24_true-unreach-call_true-termination.c [2018-11-23 12:54:41,574 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8b2aa535f/28f1344be9b148b29ce9660bdc5eecc4/FLAG64c3b5261 [2018-11-23 12:54:42,045 INFO L307 CDTParser]: Found 1 translation units. [2018-11-23 12:54:42,046 INFO L161 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/ldv-regression/test24_true-unreach-call_true-termination.c [2018-11-23 12:54:42,052 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8b2aa535f/28f1344be9b148b29ce9660bdc5eecc4/FLAG64c3b5261 [2018-11-23 12:54:42,418 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8b2aa535f/28f1344be9b148b29ce9660bdc5eecc4 [2018-11-23 12:54:42,427 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-23 12:54:42,428 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-23 12:54:42,429 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-23 12:54:42,429 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-23 12:54:42,433 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-23 12:54:42,435 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 12:54:42" (1/1) ... [2018-11-23 12:54:42,438 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@788acb19 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:54:42, skipping insertion in model container [2018-11-23 12:54:42,438 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 12:54:42" (1/1) ... [2018-11-23 12:54:42,449 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-23 12:54:42,471 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-23 12:54:42,719 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 12:54:42,736 INFO L191 MainTranslator]: Completed pre-run [2018-11-23 12:54:42,763 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 12:54:42,790 INFO L195 MainTranslator]: Completed translation [2018-11-23 12:54:42,790 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:54:42 WrapperNode [2018-11-23 12:54:42,791 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-23 12:54:42,791 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-23 12:54:42,792 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-23 12:54:42,792 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-23 12:54:42,799 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:54:42" (1/1) ... [2018-11-23 12:54:42,807 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:54:42" (1/1) ... [2018-11-23 12:54:42,816 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-23 12:54:42,816 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-23 12:54:42,816 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-23 12:54:42,817 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-23 12:54:42,827 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:54:42" (1/1) ... [2018-11-23 12:54:42,828 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:54:42" (1/1) ... [2018-11-23 12:54:42,830 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:54:42" (1/1) ... [2018-11-23 12:54:42,830 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:54:42" (1/1) ... [2018-11-23 12:54:42,847 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:54:42" (1/1) ... [2018-11-23 12:54:42,860 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:54:42" (1/1) ... [2018-11-23 12:54:42,861 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:54:42" (1/1) ... [2018-11-23 12:54:42,864 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-23 12:54:42,865 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-23 12:54:42,865 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-23 12:54:42,865 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-23 12:54:42,866 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:54:42" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-23 12:54:43,004 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-23 12:54:43,004 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-23 12:54:43,005 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-23 12:54:43,006 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-23 12:54:43,006 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-23 12:54:43,006 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-23 12:54:43,006 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-23 12:54:43,006 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-23 12:54:43,006 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-23 12:54:43,007 INFO L130 BoogieDeclarations]: Found specification of procedure check [2018-11-23 12:54:43,007 INFO L138 BoogieDeclarations]: Found implementation of procedure check [2018-11-23 12:54:43,007 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-23 12:54:43,521 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-23 12:54:43,521 INFO L280 CfgBuilder]: Removed 1 assue(true) statements. [2018-11-23 12:54:43,522 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 12:54:43 BoogieIcfgContainer [2018-11-23 12:54:43,522 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-23 12:54:43,523 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-23 12:54:43,523 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-23 12:54:43,526 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-23 12:54:43,527 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 12:54:42" (1/3) ... [2018-11-23 12:54:43,528 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@10e1c6af and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 12:54:43, skipping insertion in model container [2018-11-23 12:54:43,528 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:54:42" (2/3) ... [2018-11-23 12:54:43,528 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@10e1c6af and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 12:54:43, skipping insertion in model container [2018-11-23 12:54:43,529 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 12:54:43" (3/3) ... [2018-11-23 12:54:43,530 INFO L112 eAbstractionObserver]: Analyzing ICFG test24_true-unreach-call_true-termination.c [2018-11-23 12:54:43,540 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-23 12:54:43,549 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-23 12:54:43,568 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-23 12:54:43,600 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-23 12:54:43,601 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-23 12:54:43,601 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-23 12:54:43,601 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-23 12:54:43,601 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-23 12:54:43,602 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-23 12:54:43,602 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-23 12:54:43,602 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-23 12:54:43,602 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-23 12:54:43,621 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states. [2018-11-23 12:54:43,627 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-11-23 12:54:43,627 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:54:43,628 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:54:43,631 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:54:43,637 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:54:43,637 INFO L82 PathProgramCache]: Analyzing trace with hash 149844724, now seen corresponding path program 1 times [2018-11-23 12:54:43,639 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:54:43,640 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:54:43,685 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:54:43,685 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:54:43,685 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:54:43,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:54:43,794 INFO L256 TraceCheckUtils]: 0: Hoare triple {25#true} call ULTIMATE.init(); {25#true} is VALID [2018-11-23 12:54:43,798 INFO L273 TraceCheckUtils]: 1: Hoare triple {25#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {25#true} is VALID [2018-11-23 12:54:43,799 INFO L273 TraceCheckUtils]: 2: Hoare triple {25#true} assume true; {25#true} is VALID [2018-11-23 12:54:43,799 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {25#true} {25#true} #39#return; {25#true} is VALID [2018-11-23 12:54:43,799 INFO L256 TraceCheckUtils]: 4: Hoare triple {25#true} call #t~ret6 := main(); {25#true} is VALID [2018-11-23 12:54:43,800 INFO L273 TraceCheckUtils]: 5: Hoare triple {25#true} call ~#ad1~0.base, ~#ad1~0.offset := #Ultimate.alloc(80);havoc ~ad2~0.base, ~ad2~0.offset;havoc ~i~0;havoc ~pa~0.base, ~pa~0.offset;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~i~0 := #t~nondet1;havoc #t~nondet1; {25#true} is VALID [2018-11-23 12:54:43,800 INFO L273 TraceCheckUtils]: 6: Hoare triple {25#true} assume ~i~0 >= 0 && ~i~0 < 10;~ad2~0.base, ~ad2~0.offset := ~#ad1~0.base, ~#ad1~0.offset;call write~int(~i~0, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~i~0, 4);~pa~0.base, ~pa~0.offset := ~#ad1~0.base, ~#ad1~0.offset + 8 * ~i~0;call #t~mem2 := read~int(~ad2~0.base, ~ad2~0.offset + 8 * ~i~0, 4);~i~0 := #t~mem2 - 10;havoc #t~mem2; {25#true} is VALID [2018-11-23 12:54:43,805 INFO L273 TraceCheckUtils]: 7: Hoare triple {25#true} assume !true; {26#false} is VALID [2018-11-23 12:54:43,805 INFO L256 TraceCheckUtils]: 8: Hoare triple {26#false} call #t~ret5 := check(~#ad1~0.base, ~#ad1~0.offset, ~i~0); {25#true} is VALID [2018-11-23 12:54:43,805 INFO L273 TraceCheckUtils]: 9: Hoare triple {25#true} ~ad1.base, ~ad1.offset := #in~ad1.base, #in~ad1.offset;~b := #in~b;call #t~mem0 := read~int(~ad1.base, ~ad1.offset + 8 * ~b, 4);#res := (if #t~mem0 == ~b then 1 else 0);havoc #t~mem0; {25#true} is VALID [2018-11-23 12:54:43,806 INFO L273 TraceCheckUtils]: 10: Hoare triple {25#true} assume true; {25#true} is VALID [2018-11-23 12:54:43,806 INFO L268 TraceCheckUtils]: 11: Hoare quadruple {25#true} {26#false} #43#return; {26#false} is VALID [2018-11-23 12:54:43,807 INFO L273 TraceCheckUtils]: 12: Hoare triple {26#false} assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647; {26#false} is VALID [2018-11-23 12:54:43,807 INFO L273 TraceCheckUtils]: 13: Hoare triple {26#false} assume 0 == #t~ret5;havoc #t~ret5; {26#false} is VALID [2018-11-23 12:54:43,807 INFO L273 TraceCheckUtils]: 14: Hoare triple {26#false} assume !false; {26#false} is VALID [2018-11-23 12:54:43,811 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:54:43,814 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 12:54:43,814 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-23 12:54:43,819 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 15 [2018-11-23 12:54:43,822 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:54:43,826 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states. [2018-11-23 12:54:43,899 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 15 edges. 15 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:54:43,900 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-11-23 12:54:43,908 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-23 12:54:43,909 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-23 12:54:43,912 INFO L87 Difference]: Start difference. First operand 22 states. Second operand 2 states. [2018-11-23 12:54:44,122 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:54:44,122 INFO L93 Difference]: Finished difference Result 35 states and 38 transitions. [2018-11-23 12:54:44,122 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-23 12:54:44,122 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 15 [2018-11-23 12:54:44,124 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:54:44,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-23 12:54:44,146 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 38 transitions. [2018-11-23 12:54:44,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-23 12:54:44,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 38 transitions. [2018-11-23 12:54:44,154 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 38 transitions. [2018-11-23 12:54:44,359 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 38 edges. 38 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:54:44,369 INFO L225 Difference]: With dead ends: 35 [2018-11-23 12:54:44,369 INFO L226 Difference]: Without dead ends: 17 [2018-11-23 12:54:44,373 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-23 12:54:44,389 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2018-11-23 12:54:44,436 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2018-11-23 12:54:44,437 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:54:44,437 INFO L82 GeneralOperation]: Start isEquivalent. First operand 17 states. Second operand 17 states. [2018-11-23 12:54:44,438 INFO L74 IsIncluded]: Start isIncluded. First operand 17 states. Second operand 17 states. [2018-11-23 12:54:44,438 INFO L87 Difference]: Start difference. First operand 17 states. Second operand 17 states. [2018-11-23 12:54:44,442 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:54:44,442 INFO L93 Difference]: Finished difference Result 17 states and 17 transitions. [2018-11-23 12:54:44,442 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 17 transitions. [2018-11-23 12:54:44,443 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:54:44,443 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:54:44,443 INFO L74 IsIncluded]: Start isIncluded. First operand 17 states. Second operand 17 states. [2018-11-23 12:54:44,443 INFO L87 Difference]: Start difference. First operand 17 states. Second operand 17 states. [2018-11-23 12:54:44,447 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:54:44,447 INFO L93 Difference]: Finished difference Result 17 states and 17 transitions. [2018-11-23 12:54:44,447 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 17 transitions. [2018-11-23 12:54:44,447 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:54:44,448 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:54:44,448 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:54:44,448 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:54:44,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-11-23 12:54:44,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 17 transitions. [2018-11-23 12:54:44,453 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 17 transitions. Word has length 15 [2018-11-23 12:54:44,453 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:54:44,453 INFO L480 AbstractCegarLoop]: Abstraction has 17 states and 17 transitions. [2018-11-23 12:54:44,453 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-11-23 12:54:44,453 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 17 transitions. [2018-11-23 12:54:44,454 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-11-23 12:54:44,454 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:54:44,455 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:54:44,455 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:54:44,455 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:54:44,456 INFO L82 PathProgramCache]: Analyzing trace with hash -1249419983, now seen corresponding path program 1 times [2018-11-23 12:54:44,456 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:54:44,456 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:54:44,457 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:54:44,457 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:54:44,457 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:54:44,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:54:44,839 INFO L256 TraceCheckUtils]: 0: Hoare triple {134#true} call ULTIMATE.init(); {134#true} is VALID [2018-11-23 12:54:44,840 INFO L273 TraceCheckUtils]: 1: Hoare triple {134#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {134#true} is VALID [2018-11-23 12:54:44,840 INFO L273 TraceCheckUtils]: 2: Hoare triple {134#true} assume true; {134#true} is VALID [2018-11-23 12:54:44,840 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {134#true} {134#true} #39#return; {134#true} is VALID [2018-11-23 12:54:44,841 INFO L256 TraceCheckUtils]: 4: Hoare triple {134#true} call #t~ret6 := main(); {134#true} is VALID [2018-11-23 12:54:44,841 INFO L273 TraceCheckUtils]: 5: Hoare triple {134#true} call ~#ad1~0.base, ~#ad1~0.offset := #Ultimate.alloc(80);havoc ~ad2~0.base, ~ad2~0.offset;havoc ~i~0;havoc ~pa~0.base, ~pa~0.offset;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~i~0 := #t~nondet1;havoc #t~nondet1; {134#true} is VALID [2018-11-23 12:54:44,860 INFO L273 TraceCheckUtils]: 6: Hoare triple {134#true} assume ~i~0 >= 0 && ~i~0 < 10;~ad2~0.base, ~ad2~0.offset := ~#ad1~0.base, ~#ad1~0.offset;call write~int(~i~0, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~i~0, 4);~pa~0.base, ~pa~0.offset := ~#ad1~0.base, ~#ad1~0.offset + 8 * ~i~0;call #t~mem2 := read~int(~ad2~0.base, ~ad2~0.offset + 8 * ~i~0, 4);~i~0 := #t~mem2 - 10;havoc #t~mem2; {136#(<= (+ main_~i~0 10) (select (select |#memory_int| main_~pa~0.base) main_~pa~0.offset))} is VALID [2018-11-23 12:54:44,875 INFO L273 TraceCheckUtils]: 7: Hoare triple {136#(<= (+ main_~i~0 10) (select (select |#memory_int| main_~pa~0.base) main_~pa~0.offset))} call #t~mem3 := read~int(~pa~0.base, ~pa~0.offset, 4); {137#(<= (+ main_~i~0 10) |main_#t~mem3|)} is VALID [2018-11-23 12:54:44,889 INFO L273 TraceCheckUtils]: 8: Hoare triple {137#(<= (+ main_~i~0 10) |main_#t~mem3|)} assume !(~i~0 < #t~mem3);havoc #t~mem3; {135#false} is VALID [2018-11-23 12:54:44,890 INFO L256 TraceCheckUtils]: 9: Hoare triple {135#false} call #t~ret5 := check(~#ad1~0.base, ~#ad1~0.offset, ~i~0); {134#true} is VALID [2018-11-23 12:54:44,890 INFO L273 TraceCheckUtils]: 10: Hoare triple {134#true} ~ad1.base, ~ad1.offset := #in~ad1.base, #in~ad1.offset;~b := #in~b;call #t~mem0 := read~int(~ad1.base, ~ad1.offset + 8 * ~b, 4);#res := (if #t~mem0 == ~b then 1 else 0);havoc #t~mem0; {134#true} is VALID [2018-11-23 12:54:44,890 INFO L273 TraceCheckUtils]: 11: Hoare triple {134#true} assume true; {134#true} is VALID [2018-11-23 12:54:44,891 INFO L268 TraceCheckUtils]: 12: Hoare quadruple {134#true} {135#false} #43#return; {135#false} is VALID [2018-11-23 12:54:44,891 INFO L273 TraceCheckUtils]: 13: Hoare triple {135#false} assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647; {135#false} is VALID [2018-11-23 12:54:44,892 INFO L273 TraceCheckUtils]: 14: Hoare triple {135#false} assume 0 == #t~ret5;havoc #t~ret5; {135#false} is VALID [2018-11-23 12:54:44,892 INFO L273 TraceCheckUtils]: 15: Hoare triple {135#false} assume !false; {135#false} is VALID [2018-11-23 12:54:44,894 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:54:44,894 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 12:54:44,894 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-23 12:54:44,896 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2018-11-23 12:54:44,896 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:54:44,897 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2018-11-23 12:54:45,071 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 16 edges. 16 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:54:45,071 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-23 12:54:45,072 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-23 12:54:45,072 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-23 12:54:45,072 INFO L87 Difference]: Start difference. First operand 17 states and 17 transitions. Second operand 4 states. [2018-11-23 12:54:45,395 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:54:45,396 INFO L93 Difference]: Finished difference Result 27 states and 27 transitions. [2018-11-23 12:54:45,396 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-23 12:54:45,396 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2018-11-23 12:54:45,397 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:54:45,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-23 12:54:45,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 27 transitions. [2018-11-23 12:54:45,403 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-23 12:54:45,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 27 transitions. [2018-11-23 12:54:45,406 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 27 transitions. [2018-11-23 12:54:45,514 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 27 edges. 27 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:54:45,516 INFO L225 Difference]: With dead ends: 27 [2018-11-23 12:54:45,516 INFO L226 Difference]: Without dead ends: 19 [2018-11-23 12:54:45,518 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-23 12:54:45,520 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2018-11-23 12:54:45,648 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2018-11-23 12:54:45,648 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:54:45,649 INFO L82 GeneralOperation]: Start isEquivalent. First operand 19 states. Second operand 19 states. [2018-11-23 12:54:45,649 INFO L74 IsIncluded]: Start isIncluded. First operand 19 states. Second operand 19 states. [2018-11-23 12:54:45,649 INFO L87 Difference]: Start difference. First operand 19 states. Second operand 19 states. [2018-11-23 12:54:45,651 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:54:45,658 INFO L93 Difference]: Finished difference Result 19 states and 19 transitions. [2018-11-23 12:54:45,658 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 19 transitions. [2018-11-23 12:54:45,658 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:54:45,659 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:54:45,659 INFO L74 IsIncluded]: Start isIncluded. First operand 19 states. Second operand 19 states. [2018-11-23 12:54:45,659 INFO L87 Difference]: Start difference. First operand 19 states. Second operand 19 states. [2018-11-23 12:54:45,663 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:54:45,663 INFO L93 Difference]: Finished difference Result 19 states and 19 transitions. [2018-11-23 12:54:45,663 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 19 transitions. [2018-11-23 12:54:45,664 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:54:45,664 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:54:45,665 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:54:45,665 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:54:45,665 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2018-11-23 12:54:45,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 19 transitions. [2018-11-23 12:54:45,667 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 19 transitions. Word has length 16 [2018-11-23 12:54:45,667 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:54:45,667 INFO L480 AbstractCegarLoop]: Abstraction has 19 states and 19 transitions. [2018-11-23 12:54:45,669 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-23 12:54:45,669 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 19 transitions. [2018-11-23 12:54:45,670 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-11-23 12:54:45,670 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:54:45,670 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:54:45,670 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:54:45,671 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:54:45,671 INFO L82 PathProgramCache]: Analyzing trace with hash 1840889772, now seen corresponding path program 1 times [2018-11-23 12:54:45,671 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:54:45,671 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:54:45,672 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:54:45,673 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:54:45,673 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:54:45,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:54:46,047 INFO L256 TraceCheckUtils]: 0: Hoare triple {247#true} call ULTIMATE.init(); {247#true} is VALID [2018-11-23 12:54:46,048 INFO L273 TraceCheckUtils]: 1: Hoare triple {247#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {247#true} is VALID [2018-11-23 12:54:46,048 INFO L273 TraceCheckUtils]: 2: Hoare triple {247#true} assume true; {247#true} is VALID [2018-11-23 12:54:46,049 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {247#true} {247#true} #39#return; {247#true} is VALID [2018-11-23 12:54:46,049 INFO L256 TraceCheckUtils]: 4: Hoare triple {247#true} call #t~ret6 := main(); {247#true} is VALID [2018-11-23 12:54:46,050 INFO L273 TraceCheckUtils]: 5: Hoare triple {247#true} call ~#ad1~0.base, ~#ad1~0.offset := #Ultimate.alloc(80);havoc ~ad2~0.base, ~ad2~0.offset;havoc ~i~0;havoc ~pa~0.base, ~pa~0.offset;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~i~0 := #t~nondet1;havoc #t~nondet1; {247#true} is VALID [2018-11-23 12:54:46,051 INFO L273 TraceCheckUtils]: 6: Hoare triple {247#true} assume ~i~0 >= 0 && ~i~0 < 10;~ad2~0.base, ~ad2~0.offset := ~#ad1~0.base, ~#ad1~0.offset;call write~int(~i~0, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~i~0, 4);~pa~0.base, ~pa~0.offset := ~#ad1~0.base, ~#ad1~0.offset + 8 * ~i~0;call #t~mem2 := read~int(~ad2~0.base, ~ad2~0.offset + 8 * ~i~0, 4);~i~0 := #t~mem2 - 10;havoc #t~mem2; {249#(<= (+ main_~i~0 10) (select (select |#memory_int| main_~pa~0.base) main_~pa~0.offset))} is VALID [2018-11-23 12:54:46,052 INFO L273 TraceCheckUtils]: 7: Hoare triple {249#(<= (+ main_~i~0 10) (select (select |#memory_int| main_~pa~0.base) main_~pa~0.offset))} call #t~mem3 := read~int(~pa~0.base, ~pa~0.offset, 4); {250#(and (= |main_#t~mem3| (select (select |#memory_int| main_~pa~0.base) main_~pa~0.offset)) (<= (+ main_~i~0 10) |main_#t~mem3|))} is VALID [2018-11-23 12:54:46,054 INFO L273 TraceCheckUtils]: 8: Hoare triple {250#(and (= |main_#t~mem3| (select (select |#memory_int| main_~pa~0.base) main_~pa~0.offset)) (<= (+ main_~i~0 10) |main_#t~mem3|))} assume !!(~i~0 < #t~mem3);havoc #t~mem3;#t~pre4 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre4; {251#(<= (+ main_~i~0 9) (select (select |#memory_int| main_~pa~0.base) main_~pa~0.offset))} is VALID [2018-11-23 12:54:46,055 INFO L273 TraceCheckUtils]: 9: Hoare triple {251#(<= (+ main_~i~0 9) (select (select |#memory_int| main_~pa~0.base) main_~pa~0.offset))} call #t~mem3 := read~int(~pa~0.base, ~pa~0.offset, 4); {252#(<= (+ main_~i~0 9) |main_#t~mem3|)} is VALID [2018-11-23 12:54:46,057 INFO L273 TraceCheckUtils]: 10: Hoare triple {252#(<= (+ main_~i~0 9) |main_#t~mem3|)} assume !(~i~0 < #t~mem3);havoc #t~mem3; {248#false} is VALID [2018-11-23 12:54:46,057 INFO L256 TraceCheckUtils]: 11: Hoare triple {248#false} call #t~ret5 := check(~#ad1~0.base, ~#ad1~0.offset, ~i~0); {247#true} is VALID [2018-11-23 12:54:46,058 INFO L273 TraceCheckUtils]: 12: Hoare triple {247#true} ~ad1.base, ~ad1.offset := #in~ad1.base, #in~ad1.offset;~b := #in~b;call #t~mem0 := read~int(~ad1.base, ~ad1.offset + 8 * ~b, 4);#res := (if #t~mem0 == ~b then 1 else 0);havoc #t~mem0; {247#true} is VALID [2018-11-23 12:54:46,058 INFO L273 TraceCheckUtils]: 13: Hoare triple {247#true} assume true; {247#true} is VALID [2018-11-23 12:54:46,058 INFO L268 TraceCheckUtils]: 14: Hoare quadruple {247#true} {248#false} #43#return; {248#false} is VALID [2018-11-23 12:54:46,058 INFO L273 TraceCheckUtils]: 15: Hoare triple {248#false} assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647; {248#false} is VALID [2018-11-23 12:54:46,059 INFO L273 TraceCheckUtils]: 16: Hoare triple {248#false} assume 0 == #t~ret5;havoc #t~ret5; {248#false} is VALID [2018-11-23 12:54:46,059 INFO L273 TraceCheckUtils]: 17: Hoare triple {248#false} assume !false; {248#false} is VALID [2018-11-23 12:54:46,061 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:54:46,061 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:54:46,062 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 12:54:46,077 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:54:46,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:54:46,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:54:46,143 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:54:46,438 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2018-11-23 12:54:46,450 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2018-11-23 12:54:46,464 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 12:54:46,467 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 12:54:46,473 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 12:54:46,473 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:17, output treesize:5 [2018-11-23 12:54:46,477 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-23 12:54:46,477 WARN L384 uantifierElimination]: Input elimination task: ∃ [|#memory_int|, main_~pa~0.base, main_~pa~0.offset]. (let ((.cse0 (select (select |#memory_int| main_~pa~0.base) main_~pa~0.offset))) (and (<= (+ main_~i~0 9) .cse0) (<= .cse0 |main_#t~mem3|))) [2018-11-23 12:54:46,478 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ []. (<= (+ main_~i~0 9) |main_#t~mem3|) [2018-11-23 12:54:46,506 INFO L256 TraceCheckUtils]: 0: Hoare triple {247#true} call ULTIMATE.init(); {247#true} is VALID [2018-11-23 12:54:46,506 INFO L273 TraceCheckUtils]: 1: Hoare triple {247#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {247#true} is VALID [2018-11-23 12:54:46,507 INFO L273 TraceCheckUtils]: 2: Hoare triple {247#true} assume true; {247#true} is VALID [2018-11-23 12:54:46,507 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {247#true} {247#true} #39#return; {247#true} is VALID [2018-11-23 12:54:46,507 INFO L256 TraceCheckUtils]: 4: Hoare triple {247#true} call #t~ret6 := main(); {247#true} is VALID [2018-11-23 12:54:46,508 INFO L273 TraceCheckUtils]: 5: Hoare triple {247#true} call ~#ad1~0.base, ~#ad1~0.offset := #Ultimate.alloc(80);havoc ~ad2~0.base, ~ad2~0.offset;havoc ~i~0;havoc ~pa~0.base, ~pa~0.offset;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~i~0 := #t~nondet1;havoc #t~nondet1; {247#true} is VALID [2018-11-23 12:54:46,512 INFO L273 TraceCheckUtils]: 6: Hoare triple {247#true} assume ~i~0 >= 0 && ~i~0 < 10;~ad2~0.base, ~ad2~0.offset := ~#ad1~0.base, ~#ad1~0.offset;call write~int(~i~0, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~i~0, 4);~pa~0.base, ~pa~0.offset := ~#ad1~0.base, ~#ad1~0.offset + 8 * ~i~0;call #t~mem2 := read~int(~ad2~0.base, ~ad2~0.offset + 8 * ~i~0, 4);~i~0 := #t~mem2 - 10;havoc #t~mem2; {249#(<= (+ main_~i~0 10) (select (select |#memory_int| main_~pa~0.base) main_~pa~0.offset))} is VALID [2018-11-23 12:54:46,514 INFO L273 TraceCheckUtils]: 7: Hoare triple {249#(<= (+ main_~i~0 10) (select (select |#memory_int| main_~pa~0.base) main_~pa~0.offset))} call #t~mem3 := read~int(~pa~0.base, ~pa~0.offset, 4); {249#(<= (+ main_~i~0 10) (select (select |#memory_int| main_~pa~0.base) main_~pa~0.offset))} is VALID [2018-11-23 12:54:46,515 INFO L273 TraceCheckUtils]: 8: Hoare triple {249#(<= (+ main_~i~0 10) (select (select |#memory_int| main_~pa~0.base) main_~pa~0.offset))} assume !!(~i~0 < #t~mem3);havoc #t~mem3;#t~pre4 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre4; {251#(<= (+ main_~i~0 9) (select (select |#memory_int| main_~pa~0.base) main_~pa~0.offset))} is VALID [2018-11-23 12:54:46,516 INFO L273 TraceCheckUtils]: 9: Hoare triple {251#(<= (+ main_~i~0 9) (select (select |#memory_int| main_~pa~0.base) main_~pa~0.offset))} call #t~mem3 := read~int(~pa~0.base, ~pa~0.offset, 4); {252#(<= (+ main_~i~0 9) |main_#t~mem3|)} is VALID [2018-11-23 12:54:46,516 INFO L273 TraceCheckUtils]: 10: Hoare triple {252#(<= (+ main_~i~0 9) |main_#t~mem3|)} assume !(~i~0 < #t~mem3);havoc #t~mem3; {248#false} is VALID [2018-11-23 12:54:46,517 INFO L256 TraceCheckUtils]: 11: Hoare triple {248#false} call #t~ret5 := check(~#ad1~0.base, ~#ad1~0.offset, ~i~0); {248#false} is VALID [2018-11-23 12:54:46,517 INFO L273 TraceCheckUtils]: 12: Hoare triple {248#false} ~ad1.base, ~ad1.offset := #in~ad1.base, #in~ad1.offset;~b := #in~b;call #t~mem0 := read~int(~ad1.base, ~ad1.offset + 8 * ~b, 4);#res := (if #t~mem0 == ~b then 1 else 0);havoc #t~mem0; {248#false} is VALID [2018-11-23 12:54:46,517 INFO L273 TraceCheckUtils]: 13: Hoare triple {248#false} assume true; {248#false} is VALID [2018-11-23 12:54:46,518 INFO L268 TraceCheckUtils]: 14: Hoare quadruple {248#false} {248#false} #43#return; {248#false} is VALID [2018-11-23 12:54:46,518 INFO L273 TraceCheckUtils]: 15: Hoare triple {248#false} assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647; {248#false} is VALID [2018-11-23 12:54:46,519 INFO L273 TraceCheckUtils]: 16: Hoare triple {248#false} assume 0 == #t~ret5;havoc #t~ret5; {248#false} is VALID [2018-11-23 12:54:46,519 INFO L273 TraceCheckUtils]: 17: Hoare triple {248#false} assume !false; {248#false} is VALID [2018-11-23 12:54:46,522 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:54:46,551 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:54:46,552 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5] total 6 [2018-11-23 12:54:46,552 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 18 [2018-11-23 12:54:46,553 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:54:46,553 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2018-11-23 12:54:46,661 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 24 edges. 24 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:54:46,662 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-23 12:54:46,662 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-23 12:54:46,663 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-11-23 12:54:46,663 INFO L87 Difference]: Start difference. First operand 19 states and 19 transitions. Second operand 6 states. [2018-11-23 12:54:46,960 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:54:46,960 INFO L93 Difference]: Finished difference Result 29 states and 29 transitions. [2018-11-23 12:54:46,961 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-23 12:54:46,961 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 18 [2018-11-23 12:54:46,961 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:54:46,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-23 12:54:46,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 29 transitions. [2018-11-23 12:54:46,964 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-23 12:54:46,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 29 transitions. [2018-11-23 12:54:46,966 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 29 transitions. [2018-11-23 12:54:47,056 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 29 edges. 29 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:54:47,059 INFO L225 Difference]: With dead ends: 29 [2018-11-23 12:54:47,059 INFO L226 Difference]: Without dead ends: 21 [2018-11-23 12:54:47,060 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2018-11-23 12:54:47,060 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2018-11-23 12:54:47,093 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2018-11-23 12:54:47,094 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:54:47,094 INFO L82 GeneralOperation]: Start isEquivalent. First operand 21 states. Second operand 21 states. [2018-11-23 12:54:47,094 INFO L74 IsIncluded]: Start isIncluded. First operand 21 states. Second operand 21 states. [2018-11-23 12:54:47,094 INFO L87 Difference]: Start difference. First operand 21 states. Second operand 21 states. [2018-11-23 12:54:47,096 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:54:47,096 INFO L93 Difference]: Finished difference Result 21 states and 21 transitions. [2018-11-23 12:54:47,096 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 21 transitions. [2018-11-23 12:54:47,097 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:54:47,097 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:54:47,097 INFO L74 IsIncluded]: Start isIncluded. First operand 21 states. Second operand 21 states. [2018-11-23 12:54:47,097 INFO L87 Difference]: Start difference. First operand 21 states. Second operand 21 states. [2018-11-23 12:54:47,099 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:54:47,099 INFO L93 Difference]: Finished difference Result 21 states and 21 transitions. [2018-11-23 12:54:47,100 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 21 transitions. [2018-11-23 12:54:47,100 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:54:47,100 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:54:47,101 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:54:47,101 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:54:47,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2018-11-23 12:54:47,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 21 transitions. [2018-11-23 12:54:47,103 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 21 transitions. Word has length 18 [2018-11-23 12:54:47,103 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:54:47,103 INFO L480 AbstractCegarLoop]: Abstraction has 21 states and 21 transitions. [2018-11-23 12:54:47,103 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-23 12:54:47,104 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 21 transitions. [2018-11-23 12:54:47,104 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-11-23 12:54:47,104 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:54:47,105 INFO L402 BasicCegarLoop]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:54:47,105 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:54:47,105 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:54:47,105 INFO L82 PathProgramCache]: Analyzing trace with hash -488804505, now seen corresponding path program 2 times [2018-11-23 12:54:47,106 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:54:47,106 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:54:47,107 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:54:47,107 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:54:47,107 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:54:47,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:54:47,333 INFO L256 TraceCheckUtils]: 0: Hoare triple {423#true} call ULTIMATE.init(); {423#true} is VALID [2018-11-23 12:54:47,333 INFO L273 TraceCheckUtils]: 1: Hoare triple {423#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {423#true} is VALID [2018-11-23 12:54:47,334 INFO L273 TraceCheckUtils]: 2: Hoare triple {423#true} assume true; {423#true} is VALID [2018-11-23 12:54:47,334 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {423#true} {423#true} #39#return; {423#true} is VALID [2018-11-23 12:54:47,335 INFO L256 TraceCheckUtils]: 4: Hoare triple {423#true} call #t~ret6 := main(); {423#true} is VALID [2018-11-23 12:54:47,335 INFO L273 TraceCheckUtils]: 5: Hoare triple {423#true} call ~#ad1~0.base, ~#ad1~0.offset := #Ultimate.alloc(80);havoc ~ad2~0.base, ~ad2~0.offset;havoc ~i~0;havoc ~pa~0.base, ~pa~0.offset;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~i~0 := #t~nondet1;havoc #t~nondet1; {423#true} is VALID [2018-11-23 12:54:47,337 INFO L273 TraceCheckUtils]: 6: Hoare triple {423#true} assume ~i~0 >= 0 && ~i~0 < 10;~ad2~0.base, ~ad2~0.offset := ~#ad1~0.base, ~#ad1~0.offset;call write~int(~i~0, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~i~0, 4);~pa~0.base, ~pa~0.offset := ~#ad1~0.base, ~#ad1~0.offset + 8 * ~i~0;call #t~mem2 := read~int(~ad2~0.base, ~ad2~0.offset + 8 * ~i~0, 4);~i~0 := #t~mem2 - 10;havoc #t~mem2; {425#(<= (+ main_~i~0 3) (select (select |#memory_int| main_~pa~0.base) main_~pa~0.offset))} is VALID [2018-11-23 12:54:47,338 INFO L273 TraceCheckUtils]: 7: Hoare triple {425#(<= (+ main_~i~0 3) (select (select |#memory_int| main_~pa~0.base) main_~pa~0.offset))} call #t~mem3 := read~int(~pa~0.base, ~pa~0.offset, 4); {425#(<= (+ main_~i~0 3) (select (select |#memory_int| main_~pa~0.base) main_~pa~0.offset))} is VALID [2018-11-23 12:54:47,340 INFO L273 TraceCheckUtils]: 8: Hoare triple {425#(<= (+ main_~i~0 3) (select (select |#memory_int| main_~pa~0.base) main_~pa~0.offset))} assume !!(~i~0 < #t~mem3);havoc #t~mem3;#t~pre4 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre4; {426#(<= (+ main_~i~0 2) (select (select |#memory_int| main_~pa~0.base) main_~pa~0.offset))} is VALID [2018-11-23 12:54:47,341 INFO L273 TraceCheckUtils]: 9: Hoare triple {426#(<= (+ main_~i~0 2) (select (select |#memory_int| main_~pa~0.base) main_~pa~0.offset))} call #t~mem3 := read~int(~pa~0.base, ~pa~0.offset, 4); {426#(<= (+ main_~i~0 2) (select (select |#memory_int| main_~pa~0.base) main_~pa~0.offset))} is VALID [2018-11-23 12:54:47,342 INFO L273 TraceCheckUtils]: 10: Hoare triple {426#(<= (+ main_~i~0 2) (select (select |#memory_int| main_~pa~0.base) main_~pa~0.offset))} assume !!(~i~0 < #t~mem3);havoc #t~mem3;#t~pre4 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre4; {427#(<= (+ main_~i~0 1) (select (select |#memory_int| main_~pa~0.base) main_~pa~0.offset))} is VALID [2018-11-23 12:54:47,343 INFO L273 TraceCheckUtils]: 11: Hoare triple {427#(<= (+ main_~i~0 1) (select (select |#memory_int| main_~pa~0.base) main_~pa~0.offset))} call #t~mem3 := read~int(~pa~0.base, ~pa~0.offset, 4); {428#(<= (+ main_~i~0 1) |main_#t~mem3|)} is VALID [2018-11-23 12:54:47,344 INFO L273 TraceCheckUtils]: 12: Hoare triple {428#(<= (+ main_~i~0 1) |main_#t~mem3|)} assume !(~i~0 < #t~mem3);havoc #t~mem3; {424#false} is VALID [2018-11-23 12:54:47,345 INFO L256 TraceCheckUtils]: 13: Hoare triple {424#false} call #t~ret5 := check(~#ad1~0.base, ~#ad1~0.offset, ~i~0); {423#true} is VALID [2018-11-23 12:54:47,345 INFO L273 TraceCheckUtils]: 14: Hoare triple {423#true} ~ad1.base, ~ad1.offset := #in~ad1.base, #in~ad1.offset;~b := #in~b;call #t~mem0 := read~int(~ad1.base, ~ad1.offset + 8 * ~b, 4);#res := (if #t~mem0 == ~b then 1 else 0);havoc #t~mem0; {423#true} is VALID [2018-11-23 12:54:47,346 INFO L273 TraceCheckUtils]: 15: Hoare triple {423#true} assume true; {423#true} is VALID [2018-11-23 12:54:47,346 INFO L268 TraceCheckUtils]: 16: Hoare quadruple {423#true} {424#false} #43#return; {424#false} is VALID [2018-11-23 12:54:47,346 INFO L273 TraceCheckUtils]: 17: Hoare triple {424#false} assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647; {424#false} is VALID [2018-11-23 12:54:47,347 INFO L273 TraceCheckUtils]: 18: Hoare triple {424#false} assume 0 == #t~ret5;havoc #t~ret5; {424#false} is VALID [2018-11-23 12:54:47,347 INFO L273 TraceCheckUtils]: 19: Hoare triple {424#false} assume !false; {424#false} is VALID [2018-11-23 12:54:47,348 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:54:47,349 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:54:47,349 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 12:54:47,359 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-23 12:54:47,384 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-23 12:54:47,384 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:54:47,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:54:47,397 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:54:47,479 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-11-23 12:54:47,496 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-11-23 12:54:47,498 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 12:54:47,503 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 12:54:47,512 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 12:54:47,513 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:21, output treesize:9 [2018-11-23 12:54:47,517 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-23 12:54:47,517 WARN L384 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_7|, v_main_~i~0_13]. (and (= (store |v_#memory_int_7| main_~pa~0.base (store (select |v_#memory_int_7| main_~pa~0.base) main_~pa~0.offset v_main_~i~0_13)) |#memory_int|) (<= (+ main_~i~0 10) (select (select |#memory_int| main_~pa~0.base) main_~pa~0.offset))) [2018-11-23 12:54:47,517 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ []. (<= (+ main_~i~0 10) (select (select |#memory_int| main_~pa~0.base) main_~pa~0.offset)) [2018-11-23 12:54:47,620 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2018-11-23 12:54:47,628 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2018-11-23 12:54:47,632 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 12:54:47,635 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 12:54:47,638 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 12:54:47,638 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:17, output treesize:5 [2018-11-23 12:54:47,641 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-23 12:54:47,641 WARN L384 uantifierElimination]: Input elimination task: ∃ [|#memory_int|, main_~pa~0.base, main_~pa~0.offset]. (let ((.cse0 (select (select |#memory_int| main_~pa~0.base) main_~pa~0.offset))) (and (<= .cse0 |main_#t~mem3|) (<= (+ main_~i~0 8) .cse0))) [2018-11-23 12:54:47,641 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ []. (<= (+ main_~i~0 8) |main_#t~mem3|) [2018-11-23 12:54:47,682 INFO L256 TraceCheckUtils]: 0: Hoare triple {423#true} call ULTIMATE.init(); {423#true} is VALID [2018-11-23 12:54:47,682 INFO L273 TraceCheckUtils]: 1: Hoare triple {423#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {423#true} is VALID [2018-11-23 12:54:47,682 INFO L273 TraceCheckUtils]: 2: Hoare triple {423#true} assume true; {423#true} is VALID [2018-11-23 12:54:47,683 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {423#true} {423#true} #39#return; {423#true} is VALID [2018-11-23 12:54:47,683 INFO L256 TraceCheckUtils]: 4: Hoare triple {423#true} call #t~ret6 := main(); {423#true} is VALID [2018-11-23 12:54:47,683 INFO L273 TraceCheckUtils]: 5: Hoare triple {423#true} call ~#ad1~0.base, ~#ad1~0.offset := #Ultimate.alloc(80);havoc ~ad2~0.base, ~ad2~0.offset;havoc ~i~0;havoc ~pa~0.base, ~pa~0.offset;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~i~0 := #t~nondet1;havoc #t~nondet1; {423#true} is VALID [2018-11-23 12:54:47,684 INFO L273 TraceCheckUtils]: 6: Hoare triple {423#true} assume ~i~0 >= 0 && ~i~0 < 10;~ad2~0.base, ~ad2~0.offset := ~#ad1~0.base, ~#ad1~0.offset;call write~int(~i~0, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~i~0, 4);~pa~0.base, ~pa~0.offset := ~#ad1~0.base, ~#ad1~0.offset + 8 * ~i~0;call #t~mem2 := read~int(~ad2~0.base, ~ad2~0.offset + 8 * ~i~0, 4);~i~0 := #t~mem2 - 10;havoc #t~mem2; {450#(<= (+ main_~i~0 10) (select (select |#memory_int| main_~pa~0.base) main_~pa~0.offset))} is VALID [2018-11-23 12:54:47,685 INFO L273 TraceCheckUtils]: 7: Hoare triple {450#(<= (+ main_~i~0 10) (select (select |#memory_int| main_~pa~0.base) main_~pa~0.offset))} call #t~mem3 := read~int(~pa~0.base, ~pa~0.offset, 4); {450#(<= (+ main_~i~0 10) (select (select |#memory_int| main_~pa~0.base) main_~pa~0.offset))} is VALID [2018-11-23 12:54:47,686 INFO L273 TraceCheckUtils]: 8: Hoare triple {450#(<= (+ main_~i~0 10) (select (select |#memory_int| main_~pa~0.base) main_~pa~0.offset))} assume !!(~i~0 < #t~mem3);havoc #t~mem3;#t~pre4 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre4; {457#(<= (+ main_~i~0 9) (select (select |#memory_int| main_~pa~0.base) main_~pa~0.offset))} is VALID [2018-11-23 12:54:47,686 INFO L273 TraceCheckUtils]: 9: Hoare triple {457#(<= (+ main_~i~0 9) (select (select |#memory_int| main_~pa~0.base) main_~pa~0.offset))} call #t~mem3 := read~int(~pa~0.base, ~pa~0.offset, 4); {457#(<= (+ main_~i~0 9) (select (select |#memory_int| main_~pa~0.base) main_~pa~0.offset))} is VALID [2018-11-23 12:54:47,687 INFO L273 TraceCheckUtils]: 10: Hoare triple {457#(<= (+ main_~i~0 9) (select (select |#memory_int| main_~pa~0.base) main_~pa~0.offset))} assume !!(~i~0 < #t~mem3);havoc #t~mem3;#t~pre4 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre4; {464#(<= (+ main_~i~0 8) (select (select |#memory_int| main_~pa~0.base) main_~pa~0.offset))} is VALID [2018-11-23 12:54:47,689 INFO L273 TraceCheckUtils]: 11: Hoare triple {464#(<= (+ main_~i~0 8) (select (select |#memory_int| main_~pa~0.base) main_~pa~0.offset))} call #t~mem3 := read~int(~pa~0.base, ~pa~0.offset, 4); {468#(<= (+ main_~i~0 8) |main_#t~mem3|)} is VALID [2018-11-23 12:54:47,690 INFO L273 TraceCheckUtils]: 12: Hoare triple {468#(<= (+ main_~i~0 8) |main_#t~mem3|)} assume !(~i~0 < #t~mem3);havoc #t~mem3; {424#false} is VALID [2018-11-23 12:54:47,690 INFO L256 TraceCheckUtils]: 13: Hoare triple {424#false} call #t~ret5 := check(~#ad1~0.base, ~#ad1~0.offset, ~i~0); {424#false} is VALID [2018-11-23 12:54:47,691 INFO L273 TraceCheckUtils]: 14: Hoare triple {424#false} ~ad1.base, ~ad1.offset := #in~ad1.base, #in~ad1.offset;~b := #in~b;call #t~mem0 := read~int(~ad1.base, ~ad1.offset + 8 * ~b, 4);#res := (if #t~mem0 == ~b then 1 else 0);havoc #t~mem0; {424#false} is VALID [2018-11-23 12:54:47,691 INFO L273 TraceCheckUtils]: 15: Hoare triple {424#false} assume true; {424#false} is VALID [2018-11-23 12:54:47,692 INFO L268 TraceCheckUtils]: 16: Hoare quadruple {424#false} {424#false} #43#return; {424#false} is VALID [2018-11-23 12:54:47,692 INFO L273 TraceCheckUtils]: 17: Hoare triple {424#false} assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647; {424#false} is VALID [2018-11-23 12:54:47,693 INFO L273 TraceCheckUtils]: 18: Hoare triple {424#false} assume 0 == #t~ret5;havoc #t~ret5; {424#false} is VALID [2018-11-23 12:54:47,693 INFO L273 TraceCheckUtils]: 19: Hoare triple {424#false} assume !false; {424#false} is VALID [2018-11-23 12:54:47,695 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:54:47,715 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:54:47,715 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 10 [2018-11-23 12:54:47,716 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 20 [2018-11-23 12:54:47,716 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:54:47,717 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states. [2018-11-23 12:54:47,755 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 31 edges. 31 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:54:47,756 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-11-23 12:54:47,756 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-11-23 12:54:47,757 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2018-11-23 12:54:47,757 INFO L87 Difference]: Start difference. First operand 21 states and 21 transitions. Second operand 10 states. [2018-11-23 12:54:48,220 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:54:48,221 INFO L93 Difference]: Finished difference Result 37 states and 40 transitions. [2018-11-23 12:54:48,221 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-11-23 12:54:48,221 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 20 [2018-11-23 12:54:48,221 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:54:48,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2018-11-23 12:54:48,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 40 transitions. [2018-11-23 12:54:48,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2018-11-23 12:54:48,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 40 transitions. [2018-11-23 12:54:48,227 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 14 states and 40 transitions. [2018-11-23 12:54:48,309 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 40 edges. 40 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:54:48,310 INFO L225 Difference]: With dead ends: 37 [2018-11-23 12:54:48,311 INFO L226 Difference]: Without dead ends: 29 [2018-11-23 12:54:48,311 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=90, Invalid=150, Unknown=0, NotChecked=0, Total=240 [2018-11-23 12:54:48,312 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2018-11-23 12:54:48,341 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2018-11-23 12:54:48,342 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:54:48,342 INFO L82 GeneralOperation]: Start isEquivalent. First operand 29 states. Second operand 29 states. [2018-11-23 12:54:48,342 INFO L74 IsIncluded]: Start isIncluded. First operand 29 states. Second operand 29 states. [2018-11-23 12:54:48,342 INFO L87 Difference]: Start difference. First operand 29 states. Second operand 29 states. [2018-11-23 12:54:48,345 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:54:48,345 INFO L93 Difference]: Finished difference Result 29 states and 29 transitions. [2018-11-23 12:54:48,345 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 29 transitions. [2018-11-23 12:54:48,346 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:54:48,346 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:54:48,346 INFO L74 IsIncluded]: Start isIncluded. First operand 29 states. Second operand 29 states. [2018-11-23 12:54:48,346 INFO L87 Difference]: Start difference. First operand 29 states. Second operand 29 states. [2018-11-23 12:54:48,348 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:54:48,349 INFO L93 Difference]: Finished difference Result 29 states and 29 transitions. [2018-11-23 12:54:48,349 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 29 transitions. [2018-11-23 12:54:48,349 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:54:48,350 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:54:48,350 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:54:48,350 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:54:48,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2018-11-23 12:54:48,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 29 transitions. [2018-11-23 12:54:48,352 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 29 transitions. Word has length 20 [2018-11-23 12:54:48,353 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:54:48,353 INFO L480 AbstractCegarLoop]: Abstraction has 29 states and 29 transitions. [2018-11-23 12:54:48,353 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-11-23 12:54:48,353 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 29 transitions. [2018-11-23 12:54:48,354 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-11-23 12:54:48,354 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:54:48,354 INFO L402 BasicCegarLoop]: trace histogram [7, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:54:48,355 INFO L423 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:54:48,355 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:54:48,355 INFO L82 PathProgramCache]: Analyzing trace with hash 57078483, now seen corresponding path program 3 times [2018-11-23 12:54:48,355 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:54:48,355 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:54:48,356 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:54:48,356 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:54:48,357 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:54:48,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:54:48,647 INFO L256 TraceCheckUtils]: 0: Hoare triple {659#true} call ULTIMATE.init(); {659#true} is VALID [2018-11-23 12:54:48,648 INFO L273 TraceCheckUtils]: 1: Hoare triple {659#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {659#true} is VALID [2018-11-23 12:54:48,648 INFO L273 TraceCheckUtils]: 2: Hoare triple {659#true} assume true; {659#true} is VALID [2018-11-23 12:54:48,648 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {659#true} {659#true} #39#return; {659#true} is VALID [2018-11-23 12:54:48,649 INFO L256 TraceCheckUtils]: 4: Hoare triple {659#true} call #t~ret6 := main(); {659#true} is VALID [2018-11-23 12:54:48,649 INFO L273 TraceCheckUtils]: 5: Hoare triple {659#true} call ~#ad1~0.base, ~#ad1~0.offset := #Ultimate.alloc(80);havoc ~ad2~0.base, ~ad2~0.offset;havoc ~i~0;havoc ~pa~0.base, ~pa~0.offset;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~i~0 := #t~nondet1;havoc #t~nondet1; {659#true} is VALID [2018-11-23 12:54:48,651 INFO L273 TraceCheckUtils]: 6: Hoare triple {659#true} assume ~i~0 >= 0 && ~i~0 < 10;~ad2~0.base, ~ad2~0.offset := ~#ad1~0.base, ~#ad1~0.offset;call write~int(~i~0, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~i~0, 4);~pa~0.base, ~pa~0.offset := ~#ad1~0.base, ~#ad1~0.offset + 8 * ~i~0;call #t~mem2 := read~int(~ad2~0.base, ~ad2~0.offset + 8 * ~i~0, 4);~i~0 := #t~mem2 - 10;havoc #t~mem2; {661#(<= (+ main_~i~0 7) (select (select |#memory_int| main_~pa~0.base) main_~pa~0.offset))} is VALID [2018-11-23 12:54:48,651 INFO L273 TraceCheckUtils]: 7: Hoare triple {661#(<= (+ main_~i~0 7) (select (select |#memory_int| main_~pa~0.base) main_~pa~0.offset))} call #t~mem3 := read~int(~pa~0.base, ~pa~0.offset, 4); {661#(<= (+ main_~i~0 7) (select (select |#memory_int| main_~pa~0.base) main_~pa~0.offset))} is VALID [2018-11-23 12:54:48,652 INFO L273 TraceCheckUtils]: 8: Hoare triple {661#(<= (+ main_~i~0 7) (select (select |#memory_int| main_~pa~0.base) main_~pa~0.offset))} assume !!(~i~0 < #t~mem3);havoc #t~mem3;#t~pre4 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre4; {662#(<= (+ main_~i~0 6) (select (select |#memory_int| main_~pa~0.base) main_~pa~0.offset))} is VALID [2018-11-23 12:54:48,652 INFO L273 TraceCheckUtils]: 9: Hoare triple {662#(<= (+ main_~i~0 6) (select (select |#memory_int| main_~pa~0.base) main_~pa~0.offset))} call #t~mem3 := read~int(~pa~0.base, ~pa~0.offset, 4); {662#(<= (+ main_~i~0 6) (select (select |#memory_int| main_~pa~0.base) main_~pa~0.offset))} is VALID [2018-11-23 12:54:48,653 INFO L273 TraceCheckUtils]: 10: Hoare triple {662#(<= (+ main_~i~0 6) (select (select |#memory_int| main_~pa~0.base) main_~pa~0.offset))} assume !!(~i~0 < #t~mem3);havoc #t~mem3;#t~pre4 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre4; {663#(<= (+ main_~i~0 5) (select (select |#memory_int| main_~pa~0.base) main_~pa~0.offset))} is VALID [2018-11-23 12:54:48,654 INFO L273 TraceCheckUtils]: 11: Hoare triple {663#(<= (+ main_~i~0 5) (select (select |#memory_int| main_~pa~0.base) main_~pa~0.offset))} call #t~mem3 := read~int(~pa~0.base, ~pa~0.offset, 4); {663#(<= (+ main_~i~0 5) (select (select |#memory_int| main_~pa~0.base) main_~pa~0.offset))} is VALID [2018-11-23 12:54:48,655 INFO L273 TraceCheckUtils]: 12: Hoare triple {663#(<= (+ main_~i~0 5) (select (select |#memory_int| main_~pa~0.base) main_~pa~0.offset))} assume !!(~i~0 < #t~mem3);havoc #t~mem3;#t~pre4 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre4; {664#(<= (+ main_~i~0 4) (select (select |#memory_int| main_~pa~0.base) main_~pa~0.offset))} is VALID [2018-11-23 12:54:48,656 INFO L273 TraceCheckUtils]: 13: Hoare triple {664#(<= (+ main_~i~0 4) (select (select |#memory_int| main_~pa~0.base) main_~pa~0.offset))} call #t~mem3 := read~int(~pa~0.base, ~pa~0.offset, 4); {664#(<= (+ main_~i~0 4) (select (select |#memory_int| main_~pa~0.base) main_~pa~0.offset))} is VALID [2018-11-23 12:54:48,672 INFO L273 TraceCheckUtils]: 14: Hoare triple {664#(<= (+ main_~i~0 4) (select (select |#memory_int| main_~pa~0.base) main_~pa~0.offset))} assume !!(~i~0 < #t~mem3);havoc #t~mem3;#t~pre4 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre4; {665#(<= (+ main_~i~0 3) (select (select |#memory_int| main_~pa~0.base) main_~pa~0.offset))} is VALID [2018-11-23 12:54:48,673 INFO L273 TraceCheckUtils]: 15: Hoare triple {665#(<= (+ main_~i~0 3) (select (select |#memory_int| main_~pa~0.base) main_~pa~0.offset))} call #t~mem3 := read~int(~pa~0.base, ~pa~0.offset, 4); {665#(<= (+ main_~i~0 3) (select (select |#memory_int| main_~pa~0.base) main_~pa~0.offset))} is VALID [2018-11-23 12:54:48,674 INFO L273 TraceCheckUtils]: 16: Hoare triple {665#(<= (+ main_~i~0 3) (select (select |#memory_int| main_~pa~0.base) main_~pa~0.offset))} assume !!(~i~0 < #t~mem3);havoc #t~mem3;#t~pre4 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre4; {666#(<= (+ main_~i~0 2) (select (select |#memory_int| main_~pa~0.base) main_~pa~0.offset))} is VALID [2018-11-23 12:54:48,675 INFO L273 TraceCheckUtils]: 17: Hoare triple {666#(<= (+ main_~i~0 2) (select (select |#memory_int| main_~pa~0.base) main_~pa~0.offset))} call #t~mem3 := read~int(~pa~0.base, ~pa~0.offset, 4); {666#(<= (+ main_~i~0 2) (select (select |#memory_int| main_~pa~0.base) main_~pa~0.offset))} is VALID [2018-11-23 12:54:48,678 INFO L273 TraceCheckUtils]: 18: Hoare triple {666#(<= (+ main_~i~0 2) (select (select |#memory_int| main_~pa~0.base) main_~pa~0.offset))} assume !!(~i~0 < #t~mem3);havoc #t~mem3;#t~pre4 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre4; {667#(<= (+ main_~i~0 1) (select (select |#memory_int| main_~pa~0.base) main_~pa~0.offset))} is VALID [2018-11-23 12:54:48,679 INFO L273 TraceCheckUtils]: 19: Hoare triple {667#(<= (+ main_~i~0 1) (select (select |#memory_int| main_~pa~0.base) main_~pa~0.offset))} call #t~mem3 := read~int(~pa~0.base, ~pa~0.offset, 4); {668#(<= (+ main_~i~0 1) |main_#t~mem3|)} is VALID [2018-11-23 12:54:48,680 INFO L273 TraceCheckUtils]: 20: Hoare triple {668#(<= (+ main_~i~0 1) |main_#t~mem3|)} assume !(~i~0 < #t~mem3);havoc #t~mem3; {660#false} is VALID [2018-11-23 12:54:48,680 INFO L256 TraceCheckUtils]: 21: Hoare triple {660#false} call #t~ret5 := check(~#ad1~0.base, ~#ad1~0.offset, ~i~0); {659#true} is VALID [2018-11-23 12:54:48,680 INFO L273 TraceCheckUtils]: 22: Hoare triple {659#true} ~ad1.base, ~ad1.offset := #in~ad1.base, #in~ad1.offset;~b := #in~b;call #t~mem0 := read~int(~ad1.base, ~ad1.offset + 8 * ~b, 4);#res := (if #t~mem0 == ~b then 1 else 0);havoc #t~mem0; {659#true} is VALID [2018-11-23 12:54:48,681 INFO L273 TraceCheckUtils]: 23: Hoare triple {659#true} assume true; {659#true} is VALID [2018-11-23 12:54:48,681 INFO L268 TraceCheckUtils]: 24: Hoare quadruple {659#true} {660#false} #43#return; {660#false} is VALID [2018-11-23 12:54:48,681 INFO L273 TraceCheckUtils]: 25: Hoare triple {660#false} assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647; {660#false} is VALID [2018-11-23 12:54:48,682 INFO L273 TraceCheckUtils]: 26: Hoare triple {660#false} assume 0 == #t~ret5;havoc #t~ret5; {660#false} is VALID [2018-11-23 12:54:48,682 INFO L273 TraceCheckUtils]: 27: Hoare triple {660#false} assume !false; {660#false} is VALID [2018-11-23 12:54:48,686 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:54:48,686 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:54:48,686 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 12:54:48,704 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-23 12:54:48,766 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-11-23 12:54:48,766 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:54:48,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:54:48,798 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:54:48,913 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 12 [2018-11-23 12:54:48,921 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-11-23 12:54:48,925 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 12:54:48,927 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 12:54:48,940 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 12:54:48,940 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:26, output treesize:22 [2018-11-23 12:54:48,944 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-23 12:54:48,945 WARN L384 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_8|, v_main_~i~0_16]. (let ((.cse0 (+ (* 8 v_main_~i~0_16) |main_~#ad1~0.offset|))) (and (= (store |v_#memory_int_8| |main_~#ad1~0.base| (store (select |v_#memory_int_8| |main_~#ad1~0.base|) .cse0 v_main_~i~0_16)) |#memory_int|) (= main_~pa~0.base |main_~#ad1~0.base|) (= .cse0 main_~pa~0.offset))) [2018-11-23 12:54:48,945 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ [v_main_~i~0_16]. (let ((.cse0 (+ (* 8 v_main_~i~0_16) |main_~#ad1~0.offset|))) (and (= v_main_~i~0_16 (select (select |#memory_int| main_~pa~0.base) .cse0)) (= main_~pa~0.base |main_~#ad1~0.base|) (= .cse0 main_~pa~0.offset))) [2018-11-23 12:54:51,731 WARN L854 $PredicateComparison]: unable to prove that (exists ((|v_main_~#ad1~0.base_BEFORE_CALL_1| Int) (v_main_~i~0_16 Int) (|v_main_~#ad1~0.offset_BEFORE_CALL_1| Int)) (= v_main_~i~0_16 (select (select |c_#memory_int| |v_main_~#ad1~0.base_BEFORE_CALL_1|) (+ (* 8 v_main_~i~0_16) |v_main_~#ad1~0.offset_BEFORE_CALL_1|)))) is different from true [2018-11-23 12:54:57,843 WARN L180 SmtUtils]: Spent 6.04 s on a formula simplification that was a NOOP. DAG size: 28 [2018-11-23 12:55:03,957 WARN L180 SmtUtils]: Spent 4.03 s on a formula simplification that was a NOOP. DAG size: 37 [2018-11-23 12:55:04,022 INFO L256 TraceCheckUtils]: 0: Hoare triple {659#true} call ULTIMATE.init(); {659#true} is VALID [2018-11-23 12:55:04,023 INFO L273 TraceCheckUtils]: 1: Hoare triple {659#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {659#true} is VALID [2018-11-23 12:55:04,023 INFO L273 TraceCheckUtils]: 2: Hoare triple {659#true} assume true; {659#true} is VALID [2018-11-23 12:55:04,023 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {659#true} {659#true} #39#return; {659#true} is VALID [2018-11-23 12:55:04,023 INFO L256 TraceCheckUtils]: 4: Hoare triple {659#true} call #t~ret6 := main(); {659#true} is VALID [2018-11-23 12:55:04,024 INFO L273 TraceCheckUtils]: 5: Hoare triple {659#true} call ~#ad1~0.base, ~#ad1~0.offset := #Ultimate.alloc(80);havoc ~ad2~0.base, ~ad2~0.offset;havoc ~i~0;havoc ~pa~0.base, ~pa~0.offset;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~i~0 := #t~nondet1;havoc #t~nondet1; {659#true} is VALID [2018-11-23 12:55:04,025 INFO L273 TraceCheckUtils]: 6: Hoare triple {659#true} assume ~i~0 >= 0 && ~i~0 < 10;~ad2~0.base, ~ad2~0.offset := ~#ad1~0.base, ~#ad1~0.offset;call write~int(~i~0, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~i~0, 4);~pa~0.base, ~pa~0.offset := ~#ad1~0.base, ~#ad1~0.offset + 8 * ~i~0;call #t~mem2 := read~int(~ad2~0.base, ~ad2~0.offset + 8 * ~i~0, 4);~i~0 := #t~mem2 - 10;havoc #t~mem2; {690#(and (= main_~pa~0.base |main_~#ad1~0.base|) (exists ((v_main_~i~0_16 Int)) (and (= v_main_~i~0_16 (select (select |#memory_int| main_~pa~0.base) (+ (* 8 v_main_~i~0_16) |main_~#ad1~0.offset|))) (= (+ (* 8 v_main_~i~0_16) |main_~#ad1~0.offset|) main_~pa~0.offset))))} is VALID [2018-11-23 12:55:04,026 INFO L273 TraceCheckUtils]: 7: Hoare triple {690#(and (= main_~pa~0.base |main_~#ad1~0.base|) (exists ((v_main_~i~0_16 Int)) (and (= v_main_~i~0_16 (select (select |#memory_int| main_~pa~0.base) (+ (* 8 v_main_~i~0_16) |main_~#ad1~0.offset|))) (= (+ (* 8 v_main_~i~0_16) |main_~#ad1~0.offset|) main_~pa~0.offset))))} call #t~mem3 := read~int(~pa~0.base, ~pa~0.offset, 4); {690#(and (= main_~pa~0.base |main_~#ad1~0.base|) (exists ((v_main_~i~0_16 Int)) (and (= v_main_~i~0_16 (select (select |#memory_int| main_~pa~0.base) (+ (* 8 v_main_~i~0_16) |main_~#ad1~0.offset|))) (= (+ (* 8 v_main_~i~0_16) |main_~#ad1~0.offset|) main_~pa~0.offset))))} is VALID [2018-11-23 12:55:04,027 INFO L273 TraceCheckUtils]: 8: Hoare triple {690#(and (= main_~pa~0.base |main_~#ad1~0.base|) (exists ((v_main_~i~0_16 Int)) (and (= v_main_~i~0_16 (select (select |#memory_int| main_~pa~0.base) (+ (* 8 v_main_~i~0_16) |main_~#ad1~0.offset|))) (= (+ (* 8 v_main_~i~0_16) |main_~#ad1~0.offset|) main_~pa~0.offset))))} assume !!(~i~0 < #t~mem3);havoc #t~mem3;#t~pre4 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre4; {690#(and (= main_~pa~0.base |main_~#ad1~0.base|) (exists ((v_main_~i~0_16 Int)) (and (= v_main_~i~0_16 (select (select |#memory_int| main_~pa~0.base) (+ (* 8 v_main_~i~0_16) |main_~#ad1~0.offset|))) (= (+ (* 8 v_main_~i~0_16) |main_~#ad1~0.offset|) main_~pa~0.offset))))} is VALID [2018-11-23 12:55:04,028 INFO L273 TraceCheckUtils]: 9: Hoare triple {690#(and (= main_~pa~0.base |main_~#ad1~0.base|) (exists ((v_main_~i~0_16 Int)) (and (= v_main_~i~0_16 (select (select |#memory_int| main_~pa~0.base) (+ (* 8 v_main_~i~0_16) |main_~#ad1~0.offset|))) (= (+ (* 8 v_main_~i~0_16) |main_~#ad1~0.offset|) main_~pa~0.offset))))} call #t~mem3 := read~int(~pa~0.base, ~pa~0.offset, 4); {690#(and (= main_~pa~0.base |main_~#ad1~0.base|) (exists ((v_main_~i~0_16 Int)) (and (= v_main_~i~0_16 (select (select |#memory_int| main_~pa~0.base) (+ (* 8 v_main_~i~0_16) |main_~#ad1~0.offset|))) (= (+ (* 8 v_main_~i~0_16) |main_~#ad1~0.offset|) main_~pa~0.offset))))} is VALID [2018-11-23 12:55:04,029 INFO L273 TraceCheckUtils]: 10: Hoare triple {690#(and (= main_~pa~0.base |main_~#ad1~0.base|) (exists ((v_main_~i~0_16 Int)) (and (= v_main_~i~0_16 (select (select |#memory_int| main_~pa~0.base) (+ (* 8 v_main_~i~0_16) |main_~#ad1~0.offset|))) (= (+ (* 8 v_main_~i~0_16) |main_~#ad1~0.offset|) main_~pa~0.offset))))} assume !!(~i~0 < #t~mem3);havoc #t~mem3;#t~pre4 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre4; {690#(and (= main_~pa~0.base |main_~#ad1~0.base|) (exists ((v_main_~i~0_16 Int)) (and (= v_main_~i~0_16 (select (select |#memory_int| main_~pa~0.base) (+ (* 8 v_main_~i~0_16) |main_~#ad1~0.offset|))) (= (+ (* 8 v_main_~i~0_16) |main_~#ad1~0.offset|) main_~pa~0.offset))))} is VALID [2018-11-23 12:55:04,031 INFO L273 TraceCheckUtils]: 11: Hoare triple {690#(and (= main_~pa~0.base |main_~#ad1~0.base|) (exists ((v_main_~i~0_16 Int)) (and (= v_main_~i~0_16 (select (select |#memory_int| main_~pa~0.base) (+ (* 8 v_main_~i~0_16) |main_~#ad1~0.offset|))) (= (+ (* 8 v_main_~i~0_16) |main_~#ad1~0.offset|) main_~pa~0.offset))))} call #t~mem3 := read~int(~pa~0.base, ~pa~0.offset, 4); {690#(and (= main_~pa~0.base |main_~#ad1~0.base|) (exists ((v_main_~i~0_16 Int)) (and (= v_main_~i~0_16 (select (select |#memory_int| main_~pa~0.base) (+ (* 8 v_main_~i~0_16) |main_~#ad1~0.offset|))) (= (+ (* 8 v_main_~i~0_16) |main_~#ad1~0.offset|) main_~pa~0.offset))))} is VALID [2018-11-23 12:55:04,033 INFO L273 TraceCheckUtils]: 12: Hoare triple {690#(and (= main_~pa~0.base |main_~#ad1~0.base|) (exists ((v_main_~i~0_16 Int)) (and (= v_main_~i~0_16 (select (select |#memory_int| main_~pa~0.base) (+ (* 8 v_main_~i~0_16) |main_~#ad1~0.offset|))) (= (+ (* 8 v_main_~i~0_16) |main_~#ad1~0.offset|) main_~pa~0.offset))))} assume !!(~i~0 < #t~mem3);havoc #t~mem3;#t~pre4 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre4; {690#(and (= main_~pa~0.base |main_~#ad1~0.base|) (exists ((v_main_~i~0_16 Int)) (and (= v_main_~i~0_16 (select (select |#memory_int| main_~pa~0.base) (+ (* 8 v_main_~i~0_16) |main_~#ad1~0.offset|))) (= (+ (* 8 v_main_~i~0_16) |main_~#ad1~0.offset|) main_~pa~0.offset))))} is VALID [2018-11-23 12:55:04,034 INFO L273 TraceCheckUtils]: 13: Hoare triple {690#(and (= main_~pa~0.base |main_~#ad1~0.base|) (exists ((v_main_~i~0_16 Int)) (and (= v_main_~i~0_16 (select (select |#memory_int| main_~pa~0.base) (+ (* 8 v_main_~i~0_16) |main_~#ad1~0.offset|))) (= (+ (* 8 v_main_~i~0_16) |main_~#ad1~0.offset|) main_~pa~0.offset))))} call #t~mem3 := read~int(~pa~0.base, ~pa~0.offset, 4); {690#(and (= main_~pa~0.base |main_~#ad1~0.base|) (exists ((v_main_~i~0_16 Int)) (and (= v_main_~i~0_16 (select (select |#memory_int| main_~pa~0.base) (+ (* 8 v_main_~i~0_16) |main_~#ad1~0.offset|))) (= (+ (* 8 v_main_~i~0_16) |main_~#ad1~0.offset|) main_~pa~0.offset))))} is VALID [2018-11-23 12:55:04,034 INFO L273 TraceCheckUtils]: 14: Hoare triple {690#(and (= main_~pa~0.base |main_~#ad1~0.base|) (exists ((v_main_~i~0_16 Int)) (and (= v_main_~i~0_16 (select (select |#memory_int| main_~pa~0.base) (+ (* 8 v_main_~i~0_16) |main_~#ad1~0.offset|))) (= (+ (* 8 v_main_~i~0_16) |main_~#ad1~0.offset|) main_~pa~0.offset))))} assume !!(~i~0 < #t~mem3);havoc #t~mem3;#t~pre4 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre4; {690#(and (= main_~pa~0.base |main_~#ad1~0.base|) (exists ((v_main_~i~0_16 Int)) (and (= v_main_~i~0_16 (select (select |#memory_int| main_~pa~0.base) (+ (* 8 v_main_~i~0_16) |main_~#ad1~0.offset|))) (= (+ (* 8 v_main_~i~0_16) |main_~#ad1~0.offset|) main_~pa~0.offset))))} is VALID [2018-11-23 12:55:04,035 INFO L273 TraceCheckUtils]: 15: Hoare triple {690#(and (= main_~pa~0.base |main_~#ad1~0.base|) (exists ((v_main_~i~0_16 Int)) (and (= v_main_~i~0_16 (select (select |#memory_int| main_~pa~0.base) (+ (* 8 v_main_~i~0_16) |main_~#ad1~0.offset|))) (= (+ (* 8 v_main_~i~0_16) |main_~#ad1~0.offset|) main_~pa~0.offset))))} call #t~mem3 := read~int(~pa~0.base, ~pa~0.offset, 4); {690#(and (= main_~pa~0.base |main_~#ad1~0.base|) (exists ((v_main_~i~0_16 Int)) (and (= v_main_~i~0_16 (select (select |#memory_int| main_~pa~0.base) (+ (* 8 v_main_~i~0_16) |main_~#ad1~0.offset|))) (= (+ (* 8 v_main_~i~0_16) |main_~#ad1~0.offset|) main_~pa~0.offset))))} is VALID [2018-11-23 12:55:04,036 INFO L273 TraceCheckUtils]: 16: Hoare triple {690#(and (= main_~pa~0.base |main_~#ad1~0.base|) (exists ((v_main_~i~0_16 Int)) (and (= v_main_~i~0_16 (select (select |#memory_int| main_~pa~0.base) (+ (* 8 v_main_~i~0_16) |main_~#ad1~0.offset|))) (= (+ (* 8 v_main_~i~0_16) |main_~#ad1~0.offset|) main_~pa~0.offset))))} assume !!(~i~0 < #t~mem3);havoc #t~mem3;#t~pre4 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre4; {690#(and (= main_~pa~0.base |main_~#ad1~0.base|) (exists ((v_main_~i~0_16 Int)) (and (= v_main_~i~0_16 (select (select |#memory_int| main_~pa~0.base) (+ (* 8 v_main_~i~0_16) |main_~#ad1~0.offset|))) (= (+ (* 8 v_main_~i~0_16) |main_~#ad1~0.offset|) main_~pa~0.offset))))} is VALID [2018-11-23 12:55:04,038 INFO L273 TraceCheckUtils]: 17: Hoare triple {690#(and (= main_~pa~0.base |main_~#ad1~0.base|) (exists ((v_main_~i~0_16 Int)) (and (= v_main_~i~0_16 (select (select |#memory_int| main_~pa~0.base) (+ (* 8 v_main_~i~0_16) |main_~#ad1~0.offset|))) (= (+ (* 8 v_main_~i~0_16) |main_~#ad1~0.offset|) main_~pa~0.offset))))} call #t~mem3 := read~int(~pa~0.base, ~pa~0.offset, 4); {724#(and (= main_~pa~0.base |main_~#ad1~0.base|) (<= |main_#t~mem3| (select (select |#memory_int| main_~pa~0.base) main_~pa~0.offset)) (exists ((v_main_~i~0_16 Int)) (and (= v_main_~i~0_16 (select (select |#memory_int| main_~pa~0.base) (+ (* 8 v_main_~i~0_16) |main_~#ad1~0.offset|))) (= (+ (* 8 v_main_~i~0_16) |main_~#ad1~0.offset|) main_~pa~0.offset))))} is VALID [2018-11-23 12:55:04,040 INFO L273 TraceCheckUtils]: 18: Hoare triple {724#(and (= main_~pa~0.base |main_~#ad1~0.base|) (<= |main_#t~mem3| (select (select |#memory_int| main_~pa~0.base) main_~pa~0.offset)) (exists ((v_main_~i~0_16 Int)) (and (= v_main_~i~0_16 (select (select |#memory_int| main_~pa~0.base) (+ (* 8 v_main_~i~0_16) |main_~#ad1~0.offset|))) (= (+ (* 8 v_main_~i~0_16) |main_~#ad1~0.offset|) main_~pa~0.offset))))} assume !!(~i~0 < #t~mem3);havoc #t~mem3;#t~pre4 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre4; {728#(and (<= main_~i~0 (select (select |#memory_int| main_~pa~0.base) main_~pa~0.offset)) (= main_~pa~0.base |main_~#ad1~0.base|) (exists ((v_main_~i~0_16 Int)) (and (= v_main_~i~0_16 (select (select |#memory_int| main_~pa~0.base) (+ (* 8 v_main_~i~0_16) |main_~#ad1~0.offset|))) (= (+ (* 8 v_main_~i~0_16) |main_~#ad1~0.offset|) main_~pa~0.offset))))} is VALID [2018-11-23 12:55:04,042 INFO L273 TraceCheckUtils]: 19: Hoare triple {728#(and (<= main_~i~0 (select (select |#memory_int| main_~pa~0.base) main_~pa~0.offset)) (= main_~pa~0.base |main_~#ad1~0.base|) (exists ((v_main_~i~0_16 Int)) (and (= v_main_~i~0_16 (select (select |#memory_int| main_~pa~0.base) (+ (* 8 v_main_~i~0_16) |main_~#ad1~0.offset|))) (= (+ (* 8 v_main_~i~0_16) |main_~#ad1~0.offset|) main_~pa~0.offset))))} call #t~mem3 := read~int(~pa~0.base, ~pa~0.offset, 4); {732#(exists ((v_main_~i~0_16 Int)) (and (<= main_~i~0 (select (select |#memory_int| |main_~#ad1~0.base|) (+ (* 8 v_main_~i~0_16) |main_~#ad1~0.offset|))) (<= (select (select |#memory_int| |main_~#ad1~0.base|) (+ (* 8 v_main_~i~0_16) |main_~#ad1~0.offset|)) |main_#t~mem3|) (= v_main_~i~0_16 (select (select |#memory_int| |main_~#ad1~0.base|) (+ (* 8 v_main_~i~0_16) |main_~#ad1~0.offset|)))))} is VALID [2018-11-23 12:55:04,047 INFO L273 TraceCheckUtils]: 20: Hoare triple {732#(exists ((v_main_~i~0_16 Int)) (and (<= main_~i~0 (select (select |#memory_int| |main_~#ad1~0.base|) (+ (* 8 v_main_~i~0_16) |main_~#ad1~0.offset|))) (<= (select (select |#memory_int| |main_~#ad1~0.base|) (+ (* 8 v_main_~i~0_16) |main_~#ad1~0.offset|)) |main_#t~mem3|) (= v_main_~i~0_16 (select (select |#memory_int| |main_~#ad1~0.base|) (+ (* 8 v_main_~i~0_16) |main_~#ad1~0.offset|)))))} assume !(~i~0 < #t~mem3);havoc #t~mem3; {736#(exists ((v_main_~i~0_16 Int)) (and (<= (select (select |#memory_int| |main_~#ad1~0.base|) (+ (* 8 v_main_~i~0_16) |main_~#ad1~0.offset|)) main_~i~0) (<= main_~i~0 (select (select |#memory_int| |main_~#ad1~0.base|) (+ (* 8 v_main_~i~0_16) |main_~#ad1~0.offset|))) (= v_main_~i~0_16 (select (select |#memory_int| |main_~#ad1~0.base|) (+ (* 8 v_main_~i~0_16) |main_~#ad1~0.offset|)))))} is VALID [2018-11-23 12:55:04,049 INFO L256 TraceCheckUtils]: 21: Hoare triple {736#(exists ((v_main_~i~0_16 Int)) (and (<= (select (select |#memory_int| |main_~#ad1~0.base|) (+ (* 8 v_main_~i~0_16) |main_~#ad1~0.offset|)) main_~i~0) (<= main_~i~0 (select (select |#memory_int| |main_~#ad1~0.base|) (+ (* 8 v_main_~i~0_16) |main_~#ad1~0.offset|))) (= v_main_~i~0_16 (select (select |#memory_int| |main_~#ad1~0.base|) (+ (* 8 v_main_~i~0_16) |main_~#ad1~0.offset|)))))} call #t~ret5 := check(~#ad1~0.base, ~#ad1~0.offset, ~i~0); {740#(exists ((|v_main_~#ad1~0.base_BEFORE_CALL_1| Int) (v_main_~i~0_16 Int) (|v_main_~#ad1~0.offset_BEFORE_CALL_1| Int)) (= v_main_~i~0_16 (select (select |#memory_int| |v_main_~#ad1~0.base_BEFORE_CALL_1|) (+ (* 8 v_main_~i~0_16) |v_main_~#ad1~0.offset_BEFORE_CALL_1|))))} is VALID [2018-11-23 12:55:04,050 INFO L273 TraceCheckUtils]: 22: Hoare triple {740#(exists ((|v_main_~#ad1~0.base_BEFORE_CALL_1| Int) (v_main_~i~0_16 Int) (|v_main_~#ad1~0.offset_BEFORE_CALL_1| Int)) (= v_main_~i~0_16 (select (select |#memory_int| |v_main_~#ad1~0.base_BEFORE_CALL_1|) (+ (* 8 v_main_~i~0_16) |v_main_~#ad1~0.offset_BEFORE_CALL_1|))))} ~ad1.base, ~ad1.offset := #in~ad1.base, #in~ad1.offset;~b := #in~b;call #t~mem0 := read~int(~ad1.base, ~ad1.offset + 8 * ~b, 4);#res := (if #t~mem0 == ~b then 1 else 0);havoc #t~mem0; {744#(or (and (exists ((|v_main_~#ad1~0.base_BEFORE_CALL_1| Int) (v_main_~i~0_16 Int) (|v_main_~#ad1~0.offset_BEFORE_CALL_1| Int)) (= v_main_~i~0_16 (select (select |#memory_int| |v_main_~#ad1~0.base_BEFORE_CALL_1|) (+ (* 8 v_main_~i~0_16) |v_main_~#ad1~0.offset_BEFORE_CALL_1|)))) (= |check_#in~b| (select (select |#memory_int| |check_#in~ad1.base|) (+ |check_#in~ad1.offset| (* 8 |check_#in~b|)))) (= |check_#res| 1)) (and (not (= |check_#in~b| (select (select |#memory_int| |check_#in~ad1.base|) (+ |check_#in~ad1.offset| (* 8 |check_#in~b|))))) (exists ((|v_main_~#ad1~0.base_BEFORE_CALL_1| Int) (v_main_~i~0_16 Int) (|v_main_~#ad1~0.offset_BEFORE_CALL_1| Int)) (= v_main_~i~0_16 (select (select |#memory_int| |v_main_~#ad1~0.base_BEFORE_CALL_1|) (+ (* 8 v_main_~i~0_16) |v_main_~#ad1~0.offset_BEFORE_CALL_1|)))) (= |check_#res| 0)))} is VALID [2018-11-23 12:55:06,054 INFO L273 TraceCheckUtils]: 23: Hoare triple {744#(or (and (exists ((|v_main_~#ad1~0.base_BEFORE_CALL_1| Int) (v_main_~i~0_16 Int) (|v_main_~#ad1~0.offset_BEFORE_CALL_1| Int)) (= v_main_~i~0_16 (select (select |#memory_int| |v_main_~#ad1~0.base_BEFORE_CALL_1|) (+ (* 8 v_main_~i~0_16) |v_main_~#ad1~0.offset_BEFORE_CALL_1|)))) (= |check_#in~b| (select (select |#memory_int| |check_#in~ad1.base|) (+ |check_#in~ad1.offset| (* 8 |check_#in~b|)))) (= |check_#res| 1)) (and (not (= |check_#in~b| (select (select |#memory_int| |check_#in~ad1.base|) (+ |check_#in~ad1.offset| (* 8 |check_#in~b|))))) (exists ((|v_main_~#ad1~0.base_BEFORE_CALL_1| Int) (v_main_~i~0_16 Int) (|v_main_~#ad1~0.offset_BEFORE_CALL_1| Int)) (= v_main_~i~0_16 (select (select |#memory_int| |v_main_~#ad1~0.base_BEFORE_CALL_1|) (+ (* 8 v_main_~i~0_16) |v_main_~#ad1~0.offset_BEFORE_CALL_1|)))) (= |check_#res| 0)))} assume true; {748#(or (and (not (= |check_#in~b| (select (select |#memory_int| |check_#in~ad1.base|) (+ |check_#in~ad1.offset| (* 8 |check_#in~b|))))) (exists ((v_prenex_2 Int) (v_prenex_3 Int) (v_prenex_1 Int)) (= v_prenex_2 (select (select |#memory_int| v_prenex_1) (+ (* 8 v_prenex_2) v_prenex_3)))) (= |check_#res| 0)) (and (exists ((|v_main_~#ad1~0.base_BEFORE_CALL_1| Int) (v_main_~i~0_16 Int) (|v_main_~#ad1~0.offset_BEFORE_CALL_1| Int)) (= v_main_~i~0_16 (select (select |#memory_int| |v_main_~#ad1~0.base_BEFORE_CALL_1|) (+ (* 8 v_main_~i~0_16) |v_main_~#ad1~0.offset_BEFORE_CALL_1|)))) (= |check_#in~b| (select (select |#memory_int| |check_#in~ad1.base|) (+ |check_#in~ad1.offset| (* 8 |check_#in~b|)))) (= |check_#res| 1)))} is UNKNOWN [2018-11-23 12:55:06,071 INFO L268 TraceCheckUtils]: 24: Hoare quadruple {748#(or (and (not (= |check_#in~b| (select (select |#memory_int| |check_#in~ad1.base|) (+ |check_#in~ad1.offset| (* 8 |check_#in~b|))))) (exists ((v_prenex_2 Int) (v_prenex_3 Int) (v_prenex_1 Int)) (= v_prenex_2 (select (select |#memory_int| v_prenex_1) (+ (* 8 v_prenex_2) v_prenex_3)))) (= |check_#res| 0)) (and (exists ((|v_main_~#ad1~0.base_BEFORE_CALL_1| Int) (v_main_~i~0_16 Int) (|v_main_~#ad1~0.offset_BEFORE_CALL_1| Int)) (= v_main_~i~0_16 (select (select |#memory_int| |v_main_~#ad1~0.base_BEFORE_CALL_1|) (+ (* 8 v_main_~i~0_16) |v_main_~#ad1~0.offset_BEFORE_CALL_1|)))) (= |check_#in~b| (select (select |#memory_int| |check_#in~ad1.base|) (+ |check_#in~ad1.offset| (* 8 |check_#in~b|)))) (= |check_#res| 1)))} {736#(exists ((v_main_~i~0_16 Int)) (and (<= (select (select |#memory_int| |main_~#ad1~0.base|) (+ (* 8 v_main_~i~0_16) |main_~#ad1~0.offset|)) main_~i~0) (<= main_~i~0 (select (select |#memory_int| |main_~#ad1~0.base|) (+ (* 8 v_main_~i~0_16) |main_~#ad1~0.offset|))) (= v_main_~i~0_16 (select (select |#memory_int| |main_~#ad1~0.base|) (+ (* 8 v_main_~i~0_16) |main_~#ad1~0.offset|)))))} #43#return; {752#(= 1 |main_#t~ret5|)} is VALID [2018-11-23 12:55:06,085 INFO L273 TraceCheckUtils]: 25: Hoare triple {752#(= 1 |main_#t~ret5|)} assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647; {752#(= 1 |main_#t~ret5|)} is VALID [2018-11-23 12:55:06,090 INFO L273 TraceCheckUtils]: 26: Hoare triple {752#(= 1 |main_#t~ret5|)} assume 0 == #t~ret5;havoc #t~ret5; {660#false} is VALID [2018-11-23 12:55:06,091 INFO L273 TraceCheckUtils]: 27: Hoare triple {660#false} assume !false; {660#false} is VALID [2018-11-23 12:55:06,098 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 11 proven. 6 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2018-11-23 12:55:06,123 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:55:06,123 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 11] total 19 [2018-11-23 12:55:06,124 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 28 [2018-11-23 12:55:06,124 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:55:06,125 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 19 states. [2018-11-23 12:55:08,184 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 41 edges. 40 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2018-11-23 12:55:08,185 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-11-23 12:55:08,185 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-11-23 12:55:08,186 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=249, Unknown=2, NotChecked=32, Total=342 [2018-11-23 12:55:08,186 INFO L87 Difference]: Start difference. First operand 29 states and 29 transitions. Second operand 19 states. [2018-11-23 12:55:21,536 WARN L180 SmtUtils]: Spent 159.00 ms on a formula simplification. DAG size of input: 35 DAG size of output: 34 [2018-11-23 12:55:21,874 WARN L180 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 35 DAG size of output: 34 [2018-11-23 12:55:25,471 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:55:25,471 INFO L93 Difference]: Finished difference Result 37 states and 38 transitions. [2018-11-23 12:55:25,471 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-11-23 12:55:25,471 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 28 [2018-11-23 12:55:25,472 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:55:25,472 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2018-11-23 12:55:25,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 38 transitions. [2018-11-23 12:55:25,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2018-11-23 12:55:25,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 38 transitions. [2018-11-23 12:55:25,477 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 23 states and 38 transitions. [2018-11-23 12:55:27,569 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 38 edges. 37 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2018-11-23 12:55:27,569 INFO L225 Difference]: With dead ends: 37 [2018-11-23 12:55:27,570 INFO L226 Difference]: Without dead ends: 0 [2018-11-23 12:55:27,571 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 231 ImplicationChecksByTransitivity, 16.6s TimeCoverageRelationStatistics Valid=287, Invalid=905, Unknown=2, NotChecked=66, Total=1260 [2018-11-23 12:55:27,572 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-11-23 12:55:27,572 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-11-23 12:55:27,572 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:55:27,572 INFO L82 GeneralOperation]: Start isEquivalent. First operand 0 states. Second operand 0 states. [2018-11-23 12:55:27,572 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2018-11-23 12:55:27,572 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2018-11-23 12:55:27,573 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:55:27,573 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2018-11-23 12:55:27,573 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-23 12:55:27,573 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:55:27,573 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:55:27,573 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2018-11-23 12:55:27,574 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2018-11-23 12:55:27,574 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:55:27,574 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2018-11-23 12:55:27,574 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-23 12:55:27,574 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:55:27,574 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:55:27,574 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:55:27,575 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:55:27,575 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-11-23 12:55:27,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-11-23 12:55:27,575 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 28 [2018-11-23 12:55:27,575 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:55:27,575 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-23 12:55:27,576 INFO L481 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-11-23 12:55:27,576 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-23 12:55:27,576 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:55:27,581 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-11-23 12:55:31,776 WARN L180 SmtUtils]: Spent 2.00 s on a formula simplification. DAG size of input: 14 DAG size of output: 1 [2018-11-23 12:55:31,781 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2018-11-23 12:55:31,781 INFO L451 ceAbstractionStarter]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: true [2018-11-23 12:55:31,781 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2018-11-23 12:55:31,781 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-11-23 12:55:31,781 INFO L451 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: true [2018-11-23 12:55:31,781 INFO L451 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2018-11-23 12:55:31,781 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-11-23 12:55:31,782 INFO L448 ceAbstractionStarter]: For program point L29(line 29) no Hoare annotation was computed. [2018-11-23 12:55:31,782 INFO L448 ceAbstractionStarter]: For program point L29-1(lines 29 31) no Hoare annotation was computed. [2018-11-23 12:55:31,782 INFO L448 ceAbstractionStarter]: For program point mainEXIT(lines 14 38) no Hoare annotation was computed. [2018-11-23 12:55:31,782 INFO L448 ceAbstractionStarter]: For program point L21(lines 21 32) no Hoare annotation was computed. [2018-11-23 12:55:31,782 INFO L448 ceAbstractionStarter]: For program point L21-2(lines 21 32) no Hoare annotation was computed. [2018-11-23 12:55:31,782 INFO L448 ceAbstractionStarter]: For program point mainFINAL(lines 14 38) no Hoare annotation was computed. [2018-11-23 12:55:31,782 INFO L444 ceAbstractionStarter]: At program point L30(lines 15 38) the Hoare annotation is: false [2018-11-23 12:55:31,782 INFO L451 ceAbstractionStarter]: At program point mainENTRY(lines 14 38) the Hoare annotation is: true [2018-11-23 12:55:31,782 INFO L448 ceAbstractionStarter]: For program point mainErr0ASSERT_VIOLATIONERROR_FUNCTION(line 36) no Hoare annotation was computed. [2018-11-23 12:55:31,783 INFO L448 ceAbstractionStarter]: For program point L26-1(lines 26 28) no Hoare annotation was computed. [2018-11-23 12:55:31,783 INFO L444 ceAbstractionStarter]: At program point L26-3(lines 26 28) the Hoare annotation is: (and (<= main_~i~0 (select (select |#memory_int| main_~pa~0.base) main_~pa~0.offset)) (= main_~pa~0.base |main_~#ad1~0.base|) (exists ((v_main_~i~0_16 Int)) (let ((.cse0 (+ (* 8 v_main_~i~0_16) |main_~#ad1~0.offset|))) (and (= v_main_~i~0_16 (select (select |#memory_int| main_~pa~0.base) .cse0)) (= .cse0 main_~pa~0.offset))))) [2018-11-23 12:55:31,783 INFO L444 ceAbstractionStarter]: At program point L26-4(lines 26 28) the Hoare annotation is: (and (<= main_~i~0 (select (select |#memory_int| main_~pa~0.base) main_~pa~0.offset)) (= main_~pa~0.base |main_~#ad1~0.base|) (exists ((v_main_~i~0_16 Int)) (let ((.cse0 (select (select |#memory_int| |main_~#ad1~0.base|) (+ (* 8 v_main_~i~0_16) |main_~#ad1~0.offset|)))) (and (<= .cse0 main_~i~0) (<= main_~i~0 .cse0) (= v_main_~i~0_16 .cse0)))) (exists ((v_main_~i~0_16 Int)) (let ((.cse1 (+ (* 8 v_main_~i~0_16) |main_~#ad1~0.offset|))) (and (= v_main_~i~0_16 (select (select |#memory_int| main_~pa~0.base) .cse1)) (= .cse1 main_~pa~0.offset))))) [2018-11-23 12:55:31,783 INFO L451 ceAbstractionStarter]: At program point checkENTRY(lines 9 12) the Hoare annotation is: true [2018-11-23 12:55:31,783 INFO L448 ceAbstractionStarter]: For program point checkFINAL(lines 9 12) no Hoare annotation was computed. [2018-11-23 12:55:31,783 INFO L448 ceAbstractionStarter]: For program point checkEXIT(lines 9 12) no Hoare annotation was computed. [2018-11-23 12:55:31,785 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2018-11-23 12:55:31,785 WARN L170 areAnnotationChecker]: L21 has no Hoare annotation [2018-11-23 12:55:31,785 WARN L170 areAnnotationChecker]: checkFINAL has no Hoare annotation [2018-11-23 12:55:31,785 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2018-11-23 12:55:31,785 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2018-11-23 12:55:31,785 WARN L170 areAnnotationChecker]: L21 has no Hoare annotation [2018-11-23 12:55:31,785 WARN L170 areAnnotationChecker]: L21 has no Hoare annotation [2018-11-23 12:55:31,786 WARN L170 areAnnotationChecker]: checkFINAL has no Hoare annotation [2018-11-23 12:55:31,786 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2018-11-23 12:55:31,786 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2018-11-23 12:55:31,787 WARN L170 areAnnotationChecker]: L26-1 has no Hoare annotation [2018-11-23 12:55:31,788 WARN L170 areAnnotationChecker]: L21-2 has no Hoare annotation [2018-11-23 12:55:31,788 WARN L170 areAnnotationChecker]: checkEXIT has no Hoare annotation [2018-11-23 12:55:31,788 WARN L170 areAnnotationChecker]: L29 has no Hoare annotation [2018-11-23 12:55:31,788 WARN L170 areAnnotationChecker]: L26-1 has no Hoare annotation [2018-11-23 12:55:31,788 WARN L170 areAnnotationChecker]: L26-1 has no Hoare annotation [2018-11-23 12:55:31,788 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2018-11-23 12:55:31,788 WARN L170 areAnnotationChecker]: L29 has no Hoare annotation [2018-11-23 12:55:31,788 WARN L170 areAnnotationChecker]: mainEXIT has no Hoare annotation [2018-11-23 12:55:31,788 WARN L170 areAnnotationChecker]: L29-1 has no Hoare annotation [2018-11-23 12:55:31,788 WARN L170 areAnnotationChecker]: L29-1 has no Hoare annotation [2018-11-23 12:55:31,789 WARN L170 areAnnotationChecker]: mainErr0ASSERT_VIOLATIONERROR_FUNCTION has no Hoare annotation [2018-11-23 12:55:31,789 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2018-11-23 12:55:31,789 INFO L163 areAnnotationChecker]: CFG has 4 edges. 4 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2018-11-23 12:55:31,794 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~i~0_16,QUANTIFIED] [2018-11-23 12:55:31,795 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~i~0_16,QUANTIFIED] [2018-11-23 12:55:31,795 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~i~0_16,QUANTIFIED] [2018-11-23 12:55:31,797 WARN L1272 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-23 12:55:31,797 WARN L1272 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-23 12:55:31,800 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~i~0_16,QUANTIFIED] [2018-11-23 12:55:31,800 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~i~0_16,QUANTIFIED] [2018-11-23 12:55:31,800 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~i~0_16,QUANTIFIED] [2018-11-23 12:55:31,800 WARN L1272 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-23 12:55:31,801 WARN L1272 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-23 12:55:31,803 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 23.11 12:55:31 BoogieIcfgContainer [2018-11-23 12:55:31,804 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-23 12:55:31,804 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-23 12:55:31,804 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-23 12:55:31,804 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-23 12:55:31,805 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 12:54:43" (3/4) ... [2018-11-23 12:55:31,808 INFO L144 WitnessPrinter]: Generating witness for correct program [2018-11-23 12:55:31,814 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2018-11-23 12:55:31,815 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2018-11-23 12:55:31,815 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure check [2018-11-23 12:55:31,819 INFO L879 BoogieBacktranslator]: Reduced CFG by removing 12 nodes and edges [2018-11-23 12:55:31,820 INFO L879 BoogieBacktranslator]: Reduced CFG by removing 7 nodes and edges [2018-11-23 12:55:31,820 INFO L879 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2018-11-23 12:55:31,820 INFO L879 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2018-11-23 12:55:31,850 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (i <= unknown-#memory_int-unknown[pa][pa] && pa == ad1) && (\exists v_main_~i~0_16 : int :: v_main_~i~0_16 == unknown-#memory_int-unknown[pa][8 * v_main_~i~0_16 + ad1] && 8 * v_main_~i~0_16 + ad1 == pa) [2018-11-23 12:55:31,874 INFO L145 WitnessManager]: Wrote witness to /storage/repos/svcomp/c/ldv-regression/test24_true-unreach-call_true-termination.c-witness.graphml [2018-11-23 12:55:31,874 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-23 12:55:31,875 INFO L168 Benchmark]: Toolchain (without parser) took 49447.40 ms. Allocated memory was 1.5 GB in the beginning and 2.4 GB in the end (delta: 852.5 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -790.0 MB). Peak memory consumption was 62.5 MB. Max. memory is 7.1 GB. [2018-11-23 12:55:31,875 INFO L168 Benchmark]: CDTParser took 0.26 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-11-23 12:55:31,876 INFO L168 Benchmark]: CACSL2BoogieTranslator took 361.94 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 7.1 GB. [2018-11-23 12:55:31,876 INFO L168 Benchmark]: Boogie Procedure Inliner took 24.49 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-11-23 12:55:31,877 INFO L168 Benchmark]: Boogie Preprocessor took 48.10 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-11-23 12:55:31,877 INFO L168 Benchmark]: RCFGBuilder took 657.49 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 723.5 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -757.0 MB). Peak memory consumption was 14.9 MB. Max. memory is 7.1 GB. [2018-11-23 12:55:31,878 INFO L168 Benchmark]: TraceAbstraction took 48280.55 ms. Allocated memory was 2.3 GB in the beginning and 2.4 GB in the end (delta: 129.0 MB). Free memory was 2.2 GB in the beginning and 2.2 GB in the end (delta: -43.5 MB). Peak memory consumption was 85.4 MB. Max. memory is 7.1 GB. [2018-11-23 12:55:31,878 INFO L168 Benchmark]: Witness Printer took 69.87 ms. Allocated memory is still 2.4 GB. Free memory is still 2.2 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-11-23 12:55:31,881 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - GenericResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.26 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 361.94 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 24.49 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Preprocessor took 48.10 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. * RCFGBuilder took 657.49 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 723.5 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -757.0 MB). Peak memory consumption was 14.9 MB. Max. memory is 7.1 GB. * TraceAbstraction took 48280.55 ms. Allocated memory was 2.3 GB in the beginning and 2.4 GB in the end (delta: 129.0 MB). Free memory was 2.2 GB in the beginning and 2.2 GB in the end (delta: -43.5 MB). Peak memory consumption was 85.4 MB. Max. memory is 7.1 GB. * Witness Printer took 69.87 ms. Allocated memory is still 2.4 GB. Free memory is still 2.2 GB. There was no memory consumed. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~i~0_16,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~i~0_16,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~i~0_16,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~i~0_16,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~i~0_16,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~i~0_16,QUANTIFIED] * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 36]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 26]: Loop Invariant [2018-11-23 12:55:31,887 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~i~0_16,QUANTIFIED] [2018-11-23 12:55:31,887 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~i~0_16,QUANTIFIED] [2018-11-23 12:55:31,888 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~i~0_16,QUANTIFIED] [2018-11-23 12:55:31,888 WARN L1272 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-23 12:55:31,888 WARN L1272 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-23 12:55:31,889 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~i~0_16,QUANTIFIED] [2018-11-23 12:55:31,889 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~i~0_16,QUANTIFIED] [2018-11-23 12:55:31,889 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~i~0_16,QUANTIFIED] [2018-11-23 12:55:31,890 WARN L1272 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-23 12:55:31,890 WARN L1272 BoogieBacktranslator]: unknown boogie variable #memory_int Derived loop invariant: (i <= unknown-#memory_int-unknown[pa][pa] && pa == ad1) && (\exists v_main_~i~0_16 : int :: v_main_~i~0_16 == unknown-#memory_int-unknown[pa][8 * v_main_~i~0_16 + ad1] && 8 * v_main_~i~0_16 + ad1 == pa) - InvariantResult [Line: 15]: Loop Invariant Derived loop invariant: 0 - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 22 locations, 1 error locations. SAFE Result, 48.1s OverallTime, 5 OverallIterations, 7 TraceHistogramMax, 21.2s AutomataDifference, 0.0s DeadEndRemovalTime, 4.2s HoareAnnotationTime, HoareTripleCheckerStatistics: 77 SDtfs, 28 SDslu, 207 SDs, 0 SdLazy, 156 SolverSat, 13 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 116 GetRequests, 60 SyntacticMatches, 0 SemanticMatches, 56 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 278 ImplicationChecksByTransitivity, 17.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=29occurred in iteration=4, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 5 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 8 LocationsWithAnnotation, 13 PreInvPairs, 21 NumberOfFragments, 103 HoareAnnotationTreeSize, 13 FomulaSimplifications, 42 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 8 FomulaSimplificationsInter, 269 FormulaSimplificationTreeSizeReductionInter, 2.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 19.3s InterpolantComputationTime, 163 NumberOfCodeBlocks, 155 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 155 ConstructedInterpolants, 18 QuantifiedInterpolants, 22629 SizeOfPredicates, 25 NumberOfNonLiveVariables, 259 ConjunctsInSsa, 54 ConjunctsInUnsatCore, 8 InterpolantComputations, 2 PerfectInterpolantSequences, 36/100 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...