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.epf -i ../../../trunk/examples/svcomp/loops/linear_search_false-unreach-call.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-18e5b2d-m [2018-11-18 23:56:25,431 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-18 23:56:25,433 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-18 23:56:25,445 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-18 23:56:25,446 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-18 23:56:25,447 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-18 23:56:25,448 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-18 23:56:25,450 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-18 23:56:25,452 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-18 23:56:25,453 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-18 23:56:25,454 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-18 23:56:25,454 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-18 23:56:25,455 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-18 23:56:25,458 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-18 23:56:25,459 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-18 23:56:25,462 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-18 23:56:25,463 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-18 23:56:25,470 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-18 23:56:25,475 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-18 23:56:25,477 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-18 23:56:25,480 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-18 23:56:25,481 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-18 23:56:25,487 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-18 23:56:25,487 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-18 23:56:25,487 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-18 23:56:25,490 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-18 23:56:25,490 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-18 23:56:25,493 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-18 23:56:25,494 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-18 23:56:25,495 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-18 23:56:25,495 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-18 23:56:25,497 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-18 23:56:25,497 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-18 23:56:25,497 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-18 23:56:25,498 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-18 23:56:25,499 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-18 23:56:25,499 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-18 23:56:25,533 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-18 23:56:25,534 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-18 23:56:25,534 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-18 23:56:25,537 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-11-18 23:56:25,538 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-18 23:56:25,538 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-18 23:56:25,538 INFO L133 SettingsManager]: * Use SBE=true [2018-11-18 23:56:25,538 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-18 23:56:25,538 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-18 23:56:25,539 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-18 23:56:25,539 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-18 23:56:25,539 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-18 23:56:25,539 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-18 23:56:25,539 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-18 23:56:25,540 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-18 23:56:25,542 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-18 23:56:25,542 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-18 23:56:25,543 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-18 23:56:25,543 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-18 23:56:25,543 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-18 23:56:25,543 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-18 23:56:25,544 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-18 23:56:25,544 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-18 23:56:25,544 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-18 23:56:25,544 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-18 23:56:25,544 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-18 23:56:25,545 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-18 23:56:25,545 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-18 23:56:25,545 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-18 23:56:25,545 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-18 23:56:25,545 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-18 23:56:25,601 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-18 23:56:25,620 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-18 23:56:25,626 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-18 23:56:25,627 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-18 23:56:25,628 INFO L276 PluginConnector]: CDTParser initialized [2018-11-18 23:56:25,629 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-18 23:56:25,699 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a33be1c92/4e815183bb664066b419e2cfdbe86f2e/FLAG0a27d2ab0 [2018-11-18 23:56:26,122 INFO L307 CDTParser]: Found 1 translation units. [2018-11-18 23:56:26,122 INFO L161 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loops/linear_search_false-unreach-call.i [2018-11-18 23:56:26,129 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a33be1c92/4e815183bb664066b419e2cfdbe86f2e/FLAG0a27d2ab0 [2018-11-18 23:56:26,512 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a33be1c92/4e815183bb664066b419e2cfdbe86f2e [2018-11-18 23:56:26,526 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-18 23:56:26,528 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-11-18 23:56:26,529 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-18 23:56:26,529 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-18 23:56:26,533 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-18 23:56:26,535 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 11:56:26" (1/1) ... [2018-11-18 23:56:26,538 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@30caa8ca and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:56:26, skipping insertion in model container [2018-11-18 23:56:26,538 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 11:56:26" (1/1) ... [2018-11-18 23:56:26,549 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-18 23:56:26,576 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-18 23:56:26,848 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-18 23:56:26,866 INFO L191 MainTranslator]: Completed pre-run [2018-11-18 23:56:26,895 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-18 23:56:26,916 INFO L195 MainTranslator]: Completed translation [2018-11-18 23:56:26,917 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:56:26 WrapperNode [2018-11-18 23:56:26,917 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-18 23:56:26,918 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-18 23:56:26,918 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-18 23:56:26,918 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-18 23:56:26,930 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:56:26" (1/1) ... [2018-11-18 23:56:26,930 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:56:26" (1/1) ... [2018-11-18 23:56:26,940 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:56:26" (1/1) ... [2018-11-18 23:56:26,940 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:56:26" (1/1) ... [2018-11-18 23:56:26,950 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:56:26" (1/1) ... [2018-11-18 23:56:26,956 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:56:26" (1/1) ... [2018-11-18 23:56:26,958 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:56:26" (1/1) ... [2018-11-18 23:56:26,960 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-18 23:56:26,961 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-18 23:56:26,961 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-18 23:56:26,961 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-18 23:56:26,962 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:56:26" (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-18 23:56:27,091 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-18 23:56:27,092 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-18 23:56:27,092 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2018-11-18 23:56:27,092 INFO L138 BoogieDeclarations]: Found implementation of procedure linear_search [2018-11-18 23:56:27,092 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-18 23:56:27,092 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2018-11-18 23:56:27,092 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2018-11-18 23:56:27,093 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_uint [2018-11-18 23:56:27,093 INFO L130 BoogieDeclarations]: Found specification of procedure linear_search [2018-11-18 23:56:27,093 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-18 23:56:27,093 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-18 23:56:27,093 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-18 23:56:27,093 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-18 23:56:27,094 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-18 23:56:27,094 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-18 23:56:27,094 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-18 23:56:27,094 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2018-11-18 23:56:27,730 INFO L280 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-18 23:56:27,730 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 11:56:27 BoogieIcfgContainer [2018-11-18 23:56:27,731 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-18 23:56:27,732 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-18 23:56:27,732 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-18 23:56:27,735 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-18 23:56:27,736 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.11 11:56:26" (1/3) ... [2018-11-18 23:56:27,737 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1013e9af and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 11:56:27, skipping insertion in model container [2018-11-18 23:56:27,737 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:56:26" (2/3) ... [2018-11-18 23:56:27,738 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1013e9af and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 11:56:27, skipping insertion in model container [2018-11-18 23:56:27,738 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 11:56:27" (3/3) ... [2018-11-18 23:56:27,740 INFO L112 eAbstractionObserver]: Analyzing ICFG linear_search_false-unreach-call.i [2018-11-18 23:56:27,750 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-18 23:56:27,760 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-18 23:56:27,778 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-18 23:56:27,821 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-18 23:56:27,822 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-18 23:56:27,822 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-18 23:56:27,823 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-18 23:56:27,823 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-18 23:56:27,823 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-18 23:56:27,823 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-18 23:56:27,824 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-18 23:56:27,824 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-18 23:56:27,842 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states. [2018-11-18 23:56:27,848 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-11-18 23:56:27,848 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 23:56:27,849 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 23:56:27,851 INFO L423 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 23:56:27,858 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 23:56:27,858 INFO L82 PathProgramCache]: Analyzing trace with hash 700043364, now seen corresponding path program 1 times [2018-11-18 23:56:27,861 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 23:56:27,862 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 23:56:27,911 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 23:56:27,911 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 23:56:27,911 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 23:56:27,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 23:56:28,068 INFO L256 TraceCheckUtils]: 0: Hoare triple {32#true} call ULTIMATE.init(); {32#true} is VALID [2018-11-18 23:56:28,071 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-18 23:56:28,072 INFO L273 TraceCheckUtils]: 2: Hoare triple {32#true} assume true; {32#true} is VALID [2018-11-18 23:56:28,073 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {32#true} {32#true} #55#return; {32#true} is VALID [2018-11-18 23:56:28,073 INFO L256 TraceCheckUtils]: 4: Hoare triple {32#true} call #t~ret5 := main(); {32#true} is VALID [2018-11-18 23:56:28,073 INFO L273 TraceCheckUtils]: 5: Hoare triple {32#true} ~SIZE~0 := 1 + (if #t~nondet3 % 4294967296 < 0 && 0 != #t~nondet3 % 4294967296 % 2 then 1 + #t~nondet3 % 4294967296 / 2 else #t~nondet3 % 4294967296 / 2);havoc #t~nondet3;call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(4 * (if ~SIZE~0 % 4294967296 % 4294967296 <= 2147483647 then ~SIZE~0 % 4294967296 % 4294967296 else ~SIZE~0 % 4294967296 % 4294967296 - 4294967296));call write~int(3, ~#a~0.base, ~#a~0.offset + 4 * (if (if ~SIZE~0 % 4294967296 < 0 && 0 != ~SIZE~0 % 4294967296 % 2 then 1 + ~SIZE~0 % 4294967296 / 2 else ~SIZE~0 % 4294967296 / 2) % 4294967296 % 4294967296 <= 2147483647 then (if ~SIZE~0 % 4294967296 < 0 && 0 != ~SIZE~0 % 4294967296 % 2 then 1 + ~SIZE~0 % 4294967296 / 2 else ~SIZE~0 % 4294967296 / 2) % 4294967296 % 4294967296 else (if ~SIZE~0 % 4294967296 < 0 && 0 != ~SIZE~0 % 4294967296 % 2 then 1 + ~SIZE~0 % 4294967296 / 2 else ~SIZE~0 % 4294967296 / 2) % 4294967296 % 4294967296 - 4294967296), 4); {32#true} is VALID [2018-11-18 23:56:28,074 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-18 23:56:28,074 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-18 23:56:28,075 INFO L273 TraceCheckUtils]: 8: Hoare triple {32#true} assume !true; {33#false} is VALID [2018-11-18 23:56:28,075 INFO L273 TraceCheckUtils]: 9: Hoare triple {33#false} assume ~j~0 % 4294967296 < ~SIZE~0 % 4294967296;#res := 1; {33#false} is VALID [2018-11-18 23:56:28,076 INFO L273 TraceCheckUtils]: 10: Hoare triple {33#false} assume true; {33#false} is VALID [2018-11-18 23:56:28,076 INFO L268 TraceCheckUtils]: 11: Hoare quadruple {33#false} {32#true} #59#return; {33#false} is VALID [2018-11-18 23:56:28,076 INFO L273 TraceCheckUtils]: 12: Hoare triple {33#false} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {33#false} is VALID [2018-11-18 23:56:28,077 INFO L256 TraceCheckUtils]: 13: Hoare triple {33#false} call __VERIFIER_assert(#t~ret4); {33#false} is VALID [2018-11-18 23:56:28,077 INFO L273 TraceCheckUtils]: 14: Hoare triple {33#false} ~cond := #in~cond; {33#false} is VALID [2018-11-18 23:56:28,077 INFO L273 TraceCheckUtils]: 15: Hoare triple {33#false} assume 0 == ~cond; {33#false} is VALID [2018-11-18 23:56:28,078 INFO L273 TraceCheckUtils]: 16: Hoare triple {33#false} assume !false; {33#false} is VALID [2018-11-18 23:56:28,082 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-18 23:56:28,085 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 23:56:28,085 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-18 23:56:28,091 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 17 [2018-11-18 23:56:28,094 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-18 23:56:28,098 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states. [2018-11-18 23:56:28,271 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-18 23:56:28,271 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-11-18 23:56:28,281 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-18 23:56:28,282 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-18 23:56:28,285 INFO L87 Difference]: Start difference. First operand 29 states. Second operand 2 states. [2018-11-18 23:56:28,708 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 23:56:28,709 INFO L93 Difference]: Finished difference Result 45 states and 52 transitions. [2018-11-18 23:56:28,709 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-18 23:56:28,709 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 17 [2018-11-18 23:56:28,710 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 23:56:28,711 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-18 23:56:28,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 52 transitions. [2018-11-18 23:56:28,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-18 23:56:28,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 52 transitions. [2018-11-18 23:56:28,729 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 52 transitions. [2018-11-18 23:56:29,017 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-18 23:56:29,028 INFO L225 Difference]: With dead ends: 45 [2018-11-18 23:56:29,028 INFO L226 Difference]: Without dead ends: 22 [2018-11-18 23:56:29,032 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-18 23:56:29,048 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2018-11-18 23:56:29,080 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2018-11-18 23:56:29,080 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-18 23:56:29,081 INFO L82 GeneralOperation]: Start isEquivalent. First operand 22 states. Second operand 22 states. [2018-11-18 23:56:29,081 INFO L74 IsIncluded]: Start isIncluded. First operand 22 states. Second operand 22 states. [2018-11-18 23:56:29,082 INFO L87 Difference]: Start difference. First operand 22 states. Second operand 22 states. [2018-11-18 23:56:29,085 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 23:56:29,085 INFO L93 Difference]: Finished difference Result 22 states and 25 transitions. [2018-11-18 23:56:29,086 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 25 transitions. [2018-11-18 23:56:29,086 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 23:56:29,086 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 23:56:29,087 INFO L74 IsIncluded]: Start isIncluded. First operand 22 states. Second operand 22 states. [2018-11-18 23:56:29,087 INFO L87 Difference]: Start difference. First operand 22 states. Second operand 22 states. [2018-11-18 23:56:29,090 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 23:56:29,091 INFO L93 Difference]: Finished difference Result 22 states and 25 transitions. [2018-11-18 23:56:29,091 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 25 transitions. [2018-11-18 23:56:29,091 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 23:56:29,092 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 23:56:29,092 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-18 23:56:29,092 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-18 23:56:29,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2018-11-18 23:56:29,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 25 transitions. [2018-11-18 23:56:29,096 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 25 transitions. Word has length 17 [2018-11-18 23:56:29,097 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 23:56:29,097 INFO L480 AbstractCegarLoop]: Abstraction has 22 states and 25 transitions. [2018-11-18 23:56:29,097 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-11-18 23:56:29,097 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 25 transitions. [2018-11-18 23:56:29,098 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-11-18 23:56:29,098 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 23:56:29,098 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-18 23:56:29,099 INFO L423 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 23:56:29,099 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 23:56:29,099 INFO L82 PathProgramCache]: Analyzing trace with hash 1077985819, now seen corresponding path program 1 times [2018-11-18 23:56:29,099 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 23:56:29,100 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 23:56:29,101 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 23:56:29,101 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 23:56:29,101 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 23:56:29,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 23:56:29,388 INFO L256 TraceCheckUtils]: 0: Hoare triple {167#true} call ULTIMATE.init(); {167#true} is VALID [2018-11-18 23:56:29,389 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-18 23:56:29,389 INFO L273 TraceCheckUtils]: 2: Hoare triple {167#true} assume true; {167#true} is VALID [2018-11-18 23:56:29,389 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {167#true} {167#true} #55#return; {167#true} is VALID [2018-11-18 23:56:29,390 INFO L256 TraceCheckUtils]: 4: Hoare triple {167#true} call #t~ret5 := main(); {167#true} is VALID [2018-11-18 23:56:29,390 INFO L273 TraceCheckUtils]: 5: Hoare triple {167#true} ~SIZE~0 := 1 + (if #t~nondet3 % 4294967296 < 0 && 0 != #t~nondet3 % 4294967296 % 2 then 1 + #t~nondet3 % 4294967296 / 2 else #t~nondet3 % 4294967296 / 2);havoc #t~nondet3;call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(4 * (if ~SIZE~0 % 4294967296 % 4294967296 <= 2147483647 then ~SIZE~0 % 4294967296 % 4294967296 else ~SIZE~0 % 4294967296 % 4294967296 - 4294967296));call write~int(3, ~#a~0.base, ~#a~0.offset + 4 * (if (if ~SIZE~0 % 4294967296 < 0 && 0 != ~SIZE~0 % 4294967296 % 2 then 1 + ~SIZE~0 % 4294967296 / 2 else ~SIZE~0 % 4294967296 / 2) % 4294967296 % 4294967296 <= 2147483647 then (if ~SIZE~0 % 4294967296 < 0 && 0 != ~SIZE~0 % 4294967296 % 2 then 1 + ~SIZE~0 % 4294967296 / 2 else ~SIZE~0 % 4294967296 / 2) % 4294967296 % 4294967296 else (if ~SIZE~0 % 4294967296 < 0 && 0 != ~SIZE~0 % 4294967296 % 2 then 1 + ~SIZE~0 % 4294967296 / 2 else ~SIZE~0 % 4294967296 / 2) % 4294967296 % 4294967296 - 4294967296), 4); {167#true} is VALID [2018-11-18 23:56:29,391 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-18 23:56:29,391 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-18 23:56:29,391 INFO L273 TraceCheckUtils]: 8: Hoare triple {167#true} assume true; {167#true} is VALID [2018-11-18 23:56:29,392 INFO L273 TraceCheckUtils]: 9: Hoare triple {167#true} #t~short1 := ~j~0 % 4294967296 < ~n % 4294967296; {167#true} is VALID [2018-11-18 23:56:29,392 INFO L273 TraceCheckUtils]: 10: Hoare triple {167#true} assume #t~short1;call #t~mem0 := read~int(~a.base, ~a.offset + 4 * (if ~j~0 % 4294967296 % 4294967296 <= 2147483647 then ~j~0 % 4294967296 % 4294967296 else ~j~0 % 4294967296 % 4294967296 - 4294967296), 4);#t~short1 := #t~mem0 != ~q; {167#true} is VALID [2018-11-18 23:56:29,392 INFO L273 TraceCheckUtils]: 11: Hoare triple {167#true} assume !#t~short1;havoc #t~mem0;havoc #t~short1; {167#true} is VALID [2018-11-18 23:56:29,408 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-18 23:56:29,421 INFO L273 TraceCheckUtils]: 13: Hoare triple {169#(= 1 |linear_search_#res|)} assume true; {169#(= 1 |linear_search_#res|)} is VALID [2018-11-18 23:56:29,427 INFO L268 TraceCheckUtils]: 14: Hoare quadruple {169#(= 1 |linear_search_#res|)} {167#true} #59#return; {170#(= 1 |main_#t~ret4|)} is VALID [2018-11-18 23:56:29,428 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-18 23:56:29,429 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-18 23:56:29,430 INFO L273 TraceCheckUtils]: 17: Hoare triple {171#(= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {172#(= 1 __VERIFIER_assert_~cond)} is VALID [2018-11-18 23:56:29,431 INFO L273 TraceCheckUtils]: 18: Hoare triple {172#(= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {168#false} is VALID [2018-11-18 23:56:29,431 INFO L273 TraceCheckUtils]: 19: Hoare triple {168#false} assume !false; {168#false} is VALID [2018-11-18 23:56:29,435 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-18 23:56:29,436 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 23:56:29,436 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-18 23:56:29,438 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 20 [2018-11-18 23:56:29,438 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-18 23:56:29,439 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2018-11-18 23:56:29,519 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-18 23:56:29,519 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-18 23:56:29,520 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-18 23:56:29,520 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-11-18 23:56:29,520 INFO L87 Difference]: Start difference. First operand 22 states and 25 transitions. Second operand 6 states. [2018-11-18 23:56:30,264 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 23:56:30,267 INFO L93 Difference]: Finished difference Result 30 states and 32 transitions. [2018-11-18 23:56:30,267 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-18 23:56:30,267 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 20 [2018-11-18 23:56:30,268 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 23:56:30,268 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-18 23:56:30,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 32 transitions. [2018-11-18 23:56:30,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-18 23:56:30,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 32 transitions. [2018-11-18 23:56:30,276 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 32 transitions. [2018-11-18 23:56:30,325 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-18 23:56:30,328 INFO L225 Difference]: With dead ends: 30 [2018-11-18 23:56:30,328 INFO L226 Difference]: Without dead ends: 22 [2018-11-18 23:56:30,329 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-18 23:56:30,330 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2018-11-18 23:56:30,343 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2018-11-18 23:56:30,344 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-18 23:56:30,344 INFO L82 GeneralOperation]: Start isEquivalent. First operand 22 states. Second operand 22 states. [2018-11-18 23:56:30,344 INFO L74 IsIncluded]: Start isIncluded. First operand 22 states. Second operand 22 states. [2018-11-18 23:56:30,344 INFO L87 Difference]: Start difference. First operand 22 states. Second operand 22 states. [2018-11-18 23:56:30,347 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 23:56:30,347 INFO L93 Difference]: Finished difference Result 22 states and 24 transitions. [2018-11-18 23:56:30,348 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 24 transitions. [2018-11-18 23:56:30,348 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 23:56:30,348 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 23:56:30,348 INFO L74 IsIncluded]: Start isIncluded. First operand 22 states. Second operand 22 states. [2018-11-18 23:56:30,349 INFO L87 Difference]: Start difference. First operand 22 states. Second operand 22 states. [2018-11-18 23:56:30,351 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 23:56:30,351 INFO L93 Difference]: Finished difference Result 22 states and 24 transitions. [2018-11-18 23:56:30,351 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 24 transitions. [2018-11-18 23:56:30,352 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 23:56:30,352 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 23:56:30,352 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-18 23:56:30,352 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-18 23:56:30,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2018-11-18 23:56:30,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 24 transitions. [2018-11-18 23:56:30,356 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 24 transitions. Word has length 20 [2018-11-18 23:56:30,356 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 23:56:30,356 INFO L480 AbstractCegarLoop]: Abstraction has 22 states and 24 transitions. [2018-11-18 23:56:30,356 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-18 23:56:30,357 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 24 transitions. [2018-11-18 23:56:30,357 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-11-18 23:56:30,357 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 23:56:30,358 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-18 23:56:30,358 INFO L423 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 23:56:30,358 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 23:56:30,359 INFO L82 PathProgramCache]: Analyzing trace with hash -1474171142, now seen corresponding path program 1 times [2018-11-18 23:56:30,359 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 23:56:30,359 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 23:56:30,360 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 23:56:30,361 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 23:56:30,361 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 23:56:30,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 23:56:30,932 WARN L180 SmtUtils]: Spent 202.00 ms on a formula simplification. DAG size of input: 10 DAG size of output: 8 [2018-11-18 23:56:31,134 INFO L256 TraceCheckUtils]: 0: Hoare triple {293#true} call ULTIMATE.init(); {293#true} is VALID [2018-11-18 23:56:31,135 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-18 23:56:31,135 INFO L273 TraceCheckUtils]: 2: Hoare triple {293#true} assume true; {293#true} is VALID [2018-11-18 23:56:31,135 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {293#true} {293#true} #55#return; {293#true} is VALID [2018-11-18 23:56:31,135 INFO L256 TraceCheckUtils]: 4: Hoare triple {293#true} call #t~ret5 := main(); {293#true} is VALID [2018-11-18 23:56:31,137 INFO L273 TraceCheckUtils]: 5: Hoare triple {293#true} ~SIZE~0 := 1 + (if #t~nondet3 % 4294967296 < 0 && 0 != #t~nondet3 % 4294967296 % 2 then 1 + #t~nondet3 % 4294967296 / 2 else #t~nondet3 % 4294967296 / 2);havoc #t~nondet3;call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(4 * (if ~SIZE~0 % 4294967296 % 4294967296 <= 2147483647 then ~SIZE~0 % 4294967296 % 4294967296 else ~SIZE~0 % 4294967296 % 4294967296 - 4294967296));call write~int(3, ~#a~0.base, ~#a~0.offset + 4 * (if (if ~SIZE~0 % 4294967296 < 0 && 0 != ~SIZE~0 % 4294967296 % 2 then 1 + ~SIZE~0 % 4294967296 / 2 else ~SIZE~0 % 4294967296 / 2) % 4294967296 % 4294967296 <= 2147483647 then (if ~SIZE~0 % 4294967296 < 0 && 0 != ~SIZE~0 % 4294967296 % 2 then 1 + ~SIZE~0 % 4294967296 / 2 else ~SIZE~0 % 4294967296 / 2) % 4294967296 % 4294967296 else (if ~SIZE~0 % 4294967296 < 0 && 0 != ~SIZE~0 % 4294967296 % 2 then 1 + ~SIZE~0 % 4294967296 / 2 else ~SIZE~0 % 4294967296 / 2) % 4294967296 % 4294967296 - 4294967296), 4); {295#(and (<= (div ~SIZE~0 4294967296) 0) (<= 1 ~SIZE~0))} is VALID [2018-11-18 23:56:31,138 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-18 23:56:31,138 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-18 23:56:31,139 INFO L273 TraceCheckUtils]: 8: Hoare triple {296#(= linear_search_~j~0 0)} assume true; {296#(= linear_search_~j~0 0)} is VALID [2018-11-18 23:56:31,140 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-18 23:56:31,141 INFO L273 TraceCheckUtils]: 10: Hoare triple {296#(= linear_search_~j~0 0)} assume #t~short1;call #t~mem0 := read~int(~a.base, ~a.offset + 4 * (if ~j~0 % 4294967296 % 4294967296 <= 2147483647 then ~j~0 % 4294967296 % 4294967296 else ~j~0 % 4294967296 % 4294967296 - 4294967296), 4);#t~short1 := #t~mem0 != ~q; {296#(= linear_search_~j~0 0)} is VALID [2018-11-18 23:56:31,143 INFO L273 TraceCheckUtils]: 11: Hoare triple {296#(= linear_search_~j~0 0)} assume !#t~short1;havoc #t~mem0;havoc #t~short1; {296#(= linear_search_~j~0 0)} is VALID [2018-11-18 23:56:31,144 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-18 23:56:31,152 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-18 23:56:31,174 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-18 23:56:31,174 INFO L273 TraceCheckUtils]: 15: Hoare triple {294#false} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {294#false} is VALID [2018-11-18 23:56:31,175 INFO L256 TraceCheckUtils]: 16: Hoare triple {294#false} call __VERIFIER_assert(#t~ret4); {294#false} is VALID [2018-11-18 23:56:31,175 INFO L273 TraceCheckUtils]: 17: Hoare triple {294#false} ~cond := #in~cond; {294#false} is VALID [2018-11-18 23:56:31,175 INFO L273 TraceCheckUtils]: 18: Hoare triple {294#false} assume 0 == ~cond; {294#false} is VALID [2018-11-18 23:56:31,175 INFO L273 TraceCheckUtils]: 19: Hoare triple {294#false} assume !false; {294#false} is VALID [2018-11-18 23:56:31,177 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-18 23:56:31,177 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 23:56:31,177 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-18 23:56:31,178 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 20 [2018-11-18 23:56:31,178 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-18 23:56:31,178 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2018-11-18 23:56:31,228 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-18 23:56:31,229 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-18 23:56:31,229 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-18 23:56:31,229 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-18 23:56:31,230 INFO L87 Difference]: Start difference. First operand 22 states and 24 transitions. Second operand 5 states. [2018-11-18 23:56:31,494 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 23:56:31,494 INFO L93 Difference]: Finished difference Result 35 states and 38 transitions. [2018-11-18 23:56:31,495 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-18 23:56:31,495 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 20 [2018-11-18 23:56:31,495 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 23:56:31,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-18 23:56:31,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 38 transitions. [2018-11-18 23:56:31,499 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-18 23:56:31,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 38 transitions. [2018-11-18 23:56:31,501 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 38 transitions. [2018-11-18 23:56:31,579 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-18 23:56:31,582 INFO L225 Difference]: With dead ends: 35 [2018-11-18 23:56:31,582 INFO L226 Difference]: Without dead ends: 26 [2018-11-18 23:56:31,583 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-11-18 23:56:31,583 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2018-11-18 23:56:31,606 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2018-11-18 23:56:31,606 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-18 23:56:31,607 INFO L82 GeneralOperation]: Start isEquivalent. First operand 26 states. Second operand 26 states. [2018-11-18 23:56:31,607 INFO L74 IsIncluded]: Start isIncluded. First operand 26 states. Second operand 26 states. [2018-11-18 23:56:31,607 INFO L87 Difference]: Start difference. First operand 26 states. Second operand 26 states. [2018-11-18 23:56:31,610 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 23:56:31,610 INFO L93 Difference]: Finished difference Result 26 states and 29 transitions. [2018-11-18 23:56:31,610 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 29 transitions. [2018-11-18 23:56:31,611 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 23:56:31,611 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 23:56:31,611 INFO L74 IsIncluded]: Start isIncluded. First operand 26 states. Second operand 26 states. [2018-11-18 23:56:31,612 INFO L87 Difference]: Start difference. First operand 26 states. Second operand 26 states. [2018-11-18 23:56:31,614 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 23:56:31,614 INFO L93 Difference]: Finished difference Result 26 states and 29 transitions. [2018-11-18 23:56:31,614 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 29 transitions. [2018-11-18 23:56:31,615 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 23:56:31,615 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 23:56:31,615 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-18 23:56:31,615 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-18 23:56:31,615 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2018-11-18 23:56:31,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 29 transitions. [2018-11-18 23:56:31,617 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 29 transitions. Word has length 20 [2018-11-18 23:56:31,618 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 23:56:31,618 INFO L480 AbstractCegarLoop]: Abstraction has 26 states and 29 transitions. [2018-11-18 23:56:31,618 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-18 23:56:31,618 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 29 transitions. [2018-11-18 23:56:31,619 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-11-18 23:56:31,619 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 23:56:31,619 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-18 23:56:31,620 INFO L423 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 23:56:31,620 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 23:56:31,620 INFO L82 PathProgramCache]: Analyzing trace with hash -461535108, now seen corresponding path program 1 times [2018-11-18 23:56:31,620 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 23:56:31,621 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 23:56:31,621 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 23:56:31,622 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 23:56:31,622 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 23:56:31,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 23:56:32,184 WARN L180 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 13 DAG size of output: 9 [2018-11-18 23:56:32,188 INFO L256 TraceCheckUtils]: 0: Hoare triple {437#true} call ULTIMATE.init(); {437#true} is VALID [2018-11-18 23:56:32,189 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-18 23:56:32,189 INFO L273 TraceCheckUtils]: 2: Hoare triple {437#true} assume true; {437#true} is VALID [2018-11-18 23:56:32,190 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {437#true} {437#true} #55#return; {437#true} is VALID [2018-11-18 23:56:32,190 INFO L256 TraceCheckUtils]: 4: Hoare triple {437#true} call #t~ret5 := main(); {437#true} is VALID [2018-11-18 23:56:32,190 INFO L273 TraceCheckUtils]: 5: Hoare triple {437#true} ~SIZE~0 := 1 + (if #t~nondet3 % 4294967296 < 0 && 0 != #t~nondet3 % 4294967296 % 2 then 1 + #t~nondet3 % 4294967296 / 2 else #t~nondet3 % 4294967296 / 2);havoc #t~nondet3;call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(4 * (if ~SIZE~0 % 4294967296 % 4294967296 <= 2147483647 then ~SIZE~0 % 4294967296 % 4294967296 else ~SIZE~0 % 4294967296 % 4294967296 - 4294967296));call write~int(3, ~#a~0.base, ~#a~0.offset + 4 * (if (if ~SIZE~0 % 4294967296 < 0 && 0 != ~SIZE~0 % 4294967296 % 2 then 1 + ~SIZE~0 % 4294967296 / 2 else ~SIZE~0 % 4294967296 / 2) % 4294967296 % 4294967296 <= 2147483647 then (if ~SIZE~0 % 4294967296 < 0 && 0 != ~SIZE~0 % 4294967296 % 2 then 1 + ~SIZE~0 % 4294967296 / 2 else ~SIZE~0 % 4294967296 / 2) % 4294967296 % 4294967296 else (if ~SIZE~0 % 4294967296 < 0 && 0 != ~SIZE~0 % 4294967296 % 2 then 1 + ~SIZE~0 % 4294967296 / 2 else ~SIZE~0 % 4294967296 / 2) % 4294967296 % 4294967296 - 4294967296), 4); {437#true} is VALID [2018-11-18 23:56:32,191 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-18 23:56:32,200 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-18 23:56:32,201 INFO L273 TraceCheckUtils]: 8: Hoare triple {439#(= linear_search_~j~0 0)} assume true; {439#(= linear_search_~j~0 0)} is VALID [2018-11-18 23:56:32,202 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-18 23:56:32,203 INFO L273 TraceCheckUtils]: 10: Hoare triple {439#(= linear_search_~j~0 0)} assume #t~short1;call #t~mem0 := read~int(~a.base, ~a.offset + 4 * (if ~j~0 % 4294967296 % 4294967296 <= 2147483647 then ~j~0 % 4294967296 % 4294967296 else ~j~0 % 4294967296 % 4294967296 - 4294967296), 4);#t~short1 := #t~mem0 != ~q; {439#(= linear_search_~j~0 0)} is VALID [2018-11-18 23:56:32,204 INFO L273 TraceCheckUtils]: 11: Hoare triple {439#(= linear_search_~j~0 0)} assume !!#t~short1;havoc #t~mem0;havoc #t~short1;#t~post2 := ~j~0;~j~0 := 1 + #t~post2;havoc #t~post2; {440#(and (<= linear_search_~j~0 1) (< 0 (+ (div linear_search_~j~0 4294967296) 1)))} is VALID [2018-11-18 23:56:32,205 INFO L273 TraceCheckUtils]: 12: Hoare triple {440#(and (<= linear_search_~j~0 1) (< 0 (+ (div linear_search_~j~0 4294967296) 1)))} assume 20 == ~j~0 % 4294967296;~j~0 := -1; {438#false} is VALID [2018-11-18 23:56:32,205 INFO L273 TraceCheckUtils]: 13: Hoare triple {438#false} assume true; {438#false} is VALID [2018-11-18 23:56:32,206 INFO L273 TraceCheckUtils]: 14: Hoare triple {438#false} #t~short1 := ~j~0 % 4294967296 < ~n % 4294967296; {438#false} is VALID [2018-11-18 23:56:32,206 INFO L273 TraceCheckUtils]: 15: Hoare triple {438#false} assume #t~short1;call #t~mem0 := read~int(~a.base, ~a.offset + 4 * (if ~j~0 % 4294967296 % 4294967296 <= 2147483647 then ~j~0 % 4294967296 % 4294967296 else ~j~0 % 4294967296 % 4294967296 - 4294967296), 4);#t~short1 := #t~mem0 != ~q; {438#false} is VALID [2018-11-18 23:56:32,207 INFO L273 TraceCheckUtils]: 16: Hoare triple {438#false} assume !#t~short1;havoc #t~mem0;havoc #t~short1; {438#false} is VALID [2018-11-18 23:56:32,207 INFO L273 TraceCheckUtils]: 17: Hoare triple {438#false} assume !(~j~0 % 4294967296 < ~SIZE~0 % 4294967296);#res := 0; {438#false} is VALID [2018-11-18 23:56:32,207 INFO L273 TraceCheckUtils]: 18: Hoare triple {438#false} assume true; {438#false} is VALID [2018-11-18 23:56:32,208 INFO L268 TraceCheckUtils]: 19: Hoare quadruple {438#false} {437#true} #59#return; {438#false} is VALID [2018-11-18 23:56:32,208 INFO L273 TraceCheckUtils]: 20: Hoare triple {438#false} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {438#false} is VALID [2018-11-18 23:56:32,208 INFO L256 TraceCheckUtils]: 21: Hoare triple {438#false} call __VERIFIER_assert(#t~ret4); {438#false} is VALID [2018-11-18 23:56:32,209 INFO L273 TraceCheckUtils]: 22: Hoare triple {438#false} ~cond := #in~cond; {438#false} is VALID [2018-11-18 23:56:32,209 INFO L273 TraceCheckUtils]: 23: Hoare triple {438#false} assume 0 == ~cond; {438#false} is VALID [2018-11-18 23:56:32,210 INFO L273 TraceCheckUtils]: 24: Hoare triple {438#false} assume !false; {438#false} is VALID [2018-11-18 23:56:32,211 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 23:56:32,212 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 23:56:32,212 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-18 23:56:32,212 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 25 [2018-11-18 23:56:32,213 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-18 23:56:32,213 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2018-11-18 23:56:32,253 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 25 edges. 25 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 23:56:32,253 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-18 23:56:32,253 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-18 23:56:32,253 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-18 23:56:32,254 INFO L87 Difference]: Start difference. First operand 26 states and 29 transitions. Second operand 4 states. [2018-11-18 23:56:32,484 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 23:56:32,485 INFO L93 Difference]: Finished difference Result 48 states and 56 transitions. [2018-11-18 23:56:32,485 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-18 23:56:32,485 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 25 [2018-11-18 23:56:32,485 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 23:56:32,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-18 23:56:32,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 56 transitions. [2018-11-18 23:56:32,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-18 23:56:32,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 56 transitions. [2018-11-18 23:56:32,492 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 56 transitions. [2018-11-18 23:56:32,639 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 56 edges. 56 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 23:56:32,642 INFO L225 Difference]: With dead ends: 48 [2018-11-18 23:56:32,642 INFO L226 Difference]: Without dead ends: 34 [2018-11-18 23:56:32,643 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-18 23:56:32,643 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2018-11-18 23:56:32,671 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 27. [2018-11-18 23:56:32,671 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-18 23:56:32,671 INFO L82 GeneralOperation]: Start isEquivalent. First operand 34 states. Second operand 27 states. [2018-11-18 23:56:32,672 INFO L74 IsIncluded]: Start isIncluded. First operand 34 states. Second operand 27 states. [2018-11-18 23:56:32,672 INFO L87 Difference]: Start difference. First operand 34 states. Second operand 27 states. [2018-11-18 23:56:32,675 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 23:56:32,675 INFO L93 Difference]: Finished difference Result 34 states and 39 transitions. [2018-11-18 23:56:32,675 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 39 transitions. [2018-11-18 23:56:32,676 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 23:56:32,676 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 23:56:32,676 INFO L74 IsIncluded]: Start isIncluded. First operand 27 states. Second operand 34 states. [2018-11-18 23:56:32,676 INFO L87 Difference]: Start difference. First operand 27 states. Second operand 34 states. [2018-11-18 23:56:32,680 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 23:56:32,681 INFO L93 Difference]: Finished difference Result 34 states and 39 transitions. [2018-11-18 23:56:32,681 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 39 transitions. [2018-11-18 23:56:32,682 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 23:56:32,682 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 23:56:32,683 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-18 23:56:32,683 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-18 23:56:32,683 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2018-11-18 23:56:32,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 30 transitions. [2018-11-18 23:56:32,684 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 30 transitions. Word has length 25 [2018-11-18 23:56:32,685 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 23:56:32,685 INFO L480 AbstractCegarLoop]: Abstraction has 27 states and 30 transitions. [2018-11-18 23:56:32,685 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-18 23:56:32,685 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 30 transitions. [2018-11-18 23:56:32,686 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-11-18 23:56:32,686 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 23:56:32,686 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-18 23:56:32,687 INFO L423 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 23:56:32,687 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 23:56:32,687 INFO L82 PathProgramCache]: Analyzing trace with hash -1048341122, now seen corresponding path program 1 times [2018-11-18 23:56:32,687 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 23:56:32,687 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 23:56:32,688 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 23:56:32,689 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 23:56:32,689 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 23:56:32,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 23:56:33,643 WARN L180 SmtUtils]: Spent 426.00 ms on a formula simplification. DAG size of input: 35 DAG size of output: 13 [2018-11-18 23:56:33,987 WARN L180 SmtUtils]: Spent 113.00 ms on a formula simplification that was a NOOP. DAG size: 16 [2018-11-18 23:56:34,710 INFO L256 TraceCheckUtils]: 0: Hoare triple {610#true} call ULTIMATE.init(); {610#true} is VALID [2018-11-18 23:56:34,710 INFO L273 TraceCheckUtils]: 1: Hoare triple {610#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~SIZE~0 := 0; {610#true} is VALID [2018-11-18 23:56:34,710 INFO L273 TraceCheckUtils]: 2: Hoare triple {610#true} assume true; {610#true} is VALID [2018-11-18 23:56:34,711 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {610#true} {610#true} #55#return; {610#true} is VALID [2018-11-18 23:56:34,711 INFO L256 TraceCheckUtils]: 4: Hoare triple {610#true} call #t~ret5 := main(); {610#true} is VALID [2018-11-18 23:56:34,713 INFO L273 TraceCheckUtils]: 5: Hoare triple {610#true} ~SIZE~0 := 1 + (if #t~nondet3 % 4294967296 < 0 && 0 != #t~nondet3 % 4294967296 % 2 then 1 + #t~nondet3 % 4294967296 / 2 else #t~nondet3 % 4294967296 / 2);havoc #t~nondet3;call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(4 * (if ~SIZE~0 % 4294967296 % 4294967296 <= 2147483647 then ~SIZE~0 % 4294967296 % 4294967296 else ~SIZE~0 % 4294967296 % 4294967296 - 4294967296));call write~int(3, ~#a~0.base, ~#a~0.offset + 4 * (if (if ~SIZE~0 % 4294967296 < 0 && 0 != ~SIZE~0 % 4294967296 % 2 then 1 + ~SIZE~0 % 4294967296 / 2 else ~SIZE~0 % 4294967296 / 2) % 4294967296 % 4294967296 <= 2147483647 then (if ~SIZE~0 % 4294967296 < 0 && 0 != ~SIZE~0 % 4294967296 % 2 then 1 + ~SIZE~0 % 4294967296 / 2 else ~SIZE~0 % 4294967296 / 2) % 4294967296 % 4294967296 else (if ~SIZE~0 % 4294967296 < 0 && 0 != ~SIZE~0 % 4294967296 % 2 then 1 + ~SIZE~0 % 4294967296 / 2 else ~SIZE~0 % 4294967296 / 2) % 4294967296 % 4294967296 - 4294967296), 4); {612#(and (<= (div ~SIZE~0 4294967296) 0) (or (<= (+ (* 4294967296 (div ~SIZE~0 4294967296)) 2147483648) ~SIZE~0) (<= 1 ~SIZE~0)))} is VALID [2018-11-18 23:56:34,713 INFO L256 TraceCheckUtils]: 6: Hoare triple {612#(and (<= (div ~SIZE~0 4294967296) 0) (or (<= (+ (* 4294967296 (div ~SIZE~0 4294967296)) 2147483648) ~SIZE~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); {610#true} is VALID [2018-11-18 23:56:34,722 INFO L273 TraceCheckUtils]: 7: Hoare triple {610#true} ~a.base, ~a.offset := #in~a.base, #in~a.offset;~n := #in~n;~q := #in~q;~j~0 := 0; {613#(and (or (<= (+ (div linear_search_~n 4294967296) 1) 0) (<= linear_search_~n |linear_search_#in~n|)) (or (< 0 (+ (div linear_search_~n 4294967296) 1)) (<= |linear_search_#in~n| linear_search_~n)) (= linear_search_~j~0 0))} is VALID [2018-11-18 23:56:34,723 INFO L273 TraceCheckUtils]: 8: Hoare triple {613#(and (or (<= (+ (div linear_search_~n 4294967296) 1) 0) (<= linear_search_~n |linear_search_#in~n|)) (or (< 0 (+ (div linear_search_~n 4294967296) 1)) (<= |linear_search_#in~n| linear_search_~n)) (= linear_search_~j~0 0))} assume true; {613#(and (or (<= (+ (div linear_search_~n 4294967296) 1) 0) (<= linear_search_~n |linear_search_#in~n|)) (or (< 0 (+ (div linear_search_~n 4294967296) 1)) (<= |linear_search_#in~n| linear_search_~n)) (= linear_search_~j~0 0))} is VALID [2018-11-18 23:56:34,724 INFO L273 TraceCheckUtils]: 9: Hoare triple {613#(and (or (<= (+ (div linear_search_~n 4294967296) 1) 0) (<= linear_search_~n |linear_search_#in~n|)) (or (< 0 (+ (div linear_search_~n 4294967296) 1)) (<= |linear_search_#in~n| linear_search_~n)) (= linear_search_~j~0 0))} #t~short1 := ~j~0 % 4294967296 < ~n % 4294967296; {614#(and (or (<= (+ (div linear_search_~n 4294967296) 1) 0) (<= linear_search_~n |linear_search_#in~n|)) (or (< 0 (+ (div linear_search_~n 4294967296) 1)) (<= |linear_search_#in~n| (+ (* 4294967296 (div linear_search_~n 4294967296)) 4294967295))) (= linear_search_~j~0 0))} is VALID [2018-11-18 23:56:34,725 INFO L273 TraceCheckUtils]: 10: Hoare triple {614#(and (or (<= (+ (div linear_search_~n 4294967296) 1) 0) (<= linear_search_~n |linear_search_#in~n|)) (or (< 0 (+ (div linear_search_~n 4294967296) 1)) (<= |linear_search_#in~n| (+ (* 4294967296 (div linear_search_~n 4294967296)) 4294967295))) (= linear_search_~j~0 0))} assume #t~short1;call #t~mem0 := read~int(~a.base, ~a.offset + 4 * (if ~j~0 % 4294967296 % 4294967296 <= 2147483647 then ~j~0 % 4294967296 % 4294967296 else ~j~0 % 4294967296 % 4294967296 - 4294967296), 4);#t~short1 := #t~mem0 != ~q; {614#(and (or (<= (+ (div linear_search_~n 4294967296) 1) 0) (<= linear_search_~n |linear_search_#in~n|)) (or (< 0 (+ (div linear_search_~n 4294967296) 1)) (<= |linear_search_#in~n| (+ (* 4294967296 (div linear_search_~n 4294967296)) 4294967295))) (= linear_search_~j~0 0))} is VALID [2018-11-18 23:56:34,726 INFO L273 TraceCheckUtils]: 11: Hoare triple {614#(and (or (<= (+ (div linear_search_~n 4294967296) 1) 0) (<= linear_search_~n |linear_search_#in~n|)) (or (< 0 (+ (div linear_search_~n 4294967296) 1)) (<= |linear_search_#in~n| (+ (* 4294967296 (div linear_search_~n 4294967296)) 4294967295))) (= linear_search_~j~0 0))} assume !!#t~short1;havoc #t~mem0;havoc #t~short1;#t~post2 := ~j~0;~j~0 := 1 + #t~post2;havoc #t~post2; {615#(and (or (< 0 (+ (div linear_search_~n 4294967296) 1)) (<= (+ linear_search_~j~0 |linear_search_#in~n|) (+ (* 4294967296 (div linear_search_~n 4294967296)) 4294967296))) (or (<= (+ (div linear_search_~n 4294967296) 1) 0) (<= (+ linear_search_~j~0 linear_search_~n) (+ |linear_search_#in~n| 1))) (<= linear_search_~j~0 1) (< 0 (+ (div linear_search_~j~0 4294967296) 1)))} is VALID [2018-11-18 23:56:34,728 INFO L273 TraceCheckUtils]: 12: Hoare triple {615#(and (or (< 0 (+ (div linear_search_~n 4294967296) 1)) (<= (+ linear_search_~j~0 |linear_search_#in~n|) (+ (* 4294967296 (div linear_search_~n 4294967296)) 4294967296))) (or (<= (+ (div linear_search_~n 4294967296) 1) 0) (<= (+ linear_search_~j~0 linear_search_~n) (+ |linear_search_#in~n| 1))) (<= linear_search_~j~0 1) (< 0 (+ (div linear_search_~j~0 4294967296) 1)))} assume !(20 == ~j~0 % 4294967296); {615#(and (or (< 0 (+ (div linear_search_~n 4294967296) 1)) (<= (+ linear_search_~j~0 |linear_search_#in~n|) (+ (* 4294967296 (div linear_search_~n 4294967296)) 4294967296))) (or (<= (+ (div linear_search_~n 4294967296) 1) 0) (<= (+ linear_search_~j~0 linear_search_~n) (+ |linear_search_#in~n| 1))) (<= linear_search_~j~0 1) (< 0 (+ (div linear_search_~j~0 4294967296) 1)))} is VALID [2018-11-18 23:56:34,729 INFO L273 TraceCheckUtils]: 13: Hoare triple {615#(and (or (< 0 (+ (div linear_search_~n 4294967296) 1)) (<= (+ linear_search_~j~0 |linear_search_#in~n|) (+ (* 4294967296 (div linear_search_~n 4294967296)) 4294967296))) (or (<= (+ (div linear_search_~n 4294967296) 1) 0) (<= (+ linear_search_~j~0 linear_search_~n) (+ |linear_search_#in~n| 1))) (<= linear_search_~j~0 1) (< 0 (+ (div linear_search_~j~0 4294967296) 1)))} assume true; {615#(and (or (< 0 (+ (div linear_search_~n 4294967296) 1)) (<= (+ linear_search_~j~0 |linear_search_#in~n|) (+ (* 4294967296 (div linear_search_~n 4294967296)) 4294967296))) (or (<= (+ (div linear_search_~n 4294967296) 1) 0) (<= (+ linear_search_~j~0 linear_search_~n) (+ |linear_search_#in~n| 1))) (<= linear_search_~j~0 1) (< 0 (+ (div linear_search_~j~0 4294967296) 1)))} is VALID [2018-11-18 23:56:34,731 INFO L273 TraceCheckUtils]: 14: Hoare triple {615#(and (or (< 0 (+ (div linear_search_~n 4294967296) 1)) (<= (+ linear_search_~j~0 |linear_search_#in~n|) (+ (* 4294967296 (div linear_search_~n 4294967296)) 4294967296))) (or (<= (+ (div linear_search_~n 4294967296) 1) 0) (<= (+ linear_search_~j~0 linear_search_~n) (+ |linear_search_#in~n| 1))) (<= linear_search_~j~0 1) (< 0 (+ (div linear_search_~j~0 4294967296) 1)))} #t~short1 := ~j~0 % 4294967296 < ~n % 4294967296; {616#(and (or (<= (+ linear_search_~j~0 |linear_search_#in~n|) 0) (not |linear_search_#t~short1|) (<= (* 2 linear_search_~j~0) (+ (* 4294967296 (div linear_search_~j~0 4294967296)) |linear_search_#in~n|))) (<= linear_search_~j~0 1) (< 0 (+ (div linear_search_~j~0 4294967296) 1)))} is VALID [2018-11-18 23:56:34,733 INFO L273 TraceCheckUtils]: 15: Hoare triple {616#(and (or (<= (+ linear_search_~j~0 |linear_search_#in~n|) 0) (not |linear_search_#t~short1|) (<= (* 2 linear_search_~j~0) (+ (* 4294967296 (div linear_search_~j~0 4294967296)) |linear_search_#in~n|))) (<= linear_search_~j~0 1) (< 0 (+ (div linear_search_~j~0 4294967296) 1)))} assume #t~short1;call #t~mem0 := read~int(~a.base, ~a.offset + 4 * (if ~j~0 % 4294967296 % 4294967296 <= 2147483647 then ~j~0 % 4294967296 % 4294967296 else ~j~0 % 4294967296 % 4294967296 - 4294967296), 4);#t~short1 := #t~mem0 != ~q; {617#(and (or (<= (+ linear_search_~j~0 |linear_search_#in~n|) 0) (<= (* 2 linear_search_~j~0) (+ (* 4294967296 (div linear_search_~j~0 4294967296)) |linear_search_#in~n|))) (<= linear_search_~j~0 1) (< 0 (+ (div linear_search_~j~0 4294967296) 1)))} is VALID [2018-11-18 23:56:34,735 INFO L273 TraceCheckUtils]: 16: Hoare triple {617#(and (or (<= (+ linear_search_~j~0 |linear_search_#in~n|) 0) (<= (* 2 linear_search_~j~0) (+ (* 4294967296 (div linear_search_~j~0 4294967296)) |linear_search_#in~n|))) (<= linear_search_~j~0 1) (< 0 (+ (div linear_search_~j~0 4294967296) 1)))} assume !#t~short1;havoc #t~mem0;havoc #t~short1; {617#(and (or (<= (+ linear_search_~j~0 |linear_search_#in~n|) 0) (<= (* 2 linear_search_~j~0) (+ (* 4294967296 (div linear_search_~j~0 4294967296)) |linear_search_#in~n|))) (<= linear_search_~j~0 1) (< 0 (+ (div linear_search_~j~0 4294967296) 1)))} is VALID [2018-11-18 23:56:34,737 INFO L273 TraceCheckUtils]: 17: Hoare triple {617#(and (or (<= (+ linear_search_~j~0 |linear_search_#in~n|) 0) (<= (* 2 linear_search_~j~0) (+ (* 4294967296 (div linear_search_~j~0 4294967296)) |linear_search_#in~n|))) (<= linear_search_~j~0 1) (< 0 (+ (div linear_search_~j~0 4294967296) 1)))} assume !(~j~0 % 4294967296 < ~SIZE~0 % 4294967296);#res := 0; {618#(or (and (or (<= (* 2 ~SIZE~0) (+ |linear_search_#in~n| (* 8589934592 (div ~SIZE~0 4294967296)))) (<= (+ |linear_search_#in~n| ~SIZE~0) (* 4294967296 (div ~SIZE~0 4294967296)))) (<= ~SIZE~0 (+ (* 4294967296 (div ~SIZE~0 4294967296)) 1))) (< 0 (div ~SIZE~0 4294967296)))} is VALID [2018-11-18 23:56:34,737 INFO L273 TraceCheckUtils]: 18: Hoare triple {618#(or (and (or (<= (* 2 ~SIZE~0) (+ |linear_search_#in~n| (* 8589934592 (div ~SIZE~0 4294967296)))) (<= (+ |linear_search_#in~n| ~SIZE~0) (* 4294967296 (div ~SIZE~0 4294967296)))) (<= ~SIZE~0 (+ (* 4294967296 (div ~SIZE~0 4294967296)) 1))) (< 0 (div ~SIZE~0 4294967296)))} assume true; {618#(or (and (or (<= (* 2 ~SIZE~0) (+ |linear_search_#in~n| (* 8589934592 (div ~SIZE~0 4294967296)))) (<= (+ |linear_search_#in~n| ~SIZE~0) (* 4294967296 (div ~SIZE~0 4294967296)))) (<= ~SIZE~0 (+ (* 4294967296 (div ~SIZE~0 4294967296)) 1))) (< 0 (div ~SIZE~0 4294967296)))} is VALID [2018-11-18 23:56:34,739 INFO L268 TraceCheckUtils]: 19: Hoare quadruple {618#(or (and (or (<= (* 2 ~SIZE~0) (+ |linear_search_#in~n| (* 8589934592 (div ~SIZE~0 4294967296)))) (<= (+ |linear_search_#in~n| ~SIZE~0) (* 4294967296 (div ~SIZE~0 4294967296)))) (<= ~SIZE~0 (+ (* 4294967296 (div ~SIZE~0 4294967296)) 1))) (< 0 (div ~SIZE~0 4294967296)))} {612#(and (<= (div ~SIZE~0 4294967296) 0) (or (<= (+ (* 4294967296 (div ~SIZE~0 4294967296)) 2147483648) ~SIZE~0) (<= 1 ~SIZE~0)))} #59#return; {611#false} is VALID [2018-11-18 23:56:34,740 INFO L273 TraceCheckUtils]: 20: Hoare triple {611#false} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {611#false} is VALID [2018-11-18 23:56:34,740 INFO L256 TraceCheckUtils]: 21: Hoare triple {611#false} call __VERIFIER_assert(#t~ret4); {611#false} is VALID [2018-11-18 23:56:34,741 INFO L273 TraceCheckUtils]: 22: Hoare triple {611#false} ~cond := #in~cond; {611#false} is VALID [2018-11-18 23:56:34,741 INFO L273 TraceCheckUtils]: 23: Hoare triple {611#false} assume 0 == ~cond; {611#false} is VALID [2018-11-18 23:56:34,742 INFO L273 TraceCheckUtils]: 24: Hoare triple {611#false} assume !false; {611#false} is VALID [2018-11-18 23:56:34,747 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 23:56:34,748 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 23:56:34,748 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-18 23:56:34,767 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 23:56:34,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 23:56:34,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 23:56:34,842 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 23:56:35,587 INFO L256 TraceCheckUtils]: 0: Hoare triple {610#true} call ULTIMATE.init(); {610#true} is VALID [2018-11-18 23:56:35,588 INFO L273 TraceCheckUtils]: 1: Hoare triple {610#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~SIZE~0 := 0; {610#true} is VALID [2018-11-18 23:56:35,588 INFO L273 TraceCheckUtils]: 2: Hoare triple {610#true} assume true; {610#true} is VALID [2018-11-18 23:56:35,588 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {610#true} {610#true} #55#return; {610#true} is VALID [2018-11-18 23:56:35,589 INFO L256 TraceCheckUtils]: 4: Hoare triple {610#true} call #t~ret5 := main(); {610#true} is VALID [2018-11-18 23:56:35,589 INFO L273 TraceCheckUtils]: 5: Hoare triple {610#true} ~SIZE~0 := 1 + (if #t~nondet3 % 4294967296 < 0 && 0 != #t~nondet3 % 4294967296 % 2 then 1 + #t~nondet3 % 4294967296 / 2 else #t~nondet3 % 4294967296 / 2);havoc #t~nondet3;call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(4 * (if ~SIZE~0 % 4294967296 % 4294967296 <= 2147483647 then ~SIZE~0 % 4294967296 % 4294967296 else ~SIZE~0 % 4294967296 % 4294967296 - 4294967296));call write~int(3, ~#a~0.base, ~#a~0.offset + 4 * (if (if ~SIZE~0 % 4294967296 < 0 && 0 != ~SIZE~0 % 4294967296 % 2 then 1 + ~SIZE~0 % 4294967296 / 2 else ~SIZE~0 % 4294967296 / 2) % 4294967296 % 4294967296 <= 2147483647 then (if ~SIZE~0 % 4294967296 < 0 && 0 != ~SIZE~0 % 4294967296 % 2 then 1 + ~SIZE~0 % 4294967296 / 2 else ~SIZE~0 % 4294967296 / 2) % 4294967296 % 4294967296 else (if ~SIZE~0 % 4294967296 < 0 && 0 != ~SIZE~0 % 4294967296 % 2 then 1 + ~SIZE~0 % 4294967296 / 2 else ~SIZE~0 % 4294967296 / 2) % 4294967296 % 4294967296 - 4294967296), 4); {610#true} is VALID [2018-11-18 23:56:35,589 INFO L256 TraceCheckUtils]: 6: Hoare triple {610#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); {610#true} is VALID [2018-11-18 23:56:35,601 INFO L273 TraceCheckUtils]: 7: Hoare triple {610#true} ~a.base, ~a.offset := #in~a.base, #in~a.offset;~n := #in~n;~q := #in~q;~j~0 := 0; {643#(= |linear_search_#in~n| linear_search_~n)} is VALID [2018-11-18 23:56:35,602 INFO L273 TraceCheckUtils]: 8: Hoare triple {643#(= |linear_search_#in~n| linear_search_~n)} assume true; {643#(= |linear_search_#in~n| linear_search_~n)} is VALID [2018-11-18 23:56:35,603 INFO L273 TraceCheckUtils]: 9: Hoare triple {643#(= |linear_search_#in~n| linear_search_~n)} #t~short1 := ~j~0 % 4294967296 < ~n % 4294967296; {643#(= |linear_search_#in~n| linear_search_~n)} is VALID [2018-11-18 23:56:35,603 INFO L273 TraceCheckUtils]: 10: Hoare triple {643#(= |linear_search_#in~n| linear_search_~n)} assume #t~short1;call #t~mem0 := read~int(~a.base, ~a.offset + 4 * (if ~j~0 % 4294967296 % 4294967296 <= 2147483647 then ~j~0 % 4294967296 % 4294967296 else ~j~0 % 4294967296 % 4294967296 - 4294967296), 4);#t~short1 := #t~mem0 != ~q; {643#(= |linear_search_#in~n| linear_search_~n)} is VALID [2018-11-18 23:56:35,606 INFO L273 TraceCheckUtils]: 11: Hoare triple {643#(= |linear_search_#in~n| linear_search_~n)} assume !!#t~short1;havoc #t~mem0;havoc #t~short1;#t~post2 := ~j~0;~j~0 := 1 + #t~post2;havoc #t~post2; {643#(= |linear_search_#in~n| linear_search_~n)} is VALID [2018-11-18 23:56:35,606 INFO L273 TraceCheckUtils]: 12: Hoare triple {643#(= |linear_search_#in~n| linear_search_~n)} assume !(20 == ~j~0 % 4294967296); {643#(= |linear_search_#in~n| linear_search_~n)} is VALID [2018-11-18 23:56:35,609 INFO L273 TraceCheckUtils]: 13: Hoare triple {643#(= |linear_search_#in~n| linear_search_~n)} assume true; {643#(= |linear_search_#in~n| linear_search_~n)} is VALID [2018-11-18 23:56:35,618 INFO L273 TraceCheckUtils]: 14: Hoare triple {643#(= |linear_search_#in~n| linear_search_~n)} #t~short1 := ~j~0 % 4294967296 < ~n % 4294967296; {665#(or (and (<= (mod |linear_search_#in~n| 4294967296) (mod linear_search_~j~0 4294967296)) (not |linear_search_#t~short1|)) (and |linear_search_#t~short1| (< (mod linear_search_~j~0 4294967296) (mod |linear_search_#in~n| 4294967296))))} is VALID [2018-11-18 23:56:35,625 INFO L273 TraceCheckUtils]: 15: Hoare triple {665#(or (and (<= (mod |linear_search_#in~n| 4294967296) (mod linear_search_~j~0 4294967296)) (not |linear_search_#t~short1|)) (and |linear_search_#t~short1| (< (mod linear_search_~j~0 4294967296) (mod |linear_search_#in~n| 4294967296))))} assume #t~short1;call #t~mem0 := read~int(~a.base, ~a.offset + 4 * (if ~j~0 % 4294967296 % 4294967296 <= 2147483647 then ~j~0 % 4294967296 % 4294967296 else ~j~0 % 4294967296 % 4294967296 - 4294967296), 4);#t~short1 := #t~mem0 != ~q; {669#(< (mod linear_search_~j~0 4294967296) (mod |linear_search_#in~n| 4294967296))} is VALID [2018-11-18 23:56:35,627 INFO L273 TraceCheckUtils]: 16: Hoare triple {669#(< (mod linear_search_~j~0 4294967296) (mod |linear_search_#in~n| 4294967296))} assume !#t~short1;havoc #t~mem0;havoc #t~short1; {669#(< (mod linear_search_~j~0 4294967296) (mod |linear_search_#in~n| 4294967296))} is VALID [2018-11-18 23:56:35,628 INFO L273 TraceCheckUtils]: 17: Hoare triple {669#(< (mod linear_search_~j~0 4294967296) (mod |linear_search_#in~n| 4294967296))} assume !(~j~0 % 4294967296 < ~SIZE~0 % 4294967296);#res := 0; {676#(exists ((linear_search_~j~0 Int)) (and (<= (mod ~SIZE~0 4294967296) (mod linear_search_~j~0 4294967296)) (< (mod linear_search_~j~0 4294967296) (mod |linear_search_#in~n| 4294967296))))} is VALID [2018-11-18 23:56:35,629 INFO L273 TraceCheckUtils]: 18: Hoare triple {676#(exists ((linear_search_~j~0 Int)) (and (<= (mod ~SIZE~0 4294967296) (mod linear_search_~j~0 4294967296)) (< (mod linear_search_~j~0 4294967296) (mod |linear_search_#in~n| 4294967296))))} assume true; {676#(exists ((linear_search_~j~0 Int)) (and (<= (mod ~SIZE~0 4294967296) (mod linear_search_~j~0 4294967296)) (< (mod linear_search_~j~0 4294967296) (mod |linear_search_#in~n| 4294967296))))} is VALID [2018-11-18 23:56:35,631 INFO L268 TraceCheckUtils]: 19: Hoare quadruple {676#(exists ((linear_search_~j~0 Int)) (and (<= (mod ~SIZE~0 4294967296) (mod linear_search_~j~0 4294967296)) (< (mod linear_search_~j~0 4294967296) (mod |linear_search_#in~n| 4294967296))))} {610#true} #59#return; {611#false} is VALID [2018-11-18 23:56:35,632 INFO L273 TraceCheckUtils]: 20: Hoare triple {611#false} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {611#false} is VALID [2018-11-18 23:56:35,632 INFO L256 TraceCheckUtils]: 21: Hoare triple {611#false} call __VERIFIER_assert(#t~ret4); {611#false} is VALID [2018-11-18 23:56:35,633 INFO L273 TraceCheckUtils]: 22: Hoare triple {611#false} ~cond := #in~cond; {611#false} is VALID [2018-11-18 23:56:35,633 INFO L273 TraceCheckUtils]: 23: Hoare triple {611#false} assume 0 == ~cond; {611#false} is VALID [2018-11-18 23:56:35,634 INFO L273 TraceCheckUtils]: 24: Hoare triple {611#false} assume !false; {611#false} is VALID [2018-11-18 23:56:35,637 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-11-18 23:56:35,658 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-18 23:56:35,658 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 6] total 13 [2018-11-18 23:56:35,658 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 25 [2018-11-18 23:56:35,659 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-18 23:56:35,659 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 13 states. [2018-11-18 23:56:35,741 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 39 edges. 39 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 23:56:35,741 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-11-18 23:56:35,741 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-11-18 23:56:35,742 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2018-11-18 23:56:35,742 INFO L87 Difference]: Start difference. First operand 27 states and 30 transitions. Second operand 13 states. [2018-11-18 23:56:36,847 WARN L180 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 30 [2018-11-18 23:56:37,723 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 23:56:37,724 INFO L93 Difference]: Finished difference Result 49 states and 55 transitions. [2018-11-18 23:56:37,724 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-11-18 23:56:37,724 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 25 [2018-11-18 23:56:37,725 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 23:56:37,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2018-11-18 23:56:37,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 55 transitions. [2018-11-18 23:56:37,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2018-11-18 23:56:37,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 55 transitions. [2018-11-18 23:56:37,732 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 15 states and 55 transitions. [2018-11-18 23:56:37,893 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 55 edges. 55 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 23:56:37,894 INFO L225 Difference]: With dead ends: 49 [2018-11-18 23:56:37,894 INFO L226 Difference]: Without dead ends: 37 [2018-11-18 23:56:37,895 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 22 SyntacticMatches, 1 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 82 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=138, Invalid=414, Unknown=0, NotChecked=0, Total=552 [2018-11-18 23:56:37,896 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2018-11-18 23:56:37,967 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 28. [2018-11-18 23:56:37,967 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-18 23:56:37,967 INFO L82 GeneralOperation]: Start isEquivalent. First operand 37 states. Second operand 28 states. [2018-11-18 23:56:37,967 INFO L74 IsIncluded]: Start isIncluded. First operand 37 states. Second operand 28 states. [2018-11-18 23:56:37,967 INFO L87 Difference]: Start difference. First operand 37 states. Second operand 28 states. [2018-11-18 23:56:37,970 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 23:56:37,970 INFO L93 Difference]: Finished difference Result 37 states and 42 transitions. [2018-11-18 23:56:37,970 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 42 transitions. [2018-11-18 23:56:37,971 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 23:56:37,971 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 23:56:37,971 INFO L74 IsIncluded]: Start isIncluded. First operand 28 states. Second operand 37 states. [2018-11-18 23:56:37,971 INFO L87 Difference]: Start difference. First operand 28 states. Second operand 37 states. [2018-11-18 23:56:37,974 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 23:56:37,974 INFO L93 Difference]: Finished difference Result 37 states and 42 transitions. [2018-11-18 23:56:37,974 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 42 transitions. [2018-11-18 23:56:37,975 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 23:56:37,975 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 23:56:37,975 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-18 23:56:37,975 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-18 23:56:37,975 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2018-11-18 23:56:37,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 31 transitions. [2018-11-18 23:56:37,977 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 31 transitions. Word has length 25 [2018-11-18 23:56:37,977 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 23:56:37,978 INFO L480 AbstractCegarLoop]: Abstraction has 28 states and 31 transitions. [2018-11-18 23:56:37,978 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-11-18 23:56:37,978 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 31 transitions. [2018-11-18 23:56:37,979 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-11-18 23:56:37,979 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 23:56:37,979 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 23:56:37,979 INFO L423 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 23:56:37,980 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 23:56:37,980 INFO L82 PathProgramCache]: Analyzing trace with hash -1441368132, now seen corresponding path program 1 times [2018-11-18 23:56:37,980 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 23:56:37,980 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 23:56:37,981 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 23:56:37,981 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 23:56:37,981 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 23:56:38,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 23:56:40,039 WARN L180 SmtUtils]: Spent 1.18 s on a formula simplification. DAG size of input: 317 DAG size of output: 53 [2018-11-18 23:56:40,501 WARN L180 SmtUtils]: Spent 161.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 33 [2018-11-18 23:56:40,656 WARN L180 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 42 [2018-11-18 23:56:41,209 INFO L256 TraceCheckUtils]: 0: Hoare triple {893#true} call ULTIMATE.init(); {893#true} is VALID [2018-11-18 23:56:41,210 INFO L273 TraceCheckUtils]: 1: Hoare triple {893#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~SIZE~0 := 0; {893#true} is VALID [2018-11-18 23:56:41,210 INFO L273 TraceCheckUtils]: 2: Hoare triple {893#true} assume true; {893#true} is VALID [2018-11-18 23:56:41,211 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {893#true} {893#true} #55#return; {893#true} is VALID [2018-11-18 23:56:41,211 INFO L256 TraceCheckUtils]: 4: Hoare triple {893#true} call #t~ret5 := main(); {893#true} is VALID [2018-11-18 23:56:41,216 INFO L273 TraceCheckUtils]: 5: Hoare triple {893#true} ~SIZE~0 := 1 + (if #t~nondet3 % 4294967296 < 0 && 0 != #t~nondet3 % 4294967296 % 2 then 1 + #t~nondet3 % 4294967296 / 2 else #t~nondet3 % 4294967296 / 2);havoc #t~nondet3;call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(4 * (if ~SIZE~0 % 4294967296 % 4294967296 <= 2147483647 then ~SIZE~0 % 4294967296 % 4294967296 else ~SIZE~0 % 4294967296 % 4294967296 - 4294967296));call write~int(3, ~#a~0.base, ~#a~0.offset + 4 * (if (if ~SIZE~0 % 4294967296 < 0 && 0 != ~SIZE~0 % 4294967296 % 2 then 1 + ~SIZE~0 % 4294967296 / 2 else ~SIZE~0 % 4294967296 / 2) % 4294967296 % 4294967296 <= 2147483647 then (if ~SIZE~0 % 4294967296 < 0 && 0 != ~SIZE~0 % 4294967296 % 2 then 1 + ~SIZE~0 % 4294967296 / 2 else ~SIZE~0 % 4294967296 / 2) % 4294967296 % 4294967296 else (if ~SIZE~0 % 4294967296 < 0 && 0 != ~SIZE~0 % 4294967296 % 2 then 1 + ~SIZE~0 % 4294967296 / 2 else ~SIZE~0 % 4294967296 / 2) % 4294967296 % 4294967296 - 4294967296), 4); {895#(and (<= (div ~SIZE~0 4294967296) 0) (< (+ (div ~SIZE~0 2) (* 2147483648 (div ~SIZE~0 4294967296))) ~SIZE~0) (or (<= ~SIZE~0 (* 2 (div ~SIZE~0 2))) (and (<= 1 ~SIZE~0) (<= (+ (* 2 ~SIZE~0) |main_~#a~0.offset|) (+ (* 4 (div ~SIZE~0 2)) 2)) (< (* 17179869184 (div (div (+ ~SIZE~0 (* (- 4294967296) (div ~SIZE~0 4294967296))) 2) 4294967296)) (+ (* 4 (div (+ ~SIZE~0 (* (- 4294967296) (div ~SIZE~0 4294967296))) 2)) |main_~#a~0.offset| 1)) (or (not (= (* 17179869184 (div (div (+ ~SIZE~0 (* (- 4294967296) (div ~SIZE~0 4294967296))) 2) 4294967296)) (+ (* 4 (div (+ ~SIZE~0 (* (- 4294967296) (div ~SIZE~0 4294967296))) 2)) |main_~#a~0.offset|))) (and (<= 0 |main_~#a~0.offset|) (= 3 (select (select |#memory_int| |main_~#a~0.base|) (+ (* (- 17179869184) (div (div (+ ~SIZE~0 (* (- 4294967296) (div ~SIZE~0 4294967296))) 2) 4294967296)) (* 4 (div (+ ~SIZE~0 (* (- 4294967296) (div ~SIZE~0 4294967296))) 2)) |main_~#a~0.offset|))))))))} is VALID [2018-11-18 23:56:41,216 INFO L256 TraceCheckUtils]: 6: Hoare triple {895#(and (<= (div ~SIZE~0 4294967296) 0) (< (+ (div ~SIZE~0 2) (* 2147483648 (div ~SIZE~0 4294967296))) ~SIZE~0) (or (<= ~SIZE~0 (* 2 (div ~SIZE~0 2))) (and (<= 1 ~SIZE~0) (<= (+ (* 2 ~SIZE~0) |main_~#a~0.offset|) (+ (* 4 (div ~SIZE~0 2)) 2)) (< (* 17179869184 (div (div (+ ~SIZE~0 (* (- 4294967296) (div ~SIZE~0 4294967296))) 2) 4294967296)) (+ (* 4 (div (+ ~SIZE~0 (* (- 4294967296) (div ~SIZE~0 4294967296))) 2)) |main_~#a~0.offset| 1)) (or (not (= (* 17179869184 (div (div (+ ~SIZE~0 (* (- 4294967296) (div ~SIZE~0 4294967296))) 2) 4294967296)) (+ (* 4 (div (+ ~SIZE~0 (* (- 4294967296) (div ~SIZE~0 4294967296))) 2)) |main_~#a~0.offset|))) (and (<= 0 |main_~#a~0.offset|) (= 3 (select (select |#memory_int| |main_~#a~0.base|) (+ (* (- 17179869184) (div (div (+ ~SIZE~0 (* (- 4294967296) (div ~SIZE~0 4294967296))) 2) 4294967296)) (* 4 (div (+ ~SIZE~0 (* (- 4294967296) (div ~SIZE~0 4294967296))) 2)) |main_~#a~0.offset|))))))))} 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); {893#true} is VALID [2018-11-18 23:56:41,217 INFO L273 TraceCheckUtils]: 7: Hoare triple {893#true} ~a.base, ~a.offset := #in~a.base, #in~a.offset;~n := #in~n;~q := #in~q;~j~0 := 0; {896#(and (or (<= linear_search_~a.offset |linear_search_#in~a.offset|) (<= (+ (* 4 linear_search_~j~0) linear_search_~a.offset) (* 17179869184 (div linear_search_~j~0 4294967296)))) (or (not (= (+ (* 4 linear_search_~j~0) linear_search_~a.offset) (* 17179869184 (div linear_search_~j~0 4294967296)))) (and (= linear_search_~a.base |linear_search_#in~a.base|) (= linear_search_~q |linear_search_#in~q|))) (or (<= |linear_search_#in~a.offset| linear_search_~a.offset) (< (* 17179869184 (div linear_search_~j~0 4294967296)) (+ (* 4 linear_search_~j~0) linear_search_~a.offset 1))) (= linear_search_~j~0 0))} is VALID [2018-11-18 23:56:41,218 INFO L273 TraceCheckUtils]: 8: Hoare triple {896#(and (or (<= linear_search_~a.offset |linear_search_#in~a.offset|) (<= (+ (* 4 linear_search_~j~0) linear_search_~a.offset) (* 17179869184 (div linear_search_~j~0 4294967296)))) (or (not (= (+ (* 4 linear_search_~j~0) linear_search_~a.offset) (* 17179869184 (div linear_search_~j~0 4294967296)))) (and (= linear_search_~a.base |linear_search_#in~a.base|) (= linear_search_~q |linear_search_#in~q|))) (or (<= |linear_search_#in~a.offset| linear_search_~a.offset) (< (* 17179869184 (div linear_search_~j~0 4294967296)) (+ (* 4 linear_search_~j~0) linear_search_~a.offset 1))) (= linear_search_~j~0 0))} assume true; {896#(and (or (<= linear_search_~a.offset |linear_search_#in~a.offset|) (<= (+ (* 4 linear_search_~j~0) linear_search_~a.offset) (* 17179869184 (div linear_search_~j~0 4294967296)))) (or (not (= (+ (* 4 linear_search_~j~0) linear_search_~a.offset) (* 17179869184 (div linear_search_~j~0 4294967296)))) (and (= linear_search_~a.base |linear_search_#in~a.base|) (= linear_search_~q |linear_search_#in~q|))) (or (<= |linear_search_#in~a.offset| linear_search_~a.offset) (< (* 17179869184 (div linear_search_~j~0 4294967296)) (+ (* 4 linear_search_~j~0) linear_search_~a.offset 1))) (= linear_search_~j~0 0))} is VALID [2018-11-18 23:56:41,219 INFO L273 TraceCheckUtils]: 9: Hoare triple {896#(and (or (<= linear_search_~a.offset |linear_search_#in~a.offset|) (<= (+ (* 4 linear_search_~j~0) linear_search_~a.offset) (* 17179869184 (div linear_search_~j~0 4294967296)))) (or (not (= (+ (* 4 linear_search_~j~0) linear_search_~a.offset) (* 17179869184 (div linear_search_~j~0 4294967296)))) (and (= linear_search_~a.base |linear_search_#in~a.base|) (= linear_search_~q |linear_search_#in~q|))) (or (<= |linear_search_#in~a.offset| linear_search_~a.offset) (< (* 17179869184 (div linear_search_~j~0 4294967296)) (+ (* 4 linear_search_~j~0) linear_search_~a.offset 1))) (= linear_search_~j~0 0))} #t~short1 := ~j~0 % 4294967296 < ~n % 4294967296; {897#(and (or (not |linear_search_#t~short1|) (<= (+ (* 4294967296 (div linear_search_~n 4294967296)) 1) linear_search_~n)) (or (<= linear_search_~a.offset |linear_search_#in~a.offset|) (<= (+ (* 4 linear_search_~j~0) linear_search_~a.offset) (* 17179869184 (div linear_search_~j~0 4294967296)))) (or (not (= (+ (* 4 linear_search_~j~0) linear_search_~a.offset) (* 17179869184 (div linear_search_~j~0 4294967296)))) (and (= linear_search_~a.base |linear_search_#in~a.base|) (= linear_search_~q |linear_search_#in~q|))) (or (<= (+ |linear_search_#in~a.offset| (* 17179869184 (div linear_search_~j~0 4294967296))) (+ (* 4 linear_search_~j~0) linear_search_~a.offset)) (< (* 17179869184 (div linear_search_~j~0 4294967296)) (+ (* 4 linear_search_~j~0) linear_search_~a.offset 1))) (= linear_search_~j~0 0))} is VALID [2018-11-18 23:56:41,223 INFO L273 TraceCheckUtils]: 10: Hoare triple {897#(and (or (not |linear_search_#t~short1|) (<= (+ (* 4294967296 (div linear_search_~n 4294967296)) 1) linear_search_~n)) (or (<= linear_search_~a.offset |linear_search_#in~a.offset|) (<= (+ (* 4 linear_search_~j~0) linear_search_~a.offset) (* 17179869184 (div linear_search_~j~0 4294967296)))) (or (not (= (+ (* 4 linear_search_~j~0) linear_search_~a.offset) (* 17179869184 (div linear_search_~j~0 4294967296)))) (and (= linear_search_~a.base |linear_search_#in~a.base|) (= linear_search_~q |linear_search_#in~q|))) (or (<= (+ |linear_search_#in~a.offset| (* 17179869184 (div linear_search_~j~0 4294967296))) (+ (* 4 linear_search_~j~0) linear_search_~a.offset)) (< (* 17179869184 (div linear_search_~j~0 4294967296)) (+ (* 4 linear_search_~j~0) linear_search_~a.offset 1))) (= linear_search_~j~0 0))} assume #t~short1;call #t~mem0 := read~int(~a.base, ~a.offset + 4 * (if ~j~0 % 4294967296 % 4294967296 <= 2147483647 then ~j~0 % 4294967296 % 4294967296 else ~j~0 % 4294967296 % 4294967296 - 4294967296), 4);#t~short1 := #t~mem0 != ~q; {898#(and (or (not (= (select (select |#memory_int| |linear_search_#in~a.base|) 0) |linear_search_#in~q|)) (<= (+ |linear_search_#in~a.offset| 1) 0) (<= (+ (* 17179869184 (div linear_search_~j~0 4294967296)) 1) (+ (* 4 linear_search_~j~0) |linear_search_#in~a.offset|)) (not |linear_search_#t~short1|)) (<= (+ (* 4294967296 (div linear_search_~n 4294967296)) 1) linear_search_~n) (= linear_search_~j~0 0))} is VALID [2018-11-18 23:56:41,224 INFO L273 TraceCheckUtils]: 11: Hoare triple {898#(and (or (not (= (select (select |#memory_int| |linear_search_#in~a.base|) 0) |linear_search_#in~q|)) (<= (+ |linear_search_#in~a.offset| 1) 0) (<= (+ (* 17179869184 (div linear_search_~j~0 4294967296)) 1) (+ (* 4 linear_search_~j~0) |linear_search_#in~a.offset|)) (not |linear_search_#t~short1|)) (<= (+ (* 4294967296 (div linear_search_~n 4294967296)) 1) linear_search_~n) (= linear_search_~j~0 0))} assume !!#t~short1;havoc #t~mem0;havoc #t~short1;#t~post2 := ~j~0;~j~0 := 1 + #t~post2;havoc #t~post2; {899#(and (<= linear_search_~j~0 1) (<= 1 linear_search_~j~0) (or (not (= (select (select |#memory_int| |linear_search_#in~a.base|) 0) |linear_search_#in~q|)) (<= 1 |linear_search_#in~a.offset|) (<= (+ |linear_search_#in~a.offset| 1) 0)))} is VALID [2018-11-18 23:56:41,225 INFO L273 TraceCheckUtils]: 12: Hoare triple {899#(and (<= linear_search_~j~0 1) (<= 1 linear_search_~j~0) (or (not (= (select (select |#memory_int| |linear_search_#in~a.base|) 0) |linear_search_#in~q|)) (<= 1 |linear_search_#in~a.offset|) (<= (+ |linear_search_#in~a.offset| 1) 0)))} assume !(20 == ~j~0 % 4294967296); {899#(and (<= linear_search_~j~0 1) (<= 1 linear_search_~j~0) (or (not (= (select (select |#memory_int| |linear_search_#in~a.base|) 0) |linear_search_#in~q|)) (<= 1 |linear_search_#in~a.offset|) (<= (+ |linear_search_#in~a.offset| 1) 0)))} is VALID [2018-11-18 23:56:41,226 INFO L273 TraceCheckUtils]: 13: Hoare triple {899#(and (<= linear_search_~j~0 1) (<= 1 linear_search_~j~0) (or (not (= (select (select |#memory_int| |linear_search_#in~a.base|) 0) |linear_search_#in~q|)) (<= 1 |linear_search_#in~a.offset|) (<= (+ |linear_search_#in~a.offset| 1) 0)))} assume true; {899#(and (<= linear_search_~j~0 1) (<= 1 linear_search_~j~0) (or (not (= (select (select |#memory_int| |linear_search_#in~a.base|) 0) |linear_search_#in~q|)) (<= 1 |linear_search_#in~a.offset|) (<= (+ |linear_search_#in~a.offset| 1) 0)))} is VALID [2018-11-18 23:56:41,226 INFO L273 TraceCheckUtils]: 14: Hoare triple {899#(and (<= linear_search_~j~0 1) (<= 1 linear_search_~j~0) (or (not (= (select (select |#memory_int| |linear_search_#in~a.base|) 0) |linear_search_#in~q|)) (<= 1 |linear_search_#in~a.offset|) (<= (+ |linear_search_#in~a.offset| 1) 0)))} #t~short1 := ~j~0 % 4294967296 < ~n % 4294967296; {899#(and (<= linear_search_~j~0 1) (<= 1 linear_search_~j~0) (or (not (= (select (select |#memory_int| |linear_search_#in~a.base|) 0) |linear_search_#in~q|)) (<= 1 |linear_search_#in~a.offset|) (<= (+ |linear_search_#in~a.offset| 1) 0)))} is VALID [2018-11-18 23:56:41,227 INFO L273 TraceCheckUtils]: 15: Hoare triple {899#(and (<= linear_search_~j~0 1) (<= 1 linear_search_~j~0) (or (not (= (select (select |#memory_int| |linear_search_#in~a.base|) 0) |linear_search_#in~q|)) (<= 1 |linear_search_#in~a.offset|) (<= (+ |linear_search_#in~a.offset| 1) 0)))} assume !#t~short1; {899#(and (<= linear_search_~j~0 1) (<= 1 linear_search_~j~0) (or (not (= (select (select |#memory_int| |linear_search_#in~a.base|) 0) |linear_search_#in~q|)) (<= 1 |linear_search_#in~a.offset|) (<= (+ |linear_search_#in~a.offset| 1) 0)))} is VALID [2018-11-18 23:56:41,228 INFO L273 TraceCheckUtils]: 16: Hoare triple {899#(and (<= linear_search_~j~0 1) (<= 1 linear_search_~j~0) (or (not (= (select (select |#memory_int| |linear_search_#in~a.base|) 0) |linear_search_#in~q|)) (<= 1 |linear_search_#in~a.offset|) (<= (+ |linear_search_#in~a.offset| 1) 0)))} assume !#t~short1;havoc #t~mem0;havoc #t~short1; {899#(and (<= linear_search_~j~0 1) (<= 1 linear_search_~j~0) (or (not (= (select (select |#memory_int| |linear_search_#in~a.base|) 0) |linear_search_#in~q|)) (<= 1 |linear_search_#in~a.offset|) (<= (+ |linear_search_#in~a.offset| 1) 0)))} is VALID [2018-11-18 23:56:41,230 INFO L273 TraceCheckUtils]: 17: Hoare triple {899#(and (<= linear_search_~j~0 1) (<= 1 linear_search_~j~0) (or (not (= (select (select |#memory_int| |linear_search_#in~a.base|) 0) |linear_search_#in~q|)) (<= 1 |linear_search_#in~a.offset|) (<= (+ |linear_search_#in~a.offset| 1) 0)))} assume !(~j~0 % 4294967296 < ~SIZE~0 % 4294967296);#res := 0; {900#(or (< 0 (div ~SIZE~0 4294967296)) (and (<= ~SIZE~0 (+ (* 4294967296 (div ~SIZE~0 4294967296)) 1)) (or (not (= (select (select |#memory_int| |linear_search_#in~a.base|) 0) |linear_search_#in~q|)) (<= 1 |linear_search_#in~a.offset|) (<= (+ |linear_search_#in~a.offset| 1) 0))) (<= ~SIZE~0 (* 4294967296 (div ~SIZE~0 4294967296))))} is VALID [2018-11-18 23:56:41,231 INFO L273 TraceCheckUtils]: 18: Hoare triple {900#(or (< 0 (div ~SIZE~0 4294967296)) (and (<= ~SIZE~0 (+ (* 4294967296 (div ~SIZE~0 4294967296)) 1)) (or (not (= (select (select |#memory_int| |linear_search_#in~a.base|) 0) |linear_search_#in~q|)) (<= 1 |linear_search_#in~a.offset|) (<= (+ |linear_search_#in~a.offset| 1) 0))) (<= ~SIZE~0 (* 4294967296 (div ~SIZE~0 4294967296))))} assume true; {900#(or (< 0 (div ~SIZE~0 4294967296)) (and (<= ~SIZE~0 (+ (* 4294967296 (div ~SIZE~0 4294967296)) 1)) (or (not (= (select (select |#memory_int| |linear_search_#in~a.base|) 0) |linear_search_#in~q|)) (<= 1 |linear_search_#in~a.offset|) (<= (+ |linear_search_#in~a.offset| 1) 0))) (<= ~SIZE~0 (* 4294967296 (div ~SIZE~0 4294967296))))} is VALID [2018-11-18 23:56:41,236 INFO L268 TraceCheckUtils]: 19: Hoare quadruple {900#(or (< 0 (div ~SIZE~0 4294967296)) (and (<= ~SIZE~0 (+ (* 4294967296 (div ~SIZE~0 4294967296)) 1)) (or (not (= (select (select |#memory_int| |linear_search_#in~a.base|) 0) |linear_search_#in~q|)) (<= 1 |linear_search_#in~a.offset|) (<= (+ |linear_search_#in~a.offset| 1) 0))) (<= ~SIZE~0 (* 4294967296 (div ~SIZE~0 4294967296))))} {895#(and (<= (div ~SIZE~0 4294967296) 0) (< (+ (div ~SIZE~0 2) (* 2147483648 (div ~SIZE~0 4294967296))) ~SIZE~0) (or (<= ~SIZE~0 (* 2 (div ~SIZE~0 2))) (and (<= 1 ~SIZE~0) (<= (+ (* 2 ~SIZE~0) |main_~#a~0.offset|) (+ (* 4 (div ~SIZE~0 2)) 2)) (< (* 17179869184 (div (div (+ ~SIZE~0 (* (- 4294967296) (div ~SIZE~0 4294967296))) 2) 4294967296)) (+ (* 4 (div (+ ~SIZE~0 (* (- 4294967296) (div ~SIZE~0 4294967296))) 2)) |main_~#a~0.offset| 1)) (or (not (= (* 17179869184 (div (div (+ ~SIZE~0 (* (- 4294967296) (div ~SIZE~0 4294967296))) 2) 4294967296)) (+ (* 4 (div (+ ~SIZE~0 (* (- 4294967296) (div ~SIZE~0 4294967296))) 2)) |main_~#a~0.offset|))) (and (<= 0 |main_~#a~0.offset|) (= 3 (select (select |#memory_int| |main_~#a~0.base|) (+ (* (- 17179869184) (div (div (+ ~SIZE~0 (* (- 4294967296) (div ~SIZE~0 4294967296))) 2) 4294967296)) (* 4 (div (+ ~SIZE~0 (* (- 4294967296) (div ~SIZE~0 4294967296))) 2)) |main_~#a~0.offset|))))))))} #59#return; {894#false} is VALID [2018-11-18 23:56:41,236 INFO L273 TraceCheckUtils]: 20: Hoare triple {894#false} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {894#false} is VALID [2018-11-18 23:56:41,236 INFO L256 TraceCheckUtils]: 21: Hoare triple {894#false} call __VERIFIER_assert(#t~ret4); {894#false} is VALID [2018-11-18 23:56:41,237 INFO L273 TraceCheckUtils]: 22: Hoare triple {894#false} ~cond := #in~cond; {894#false} is VALID [2018-11-18 23:56:41,237 INFO L273 TraceCheckUtils]: 23: Hoare triple {894#false} assume 0 == ~cond; {894#false} is VALID [2018-11-18 23:56:41,237 INFO L273 TraceCheckUtils]: 24: Hoare triple {894#false} assume !false; {894#false} is VALID [2018-11-18 23:56:41,241 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 23:56:41,242 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 23:56:41,242 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-18 23:56:41,259 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 23:56:41,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 23:56:41,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 23:56:41,317 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 23:56:41,379 WARN L307 Elim1Store]: Array PQE input equivalent to false [2018-11-18 23:56:41,382 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-18 23:56:43,433 INFO L477 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 21 treesize of output 18 [2018-11-18 23:56:43,437 INFO L477 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 18 treesize of output 17 [2018-11-18 23:56:43,438 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-18 23:56:43,441 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 23:56:43,450 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 23:56:43,451 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:245, output treesize:17 [2018-11-18 23:56:43,967 WARN L180 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 45 [2018-11-18 23:56:44,510 INFO L256 TraceCheckUtils]: 0: Hoare triple {893#true} call ULTIMATE.init(); {893#true} is VALID [2018-11-18 23:56:44,510 INFO L273 TraceCheckUtils]: 1: Hoare triple {893#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~SIZE~0 := 0; {893#true} is VALID [2018-11-18 23:56:44,510 INFO L273 TraceCheckUtils]: 2: Hoare triple {893#true} assume true; {893#true} is VALID [2018-11-18 23:56:44,510 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {893#true} {893#true} #55#return; {893#true} is VALID [2018-11-18 23:56:44,511 INFO L256 TraceCheckUtils]: 4: Hoare triple {893#true} call #t~ret5 := main(); {893#true} is VALID [2018-11-18 23:56:44,513 INFO L273 TraceCheckUtils]: 5: Hoare triple {893#true} ~SIZE~0 := 1 + (if #t~nondet3 % 4294967296 < 0 && 0 != #t~nondet3 % 4294967296 % 2 then 1 + #t~nondet3 % 4294967296 / 2 else #t~nondet3 % 4294967296 / 2);havoc #t~nondet3;call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(4 * (if ~SIZE~0 % 4294967296 % 4294967296 <= 2147483647 then ~SIZE~0 % 4294967296 % 4294967296 else ~SIZE~0 % 4294967296 % 4294967296 - 4294967296));call write~int(3, ~#a~0.base, ~#a~0.offset + 4 * (if (if ~SIZE~0 % 4294967296 < 0 && 0 != ~SIZE~0 % 4294967296 % 2 then 1 + ~SIZE~0 % 4294967296 / 2 else ~SIZE~0 % 4294967296 / 2) % 4294967296 % 4294967296 <= 2147483647 then (if ~SIZE~0 % 4294967296 < 0 && 0 != ~SIZE~0 % 4294967296 % 2 then 1 + ~SIZE~0 % 4294967296 / 2 else ~SIZE~0 % 4294967296 / 2) % 4294967296 % 4294967296 else (if ~SIZE~0 % 4294967296 < 0 && 0 != ~SIZE~0 % 4294967296 % 2 then 1 + ~SIZE~0 % 4294967296 / 2 else ~SIZE~0 % 4294967296 / 2) % 4294967296 % 4294967296 - 4294967296), 4); {919#(= 3 (select (select |#memory_int| |main_~#a~0.base|) (+ (* 4 (mod (div (mod ~SIZE~0 4294967296) 2) 4294967296)) |main_~#a~0.offset|)))} is VALID [2018-11-18 23:56:44,515 INFO L256 TraceCheckUtils]: 6: Hoare triple {919#(= 3 (select (select |#memory_int| |main_~#a~0.base|) (+ (* 4 (mod (div (mod ~SIZE~0 4294967296) 2) 4294967296)) |main_~#a~0.offset|)))} 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); {923#(exists ((|v_main_~#a~0.offset_BEFORE_CALL_1| Int) (|v_main_~#a~0.base_BEFORE_CALL_1| Int)) (= 3 (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_1|) (+ (* 4 (mod (div (mod ~SIZE~0 4294967296) 2) 4294967296)) |v_main_~#a~0.offset_BEFORE_CALL_1|))))} is VALID [2018-11-18 23:56:44,521 INFO L273 TraceCheckUtils]: 7: Hoare triple {923#(exists ((|v_main_~#a~0.offset_BEFORE_CALL_1| Int) (|v_main_~#a~0.base_BEFORE_CALL_1| Int)) (= 3 (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_1|) (+ (* 4 (mod (div (mod ~SIZE~0 4294967296) 2) 4294967296)) |v_main_~#a~0.offset_BEFORE_CALL_1|))))} ~a.base, ~a.offset := #in~a.base, #in~a.offset;~n := #in~n;~q := #in~q;~j~0 := 0; {927#(and (= |linear_search_#in~a.base| linear_search_~a.base) (= |linear_search_#in~a.offset| linear_search_~a.offset) (= |linear_search_#in~q| linear_search_~q) (exists ((|v_main_~#a~0.offset_BEFORE_CALL_1| Int) (|v_main_~#a~0.base_BEFORE_CALL_1| Int)) (= 3 (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_1|) (+ (* 4 (mod (div (mod ~SIZE~0 4294967296) 2) 4294967296)) |v_main_~#a~0.offset_BEFORE_CALL_1|)))) (= linear_search_~j~0 0))} is VALID [2018-11-18 23:56:44,522 INFO L273 TraceCheckUtils]: 8: Hoare triple {927#(and (= |linear_search_#in~a.base| linear_search_~a.base) (= |linear_search_#in~a.offset| linear_search_~a.offset) (= |linear_search_#in~q| linear_search_~q) (exists ((|v_main_~#a~0.offset_BEFORE_CALL_1| Int) (|v_main_~#a~0.base_BEFORE_CALL_1| Int)) (= 3 (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_1|) (+ (* 4 (mod (div (mod ~SIZE~0 4294967296) 2) 4294967296)) |v_main_~#a~0.offset_BEFORE_CALL_1|)))) (= linear_search_~j~0 0))} assume true; {927#(and (= |linear_search_#in~a.base| linear_search_~a.base) (= |linear_search_#in~a.offset| linear_search_~a.offset) (= |linear_search_#in~q| linear_search_~q) (exists ((|v_main_~#a~0.offset_BEFORE_CALL_1| Int) (|v_main_~#a~0.base_BEFORE_CALL_1| Int)) (= 3 (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_1|) (+ (* 4 (mod (div (mod ~SIZE~0 4294967296) 2) 4294967296)) |v_main_~#a~0.offset_BEFORE_CALL_1|)))) (= linear_search_~j~0 0))} is VALID [2018-11-18 23:56:44,523 INFO L273 TraceCheckUtils]: 9: Hoare triple {927#(and (= |linear_search_#in~a.base| linear_search_~a.base) (= |linear_search_#in~a.offset| linear_search_~a.offset) (= |linear_search_#in~q| linear_search_~q) (exists ((|v_main_~#a~0.offset_BEFORE_CALL_1| Int) (|v_main_~#a~0.base_BEFORE_CALL_1| Int)) (= 3 (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_1|) (+ (* 4 (mod (div (mod ~SIZE~0 4294967296) 2) 4294967296)) |v_main_~#a~0.offset_BEFORE_CALL_1|)))) (= linear_search_~j~0 0))} #t~short1 := ~j~0 % 4294967296 < ~n % 4294967296; {934#(or (and (= |linear_search_#in~a.base| linear_search_~a.base) (< (mod linear_search_~j~0 4294967296) (mod linear_search_~n 4294967296)) (= |linear_search_#in~a.offset| linear_search_~a.offset) (= |linear_search_#in~q| linear_search_~q) |linear_search_#t~short1| (exists ((|v_main_~#a~0.offset_BEFORE_CALL_1| Int) (|v_main_~#a~0.base_BEFORE_CALL_1| Int)) (= 3 (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_1|) (+ (* 4 (mod (div (mod ~SIZE~0 4294967296) 2) 4294967296)) |v_main_~#a~0.offset_BEFORE_CALL_1|)))) (= linear_search_~j~0 0)) (and (= |linear_search_#in~a.base| linear_search_~a.base) (= |linear_search_#in~a.offset| linear_search_~a.offset) (<= (mod linear_search_~n 4294967296) (mod linear_search_~j~0 4294967296)) (not |linear_search_#t~short1|) (= |linear_search_#in~q| linear_search_~q) (exists ((|v_main_~#a~0.offset_BEFORE_CALL_1| Int) (|v_main_~#a~0.base_BEFORE_CALL_1| Int)) (= 3 (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_1|) (+ (* 4 (mod (div (mod ~SIZE~0 4294967296) 2) 4294967296)) |v_main_~#a~0.offset_BEFORE_CALL_1|)))) (= linear_search_~j~0 0)))} is VALID [2018-11-18 23:56:44,529 INFO L273 TraceCheckUtils]: 10: Hoare triple {934#(or (and (= |linear_search_#in~a.base| linear_search_~a.base) (< (mod linear_search_~j~0 4294967296) (mod linear_search_~n 4294967296)) (= |linear_search_#in~a.offset| linear_search_~a.offset) (= |linear_search_#in~q| linear_search_~q) |linear_search_#t~short1| (exists ((|v_main_~#a~0.offset_BEFORE_CALL_1| Int) (|v_main_~#a~0.base_BEFORE_CALL_1| Int)) (= 3 (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_1|) (+ (* 4 (mod (div (mod ~SIZE~0 4294967296) 2) 4294967296)) |v_main_~#a~0.offset_BEFORE_CALL_1|)))) (= linear_search_~j~0 0)) (and (= |linear_search_#in~a.base| linear_search_~a.base) (= |linear_search_#in~a.offset| linear_search_~a.offset) (<= (mod linear_search_~n 4294967296) (mod linear_search_~j~0 4294967296)) (not |linear_search_#t~short1|) (= |linear_search_#in~q| linear_search_~q) (exists ((|v_main_~#a~0.offset_BEFORE_CALL_1| Int) (|v_main_~#a~0.base_BEFORE_CALL_1| Int)) (= 3 (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_1|) (+ (* 4 (mod (div (mod ~SIZE~0 4294967296) 2) 4294967296)) |v_main_~#a~0.offset_BEFORE_CALL_1|)))) (= linear_search_~j~0 0)))} assume #t~short1;call #t~mem0 := read~int(~a.base, ~a.offset + 4 * (if ~j~0 % 4294967296 % 4294967296 <= 2147483647 then ~j~0 % 4294967296 % 4294967296 else ~j~0 % 4294967296 % 4294967296 - 4294967296), 4);#t~short1 := #t~mem0 != ~q; {938#(or (and (< (mod linear_search_~j~0 4294967296) (mod linear_search_~n 4294967296)) (not (= (select (select |#memory_int| |linear_search_#in~a.base|) (+ |linear_search_#in~a.offset| (* 4 (mod linear_search_~j~0 4294967296)))) |linear_search_#in~q|)) |linear_search_#t~short1| (exists ((v_prenex_4 Int) (v_prenex_5 Int)) (= 3 (select (select |#memory_int| v_prenex_5) (+ (* 4 (mod (div (mod ~SIZE~0 4294967296) 2) 4294967296)) v_prenex_4)))) (= linear_search_~j~0 0)) (and (= (select (select |#memory_int| |linear_search_#in~a.base|) (+ |linear_search_#in~a.offset| (* 4 (mod linear_search_~j~0 4294967296)))) |linear_search_#in~q|) (< (mod linear_search_~j~0 4294967296) (mod linear_search_~n 4294967296)) (exists ((v_prenex_18 Int) (v_prenex_19 Int)) (= 3 (select (select |#memory_int| v_prenex_18) (+ (* 4 (mod (div (mod ~SIZE~0 4294967296) 2) 4294967296)) v_prenex_19)))) (not |linear_search_#t~short1|) (= linear_search_~j~0 0)))} is VALID [2018-11-18 23:56:44,534 INFO L273 TraceCheckUtils]: 11: Hoare triple {938#(or (and (< (mod linear_search_~j~0 4294967296) (mod linear_search_~n 4294967296)) (not (= (select (select |#memory_int| |linear_search_#in~a.base|) (+ |linear_search_#in~a.offset| (* 4 (mod linear_search_~j~0 4294967296)))) |linear_search_#in~q|)) |linear_search_#t~short1| (exists ((v_prenex_4 Int) (v_prenex_5 Int)) (= 3 (select (select |#memory_int| v_prenex_5) (+ (* 4 (mod (div (mod ~SIZE~0 4294967296) 2) 4294967296)) v_prenex_4)))) (= linear_search_~j~0 0)) (and (= (select (select |#memory_int| |linear_search_#in~a.base|) (+ |linear_search_#in~a.offset| (* 4 (mod linear_search_~j~0 4294967296)))) |linear_search_#in~q|) (< (mod linear_search_~j~0 4294967296) (mod linear_search_~n 4294967296)) (exists ((v_prenex_18 Int) (v_prenex_19 Int)) (= 3 (select (select |#memory_int| v_prenex_18) (+ (* 4 (mod (div (mod ~SIZE~0 4294967296) 2) 4294967296)) v_prenex_19)))) (not |linear_search_#t~short1|) (= linear_search_~j~0 0)))} assume !!#t~short1;havoc #t~mem0;havoc #t~short1;#t~post2 := ~j~0;~j~0 := 1 + #t~post2;havoc #t~post2; {942#(and (= linear_search_~j~0 1) (not (= (select (select |#memory_int| |linear_search_#in~a.base|) (+ (* 4 (mod (+ linear_search_~j~0 4294967295) 4294967296)) |linear_search_#in~a.offset|)) |linear_search_#in~q|)) (< (mod (+ linear_search_~j~0 4294967295) 4294967296) (mod linear_search_~n 4294967296)) (exists ((v_prenex_4 Int) (v_prenex_5 Int)) (= 3 (select (select |#memory_int| v_prenex_5) (+ (* 4 (mod (div (mod ~SIZE~0 4294967296) 2) 4294967296)) v_prenex_4)))))} is VALID [2018-11-18 23:56:44,536 INFO L273 TraceCheckUtils]: 12: Hoare triple {942#(and (= linear_search_~j~0 1) (not (= (select (select |#memory_int| |linear_search_#in~a.base|) (+ (* 4 (mod (+ linear_search_~j~0 4294967295) 4294967296)) |linear_search_#in~a.offset|)) |linear_search_#in~q|)) (< (mod (+ linear_search_~j~0 4294967295) 4294967296) (mod linear_search_~n 4294967296)) (exists ((v_prenex_4 Int) (v_prenex_5 Int)) (= 3 (select (select |#memory_int| v_prenex_5) (+ (* 4 (mod (div (mod ~SIZE~0 4294967296) 2) 4294967296)) v_prenex_4)))))} assume !(20 == ~j~0 % 4294967296); {942#(and (= linear_search_~j~0 1) (not (= (select (select |#memory_int| |linear_search_#in~a.base|) (+ (* 4 (mod (+ linear_search_~j~0 4294967295) 4294967296)) |linear_search_#in~a.offset|)) |linear_search_#in~q|)) (< (mod (+ linear_search_~j~0 4294967295) 4294967296) (mod linear_search_~n 4294967296)) (exists ((v_prenex_4 Int) (v_prenex_5 Int)) (= 3 (select (select |#memory_int| v_prenex_5) (+ (* 4 (mod (div (mod ~SIZE~0 4294967296) 2) 4294967296)) v_prenex_4)))))} is VALID [2018-11-18 23:56:44,537 INFO L273 TraceCheckUtils]: 13: Hoare triple {942#(and (= linear_search_~j~0 1) (not (= (select (select |#memory_int| |linear_search_#in~a.base|) (+ (* 4 (mod (+ linear_search_~j~0 4294967295) 4294967296)) |linear_search_#in~a.offset|)) |linear_search_#in~q|)) (< (mod (+ linear_search_~j~0 4294967295) 4294967296) (mod linear_search_~n 4294967296)) (exists ((v_prenex_4 Int) (v_prenex_5 Int)) (= 3 (select (select |#memory_int| v_prenex_5) (+ (* 4 (mod (div (mod ~SIZE~0 4294967296) 2) 4294967296)) v_prenex_4)))))} assume true; {942#(and (= linear_search_~j~0 1) (not (= (select (select |#memory_int| |linear_search_#in~a.base|) (+ (* 4 (mod (+ linear_search_~j~0 4294967295) 4294967296)) |linear_search_#in~a.offset|)) |linear_search_#in~q|)) (< (mod (+ linear_search_~j~0 4294967295) 4294967296) (mod linear_search_~n 4294967296)) (exists ((v_prenex_4 Int) (v_prenex_5 Int)) (= 3 (select (select |#memory_int| v_prenex_5) (+ (* 4 (mod (div (mod ~SIZE~0 4294967296) 2) 4294967296)) v_prenex_4)))))} is VALID [2018-11-18 23:56:44,538 INFO L273 TraceCheckUtils]: 14: Hoare triple {942#(and (= linear_search_~j~0 1) (not (= (select (select |#memory_int| |linear_search_#in~a.base|) (+ (* 4 (mod (+ linear_search_~j~0 4294967295) 4294967296)) |linear_search_#in~a.offset|)) |linear_search_#in~q|)) (< (mod (+ linear_search_~j~0 4294967295) 4294967296) (mod linear_search_~n 4294967296)) (exists ((v_prenex_4 Int) (v_prenex_5 Int)) (= 3 (select (select |#memory_int| v_prenex_5) (+ (* 4 (mod (div (mod ~SIZE~0 4294967296) 2) 4294967296)) v_prenex_4)))))} #t~short1 := ~j~0 % 4294967296 < ~n % 4294967296; {952#(and (= linear_search_~j~0 1) (not (= (select (select |#memory_int| |linear_search_#in~a.base|) (+ (* 4 (mod (+ linear_search_~j~0 4294967295) 4294967296)) |linear_search_#in~a.offset|)) |linear_search_#in~q|)) (exists ((v_prenex_4 Int) (v_prenex_5 Int)) (= 3 (select (select |#memory_int| v_prenex_5) (+ (* 4 (mod (div (mod ~SIZE~0 4294967296) 2) 4294967296)) v_prenex_4)))))} is VALID [2018-11-18 23:56:44,540 INFO L273 TraceCheckUtils]: 15: Hoare triple {952#(and (= linear_search_~j~0 1) (not (= (select (select |#memory_int| |linear_search_#in~a.base|) (+ (* 4 (mod (+ linear_search_~j~0 4294967295) 4294967296)) |linear_search_#in~a.offset|)) |linear_search_#in~q|)) (exists ((v_prenex_4 Int) (v_prenex_5 Int)) (= 3 (select (select |#memory_int| v_prenex_5) (+ (* 4 (mod (div (mod ~SIZE~0 4294967296) 2) 4294967296)) v_prenex_4)))))} assume !#t~short1; {952#(and (= linear_search_~j~0 1) (not (= (select (select |#memory_int| |linear_search_#in~a.base|) (+ (* 4 (mod (+ linear_search_~j~0 4294967295) 4294967296)) |linear_search_#in~a.offset|)) |linear_search_#in~q|)) (exists ((v_prenex_4 Int) (v_prenex_5 Int)) (= 3 (select (select |#memory_int| v_prenex_5) (+ (* 4 (mod (div (mod ~SIZE~0 4294967296) 2) 4294967296)) v_prenex_4)))))} is VALID [2018-11-18 23:56:44,541 INFO L273 TraceCheckUtils]: 16: Hoare triple {952#(and (= linear_search_~j~0 1) (not (= (select (select |#memory_int| |linear_search_#in~a.base|) (+ (* 4 (mod (+ linear_search_~j~0 4294967295) 4294967296)) |linear_search_#in~a.offset|)) |linear_search_#in~q|)) (exists ((v_prenex_4 Int) (v_prenex_5 Int)) (= 3 (select (select |#memory_int| v_prenex_5) (+ (* 4 (mod (div (mod ~SIZE~0 4294967296) 2) 4294967296)) v_prenex_4)))))} assume !#t~short1;havoc #t~mem0;havoc #t~short1; {952#(and (= linear_search_~j~0 1) (not (= (select (select |#memory_int| |linear_search_#in~a.base|) (+ (* 4 (mod (+ linear_search_~j~0 4294967295) 4294967296)) |linear_search_#in~a.offset|)) |linear_search_#in~q|)) (exists ((v_prenex_4 Int) (v_prenex_5 Int)) (= 3 (select (select |#memory_int| v_prenex_5) (+ (* 4 (mod (div (mod ~SIZE~0 4294967296) 2) 4294967296)) v_prenex_4)))))} is VALID [2018-11-18 23:56:44,543 INFO L273 TraceCheckUtils]: 17: Hoare triple {952#(and (= linear_search_~j~0 1) (not (= (select (select |#memory_int| |linear_search_#in~a.base|) (+ (* 4 (mod (+ linear_search_~j~0 4294967295) 4294967296)) |linear_search_#in~a.offset|)) |linear_search_#in~q|)) (exists ((v_prenex_4 Int) (v_prenex_5 Int)) (= 3 (select (select |#memory_int| v_prenex_5) (+ (* 4 (mod (div (mod ~SIZE~0 4294967296) 2) 4294967296)) v_prenex_4)))))} assume !(~j~0 % 4294967296 < ~SIZE~0 % 4294967296);#res := 0; {962#(and (not (= (select (select |#memory_int| |linear_search_#in~a.base|) |linear_search_#in~a.offset|) |linear_search_#in~q|)) (<= (mod ~SIZE~0 4294967296) 1) (exists ((v_prenex_4 Int) (v_prenex_5 Int)) (= 3 (select (select |#memory_int| v_prenex_5) (+ (* 4 (mod (div (mod ~SIZE~0 4294967296) 2) 4294967296)) v_prenex_4)))))} is VALID [2018-11-18 23:56:44,543 INFO L273 TraceCheckUtils]: 18: Hoare triple {962#(and (not (= (select (select |#memory_int| |linear_search_#in~a.base|) |linear_search_#in~a.offset|) |linear_search_#in~q|)) (<= (mod ~SIZE~0 4294967296) 1) (exists ((v_prenex_4 Int) (v_prenex_5 Int)) (= 3 (select (select |#memory_int| v_prenex_5) (+ (* 4 (mod (div (mod ~SIZE~0 4294967296) 2) 4294967296)) v_prenex_4)))))} assume true; {962#(and (not (= (select (select |#memory_int| |linear_search_#in~a.base|) |linear_search_#in~a.offset|) |linear_search_#in~q|)) (<= (mod ~SIZE~0 4294967296) 1) (exists ((v_prenex_4 Int) (v_prenex_5 Int)) (= 3 (select (select |#memory_int| v_prenex_5) (+ (* 4 (mod (div (mod ~SIZE~0 4294967296) 2) 4294967296)) v_prenex_4)))))} is VALID [2018-11-18 23:56:44,552 INFO L268 TraceCheckUtils]: 19: Hoare quadruple {962#(and (not (= (select (select |#memory_int| |linear_search_#in~a.base|) |linear_search_#in~a.offset|) |linear_search_#in~q|)) (<= (mod ~SIZE~0 4294967296) 1) (exists ((v_prenex_4 Int) (v_prenex_5 Int)) (= 3 (select (select |#memory_int| v_prenex_5) (+ (* 4 (mod (div (mod ~SIZE~0 4294967296) 2) 4294967296)) v_prenex_4)))))} {919#(= 3 (select (select |#memory_int| |main_~#a~0.base|) (+ (* 4 (mod (div (mod ~SIZE~0 4294967296) 2) 4294967296)) |main_~#a~0.offset|)))} #59#return; {894#false} is VALID [2018-11-18 23:56:44,552 INFO L273 TraceCheckUtils]: 20: Hoare triple {894#false} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {894#false} is VALID [2018-11-18 23:56:44,552 INFO L256 TraceCheckUtils]: 21: Hoare triple {894#false} call __VERIFIER_assert(#t~ret4); {894#false} is VALID [2018-11-18 23:56:44,552 INFO L273 TraceCheckUtils]: 22: Hoare triple {894#false} ~cond := #in~cond; {894#false} is VALID [2018-11-18 23:56:44,553 INFO L273 TraceCheckUtils]: 23: Hoare triple {894#false} assume 0 == ~cond; {894#false} is VALID [2018-11-18 23:56:44,553 INFO L273 TraceCheckUtils]: 24: Hoare triple {894#false} assume !false; {894#false} is VALID [2018-11-18 23:56:44,558 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 23:56:44,577 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-18 23:56:44,577 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 10] total 16 [2018-11-18 23:56:44,578 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 25 [2018-11-18 23:56:44,578 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-18 23:56:44,578 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 16 states. [2018-11-18 23:56:44,669 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-18 23:56:44,669 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-11-18 23:56:44,669 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-11-18 23:56:44,669 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=194, Unknown=0, NotChecked=0, Total=240 [2018-11-18 23:56:44,670 INFO L87 Difference]: Start difference. First operand 28 states and 31 transitions. Second operand 16 states. [2018-11-18 23:56:45,047 WARN L180 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 51 [2018-11-18 23:56:45,507 WARN L180 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 45 [2018-11-18 23:56:46,210 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 23:56:46,210 INFO L93 Difference]: Finished difference Result 44 states and 48 transitions. [2018-11-18 23:56:46,211 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-11-18 23:56:46,211 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 25 [2018-11-18 23:56:46,211 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 23:56:46,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2018-11-18 23:56:46,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 45 transitions. [2018-11-18 23:56:46,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2018-11-18 23:56:46,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 45 transitions. [2018-11-18 23:56:46,215 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states and 45 transitions. [2018-11-18 23:56:46,324 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 45 edges. 45 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 23:56:46,325 INFO L225 Difference]: With dead ends: 44 [2018-11-18 23:56:46,325 INFO L226 Difference]: Without dead ends: 35 [2018-11-18 23:56:46,326 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 17 SyntacticMatches, 4 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=67, Invalid=275, Unknown=0, NotChecked=0, Total=342 [2018-11-18 23:56:46,326 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2018-11-18 23:56:46,397 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 33. [2018-11-18 23:56:46,397 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-18 23:56:46,397 INFO L82 GeneralOperation]: Start isEquivalent. First operand 35 states. Second operand 33 states. [2018-11-18 23:56:46,397 INFO L74 IsIncluded]: Start isIncluded. First operand 35 states. Second operand 33 states. [2018-11-18 23:56:46,397 INFO L87 Difference]: Start difference. First operand 35 states. Second operand 33 states. [2018-11-18 23:56:46,399 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 23:56:46,399 INFO L93 Difference]: Finished difference Result 35 states and 39 transitions. [2018-11-18 23:56:46,400 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 39 transitions. [2018-11-18 23:56:46,400 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 23:56:46,400 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 23:56:46,400 INFO L74 IsIncluded]: Start isIncluded. First operand 33 states. Second operand 35 states. [2018-11-18 23:56:46,401 INFO L87 Difference]: Start difference. First operand 33 states. Second operand 35 states. [2018-11-18 23:56:46,402 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 23:56:46,403 INFO L93 Difference]: Finished difference Result 35 states and 39 transitions. [2018-11-18 23:56:46,403 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 39 transitions. [2018-11-18 23:56:46,403 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 23:56:46,403 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 23:56:46,403 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-18 23:56:46,404 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-18 23:56:46,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2018-11-18 23:56:46,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 37 transitions. [2018-11-18 23:56:46,405 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 37 transitions. Word has length 25 [2018-11-18 23:56:46,406 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 23:56:46,406 INFO L480 AbstractCegarLoop]: Abstraction has 33 states and 37 transitions. [2018-11-18 23:56:46,406 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-11-18 23:56:46,406 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 37 transitions. [2018-11-18 23:56:46,407 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-11-18 23:56:46,407 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 23:56:46,407 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-18 23:56:46,407 INFO L423 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 23:56:46,407 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 23:56:46,408 INFO L82 PathProgramCache]: Analyzing trace with hash 1573735486, now seen corresponding path program 1 times [2018-11-18 23:56:46,408 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 23:56:46,408 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 23:56:46,409 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 23:56:46,409 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 23:56:46,409 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 23:56:46,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 23:56:46,609 INFO L256 TraceCheckUtils]: 0: Hoare triple {1160#true} call ULTIMATE.init(); {1160#true} is VALID [2018-11-18 23:56:46,610 INFO L273 TraceCheckUtils]: 1: Hoare triple {1160#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~SIZE~0 := 0; {1160#true} is VALID [2018-11-18 23:56:46,610 INFO L273 TraceCheckUtils]: 2: Hoare triple {1160#true} assume true; {1160#true} is VALID [2018-11-18 23:56:46,610 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1160#true} {1160#true} #55#return; {1160#true} is VALID [2018-11-18 23:56:46,611 INFO L256 TraceCheckUtils]: 4: Hoare triple {1160#true} call #t~ret5 := main(); {1160#true} is VALID [2018-11-18 23:56:46,611 INFO L273 TraceCheckUtils]: 5: Hoare triple {1160#true} ~SIZE~0 := 1 + (if #t~nondet3 % 4294967296 < 0 && 0 != #t~nondet3 % 4294967296 % 2 then 1 + #t~nondet3 % 4294967296 / 2 else #t~nondet3 % 4294967296 / 2);havoc #t~nondet3;call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(4 * (if ~SIZE~0 % 4294967296 % 4294967296 <= 2147483647 then ~SIZE~0 % 4294967296 % 4294967296 else ~SIZE~0 % 4294967296 % 4294967296 - 4294967296));call write~int(3, ~#a~0.base, ~#a~0.offset + 4 * (if (if ~SIZE~0 % 4294967296 < 0 && 0 != ~SIZE~0 % 4294967296 % 2 then 1 + ~SIZE~0 % 4294967296 / 2 else ~SIZE~0 % 4294967296 / 2) % 4294967296 % 4294967296 <= 2147483647 then (if ~SIZE~0 % 4294967296 < 0 && 0 != ~SIZE~0 % 4294967296 % 2 then 1 + ~SIZE~0 % 4294967296 / 2 else ~SIZE~0 % 4294967296 / 2) % 4294967296 % 4294967296 else (if ~SIZE~0 % 4294967296 < 0 && 0 != ~SIZE~0 % 4294967296 % 2 then 1 + ~SIZE~0 % 4294967296 / 2 else ~SIZE~0 % 4294967296 / 2) % 4294967296 % 4294967296 - 4294967296), 4); {1160#true} is VALID [2018-11-18 23:56:46,611 INFO L256 TraceCheckUtils]: 6: Hoare triple {1160#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); {1160#true} is VALID [2018-11-18 23:56:46,611 INFO L273 TraceCheckUtils]: 7: Hoare triple {1160#true} ~a.base, ~a.offset := #in~a.base, #in~a.offset;~n := #in~n;~q := #in~q;~j~0 := 0; {1160#true} is VALID [2018-11-18 23:56:46,611 INFO L273 TraceCheckUtils]: 8: Hoare triple {1160#true} assume true; {1160#true} is VALID [2018-11-18 23:56:46,612 INFO L273 TraceCheckUtils]: 9: Hoare triple {1160#true} #t~short1 := ~j~0 % 4294967296 < ~n % 4294967296; {1160#true} is VALID [2018-11-18 23:56:46,614 INFO L273 TraceCheckUtils]: 10: Hoare triple {1160#true} assume !#t~short1; {1162#(not |linear_search_#t~short1|)} is VALID [2018-11-18 23:56:46,614 INFO L273 TraceCheckUtils]: 11: Hoare triple {1162#(not |linear_search_#t~short1|)} assume !!#t~short1;havoc #t~mem0;havoc #t~short1;#t~post2 := ~j~0;~j~0 := 1 + #t~post2;havoc #t~post2; {1161#false} is VALID [2018-11-18 23:56:46,614 INFO L273 TraceCheckUtils]: 12: Hoare triple {1161#false} assume !(20 == ~j~0 % 4294967296); {1161#false} is VALID [2018-11-18 23:56:46,615 INFO L273 TraceCheckUtils]: 13: Hoare triple {1161#false} assume true; {1161#false} is VALID [2018-11-18 23:56:46,615 INFO L273 TraceCheckUtils]: 14: Hoare triple {1161#false} #t~short1 := ~j~0 % 4294967296 < ~n % 4294967296; {1161#false} is VALID [2018-11-18 23:56:46,615 INFO L273 TraceCheckUtils]: 15: Hoare triple {1161#false} assume !#t~short1; {1161#false} is VALID [2018-11-18 23:56:46,615 INFO L273 TraceCheckUtils]: 16: Hoare triple {1161#false} assume !#t~short1;havoc #t~mem0;havoc #t~short1; {1161#false} is VALID [2018-11-18 23:56:46,615 INFO L273 TraceCheckUtils]: 17: Hoare triple {1161#false} assume !(~j~0 % 4294967296 < ~SIZE~0 % 4294967296);#res := 0; {1161#false} is VALID [2018-11-18 23:56:46,616 INFO L273 TraceCheckUtils]: 18: Hoare triple {1161#false} assume true; {1161#false} is VALID [2018-11-18 23:56:46,616 INFO L268 TraceCheckUtils]: 19: Hoare quadruple {1161#false} {1160#true} #59#return; {1161#false} is VALID [2018-11-18 23:56:46,616 INFO L273 TraceCheckUtils]: 20: Hoare triple {1161#false} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {1161#false} is VALID [2018-11-18 23:56:46,616 INFO L256 TraceCheckUtils]: 21: Hoare triple {1161#false} call __VERIFIER_assert(#t~ret4); {1161#false} is VALID [2018-11-18 23:56:46,616 INFO L273 TraceCheckUtils]: 22: Hoare triple {1161#false} ~cond := #in~cond; {1161#false} is VALID [2018-11-18 23:56:46,617 INFO L273 TraceCheckUtils]: 23: Hoare triple {1161#false} assume 0 == ~cond; {1161#false} is VALID [2018-11-18 23:56:46,617 INFO L273 TraceCheckUtils]: 24: Hoare triple {1161#false} assume !false; {1161#false} is VALID [2018-11-18 23:56:46,617 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 23:56:46,618 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 23:56:46,618 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 23:56:46,618 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2018-11-18 23:56:46,618 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-18 23:56:46,618 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-18 23:56:46,644 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 25 edges. 25 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 23:56:46,644 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 23:56:46,644 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 23:56:46,645 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 23:56:46,645 INFO L87 Difference]: Start difference. First operand 33 states and 37 transitions. Second operand 3 states. [2018-11-18 23:56:46,743 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 23:56:46,743 INFO L93 Difference]: Finished difference Result 49 states and 55 transitions. [2018-11-18 23:56:46,743 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 23:56:46,743 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2018-11-18 23:56:46,743 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 23:56:46,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-18 23:56:46,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 41 transitions. [2018-11-18 23:56:46,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-18 23:56:46,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 41 transitions. [2018-11-18 23:56:46,747 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 41 transitions. [2018-11-18 23:56:46,801 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 41 edges. 41 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 23:56:46,802 INFO L225 Difference]: With dead ends: 49 [2018-11-18 23:56:46,802 INFO L226 Difference]: Without dead ends: 31 [2018-11-18 23:56:46,803 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 23:56:46,804 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2018-11-18 23:56:46,858 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2018-11-18 23:56:46,858 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-18 23:56:46,858 INFO L82 GeneralOperation]: Start isEquivalent. First operand 31 states. Second operand 31 states. [2018-11-18 23:56:46,859 INFO L74 IsIncluded]: Start isIncluded. First operand 31 states. Second operand 31 states. [2018-11-18 23:56:46,859 INFO L87 Difference]: Start difference. First operand 31 states. Second operand 31 states. [2018-11-18 23:56:46,860 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 23:56:46,861 INFO L93 Difference]: Finished difference Result 31 states and 32 transitions. [2018-11-18 23:56:46,861 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 32 transitions. [2018-11-18 23:56:46,861 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 23:56:46,861 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 23:56:46,861 INFO L74 IsIncluded]: Start isIncluded. First operand 31 states. Second operand 31 states. [2018-11-18 23:56:46,862 INFO L87 Difference]: Start difference. First operand 31 states. Second operand 31 states. [2018-11-18 23:56:46,863 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 23:56:46,863 INFO L93 Difference]: Finished difference Result 31 states and 32 transitions. [2018-11-18 23:56:46,863 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 32 transitions. [2018-11-18 23:56:46,864 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 23:56:46,864 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 23:56:46,864 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-18 23:56:46,864 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-18 23:56:46,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2018-11-18 23:56:46,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 32 transitions. [2018-11-18 23:56:46,865 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 32 transitions. Word has length 25 [2018-11-18 23:56:46,866 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 23:56:46,866 INFO L480 AbstractCegarLoop]: Abstraction has 31 states and 32 transitions. [2018-11-18 23:56:46,866 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 23:56:46,866 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 32 transitions. [2018-11-18 23:56:46,866 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-11-18 23:56:46,867 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 23:56:46,867 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 23:56:46,867 INFO L423 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 23:56:46,867 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 23:56:46,867 INFO L82 PathProgramCache]: Analyzing trace with hash -1912195402, now seen corresponding path program 1 times [2018-11-18 23:56:46,867 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 23:56:46,868 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 23:56:46,868 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 23:56:46,869 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 23:56:46,869 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 23:56:46,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 23:56:47,382 INFO L256 TraceCheckUtils]: 0: Hoare triple {1332#true} call ULTIMATE.init(); {1332#true} is VALID [2018-11-18 23:56:47,382 INFO L273 TraceCheckUtils]: 1: Hoare triple {1332#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~SIZE~0 := 0; {1332#true} is VALID [2018-11-18 23:56:47,382 INFO L273 TraceCheckUtils]: 2: Hoare triple {1332#true} assume true; {1332#true} is VALID [2018-11-18 23:56:47,382 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1332#true} {1332#true} #55#return; {1332#true} is VALID [2018-11-18 23:56:47,383 INFO L256 TraceCheckUtils]: 4: Hoare triple {1332#true} call #t~ret5 := main(); {1332#true} is VALID [2018-11-18 23:56:47,383 INFO L273 TraceCheckUtils]: 5: Hoare triple {1332#true} ~SIZE~0 := 1 + (if #t~nondet3 % 4294967296 < 0 && 0 != #t~nondet3 % 4294967296 % 2 then 1 + #t~nondet3 % 4294967296 / 2 else #t~nondet3 % 4294967296 / 2);havoc #t~nondet3;call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(4 * (if ~SIZE~0 % 4294967296 % 4294967296 <= 2147483647 then ~SIZE~0 % 4294967296 % 4294967296 else ~SIZE~0 % 4294967296 % 4294967296 - 4294967296));call write~int(3, ~#a~0.base, ~#a~0.offset + 4 * (if (if ~SIZE~0 % 4294967296 < 0 && 0 != ~SIZE~0 % 4294967296 % 2 then 1 + ~SIZE~0 % 4294967296 / 2 else ~SIZE~0 % 4294967296 / 2) % 4294967296 % 4294967296 <= 2147483647 then (if ~SIZE~0 % 4294967296 < 0 && 0 != ~SIZE~0 % 4294967296 % 2 then 1 + ~SIZE~0 % 4294967296 / 2 else ~SIZE~0 % 4294967296 / 2) % 4294967296 % 4294967296 else (if ~SIZE~0 % 4294967296 < 0 && 0 != ~SIZE~0 % 4294967296 % 2 then 1 + ~SIZE~0 % 4294967296 / 2 else ~SIZE~0 % 4294967296 / 2) % 4294967296 % 4294967296 - 4294967296), 4); {1332#true} is VALID [2018-11-18 23:56:47,383 INFO L256 TraceCheckUtils]: 6: Hoare triple {1332#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); {1332#true} is VALID [2018-11-18 23:56:47,383 INFO L273 TraceCheckUtils]: 7: Hoare triple {1332#true} ~a.base, ~a.offset := #in~a.base, #in~a.offset;~n := #in~n;~q := #in~q;~j~0 := 0; {1334#(= linear_search_~j~0 0)} is VALID [2018-11-18 23:56:47,384 INFO L273 TraceCheckUtils]: 8: Hoare triple {1334#(= linear_search_~j~0 0)} assume true; {1334#(= linear_search_~j~0 0)} is VALID [2018-11-18 23:56:47,384 INFO L273 TraceCheckUtils]: 9: Hoare triple {1334#(= linear_search_~j~0 0)} #t~short1 := ~j~0 % 4294967296 < ~n % 4294967296; {1334#(= linear_search_~j~0 0)} is VALID [2018-11-18 23:56:47,384 INFO L273 TraceCheckUtils]: 10: Hoare triple {1334#(= linear_search_~j~0 0)} assume #t~short1;call #t~mem0 := read~int(~a.base, ~a.offset + 4 * (if ~j~0 % 4294967296 % 4294967296 <= 2147483647 then ~j~0 % 4294967296 % 4294967296 else ~j~0 % 4294967296 % 4294967296 - 4294967296), 4);#t~short1 := #t~mem0 != ~q; {1334#(= linear_search_~j~0 0)} is VALID [2018-11-18 23:56:47,385 INFO L273 TraceCheckUtils]: 11: Hoare triple {1334#(= linear_search_~j~0 0)} assume !!#t~short1;havoc #t~mem0;havoc #t~short1;#t~post2 := ~j~0;~j~0 := 1 + #t~post2;havoc #t~post2; {1335#(and (<= linear_search_~j~0 1) (<= 1 linear_search_~j~0))} is VALID [2018-11-18 23:56:47,386 INFO L273 TraceCheckUtils]: 12: Hoare triple {1335#(and (<= linear_search_~j~0 1) (<= 1 linear_search_~j~0))} assume !(20 == ~j~0 % 4294967296); {1335#(and (<= linear_search_~j~0 1) (<= 1 linear_search_~j~0))} is VALID [2018-11-18 23:56:47,387 INFO L273 TraceCheckUtils]: 13: Hoare triple {1335#(and (<= linear_search_~j~0 1) (<= 1 linear_search_~j~0))} assume true; {1335#(and (<= linear_search_~j~0 1) (<= 1 linear_search_~j~0))} is VALID [2018-11-18 23:56:47,388 INFO L273 TraceCheckUtils]: 14: Hoare triple {1335#(and (<= linear_search_~j~0 1) (<= 1 linear_search_~j~0))} #t~short1 := ~j~0 % 4294967296 < ~n % 4294967296; {1335#(and (<= linear_search_~j~0 1) (<= 1 linear_search_~j~0))} is VALID [2018-11-18 23:56:47,389 INFO L273 TraceCheckUtils]: 15: Hoare triple {1335#(and (<= linear_search_~j~0 1) (<= 1 linear_search_~j~0))} assume #t~short1;call #t~mem0 := read~int(~a.base, ~a.offset + 4 * (if ~j~0 % 4294967296 % 4294967296 <= 2147483647 then ~j~0 % 4294967296 % 4294967296 else ~j~0 % 4294967296 % 4294967296 - 4294967296), 4);#t~short1 := #t~mem0 != ~q; {1335#(and (<= linear_search_~j~0 1) (<= 1 linear_search_~j~0))} is VALID [2018-11-18 23:56:47,390 INFO L273 TraceCheckUtils]: 16: Hoare triple {1335#(and (<= linear_search_~j~0 1) (<= 1 linear_search_~j~0))} assume !!#t~short1;havoc #t~mem0;havoc #t~short1;#t~post2 := ~j~0;~j~0 := 1 + #t~post2;havoc #t~post2; {1336#(and (<= linear_search_~j~0 2) (< 0 (+ (div linear_search_~j~0 4294967296) 1)))} is VALID [2018-11-18 23:56:47,391 INFO L273 TraceCheckUtils]: 17: Hoare triple {1336#(and (<= linear_search_~j~0 2) (< 0 (+ (div linear_search_~j~0 4294967296) 1)))} assume 20 == ~j~0 % 4294967296;~j~0 := -1; {1333#false} is VALID [2018-11-18 23:56:47,392 INFO L273 TraceCheckUtils]: 18: Hoare triple {1333#false} assume true; {1333#false} is VALID [2018-11-18 23:56:47,392 INFO L273 TraceCheckUtils]: 19: Hoare triple {1333#false} #t~short1 := ~j~0 % 4294967296 < ~n % 4294967296; {1333#false} is VALID [2018-11-18 23:56:47,392 INFO L273 TraceCheckUtils]: 20: Hoare triple {1333#false} assume !#t~short1; {1333#false} is VALID [2018-11-18 23:56:47,392 INFO L273 TraceCheckUtils]: 21: Hoare triple {1333#false} assume !#t~short1;havoc #t~mem0;havoc #t~short1; {1333#false} is VALID [2018-11-18 23:56:47,393 INFO L273 TraceCheckUtils]: 22: Hoare triple {1333#false} assume !(~j~0 % 4294967296 < ~SIZE~0 % 4294967296);#res := 0; {1333#false} is VALID [2018-11-18 23:56:47,393 INFO L273 TraceCheckUtils]: 23: Hoare triple {1333#false} assume true; {1333#false} is VALID [2018-11-18 23:56:47,393 INFO L268 TraceCheckUtils]: 24: Hoare quadruple {1333#false} {1332#true} #59#return; {1333#false} is VALID [2018-11-18 23:56:47,394 INFO L273 TraceCheckUtils]: 25: Hoare triple {1333#false} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {1333#false} is VALID [2018-11-18 23:56:47,394 INFO L256 TraceCheckUtils]: 26: Hoare triple {1333#false} call __VERIFIER_assert(#t~ret4); {1333#false} is VALID [2018-11-18 23:56:47,394 INFO L273 TraceCheckUtils]: 27: Hoare triple {1333#false} ~cond := #in~cond; {1333#false} is VALID [2018-11-18 23:56:47,394 INFO L273 TraceCheckUtils]: 28: Hoare triple {1333#false} assume 0 == ~cond; {1333#false} is VALID [2018-11-18 23:56:47,395 INFO L273 TraceCheckUtils]: 29: Hoare triple {1333#false} assume !false; {1333#false} is VALID [2018-11-18 23:56:47,396 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 8 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 23:56:47,396 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 23:56:47,396 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-18 23:56:47,406 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 23:56:47,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 23:56:47,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 23:56:47,463 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 23:56:47,830 INFO L256 TraceCheckUtils]: 0: Hoare triple {1332#true} call ULTIMATE.init(); {1332#true} is VALID [2018-11-18 23:56:47,830 INFO L273 TraceCheckUtils]: 1: Hoare triple {1332#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~SIZE~0 := 0; {1332#true} is VALID [2018-11-18 23:56:47,831 INFO L273 TraceCheckUtils]: 2: Hoare triple {1332#true} assume true; {1332#true} is VALID [2018-11-18 23:56:47,831 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1332#true} {1332#true} #55#return; {1332#true} is VALID [2018-11-18 23:56:47,831 INFO L256 TraceCheckUtils]: 4: Hoare triple {1332#true} call #t~ret5 := main(); {1332#true} is VALID [2018-11-18 23:56:47,831 INFO L273 TraceCheckUtils]: 5: Hoare triple {1332#true} ~SIZE~0 := 1 + (if #t~nondet3 % 4294967296 < 0 && 0 != #t~nondet3 % 4294967296 % 2 then 1 + #t~nondet3 % 4294967296 / 2 else #t~nondet3 % 4294967296 / 2);havoc #t~nondet3;call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(4 * (if ~SIZE~0 % 4294967296 % 4294967296 <= 2147483647 then ~SIZE~0 % 4294967296 % 4294967296 else ~SIZE~0 % 4294967296 % 4294967296 - 4294967296));call write~int(3, ~#a~0.base, ~#a~0.offset + 4 * (if (if ~SIZE~0 % 4294967296 < 0 && 0 != ~SIZE~0 % 4294967296 % 2 then 1 + ~SIZE~0 % 4294967296 / 2 else ~SIZE~0 % 4294967296 / 2) % 4294967296 % 4294967296 <= 2147483647 then (if ~SIZE~0 % 4294967296 < 0 && 0 != ~SIZE~0 % 4294967296 % 2 then 1 + ~SIZE~0 % 4294967296 / 2 else ~SIZE~0 % 4294967296 / 2) % 4294967296 % 4294967296 else (if ~SIZE~0 % 4294967296 < 0 && 0 != ~SIZE~0 % 4294967296 % 2 then 1 + ~SIZE~0 % 4294967296 / 2 else ~SIZE~0 % 4294967296 / 2) % 4294967296 % 4294967296 - 4294967296), 4); {1332#true} is VALID [2018-11-18 23:56:47,832 INFO L256 TraceCheckUtils]: 6: Hoare triple {1332#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); {1332#true} is VALID [2018-11-18 23:56:47,832 INFO L273 TraceCheckUtils]: 7: Hoare triple {1332#true} ~a.base, ~a.offset := #in~a.base, #in~a.offset;~n := #in~n;~q := #in~q;~j~0 := 0; {1334#(= linear_search_~j~0 0)} is VALID [2018-11-18 23:56:47,832 INFO L273 TraceCheckUtils]: 8: Hoare triple {1334#(= linear_search_~j~0 0)} assume true; {1334#(= linear_search_~j~0 0)} is VALID [2018-11-18 23:56:47,833 INFO L273 TraceCheckUtils]: 9: Hoare triple {1334#(= linear_search_~j~0 0)} #t~short1 := ~j~0 % 4294967296 < ~n % 4294967296; {1334#(= linear_search_~j~0 0)} is VALID [2018-11-18 23:56:47,833 INFO L273 TraceCheckUtils]: 10: Hoare triple {1334#(= linear_search_~j~0 0)} assume #t~short1;call #t~mem0 := read~int(~a.base, ~a.offset + 4 * (if ~j~0 % 4294967296 % 4294967296 <= 2147483647 then ~j~0 % 4294967296 % 4294967296 else ~j~0 % 4294967296 % 4294967296 - 4294967296), 4);#t~short1 := #t~mem0 != ~q; {1334#(= linear_search_~j~0 0)} is VALID [2018-11-18 23:56:47,834 INFO L273 TraceCheckUtils]: 11: Hoare triple {1334#(= linear_search_~j~0 0)} assume !!#t~short1;havoc #t~mem0;havoc #t~short1;#t~post2 := ~j~0;~j~0 := 1 + #t~post2;havoc #t~post2; {1335#(and (<= linear_search_~j~0 1) (<= 1 linear_search_~j~0))} is VALID [2018-11-18 23:56:47,836 INFO L273 TraceCheckUtils]: 12: Hoare triple {1335#(and (<= linear_search_~j~0 1) (<= 1 linear_search_~j~0))} assume !(20 == ~j~0 % 4294967296); {1335#(and (<= linear_search_~j~0 1) (<= 1 linear_search_~j~0))} is VALID [2018-11-18 23:56:47,836 INFO L273 TraceCheckUtils]: 13: Hoare triple {1335#(and (<= linear_search_~j~0 1) (<= 1 linear_search_~j~0))} assume true; {1335#(and (<= linear_search_~j~0 1) (<= 1 linear_search_~j~0))} is VALID [2018-11-18 23:56:47,837 INFO L273 TraceCheckUtils]: 14: Hoare triple {1335#(and (<= linear_search_~j~0 1) (<= 1 linear_search_~j~0))} #t~short1 := ~j~0 % 4294967296 < ~n % 4294967296; {1335#(and (<= linear_search_~j~0 1) (<= 1 linear_search_~j~0))} is VALID [2018-11-18 23:56:47,838 INFO L273 TraceCheckUtils]: 15: Hoare triple {1335#(and (<= linear_search_~j~0 1) (<= 1 linear_search_~j~0))} assume #t~short1;call #t~mem0 := read~int(~a.base, ~a.offset + 4 * (if ~j~0 % 4294967296 % 4294967296 <= 2147483647 then ~j~0 % 4294967296 % 4294967296 else ~j~0 % 4294967296 % 4294967296 - 4294967296), 4);#t~short1 := #t~mem0 != ~q; {1335#(and (<= linear_search_~j~0 1) (<= 1 linear_search_~j~0))} is VALID [2018-11-18 23:56:47,839 INFO L273 TraceCheckUtils]: 16: Hoare triple {1335#(and (<= linear_search_~j~0 1) (<= 1 linear_search_~j~0))} assume !!#t~short1;havoc #t~mem0;havoc #t~short1;#t~post2 := ~j~0;~j~0 := 1 + #t~post2;havoc #t~post2; {1388#(and (<= 2 linear_search_~j~0) (<= linear_search_~j~0 2))} is VALID [2018-11-18 23:56:47,842 INFO L273 TraceCheckUtils]: 17: Hoare triple {1388#(and (<= 2 linear_search_~j~0) (<= linear_search_~j~0 2))} assume 20 == ~j~0 % 4294967296;~j~0 := -1; {1333#false} is VALID [2018-11-18 23:56:47,842 INFO L273 TraceCheckUtils]: 18: Hoare triple {1333#false} assume true; {1333#false} is VALID [2018-11-18 23:56:47,843 INFO L273 TraceCheckUtils]: 19: Hoare triple {1333#false} #t~short1 := ~j~0 % 4294967296 < ~n % 4294967296; {1333#false} is VALID [2018-11-18 23:56:47,843 INFO L273 TraceCheckUtils]: 20: Hoare triple {1333#false} assume !#t~short1; {1333#false} is VALID [2018-11-18 23:56:47,843 INFO L273 TraceCheckUtils]: 21: Hoare triple {1333#false} assume !#t~short1;havoc #t~mem0;havoc #t~short1; {1333#false} is VALID [2018-11-18 23:56:47,843 INFO L273 TraceCheckUtils]: 22: Hoare triple {1333#false} assume !(~j~0 % 4294967296 < ~SIZE~0 % 4294967296);#res := 0; {1333#false} is VALID [2018-11-18 23:56:47,844 INFO L273 TraceCheckUtils]: 23: Hoare triple {1333#false} assume true; {1333#false} is VALID [2018-11-18 23:56:47,844 INFO L268 TraceCheckUtils]: 24: Hoare quadruple {1333#false} {1332#true} #59#return; {1333#false} is VALID [2018-11-18 23:56:47,844 INFO L273 TraceCheckUtils]: 25: Hoare triple {1333#false} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {1333#false} is VALID [2018-11-18 23:56:47,844 INFO L256 TraceCheckUtils]: 26: Hoare triple {1333#false} call __VERIFIER_assert(#t~ret4); {1333#false} is VALID [2018-11-18 23:56:47,844 INFO L273 TraceCheckUtils]: 27: Hoare triple {1333#false} ~cond := #in~cond; {1333#false} is VALID [2018-11-18 23:56:47,845 INFO L273 TraceCheckUtils]: 28: Hoare triple {1333#false} assume 0 == ~cond; {1333#false} is VALID [2018-11-18 23:56:47,845 INFO L273 TraceCheckUtils]: 29: Hoare triple {1333#false} assume !false; {1333#false} is VALID [2018-11-18 23:56:47,846 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 8 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 23:56:47,876 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-18 23:56:47,876 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 6 [2018-11-18 23:56:47,877 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 30 [2018-11-18 23:56:47,877 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-18 23:56:47,877 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2018-11-18 23:56:47,919 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-18 23:56:47,919 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-18 23:56:47,919 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-18 23:56:47,919 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-11-18 23:56:47,920 INFO L87 Difference]: Start difference. First operand 31 states and 32 transitions. Second operand 6 states. [2018-11-18 23:56:48,198 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 23:56:48,198 INFO L93 Difference]: Finished difference Result 56 states and 60 transitions. [2018-11-18 23:56:48,198 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-18 23:56:48,199 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 30 [2018-11-18 23:56:48,199 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 23:56:48,199 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-18 23:56:48,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 60 transitions. [2018-11-18 23:56:48,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-18 23:56:48,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 60 transitions. [2018-11-18 23:56:48,203 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 60 transitions. [2018-11-18 23:56:48,316 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 60 edges. 60 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 23:56:48,318 INFO L225 Difference]: With dead ends: 56 [2018-11-18 23:56:48,319 INFO L226 Difference]: Without dead ends: 41 [2018-11-18 23:56:48,320 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 29 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-11-18 23:56:48,320 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2018-11-18 23:56:48,392 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 33. [2018-11-18 23:56:48,393 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-18 23:56:48,393 INFO L82 GeneralOperation]: Start isEquivalent. First operand 41 states. Second operand 33 states. [2018-11-18 23:56:48,393 INFO L74 IsIncluded]: Start isIncluded. First operand 41 states. Second operand 33 states. [2018-11-18 23:56:48,393 INFO L87 Difference]: Start difference. First operand 41 states. Second operand 33 states. [2018-11-18 23:56:48,396 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 23:56:48,396 INFO L93 Difference]: Finished difference Result 41 states and 43 transitions. [2018-11-18 23:56:48,396 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 43 transitions. [2018-11-18 23:56:48,397 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 23:56:48,397 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 23:56:48,397 INFO L74 IsIncluded]: Start isIncluded. First operand 33 states. Second operand 41 states. [2018-11-18 23:56:48,398 INFO L87 Difference]: Start difference. First operand 33 states. Second operand 41 states. [2018-11-18 23:56:48,399 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 23:56:48,400 INFO L93 Difference]: Finished difference Result 41 states and 43 transitions. [2018-11-18 23:56:48,400 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 43 transitions. [2018-11-18 23:56:48,400 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 23:56:48,400 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 23:56:48,401 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-18 23:56:48,401 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-18 23:56:48,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2018-11-18 23:56:48,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 34 transitions. [2018-11-18 23:56:48,403 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 34 transitions. Word has length 30 [2018-11-18 23:56:48,403 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 23:56:48,403 INFO L480 AbstractCegarLoop]: Abstraction has 33 states and 34 transitions. [2018-11-18 23:56:48,403 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-18 23:56:48,403 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 34 transitions. [2018-11-18 23:56:48,404 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-11-18 23:56:48,404 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 23:56:48,404 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 23:56:48,404 INFO L423 AbstractCegarLoop]: === Iteration 9 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 23:56:48,405 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 23:56:48,405 INFO L82 PathProgramCache]: Analyzing trace with hash 1795965880, now seen corresponding path program 2 times [2018-11-18 23:56:48,405 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 23:56:48,405 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 23:56:48,406 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 23:56:48,406 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 23:56:48,406 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 23:56:48,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 23:56:49,863 WARN L180 SmtUtils]: Spent 413.00 ms on a formula simplification. DAG size of input: 219 DAG size of output: 33 [2018-11-18 23:56:50,588 WARN L180 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 41 [2018-11-18 23:56:50,858 FATAL L292 ToolchainWalker]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.AssertionError: must not be argument of unary minus + at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.UltimateNormalFormUtils.rootRespectsUltimateNormalForm(UltimateNormalFormUtils.java:115) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.UltimateNormalFormUtils.rootRespectsUltimateNormalForm(UltimateNormalFormUtils.java:131) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.UltimateNormalFormUtils.lambda$0(UltimateNormalFormUtils.java:154) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.SubtermPropertyChecker$MyWalker.walk(SubtermPropertyChecker.java:63) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive.run(NonRecursive.java:122) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive.run(NonRecursive.java:113) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.SubtermPropertyChecker.isPropertySatisfied(SubtermPropertyChecker.java:121) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.UltimateNormalFormUtils.respectsUltimateNormalForm(UltimateNormalFormUtils.java:155) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.predicates.BasicPredicateFactory.newPredicate(BasicPredicateFactory.java:103) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.predicates.PredicateUnifier.constructNewPredicate(PredicateUnifier.java:375) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate(PredicateUnifier.java:361) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate(PredicateUnifier.java:299) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.NestedInterpolantsBuilder.computePredicates(NestedInterpolantsBuilder.java:592) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.NestedInterpolantsBuilder.(NestedInterpolantsBuilder.java:170) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.InterpolatingTraceCheckCraig.computeInterpolantsTree(InterpolatingTraceCheckCraig.java:271) 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-18 23:56:50,864 INFO L168 Benchmark]: Toolchain (without parser) took 24336.89 ms. Allocated memory was 1.5 GB in the beginning and 2.6 GB in the end (delta: 1.1 GB). Free memory was 1.4 GB in the beginning and 2.4 GB in the end (delta: -1.0 GB). Peak memory consumption was 26.7 MB. Max. memory is 7.1 GB. [2018-11-18 23:56:50,865 INFO L168 Benchmark]: CDTParser took 0.31 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-18 23:56:50,865 INFO L168 Benchmark]: CACSL2BoogieTranslator took 388.51 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-18 23:56:50,868 INFO L168 Benchmark]: Boogie Preprocessor took 42.67 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-18 23:56:50,868 INFO L168 Benchmark]: RCFGBuilder took 770.14 ms. Allocated memory was 1.5 GB in the beginning and 2.2 GB in the end (delta: 711.5 MB). Free memory was 1.4 GB in the beginning and 2.1 GB in the end (delta: -747.7 MB). Peak memory consumption was 26.3 MB. Max. memory is 7.1 GB. [2018-11-18 23:56:50,869 INFO L168 Benchmark]: TraceAbstraction took 23130.18 ms. Allocated memory was 2.2 GB in the beginning and 2.6 GB in the end (delta: 350.2 MB). Free memory was 2.1 GB in the beginning and 2.4 GB in the end (delta: -297.9 MB). Peak memory consumption was 52.3 MB. Max. memory is 7.1 GB. [2018-11-18 23:56:50,873 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.31 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. * CACSL2BoogieTranslator took 388.51 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.67 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 770.14 ms. Allocated memory was 1.5 GB in the beginning and 2.2 GB in the end (delta: 711.5 MB). Free memory was 1.4 GB in the beginning and 2.1 GB in the end (delta: -747.7 MB). Peak memory consumption was 26.3 MB. Max. memory is 7.1 GB. * TraceAbstraction took 23130.18 ms. Allocated memory was 2.2 GB in the beginning and 2.6 GB in the end (delta: 350.2 MB). Free memory was 2.1 GB in the beginning and 2.4 GB in the end (delta: -297.9 MB). Peak memory consumption was 52.3 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: AssertionError: must not be argument of unary minus + de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: AssertionError: must not be argument of unary minus +: de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.UltimateNormalFormUtils.rootRespectsUltimateNormalForm(UltimateNormalFormUtils.java:115) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request...