java -ea -Xmx8000000000 -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc ../../../trunk/examples/toolchains/AutomizerCInline_WitnessPrinter.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/loops/linear_search_false-unreach-call.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-61f4311 [2018-11-23 13:02:07,705 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-23 13:02:07,707 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-23 13:02:07,725 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-23 13:02:07,725 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-23 13:02:07,726 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-23 13:02:07,728 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-23 13:02:07,730 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-23 13:02:07,732 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-23 13:02:07,733 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-23 13:02:07,734 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-23 13:02:07,734 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-23 13:02:07,735 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-23 13:02:07,736 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-23 13:02:07,737 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-23 13:02:07,738 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-23 13:02:07,739 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-23 13:02:07,741 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-23 13:02:07,743 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-23 13:02:07,745 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-23 13:02:07,746 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-23 13:02:07,747 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-23 13:02:07,750 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-23 13:02:07,750 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-23 13:02:07,750 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-23 13:02:07,751 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-23 13:02:07,753 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-23 13:02:07,753 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-23 13:02:07,754 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-23 13:02:07,755 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-23 13:02:07,756 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-23 13:02:07,756 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-23 13:02:07,757 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-23 13:02:07,757 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-23 13:02:07,758 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-23 13:02:07,759 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-23 13:02:07,759 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2018-11-23 13:02:07,782 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-23 13:02:07,783 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-23 13:02:07,784 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-23 13:02:07,784 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-11-23 13:02:07,784 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-23 13:02:07,787 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-23 13:02:07,788 INFO L133 SettingsManager]: * Use SBE=true [2018-11-23 13:02:07,788 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-23 13:02:07,788 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-23 13:02:07,788 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-23 13:02:07,788 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-23 13:02:07,788 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-23 13:02:07,789 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-23 13:02:07,789 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-23 13:02:07,789 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-23 13:02:07,789 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-23 13:02:07,789 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-23 13:02:07,789 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-23 13:02:07,790 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-23 13:02:07,790 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-23 13:02:07,790 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-23 13:02:07,790 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-23 13:02:07,790 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-23 13:02:07,791 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-23 13:02:07,791 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-23 13:02:07,791 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-23 13:02:07,791 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-23 13:02:07,791 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-23 13:02:07,792 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-23 13:02:07,792 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-23 13:02:07,792 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-23 13:02:07,846 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-23 13:02:07,863 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-23 13:02:07,866 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-23 13:02:07,868 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-23 13:02:07,868 INFO L276 PluginConnector]: CDTParser initialized [2018-11-23 13:02:07,869 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-23 13:02:07,937 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/28e25bc96/7f1fe97ac8334ae0ab4468e4e13dd37e/FLAG23d09bc74 [2018-11-23 13:02:08,365 INFO L307 CDTParser]: Found 1 translation units. [2018-11-23 13:02:08,366 INFO L161 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loops/linear_search_false-unreach-call.i [2018-11-23 13:02:08,372 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/28e25bc96/7f1fe97ac8334ae0ab4468e4e13dd37e/FLAG23d09bc74 [2018-11-23 13:02:08,738 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/28e25bc96/7f1fe97ac8334ae0ab4468e4e13dd37e [2018-11-23 13:02:08,748 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-23 13:02:08,750 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-23 13:02:08,751 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-23 13:02:08,751 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-23 13:02:08,755 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-23 13:02:08,758 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 01:02:08" (1/1) ... [2018-11-23 13:02:08,761 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5b45830f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:02:08, skipping insertion in model container [2018-11-23 13:02:08,761 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 01:02:08" (1/1) ... [2018-11-23 13:02:08,772 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-23 13:02:08,795 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-23 13:02:09,063 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 13:02:09,076 INFO L191 MainTranslator]: Completed pre-run [2018-11-23 13:02:09,100 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 13:02:09,119 INFO L195 MainTranslator]: Completed translation [2018-11-23 13:02:09,119 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:02:09 WrapperNode [2018-11-23 13:02:09,120 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-23 13:02:09,121 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-23 13:02:09,121 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-23 13:02:09,121 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-23 13:02:09,131 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:02:09" (1/1) ... [2018-11-23 13:02:09,141 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:02:09" (1/1) ... [2018-11-23 13:02:09,149 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-23 13:02:09,150 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-23 13:02:09,150 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-23 13:02:09,150 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-23 13:02:09,161 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:02:09" (1/1) ... [2018-11-23 13:02:09,162 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:02:09" (1/1) ... [2018-11-23 13:02:09,164 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:02:09" (1/1) ... [2018-11-23 13:02:09,164 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:02:09" (1/1) ... [2018-11-23 13:02:09,174 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:02:09" (1/1) ... [2018-11-23 13:02:09,180 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:02:09" (1/1) ... [2018-11-23 13:02:09,182 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:02:09" (1/1) ... [2018-11-23 13:02:09,184 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-23 13:02:09,185 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-23 13:02:09,185 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-23 13:02:09,185 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-23 13:02:09,186 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:02:09" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-23 13:02:09,310 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-23 13:02:09,311 INFO L130 BoogieDeclarations]: Found specification of procedure linear_search [2018-11-23 13:02:09,311 INFO L138 BoogieDeclarations]: Found implementation of procedure linear_search [2018-11-23 13:02:09,311 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-23 13:02:09,311 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-23 13:02:09,311 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-23 13:02:09,312 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-23 13:02:09,312 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-23 13:02:09,312 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-23 13:02:09,312 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-23 13:02:09,312 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-23 13:02:09,313 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2018-11-23 13:02:09,313 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2018-11-23 13:02:09,313 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-23 13:02:09,887 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-23 13:02:09,887 INFO L280 CfgBuilder]: Removed 1 assue(true) statements. [2018-11-23 13:02:09,887 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 01:02:09 BoogieIcfgContainer [2018-11-23 13:02:09,888 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-23 13:02:09,889 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-23 13:02:09,889 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-23 13:02:09,891 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-23 13:02:09,892 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 01:02:08" (1/3) ... [2018-11-23 13:02:09,893 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@da8b2ec and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 01:02:09, skipping insertion in model container [2018-11-23 13:02:09,893 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:02:09" (2/3) ... [2018-11-23 13:02:09,893 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@da8b2ec and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 01:02:09, skipping insertion in model container [2018-11-23 13:02:09,893 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 01:02:09" (3/3) ... [2018-11-23 13:02:09,895 INFO L112 eAbstractionObserver]: Analyzing ICFG linear_search_false-unreach-call.i [2018-11-23 13:02:09,905 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-23 13:02:09,913 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-23 13:02:09,932 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-23 13:02:09,966 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-23 13:02:09,967 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-23 13:02:09,967 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-23 13:02:09,967 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-23 13:02:09,968 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-23 13:02:09,968 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-23 13:02:09,968 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-23 13:02:09,968 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-23 13:02:09,968 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-23 13:02:09,987 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states. [2018-11-23 13:02:09,993 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-11-23 13:02:09,993 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:02:09,994 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:02:09,997 INFO L423 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:02:10,002 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:02:10,003 INFO L82 PathProgramCache]: Analyzing trace with hash -35896702, now seen corresponding path program 1 times [2018-11-23 13:02:10,004 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:02:10,005 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:02:10,053 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:02:10,054 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:02:10,054 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:02:10,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:02:10,230 INFO L256 TraceCheckUtils]: 0: Hoare triple {31#true} call ULTIMATE.init(); {31#true} is VALID [2018-11-23 13:02:10,234 INFO L273 TraceCheckUtils]: 1: Hoare triple {31#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~SIZE~0 := 0; {31#true} is VALID [2018-11-23 13:02:10,235 INFO L273 TraceCheckUtils]: 2: Hoare triple {31#true} assume true; {31#true} is VALID [2018-11-23 13:02:10,236 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {31#true} {31#true} #54#return; {31#true} is VALID [2018-11-23 13:02:10,236 INFO L256 TraceCheckUtils]: 4: Hoare triple {31#true} call #t~ret5 := main(); {31#true} is VALID [2018-11-23 13:02:10,237 INFO L273 TraceCheckUtils]: 5: Hoare triple {31#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); {31#true} is VALID [2018-11-23 13:02:10,237 INFO L256 TraceCheckUtils]: 6: Hoare triple {31#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); {31#true} is VALID [2018-11-23 13:02:10,238 INFO L273 TraceCheckUtils]: 7: Hoare triple {31#true} ~a.base, ~a.offset := #in~a.base, #in~a.offset;~n := #in~n;~q := #in~q;~j~0 := 0; {31#true} is VALID [2018-11-23 13:02:10,244 INFO L273 TraceCheckUtils]: 8: Hoare triple {31#true} assume !true; {32#false} is VALID [2018-11-23 13:02:10,244 INFO L273 TraceCheckUtils]: 9: Hoare triple {32#false} assume ~j~0 % 4294967296 < ~SIZE~0 % 4294967296;#res := 1; {32#false} is VALID [2018-11-23 13:02:10,245 INFO L273 TraceCheckUtils]: 10: Hoare triple {32#false} assume true; {32#false} is VALID [2018-11-23 13:02:10,245 INFO L268 TraceCheckUtils]: 11: Hoare quadruple {32#false} {31#true} #58#return; {32#false} is VALID [2018-11-23 13:02:10,245 INFO L273 TraceCheckUtils]: 12: Hoare triple {32#false} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {32#false} is VALID [2018-11-23 13:02:10,246 INFO L256 TraceCheckUtils]: 13: Hoare triple {32#false} call __VERIFIER_assert(#t~ret4); {32#false} is VALID [2018-11-23 13:02:10,246 INFO L273 TraceCheckUtils]: 14: Hoare triple {32#false} ~cond := #in~cond; {32#false} is VALID [2018-11-23 13:02:10,247 INFO L273 TraceCheckUtils]: 15: Hoare triple {32#false} assume 0 == ~cond; {32#false} is VALID [2018-11-23 13:02:10,247 INFO L273 TraceCheckUtils]: 16: Hoare triple {32#false} assume !false; {32#false} is VALID [2018-11-23 13:02:10,251 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:02:10,254 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 13:02:10,254 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-23 13:02:10,261 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 17 [2018-11-23 13:02:10,264 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 13:02:10,268 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states. [2018-11-23 13:02:10,415 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-23 13:02:10,415 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-11-23 13:02:10,423 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-23 13:02:10,424 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-23 13:02:10,426 INFO L87 Difference]: Start difference. First operand 28 states. Second operand 2 states. [2018-11-23 13:02:10,812 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:02:10,813 INFO L93 Difference]: Finished difference Result 44 states and 51 transitions. [2018-11-23 13:02:10,813 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-23 13:02:10,813 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 17 [2018-11-23 13:02:10,813 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:02:10,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-23 13:02:10,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 51 transitions. [2018-11-23 13:02:10,826 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-23 13:02:10,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 51 transitions. [2018-11-23 13:02:10,831 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 51 transitions. [2018-11-23 13:02:11,096 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 51 edges. 51 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:02:11,107 INFO L225 Difference]: With dead ends: 44 [2018-11-23 13:02:11,107 INFO L226 Difference]: Without dead ends: 21 [2018-11-23 13:02:11,113 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-23 13:02:11,134 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2018-11-23 13:02:11,165 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2018-11-23 13:02:11,165 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 13:02:11,166 INFO L82 GeneralOperation]: Start isEquivalent. First operand 21 states. Second operand 21 states. [2018-11-23 13:02:11,166 INFO L74 IsIncluded]: Start isIncluded. First operand 21 states. Second operand 21 states. [2018-11-23 13:02:11,166 INFO L87 Difference]: Start difference. First operand 21 states. Second operand 21 states. [2018-11-23 13:02:11,171 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:02:11,171 INFO L93 Difference]: Finished difference Result 21 states and 24 transitions. [2018-11-23 13:02:11,172 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 24 transitions. [2018-11-23 13:02:11,172 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:02:11,172 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:02:11,173 INFO L74 IsIncluded]: Start isIncluded. First operand 21 states. Second operand 21 states. [2018-11-23 13:02:11,173 INFO L87 Difference]: Start difference. First operand 21 states. Second operand 21 states. [2018-11-23 13:02:11,177 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:02:11,177 INFO L93 Difference]: Finished difference Result 21 states and 24 transitions. [2018-11-23 13:02:11,177 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 24 transitions. [2018-11-23 13:02:11,178 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:02:11,178 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:02:11,178 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 13:02:11,179 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 13:02:11,179 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2018-11-23 13:02:11,181 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 24 transitions. [2018-11-23 13:02:11,183 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 24 transitions. Word has length 17 [2018-11-23 13:02:11,184 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:02:11,184 INFO L480 AbstractCegarLoop]: Abstraction has 21 states and 24 transitions. [2018-11-23 13:02:11,184 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-11-23 13:02:11,184 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 24 transitions. [2018-11-23 13:02:11,185 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-11-23 13:02:11,185 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:02:11,185 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:02:11,186 INFO L423 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:02:11,186 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:02:11,186 INFO L82 PathProgramCache]: Analyzing trace with hash -1151558539, now seen corresponding path program 1 times [2018-11-23 13:02:11,187 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:02:11,187 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:02:11,188 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:02:11,188 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:02:11,188 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:02:11,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:02:11,517 INFO L256 TraceCheckUtils]: 0: Hoare triple {162#true} call ULTIMATE.init(); {162#true} is VALID [2018-11-23 13:02:11,517 INFO L273 TraceCheckUtils]: 1: Hoare triple {162#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~SIZE~0 := 0; {162#true} is VALID [2018-11-23 13:02:11,517 INFO L273 TraceCheckUtils]: 2: Hoare triple {162#true} assume true; {162#true} is VALID [2018-11-23 13:02:11,518 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {162#true} {162#true} #54#return; {162#true} is VALID [2018-11-23 13:02:11,518 INFO L256 TraceCheckUtils]: 4: Hoare triple {162#true} call #t~ret5 := main(); {162#true} is VALID [2018-11-23 13:02:11,518 INFO L273 TraceCheckUtils]: 5: Hoare triple {162#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); {162#true} is VALID [2018-11-23 13:02:11,519 INFO L256 TraceCheckUtils]: 6: Hoare triple {162#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); {162#true} is VALID [2018-11-23 13:02:11,519 INFO L273 TraceCheckUtils]: 7: Hoare triple {162#true} ~a.base, ~a.offset := #in~a.base, #in~a.offset;~n := #in~n;~q := #in~q;~j~0 := 0; {162#true} is VALID [2018-11-23 13:02:11,519 INFO L273 TraceCheckUtils]: 8: Hoare triple {162#true} #t~short1 := ~j~0 % 4294967296 < ~n % 4294967296; {162#true} is VALID [2018-11-23 13:02:11,520 INFO L273 TraceCheckUtils]: 9: Hoare triple {162#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; {162#true} is VALID [2018-11-23 13:02:11,520 INFO L273 TraceCheckUtils]: 10: Hoare triple {162#true} assume !#t~short1;havoc #t~short1;havoc #t~mem0; {162#true} is VALID [2018-11-23 13:02:11,524 INFO L273 TraceCheckUtils]: 11: Hoare triple {162#true} assume ~j~0 % 4294967296 < ~SIZE~0 % 4294967296;#res := 1; {164#(= 1 |linear_search_#res|)} is VALID [2018-11-23 13:02:11,525 INFO L273 TraceCheckUtils]: 12: Hoare triple {164#(= 1 |linear_search_#res|)} assume true; {164#(= 1 |linear_search_#res|)} is VALID [2018-11-23 13:02:11,527 INFO L268 TraceCheckUtils]: 13: Hoare quadruple {164#(= 1 |linear_search_#res|)} {162#true} #58#return; {165#(= 1 |main_#t~ret4|)} is VALID [2018-11-23 13:02:11,528 INFO L273 TraceCheckUtils]: 14: Hoare triple {165#(= 1 |main_#t~ret4|)} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {165#(= 1 |main_#t~ret4|)} is VALID [2018-11-23 13:02:11,530 INFO L256 TraceCheckUtils]: 15: Hoare triple {165#(= 1 |main_#t~ret4|)} call __VERIFIER_assert(#t~ret4); {166#(= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2018-11-23 13:02:11,531 INFO L273 TraceCheckUtils]: 16: Hoare triple {166#(= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {167#(= 1 __VERIFIER_assert_~cond)} is VALID [2018-11-23 13:02:11,531 INFO L273 TraceCheckUtils]: 17: Hoare triple {167#(= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {163#false} is VALID [2018-11-23 13:02:11,532 INFO L273 TraceCheckUtils]: 18: Hoare triple {163#false} assume !false; {163#false} is VALID [2018-11-23 13:02:11,535 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:02:11,536 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 13:02:11,536 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-23 13:02:11,538 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 19 [2018-11-23 13:02:11,538 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 13:02:11,538 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2018-11-23 13:02:11,634 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 19 edges. 19 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:02:11,634 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-23 13:02:11,634 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-23 13:02:11,635 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-11-23 13:02:11,635 INFO L87 Difference]: Start difference. First operand 21 states and 24 transitions. Second operand 6 states. [2018-11-23 13:02:12,292 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:02:12,292 INFO L93 Difference]: Finished difference Result 29 states and 31 transitions. [2018-11-23 13:02:12,293 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-23 13:02:12,293 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 19 [2018-11-23 13:02:12,293 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:02:12,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-23 13:02:12,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 31 transitions. [2018-11-23 13:02:12,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-23 13:02:12,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 31 transitions. [2018-11-23 13:02:12,299 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 31 transitions. [2018-11-23 13:02:12,376 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 31 edges. 31 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:02:12,379 INFO L225 Difference]: With dead ends: 29 [2018-11-23 13:02:12,379 INFO L226 Difference]: Without dead ends: 21 [2018-11-23 13:02:12,380 INFO L631 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-23 13:02:12,381 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2018-11-23 13:02:12,389 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2018-11-23 13:02:12,389 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 13:02:12,389 INFO L82 GeneralOperation]: Start isEquivalent. First operand 21 states. Second operand 21 states. [2018-11-23 13:02:12,390 INFO L74 IsIncluded]: Start isIncluded. First operand 21 states. Second operand 21 states. [2018-11-23 13:02:12,390 INFO L87 Difference]: Start difference. First operand 21 states. Second operand 21 states. [2018-11-23 13:02:12,393 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:02:12,393 INFO L93 Difference]: Finished difference Result 21 states and 23 transitions. [2018-11-23 13:02:12,393 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 23 transitions. [2018-11-23 13:02:12,394 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:02:12,394 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:02:12,394 INFO L74 IsIncluded]: Start isIncluded. First operand 21 states. Second operand 21 states. [2018-11-23 13:02:12,394 INFO L87 Difference]: Start difference. First operand 21 states. Second operand 21 states. [2018-11-23 13:02:12,397 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:02:12,397 INFO L93 Difference]: Finished difference Result 21 states and 23 transitions. [2018-11-23 13:02:12,397 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 23 transitions. [2018-11-23 13:02:12,398 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:02:12,398 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:02:12,398 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 13:02:12,398 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 13:02:12,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2018-11-23 13:02:12,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 23 transitions. [2018-11-23 13:02:12,401 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 23 transitions. Word has length 19 [2018-11-23 13:02:12,401 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:02:12,401 INFO L480 AbstractCegarLoop]: Abstraction has 21 states and 23 transitions. [2018-11-23 13:02:12,401 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-23 13:02:12,401 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 23 transitions. [2018-11-23 13:02:12,402 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-11-23 13:02:12,402 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:02:12,402 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:02:12,403 INFO L423 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:02:12,403 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:02:12,403 INFO L82 PathProgramCache]: Analyzing trace with hash 591251796, now seen corresponding path program 1 times [2018-11-23 13:02:12,403 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:02:12,404 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:02:12,405 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:02:12,405 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:02:12,405 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:02:12,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:02:12,977 WARN L180 SmtUtils]: Spent 198.00 ms on a formula simplification. DAG size of input: 10 DAG size of output: 8 [2018-11-23 13:02:13,551 INFO L256 TraceCheckUtils]: 0: Hoare triple {284#true} call ULTIMATE.init(); {284#true} is VALID [2018-11-23 13:02:13,551 INFO L273 TraceCheckUtils]: 1: Hoare triple {284#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~SIZE~0 := 0; {284#true} is VALID [2018-11-23 13:02:13,551 INFO L273 TraceCheckUtils]: 2: Hoare triple {284#true} assume true; {284#true} is VALID [2018-11-23 13:02:13,552 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {284#true} {284#true} #54#return; {284#true} is VALID [2018-11-23 13:02:13,552 INFO L256 TraceCheckUtils]: 4: Hoare triple {284#true} call #t~ret5 := main(); {284#true} is VALID [2018-11-23 13:02:13,555 INFO L273 TraceCheckUtils]: 5: Hoare triple {284#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); {286#(and (<= (div ~SIZE~0 4294967296) 0) (<= 1 ~SIZE~0))} is VALID [2018-11-23 13:02:13,555 INFO L256 TraceCheckUtils]: 6: Hoare triple {286#(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); {284#true} is VALID [2018-11-23 13:02:13,556 INFO L273 TraceCheckUtils]: 7: Hoare triple {284#true} ~a.base, ~a.offset := #in~a.base, #in~a.offset;~n := #in~n;~q := #in~q;~j~0 := 0; {287#(= linear_search_~j~0 0)} is VALID [2018-11-23 13:02:13,556 INFO L273 TraceCheckUtils]: 8: Hoare triple {287#(= linear_search_~j~0 0)} #t~short1 := ~j~0 % 4294967296 < ~n % 4294967296; {287#(= linear_search_~j~0 0)} is VALID [2018-11-23 13:02:13,557 INFO L273 TraceCheckUtils]: 9: Hoare triple {287#(= 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; {287#(= linear_search_~j~0 0)} is VALID [2018-11-23 13:02:13,557 INFO L273 TraceCheckUtils]: 10: Hoare triple {287#(= linear_search_~j~0 0)} assume !#t~short1;havoc #t~short1;havoc #t~mem0; {287#(= linear_search_~j~0 0)} is VALID [2018-11-23 13:02:13,558 INFO L273 TraceCheckUtils]: 11: Hoare triple {287#(= linear_search_~j~0 0)} assume !(~j~0 % 4294967296 < ~SIZE~0 % 4294967296);#res := 0; {288#(or (< 0 (div ~SIZE~0 4294967296)) (<= ~SIZE~0 (* 4294967296 (div ~SIZE~0 4294967296))))} is VALID [2018-11-23 13:02:13,569 INFO L273 TraceCheckUtils]: 12: Hoare triple {288#(or (< 0 (div ~SIZE~0 4294967296)) (<= ~SIZE~0 (* 4294967296 (div ~SIZE~0 4294967296))))} assume true; {288#(or (< 0 (div ~SIZE~0 4294967296)) (<= ~SIZE~0 (* 4294967296 (div ~SIZE~0 4294967296))))} is VALID [2018-11-23 13:02:13,571 INFO L268 TraceCheckUtils]: 13: Hoare quadruple {288#(or (< 0 (div ~SIZE~0 4294967296)) (<= ~SIZE~0 (* 4294967296 (div ~SIZE~0 4294967296))))} {286#(and (<= (div ~SIZE~0 4294967296) 0) (<= 1 ~SIZE~0))} #58#return; {285#false} is VALID [2018-11-23 13:02:13,571 INFO L273 TraceCheckUtils]: 14: Hoare triple {285#false} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {285#false} is VALID [2018-11-23 13:02:13,572 INFO L256 TraceCheckUtils]: 15: Hoare triple {285#false} call __VERIFIER_assert(#t~ret4); {285#false} is VALID [2018-11-23 13:02:13,572 INFO L273 TraceCheckUtils]: 16: Hoare triple {285#false} ~cond := #in~cond; {285#false} is VALID [2018-11-23 13:02:13,573 INFO L273 TraceCheckUtils]: 17: Hoare triple {285#false} assume 0 == ~cond; {285#false} is VALID [2018-11-23 13:02:13,573 INFO L273 TraceCheckUtils]: 18: Hoare triple {285#false} assume !false; {285#false} is VALID [2018-11-23 13:02:13,574 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:02:13,574 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 13:02:13,575 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-23 13:02:13,575 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 19 [2018-11-23 13:02:13,576 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 13:02:13,576 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2018-11-23 13:02:13,641 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 19 edges. 19 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:02:13,642 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-23 13:02:13,642 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-23 13:02:13,642 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-23 13:02:13,643 INFO L87 Difference]: Start difference. First operand 21 states and 23 transitions. Second operand 5 states. [2018-11-23 13:02:13,892 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:02:13,893 INFO L93 Difference]: Finished difference Result 33 states and 36 transitions. [2018-11-23 13:02:13,893 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-23 13:02:13,893 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 19 [2018-11-23 13:02:13,893 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:02:13,894 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-23 13:02:13,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 36 transitions. [2018-11-23 13:02:13,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-23 13:02:13,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 36 transitions. [2018-11-23 13:02:13,900 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 36 transitions. [2018-11-23 13:02:13,994 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 36 edges. 36 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:02:13,996 INFO L225 Difference]: With dead ends: 33 [2018-11-23 13:02:13,996 INFO L226 Difference]: Without dead ends: 24 [2018-11-23 13:02:13,997 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-11-23 13:02:13,997 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2018-11-23 13:02:14,020 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2018-11-23 13:02:14,021 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 13:02:14,021 INFO L82 GeneralOperation]: Start isEquivalent. First operand 24 states. Second operand 24 states. [2018-11-23 13:02:14,022 INFO L74 IsIncluded]: Start isIncluded. First operand 24 states. Second operand 24 states. [2018-11-23 13:02:14,022 INFO L87 Difference]: Start difference. First operand 24 states. Second operand 24 states. [2018-11-23 13:02:14,024 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:02:14,025 INFO L93 Difference]: Finished difference Result 24 states and 27 transitions. [2018-11-23 13:02:14,026 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 27 transitions. [2018-11-23 13:02:14,026 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:02:14,026 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:02:14,027 INFO L74 IsIncluded]: Start isIncluded. First operand 24 states. Second operand 24 states. [2018-11-23 13:02:14,027 INFO L87 Difference]: Start difference. First operand 24 states. Second operand 24 states. [2018-11-23 13:02:14,029 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:02:14,029 INFO L93 Difference]: Finished difference Result 24 states and 27 transitions. [2018-11-23 13:02:14,029 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 27 transitions. [2018-11-23 13:02:14,030 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:02:14,030 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:02:14,030 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 13:02:14,030 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 13:02:14,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2018-11-23 13:02:14,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 27 transitions. [2018-11-23 13:02:14,032 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 27 transitions. Word has length 19 [2018-11-23 13:02:14,033 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:02:14,033 INFO L480 AbstractCegarLoop]: Abstraction has 24 states and 27 transitions. [2018-11-23 13:02:14,033 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-23 13:02:14,033 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 27 transitions. [2018-11-23 13:02:14,034 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-11-23 13:02:14,034 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:02:14,034 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:02:14,035 INFO L423 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:02:14,035 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:02:14,035 INFO L82 PathProgramCache]: Analyzing trace with hash 694958638, now seen corresponding path program 1 times [2018-11-23 13:02:14,035 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:02:14,036 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:02:14,036 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:02:14,037 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:02:14,037 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:02:14,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:02:14,303 INFO L256 TraceCheckUtils]: 0: Hoare triple {420#true} call ULTIMATE.init(); {420#true} is VALID [2018-11-23 13:02:14,304 INFO L273 TraceCheckUtils]: 1: Hoare triple {420#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~SIZE~0 := 0; {420#true} is VALID [2018-11-23 13:02:14,305 INFO L273 TraceCheckUtils]: 2: Hoare triple {420#true} assume true; {420#true} is VALID [2018-11-23 13:02:14,305 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {420#true} {420#true} #54#return; {420#true} is VALID [2018-11-23 13:02:14,306 INFO L256 TraceCheckUtils]: 4: Hoare triple {420#true} call #t~ret5 := main(); {420#true} is VALID [2018-11-23 13:02:14,306 INFO L273 TraceCheckUtils]: 5: Hoare triple {420#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); {420#true} is VALID [2018-11-23 13:02:14,306 INFO L256 TraceCheckUtils]: 6: Hoare triple {420#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); {420#true} is VALID [2018-11-23 13:02:14,308 INFO L273 TraceCheckUtils]: 7: Hoare triple {420#true} ~a.base, ~a.offset := #in~a.base, #in~a.offset;~n := #in~n;~q := #in~q;~j~0 := 0; {422#(= linear_search_~j~0 0)} is VALID [2018-11-23 13:02:14,309 INFO L273 TraceCheckUtils]: 8: Hoare triple {422#(= linear_search_~j~0 0)} #t~short1 := ~j~0 % 4294967296 < ~n % 4294967296; {422#(= linear_search_~j~0 0)} is VALID [2018-11-23 13:02:14,310 INFO L273 TraceCheckUtils]: 9: Hoare triple {422#(= 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; {422#(= linear_search_~j~0 0)} is VALID [2018-11-23 13:02:14,310 INFO L273 TraceCheckUtils]: 10: Hoare triple {422#(= linear_search_~j~0 0)} assume !!#t~short1;havoc #t~short1;havoc #t~mem0;#t~post2 := ~j~0;~j~0 := 1 + #t~post2;havoc #t~post2; {423#(and (<= linear_search_~j~0 1) (< 0 (+ (div linear_search_~j~0 4294967296) 1)))} is VALID [2018-11-23 13:02:14,311 INFO L273 TraceCheckUtils]: 11: Hoare triple {423#(and (<= linear_search_~j~0 1) (< 0 (+ (div linear_search_~j~0 4294967296) 1)))} assume 20 == ~j~0 % 4294967296;~j~0 := -1; {421#false} is VALID [2018-11-23 13:02:14,312 INFO L273 TraceCheckUtils]: 12: Hoare triple {421#false} #t~short1 := ~j~0 % 4294967296 < ~n % 4294967296; {421#false} is VALID [2018-11-23 13:02:14,312 INFO L273 TraceCheckUtils]: 13: Hoare triple {421#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; {421#false} is VALID [2018-11-23 13:02:14,313 INFO L273 TraceCheckUtils]: 14: Hoare triple {421#false} assume !#t~short1;havoc #t~short1;havoc #t~mem0; {421#false} is VALID [2018-11-23 13:02:14,313 INFO L273 TraceCheckUtils]: 15: Hoare triple {421#false} assume !(~j~0 % 4294967296 < ~SIZE~0 % 4294967296);#res := 0; {421#false} is VALID [2018-11-23 13:02:14,313 INFO L273 TraceCheckUtils]: 16: Hoare triple {421#false} assume true; {421#false} is VALID [2018-11-23 13:02:14,314 INFO L268 TraceCheckUtils]: 17: Hoare quadruple {421#false} {420#true} #58#return; {421#false} is VALID [2018-11-23 13:02:14,314 INFO L273 TraceCheckUtils]: 18: Hoare triple {421#false} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {421#false} is VALID [2018-11-23 13:02:14,315 INFO L256 TraceCheckUtils]: 19: Hoare triple {421#false} call __VERIFIER_assert(#t~ret4); {421#false} is VALID [2018-11-23 13:02:14,315 INFO L273 TraceCheckUtils]: 20: Hoare triple {421#false} ~cond := #in~cond; {421#false} is VALID [2018-11-23 13:02:14,316 INFO L273 TraceCheckUtils]: 21: Hoare triple {421#false} assume 0 == ~cond; {421#false} is VALID [2018-11-23 13:02:14,316 INFO L273 TraceCheckUtils]: 22: Hoare triple {421#false} assume !false; {421#false} is VALID [2018-11-23 13:02:14,317 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:02:14,317 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 13:02:14,317 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-23 13:02:14,318 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 23 [2018-11-23 13:02:14,318 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 13:02:14,318 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2018-11-23 13:02:14,348 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 23 edges. 23 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:02:14,348 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-23 13:02:14,349 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-23 13:02:14,349 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-23 13:02:14,350 INFO L87 Difference]: Start difference. First operand 24 states and 27 transitions. Second operand 4 states. [2018-11-23 13:02:14,526 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:02:14,527 INFO L93 Difference]: Finished difference Result 44 states and 52 transitions. [2018-11-23 13:02:14,527 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-23 13:02:14,527 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 23 [2018-11-23 13:02:14,528 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:02:14,528 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-23 13:02:14,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 52 transitions. [2018-11-23 13:02:14,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-23 13:02:14,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 52 transitions. [2018-11-23 13:02:14,534 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 52 transitions. [2018-11-23 13:02:14,694 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-23 13:02:14,697 INFO L225 Difference]: With dead ends: 44 [2018-11-23 13:02:14,697 INFO L226 Difference]: Without dead ends: 31 [2018-11-23 13:02:14,698 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-23 13:02:14,698 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2018-11-23 13:02:14,750 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 25. [2018-11-23 13:02:14,751 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 13:02:14,751 INFO L82 GeneralOperation]: Start isEquivalent. First operand 31 states. Second operand 25 states. [2018-11-23 13:02:14,751 INFO L74 IsIncluded]: Start isIncluded. First operand 31 states. Second operand 25 states. [2018-11-23 13:02:14,751 INFO L87 Difference]: Start difference. First operand 31 states. Second operand 25 states. [2018-11-23 13:02:14,757 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:02:14,757 INFO L93 Difference]: Finished difference Result 31 states and 36 transitions. [2018-11-23 13:02:14,757 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 36 transitions. [2018-11-23 13:02:14,761 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:02:14,761 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:02:14,761 INFO L74 IsIncluded]: Start isIncluded. First operand 25 states. Second operand 31 states. [2018-11-23 13:02:14,761 INFO L87 Difference]: Start difference. First operand 25 states. Second operand 31 states. [2018-11-23 13:02:14,765 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:02:14,766 INFO L93 Difference]: Finished difference Result 31 states and 36 transitions. [2018-11-23 13:02:14,766 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 36 transitions. [2018-11-23 13:02:14,766 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:02:14,767 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:02:14,767 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 13:02:14,767 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 13:02:14,767 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2018-11-23 13:02:14,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 28 transitions. [2018-11-23 13:02:14,769 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 28 transitions. Word has length 23 [2018-11-23 13:02:14,769 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:02:14,770 INFO L480 AbstractCegarLoop]: Abstraction has 25 states and 28 transitions. [2018-11-23 13:02:14,770 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-23 13:02:14,770 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 28 transitions. [2018-11-23 13:02:14,771 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-11-23 13:02:14,771 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:02:14,771 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:02:14,771 INFO L423 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:02:14,772 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:02:14,772 INFO L82 PathProgramCache]: Analyzing trace with hash 953124076, now seen corresponding path program 1 times [2018-11-23 13:02:14,772 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:02:14,772 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:02:14,773 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:02:14,773 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:02:14,773 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:02:14,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:02:15,691 WARN L180 SmtUtils]: Spent 422.00 ms on a formula simplification. DAG size of input: 35 DAG size of output: 13 [2018-11-23 13:02:16,220 WARN L180 SmtUtils]: Spent 152.00 ms on a formula simplification. DAG size of input: 25 DAG size of output: 21 [2018-11-23 13:02:16,372 INFO L256 TraceCheckUtils]: 0: Hoare triple {581#true} call ULTIMATE.init(); {581#true} is VALID [2018-11-23 13:02:16,373 INFO L273 TraceCheckUtils]: 1: Hoare triple {581#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~SIZE~0 := 0; {581#true} is VALID [2018-11-23 13:02:16,373 INFO L273 TraceCheckUtils]: 2: Hoare triple {581#true} assume true; {581#true} is VALID [2018-11-23 13:02:16,374 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {581#true} {581#true} #54#return; {581#true} is VALID [2018-11-23 13:02:16,374 INFO L256 TraceCheckUtils]: 4: Hoare triple {581#true} call #t~ret5 := main(); {581#true} is VALID [2018-11-23 13:02:16,376 INFO L273 TraceCheckUtils]: 5: Hoare triple {581#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); {583#(and (<= (div ~SIZE~0 4294967296) 0) (or (<= (+ (* 4294967296 (div ~SIZE~0 4294967296)) 2147483648) ~SIZE~0) (<= 1 ~SIZE~0)))} is VALID [2018-11-23 13:02:16,376 INFO L256 TraceCheckUtils]: 6: Hoare triple {583#(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); {581#true} is VALID [2018-11-23 13:02:16,378 INFO L273 TraceCheckUtils]: 7: Hoare triple {581#true} ~a.base, ~a.offset := #in~a.base, #in~a.offset;~n := #in~n;~q := #in~q;~j~0 := 0; {584#(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-23 13:02:16,382 INFO L273 TraceCheckUtils]: 8: Hoare triple {584#(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; {585#(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-23 13:02:16,383 INFO L273 TraceCheckUtils]: 9: Hoare triple {585#(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; {585#(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-23 13:02:16,385 INFO L273 TraceCheckUtils]: 10: Hoare triple {585#(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~short1;havoc #t~mem0;#t~post2 := ~j~0;~j~0 := 1 + #t~post2;havoc #t~post2; {586#(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-23 13:02:16,386 INFO L273 TraceCheckUtils]: 11: Hoare triple {586#(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); {586#(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-23 13:02:16,388 INFO L273 TraceCheckUtils]: 12: Hoare triple {586#(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; {587#(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-23 13:02:16,389 INFO L273 TraceCheckUtils]: 13: Hoare triple {587#(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; {588#(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-23 13:02:16,390 INFO L273 TraceCheckUtils]: 14: Hoare triple {588#(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~short1;havoc #t~mem0; {588#(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-23 13:02:16,393 INFO L273 TraceCheckUtils]: 15: Hoare triple {588#(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; {589#(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-23 13:02:16,394 INFO L273 TraceCheckUtils]: 16: Hoare triple {589#(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; {589#(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-23 13:02:16,397 INFO L268 TraceCheckUtils]: 17: Hoare quadruple {589#(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)))} {583#(and (<= (div ~SIZE~0 4294967296) 0) (or (<= (+ (* 4294967296 (div ~SIZE~0 4294967296)) 2147483648) ~SIZE~0) (<= 1 ~SIZE~0)))} #58#return; {582#false} is VALID [2018-11-23 13:02:16,397 INFO L273 TraceCheckUtils]: 18: Hoare triple {582#false} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {582#false} is VALID [2018-11-23 13:02:16,398 INFO L256 TraceCheckUtils]: 19: Hoare triple {582#false} call __VERIFIER_assert(#t~ret4); {582#false} is VALID [2018-11-23 13:02:16,398 INFO L273 TraceCheckUtils]: 20: Hoare triple {582#false} ~cond := #in~cond; {582#false} is VALID [2018-11-23 13:02:16,398 INFO L273 TraceCheckUtils]: 21: Hoare triple {582#false} assume 0 == ~cond; {582#false} is VALID [2018-11-23 13:02:16,399 INFO L273 TraceCheckUtils]: 22: Hoare triple {582#false} assume !false; {582#false} is VALID [2018-11-23 13:02:16,403 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:02:16,403 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 13:02:16,403 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 13:02:16,420 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:02:16,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:02:16,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:02:16,485 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:02:17,032 INFO L256 TraceCheckUtils]: 0: Hoare triple {581#true} call ULTIMATE.init(); {581#true} is VALID [2018-11-23 13:02:17,033 INFO L273 TraceCheckUtils]: 1: Hoare triple {581#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~SIZE~0 := 0; {581#true} is VALID [2018-11-23 13:02:17,033 INFO L273 TraceCheckUtils]: 2: Hoare triple {581#true} assume true; {581#true} is VALID [2018-11-23 13:02:17,033 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {581#true} {581#true} #54#return; {581#true} is VALID [2018-11-23 13:02:17,034 INFO L256 TraceCheckUtils]: 4: Hoare triple {581#true} call #t~ret5 := main(); {581#true} is VALID [2018-11-23 13:02:17,034 INFO L273 TraceCheckUtils]: 5: Hoare triple {581#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); {581#true} is VALID [2018-11-23 13:02:17,034 INFO L256 TraceCheckUtils]: 6: Hoare triple {581#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); {581#true} is VALID [2018-11-23 13:02:17,040 INFO L273 TraceCheckUtils]: 7: Hoare triple {581#true} ~a.base, ~a.offset := #in~a.base, #in~a.offset;~n := #in~n;~q := #in~q;~j~0 := 0; {614#(and (= |linear_search_#in~n| linear_search_~n) (= linear_search_~j~0 0))} is VALID [2018-11-23 13:02:17,041 INFO L273 TraceCheckUtils]: 8: Hoare triple {614#(and (= |linear_search_#in~n| linear_search_~n) (= linear_search_~j~0 0))} #t~short1 := ~j~0 % 4294967296 < ~n % 4294967296; {614#(and (= |linear_search_#in~n| linear_search_~n) (= linear_search_~j~0 0))} is VALID [2018-11-23 13:02:17,042 INFO L273 TraceCheckUtils]: 9: Hoare triple {614#(and (= |linear_search_#in~n| linear_search_~n) (= 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 (= |linear_search_#in~n| linear_search_~n) (= linear_search_~j~0 0))} is VALID [2018-11-23 13:02:17,043 INFO L273 TraceCheckUtils]: 10: Hoare triple {614#(and (= |linear_search_#in~n| linear_search_~n) (= linear_search_~j~0 0))} assume !!#t~short1;havoc #t~short1;havoc #t~mem0;#t~post2 := ~j~0;~j~0 := 1 + #t~post2;havoc #t~post2; {624#(and (= linear_search_~j~0 1) (= |linear_search_#in~n| linear_search_~n))} is VALID [2018-11-23 13:02:17,045 INFO L273 TraceCheckUtils]: 11: Hoare triple {624#(and (= linear_search_~j~0 1) (= |linear_search_#in~n| linear_search_~n))} assume !(20 == ~j~0 % 4294967296); {624#(and (= linear_search_~j~0 1) (= |linear_search_#in~n| linear_search_~n))} is VALID [2018-11-23 13:02:17,046 INFO L273 TraceCheckUtils]: 12: Hoare triple {624#(and (= linear_search_~j~0 1) (= |linear_search_#in~n| linear_search_~n))} #t~short1 := ~j~0 % 4294967296 < ~n % 4294967296; {631#(and (= linear_search_~j~0 1) (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-23 13:02:17,047 INFO L273 TraceCheckUtils]: 13: Hoare triple {631#(and (= linear_search_~j~0 1) (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; {635#(and (= linear_search_~j~0 1) (< (mod linear_search_~j~0 4294967296) (mod |linear_search_#in~n| 4294967296)))} is VALID [2018-11-23 13:02:17,048 INFO L273 TraceCheckUtils]: 14: Hoare triple {635#(and (= linear_search_~j~0 1) (< (mod linear_search_~j~0 4294967296) (mod |linear_search_#in~n| 4294967296)))} assume !#t~short1;havoc #t~short1;havoc #t~mem0; {635#(and (= linear_search_~j~0 1) (< (mod linear_search_~j~0 4294967296) (mod |linear_search_#in~n| 4294967296)))} is VALID [2018-11-23 13:02:17,050 INFO L273 TraceCheckUtils]: 15: Hoare triple {635#(and (= linear_search_~j~0 1) (< (mod linear_search_~j~0 4294967296) (mod |linear_search_#in~n| 4294967296)))} assume !(~j~0 % 4294967296 < ~SIZE~0 % 4294967296);#res := 0; {642#(and (< 1 (mod |linear_search_#in~n| 4294967296)) (<= (mod ~SIZE~0 4294967296) 1))} is VALID [2018-11-23 13:02:17,051 INFO L273 TraceCheckUtils]: 16: Hoare triple {642#(and (< 1 (mod |linear_search_#in~n| 4294967296)) (<= (mod ~SIZE~0 4294967296) 1))} assume true; {642#(and (< 1 (mod |linear_search_#in~n| 4294967296)) (<= (mod ~SIZE~0 4294967296) 1))} is VALID [2018-11-23 13:02:17,053 INFO L268 TraceCheckUtils]: 17: Hoare quadruple {642#(and (< 1 (mod |linear_search_#in~n| 4294967296)) (<= (mod ~SIZE~0 4294967296) 1))} {581#true} #58#return; {582#false} is VALID [2018-11-23 13:02:17,054 INFO L273 TraceCheckUtils]: 18: Hoare triple {582#false} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {582#false} is VALID [2018-11-23 13:02:17,054 INFO L256 TraceCheckUtils]: 19: Hoare triple {582#false} call __VERIFIER_assert(#t~ret4); {582#false} is VALID [2018-11-23 13:02:17,055 INFO L273 TraceCheckUtils]: 20: Hoare triple {582#false} ~cond := #in~cond; {582#false} is VALID [2018-11-23 13:02:17,055 INFO L273 TraceCheckUtils]: 21: Hoare triple {582#false} assume 0 == ~cond; {582#false} is VALID [2018-11-23 13:02:17,056 INFO L273 TraceCheckUtils]: 22: Hoare triple {582#false} assume !false; {582#false} is VALID [2018-11-23 13:02:17,058 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:02:17,082 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 13:02:17,082 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 7] total 14 [2018-11-23 13:02:17,083 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 23 [2018-11-23 13:02:17,083 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 13:02:17,083 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 14 states. [2018-11-23 13:02:17,158 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 36 edges. 36 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:02:17,159 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-11-23 13:02:17,159 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-11-23 13:02:17,160 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=139, Unknown=0, NotChecked=0, Total=182 [2018-11-23 13:02:17,160 INFO L87 Difference]: Start difference. First operand 25 states and 28 transitions. Second operand 14 states. [2018-11-23 13:02:18,556 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:02:18,557 INFO L93 Difference]: Finished difference Result 41 states and 46 transitions. [2018-11-23 13:02:18,557 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-23 13:02:18,557 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 23 [2018-11-23 13:02:18,558 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:02:18,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2018-11-23 13:02:18,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 46 transitions. [2018-11-23 13:02:18,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2018-11-23 13:02:18,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 46 transitions. [2018-11-23 13:02:18,564 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states and 46 transitions. [2018-11-23 13:02:18,652 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 46 edges. 46 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:02:18,654 INFO L225 Difference]: With dead ends: 41 [2018-11-23 13:02:18,654 INFO L226 Difference]: Without dead ends: 32 [2018-11-23 13:02:18,655 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 19 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=86, Invalid=256, Unknown=0, NotChecked=0, Total=342 [2018-11-23 13:02:18,655 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2018-11-23 13:02:18,856 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 28. [2018-11-23 13:02:18,856 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 13:02:18,856 INFO L82 GeneralOperation]: Start isEquivalent. First operand 32 states. Second operand 28 states. [2018-11-23 13:02:18,856 INFO L74 IsIncluded]: Start isIncluded. First operand 32 states. Second operand 28 states. [2018-11-23 13:02:18,857 INFO L87 Difference]: Start difference. First operand 32 states. Second operand 28 states. [2018-11-23 13:02:18,859 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:02:18,860 INFO L93 Difference]: Finished difference Result 32 states and 37 transitions. [2018-11-23 13:02:18,860 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 37 transitions. [2018-11-23 13:02:18,860 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:02:18,860 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:02:18,860 INFO L74 IsIncluded]: Start isIncluded. First operand 28 states. Second operand 32 states. [2018-11-23 13:02:18,861 INFO L87 Difference]: Start difference. First operand 28 states. Second operand 32 states. [2018-11-23 13:02:18,862 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:02:18,863 INFO L93 Difference]: Finished difference Result 32 states and 37 transitions. [2018-11-23 13:02:18,863 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 37 transitions. [2018-11-23 13:02:18,863 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:02:18,863 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:02:18,864 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 13:02:18,864 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 13:02:18,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2018-11-23 13:02:18,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 32 transitions. [2018-11-23 13:02:18,866 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 32 transitions. Word has length 23 [2018-11-23 13:02:18,866 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:02:18,866 INFO L480 AbstractCegarLoop]: Abstraction has 28 states and 32 transitions. [2018-11-23 13:02:18,866 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-11-23 13:02:18,866 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 32 transitions. [2018-11-23 13:02:18,867 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-11-23 13:02:18,867 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:02:18,867 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:02:18,868 INFO L423 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:02:18,868 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:02:18,868 INFO L82 PathProgramCache]: Analyzing trace with hash 560097066, now seen corresponding path program 1 times [2018-11-23 13:02:18,868 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:02:18,868 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:02:18,869 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:02:18,869 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:02:18,869 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:02:18,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:02:21,531 WARN L180 SmtUtils]: Spent 1.42 s on a formula simplification. DAG size of input: 317 DAG size of output: 53 [2018-11-23 13:02:21,993 WARN L180 SmtUtils]: Spent 174.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 33 [2018-11-23 13:02:22,203 WARN L180 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 42 [2018-11-23 13:02:22,476 WARN L180 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 36 DAG size of output: 19 [2018-11-23 13:02:22,896 INFO L256 TraceCheckUtils]: 0: Hoare triple {830#true} call ULTIMATE.init(); {830#true} is VALID [2018-11-23 13:02:22,896 INFO L273 TraceCheckUtils]: 1: Hoare triple {830#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~SIZE~0 := 0; {830#true} is VALID [2018-11-23 13:02:22,897 INFO L273 TraceCheckUtils]: 2: Hoare triple {830#true} assume true; {830#true} is VALID [2018-11-23 13:02:22,897 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {830#true} {830#true} #54#return; {830#true} is VALID [2018-11-23 13:02:22,897 INFO L256 TraceCheckUtils]: 4: Hoare triple {830#true} call #t~ret5 := main(); {830#true} is VALID [2018-11-23 13:02:22,905 INFO L273 TraceCheckUtils]: 5: Hoare triple {830#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); {832#(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-23 13:02:22,905 INFO L256 TraceCheckUtils]: 6: Hoare triple {832#(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); {830#true} is VALID [2018-11-23 13:02:22,906 INFO L273 TraceCheckUtils]: 7: Hoare triple {830#true} ~a.base, ~a.offset := #in~a.base, #in~a.offset;~n := #in~n;~q := #in~q;~j~0 := 0; {833#(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-23 13:02:22,908 INFO L273 TraceCheckUtils]: 8: Hoare triple {833#(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; {834#(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-23 13:02:22,910 INFO L273 TraceCheckUtils]: 9: Hoare triple {834#(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; {835#(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-23 13:02:22,911 INFO L273 TraceCheckUtils]: 10: Hoare triple {835#(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~short1;havoc #t~mem0;#t~post2 := ~j~0;~j~0 := 1 + #t~post2;havoc #t~post2; {836#(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-23 13:02:22,912 INFO L273 TraceCheckUtils]: 11: Hoare triple {836#(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); {836#(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-23 13:02:22,913 INFO L273 TraceCheckUtils]: 12: Hoare triple {836#(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; {836#(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-23 13:02:22,914 INFO L273 TraceCheckUtils]: 13: Hoare triple {836#(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; {836#(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-23 13:02:22,915 INFO L273 TraceCheckUtils]: 14: Hoare triple {836#(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~short1;havoc #t~mem0; {836#(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-23 13:02:22,916 INFO L273 TraceCheckUtils]: 15: Hoare triple {836#(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; {837#(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-23 13:02:22,917 INFO L273 TraceCheckUtils]: 16: Hoare triple {837#(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; {837#(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-23 13:02:22,922 INFO L268 TraceCheckUtils]: 17: Hoare quadruple {837#(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))))} {832#(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|))))))))} #58#return; {831#false} is VALID [2018-11-23 13:02:22,923 INFO L273 TraceCheckUtils]: 18: Hoare triple {831#false} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {831#false} is VALID [2018-11-23 13:02:22,923 INFO L256 TraceCheckUtils]: 19: Hoare triple {831#false} call __VERIFIER_assert(#t~ret4); {831#false} is VALID [2018-11-23 13:02:22,923 INFO L273 TraceCheckUtils]: 20: Hoare triple {831#false} ~cond := #in~cond; {831#false} is VALID [2018-11-23 13:02:22,923 INFO L273 TraceCheckUtils]: 21: Hoare triple {831#false} assume 0 == ~cond; {831#false} is VALID [2018-11-23 13:02:22,923 INFO L273 TraceCheckUtils]: 22: Hoare triple {831#false} assume !false; {831#false} is VALID [2018-11-23 13:02:22,926 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:02:22,926 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 13:02:22,926 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 13:02:22,935 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:02:22,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:02:22,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:02:22,990 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:02:23,056 WARN L307 Elim1Store]: Array PQE input equivalent to false [2018-11-23 13:02:23,061 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-23 13:02:23,110 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 18 [2018-11-23 13:02:23,115 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 17 [2018-11-23 13:02:23,120 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-23 13:02:23,123 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 13:02:23,131 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 13:02:23,131 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:245, output treesize:17 [2018-11-23 13:02:23,795 WARN L180 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 45 [2018-11-23 13:02:24,291 INFO L256 TraceCheckUtils]: 0: Hoare triple {830#true} call ULTIMATE.init(); {830#true} is VALID [2018-11-23 13:02:24,291 INFO L273 TraceCheckUtils]: 1: Hoare triple {830#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~SIZE~0 := 0; {830#true} is VALID [2018-11-23 13:02:24,291 INFO L273 TraceCheckUtils]: 2: Hoare triple {830#true} assume true; {830#true} is VALID [2018-11-23 13:02:24,292 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {830#true} {830#true} #54#return; {830#true} is VALID [2018-11-23 13:02:24,292 INFO L256 TraceCheckUtils]: 4: Hoare triple {830#true} call #t~ret5 := main(); {830#true} is VALID [2018-11-23 13:02:24,294 INFO L273 TraceCheckUtils]: 5: Hoare triple {830#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); {856#(= 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-23 13:02:24,295 INFO L256 TraceCheckUtils]: 6: Hoare triple {856#(= 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); {860#(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-23 13:02:24,296 INFO L273 TraceCheckUtils]: 7: Hoare triple {860#(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; {864#(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-23 13:02:24,297 INFO L273 TraceCheckUtils]: 8: Hoare triple {864#(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; {868#(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-23 13:02:24,301 INFO L273 TraceCheckUtils]: 9: Hoare triple {868#(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; {872#(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-23 13:02:24,305 INFO L273 TraceCheckUtils]: 10: Hoare triple {872#(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~short1;havoc #t~mem0;#t~post2 := ~j~0;~j~0 := 1 + #t~post2;havoc #t~post2; {876#(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-23 13:02:24,306 INFO L273 TraceCheckUtils]: 11: Hoare triple {876#(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); {876#(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-23 13:02:24,307 INFO L273 TraceCheckUtils]: 12: Hoare triple {876#(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; {883#(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-23 13:02:24,308 INFO L273 TraceCheckUtils]: 13: Hoare triple {883#(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; {883#(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-23 13:02:24,309 INFO L273 TraceCheckUtils]: 14: Hoare triple {883#(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~short1;havoc #t~mem0; {883#(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-23 13:02:24,310 INFO L273 TraceCheckUtils]: 15: Hoare triple {883#(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; {893#(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-23 13:02:24,311 INFO L273 TraceCheckUtils]: 16: Hoare triple {893#(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; {893#(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-23 13:02:24,316 INFO L268 TraceCheckUtils]: 17: Hoare quadruple {893#(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)))))} {856#(= 3 (select (select |#memory_int| |main_~#a~0.base|) (+ (* 4 (mod (div (mod ~SIZE~0 4294967296) 2) 4294967296)) |main_~#a~0.offset|)))} #58#return; {831#false} is VALID [2018-11-23 13:02:24,316 INFO L273 TraceCheckUtils]: 18: Hoare triple {831#false} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {831#false} is VALID [2018-11-23 13:02:24,317 INFO L256 TraceCheckUtils]: 19: Hoare triple {831#false} call __VERIFIER_assert(#t~ret4); {831#false} is VALID [2018-11-23 13:02:24,317 INFO L273 TraceCheckUtils]: 20: Hoare triple {831#false} ~cond := #in~cond; {831#false} is VALID [2018-11-23 13:02:24,317 INFO L273 TraceCheckUtils]: 21: Hoare triple {831#false} assume 0 == ~cond; {831#false} is VALID [2018-11-23 13:02:24,317 INFO L273 TraceCheckUtils]: 22: Hoare triple {831#false} assume !false; {831#false} is VALID [2018-11-23 13:02:24,323 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:02:24,350 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 13:02:24,350 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 10] total 16 [2018-11-23 13:02:24,351 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 23 [2018-11-23 13:02:24,351 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 13:02:24,351 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 16 states. [2018-11-23 13:02:24,418 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 36 edges. 36 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:02:24,418 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-11-23 13:02:24,418 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-11-23 13:02:24,419 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=194, Unknown=0, NotChecked=0, Total=240 [2018-11-23 13:02:24,419 INFO L87 Difference]: Start difference. First operand 28 states and 32 transitions. Second operand 16 states. [2018-11-23 13:02:24,772 WARN L180 SmtUtils]: Spent 173.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 51 [2018-11-23 13:02:25,130 WARN L180 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 45 [2018-11-23 13:02:25,873 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:02:25,873 INFO L93 Difference]: Finished difference Result 43 states and 48 transitions. [2018-11-23 13:02:25,873 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-11-23 13:02:25,873 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 23 [2018-11-23 13:02:25,874 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:02:25,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2018-11-23 13:02:25,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 42 transitions. [2018-11-23 13:02:25,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2018-11-23 13:02:25,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 42 transitions. [2018-11-23 13:02:25,878 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states and 42 transitions. [2018-11-23 13:02:25,977 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 42 edges. 42 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:02:25,979 INFO L225 Difference]: With dead ends: 43 [2018-11-23 13:02:25,979 INFO L226 Difference]: Without dead ends: 34 [2018-11-23 13:02:25,980 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 15 SyntacticMatches, 4 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 3.8s TimeCoverageRelationStatistics Valid=67, Invalid=275, Unknown=0, NotChecked=0, Total=342 [2018-11-23 13:02:25,980 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2018-11-23 13:02:26,080 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 32. [2018-11-23 13:02:26,080 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 13:02:26,081 INFO L82 GeneralOperation]: Start isEquivalent. First operand 34 states. Second operand 32 states. [2018-11-23 13:02:26,081 INFO L74 IsIncluded]: Start isIncluded. First operand 34 states. Second operand 32 states. [2018-11-23 13:02:26,081 INFO L87 Difference]: Start difference. First operand 34 states. Second operand 32 states. [2018-11-23 13:02:26,083 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:02:26,083 INFO L93 Difference]: Finished difference Result 34 states and 39 transitions. [2018-11-23 13:02:26,083 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 39 transitions. [2018-11-23 13:02:26,084 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:02:26,084 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:02:26,084 INFO L74 IsIncluded]: Start isIncluded. First operand 32 states. Second operand 34 states. [2018-11-23 13:02:26,084 INFO L87 Difference]: Start difference. First operand 32 states. Second operand 34 states. [2018-11-23 13:02:26,086 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:02:26,086 INFO L93 Difference]: Finished difference Result 34 states and 39 transitions. [2018-11-23 13:02:26,086 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 39 transitions. [2018-11-23 13:02:26,087 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:02:26,087 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:02:26,087 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 13:02:26,087 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 13:02:26,087 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2018-11-23 13:02:26,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 37 transitions. [2018-11-23 13:02:26,089 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 37 transitions. Word has length 23 [2018-11-23 13:02:26,089 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:02:26,090 INFO L480 AbstractCegarLoop]: Abstraction has 32 states and 37 transitions. [2018-11-23 13:02:26,090 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-11-23 13:02:26,090 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 37 transitions. [2018-11-23 13:02:26,090 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-11-23 13:02:26,091 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:02:26,091 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:02:26,091 INFO L423 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:02:26,091 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:02:26,091 INFO L82 PathProgramCache]: Analyzing trace with hash -451020184, now seen corresponding path program 1 times [2018-11-23 13:02:26,091 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:02:26,092 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:02:26,092 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:02:26,093 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:02:26,093 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:02:26,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:02:26,278 INFO L256 TraceCheckUtils]: 0: Hoare triple {1089#true} call ULTIMATE.init(); {1089#true} is VALID [2018-11-23 13:02:26,278 INFO L273 TraceCheckUtils]: 1: Hoare triple {1089#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~SIZE~0 := 0; {1089#true} is VALID [2018-11-23 13:02:26,279 INFO L273 TraceCheckUtils]: 2: Hoare triple {1089#true} assume true; {1089#true} is VALID [2018-11-23 13:02:26,279 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1089#true} {1089#true} #54#return; {1089#true} is VALID [2018-11-23 13:02:26,279 INFO L256 TraceCheckUtils]: 4: Hoare triple {1089#true} call #t~ret5 := main(); {1089#true} is VALID [2018-11-23 13:02:26,279 INFO L273 TraceCheckUtils]: 5: Hoare triple {1089#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); {1089#true} is VALID [2018-11-23 13:02:26,279 INFO L256 TraceCheckUtils]: 6: Hoare triple {1089#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); {1089#true} is VALID [2018-11-23 13:02:26,280 INFO L273 TraceCheckUtils]: 7: Hoare triple {1089#true} ~a.base, ~a.offset := #in~a.base, #in~a.offset;~n := #in~n;~q := #in~q;~j~0 := 0; {1089#true} is VALID [2018-11-23 13:02:26,280 INFO L273 TraceCheckUtils]: 8: Hoare triple {1089#true} #t~short1 := ~j~0 % 4294967296 < ~n % 4294967296; {1089#true} is VALID [2018-11-23 13:02:26,289 INFO L273 TraceCheckUtils]: 9: Hoare triple {1089#true} assume !#t~short1; {1091#(not |linear_search_#t~short1|)} is VALID [2018-11-23 13:02:26,302 INFO L273 TraceCheckUtils]: 10: Hoare triple {1091#(not |linear_search_#t~short1|)} assume !!#t~short1;havoc #t~short1;havoc #t~mem0;#t~post2 := ~j~0;~j~0 := 1 + #t~post2;havoc #t~post2; {1090#false} is VALID [2018-11-23 13:02:26,302 INFO L273 TraceCheckUtils]: 11: Hoare triple {1090#false} assume !(20 == ~j~0 % 4294967296); {1090#false} is VALID [2018-11-23 13:02:26,302 INFO L273 TraceCheckUtils]: 12: Hoare triple {1090#false} #t~short1 := ~j~0 % 4294967296 < ~n % 4294967296; {1090#false} is VALID [2018-11-23 13:02:26,303 INFO L273 TraceCheckUtils]: 13: Hoare triple {1090#false} assume !#t~short1; {1090#false} is VALID [2018-11-23 13:02:26,303 INFO L273 TraceCheckUtils]: 14: Hoare triple {1090#false} assume !#t~short1;havoc #t~short1;havoc #t~mem0; {1090#false} is VALID [2018-11-23 13:02:26,303 INFO L273 TraceCheckUtils]: 15: Hoare triple {1090#false} assume !(~j~0 % 4294967296 < ~SIZE~0 % 4294967296);#res := 0; {1090#false} is VALID [2018-11-23 13:02:26,303 INFO L273 TraceCheckUtils]: 16: Hoare triple {1090#false} assume true; {1090#false} is VALID [2018-11-23 13:02:26,303 INFO L268 TraceCheckUtils]: 17: Hoare quadruple {1090#false} {1089#true} #58#return; {1090#false} is VALID [2018-11-23 13:02:26,304 INFO L273 TraceCheckUtils]: 18: Hoare triple {1090#false} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {1090#false} is VALID [2018-11-23 13:02:26,304 INFO L256 TraceCheckUtils]: 19: Hoare triple {1090#false} call __VERIFIER_assert(#t~ret4); {1090#false} is VALID [2018-11-23 13:02:26,304 INFO L273 TraceCheckUtils]: 20: Hoare triple {1090#false} ~cond := #in~cond; {1090#false} is VALID [2018-11-23 13:02:26,304 INFO L273 TraceCheckUtils]: 21: Hoare triple {1090#false} assume 0 == ~cond; {1090#false} is VALID [2018-11-23 13:02:26,305 INFO L273 TraceCheckUtils]: 22: Hoare triple {1090#false} assume !false; {1090#false} is VALID [2018-11-23 13:02:26,305 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:02:26,305 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 13:02:26,306 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 13:02:26,307 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2018-11-23 13:02:26,307 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 13:02:26,307 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-23 13:02:26,371 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 23 edges. 23 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:02:26,371 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 13:02:26,371 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 13:02:26,371 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 13:02:26,372 INFO L87 Difference]: Start difference. First operand 32 states and 37 transitions. Second operand 3 states. [2018-11-23 13:02:26,626 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:02:26,626 INFO L93 Difference]: Finished difference Result 48 states and 56 transitions. [2018-11-23 13:02:26,626 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 13:02:26,627 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2018-11-23 13:02:26,627 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:02:26,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 13:02:26,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 40 transitions. [2018-11-23 13:02:26,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 13:02:26,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 40 transitions. [2018-11-23 13:02:26,630 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 40 transitions. [2018-11-23 13:02:26,763 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 40 edges. 40 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:02:26,764 INFO L225 Difference]: With dead ends: 48 [2018-11-23 13:02:26,765 INFO L226 Difference]: Without dead ends: 29 [2018-11-23 13:02:26,765 INFO L631 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-23 13:02:26,766 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2018-11-23 13:02:26,843 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2018-11-23 13:02:26,843 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 13:02:26,843 INFO L82 GeneralOperation]: Start isEquivalent. First operand 29 states. Second operand 29 states. [2018-11-23 13:02:26,843 INFO L74 IsIncluded]: Start isIncluded. First operand 29 states. Second operand 29 states. [2018-11-23 13:02:26,843 INFO L87 Difference]: Start difference. First operand 29 states. Second operand 29 states. [2018-11-23 13:02:26,845 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:02:26,845 INFO L93 Difference]: Finished difference Result 29 states and 31 transitions. [2018-11-23 13:02:26,845 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 31 transitions. [2018-11-23 13:02:26,845 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:02:26,845 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:02:26,846 INFO L74 IsIncluded]: Start isIncluded. First operand 29 states. Second operand 29 states. [2018-11-23 13:02:26,846 INFO L87 Difference]: Start difference. First operand 29 states. Second operand 29 states. [2018-11-23 13:02:26,847 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:02:26,848 INFO L93 Difference]: Finished difference Result 29 states and 31 transitions. [2018-11-23 13:02:26,848 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 31 transitions. [2018-11-23 13:02:26,848 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:02:26,848 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:02:26,848 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 13:02:26,849 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 13:02:26,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2018-11-23 13:02:26,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 31 transitions. [2018-11-23 13:02:26,850 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 31 transitions. Word has length 23 [2018-11-23 13:02:26,850 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:02:26,851 INFO L480 AbstractCegarLoop]: Abstraction has 29 states and 31 transitions. [2018-11-23 13:02:26,851 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 13:02:26,851 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 31 transitions. [2018-11-23 13:02:26,851 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-11-23 13:02:26,851 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:02:26,852 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:02:26,852 INFO L423 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:02:26,852 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:02:26,852 INFO L82 PathProgramCache]: Analyzing trace with hash 1644587462, now seen corresponding path program 1 times [2018-11-23 13:02:26,852 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:02:26,852 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:02:26,853 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:02:26,853 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:02:26,853 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:02:26,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:02:27,385 WARN L180 SmtUtils]: Spent 210.00 ms on a formula simplification. DAG size of input: 18 DAG size of output: 13 [2018-11-23 13:02:27,414 INFO L256 TraceCheckUtils]: 0: Hoare triple {1255#true} call ULTIMATE.init(); {1255#true} is VALID [2018-11-23 13:02:27,415 INFO L273 TraceCheckUtils]: 1: Hoare triple {1255#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~SIZE~0 := 0; {1255#true} is VALID [2018-11-23 13:02:27,415 INFO L273 TraceCheckUtils]: 2: Hoare triple {1255#true} assume true; {1255#true} is VALID [2018-11-23 13:02:27,415 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1255#true} {1255#true} #54#return; {1255#true} is VALID [2018-11-23 13:02:27,416 INFO L256 TraceCheckUtils]: 4: Hoare triple {1255#true} call #t~ret5 := main(); {1255#true} is VALID [2018-11-23 13:02:27,416 INFO L273 TraceCheckUtils]: 5: Hoare triple {1255#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); {1255#true} is VALID [2018-11-23 13:02:27,416 INFO L256 TraceCheckUtils]: 6: Hoare triple {1255#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); {1255#true} is VALID [2018-11-23 13:02:27,417 INFO L273 TraceCheckUtils]: 7: Hoare triple {1255#true} ~a.base, ~a.offset := #in~a.base, #in~a.offset;~n := #in~n;~q := #in~q;~j~0 := 0; {1255#true} is VALID [2018-11-23 13:02:27,417 INFO L273 TraceCheckUtils]: 8: Hoare triple {1255#true} #t~short1 := ~j~0 % 4294967296 < ~n % 4294967296; {1255#true} is VALID [2018-11-23 13:02:27,417 INFO L273 TraceCheckUtils]: 9: Hoare triple {1255#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; {1255#true} is VALID [2018-11-23 13:02:27,417 INFO L273 TraceCheckUtils]: 10: Hoare triple {1255#true} assume !!#t~short1;havoc #t~short1;havoc #t~mem0;#t~post2 := ~j~0;~j~0 := 1 + #t~post2;havoc #t~post2; {1255#true} is VALID [2018-11-23 13:02:27,418 INFO L273 TraceCheckUtils]: 11: Hoare triple {1255#true} assume !(20 == ~j~0 % 4294967296); {1255#true} is VALID [2018-11-23 13:02:27,418 INFO L273 TraceCheckUtils]: 12: Hoare triple {1255#true} #t~short1 := ~j~0 % 4294967296 < ~n % 4294967296; {1255#true} is VALID [2018-11-23 13:02:27,418 INFO L273 TraceCheckUtils]: 13: Hoare triple {1255#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; {1255#true} is VALID [2018-11-23 13:02:27,418 INFO L273 TraceCheckUtils]: 14: Hoare triple {1255#true} assume !!#t~short1;havoc #t~short1;havoc #t~mem0;#t~post2 := ~j~0;~j~0 := 1 + #t~post2;havoc #t~post2; {1255#true} is VALID [2018-11-23 13:02:27,419 INFO L273 TraceCheckUtils]: 15: Hoare triple {1255#true} assume 20 == ~j~0 % 4294967296;~j~0 := -1; {1257#(and (<= linear_search_~n (+ linear_search_~j~0 (* 4294967296 (div linear_search_~n 4294967296)) 4294967296)) (<= (+ (div linear_search_~j~0 4294967296) 1) 0))} is VALID [2018-11-23 13:02:27,420 INFO L273 TraceCheckUtils]: 16: Hoare triple {1257#(and (<= linear_search_~n (+ linear_search_~j~0 (* 4294967296 (div linear_search_~n 4294967296)) 4294967296)) (<= (+ (div linear_search_~j~0 4294967296) 1) 0))} #t~short1 := ~j~0 % 4294967296 < ~n % 4294967296; {1258#(not |linear_search_#t~short1|)} is VALID [2018-11-23 13:02:27,420 INFO L273 TraceCheckUtils]: 17: Hoare triple {1258#(not |linear_search_#t~short1|)} 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; {1256#false} is VALID [2018-11-23 13:02:27,420 INFO L273 TraceCheckUtils]: 18: Hoare triple {1256#false} assume !#t~short1;havoc #t~short1;havoc #t~mem0; {1256#false} is VALID [2018-11-23 13:02:27,420 INFO L273 TraceCheckUtils]: 19: Hoare triple {1256#false} assume !(~j~0 % 4294967296 < ~SIZE~0 % 4294967296);#res := 0; {1256#false} is VALID [2018-11-23 13:02:27,421 INFO L273 TraceCheckUtils]: 20: Hoare triple {1256#false} assume true; {1256#false} is VALID [2018-11-23 13:02:27,421 INFO L268 TraceCheckUtils]: 21: Hoare quadruple {1256#false} {1255#true} #58#return; {1256#false} is VALID [2018-11-23 13:02:27,421 INFO L273 TraceCheckUtils]: 22: Hoare triple {1256#false} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {1256#false} is VALID [2018-11-23 13:02:27,421 INFO L256 TraceCheckUtils]: 23: Hoare triple {1256#false} call __VERIFIER_assert(#t~ret4); {1256#false} is VALID [2018-11-23 13:02:27,421 INFO L273 TraceCheckUtils]: 24: Hoare triple {1256#false} ~cond := #in~cond; {1256#false} is VALID [2018-11-23 13:02:27,421 INFO L273 TraceCheckUtils]: 25: Hoare triple {1256#false} assume 0 == ~cond; {1256#false} is VALID [2018-11-23 13:02:27,422 INFO L273 TraceCheckUtils]: 26: Hoare triple {1256#false} assume !false; {1256#false} is VALID [2018-11-23 13:02:27,422 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-11-23 13:02:27,422 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 13:02:27,423 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-23 13:02:27,423 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 27 [2018-11-23 13:02:27,423 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 13:02:27,423 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2018-11-23 13:02:27,445 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 24 edges. 24 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:02:27,446 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-23 13:02:27,446 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-23 13:02:27,446 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-23 13:02:27,446 INFO L87 Difference]: Start difference. First operand 29 states and 31 transitions. Second operand 4 states. [2018-11-23 13:02:27,772 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:02:27,773 INFO L93 Difference]: Finished difference Result 49 states and 54 transitions. [2018-11-23 13:02:27,773 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-23 13:02:27,773 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 27 [2018-11-23 13:02:27,773 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:02:27,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-23 13:02:27,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 46 transitions. [2018-11-23 13:02:27,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-23 13:02:27,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 46 transitions. [2018-11-23 13:02:27,777 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 46 transitions. [2018-11-23 13:02:28,101 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 46 edges. 46 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:02:28,106 INFO L225 Difference]: With dead ends: 49 [2018-11-23 13:02:28,106 INFO L226 Difference]: Without dead ends: 35 [2018-11-23 13:02:28,107 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-23 13:02:28,107 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2018-11-23 13:02:28,406 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 31. [2018-11-23 13:02:28,406 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 13:02:28,406 INFO L82 GeneralOperation]: Start isEquivalent. First operand 35 states. Second operand 31 states. [2018-11-23 13:02:28,407 INFO L74 IsIncluded]: Start isIncluded. First operand 35 states. Second operand 31 states. [2018-11-23 13:02:28,407 INFO L87 Difference]: Start difference. First operand 35 states. Second operand 31 states. [2018-11-23 13:02:28,408 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:02:28,409 INFO L93 Difference]: Finished difference Result 35 states and 37 transitions. [2018-11-23 13:02:28,409 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 37 transitions. [2018-11-23 13:02:28,409 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:02:28,409 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:02:28,409 INFO L74 IsIncluded]: Start isIncluded. First operand 31 states. Second operand 35 states. [2018-11-23 13:02:28,410 INFO L87 Difference]: Start difference. First operand 31 states. Second operand 35 states. [2018-11-23 13:02:28,414 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:02:28,414 INFO L93 Difference]: Finished difference Result 35 states and 37 transitions. [2018-11-23 13:02:28,414 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 37 transitions. [2018-11-23 13:02:28,414 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:02:28,414 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:02:28,415 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 13:02:28,415 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 13:02:28,415 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2018-11-23 13:02:28,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 33 transitions. [2018-11-23 13:02:28,420 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 33 transitions. Word has length 27 [2018-11-23 13:02:28,420 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:02:28,420 INFO L480 AbstractCegarLoop]: Abstraction has 31 states and 33 transitions. [2018-11-23 13:02:28,420 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-23 13:02:28,420 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 33 transitions. [2018-11-23 13:02:28,421 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-11-23 13:02:28,421 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:02:28,421 INFO L402 BasicCegarLoop]: trace histogram [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-23 13:02:28,421 INFO L423 AbstractCegarLoop]: === Iteration 9 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:02:28,422 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:02:28,422 INFO L82 PathProgramCache]: Analyzing trace with hash 1251560452, now seen corresponding path program 1 times [2018-11-23 13:02:28,422 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:02:28,422 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:02:28,425 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:02:28,426 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:02:28,426 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:02:28,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:02:28,657 INFO L256 TraceCheckUtils]: 0: Hoare triple {1441#true} call ULTIMATE.init(); {1441#true} is VALID [2018-11-23 13:02:28,657 INFO L273 TraceCheckUtils]: 1: Hoare triple {1441#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~SIZE~0 := 0; {1441#true} is VALID [2018-11-23 13:02:28,657 INFO L273 TraceCheckUtils]: 2: Hoare triple {1441#true} assume true; {1441#true} is VALID [2018-11-23 13:02:28,658 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1441#true} {1441#true} #54#return; {1441#true} is VALID [2018-11-23 13:02:28,658 INFO L256 TraceCheckUtils]: 4: Hoare triple {1441#true} call #t~ret5 := main(); {1441#true} is VALID [2018-11-23 13:02:28,658 INFO L273 TraceCheckUtils]: 5: Hoare triple {1441#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); {1441#true} is VALID [2018-11-23 13:02:28,658 INFO L256 TraceCheckUtils]: 6: Hoare triple {1441#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); {1441#true} is VALID [2018-11-23 13:02:28,659 INFO L273 TraceCheckUtils]: 7: Hoare triple {1441#true} ~a.base, ~a.offset := #in~a.base, #in~a.offset;~n := #in~n;~q := #in~q;~j~0 := 0; {1443#(= linear_search_~j~0 0)} is VALID [2018-11-23 13:02:28,660 INFO L273 TraceCheckUtils]: 8: Hoare triple {1443#(= linear_search_~j~0 0)} #t~short1 := ~j~0 % 4294967296 < ~n % 4294967296; {1443#(= linear_search_~j~0 0)} is VALID [2018-11-23 13:02:28,660 INFO L273 TraceCheckUtils]: 9: Hoare triple {1443#(= 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; {1443#(= linear_search_~j~0 0)} is VALID [2018-11-23 13:02:28,661 INFO L273 TraceCheckUtils]: 10: Hoare triple {1443#(= linear_search_~j~0 0)} assume !!#t~short1;havoc #t~short1;havoc #t~mem0;#t~post2 := ~j~0;~j~0 := 1 + #t~post2;havoc #t~post2; {1444#(and (<= linear_search_~j~0 1) (<= 1 linear_search_~j~0))} is VALID [2018-11-23 13:02:28,661 INFO L273 TraceCheckUtils]: 11: Hoare triple {1444#(and (<= linear_search_~j~0 1) (<= 1 linear_search_~j~0))} assume !(20 == ~j~0 % 4294967296); {1444#(and (<= linear_search_~j~0 1) (<= 1 linear_search_~j~0))} is VALID [2018-11-23 13:02:28,662 INFO L273 TraceCheckUtils]: 12: Hoare triple {1444#(and (<= linear_search_~j~0 1) (<= 1 linear_search_~j~0))} #t~short1 := ~j~0 % 4294967296 < ~n % 4294967296; {1444#(and (<= linear_search_~j~0 1) (<= 1 linear_search_~j~0))} is VALID [2018-11-23 13:02:28,662 INFO L273 TraceCheckUtils]: 13: Hoare triple {1444#(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; {1444#(and (<= linear_search_~j~0 1) (<= 1 linear_search_~j~0))} is VALID [2018-11-23 13:02:28,664 INFO L273 TraceCheckUtils]: 14: Hoare triple {1444#(and (<= linear_search_~j~0 1) (<= 1 linear_search_~j~0))} assume !!#t~short1;havoc #t~short1;havoc #t~mem0;#t~post2 := ~j~0;~j~0 := 1 + #t~post2;havoc #t~post2; {1445#(and (<= linear_search_~j~0 2) (< 0 (+ (div linear_search_~j~0 4294967296) 1)))} is VALID [2018-11-23 13:02:28,665 INFO L273 TraceCheckUtils]: 15: Hoare triple {1445#(and (<= linear_search_~j~0 2) (< 0 (+ (div linear_search_~j~0 4294967296) 1)))} assume 20 == ~j~0 % 4294967296;~j~0 := -1; {1442#false} is VALID [2018-11-23 13:02:28,665 INFO L273 TraceCheckUtils]: 16: Hoare triple {1442#false} #t~short1 := ~j~0 % 4294967296 < ~n % 4294967296; {1442#false} is VALID [2018-11-23 13:02:28,665 INFO L273 TraceCheckUtils]: 17: Hoare triple {1442#false} assume !#t~short1; {1442#false} is VALID [2018-11-23 13:02:28,665 INFO L273 TraceCheckUtils]: 18: Hoare triple {1442#false} assume !#t~short1;havoc #t~short1;havoc #t~mem0; {1442#false} is VALID [2018-11-23 13:02:28,666 INFO L273 TraceCheckUtils]: 19: Hoare triple {1442#false} assume !(~j~0 % 4294967296 < ~SIZE~0 % 4294967296);#res := 0; {1442#false} is VALID [2018-11-23 13:02:28,666 INFO L273 TraceCheckUtils]: 20: Hoare triple {1442#false} assume true; {1442#false} is VALID [2018-11-23 13:02:28,666 INFO L268 TraceCheckUtils]: 21: Hoare quadruple {1442#false} {1441#true} #58#return; {1442#false} is VALID [2018-11-23 13:02:28,667 INFO L273 TraceCheckUtils]: 22: Hoare triple {1442#false} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {1442#false} is VALID [2018-11-23 13:02:28,667 INFO L256 TraceCheckUtils]: 23: Hoare triple {1442#false} call __VERIFIER_assert(#t~ret4); {1442#false} is VALID [2018-11-23 13:02:28,667 INFO L273 TraceCheckUtils]: 24: Hoare triple {1442#false} ~cond := #in~cond; {1442#false} is VALID [2018-11-23 13:02:28,667 INFO L273 TraceCheckUtils]: 25: Hoare triple {1442#false} assume 0 == ~cond; {1442#false} is VALID [2018-11-23 13:02:28,668 INFO L273 TraceCheckUtils]: 26: Hoare triple {1442#false} assume !false; {1442#false} is VALID [2018-11-23 13:02:28,669 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 6 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:02:28,669 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 13:02:28,669 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 13:02:28,678 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:02:28,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:02:28,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:02:28,712 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:02:28,779 INFO L256 TraceCheckUtils]: 0: Hoare triple {1441#true} call ULTIMATE.init(); {1441#true} is VALID [2018-11-23 13:02:28,780 INFO L273 TraceCheckUtils]: 1: Hoare triple {1441#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~SIZE~0 := 0; {1441#true} is VALID [2018-11-23 13:02:28,780 INFO L273 TraceCheckUtils]: 2: Hoare triple {1441#true} assume true; {1441#true} is VALID [2018-11-23 13:02:28,780 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1441#true} {1441#true} #54#return; {1441#true} is VALID [2018-11-23 13:02:28,781 INFO L256 TraceCheckUtils]: 4: Hoare triple {1441#true} call #t~ret5 := main(); {1441#true} is VALID [2018-11-23 13:02:28,781 INFO L273 TraceCheckUtils]: 5: Hoare triple {1441#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); {1441#true} is VALID [2018-11-23 13:02:28,781 INFO L256 TraceCheckUtils]: 6: Hoare triple {1441#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); {1441#true} is VALID [2018-11-23 13:02:28,784 INFO L273 TraceCheckUtils]: 7: Hoare triple {1441#true} ~a.base, ~a.offset := #in~a.base, #in~a.offset;~n := #in~n;~q := #in~q;~j~0 := 0; {1443#(= linear_search_~j~0 0)} is VALID [2018-11-23 13:02:28,787 INFO L273 TraceCheckUtils]: 8: Hoare triple {1443#(= linear_search_~j~0 0)} #t~short1 := ~j~0 % 4294967296 < ~n % 4294967296; {1443#(= linear_search_~j~0 0)} is VALID [2018-11-23 13:02:28,796 INFO L273 TraceCheckUtils]: 9: Hoare triple {1443#(= 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; {1443#(= linear_search_~j~0 0)} is VALID [2018-11-23 13:02:28,801 INFO L273 TraceCheckUtils]: 10: Hoare triple {1443#(= linear_search_~j~0 0)} assume !!#t~short1;havoc #t~short1;havoc #t~mem0;#t~post2 := ~j~0;~j~0 := 1 + #t~post2;havoc #t~post2; {1444#(and (<= linear_search_~j~0 1) (<= 1 linear_search_~j~0))} is VALID [2018-11-23 13:02:28,802 INFO L273 TraceCheckUtils]: 11: Hoare triple {1444#(and (<= linear_search_~j~0 1) (<= 1 linear_search_~j~0))} assume !(20 == ~j~0 % 4294967296); {1444#(and (<= linear_search_~j~0 1) (<= 1 linear_search_~j~0))} is VALID [2018-11-23 13:02:28,806 INFO L273 TraceCheckUtils]: 12: Hoare triple {1444#(and (<= linear_search_~j~0 1) (<= 1 linear_search_~j~0))} #t~short1 := ~j~0 % 4294967296 < ~n % 4294967296; {1444#(and (<= linear_search_~j~0 1) (<= 1 linear_search_~j~0))} is VALID [2018-11-23 13:02:28,806 INFO L273 TraceCheckUtils]: 13: Hoare triple {1444#(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; {1444#(and (<= linear_search_~j~0 1) (<= 1 linear_search_~j~0))} is VALID [2018-11-23 13:02:28,807 INFO L273 TraceCheckUtils]: 14: Hoare triple {1444#(and (<= linear_search_~j~0 1) (<= 1 linear_search_~j~0))} assume !!#t~short1;havoc #t~short1;havoc #t~mem0;#t~post2 := ~j~0;~j~0 := 1 + #t~post2;havoc #t~post2; {1491#(and (<= 2 linear_search_~j~0) (<= linear_search_~j~0 2))} is VALID [2018-11-23 13:02:28,808 INFO L273 TraceCheckUtils]: 15: Hoare triple {1491#(and (<= 2 linear_search_~j~0) (<= linear_search_~j~0 2))} assume 20 == ~j~0 % 4294967296;~j~0 := -1; {1442#false} is VALID [2018-11-23 13:02:28,808 INFO L273 TraceCheckUtils]: 16: Hoare triple {1442#false} #t~short1 := ~j~0 % 4294967296 < ~n % 4294967296; {1442#false} is VALID [2018-11-23 13:02:28,808 INFO L273 TraceCheckUtils]: 17: Hoare triple {1442#false} assume !#t~short1; {1442#false} is VALID [2018-11-23 13:02:28,808 INFO L273 TraceCheckUtils]: 18: Hoare triple {1442#false} assume !#t~short1;havoc #t~short1;havoc #t~mem0; {1442#false} is VALID [2018-11-23 13:02:28,808 INFO L273 TraceCheckUtils]: 19: Hoare triple {1442#false} assume !(~j~0 % 4294967296 < ~SIZE~0 % 4294967296);#res := 0; {1442#false} is VALID [2018-11-23 13:02:28,809 INFO L273 TraceCheckUtils]: 20: Hoare triple {1442#false} assume true; {1442#false} is VALID [2018-11-23 13:02:28,809 INFO L268 TraceCheckUtils]: 21: Hoare quadruple {1442#false} {1441#true} #58#return; {1442#false} is VALID [2018-11-23 13:02:28,809 INFO L273 TraceCheckUtils]: 22: Hoare triple {1442#false} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {1442#false} is VALID [2018-11-23 13:02:28,809 INFO L256 TraceCheckUtils]: 23: Hoare triple {1442#false} call __VERIFIER_assert(#t~ret4); {1442#false} is VALID [2018-11-23 13:02:28,810 INFO L273 TraceCheckUtils]: 24: Hoare triple {1442#false} ~cond := #in~cond; {1442#false} is VALID [2018-11-23 13:02:28,810 INFO L273 TraceCheckUtils]: 25: Hoare triple {1442#false} assume 0 == ~cond; {1442#false} is VALID [2018-11-23 13:02:28,810 INFO L273 TraceCheckUtils]: 26: Hoare triple {1442#false} assume !false; {1442#false} is VALID [2018-11-23 13:02:28,812 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 6 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:02:28,840 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 13:02:28,841 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 6 [2018-11-23 13:02:28,841 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 27 [2018-11-23 13:02:28,841 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 13:02:28,842 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2018-11-23 13:02:28,885 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 29 edges. 29 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:02:28,886 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-23 13:02:28,886 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-23 13:02:28,886 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-11-23 13:02:28,889 INFO L87 Difference]: Start difference. First operand 31 states and 33 transitions. Second operand 6 states. [2018-11-23 13:02:29,320 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:02:29,320 INFO L93 Difference]: Finished difference Result 51 states and 55 transitions. [2018-11-23 13:02:29,321 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-23 13:02:29,321 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 27 [2018-11-23 13:02:29,321 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:02:29,322 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-23 13:02:29,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 51 transitions. [2018-11-23 13:02:29,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-23 13:02:29,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 51 transitions. [2018-11-23 13:02:29,326 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 51 transitions. [2018-11-23 13:02:29,391 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 51 edges. 51 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:02:29,394 INFO L225 Difference]: With dead ends: 51 [2018-11-23 13:02:29,394 INFO L226 Difference]: Without dead ends: 39 [2018-11-23 13:02:29,395 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 26 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-11-23 13:02:29,396 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2018-11-23 13:02:29,461 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 32. [2018-11-23 13:02:29,461 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 13:02:29,461 INFO L82 GeneralOperation]: Start isEquivalent. First operand 39 states. Second operand 32 states. [2018-11-23 13:02:29,461 INFO L74 IsIncluded]: Start isIncluded. First operand 39 states. Second operand 32 states. [2018-11-23 13:02:29,461 INFO L87 Difference]: Start difference. First operand 39 states. Second operand 32 states. [2018-11-23 13:02:29,463 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:02:29,464 INFO L93 Difference]: Finished difference Result 39 states and 43 transitions. [2018-11-23 13:02:29,464 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 43 transitions. [2018-11-23 13:02:29,464 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:02:29,464 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:02:29,464 INFO L74 IsIncluded]: Start isIncluded. First operand 32 states. Second operand 39 states. [2018-11-23 13:02:29,465 INFO L87 Difference]: Start difference. First operand 32 states. Second operand 39 states. [2018-11-23 13:02:29,466 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:02:29,467 INFO L93 Difference]: Finished difference Result 39 states and 43 transitions. [2018-11-23 13:02:29,467 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 43 transitions. [2018-11-23 13:02:29,467 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:02:29,467 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:02:29,468 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 13:02:29,468 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 13:02:29,468 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2018-11-23 13:02:29,469 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 34 transitions. [2018-11-23 13:02:29,469 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 34 transitions. Word has length 27 [2018-11-23 13:02:29,470 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:02:29,470 INFO L480 AbstractCegarLoop]: Abstraction has 32 states and 34 transitions. [2018-11-23 13:02:29,470 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-23 13:02:29,470 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 34 transitions. [2018-11-23 13:02:29,471 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-11-23 13:02:29,471 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:02:29,471 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:02:29,471 INFO L423 AbstractCegarLoop]: === Iteration 10 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:02:29,471 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:02:29,472 INFO L82 PathProgramCache]: Analyzing trace with hash 1902752900, now seen corresponding path program 2 times [2018-11-23 13:02:29,472 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:02:29,472 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:02:29,473 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:02:29,473 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:02:29,473 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:02:29,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:02:30,384 INFO L256 TraceCheckUtils]: 0: Hoare triple {1716#true} call ULTIMATE.init(); {1716#true} is VALID [2018-11-23 13:02:30,385 INFO L273 TraceCheckUtils]: 1: Hoare triple {1716#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~SIZE~0 := 0; {1716#true} is VALID [2018-11-23 13:02:30,385 INFO L273 TraceCheckUtils]: 2: Hoare triple {1716#true} assume true; {1716#true} is VALID [2018-11-23 13:02:30,385 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1716#true} {1716#true} #54#return; {1716#true} is VALID [2018-11-23 13:02:30,386 INFO L256 TraceCheckUtils]: 4: Hoare triple {1716#true} call #t~ret5 := main(); {1716#true} is VALID [2018-11-23 13:02:30,386 INFO L273 TraceCheckUtils]: 5: Hoare triple {1716#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); {1716#true} is VALID [2018-11-23 13:02:30,386 INFO L256 TraceCheckUtils]: 6: Hoare triple {1716#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); {1716#true} is VALID [2018-11-23 13:02:30,388 INFO L273 TraceCheckUtils]: 7: Hoare triple {1716#true} ~a.base, ~a.offset := #in~a.base, #in~a.offset;~n := #in~n;~q := #in~q;~j~0 := 0; {1718#(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-23 13:02:30,389 INFO L273 TraceCheckUtils]: 8: Hoare triple {1718#(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; {1719#(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-23 13:02:30,390 INFO L273 TraceCheckUtils]: 9: Hoare triple {1719#(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; {1719#(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-23 13:02:30,390 INFO L273 TraceCheckUtils]: 10: Hoare triple {1719#(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~short1;havoc #t~mem0;#t~post2 := ~j~0;~j~0 := 1 + #t~post2;havoc #t~post2; {1720#(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 1) (<= 1 linear_search_~j~0))} is VALID [2018-11-23 13:02:30,391 INFO L273 TraceCheckUtils]: 11: Hoare triple {1720#(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 1) (<= 1 linear_search_~j~0))} assume !(20 == ~j~0 % 4294967296); {1720#(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 1) (<= 1 linear_search_~j~0))} is VALID [2018-11-23 13:02:30,392 INFO L273 TraceCheckUtils]: 12: Hoare triple {1720#(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 1) (<= 1 linear_search_~j~0))} #t~short1 := ~j~0 % 4294967296 < ~n % 4294967296; {1720#(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 1) (<= 1 linear_search_~j~0))} is VALID [2018-11-23 13:02:30,394 INFO L273 TraceCheckUtils]: 13: Hoare triple {1720#(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 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; {1720#(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 1) (<= 1 linear_search_~j~0))} is VALID [2018-11-23 13:02:30,395 INFO L273 TraceCheckUtils]: 14: Hoare triple {1720#(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 1) (<= 1 linear_search_~j~0))} assume !!#t~short1;havoc #t~short1;havoc #t~mem0;#t~post2 := ~j~0;~j~0 := 1 + #t~post2;havoc #t~post2; {1721#(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))) (< 0 (+ (div linear_search_~j~0 4294967296) 1)) (<= linear_search_~j~0 2))} is VALID [2018-11-23 13:02:30,397 INFO L273 TraceCheckUtils]: 15: Hoare triple {1721#(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))) (< 0 (+ (div linear_search_~j~0 4294967296) 1)) (<= linear_search_~j~0 2))} assume !(20 == ~j~0 % 4294967296); {1721#(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))) (< 0 (+ (div linear_search_~j~0 4294967296) 1)) (<= linear_search_~j~0 2))} is VALID [2018-11-23 13:02:30,399 INFO L273 TraceCheckUtils]: 16: Hoare triple {1721#(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))) (< 0 (+ (div linear_search_~j~0 4294967296) 1)) (<= linear_search_~j~0 2))} #t~short1 := ~j~0 % 4294967296 < ~n % 4294967296; {1722#(and (or (<= (+ linear_search_~j~0 1) (+ (* 4294967296 (div linear_search_~j~0 4294967296)) |linear_search_#in~n|)) (not |linear_search_#t~short1|) (<= (+ |linear_search_#in~n| 1) 0)) (< 0 (+ (div linear_search_~j~0 4294967296) 1)) (<= linear_search_~j~0 2))} is VALID [2018-11-23 13:02:30,400 INFO L273 TraceCheckUtils]: 17: Hoare triple {1722#(and (or (<= (+ linear_search_~j~0 1) (+ (* 4294967296 (div linear_search_~j~0 4294967296)) |linear_search_#in~n|)) (not |linear_search_#t~short1|) (<= (+ |linear_search_#in~n| 1) 0)) (< 0 (+ (div linear_search_~j~0 4294967296) 1)) (<= linear_search_~j~0 2))} 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; {1723#(and (or (<= (+ linear_search_~j~0 1) (+ (* 4294967296 (div linear_search_~j~0 4294967296)) |linear_search_#in~n|)) (<= (+ |linear_search_#in~n| 1) 0)) (< 0 (+ (div linear_search_~j~0 4294967296) 1)) (<= linear_search_~j~0 2))} is VALID [2018-11-23 13:02:30,402 INFO L273 TraceCheckUtils]: 18: Hoare triple {1723#(and (or (<= (+ linear_search_~j~0 1) (+ (* 4294967296 (div linear_search_~j~0 4294967296)) |linear_search_#in~n|)) (<= (+ |linear_search_#in~n| 1) 0)) (< 0 (+ (div linear_search_~j~0 4294967296) 1)) (<= linear_search_~j~0 2))} assume !#t~short1;havoc #t~short1;havoc #t~mem0; {1723#(and (or (<= (+ linear_search_~j~0 1) (+ (* 4294967296 (div linear_search_~j~0 4294967296)) |linear_search_#in~n|)) (<= (+ |linear_search_#in~n| 1) 0)) (< 0 (+ (div linear_search_~j~0 4294967296) 1)) (<= linear_search_~j~0 2))} is VALID [2018-11-23 13:02:30,403 INFO L273 TraceCheckUtils]: 19: Hoare triple {1723#(and (or (<= (+ linear_search_~j~0 1) (+ (* 4294967296 (div linear_search_~j~0 4294967296)) |linear_search_#in~n|)) (<= (+ |linear_search_#in~n| 1) 0)) (< 0 (+ (div linear_search_~j~0 4294967296) 1)) (<= linear_search_~j~0 2))} assume !(~j~0 % 4294967296 < ~SIZE~0 % 4294967296);#res := 0; {1724#(and (or (<= (+ |linear_search_#in~n| 1) 0) (<= (+ ~SIZE~0 1) (+ |linear_search_#in~n| (* 4294967296 (div ~SIZE~0 4294967296))))) (<= ~SIZE~0 (+ (* 4294967296 (div ~SIZE~0 4294967296)) 2)))} is VALID [2018-11-23 13:02:30,404 INFO L273 TraceCheckUtils]: 20: Hoare triple {1724#(and (or (<= (+ |linear_search_#in~n| 1) 0) (<= (+ ~SIZE~0 1) (+ |linear_search_#in~n| (* 4294967296 (div ~SIZE~0 4294967296))))) (<= ~SIZE~0 (+ (* 4294967296 (div ~SIZE~0 4294967296)) 2)))} assume true; {1724#(and (or (<= (+ |linear_search_#in~n| 1) 0) (<= (+ ~SIZE~0 1) (+ |linear_search_#in~n| (* 4294967296 (div ~SIZE~0 4294967296))))) (<= ~SIZE~0 (+ (* 4294967296 (div ~SIZE~0 4294967296)) 2)))} is VALID [2018-11-23 13:02:30,407 INFO L268 TraceCheckUtils]: 21: Hoare quadruple {1724#(and (or (<= (+ |linear_search_#in~n| 1) 0) (<= (+ ~SIZE~0 1) (+ |linear_search_#in~n| (* 4294967296 (div ~SIZE~0 4294967296))))) (<= ~SIZE~0 (+ (* 4294967296 (div ~SIZE~0 4294967296)) 2)))} {1716#true} #58#return; {1717#false} is VALID [2018-11-23 13:02:30,408 INFO L273 TraceCheckUtils]: 22: Hoare triple {1717#false} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {1717#false} is VALID [2018-11-23 13:02:30,408 INFO L256 TraceCheckUtils]: 23: Hoare triple {1717#false} call __VERIFIER_assert(#t~ret4); {1717#false} is VALID [2018-11-23 13:02:30,408 INFO L273 TraceCheckUtils]: 24: Hoare triple {1717#false} ~cond := #in~cond; {1717#false} is VALID [2018-11-23 13:02:30,409 INFO L273 TraceCheckUtils]: 25: Hoare triple {1717#false} assume 0 == ~cond; {1717#false} is VALID [2018-11-23 13:02:30,409 INFO L273 TraceCheckUtils]: 26: Hoare triple {1717#false} assume !false; {1717#false} is VALID [2018-11-23 13:02:30,413 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:02:30,413 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 13:02:30,413 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 13:02:30,428 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-23 13:02:30,466 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2018-11-23 13:02:30,466 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 13:02:30,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:02:30,495 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:02:31,614 INFO L256 TraceCheckUtils]: 0: Hoare triple {1716#true} call ULTIMATE.init(); {1716#true} is VALID [2018-11-23 13:02:31,615 INFO L273 TraceCheckUtils]: 1: Hoare triple {1716#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~SIZE~0 := 0; {1716#true} is VALID [2018-11-23 13:02:31,615 INFO L273 TraceCheckUtils]: 2: Hoare triple {1716#true} assume true; {1716#true} is VALID [2018-11-23 13:02:31,615 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1716#true} {1716#true} #54#return; {1716#true} is VALID [2018-11-23 13:02:31,616 INFO L256 TraceCheckUtils]: 4: Hoare triple {1716#true} call #t~ret5 := main(); {1716#true} is VALID [2018-11-23 13:02:31,618 INFO L273 TraceCheckUtils]: 5: Hoare triple {1716#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); {1743#(and (exists ((v_prenex_21 Int)) (and (<= 0 (mod v_prenex_21 4294967296)) (= ~SIZE~0 (+ (div (mod v_prenex_21 4294967296) 2) 1)))) (= |main_~#a~0.offset| 0))} is VALID [2018-11-23 13:02:31,619 INFO L256 TraceCheckUtils]: 6: Hoare triple {1743#(and (exists ((v_prenex_21 Int)) (and (<= 0 (mod v_prenex_21 4294967296)) (= ~SIZE~0 (+ (div (mod v_prenex_21 4294967296) 2) 1)))) (= |main_~#a~0.offset| 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); {1747#(exists ((v_prenex_21 Int)) (and (<= 0 (mod v_prenex_21 4294967296)) (= ~SIZE~0 (+ (div (mod v_prenex_21 4294967296) 2) 1))))} is VALID [2018-11-23 13:02:31,621 INFO L273 TraceCheckUtils]: 7: Hoare triple {1747#(exists ((v_prenex_21 Int)) (and (<= 0 (mod v_prenex_21 4294967296)) (= ~SIZE~0 (+ (div (mod v_prenex_21 4294967296) 2) 1))))} ~a.base, ~a.offset := #in~a.base, #in~a.offset;~n := #in~n;~q := #in~q;~j~0 := 0; {1751#(and (exists ((v_prenex_21 Int)) (and (<= 0 (mod v_prenex_21 4294967296)) (= ~SIZE~0 (+ (div (mod v_prenex_21 4294967296) 2) 1)))) (= |linear_search_#in~n| linear_search_~n))} is VALID [2018-11-23 13:02:31,622 INFO L273 TraceCheckUtils]: 8: Hoare triple {1751#(and (exists ((v_prenex_21 Int)) (and (<= 0 (mod v_prenex_21 4294967296)) (= ~SIZE~0 (+ (div (mod v_prenex_21 4294967296) 2) 1)))) (= |linear_search_#in~n| linear_search_~n))} #t~short1 := ~j~0 % 4294967296 < ~n % 4294967296; {1751#(and (exists ((v_prenex_21 Int)) (and (<= 0 (mod v_prenex_21 4294967296)) (= ~SIZE~0 (+ (div (mod v_prenex_21 4294967296) 2) 1)))) (= |linear_search_#in~n| linear_search_~n))} is VALID [2018-11-23 13:02:31,622 INFO L273 TraceCheckUtils]: 9: Hoare triple {1751#(and (exists ((v_prenex_21 Int)) (and (<= 0 (mod v_prenex_21 4294967296)) (= ~SIZE~0 (+ (div (mod v_prenex_21 4294967296) 2) 1)))) (= |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; {1751#(and (exists ((v_prenex_21 Int)) (and (<= 0 (mod v_prenex_21 4294967296)) (= ~SIZE~0 (+ (div (mod v_prenex_21 4294967296) 2) 1)))) (= |linear_search_#in~n| linear_search_~n))} is VALID [2018-11-23 13:02:31,623 INFO L273 TraceCheckUtils]: 10: Hoare triple {1751#(and (exists ((v_prenex_21 Int)) (and (<= 0 (mod v_prenex_21 4294967296)) (= ~SIZE~0 (+ (div (mod v_prenex_21 4294967296) 2) 1)))) (= |linear_search_#in~n| linear_search_~n))} assume !!#t~short1;havoc #t~short1;havoc #t~mem0;#t~post2 := ~j~0;~j~0 := 1 + #t~post2;havoc #t~post2; {1751#(and (exists ((v_prenex_21 Int)) (and (<= 0 (mod v_prenex_21 4294967296)) (= ~SIZE~0 (+ (div (mod v_prenex_21 4294967296) 2) 1)))) (= |linear_search_#in~n| linear_search_~n))} is VALID [2018-11-23 13:02:31,624 INFO L273 TraceCheckUtils]: 11: Hoare triple {1751#(and (exists ((v_prenex_21 Int)) (and (<= 0 (mod v_prenex_21 4294967296)) (= ~SIZE~0 (+ (div (mod v_prenex_21 4294967296) 2) 1)))) (= |linear_search_#in~n| linear_search_~n))} assume !(20 == ~j~0 % 4294967296); {1751#(and (exists ((v_prenex_21 Int)) (and (<= 0 (mod v_prenex_21 4294967296)) (= ~SIZE~0 (+ (div (mod v_prenex_21 4294967296) 2) 1)))) (= |linear_search_#in~n| linear_search_~n))} is VALID [2018-11-23 13:02:31,624 INFO L273 TraceCheckUtils]: 12: Hoare triple {1751#(and (exists ((v_prenex_21 Int)) (and (<= 0 (mod v_prenex_21 4294967296)) (= ~SIZE~0 (+ (div (mod v_prenex_21 4294967296) 2) 1)))) (= |linear_search_#in~n| linear_search_~n))} #t~short1 := ~j~0 % 4294967296 < ~n % 4294967296; {1751#(and (exists ((v_prenex_21 Int)) (and (<= 0 (mod v_prenex_21 4294967296)) (= ~SIZE~0 (+ (div (mod v_prenex_21 4294967296) 2) 1)))) (= |linear_search_#in~n| linear_search_~n))} is VALID [2018-11-23 13:02:31,625 INFO L273 TraceCheckUtils]: 13: Hoare triple {1751#(and (exists ((v_prenex_21 Int)) (and (<= 0 (mod v_prenex_21 4294967296)) (= ~SIZE~0 (+ (div (mod v_prenex_21 4294967296) 2) 1)))) (= |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; {1751#(and (exists ((v_prenex_21 Int)) (and (<= 0 (mod v_prenex_21 4294967296)) (= ~SIZE~0 (+ (div (mod v_prenex_21 4294967296) 2) 1)))) (= |linear_search_#in~n| linear_search_~n))} is VALID [2018-11-23 13:02:31,626 INFO L273 TraceCheckUtils]: 14: Hoare triple {1751#(and (exists ((v_prenex_21 Int)) (and (<= 0 (mod v_prenex_21 4294967296)) (= ~SIZE~0 (+ (div (mod v_prenex_21 4294967296) 2) 1)))) (= |linear_search_#in~n| linear_search_~n))} assume !!#t~short1;havoc #t~short1;havoc #t~mem0;#t~post2 := ~j~0;~j~0 := 1 + #t~post2;havoc #t~post2; {1751#(and (exists ((v_prenex_21 Int)) (and (<= 0 (mod v_prenex_21 4294967296)) (= ~SIZE~0 (+ (div (mod v_prenex_21 4294967296) 2) 1)))) (= |linear_search_#in~n| linear_search_~n))} is VALID [2018-11-23 13:02:31,627 INFO L273 TraceCheckUtils]: 15: Hoare triple {1751#(and (exists ((v_prenex_21 Int)) (and (<= 0 (mod v_prenex_21 4294967296)) (= ~SIZE~0 (+ (div (mod v_prenex_21 4294967296) 2) 1)))) (= |linear_search_#in~n| linear_search_~n))} assume !(20 == ~j~0 % 4294967296); {1751#(and (exists ((v_prenex_21 Int)) (and (<= 0 (mod v_prenex_21 4294967296)) (= ~SIZE~0 (+ (div (mod v_prenex_21 4294967296) 2) 1)))) (= |linear_search_#in~n| linear_search_~n))} is VALID [2018-11-23 13:02:31,629 INFO L273 TraceCheckUtils]: 16: Hoare triple {1751#(and (exists ((v_prenex_21 Int)) (and (<= 0 (mod v_prenex_21 4294967296)) (= ~SIZE~0 (+ (div (mod v_prenex_21 4294967296) 2) 1)))) (= |linear_search_#in~n| linear_search_~n))} #t~short1 := ~j~0 % 4294967296 < ~n % 4294967296; {1779#(or (and (exists ((v_prenex_21 Int)) (and (<= 0 (mod v_prenex_21 4294967296)) (= ~SIZE~0 (+ (div (mod v_prenex_21 4294967296) 2) 1)))) |linear_search_#t~short1| (< (mod linear_search_~j~0 4294967296) (mod |linear_search_#in~n| 4294967296))) (and (exists ((v_prenex_21 Int)) (and (<= 0 (mod v_prenex_21 4294967296)) (= ~SIZE~0 (+ (div (mod v_prenex_21 4294967296) 2) 1)))) (<= (mod |linear_search_#in~n| 4294967296) (mod linear_search_~j~0 4294967296)) (not |linear_search_#t~short1|)))} is VALID [2018-11-23 13:02:31,636 INFO L273 TraceCheckUtils]: 17: Hoare triple {1779#(or (and (exists ((v_prenex_21 Int)) (and (<= 0 (mod v_prenex_21 4294967296)) (= ~SIZE~0 (+ (div (mod v_prenex_21 4294967296) 2) 1)))) |linear_search_#t~short1| (< (mod linear_search_~j~0 4294967296) (mod |linear_search_#in~n| 4294967296))) (and (exists ((v_prenex_21 Int)) (and (<= 0 (mod v_prenex_21 4294967296)) (= ~SIZE~0 (+ (div (mod v_prenex_21 4294967296) 2) 1)))) (<= (mod |linear_search_#in~n| 4294967296) (mod linear_search_~j~0 4294967296)) (not |linear_search_#t~short1|)))} 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; {1783#(and (exists ((v_prenex_21 Int)) (and (<= 0 (mod v_prenex_21 4294967296)) (= ~SIZE~0 (+ (div (mod v_prenex_21 4294967296) 2) 1)))) (< (mod linear_search_~j~0 4294967296) (mod |linear_search_#in~n| 4294967296)))} is VALID [2018-11-23 13:02:31,637 INFO L273 TraceCheckUtils]: 18: Hoare triple {1783#(and (exists ((v_prenex_21 Int)) (and (<= 0 (mod v_prenex_21 4294967296)) (= ~SIZE~0 (+ (div (mod v_prenex_21 4294967296) 2) 1)))) (< (mod linear_search_~j~0 4294967296) (mod |linear_search_#in~n| 4294967296)))} assume !#t~short1;havoc #t~short1;havoc #t~mem0; {1783#(and (exists ((v_prenex_21 Int)) (and (<= 0 (mod v_prenex_21 4294967296)) (= ~SIZE~0 (+ (div (mod v_prenex_21 4294967296) 2) 1)))) (< (mod linear_search_~j~0 4294967296) (mod |linear_search_#in~n| 4294967296)))} is VALID [2018-11-23 13:02:31,639 INFO L273 TraceCheckUtils]: 19: Hoare triple {1783#(and (exists ((v_prenex_21 Int)) (and (<= 0 (mod v_prenex_21 4294967296)) (= ~SIZE~0 (+ (div (mod v_prenex_21 4294967296) 2) 1)))) (< (mod linear_search_~j~0 4294967296) (mod |linear_search_#in~n| 4294967296)))} assume !(~j~0 % 4294967296 < ~SIZE~0 % 4294967296);#res := 0; {1790#(and (exists ((v_prenex_21 Int)) (and (<= 0 (mod v_prenex_21 4294967296)) (= ~SIZE~0 (+ (div (mod v_prenex_21 4294967296) 2) 1)))) (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-23 13:02:31,639 INFO L273 TraceCheckUtils]: 20: Hoare triple {1790#(and (exists ((v_prenex_21 Int)) (and (<= 0 (mod v_prenex_21 4294967296)) (= ~SIZE~0 (+ (div (mod v_prenex_21 4294967296) 2) 1)))) (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; {1790#(and (exists ((v_prenex_21 Int)) (and (<= 0 (mod v_prenex_21 4294967296)) (= ~SIZE~0 (+ (div (mod v_prenex_21 4294967296) 2) 1)))) (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-23 13:02:31,641 INFO L268 TraceCheckUtils]: 21: Hoare quadruple {1790#(and (exists ((v_prenex_21 Int)) (and (<= 0 (mod v_prenex_21 4294967296)) (= ~SIZE~0 (+ (div (mod v_prenex_21 4294967296) 2) 1)))) (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)))))} {1743#(and (exists ((v_prenex_21 Int)) (and (<= 0 (mod v_prenex_21 4294967296)) (= ~SIZE~0 (+ (div (mod v_prenex_21 4294967296) 2) 1)))) (= |main_~#a~0.offset| 0))} #58#return; {1717#false} is VALID [2018-11-23 13:02:31,642 INFO L273 TraceCheckUtils]: 22: Hoare triple {1717#false} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {1717#false} is VALID [2018-11-23 13:02:31,642 INFO L256 TraceCheckUtils]: 23: Hoare triple {1717#false} call __VERIFIER_assert(#t~ret4); {1717#false} is VALID [2018-11-23 13:02:31,642 INFO L273 TraceCheckUtils]: 24: Hoare triple {1717#false} ~cond := #in~cond; {1717#false} is VALID [2018-11-23 13:02:31,642 INFO L273 TraceCheckUtils]: 25: Hoare triple {1717#false} assume 0 == ~cond; {1717#false} is VALID [2018-11-23 13:02:31,643 INFO L273 TraceCheckUtils]: 26: Hoare triple {1717#false} assume !false; {1717#false} is VALID [2018-11-23 13:02:31,646 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-11-23 13:02:31,665 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 13:02:31,666 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 15 [2018-11-23 13:02:31,666 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 27 [2018-11-23 13:02:31,666 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 13:02:31,666 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 15 states. [2018-11-23 13:02:31,725 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 40 edges. 40 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:02:31,725 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-11-23 13:02:31,726 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-11-23 13:02:31,726 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=173, Unknown=0, NotChecked=0, Total=210 [2018-11-23 13:02:31,726 INFO L87 Difference]: Start difference. First operand 32 states and 34 transitions. Second operand 15 states. [2018-11-23 13:02:34,247 WARN L180 SmtUtils]: Spent 2.09 s on a formula simplification. DAG size of input: 47 DAG size of output: 28 [2018-11-23 13:02:34,737 WARN L180 SmtUtils]: Spent 426.00 ms on a formula simplification. DAG size of input: 41 DAG size of output: 22 [2018-11-23 13:02:38,580 WARN L180 SmtUtils]: Spent 3.76 s on a formula simplification. DAG size of input: 31 DAG size of output: 20 [2018-11-23 13:02:38,836 WARN L180 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 29 [2018-11-23 13:02:39,802 WARN L180 SmtUtils]: Spent 480.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 25 [2018-11-23 13:02:41,983 WARN L180 SmtUtils]: Spent 1.86 s on a formula simplification. DAG size of input: 27 DAG size of output: 27 [2018-11-23 13:02:42,502 WARN L180 SmtUtils]: Spent 450.00 ms on a formula simplification that was a NOOP. DAG size: 21 [2018-11-23 13:02:43,245 WARN L180 SmtUtils]: Spent 536.00 ms on a formula simplification that was a NOOP. DAG size: 25 [2018-11-23 13:02:43,355 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:02:43,355 INFO L93 Difference]: Finished difference Result 51 states and 54 transitions. [2018-11-23 13:02:43,356 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-11-23 13:02:43,356 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 27 [2018-11-23 13:02:43,356 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:02:43,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2018-11-23 13:02:43,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 52 transitions. [2018-11-23 13:02:43,358 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2018-11-23 13:02:43,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 52 transitions. [2018-11-23 13:02:43,360 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 18 states and 52 transitions. [2018-11-23 13:02:43,503 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-23 13:02:43,504 INFO L225 Difference]: With dead ends: 51 [2018-11-23 13:02:43,504 INFO L226 Difference]: Without dead ends: 39 [2018-11-23 13:02:43,505 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 22 SyntacticMatches, 2 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 110 ImplicationChecksByTransitivity, 11.6s TimeCoverageRelationStatistics Valid=159, Invalid=597, Unknown=0, NotChecked=0, Total=756 [2018-11-23 13:02:43,506 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2018-11-23 13:02:43,592 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 32. [2018-11-23 13:02:43,592 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 13:02:43,592 INFO L82 GeneralOperation]: Start isEquivalent. First operand 39 states. Second operand 32 states. [2018-11-23 13:02:43,593 INFO L74 IsIncluded]: Start isIncluded. First operand 39 states. Second operand 32 states. [2018-11-23 13:02:43,593 INFO L87 Difference]: Start difference. First operand 39 states. Second operand 32 states. [2018-11-23 13:02:43,595 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:02:43,596 INFO L93 Difference]: Finished difference Result 39 states and 41 transitions. [2018-11-23 13:02:43,596 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 41 transitions. [2018-11-23 13:02:43,596 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:02:43,596 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:02:43,596 INFO L74 IsIncluded]: Start isIncluded. First operand 32 states. Second operand 39 states. [2018-11-23 13:02:43,597 INFO L87 Difference]: Start difference. First operand 32 states. Second operand 39 states. [2018-11-23 13:02:43,598 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:02:43,598 INFO L93 Difference]: Finished difference Result 39 states and 41 transitions. [2018-11-23 13:02:43,598 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 41 transitions. [2018-11-23 13:02:43,598 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:02:43,598 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:02:43,599 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 13:02:43,599 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 13:02:43,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2018-11-23 13:02:43,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 33 transitions. [2018-11-23 13:02:43,600 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 33 transitions. Word has length 27 [2018-11-23 13:02:43,600 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:02:43,600 INFO L480 AbstractCegarLoop]: Abstraction has 32 states and 33 transitions. [2018-11-23 13:02:43,600 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-11-23 13:02:43,601 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 33 transitions. [2018-11-23 13:02:43,601 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-11-23 13:02:43,601 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:02:43,601 INFO L402 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:02:43,601 INFO L423 AbstractCegarLoop]: === Iteration 11 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:02:43,602 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:02:43,602 INFO L82 PathProgramCache]: Analyzing trace with hash 1509725890, now seen corresponding path program 2 times [2018-11-23 13:02:43,602 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:02:43,602 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:02:43,603 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:02:43,603 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 13:02:43,603 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:02:43,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:02:44,198 WARN L180 SmtUtils]: Spent 303.00 ms on a formula simplification. DAG size of input: 200 DAG size of output: 34 [2018-11-23 13:02:44,875 WARN L180 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 35 [2018-11-23 13:02:44,961 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:456) 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:334) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:174) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:126) 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-23 13:02:44,967 INFO L168 Benchmark]: Toolchain (without parser) took 36217.78 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.1 GB in the end (delta: -644.3 MB). Peak memory consumption was 417.3 MB. Max. memory is 7.1 GB. [2018-11-23 13:02:44,968 INFO L168 Benchmark]: CDTParser took 0.20 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-11-23 13:02:44,968 INFO L168 Benchmark]: CACSL2BoogieTranslator took 369.43 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 7.1 GB. [2018-11-23 13:02:44,969 INFO L168 Benchmark]: Boogie Procedure Inliner took 29.00 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-11-23 13:02:44,969 INFO L168 Benchmark]: Boogie Preprocessor took 34.26 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-11-23 13:02:44,970 INFO L168 Benchmark]: RCFGBuilder took 703.25 ms. Allocated memory was 1.5 GB in the beginning and 2.2 GB in the end (delta: 718.3 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -751.3 MB). Peak memory consumption was 14.8 MB. Max. memory is 7.1 GB. [2018-11-23 13:02:44,970 INFO L168 Benchmark]: TraceAbstraction took 35076.39 ms. Allocated memory was 2.2 GB in the beginning and 2.6 GB in the end (delta: 343.4 MB). Free memory was 2.2 GB in the beginning and 2.1 GB in the end (delta: 96.4 MB). Peak memory consumption was 439.8 MB. Max. memory is 7.1 GB. [2018-11-23 13:02:44,974 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.20 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 369.43 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 29.00 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Preprocessor took 34.26 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 703.25 ms. Allocated memory was 1.5 GB in the beginning and 2.2 GB in the end (delta: 718.3 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -751.3 MB). Peak memory consumption was 14.8 MB. Max. memory is 7.1 GB. * TraceAbstraction took 35076.39 ms. Allocated memory was 2.2 GB in the beginning and 2.6 GB in the end (delta: 343.4 MB). Free memory was 2.2 GB in the beginning and 2.1 GB in the end (delta: 96.4 MB). Peak memory consumption was 439.8 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...