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/AutomizerC.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default-Const.epf -i ../../../trunk/examples/svcomp/loops/linear_search_false-unreach-call.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-370d6ab [2018-11-14 19:17:09,436 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-14 19:17:09,438 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-14 19:17:09,451 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-14 19:17:09,452 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-14 19:17:09,453 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-14 19:17:09,454 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-14 19:17:09,456 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-14 19:17:09,457 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-14 19:17:09,458 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-14 19:17:09,459 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-14 19:17:09,459 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-14 19:17:09,460 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-14 19:17:09,461 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-14 19:17:09,462 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-14 19:17:09,463 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-14 19:17:09,464 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-14 19:17:09,466 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-14 19:17:09,468 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-14 19:17:09,470 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-14 19:17:09,471 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-14 19:17:09,472 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-14 19:17:09,475 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-14 19:17:09,475 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-14 19:17:09,475 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-14 19:17:09,476 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-14 19:17:09,477 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-14 19:17:09,478 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-14 19:17:09,479 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-14 19:17:09,480 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-14 19:17:09,480 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-14 19:17:09,481 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-14 19:17:09,481 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-14 19:17:09,482 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-14 19:17:09,483 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-14 19:17:09,484 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-14 19:17:09,484 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default-Const.epf [2018-11-14 19:17:09,503 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-14 19:17:09,503 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-14 19:17:09,507 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-14 19:17:09,507 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-11-14 19:17:09,511 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-14 19:17:09,511 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-14 19:17:09,512 INFO L133 SettingsManager]: * Use SBE=true [2018-11-14 19:17:09,512 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-14 19:17:09,512 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-14 19:17:09,512 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-14 19:17:09,512 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-14 19:17:09,512 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-14 19:17:09,513 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-14 19:17:09,513 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-14 19:17:09,513 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-14 19:17:09,513 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-14 19:17:09,513 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-14 19:17:09,515 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-14 19:17:09,515 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-14 19:17:09,515 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-14 19:17:09,516 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-14 19:17:09,516 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-14 19:17:09,516 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-14 19:17:09,516 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-14 19:17:09,516 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-14 19:17:09,517 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-14 19:17:09,517 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-14 19:17:09,517 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-14 19:17:09,517 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-14 19:17:09,518 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-14 19:17:09,518 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-14 19:17:09,582 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-14 19:17:09,594 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-14 19:17:09,598 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-14 19:17:09,600 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-14 19:17:09,600 INFO L276 PluginConnector]: CDTParser initialized [2018-11-14 19:17:09,601 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loops/linear_search_false-unreach-call.i [2018-11-14 19:17:09,660 INFO L218 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/423269ab6/ee4c057f81ee4672a0e80858ec750a43/FLAGe92f5df43 [2018-11-14 19:17:10,090 INFO L298 CDTParser]: Found 1 translation units. [2018-11-14 19:17:10,091 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loops/linear_search_false-unreach-call.i [2018-11-14 19:17:10,098 INFO L346 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/423269ab6/ee4c057f81ee4672a0e80858ec750a43/FLAGe92f5df43 [2018-11-14 19:17:10,114 INFO L354 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/423269ab6/ee4c057f81ee4672a0e80858ec750a43 [2018-11-14 19:17:10,124 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-14 19:17:10,125 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-11-14 19:17:10,126 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-14 19:17:10,127 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-14 19:17:10,133 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-14 19:17:10,135 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.11 07:17:10" (1/1) ... [2018-11-14 19:17:10,139 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@29c4e0f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 07:17:10, skipping insertion in model container [2018-11-14 19:17:10,139 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.11 07:17:10" (1/1) ... [2018-11-14 19:17:10,149 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-14 19:17:10,172 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-14 19:17:10,422 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-14 19:17:10,437 INFO L191 MainTranslator]: Completed pre-run [2018-11-14 19:17:10,468 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-14 19:17:10,487 INFO L195 MainTranslator]: Completed translation [2018-11-14 19:17:10,488 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 07:17:10 WrapperNode [2018-11-14 19:17:10,488 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-14 19:17:10,489 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-14 19:17:10,489 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-14 19:17:10,489 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-14 19:17:10,501 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 07:17:10" (1/1) ... [2018-11-14 19:17:10,502 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 07:17:10" (1/1) ... [2018-11-14 19:17:10,510 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 07:17:10" (1/1) ... [2018-11-14 19:17:10,511 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 07:17:10" (1/1) ... [2018-11-14 19:17:10,521 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 07:17:10" (1/1) ... [2018-11-14 19:17:10,527 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 07:17:10" (1/1) ... [2018-11-14 19:17:10,529 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 07:17:10" (1/1) ... [2018-11-14 19:17:10,531 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-14 19:17:10,532 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-14 19:17:10,532 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-14 19:17:10,532 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-14 19:17:10,534 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 07:17:10" (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-14 19:17:10,662 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-14 19:17:10,663 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-14 19:17:10,663 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2018-11-14 19:17:10,663 INFO L138 BoogieDeclarations]: Found implementation of procedure linear_search [2018-11-14 19:17:10,663 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-14 19:17:10,663 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2018-11-14 19:17:10,663 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2018-11-14 19:17:10,663 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_uint [2018-11-14 19:17:10,664 INFO L130 BoogieDeclarations]: Found specification of procedure linear_search [2018-11-14 19:17:10,664 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-14 19:17:10,664 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-14 19:17:10,664 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-14 19:17:10,664 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-14 19:17:10,664 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-14 19:17:10,665 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-14 19:17:10,665 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-14 19:17:10,665 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2018-11-14 19:17:11,290 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-14 19:17:11,291 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.11 07:17:11 BoogieIcfgContainer [2018-11-14 19:17:11,291 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-14 19:17:11,294 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-14 19:17:11,294 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-14 19:17:11,298 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-14 19:17:11,298 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.11 07:17:10" (1/3) ... [2018-11-14 19:17:11,299 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@27282b26 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.11 07:17:11, skipping insertion in model container [2018-11-14 19:17:11,299 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 07:17:10" (2/3) ... [2018-11-14 19:17:11,300 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@27282b26 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.11 07:17:11, skipping insertion in model container [2018-11-14 19:17:11,300 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.11 07:17:11" (3/3) ... [2018-11-14 19:17:11,303 INFO L112 eAbstractionObserver]: Analyzing ICFG linear_search_false-unreach-call.i [2018-11-14 19:17:11,312 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-14 19:17:11,319 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-14 19:17:11,334 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-14 19:17:11,382 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-14 19:17:11,383 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-14 19:17:11,383 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-14 19:17:11,383 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-14 19:17:11,383 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-14 19:17:11,383 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-14 19:17:11,384 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-14 19:17:11,384 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-14 19:17:11,384 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-14 19:17:11,402 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states. [2018-11-14 19:17:11,408 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-11-14 19:17:11,408 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 19:17:11,409 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 19:17:11,411 INFO L423 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 19:17:11,416 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 19:17:11,417 INFO L82 PathProgramCache]: Analyzing trace with hash 700043364, now seen corresponding path program 1 times [2018-11-14 19:17:11,418 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 19:17:11,419 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 19:17:11,474 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 19:17:11,474 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 19:17:11,474 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 19:17:11,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 19:17:11,635 INFO L256 TraceCheckUtils]: 0: Hoare triple {32#true} call ULTIMATE.init(); {32#true} is VALID [2018-11-14 19:17:11,639 INFO L273 TraceCheckUtils]: 1: Hoare triple {32#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~SIZE~0 := 0; {32#true} is VALID [2018-11-14 19:17:11,639 INFO L273 TraceCheckUtils]: 2: Hoare triple {32#true} assume true; {32#true} is VALID [2018-11-14 19:17:11,640 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {32#true} {32#true} #55#return; {32#true} is VALID [2018-11-14 19:17:11,640 INFO L256 TraceCheckUtils]: 4: Hoare triple {32#true} call #t~ret5 := main(); {32#true} is VALID [2018-11-14 19:17:11,640 INFO L273 TraceCheckUtils]: 5: Hoare triple {32#true} ~SIZE~0 := (if #t~nondet3 % 4294967296 < 0 && #t~nondet3 % 4294967296 % 2 != 0 then #t~nondet3 % 4294967296 / 2 + 1 else #t~nondet3 % 4294967296 / 2) + 1;havoc #t~nondet3;call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc((if ~SIZE~0 % 4294967296 % 4294967296 <= 2147483647 then ~SIZE~0 % 4294967296 % 4294967296 else ~SIZE~0 % 4294967296 % 4294967296 - 4294967296) * 4);call write~int(3, ~#a~0.base, ~#a~0.offset + (if (if ~SIZE~0 % 4294967296 < 0 && ~SIZE~0 % 4294967296 % 2 != 0 then ~SIZE~0 % 4294967296 / 2 + 1 else ~SIZE~0 % 4294967296 / 2) % 4294967296 % 4294967296 <= 2147483647 then (if ~SIZE~0 % 4294967296 < 0 && ~SIZE~0 % 4294967296 % 2 != 0 then ~SIZE~0 % 4294967296 / 2 + 1 else ~SIZE~0 % 4294967296 / 2) % 4294967296 % 4294967296 else (if ~SIZE~0 % 4294967296 < 0 && ~SIZE~0 % 4294967296 % 2 != 0 then ~SIZE~0 % 4294967296 / 2 + 1 else ~SIZE~0 % 4294967296 / 2) % 4294967296 % 4294967296 - 4294967296) * 4, 4); {32#true} is VALID [2018-11-14 19:17:11,641 INFO L256 TraceCheckUtils]: 6: Hoare triple {32#true} call #t~ret4 := linear_search(~#a~0.base, ~#a~0.offset, (if ~SIZE~0 % 4294967296 % 4294967296 <= 2147483647 then ~SIZE~0 % 4294967296 % 4294967296 else ~SIZE~0 % 4294967296 % 4294967296 - 4294967296), 3); {32#true} is VALID [2018-11-14 19:17:11,642 INFO L273 TraceCheckUtils]: 7: Hoare triple {32#true} ~a.base, ~a.offset := #in~a.base, #in~a.offset;~n := #in~n;~q := #in~q;~j~0 := 0; {32#true} is VALID [2018-11-14 19:17:11,643 INFO L273 TraceCheckUtils]: 8: Hoare triple {32#true} assume !true; {33#false} is VALID [2018-11-14 19:17:11,643 INFO L273 TraceCheckUtils]: 9: Hoare triple {33#false} assume ~j~0 % 4294967296 < ~SIZE~0 % 4294967296;#res := 1; {33#false} is VALID [2018-11-14 19:17:11,643 INFO L273 TraceCheckUtils]: 10: Hoare triple {33#false} assume true; {33#false} is VALID [2018-11-14 19:17:11,644 INFO L268 TraceCheckUtils]: 11: Hoare quadruple {33#false} {32#true} #59#return; {33#false} is VALID [2018-11-14 19:17:11,644 INFO L273 TraceCheckUtils]: 12: Hoare triple {33#false} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {33#false} is VALID [2018-11-14 19:17:11,644 INFO L256 TraceCheckUtils]: 13: Hoare triple {33#false} call __VERIFIER_assert(#t~ret4); {33#false} is VALID [2018-11-14 19:17:11,645 INFO L273 TraceCheckUtils]: 14: Hoare triple {33#false} ~cond := #in~cond; {33#false} is VALID [2018-11-14 19:17:11,645 INFO L273 TraceCheckUtils]: 15: Hoare triple {33#false} assume ~cond == 0; {33#false} is VALID [2018-11-14 19:17:11,645 INFO L273 TraceCheckUtils]: 16: Hoare triple {33#false} assume !false; {33#false} is VALID [2018-11-14 19:17:11,650 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-14 19:17:11,653 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-14 19:17:11,653 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-14 19:17:11,658 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 17 [2018-11-14 19:17:11,661 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 19:17:11,665 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states. [2018-11-14 19:17:11,806 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 17 edges. 17 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 19:17:11,806 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-11-14 19:17:11,816 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-14 19:17:11,817 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-14 19:17:11,820 INFO L87 Difference]: Start difference. First operand 29 states. Second operand 2 states. [2018-11-14 19:17:12,160 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 19:17:12,160 INFO L93 Difference]: Finished difference Result 45 states and 52 transitions. [2018-11-14 19:17:12,160 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-14 19:17:12,161 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 17 [2018-11-14 19:17:12,161 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 19:17:12,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-14 19:17:12,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 52 transitions. [2018-11-14 19:17:12,173 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-14 19:17:12,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 52 transitions. [2018-11-14 19:17:12,178 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 52 transitions. [2018-11-14 19:17:12,344 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 52 edges. 52 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 19:17:12,354 INFO L225 Difference]: With dead ends: 45 [2018-11-14 19:17:12,355 INFO L226 Difference]: Without dead ends: 22 [2018-11-14 19:17:12,358 INFO L604 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-14 19:17:12,373 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2018-11-14 19:17:12,396 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2018-11-14 19:17:12,397 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 19:17:12,397 INFO L82 GeneralOperation]: Start isEquivalent. First operand 22 states. Second operand 22 states. [2018-11-14 19:17:12,398 INFO L74 IsIncluded]: Start isIncluded. First operand 22 states. Second operand 22 states. [2018-11-14 19:17:12,398 INFO L87 Difference]: Start difference. First operand 22 states. Second operand 22 states. [2018-11-14 19:17:12,401 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 19:17:12,402 INFO L93 Difference]: Finished difference Result 22 states and 25 transitions. [2018-11-14 19:17:12,402 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 25 transitions. [2018-11-14 19:17:12,402 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 19:17:12,403 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 19:17:12,403 INFO L74 IsIncluded]: Start isIncluded. First operand 22 states. Second operand 22 states. [2018-11-14 19:17:12,403 INFO L87 Difference]: Start difference. First operand 22 states. Second operand 22 states. [2018-11-14 19:17:12,407 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 19:17:12,407 INFO L93 Difference]: Finished difference Result 22 states and 25 transitions. [2018-11-14 19:17:12,407 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 25 transitions. [2018-11-14 19:17:12,407 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 19:17:12,408 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 19:17:12,408 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 19:17:12,408 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 19:17:12,408 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2018-11-14 19:17:12,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 25 transitions. [2018-11-14 19:17:12,412 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 25 transitions. Word has length 17 [2018-11-14 19:17:12,413 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 19:17:12,413 INFO L480 AbstractCegarLoop]: Abstraction has 22 states and 25 transitions. [2018-11-14 19:17:12,413 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-11-14 19:17:12,413 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 25 transitions. [2018-11-14 19:17:12,414 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-11-14 19:17:12,414 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 19:17:12,414 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 19:17:12,415 INFO L423 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 19:17:12,415 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 19:17:12,415 INFO L82 PathProgramCache]: Analyzing trace with hash 1077985819, now seen corresponding path program 1 times [2018-11-14 19:17:12,415 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 19:17:12,415 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 19:17:12,417 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 19:17:12,417 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 19:17:12,417 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 19:17:12,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 19:17:12,731 INFO L256 TraceCheckUtils]: 0: Hoare triple {167#true} call ULTIMATE.init(); {167#true} is VALID [2018-11-14 19:17:12,732 INFO L273 TraceCheckUtils]: 1: Hoare triple {167#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~SIZE~0 := 0; {167#true} is VALID [2018-11-14 19:17:12,732 INFO L273 TraceCheckUtils]: 2: Hoare triple {167#true} assume true; {167#true} is VALID [2018-11-14 19:17:12,733 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {167#true} {167#true} #55#return; {167#true} is VALID [2018-11-14 19:17:12,733 INFO L256 TraceCheckUtils]: 4: Hoare triple {167#true} call #t~ret5 := main(); {167#true} is VALID [2018-11-14 19:17:12,734 INFO L273 TraceCheckUtils]: 5: Hoare triple {167#true} ~SIZE~0 := (if #t~nondet3 % 4294967296 < 0 && #t~nondet3 % 4294967296 % 2 != 0 then #t~nondet3 % 4294967296 / 2 + 1 else #t~nondet3 % 4294967296 / 2) + 1;havoc #t~nondet3;call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc((if ~SIZE~0 % 4294967296 % 4294967296 <= 2147483647 then ~SIZE~0 % 4294967296 % 4294967296 else ~SIZE~0 % 4294967296 % 4294967296 - 4294967296) * 4);call write~int(3, ~#a~0.base, ~#a~0.offset + (if (if ~SIZE~0 % 4294967296 < 0 && ~SIZE~0 % 4294967296 % 2 != 0 then ~SIZE~0 % 4294967296 / 2 + 1 else ~SIZE~0 % 4294967296 / 2) % 4294967296 % 4294967296 <= 2147483647 then (if ~SIZE~0 % 4294967296 < 0 && ~SIZE~0 % 4294967296 % 2 != 0 then ~SIZE~0 % 4294967296 / 2 + 1 else ~SIZE~0 % 4294967296 / 2) % 4294967296 % 4294967296 else (if ~SIZE~0 % 4294967296 < 0 && ~SIZE~0 % 4294967296 % 2 != 0 then ~SIZE~0 % 4294967296 / 2 + 1 else ~SIZE~0 % 4294967296 / 2) % 4294967296 % 4294967296 - 4294967296) * 4, 4); {167#true} is VALID [2018-11-14 19:17:12,734 INFO L256 TraceCheckUtils]: 6: Hoare triple {167#true} call #t~ret4 := linear_search(~#a~0.base, ~#a~0.offset, (if ~SIZE~0 % 4294967296 % 4294967296 <= 2147483647 then ~SIZE~0 % 4294967296 % 4294967296 else ~SIZE~0 % 4294967296 % 4294967296 - 4294967296), 3); {167#true} is VALID [2018-11-14 19:17:12,734 INFO L273 TraceCheckUtils]: 7: Hoare triple {167#true} ~a.base, ~a.offset := #in~a.base, #in~a.offset;~n := #in~n;~q := #in~q;~j~0 := 0; {167#true} is VALID [2018-11-14 19:17:12,735 INFO L273 TraceCheckUtils]: 8: Hoare triple {167#true} assume true; {167#true} is VALID [2018-11-14 19:17:12,735 INFO L273 TraceCheckUtils]: 9: Hoare triple {167#true} #t~short1 := ~j~0 % 4294967296 < ~n % 4294967296; {167#true} is VALID [2018-11-14 19:17:12,735 INFO L273 TraceCheckUtils]: 10: Hoare triple {167#true} assume #t~short1;call #t~mem0 := read~int(~a.base, ~a.offset + (if ~j~0 % 4294967296 % 4294967296 <= 2147483647 then ~j~0 % 4294967296 % 4294967296 else ~j~0 % 4294967296 % 4294967296 - 4294967296) * 4, 4);#t~short1 := #t~mem0 != ~q; {167#true} is VALID [2018-11-14 19:17:12,736 INFO L273 TraceCheckUtils]: 11: Hoare triple {167#true} assume !#t~short1;havoc #t~short1;havoc #t~mem0; {167#true} is VALID [2018-11-14 19:17:12,737 INFO L273 TraceCheckUtils]: 12: Hoare triple {167#true} assume ~j~0 % 4294967296 < ~SIZE~0 % 4294967296;#res := 1; {169#(= 1 |linear_search_#res|)} is VALID [2018-11-14 19:17:12,739 INFO L273 TraceCheckUtils]: 13: Hoare triple {169#(= 1 |linear_search_#res|)} assume true; {169#(= 1 |linear_search_#res|)} is VALID [2018-11-14 19:17:12,751 INFO L268 TraceCheckUtils]: 14: Hoare quadruple {169#(= 1 |linear_search_#res|)} {167#true} #59#return; {170#(= 1 |main_#t~ret4|)} is VALID [2018-11-14 19:17:12,765 INFO L273 TraceCheckUtils]: 15: Hoare triple {170#(= 1 |main_#t~ret4|)} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {170#(= 1 |main_#t~ret4|)} is VALID [2018-11-14 19:17:12,775 INFO L256 TraceCheckUtils]: 16: Hoare triple {170#(= 1 |main_#t~ret4|)} call __VERIFIER_assert(#t~ret4); {171#(= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2018-11-14 19:17:12,786 INFO L273 TraceCheckUtils]: 17: Hoare triple {171#(= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {172#(= 1 __VERIFIER_assert_~cond)} is VALID [2018-11-14 19:17:12,788 INFO L273 TraceCheckUtils]: 18: Hoare triple {172#(= 1 __VERIFIER_assert_~cond)} assume ~cond == 0; {168#false} is VALID [2018-11-14 19:17:12,788 INFO L273 TraceCheckUtils]: 19: Hoare triple {168#false} assume !false; {168#false} is VALID [2018-11-14 19:17:12,791 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-14 19:17:12,791 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-14 19:17:12,792 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-14 19:17:12,793 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 20 [2018-11-14 19:17:12,794 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 19:17:12,794 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2018-11-14 19:17:12,866 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 20 edges. 20 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 19:17:12,866 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-14 19:17:12,866 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-14 19:17:12,867 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-11-14 19:17:12,867 INFO L87 Difference]: Start difference. First operand 22 states and 25 transitions. Second operand 6 states. [2018-11-14 19:17:13,564 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 19:17:13,565 INFO L93 Difference]: Finished difference Result 30 states and 32 transitions. [2018-11-14 19:17:13,565 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-14 19:17:13,565 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 20 [2018-11-14 19:17:13,565 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 19:17:13,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-14 19:17:13,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 32 transitions. [2018-11-14 19:17:13,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-14 19:17:13,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 32 transitions. [2018-11-14 19:17:13,571 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 32 transitions. [2018-11-14 19:17:13,629 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 32 edges. 32 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 19:17:13,632 INFO L225 Difference]: With dead ends: 30 [2018-11-14 19:17:13,632 INFO L226 Difference]: Without dead ends: 22 [2018-11-14 19:17:13,633 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-11-14 19:17:13,634 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2018-11-14 19:17:13,644 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2018-11-14 19:17:13,645 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 19:17:13,645 INFO L82 GeneralOperation]: Start isEquivalent. First operand 22 states. Second operand 22 states. [2018-11-14 19:17:13,645 INFO L74 IsIncluded]: Start isIncluded. First operand 22 states. Second operand 22 states. [2018-11-14 19:17:13,645 INFO L87 Difference]: Start difference. First operand 22 states. Second operand 22 states. [2018-11-14 19:17:13,647 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 19:17:13,648 INFO L93 Difference]: Finished difference Result 22 states and 24 transitions. [2018-11-14 19:17:13,648 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 24 transitions. [2018-11-14 19:17:13,648 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 19:17:13,649 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 19:17:13,649 INFO L74 IsIncluded]: Start isIncluded. First operand 22 states. Second operand 22 states. [2018-11-14 19:17:13,649 INFO L87 Difference]: Start difference. First operand 22 states. Second operand 22 states. [2018-11-14 19:17:13,651 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 19:17:13,651 INFO L93 Difference]: Finished difference Result 22 states and 24 transitions. [2018-11-14 19:17:13,652 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 24 transitions. [2018-11-14 19:17:13,652 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 19:17:13,652 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 19:17:13,653 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 19:17:13,653 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 19:17:13,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2018-11-14 19:17:13,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 24 transitions. [2018-11-14 19:17:13,655 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 24 transitions. Word has length 20 [2018-11-14 19:17:13,655 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 19:17:13,655 INFO L480 AbstractCegarLoop]: Abstraction has 22 states and 24 transitions. [2018-11-14 19:17:13,656 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-14 19:17:13,656 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 24 transitions. [2018-11-14 19:17:13,656 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-11-14 19:17:13,657 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 19:17:13,657 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 19:17:13,657 INFO L423 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 19:17:13,657 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 19:17:13,658 INFO L82 PathProgramCache]: Analyzing trace with hash -1474171142, now seen corresponding path program 1 times [2018-11-14 19:17:13,658 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 19:17:13,658 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 19:17:13,659 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 19:17:13,659 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 19:17:13,659 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 19:17:13,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 19:17:14,159 WARN L179 SmtUtils]: Spent 173.00 ms on a formula simplification. DAG size of input: 10 DAG size of output: 8 [2018-11-14 19:17:14,270 INFO L256 TraceCheckUtils]: 0: Hoare triple {293#true} call ULTIMATE.init(); {293#true} is VALID [2018-11-14 19:17:14,271 INFO L273 TraceCheckUtils]: 1: Hoare triple {293#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~SIZE~0 := 0; {293#true} is VALID [2018-11-14 19:17:14,271 INFO L273 TraceCheckUtils]: 2: Hoare triple {293#true} assume true; {293#true} is VALID [2018-11-14 19:17:14,271 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {293#true} {293#true} #55#return; {293#true} is VALID [2018-11-14 19:17:14,272 INFO L256 TraceCheckUtils]: 4: Hoare triple {293#true} call #t~ret5 := main(); {293#true} is VALID [2018-11-14 19:17:14,273 INFO L273 TraceCheckUtils]: 5: Hoare triple {293#true} ~SIZE~0 := (if #t~nondet3 % 4294967296 < 0 && #t~nondet3 % 4294967296 % 2 != 0 then #t~nondet3 % 4294967296 / 2 + 1 else #t~nondet3 % 4294967296 / 2) + 1;havoc #t~nondet3;call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc((if ~SIZE~0 % 4294967296 % 4294967296 <= 2147483647 then ~SIZE~0 % 4294967296 % 4294967296 else ~SIZE~0 % 4294967296 % 4294967296 - 4294967296) * 4);call write~int(3, ~#a~0.base, ~#a~0.offset + (if (if ~SIZE~0 % 4294967296 < 0 && ~SIZE~0 % 4294967296 % 2 != 0 then ~SIZE~0 % 4294967296 / 2 + 1 else ~SIZE~0 % 4294967296 / 2) % 4294967296 % 4294967296 <= 2147483647 then (if ~SIZE~0 % 4294967296 < 0 && ~SIZE~0 % 4294967296 % 2 != 0 then ~SIZE~0 % 4294967296 / 2 + 1 else ~SIZE~0 % 4294967296 / 2) % 4294967296 % 4294967296 else (if ~SIZE~0 % 4294967296 < 0 && ~SIZE~0 % 4294967296 % 2 != 0 then ~SIZE~0 % 4294967296 / 2 + 1 else ~SIZE~0 % 4294967296 / 2) % 4294967296 % 4294967296 - 4294967296) * 4, 4); {295#(and (<= (div ~SIZE~0 4294967296) 0) (<= 1 ~SIZE~0))} is VALID [2018-11-14 19:17:14,274 INFO L256 TraceCheckUtils]: 6: Hoare triple {295#(and (<= (div ~SIZE~0 4294967296) 0) (<= 1 ~SIZE~0))} call #t~ret4 := linear_search(~#a~0.base, ~#a~0.offset, (if ~SIZE~0 % 4294967296 % 4294967296 <= 2147483647 then ~SIZE~0 % 4294967296 % 4294967296 else ~SIZE~0 % 4294967296 % 4294967296 - 4294967296), 3); {293#true} is VALID [2018-11-14 19:17:14,274 INFO L273 TraceCheckUtils]: 7: Hoare triple {293#true} ~a.base, ~a.offset := #in~a.base, #in~a.offset;~n := #in~n;~q := #in~q;~j~0 := 0; {296#(= linear_search_~j~0 0)} is VALID [2018-11-14 19:17:14,275 INFO L273 TraceCheckUtils]: 8: Hoare triple {296#(= linear_search_~j~0 0)} assume true; {296#(= linear_search_~j~0 0)} is VALID [2018-11-14 19:17:14,276 INFO L273 TraceCheckUtils]: 9: Hoare triple {296#(= linear_search_~j~0 0)} #t~short1 := ~j~0 % 4294967296 < ~n % 4294967296; {296#(= linear_search_~j~0 0)} is VALID [2018-11-14 19:17:14,277 INFO L273 TraceCheckUtils]: 10: Hoare triple {296#(= linear_search_~j~0 0)} assume #t~short1;call #t~mem0 := read~int(~a.base, ~a.offset + (if ~j~0 % 4294967296 % 4294967296 <= 2147483647 then ~j~0 % 4294967296 % 4294967296 else ~j~0 % 4294967296 % 4294967296 - 4294967296) * 4, 4);#t~short1 := #t~mem0 != ~q; {296#(= linear_search_~j~0 0)} is VALID [2018-11-14 19:17:14,279 INFO L273 TraceCheckUtils]: 11: Hoare triple {296#(= linear_search_~j~0 0)} assume !#t~short1;havoc #t~short1;havoc #t~mem0; {296#(= linear_search_~j~0 0)} is VALID [2018-11-14 19:17:14,281 INFO L273 TraceCheckUtils]: 12: Hoare triple {296#(= linear_search_~j~0 0)} assume !(~j~0 % 4294967296 < ~SIZE~0 % 4294967296);#res := 0; {297#(or (< 0 (div ~SIZE~0 4294967296)) (<= ~SIZE~0 (* 4294967296 (div ~SIZE~0 4294967296))))} is VALID [2018-11-14 19:17:14,290 INFO L273 TraceCheckUtils]: 13: Hoare triple {297#(or (< 0 (div ~SIZE~0 4294967296)) (<= ~SIZE~0 (* 4294967296 (div ~SIZE~0 4294967296))))} assume true; {297#(or (< 0 (div ~SIZE~0 4294967296)) (<= ~SIZE~0 (* 4294967296 (div ~SIZE~0 4294967296))))} is VALID [2018-11-14 19:17:14,294 INFO L268 TraceCheckUtils]: 14: Hoare quadruple {297#(or (< 0 (div ~SIZE~0 4294967296)) (<= ~SIZE~0 (* 4294967296 (div ~SIZE~0 4294967296))))} {295#(and (<= (div ~SIZE~0 4294967296) 0) (<= 1 ~SIZE~0))} #59#return; {294#false} is VALID [2018-11-14 19:17:14,295 INFO L273 TraceCheckUtils]: 15: Hoare triple {294#false} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {294#false} is VALID [2018-11-14 19:17:14,295 INFO L256 TraceCheckUtils]: 16: Hoare triple {294#false} call __VERIFIER_assert(#t~ret4); {294#false} is VALID [2018-11-14 19:17:14,295 INFO L273 TraceCheckUtils]: 17: Hoare triple {294#false} ~cond := #in~cond; {294#false} is VALID [2018-11-14 19:17:14,296 INFO L273 TraceCheckUtils]: 18: Hoare triple {294#false} assume ~cond == 0; {294#false} is VALID [2018-11-14 19:17:14,296 INFO L273 TraceCheckUtils]: 19: Hoare triple {294#false} assume !false; {294#false} is VALID [2018-11-14 19:17:14,297 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-14 19:17:14,298 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-14 19:17:14,298 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-14 19:17:14,299 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 20 [2018-11-14 19:17:14,299 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 19:17:14,299 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2018-11-14 19:17:14,347 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 20 edges. 20 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 19:17:14,347 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-14 19:17:14,348 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-14 19:17:14,348 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-14 19:17:14,348 INFO L87 Difference]: Start difference. First operand 22 states and 24 transitions. Second operand 5 states. [2018-11-14 19:17:14,647 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 19:17:14,647 INFO L93 Difference]: Finished difference Result 35 states and 38 transitions. [2018-11-14 19:17:14,647 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-14 19:17:14,648 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 20 [2018-11-14 19:17:14,648 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 19:17:14,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-14 19:17:14,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 38 transitions. [2018-11-14 19:17:14,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-14 19:17:14,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 38 transitions. [2018-11-14 19:17:14,654 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 38 transitions. [2018-11-14 19:17:14,754 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-14 19:17:14,756 INFO L225 Difference]: With dead ends: 35 [2018-11-14 19:17:14,756 INFO L226 Difference]: Without dead ends: 26 [2018-11-14 19:17:14,757 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-11-14 19:17:14,757 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2018-11-14 19:17:14,783 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2018-11-14 19:17:14,783 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 19:17:14,783 INFO L82 GeneralOperation]: Start isEquivalent. First operand 26 states. Second operand 26 states. [2018-11-14 19:17:14,783 INFO L74 IsIncluded]: Start isIncluded. First operand 26 states. Second operand 26 states. [2018-11-14 19:17:14,784 INFO L87 Difference]: Start difference. First operand 26 states. Second operand 26 states. [2018-11-14 19:17:14,786 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 19:17:14,786 INFO L93 Difference]: Finished difference Result 26 states and 29 transitions. [2018-11-14 19:17:14,786 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 29 transitions. [2018-11-14 19:17:14,786 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 19:17:14,787 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 19:17:14,787 INFO L74 IsIncluded]: Start isIncluded. First operand 26 states. Second operand 26 states. [2018-11-14 19:17:14,787 INFO L87 Difference]: Start difference. First operand 26 states. Second operand 26 states. [2018-11-14 19:17:14,789 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 19:17:14,789 INFO L93 Difference]: Finished difference Result 26 states and 29 transitions. [2018-11-14 19:17:14,790 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 29 transitions. [2018-11-14 19:17:14,790 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 19:17:14,790 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 19:17:14,791 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 19:17:14,791 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 19:17:14,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2018-11-14 19:17:14,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 29 transitions. [2018-11-14 19:17:14,793 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 29 transitions. Word has length 20 [2018-11-14 19:17:14,793 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 19:17:14,793 INFO L480 AbstractCegarLoop]: Abstraction has 26 states and 29 transitions. [2018-11-14 19:17:14,793 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-14 19:17:14,793 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 29 transitions. [2018-11-14 19:17:14,794 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-11-14 19:17:14,794 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 19:17:14,794 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 19:17:14,795 INFO L423 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 19:17:14,795 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 19:17:14,795 INFO L82 PathProgramCache]: Analyzing trace with hash -461535108, now seen corresponding path program 1 times [2018-11-14 19:17:14,795 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 19:17:14,796 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 19:17:14,796 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 19:17:14,797 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 19:17:14,797 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 19:17:14,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 19:17:15,320 INFO L256 TraceCheckUtils]: 0: Hoare triple {437#true} call ULTIMATE.init(); {437#true} is VALID [2018-11-14 19:17:15,321 INFO L273 TraceCheckUtils]: 1: Hoare triple {437#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~SIZE~0 := 0; {437#true} is VALID [2018-11-14 19:17:15,321 INFO L273 TraceCheckUtils]: 2: Hoare triple {437#true} assume true; {437#true} is VALID [2018-11-14 19:17:15,321 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {437#true} {437#true} #55#return; {437#true} is VALID [2018-11-14 19:17:15,322 INFO L256 TraceCheckUtils]: 4: Hoare triple {437#true} call #t~ret5 := main(); {437#true} is VALID [2018-11-14 19:17:15,322 INFO L273 TraceCheckUtils]: 5: Hoare triple {437#true} ~SIZE~0 := (if #t~nondet3 % 4294967296 < 0 && #t~nondet3 % 4294967296 % 2 != 0 then #t~nondet3 % 4294967296 / 2 + 1 else #t~nondet3 % 4294967296 / 2) + 1;havoc #t~nondet3;call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc((if ~SIZE~0 % 4294967296 % 4294967296 <= 2147483647 then ~SIZE~0 % 4294967296 % 4294967296 else ~SIZE~0 % 4294967296 % 4294967296 - 4294967296) * 4);call write~int(3, ~#a~0.base, ~#a~0.offset + (if (if ~SIZE~0 % 4294967296 < 0 && ~SIZE~0 % 4294967296 % 2 != 0 then ~SIZE~0 % 4294967296 / 2 + 1 else ~SIZE~0 % 4294967296 / 2) % 4294967296 % 4294967296 <= 2147483647 then (if ~SIZE~0 % 4294967296 < 0 && ~SIZE~0 % 4294967296 % 2 != 0 then ~SIZE~0 % 4294967296 / 2 + 1 else ~SIZE~0 % 4294967296 / 2) % 4294967296 % 4294967296 else (if ~SIZE~0 % 4294967296 < 0 && ~SIZE~0 % 4294967296 % 2 != 0 then ~SIZE~0 % 4294967296 / 2 + 1 else ~SIZE~0 % 4294967296 / 2) % 4294967296 % 4294967296 - 4294967296) * 4, 4); {437#true} is VALID [2018-11-14 19:17:15,322 INFO L256 TraceCheckUtils]: 6: Hoare triple {437#true} call #t~ret4 := linear_search(~#a~0.base, ~#a~0.offset, (if ~SIZE~0 % 4294967296 % 4294967296 <= 2147483647 then ~SIZE~0 % 4294967296 % 4294967296 else ~SIZE~0 % 4294967296 % 4294967296 - 4294967296), 3); {437#true} is VALID [2018-11-14 19:17:15,324 INFO L273 TraceCheckUtils]: 7: Hoare triple {437#true} ~a.base, ~a.offset := #in~a.base, #in~a.offset;~n := #in~n;~q := #in~q;~j~0 := 0; {439#(= linear_search_~j~0 0)} is VALID [2018-11-14 19:17:15,325 INFO L273 TraceCheckUtils]: 8: Hoare triple {439#(= linear_search_~j~0 0)} assume true; {439#(= linear_search_~j~0 0)} is VALID [2018-11-14 19:17:15,326 INFO L273 TraceCheckUtils]: 9: Hoare triple {439#(= linear_search_~j~0 0)} #t~short1 := ~j~0 % 4294967296 < ~n % 4294967296; {439#(= linear_search_~j~0 0)} is VALID [2018-11-14 19:17:15,326 INFO L273 TraceCheckUtils]: 10: Hoare triple {439#(= linear_search_~j~0 0)} assume #t~short1;call #t~mem0 := read~int(~a.base, ~a.offset + (if ~j~0 % 4294967296 % 4294967296 <= 2147483647 then ~j~0 % 4294967296 % 4294967296 else ~j~0 % 4294967296 % 4294967296 - 4294967296) * 4, 4);#t~short1 := #t~mem0 != ~q; {439#(= linear_search_~j~0 0)} is VALID [2018-11-14 19:17:15,328 INFO L273 TraceCheckUtils]: 11: Hoare triple {439#(= linear_search_~j~0 0)} assume !!#t~short1;havoc #t~short1;havoc #t~mem0;#t~post2 := ~j~0;~j~0 := #t~post2 + 1;havoc #t~post2; {440#(and (<= linear_search_~j~0 1) (< 0 (+ (div linear_search_~j~0 4294967296) 1)))} is INVALID [2018-11-14 19:17:15,329 FATAL L292 ToolchainWalker]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.AssertionError: invalid Hoare triple in Craig at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckUtils.checkInterpolantsInductivityForward(TraceCheckUtils.java:199) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.InterpolatingTraceCheckCraig.computeInterpolantsTree(InterpolatingTraceCheckCraig.java:276) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.InterpolatingTraceCheckCraig.computeInterpolants(InterpolatingTraceCheckCraig.java:207) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.InterpolatingTraceCheckCraig.(InterpolatingTraceCheckCraig.java:109) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.constructCraig(TraceCheckConstructor.java:211) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.constructTraceCheck(TraceCheckConstructor.java:183) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.get(TraceCheckConstructor.java:165) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.MultiTrackRefinementStrategy.getTraceCheck(MultiTrackRefinementStrategy.java:232) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseRefinementStrategy.checkFeasibility(BaseRefinementStrategy.java:223) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseRefinementStrategy.executeStrategy(BaseRefinementStrategy.java:197) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:70) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:429) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:434) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:376) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterate(TraceAbstractionStarter.java:312) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:123) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:316) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) [2018-11-14 19:17:15,333 INFO L168 Benchmark]: Toolchain (without parser) took 5208.69 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 742.4 MB). Free memory was 1.4 GB in the beginning and 2.0 GB in the end (delta: -608.9 MB). Peak memory consumption was 133.5 MB. Max. memory is 7.1 GB. [2018-11-14 19:17:15,335 INFO L168 Benchmark]: CDTParser took 0.22 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-14 19:17:15,335 INFO L168 Benchmark]: CACSL2BoogieTranslator took 361.81 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-14 19:17:15,336 INFO L168 Benchmark]: Boogie Preprocessor took 42.86 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-14 19:17:15,337 INFO L168 Benchmark]: RCFGBuilder took 759.30 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 742.4 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -780.5 MB). Peak memory consumption was 26.3 MB. Max. memory is 7.1 GB. [2018-11-14 19:17:15,337 INFO L168 Benchmark]: TraceAbstraction took 4038.04 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 2.0 GB in the end (delta: 161.0 MB). Peak memory consumption was 161.0 MB. Max. memory is 7.1 GB. [2018-11-14 19:17:15,342 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.22 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.81 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 Preprocessor took 42.86 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 759.30 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 742.4 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -780.5 MB). Peak memory consumption was 26.3 MB. Max. memory is 7.1 GB. * TraceAbstraction took 4038.04 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 2.0 GB in the end (delta: 161.0 MB). Peak memory consumption was 161.0 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: AssertionError: invalid Hoare triple in Craig de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: AssertionError: invalid Hoare triple in Craig: de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckUtils.checkInterpolantsInductivityForward(TraceCheckUtils.java:199) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request...