java -ea -Xmx8000000000 -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/array-examples/data_structures_set_multi_proc_true-unreach-call_ground.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-370d6ab [2018-11-14 16:53:37,687 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-14 16:53:37,689 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-14 16:53:37,702 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-14 16:53:37,702 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-14 16:53:37,703 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-14 16:53:37,705 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-14 16:53:37,707 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-14 16:53:37,709 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-14 16:53:37,709 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-14 16:53:37,710 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-14 16:53:37,711 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-14 16:53:37,712 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-14 16:53:37,713 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-14 16:53:37,714 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-14 16:53:37,715 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-14 16:53:37,716 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-14 16:53:37,718 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-14 16:53:37,720 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-14 16:53:37,722 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-14 16:53:37,723 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-14 16:53:37,724 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-14 16:53:37,727 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-14 16:53:37,727 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-14 16:53:37,727 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-14 16:53:37,728 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-14 16:53:37,729 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-14 16:53:37,730 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-14 16:53:37,731 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-14 16:53:37,732 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-14 16:53:37,733 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-14 16:53:37,733 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-14 16:53:37,734 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-14 16:53:37,734 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-14 16:53:37,735 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-14 16:53:37,736 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-14 16:53:37,736 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-14 16:53:37,759 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-14 16:53:37,760 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-14 16:53:37,761 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-14 16:53:37,761 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-11-14 16:53:37,762 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-14 16:53:37,762 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-14 16:53:37,762 INFO L133 SettingsManager]: * Use SBE=true [2018-11-14 16:53:37,762 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-14 16:53:37,762 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-14 16:53:37,763 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-14 16:53:37,763 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-14 16:53:37,763 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-14 16:53:37,763 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-14 16:53:37,763 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-14 16:53:37,764 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-14 16:53:37,764 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-14 16:53:37,764 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-14 16:53:37,764 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-14 16:53:37,764 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-14 16:53:37,765 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-14 16:53:37,765 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-14 16:53:37,765 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-14 16:53:37,765 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-14 16:53:37,765 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-14 16:53:37,766 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-14 16:53:37,766 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-14 16:53:37,766 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-14 16:53:37,766 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-14 16:53:37,766 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-14 16:53:37,767 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-14 16:53:37,813 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-14 16:53:37,824 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-14 16:53:37,828 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-14 16:53:37,830 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-14 16:53:37,831 INFO L276 PluginConnector]: CDTParser initialized [2018-11-14 16:53:37,831 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-examples/data_structures_set_multi_proc_true-unreach-call_ground.i [2018-11-14 16:53:37,892 INFO L218 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a6ee368db/845da0c52c18479dae1bb19c8e3eff17/FLAG555efde28 [2018-11-14 16:53:38,401 INFO L298 CDTParser]: Found 1 translation units. [2018-11-14 16:53:38,402 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/array-examples/data_structures_set_multi_proc_true-unreach-call_ground.i [2018-11-14 16:53:38,410 INFO L346 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a6ee368db/845da0c52c18479dae1bb19c8e3eff17/FLAG555efde28 [2018-11-14 16:53:38,431 INFO L354 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a6ee368db/845da0c52c18479dae1bb19c8e3eff17 [2018-11-14 16:53:38,441 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-14 16:53:38,442 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-11-14 16:53:38,444 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-14 16:53:38,444 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-14 16:53:38,448 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-14 16:53:38,450 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.11 04:53:38" (1/1) ... [2018-11-14 16:53:38,453 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@24c95ea0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 04:53:38, skipping insertion in model container [2018-11-14 16:53:38,453 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.11 04:53:38" (1/1) ... [2018-11-14 16:53:38,462 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-14 16:53:38,485 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-14 16:53:38,757 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-14 16:53:38,771 INFO L191 MainTranslator]: Completed pre-run [2018-11-14 16:53:38,815 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-14 16:53:38,839 INFO L195 MainTranslator]: Completed translation [2018-11-14 16:53:38,839 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 04:53:38 WrapperNode [2018-11-14 16:53:38,840 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-14 16:53:38,841 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-14 16:53:38,841 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-14 16:53:38,842 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-14 16:53:38,859 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 04:53:38" (1/1) ... [2018-11-14 16:53:38,860 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 04:53:38" (1/1) ... [2018-11-14 16:53:38,872 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 04:53:38" (1/1) ... [2018-11-14 16:53:38,872 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 04:53:38" (1/1) ... [2018-11-14 16:53:38,899 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 04:53:38" (1/1) ... [2018-11-14 16:53:38,914 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 04:53:38" (1/1) ... [2018-11-14 16:53:38,917 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 04:53:38" (1/1) ... [2018-11-14 16:53:38,926 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-14 16:53:38,927 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-14 16:53:38,927 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-14 16:53:38,927 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-14 16:53:38,928 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 04:53:38" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-14 16:53:39,062 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-14 16:53:39,063 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-14 16:53:39,063 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2018-11-14 16:53:39,063 INFO L138 BoogieDeclarations]: Found implementation of procedure insert [2018-11-14 16:53:39,063 INFO L138 BoogieDeclarations]: Found implementation of procedure elem_exists [2018-11-14 16:53:39,063 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-14 16:53:39,064 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2018-11-14 16:53:39,064 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2018-11-14 16:53:39,064 INFO L130 BoogieDeclarations]: Found specification of procedure insert [2018-11-14 16:53:39,064 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-14 16:53:39,064 INFO L130 BoogieDeclarations]: Found specification of procedure elem_exists [2018-11-14 16:53:39,064 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-14 16:53:39,065 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-14 16:53:39,065 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-14 16:53:39,065 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-14 16:53:39,065 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-14 16:53:39,065 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-14 16:53:39,065 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2018-11-14 16:53:40,163 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-14 16:53:40,164 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.11 04:53:40 BoogieIcfgContainer [2018-11-14 16:53:40,164 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-14 16:53:40,165 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-14 16:53:40,165 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-14 16:53:40,169 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-14 16:53:40,169 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.11 04:53:38" (1/3) ... [2018-11-14 16:53:40,170 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@27177869 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.11 04:53:40, skipping insertion in model container [2018-11-14 16:53:40,170 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 04:53:38" (2/3) ... [2018-11-14 16:53:40,171 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@27177869 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.11 04:53:40, skipping insertion in model container [2018-11-14 16:53:40,171 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.11 04:53:40" (3/3) ... [2018-11-14 16:53:40,173 INFO L112 eAbstractionObserver]: Analyzing ICFG data_structures_set_multi_proc_true-unreach-call_ground.i [2018-11-14 16:53:40,184 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-14 16:53:40,193 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-14 16:53:40,211 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-14 16:53:40,246 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-14 16:53:40,247 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-14 16:53:40,248 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-14 16:53:40,248 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-14 16:53:40,248 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-14 16:53:40,248 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-14 16:53:40,249 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-14 16:53:40,249 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-14 16:53:40,249 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-14 16:53:40,270 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states. [2018-11-14 16:53:40,275 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-11-14 16:53:40,276 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 16:53:40,276 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 16:53:40,279 INFO L423 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 16:53:40,285 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 16:53:40,286 INFO L82 PathProgramCache]: Analyzing trace with hash 2009943675, now seen corresponding path program 1 times [2018-11-14 16:53:40,288 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 16:53:40,288 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 16:53:40,337 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 16:53:40,337 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 16:53:40,337 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 16:53:40,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:53:40,599 INFO L256 TraceCheckUtils]: 0: Hoare triple {57#true} call ULTIMATE.init(); {57#true} is VALID [2018-11-14 16:53:40,604 INFO L273 TraceCheckUtils]: 1: Hoare triple {57#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {57#true} is VALID [2018-11-14 16:53:40,604 INFO L273 TraceCheckUtils]: 2: Hoare triple {57#true} assume true; {57#true} is VALID [2018-11-14 16:53:40,605 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {57#true} {57#true} #126#return; {57#true} is VALID [2018-11-14 16:53:40,605 INFO L256 TraceCheckUtils]: 4: Hoare triple {57#true} call #t~ret15 := main(); {57#true} is VALID [2018-11-14 16:53:40,606 INFO L273 TraceCheckUtils]: 5: Hoare triple {57#true} ~n~0 := 0;call ~#set~0.base, ~#set~0.offset := #Ultimate.alloc(400000);havoc ~x~0;havoc ~y~0;~x~0 := 0; {59#(and (= main_~n~0 0) (= main_~x~0 0))} is VALID [2018-11-14 16:53:40,609 INFO L273 TraceCheckUtils]: 6: Hoare triple {59#(and (= main_~n~0 0) (= main_~x~0 0))} assume true; {59#(and (= main_~n~0 0) (= main_~x~0 0))} is VALID [2018-11-14 16:53:40,611 INFO L273 TraceCheckUtils]: 7: Hoare triple {59#(and (= main_~n~0 0) (= main_~x~0 0))} assume !!(~x~0 < ~n~0);~y~0 := ~x~0 + 1; {60#(and (= main_~n~0 0) (<= (+ main_~x~0 1) main_~y~0) (= main_~x~0 0))} is VALID [2018-11-14 16:53:40,612 INFO L273 TraceCheckUtils]: 8: Hoare triple {60#(and (= main_~n~0 0) (<= (+ main_~x~0 1) main_~y~0) (= main_~x~0 0))} assume true; {60#(and (= main_~n~0 0) (<= (+ main_~x~0 1) main_~y~0) (= main_~x~0 0))} is VALID [2018-11-14 16:53:40,617 INFO L273 TraceCheckUtils]: 9: Hoare triple {60#(and (= main_~n~0 0) (<= (+ main_~x~0 1) main_~y~0) (= main_~x~0 0))} assume !!(~y~0 < ~n~0);call #t~mem4 := read~int(~#set~0.base, ~#set~0.offset + ~x~0 * 4, 4);call #t~mem5 := read~int(~#set~0.base, ~#set~0.offset + ~y~0 * 4, 4); {58#false} is VALID [2018-11-14 16:53:40,618 INFO L256 TraceCheckUtils]: 10: Hoare triple {58#false} call __VERIFIER_assert((if #t~mem4 != #t~mem5 then 1 else 0)); {58#false} is VALID [2018-11-14 16:53:40,619 INFO L273 TraceCheckUtils]: 11: Hoare triple {58#false} ~cond := #in~cond; {58#false} is VALID [2018-11-14 16:53:40,619 INFO L273 TraceCheckUtils]: 12: Hoare triple {58#false} assume ~cond == 0; {58#false} is VALID [2018-11-14 16:53:40,619 INFO L273 TraceCheckUtils]: 13: Hoare triple {58#false} assume !false; {58#false} is VALID [2018-11-14 16:53:40,624 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 16:53:40,626 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-14 16:53:40,626 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-14 16:53:40,631 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2018-11-14 16:53:40,634 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 16:53:40,638 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2018-11-14 16:53:40,690 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 14 edges. 14 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 16:53:40,690 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-14 16:53:40,700 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-14 16:53:40,701 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-14 16:53:40,705 INFO L87 Difference]: Start difference. First operand 54 states. Second operand 4 states. [2018-11-14 16:53:41,592 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:53:41,593 INFO L93 Difference]: Finished difference Result 110 states and 147 transitions. [2018-11-14 16:53:41,593 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-14 16:53:41,593 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2018-11-14 16:53:41,594 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 16:53:41,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-14 16:53:41,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 147 transitions. [2018-11-14 16:53:41,621 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-14 16:53:41,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 147 transitions. [2018-11-14 16:53:41,636 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 147 transitions. [2018-11-14 16:53:41,975 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 147 edges. 147 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 16:53:41,989 INFO L225 Difference]: With dead ends: 110 [2018-11-14 16:53:41,990 INFO L226 Difference]: Without dead ends: 51 [2018-11-14 16:53:41,994 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-14 16:53:42,010 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2018-11-14 16:53:42,054 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 49. [2018-11-14 16:53:42,055 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 16:53:42,055 INFO L82 GeneralOperation]: Start isEquivalent. First operand 51 states. Second operand 49 states. [2018-11-14 16:53:42,056 INFO L74 IsIncluded]: Start isIncluded. First operand 51 states. Second operand 49 states. [2018-11-14 16:53:42,056 INFO L87 Difference]: Start difference. First operand 51 states. Second operand 49 states. [2018-11-14 16:53:42,064 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:53:42,064 INFO L93 Difference]: Finished difference Result 51 states and 59 transitions. [2018-11-14 16:53:42,064 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 59 transitions. [2018-11-14 16:53:42,065 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:53:42,066 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:53:42,066 INFO L74 IsIncluded]: Start isIncluded. First operand 49 states. Second operand 51 states. [2018-11-14 16:53:42,066 INFO L87 Difference]: Start difference. First operand 49 states. Second operand 51 states. [2018-11-14 16:53:42,072 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:53:42,072 INFO L93 Difference]: Finished difference Result 51 states and 59 transitions. [2018-11-14 16:53:42,073 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 59 transitions. [2018-11-14 16:53:42,074 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:53:42,074 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:53:42,074 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 16:53:42,075 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 16:53:42,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2018-11-14 16:53:42,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 56 transitions. [2018-11-14 16:53:42,081 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 56 transitions. Word has length 14 [2018-11-14 16:53:42,081 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 16:53:42,082 INFO L480 AbstractCegarLoop]: Abstraction has 49 states and 56 transitions. [2018-11-14 16:53:42,082 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-14 16:53:42,082 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 56 transitions. [2018-11-14 16:53:42,084 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-11-14 16:53:42,084 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 16:53:42,084 INFO L375 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 16:53:42,085 INFO L423 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 16:53:42,085 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 16:53:42,085 INFO L82 PathProgramCache]: Analyzing trace with hash 1004147866, now seen corresponding path program 1 times [2018-11-14 16:53:42,085 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 16:53:42,086 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 16:53:42,087 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 16:53:42,087 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 16:53:42,087 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 16:53:42,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:53:42,268 INFO L256 TraceCheckUtils]: 0: Hoare triple {373#true} call ULTIMATE.init(); {373#true} is VALID [2018-11-14 16:53:42,269 INFO L273 TraceCheckUtils]: 1: Hoare triple {373#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {373#true} is VALID [2018-11-14 16:53:42,269 INFO L273 TraceCheckUtils]: 2: Hoare triple {373#true} assume true; {373#true} is VALID [2018-11-14 16:53:42,269 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {373#true} {373#true} #126#return; {373#true} is VALID [2018-11-14 16:53:42,270 INFO L256 TraceCheckUtils]: 4: Hoare triple {373#true} call #t~ret15 := main(); {373#true} is VALID [2018-11-14 16:53:42,270 INFO L273 TraceCheckUtils]: 5: Hoare triple {373#true} ~n~0 := 0;call ~#set~0.base, ~#set~0.offset := #Ultimate.alloc(400000);havoc ~x~0;havoc ~y~0;~x~0 := 0; {373#true} is VALID [2018-11-14 16:53:42,270 INFO L273 TraceCheckUtils]: 6: Hoare triple {373#true} assume true; {373#true} is VALID [2018-11-14 16:53:42,271 INFO L273 TraceCheckUtils]: 7: Hoare triple {373#true} assume !(~x~0 < ~n~0); {373#true} is VALID [2018-11-14 16:53:42,274 INFO L273 TraceCheckUtils]: 8: Hoare triple {373#true} call ~#values~0.base, ~#values~0.offset := #Ultimate.alloc(400000);havoc ~v~0;~v~0 := 0; {375#(= main_~v~0 0)} is VALID [2018-11-14 16:53:42,276 INFO L273 TraceCheckUtils]: 9: Hoare triple {375#(= main_~v~0 0)} assume true; {375#(= main_~v~0 0)} is VALID [2018-11-14 16:53:42,293 INFO L273 TraceCheckUtils]: 10: Hoare triple {375#(= main_~v~0 0)} assume !!(~v~0 < 100000);call #t~mem7 := read~int(~#values~0.base, ~#values~0.offset + ~v~0 * 4, 4); {375#(= main_~v~0 0)} is VALID [2018-11-14 16:53:42,293 INFO L256 TraceCheckUtils]: 11: Hoare triple {375#(= main_~v~0 0)} call #t~ret8 := elem_exists(~#set~0.base, ~#set~0.offset, ~n~0, #t~mem7); {373#true} is VALID [2018-11-14 16:53:42,294 INFO L273 TraceCheckUtils]: 12: Hoare triple {373#true} ~set.base, ~set.offset := #in~set.base, #in~set.offset;~size := #in~size;~value := #in~value;havoc ~i~0;~i~0 := 0; {373#true} is VALID [2018-11-14 16:53:42,294 INFO L273 TraceCheckUtils]: 13: Hoare triple {373#true} assume true; {373#true} is VALID [2018-11-14 16:53:42,295 INFO L273 TraceCheckUtils]: 14: Hoare triple {373#true} assume !(~i~0 < ~size); {373#true} is VALID [2018-11-14 16:53:42,295 INFO L273 TraceCheckUtils]: 15: Hoare triple {373#true} #res := 0; {373#true} is VALID [2018-11-14 16:53:42,295 INFO L273 TraceCheckUtils]: 16: Hoare triple {373#true} assume true; {373#true} is VALID [2018-11-14 16:53:42,305 INFO L268 TraceCheckUtils]: 17: Hoare quadruple {373#true} {375#(= main_~v~0 0)} #132#return; {375#(= main_~v~0 0)} is VALID [2018-11-14 16:53:42,314 INFO L273 TraceCheckUtils]: 18: Hoare triple {375#(= main_~v~0 0)} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647; {375#(= main_~v~0 0)} is VALID [2018-11-14 16:53:42,315 INFO L273 TraceCheckUtils]: 19: Hoare triple {375#(= main_~v~0 0)} assume #t~ret8 == 0;havoc #t~mem7;havoc #t~ret8;call #t~mem9 := read~int(~#values~0.base, ~#values~0.offset + ~v~0 * 4, 4); {375#(= main_~v~0 0)} is VALID [2018-11-14 16:53:42,315 INFO L256 TraceCheckUtils]: 20: Hoare triple {375#(= main_~v~0 0)} call #t~ret10 := insert(~#set~0.base, ~#set~0.offset, ~n~0, #t~mem9); {373#true} is VALID [2018-11-14 16:53:42,315 INFO L273 TraceCheckUtils]: 21: Hoare triple {373#true} ~set.base, ~set.offset := #in~set.base, #in~set.offset;~size := #in~size;~value := #in~value;call write~int(~value, ~set.base, ~set.offset + ~size * 4, 4);#res := ~size + 1; {373#true} is VALID [2018-11-14 16:53:42,316 INFO L273 TraceCheckUtils]: 22: Hoare triple {373#true} assume true; {373#true} is VALID [2018-11-14 16:53:42,321 INFO L268 TraceCheckUtils]: 23: Hoare quadruple {373#true} {375#(= main_~v~0 0)} #134#return; {375#(= main_~v~0 0)} is VALID [2018-11-14 16:53:42,322 INFO L273 TraceCheckUtils]: 24: Hoare triple {375#(= main_~v~0 0)} assume -2147483648 <= #t~ret10 && #t~ret10 <= 2147483647;~n~0 := #t~ret10;havoc #t~ret10;havoc #t~mem9; {375#(= main_~v~0 0)} is VALID [2018-11-14 16:53:42,323 INFO L273 TraceCheckUtils]: 25: Hoare triple {375#(= main_~v~0 0)} #t~post6 := ~v~0;~v~0 := #t~post6 + 1;havoc #t~post6; {376#(<= main_~v~0 1)} is VALID [2018-11-14 16:53:42,324 INFO L273 TraceCheckUtils]: 26: Hoare triple {376#(<= main_~v~0 1)} assume true; {376#(<= main_~v~0 1)} is VALID [2018-11-14 16:53:42,324 INFO L273 TraceCheckUtils]: 27: Hoare triple {376#(<= main_~v~0 1)} assume !(~v~0 < 100000); {374#false} is VALID [2018-11-14 16:53:42,324 INFO L273 TraceCheckUtils]: 28: Hoare triple {374#false} ~x~0 := 0; {374#false} is VALID [2018-11-14 16:53:42,325 INFO L273 TraceCheckUtils]: 29: Hoare triple {374#false} assume true; {374#false} is VALID [2018-11-14 16:53:42,325 INFO L273 TraceCheckUtils]: 30: Hoare triple {374#false} assume !!(~x~0 < ~n~0);~y~0 := ~x~0 + 1; {374#false} is VALID [2018-11-14 16:53:42,325 INFO L273 TraceCheckUtils]: 31: Hoare triple {374#false} assume true; {374#false} is VALID [2018-11-14 16:53:42,326 INFO L273 TraceCheckUtils]: 32: Hoare triple {374#false} assume !!(~y~0 < ~n~0);call #t~mem13 := read~int(~#set~0.base, ~#set~0.offset + ~x~0 * 4, 4);call #t~mem14 := read~int(~#set~0.base, ~#set~0.offset + ~y~0 * 4, 4); {374#false} is VALID [2018-11-14 16:53:42,326 INFO L256 TraceCheckUtils]: 33: Hoare triple {374#false} call __VERIFIER_assert((if #t~mem13 != #t~mem14 then 1 else 0)); {374#false} is VALID [2018-11-14 16:53:42,327 INFO L273 TraceCheckUtils]: 34: Hoare triple {374#false} ~cond := #in~cond; {374#false} is VALID [2018-11-14 16:53:42,327 INFO L273 TraceCheckUtils]: 35: Hoare triple {374#false} assume ~cond == 0; {374#false} is VALID [2018-11-14 16:53:42,327 INFO L273 TraceCheckUtils]: 36: Hoare triple {374#false} assume !false; {374#false} is VALID [2018-11-14 16:53:42,332 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 16:53:42,333 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-14 16:53:42,333 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-14 16:53:42,349 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 16:53:42,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:53:42,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:53:42,437 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 16:53:42,837 INFO L256 TraceCheckUtils]: 0: Hoare triple {373#true} call ULTIMATE.init(); {373#true} is VALID [2018-11-14 16:53:42,838 INFO L273 TraceCheckUtils]: 1: Hoare triple {373#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {373#true} is VALID [2018-11-14 16:53:42,839 INFO L273 TraceCheckUtils]: 2: Hoare triple {373#true} assume true; {373#true} is VALID [2018-11-14 16:53:42,839 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {373#true} {373#true} #126#return; {373#true} is VALID [2018-11-14 16:53:42,839 INFO L256 TraceCheckUtils]: 4: Hoare triple {373#true} call #t~ret15 := main(); {373#true} is VALID [2018-11-14 16:53:42,840 INFO L273 TraceCheckUtils]: 5: Hoare triple {373#true} ~n~0 := 0;call ~#set~0.base, ~#set~0.offset := #Ultimate.alloc(400000);havoc ~x~0;havoc ~y~0;~x~0 := 0; {373#true} is VALID [2018-11-14 16:53:42,840 INFO L273 TraceCheckUtils]: 6: Hoare triple {373#true} assume true; {373#true} is VALID [2018-11-14 16:53:42,840 INFO L273 TraceCheckUtils]: 7: Hoare triple {373#true} assume !(~x~0 < ~n~0); {373#true} is VALID [2018-11-14 16:53:42,841 INFO L273 TraceCheckUtils]: 8: Hoare triple {373#true} call ~#values~0.base, ~#values~0.offset := #Ultimate.alloc(400000);havoc ~v~0;~v~0 := 0; {404#(<= main_~v~0 0)} is VALID [2018-11-14 16:53:42,842 INFO L273 TraceCheckUtils]: 9: Hoare triple {404#(<= main_~v~0 0)} assume true; {404#(<= main_~v~0 0)} is VALID [2018-11-14 16:53:42,842 INFO L273 TraceCheckUtils]: 10: Hoare triple {404#(<= main_~v~0 0)} assume !!(~v~0 < 100000);call #t~mem7 := read~int(~#values~0.base, ~#values~0.offset + ~v~0 * 4, 4); {404#(<= main_~v~0 0)} is VALID [2018-11-14 16:53:42,842 INFO L256 TraceCheckUtils]: 11: Hoare triple {404#(<= main_~v~0 0)} call #t~ret8 := elem_exists(~#set~0.base, ~#set~0.offset, ~n~0, #t~mem7); {373#true} is VALID [2018-11-14 16:53:42,843 INFO L273 TraceCheckUtils]: 12: Hoare triple {373#true} ~set.base, ~set.offset := #in~set.base, #in~set.offset;~size := #in~size;~value := #in~value;havoc ~i~0;~i~0 := 0; {373#true} is VALID [2018-11-14 16:53:42,843 INFO L273 TraceCheckUtils]: 13: Hoare triple {373#true} assume true; {373#true} is VALID [2018-11-14 16:53:42,843 INFO L273 TraceCheckUtils]: 14: Hoare triple {373#true} assume !(~i~0 < ~size); {373#true} is VALID [2018-11-14 16:53:42,844 INFO L273 TraceCheckUtils]: 15: Hoare triple {373#true} #res := 0; {373#true} is VALID [2018-11-14 16:53:42,844 INFO L273 TraceCheckUtils]: 16: Hoare triple {373#true} assume true; {373#true} is VALID [2018-11-14 16:53:42,852 INFO L268 TraceCheckUtils]: 17: Hoare quadruple {373#true} {404#(<= main_~v~0 0)} #132#return; {404#(<= main_~v~0 0)} is VALID [2018-11-14 16:53:42,854 INFO L273 TraceCheckUtils]: 18: Hoare triple {404#(<= main_~v~0 0)} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647; {404#(<= main_~v~0 0)} is VALID [2018-11-14 16:53:42,854 INFO L273 TraceCheckUtils]: 19: Hoare triple {404#(<= main_~v~0 0)} assume #t~ret8 == 0;havoc #t~mem7;havoc #t~ret8;call #t~mem9 := read~int(~#values~0.base, ~#values~0.offset + ~v~0 * 4, 4); {404#(<= main_~v~0 0)} is VALID [2018-11-14 16:53:42,854 INFO L256 TraceCheckUtils]: 20: Hoare triple {404#(<= main_~v~0 0)} call #t~ret10 := insert(~#set~0.base, ~#set~0.offset, ~n~0, #t~mem9); {373#true} is VALID [2018-11-14 16:53:42,855 INFO L273 TraceCheckUtils]: 21: Hoare triple {373#true} ~set.base, ~set.offset := #in~set.base, #in~set.offset;~size := #in~size;~value := #in~value;call write~int(~value, ~set.base, ~set.offset + ~size * 4, 4);#res := ~size + 1; {373#true} is VALID [2018-11-14 16:53:42,855 INFO L273 TraceCheckUtils]: 22: Hoare triple {373#true} assume true; {373#true} is VALID [2018-11-14 16:53:42,857 INFO L268 TraceCheckUtils]: 23: Hoare quadruple {373#true} {404#(<= main_~v~0 0)} #134#return; {404#(<= main_~v~0 0)} is VALID [2018-11-14 16:53:42,857 INFO L273 TraceCheckUtils]: 24: Hoare triple {404#(<= main_~v~0 0)} assume -2147483648 <= #t~ret10 && #t~ret10 <= 2147483647;~n~0 := #t~ret10;havoc #t~ret10;havoc #t~mem9; {404#(<= main_~v~0 0)} is VALID [2018-11-14 16:53:42,858 INFO L273 TraceCheckUtils]: 25: Hoare triple {404#(<= main_~v~0 0)} #t~post6 := ~v~0;~v~0 := #t~post6 + 1;havoc #t~post6; {376#(<= main_~v~0 1)} is VALID [2018-11-14 16:53:42,859 INFO L273 TraceCheckUtils]: 26: Hoare triple {376#(<= main_~v~0 1)} assume true; {376#(<= main_~v~0 1)} is VALID [2018-11-14 16:53:42,859 INFO L273 TraceCheckUtils]: 27: Hoare triple {376#(<= main_~v~0 1)} assume !(~v~0 < 100000); {374#false} is VALID [2018-11-14 16:53:42,860 INFO L273 TraceCheckUtils]: 28: Hoare triple {374#false} ~x~0 := 0; {374#false} is VALID [2018-11-14 16:53:42,860 INFO L273 TraceCheckUtils]: 29: Hoare triple {374#false} assume true; {374#false} is VALID [2018-11-14 16:53:42,861 INFO L273 TraceCheckUtils]: 30: Hoare triple {374#false} assume !!(~x~0 < ~n~0);~y~0 := ~x~0 + 1; {374#false} is VALID [2018-11-14 16:53:42,861 INFO L273 TraceCheckUtils]: 31: Hoare triple {374#false} assume true; {374#false} is VALID [2018-11-14 16:53:42,862 INFO L273 TraceCheckUtils]: 32: Hoare triple {374#false} assume !!(~y~0 < ~n~0);call #t~mem13 := read~int(~#set~0.base, ~#set~0.offset + ~x~0 * 4, 4);call #t~mem14 := read~int(~#set~0.base, ~#set~0.offset + ~y~0 * 4, 4); {374#false} is VALID [2018-11-14 16:53:42,862 INFO L256 TraceCheckUtils]: 33: Hoare triple {374#false} call __VERIFIER_assert((if #t~mem13 != #t~mem14 then 1 else 0)); {374#false} is VALID [2018-11-14 16:53:42,863 INFO L273 TraceCheckUtils]: 34: Hoare triple {374#false} ~cond := #in~cond; {374#false} is VALID [2018-11-14 16:53:42,863 INFO L273 TraceCheckUtils]: 35: Hoare triple {374#false} assume ~cond == 0; {374#false} is VALID [2018-11-14 16:53:42,864 INFO L273 TraceCheckUtils]: 36: Hoare triple {374#false} assume !false; {374#false} is VALID [2018-11-14 16:53:42,866 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 16:53:42,889 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 16:53:42,890 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 5 [2018-11-14 16:53:42,891 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 37 [2018-11-14 16:53:42,892 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 16:53:42,892 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2018-11-14 16:53:43,046 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 48 edges. 48 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 16:53:43,047 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-14 16:53:43,047 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-14 16:53:43,047 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-11-14 16:53:43,048 INFO L87 Difference]: Start difference. First operand 49 states and 56 transitions. Second operand 5 states. [2018-11-14 16:53:43,327 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:53:43,327 INFO L93 Difference]: Finished difference Result 87 states and 104 transitions. [2018-11-14 16:53:43,327 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-14 16:53:43,328 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 37 [2018-11-14 16:53:43,328 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 16:53:43,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-14 16:53:43,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 87 transitions. [2018-11-14 16:53:43,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-14 16:53:43,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 87 transitions. [2018-11-14 16:53:43,346 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 87 transitions. [2018-11-14 16:53:43,539 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 87 edges. 87 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 16:53:43,543 INFO L225 Difference]: With dead ends: 87 [2018-11-14 16:53:43,543 INFO L226 Difference]: Without dead ends: 72 [2018-11-14 16:53:43,545 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-11-14 16:53:43,545 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2018-11-14 16:53:43,609 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 59. [2018-11-14 16:53:43,609 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 16:53:43,609 INFO L82 GeneralOperation]: Start isEquivalent. First operand 72 states. Second operand 59 states. [2018-11-14 16:53:43,609 INFO L74 IsIncluded]: Start isIncluded. First operand 72 states. Second operand 59 states. [2018-11-14 16:53:43,609 INFO L87 Difference]: Start difference. First operand 72 states. Second operand 59 states. [2018-11-14 16:53:43,615 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:53:43,616 INFO L93 Difference]: Finished difference Result 72 states and 87 transitions. [2018-11-14 16:53:43,616 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 87 transitions. [2018-11-14 16:53:43,617 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:53:43,618 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:53:43,618 INFO L74 IsIncluded]: Start isIncluded. First operand 59 states. Second operand 72 states. [2018-11-14 16:53:43,618 INFO L87 Difference]: Start difference. First operand 59 states. Second operand 72 states. [2018-11-14 16:53:43,624 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:53:43,624 INFO L93 Difference]: Finished difference Result 72 states and 87 transitions. [2018-11-14 16:53:43,625 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 87 transitions. [2018-11-14 16:53:43,626 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:53:43,626 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:53:43,626 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 16:53:43,627 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 16:53:43,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2018-11-14 16:53:43,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 69 transitions. [2018-11-14 16:53:43,631 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 69 transitions. Word has length 37 [2018-11-14 16:53:43,632 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 16:53:43,632 INFO L480 AbstractCegarLoop]: Abstraction has 59 states and 69 transitions. [2018-11-14 16:53:43,632 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-14 16:53:43,632 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 69 transitions. [2018-11-14 16:53:43,634 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2018-11-14 16:53:43,635 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 16:53:43,635 INFO L375 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 16:53:43,635 INFO L423 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 16:53:43,635 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 16:53:43,636 INFO L82 PathProgramCache]: Analyzing trace with hash -2146245391, now seen corresponding path program 1 times [2018-11-14 16:53:43,636 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 16:53:43,636 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 16:53:43,637 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 16:53:43,637 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 16:53:43,637 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 16:53:43,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:53:43,760 INFO L256 TraceCheckUtils]: 0: Hoare triple {828#true} call ULTIMATE.init(); {828#true} is VALID [2018-11-14 16:53:43,761 INFO L273 TraceCheckUtils]: 1: Hoare triple {828#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {828#true} is VALID [2018-11-14 16:53:43,761 INFO L273 TraceCheckUtils]: 2: Hoare triple {828#true} assume true; {828#true} is VALID [2018-11-14 16:53:43,761 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {828#true} {828#true} #126#return; {828#true} is VALID [2018-11-14 16:53:43,762 INFO L256 TraceCheckUtils]: 4: Hoare triple {828#true} call #t~ret15 := main(); {828#true} is VALID [2018-11-14 16:53:43,762 INFO L273 TraceCheckUtils]: 5: Hoare triple {828#true} ~n~0 := 0;call ~#set~0.base, ~#set~0.offset := #Ultimate.alloc(400000);havoc ~x~0;havoc ~y~0;~x~0 := 0; {828#true} is VALID [2018-11-14 16:53:43,763 INFO L273 TraceCheckUtils]: 6: Hoare triple {828#true} assume true; {828#true} is VALID [2018-11-14 16:53:43,763 INFO L273 TraceCheckUtils]: 7: Hoare triple {828#true} assume !(~x~0 < ~n~0); {828#true} is VALID [2018-11-14 16:53:43,763 INFO L273 TraceCheckUtils]: 8: Hoare triple {828#true} call ~#values~0.base, ~#values~0.offset := #Ultimate.alloc(400000);havoc ~v~0;~v~0 := 0; {828#true} is VALID [2018-11-14 16:53:43,764 INFO L273 TraceCheckUtils]: 9: Hoare triple {828#true} assume true; {828#true} is VALID [2018-11-14 16:53:43,764 INFO L273 TraceCheckUtils]: 10: Hoare triple {828#true} assume !!(~v~0 < 100000);call #t~mem7 := read~int(~#values~0.base, ~#values~0.offset + ~v~0 * 4, 4); {828#true} is VALID [2018-11-14 16:53:43,765 INFO L256 TraceCheckUtils]: 11: Hoare triple {828#true} call #t~ret8 := elem_exists(~#set~0.base, ~#set~0.offset, ~n~0, #t~mem7); {828#true} is VALID [2018-11-14 16:53:43,765 INFO L273 TraceCheckUtils]: 12: Hoare triple {828#true} ~set.base, ~set.offset := #in~set.base, #in~set.offset;~size := #in~size;~value := #in~value;havoc ~i~0;~i~0 := 0; {828#true} is VALID [2018-11-14 16:53:43,765 INFO L273 TraceCheckUtils]: 13: Hoare triple {828#true} assume true; {828#true} is VALID [2018-11-14 16:53:43,765 INFO L273 TraceCheckUtils]: 14: Hoare triple {828#true} assume !(~i~0 < ~size); {828#true} is VALID [2018-11-14 16:53:43,766 INFO L273 TraceCheckUtils]: 15: Hoare triple {828#true} #res := 0; {828#true} is VALID [2018-11-14 16:53:43,766 INFO L273 TraceCheckUtils]: 16: Hoare triple {828#true} assume true; {828#true} is VALID [2018-11-14 16:53:43,766 INFO L268 TraceCheckUtils]: 17: Hoare quadruple {828#true} {828#true} #132#return; {828#true} is VALID [2018-11-14 16:53:43,766 INFO L273 TraceCheckUtils]: 18: Hoare triple {828#true} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647; {828#true} is VALID [2018-11-14 16:53:43,767 INFO L273 TraceCheckUtils]: 19: Hoare triple {828#true} assume #t~ret8 == 0;havoc #t~mem7;havoc #t~ret8;call #t~mem9 := read~int(~#values~0.base, ~#values~0.offset + ~v~0 * 4, 4); {828#true} is VALID [2018-11-14 16:53:43,767 INFO L256 TraceCheckUtils]: 20: Hoare triple {828#true} call #t~ret10 := insert(~#set~0.base, ~#set~0.offset, ~n~0, #t~mem9); {828#true} is VALID [2018-11-14 16:53:43,767 INFO L273 TraceCheckUtils]: 21: Hoare triple {828#true} ~set.base, ~set.offset := #in~set.base, #in~set.offset;~size := #in~size;~value := #in~value;call write~int(~value, ~set.base, ~set.offset + ~size * 4, 4);#res := ~size + 1; {828#true} is VALID [2018-11-14 16:53:43,768 INFO L273 TraceCheckUtils]: 22: Hoare triple {828#true} assume true; {828#true} is VALID [2018-11-14 16:53:43,768 INFO L268 TraceCheckUtils]: 23: Hoare quadruple {828#true} {828#true} #134#return; {828#true} is VALID [2018-11-14 16:53:43,768 INFO L273 TraceCheckUtils]: 24: Hoare triple {828#true} assume -2147483648 <= #t~ret10 && #t~ret10 <= 2147483647;~n~0 := #t~ret10;havoc #t~ret10;havoc #t~mem9; {828#true} is VALID [2018-11-14 16:53:43,769 INFO L273 TraceCheckUtils]: 25: Hoare triple {828#true} #t~post6 := ~v~0;~v~0 := #t~post6 + 1;havoc #t~post6; {828#true} is VALID [2018-11-14 16:53:43,769 INFO L273 TraceCheckUtils]: 26: Hoare triple {828#true} assume true; {828#true} is VALID [2018-11-14 16:53:43,769 INFO L273 TraceCheckUtils]: 27: Hoare triple {828#true} assume !!(~v~0 < 100000);call #t~mem7 := read~int(~#values~0.base, ~#values~0.offset + ~v~0 * 4, 4); {828#true} is VALID [2018-11-14 16:53:43,770 INFO L256 TraceCheckUtils]: 28: Hoare triple {828#true} call #t~ret8 := elem_exists(~#set~0.base, ~#set~0.offset, ~n~0, #t~mem7); {828#true} is VALID [2018-11-14 16:53:43,770 INFO L273 TraceCheckUtils]: 29: Hoare triple {828#true} ~set.base, ~set.offset := #in~set.base, #in~set.offset;~size := #in~size;~value := #in~value;havoc ~i~0;~i~0 := 0; {828#true} is VALID [2018-11-14 16:53:43,770 INFO L273 TraceCheckUtils]: 30: Hoare triple {828#true} assume true; {828#true} is VALID [2018-11-14 16:53:43,770 INFO L273 TraceCheckUtils]: 31: Hoare triple {828#true} assume !(~i~0 < ~size); {828#true} is VALID [2018-11-14 16:53:43,772 INFO L273 TraceCheckUtils]: 32: Hoare triple {828#true} #res := 0; {830#(= 0 |elem_exists_#res|)} is VALID [2018-11-14 16:53:43,786 INFO L273 TraceCheckUtils]: 33: Hoare triple {830#(= 0 |elem_exists_#res|)} assume true; {830#(= 0 |elem_exists_#res|)} is VALID [2018-11-14 16:53:43,789 INFO L268 TraceCheckUtils]: 34: Hoare quadruple {830#(= 0 |elem_exists_#res|)} {828#true} #132#return; {831#(= |main_#t~ret8| 0)} is VALID [2018-11-14 16:53:43,791 INFO L273 TraceCheckUtils]: 35: Hoare triple {831#(= |main_#t~ret8| 0)} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647; {831#(= |main_#t~ret8| 0)} is VALID [2018-11-14 16:53:43,792 INFO L273 TraceCheckUtils]: 36: Hoare triple {831#(= |main_#t~ret8| 0)} assume !(#t~ret8 == 0);havoc #t~mem7;havoc #t~ret8; {829#false} is VALID [2018-11-14 16:53:43,792 INFO L273 TraceCheckUtils]: 37: Hoare triple {829#false} #t~post6 := ~v~0;~v~0 := #t~post6 + 1;havoc #t~post6; {829#false} is VALID [2018-11-14 16:53:43,793 INFO L273 TraceCheckUtils]: 38: Hoare triple {829#false} assume true; {829#false} is VALID [2018-11-14 16:53:43,793 INFO L273 TraceCheckUtils]: 39: Hoare triple {829#false} assume !(~v~0 < 100000); {829#false} is VALID [2018-11-14 16:53:43,794 INFO L273 TraceCheckUtils]: 40: Hoare triple {829#false} ~x~0 := 0; {829#false} is VALID [2018-11-14 16:53:43,794 INFO L273 TraceCheckUtils]: 41: Hoare triple {829#false} assume true; {829#false} is VALID [2018-11-14 16:53:43,795 INFO L273 TraceCheckUtils]: 42: Hoare triple {829#false} assume !!(~x~0 < ~n~0);~y~0 := ~x~0 + 1; {829#false} is VALID [2018-11-14 16:53:43,795 INFO L273 TraceCheckUtils]: 43: Hoare triple {829#false} assume true; {829#false} is VALID [2018-11-14 16:53:43,795 INFO L273 TraceCheckUtils]: 44: Hoare triple {829#false} assume !!(~y~0 < ~n~0);call #t~mem13 := read~int(~#set~0.base, ~#set~0.offset + ~x~0 * 4, 4);call #t~mem14 := read~int(~#set~0.base, ~#set~0.offset + ~y~0 * 4, 4); {829#false} is VALID [2018-11-14 16:53:43,796 INFO L256 TraceCheckUtils]: 45: Hoare triple {829#false} call __VERIFIER_assert((if #t~mem13 != #t~mem14 then 1 else 0)); {829#false} is VALID [2018-11-14 16:53:43,796 INFO L273 TraceCheckUtils]: 46: Hoare triple {829#false} ~cond := #in~cond; {829#false} is VALID [2018-11-14 16:53:43,796 INFO L273 TraceCheckUtils]: 47: Hoare triple {829#false} assume ~cond == 0; {829#false} is VALID [2018-11-14 16:53:43,796 INFO L273 TraceCheckUtils]: 48: Hoare triple {829#false} assume !false; {829#false} is VALID [2018-11-14 16:53:43,801 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-11-14 16:53:43,801 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-14 16:53:43,801 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-14 16:53:43,802 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 49 [2018-11-14 16:53:43,802 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 16:53:43,803 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2018-11-14 16:53:43,864 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 43 edges. 43 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 16:53:43,864 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-14 16:53:43,865 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-14 16:53:43,865 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-14 16:53:43,865 INFO L87 Difference]: Start difference. First operand 59 states and 69 transitions. Second operand 4 states. [2018-11-14 16:53:44,073 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:53:44,073 INFO L93 Difference]: Finished difference Result 107 states and 129 transitions. [2018-11-14 16:53:44,073 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-14 16:53:44,073 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 49 [2018-11-14 16:53:44,074 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 16:53:44,074 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-14 16:53:44,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 92 transitions. [2018-11-14 16:53:44,077 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-14 16:53:44,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 92 transitions. [2018-11-14 16:53:44,080 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 92 transitions. [2018-11-14 16:53:44,276 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 92 edges. 92 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 16:53:44,280 INFO L225 Difference]: With dead ends: 107 [2018-11-14 16:53:44,280 INFO L226 Difference]: Without dead ends: 67 [2018-11-14 16:53:44,281 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-14 16:53:44,281 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2018-11-14 16:53:44,377 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 65. [2018-11-14 16:53:44,378 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 16:53:44,378 INFO L82 GeneralOperation]: Start isEquivalent. First operand 67 states. Second operand 65 states. [2018-11-14 16:53:44,378 INFO L74 IsIncluded]: Start isIncluded. First operand 67 states. Second operand 65 states. [2018-11-14 16:53:44,379 INFO L87 Difference]: Start difference. First operand 67 states. Second operand 65 states. [2018-11-14 16:53:44,384 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:53:44,384 INFO L93 Difference]: Finished difference Result 67 states and 79 transitions. [2018-11-14 16:53:44,384 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 79 transitions. [2018-11-14 16:53:44,386 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:53:44,386 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:53:44,386 INFO L74 IsIncluded]: Start isIncluded. First operand 65 states. Second operand 67 states. [2018-11-14 16:53:44,386 INFO L87 Difference]: Start difference. First operand 65 states. Second operand 67 states. [2018-11-14 16:53:44,391 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:53:44,391 INFO L93 Difference]: Finished difference Result 67 states and 79 transitions. [2018-11-14 16:53:44,391 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 79 transitions. [2018-11-14 16:53:44,392 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:53:44,393 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:53:44,393 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 16:53:44,393 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 16:53:44,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2018-11-14 16:53:44,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 77 transitions. [2018-11-14 16:53:44,397 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 77 transitions. Word has length 49 [2018-11-14 16:53:44,398 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 16:53:44,398 INFO L480 AbstractCegarLoop]: Abstraction has 65 states and 77 transitions. [2018-11-14 16:53:44,398 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-14 16:53:44,398 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 77 transitions. [2018-11-14 16:53:44,400 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2018-11-14 16:53:44,400 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 16:53:44,400 INFO L375 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 16:53:44,400 INFO L423 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 16:53:44,401 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 16:53:44,401 INFO L82 PathProgramCache]: Analyzing trace with hash -728656088, now seen corresponding path program 1 times [2018-11-14 16:53:44,401 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 16:53:44,401 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 16:53:44,402 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 16:53:44,402 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 16:53:44,402 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 16:53:44,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:53:44,534 INFO L256 TraceCheckUtils]: 0: Hoare triple {1194#true} call ULTIMATE.init(); {1194#true} is VALID [2018-11-14 16:53:44,534 INFO L273 TraceCheckUtils]: 1: Hoare triple {1194#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {1194#true} is VALID [2018-11-14 16:53:44,535 INFO L273 TraceCheckUtils]: 2: Hoare triple {1194#true} assume true; {1194#true} is VALID [2018-11-14 16:53:44,535 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1194#true} {1194#true} #126#return; {1194#true} is VALID [2018-11-14 16:53:44,535 INFO L256 TraceCheckUtils]: 4: Hoare triple {1194#true} call #t~ret15 := main(); {1194#true} is VALID [2018-11-14 16:53:44,536 INFO L273 TraceCheckUtils]: 5: Hoare triple {1194#true} ~n~0 := 0;call ~#set~0.base, ~#set~0.offset := #Ultimate.alloc(400000);havoc ~x~0;havoc ~y~0;~x~0 := 0; {1194#true} is VALID [2018-11-14 16:53:44,536 INFO L273 TraceCheckUtils]: 6: Hoare triple {1194#true} assume true; {1194#true} is VALID [2018-11-14 16:53:44,536 INFO L273 TraceCheckUtils]: 7: Hoare triple {1194#true} assume !(~x~0 < ~n~0); {1194#true} is VALID [2018-11-14 16:53:44,541 INFO L273 TraceCheckUtils]: 8: Hoare triple {1194#true} call ~#values~0.base, ~#values~0.offset := #Ultimate.alloc(400000);havoc ~v~0;~v~0 := 0; {1196#(= main_~v~0 0)} is VALID [2018-11-14 16:53:44,541 INFO L273 TraceCheckUtils]: 9: Hoare triple {1196#(= main_~v~0 0)} assume true; {1196#(= main_~v~0 0)} is VALID [2018-11-14 16:53:44,542 INFO L273 TraceCheckUtils]: 10: Hoare triple {1196#(= main_~v~0 0)} assume !!(~v~0 < 100000);call #t~mem7 := read~int(~#values~0.base, ~#values~0.offset + ~v~0 * 4, 4); {1196#(= main_~v~0 0)} is VALID [2018-11-14 16:53:44,542 INFO L256 TraceCheckUtils]: 11: Hoare triple {1196#(= main_~v~0 0)} call #t~ret8 := elem_exists(~#set~0.base, ~#set~0.offset, ~n~0, #t~mem7); {1194#true} is VALID [2018-11-14 16:53:44,542 INFO L273 TraceCheckUtils]: 12: Hoare triple {1194#true} ~set.base, ~set.offset := #in~set.base, #in~set.offset;~size := #in~size;~value := #in~value;havoc ~i~0;~i~0 := 0; {1194#true} is VALID [2018-11-14 16:53:44,543 INFO L273 TraceCheckUtils]: 13: Hoare triple {1194#true} assume true; {1194#true} is VALID [2018-11-14 16:53:44,543 INFO L273 TraceCheckUtils]: 14: Hoare triple {1194#true} assume !(~i~0 < ~size); {1194#true} is VALID [2018-11-14 16:53:44,543 INFO L273 TraceCheckUtils]: 15: Hoare triple {1194#true} #res := 0; {1194#true} is VALID [2018-11-14 16:53:44,544 INFO L273 TraceCheckUtils]: 16: Hoare triple {1194#true} assume true; {1194#true} is VALID [2018-11-14 16:53:44,551 INFO L268 TraceCheckUtils]: 17: Hoare quadruple {1194#true} {1196#(= main_~v~0 0)} #132#return; {1196#(= main_~v~0 0)} is VALID [2018-11-14 16:53:44,552 INFO L273 TraceCheckUtils]: 18: Hoare triple {1196#(= main_~v~0 0)} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647; {1196#(= main_~v~0 0)} is VALID [2018-11-14 16:53:44,553 INFO L273 TraceCheckUtils]: 19: Hoare triple {1196#(= main_~v~0 0)} assume #t~ret8 == 0;havoc #t~mem7;havoc #t~ret8;call #t~mem9 := read~int(~#values~0.base, ~#values~0.offset + ~v~0 * 4, 4); {1196#(= main_~v~0 0)} is VALID [2018-11-14 16:53:44,553 INFO L256 TraceCheckUtils]: 20: Hoare triple {1196#(= main_~v~0 0)} call #t~ret10 := insert(~#set~0.base, ~#set~0.offset, ~n~0, #t~mem9); {1194#true} is VALID [2018-11-14 16:53:44,553 INFO L273 TraceCheckUtils]: 21: Hoare triple {1194#true} ~set.base, ~set.offset := #in~set.base, #in~set.offset;~size := #in~size;~value := #in~value;call write~int(~value, ~set.base, ~set.offset + ~size * 4, 4);#res := ~size + 1; {1194#true} is VALID [2018-11-14 16:53:44,553 INFO L273 TraceCheckUtils]: 22: Hoare triple {1194#true} assume true; {1194#true} is VALID [2018-11-14 16:53:44,554 INFO L268 TraceCheckUtils]: 23: Hoare quadruple {1194#true} {1196#(= main_~v~0 0)} #134#return; {1196#(= main_~v~0 0)} is VALID [2018-11-14 16:53:44,556 INFO L273 TraceCheckUtils]: 24: Hoare triple {1196#(= main_~v~0 0)} assume -2147483648 <= #t~ret10 && #t~ret10 <= 2147483647;~n~0 := #t~ret10;havoc #t~ret10;havoc #t~mem9; {1196#(= main_~v~0 0)} is VALID [2018-11-14 16:53:44,558 INFO L273 TraceCheckUtils]: 25: Hoare triple {1196#(= main_~v~0 0)} #t~post6 := ~v~0;~v~0 := #t~post6 + 1;havoc #t~post6; {1197#(<= main_~v~0 1)} is VALID [2018-11-14 16:53:44,558 INFO L273 TraceCheckUtils]: 26: Hoare triple {1197#(<= main_~v~0 1)} assume true; {1197#(<= main_~v~0 1)} is VALID [2018-11-14 16:53:44,560 INFO L273 TraceCheckUtils]: 27: Hoare triple {1197#(<= main_~v~0 1)} assume !!(~v~0 < 100000);call #t~mem7 := read~int(~#values~0.base, ~#values~0.offset + ~v~0 * 4, 4); {1197#(<= main_~v~0 1)} is VALID [2018-11-14 16:53:44,560 INFO L256 TraceCheckUtils]: 28: Hoare triple {1197#(<= main_~v~0 1)} call #t~ret8 := elem_exists(~#set~0.base, ~#set~0.offset, ~n~0, #t~mem7); {1194#true} is VALID [2018-11-14 16:53:44,560 INFO L273 TraceCheckUtils]: 29: Hoare triple {1194#true} ~set.base, ~set.offset := #in~set.base, #in~set.offset;~size := #in~size;~value := #in~value;havoc ~i~0;~i~0 := 0; {1194#true} is VALID [2018-11-14 16:53:44,560 INFO L273 TraceCheckUtils]: 30: Hoare triple {1194#true} assume true; {1194#true} is VALID [2018-11-14 16:53:44,561 INFO L273 TraceCheckUtils]: 31: Hoare triple {1194#true} assume !!(~i~0 < ~size);call #t~mem1 := read~int(~set.base, ~set.offset + ~i~0 * 4, 4); {1194#true} is VALID [2018-11-14 16:53:44,561 INFO L273 TraceCheckUtils]: 32: Hoare triple {1194#true} assume #t~mem1 == ~value;havoc #t~mem1;#res := 1; {1194#true} is VALID [2018-11-14 16:53:44,561 INFO L273 TraceCheckUtils]: 33: Hoare triple {1194#true} assume true; {1194#true} is VALID [2018-11-14 16:53:44,562 INFO L268 TraceCheckUtils]: 34: Hoare quadruple {1194#true} {1197#(<= main_~v~0 1)} #132#return; {1197#(<= main_~v~0 1)} is VALID [2018-11-14 16:53:44,563 INFO L273 TraceCheckUtils]: 35: Hoare triple {1197#(<= main_~v~0 1)} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647; {1197#(<= main_~v~0 1)} is VALID [2018-11-14 16:53:44,567 INFO L273 TraceCheckUtils]: 36: Hoare triple {1197#(<= main_~v~0 1)} assume !(#t~ret8 == 0);havoc #t~mem7;havoc #t~ret8; {1197#(<= main_~v~0 1)} is VALID [2018-11-14 16:53:44,567 INFO L273 TraceCheckUtils]: 37: Hoare triple {1197#(<= main_~v~0 1)} #t~post6 := ~v~0;~v~0 := #t~post6 + 1;havoc #t~post6; {1198#(<= main_~v~0 2)} is VALID [2018-11-14 16:53:44,570 INFO L273 TraceCheckUtils]: 38: Hoare triple {1198#(<= main_~v~0 2)} assume true; {1198#(<= main_~v~0 2)} is VALID [2018-11-14 16:53:44,570 INFO L273 TraceCheckUtils]: 39: Hoare triple {1198#(<= main_~v~0 2)} assume !(~v~0 < 100000); {1195#false} is VALID [2018-11-14 16:53:44,570 INFO L273 TraceCheckUtils]: 40: Hoare triple {1195#false} ~x~0 := 0; {1195#false} is VALID [2018-11-14 16:53:44,571 INFO L273 TraceCheckUtils]: 41: Hoare triple {1195#false} assume true; {1195#false} is VALID [2018-11-14 16:53:44,571 INFO L273 TraceCheckUtils]: 42: Hoare triple {1195#false} assume !!(~x~0 < ~n~0);~y~0 := ~x~0 + 1; {1195#false} is VALID [2018-11-14 16:53:44,571 INFO L273 TraceCheckUtils]: 43: Hoare triple {1195#false} assume true; {1195#false} is VALID [2018-11-14 16:53:44,572 INFO L273 TraceCheckUtils]: 44: Hoare triple {1195#false} assume !!(~y~0 < ~n~0);call #t~mem13 := read~int(~#set~0.base, ~#set~0.offset + ~x~0 * 4, 4);call #t~mem14 := read~int(~#set~0.base, ~#set~0.offset + ~y~0 * 4, 4); {1195#false} is VALID [2018-11-14 16:53:44,572 INFO L256 TraceCheckUtils]: 45: Hoare triple {1195#false} call __VERIFIER_assert((if #t~mem13 != #t~mem14 then 1 else 0)); {1195#false} is VALID [2018-11-14 16:53:44,572 INFO L273 TraceCheckUtils]: 46: Hoare triple {1195#false} ~cond := #in~cond; {1195#false} is VALID [2018-11-14 16:53:44,572 INFO L273 TraceCheckUtils]: 47: Hoare triple {1195#false} assume ~cond == 0; {1195#false} is VALID [2018-11-14 16:53:44,572 INFO L273 TraceCheckUtils]: 48: Hoare triple {1195#false} assume !false; {1195#false} is VALID [2018-11-14 16:53:44,576 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-11-14 16:53:44,576 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-14 16:53:44,576 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-14 16:53:44,593 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 16:53:44,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:53:44,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:53:44,651 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 16:53:44,768 INFO L256 TraceCheckUtils]: 0: Hoare triple {1194#true} call ULTIMATE.init(); {1194#true} is VALID [2018-11-14 16:53:44,769 INFO L273 TraceCheckUtils]: 1: Hoare triple {1194#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {1194#true} is VALID [2018-11-14 16:53:44,769 INFO L273 TraceCheckUtils]: 2: Hoare triple {1194#true} assume true; {1194#true} is VALID [2018-11-14 16:53:44,769 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1194#true} {1194#true} #126#return; {1194#true} is VALID [2018-11-14 16:53:44,770 INFO L256 TraceCheckUtils]: 4: Hoare triple {1194#true} call #t~ret15 := main(); {1194#true} is VALID [2018-11-14 16:53:44,770 INFO L273 TraceCheckUtils]: 5: Hoare triple {1194#true} ~n~0 := 0;call ~#set~0.base, ~#set~0.offset := #Ultimate.alloc(400000);havoc ~x~0;havoc ~y~0;~x~0 := 0; {1194#true} is VALID [2018-11-14 16:53:44,770 INFO L273 TraceCheckUtils]: 6: Hoare triple {1194#true} assume true; {1194#true} is VALID [2018-11-14 16:53:44,771 INFO L273 TraceCheckUtils]: 7: Hoare triple {1194#true} assume !(~x~0 < ~n~0); {1194#true} is VALID [2018-11-14 16:53:44,772 INFO L273 TraceCheckUtils]: 8: Hoare triple {1194#true} call ~#values~0.base, ~#values~0.offset := #Ultimate.alloc(400000);havoc ~v~0;~v~0 := 0; {1226#(<= main_~v~0 0)} is VALID [2018-11-14 16:53:44,772 INFO L273 TraceCheckUtils]: 9: Hoare triple {1226#(<= main_~v~0 0)} assume true; {1226#(<= main_~v~0 0)} is VALID [2018-11-14 16:53:44,773 INFO L273 TraceCheckUtils]: 10: Hoare triple {1226#(<= main_~v~0 0)} assume !!(~v~0 < 100000);call #t~mem7 := read~int(~#values~0.base, ~#values~0.offset + ~v~0 * 4, 4); {1226#(<= main_~v~0 0)} is VALID [2018-11-14 16:53:44,773 INFO L256 TraceCheckUtils]: 11: Hoare triple {1226#(<= main_~v~0 0)} call #t~ret8 := elem_exists(~#set~0.base, ~#set~0.offset, ~n~0, #t~mem7); {1194#true} is VALID [2018-11-14 16:53:44,773 INFO L273 TraceCheckUtils]: 12: Hoare triple {1194#true} ~set.base, ~set.offset := #in~set.base, #in~set.offset;~size := #in~size;~value := #in~value;havoc ~i~0;~i~0 := 0; {1194#true} is VALID [2018-11-14 16:53:44,774 INFO L273 TraceCheckUtils]: 13: Hoare triple {1194#true} assume true; {1194#true} is VALID [2018-11-14 16:53:44,774 INFO L273 TraceCheckUtils]: 14: Hoare triple {1194#true} assume !(~i~0 < ~size); {1194#true} is VALID [2018-11-14 16:53:44,774 INFO L273 TraceCheckUtils]: 15: Hoare triple {1194#true} #res := 0; {1194#true} is VALID [2018-11-14 16:53:44,774 INFO L273 TraceCheckUtils]: 16: Hoare triple {1194#true} assume true; {1194#true} is VALID [2018-11-14 16:53:44,783 INFO L268 TraceCheckUtils]: 17: Hoare quadruple {1194#true} {1226#(<= main_~v~0 0)} #132#return; {1226#(<= main_~v~0 0)} is VALID [2018-11-14 16:53:44,784 INFO L273 TraceCheckUtils]: 18: Hoare triple {1226#(<= main_~v~0 0)} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647; {1226#(<= main_~v~0 0)} is VALID [2018-11-14 16:53:44,784 INFO L273 TraceCheckUtils]: 19: Hoare triple {1226#(<= main_~v~0 0)} assume #t~ret8 == 0;havoc #t~mem7;havoc #t~ret8;call #t~mem9 := read~int(~#values~0.base, ~#values~0.offset + ~v~0 * 4, 4); {1226#(<= main_~v~0 0)} is VALID [2018-11-14 16:53:44,784 INFO L256 TraceCheckUtils]: 20: Hoare triple {1226#(<= main_~v~0 0)} call #t~ret10 := insert(~#set~0.base, ~#set~0.offset, ~n~0, #t~mem9); {1194#true} is VALID [2018-11-14 16:53:44,785 INFO L273 TraceCheckUtils]: 21: Hoare triple {1194#true} ~set.base, ~set.offset := #in~set.base, #in~set.offset;~size := #in~size;~value := #in~value;call write~int(~value, ~set.base, ~set.offset + ~size * 4, 4);#res := ~size + 1; {1194#true} is VALID [2018-11-14 16:53:44,785 INFO L273 TraceCheckUtils]: 22: Hoare triple {1194#true} assume true; {1194#true} is VALID [2018-11-14 16:53:44,786 INFO L268 TraceCheckUtils]: 23: Hoare quadruple {1194#true} {1226#(<= main_~v~0 0)} #134#return; {1226#(<= main_~v~0 0)} is VALID [2018-11-14 16:53:44,787 INFO L273 TraceCheckUtils]: 24: Hoare triple {1226#(<= main_~v~0 0)} assume -2147483648 <= #t~ret10 && #t~ret10 <= 2147483647;~n~0 := #t~ret10;havoc #t~ret10;havoc #t~mem9; {1226#(<= main_~v~0 0)} is VALID [2018-11-14 16:53:44,789 INFO L273 TraceCheckUtils]: 25: Hoare triple {1226#(<= main_~v~0 0)} #t~post6 := ~v~0;~v~0 := #t~post6 + 1;havoc #t~post6; {1197#(<= main_~v~0 1)} is VALID [2018-11-14 16:53:44,790 INFO L273 TraceCheckUtils]: 26: Hoare triple {1197#(<= main_~v~0 1)} assume true; {1197#(<= main_~v~0 1)} is VALID [2018-11-14 16:53:44,791 INFO L273 TraceCheckUtils]: 27: Hoare triple {1197#(<= main_~v~0 1)} assume !!(~v~0 < 100000);call #t~mem7 := read~int(~#values~0.base, ~#values~0.offset + ~v~0 * 4, 4); {1197#(<= main_~v~0 1)} is VALID [2018-11-14 16:53:44,791 INFO L256 TraceCheckUtils]: 28: Hoare triple {1197#(<= main_~v~0 1)} call #t~ret8 := elem_exists(~#set~0.base, ~#set~0.offset, ~n~0, #t~mem7); {1194#true} is VALID [2018-11-14 16:53:44,791 INFO L273 TraceCheckUtils]: 29: Hoare triple {1194#true} ~set.base, ~set.offset := #in~set.base, #in~set.offset;~size := #in~size;~value := #in~value;havoc ~i~0;~i~0 := 0; {1194#true} is VALID [2018-11-14 16:53:44,792 INFO L273 TraceCheckUtils]: 30: Hoare triple {1194#true} assume true; {1194#true} is VALID [2018-11-14 16:53:44,792 INFO L273 TraceCheckUtils]: 31: Hoare triple {1194#true} assume !!(~i~0 < ~size);call #t~mem1 := read~int(~set.base, ~set.offset + ~i~0 * 4, 4); {1194#true} is VALID [2018-11-14 16:53:44,792 INFO L273 TraceCheckUtils]: 32: Hoare triple {1194#true} assume #t~mem1 == ~value;havoc #t~mem1;#res := 1; {1194#true} is VALID [2018-11-14 16:53:44,793 INFO L273 TraceCheckUtils]: 33: Hoare triple {1194#true} assume true; {1194#true} is VALID [2018-11-14 16:53:44,797 INFO L268 TraceCheckUtils]: 34: Hoare quadruple {1194#true} {1197#(<= main_~v~0 1)} #132#return; {1197#(<= main_~v~0 1)} is VALID [2018-11-14 16:53:44,797 INFO L273 TraceCheckUtils]: 35: Hoare triple {1197#(<= main_~v~0 1)} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647; {1197#(<= main_~v~0 1)} is VALID [2018-11-14 16:53:44,798 INFO L273 TraceCheckUtils]: 36: Hoare triple {1197#(<= main_~v~0 1)} assume !(#t~ret8 == 0);havoc #t~mem7;havoc #t~ret8; {1197#(<= main_~v~0 1)} is VALID [2018-11-14 16:53:44,798 INFO L273 TraceCheckUtils]: 37: Hoare triple {1197#(<= main_~v~0 1)} #t~post6 := ~v~0;~v~0 := #t~post6 + 1;havoc #t~post6; {1198#(<= main_~v~0 2)} is VALID [2018-11-14 16:53:44,800 INFO L273 TraceCheckUtils]: 38: Hoare triple {1198#(<= main_~v~0 2)} assume true; {1198#(<= main_~v~0 2)} is VALID [2018-11-14 16:53:44,800 INFO L273 TraceCheckUtils]: 39: Hoare triple {1198#(<= main_~v~0 2)} assume !(~v~0 < 100000); {1195#false} is VALID [2018-11-14 16:53:44,800 INFO L273 TraceCheckUtils]: 40: Hoare triple {1195#false} ~x~0 := 0; {1195#false} is VALID [2018-11-14 16:53:44,801 INFO L273 TraceCheckUtils]: 41: Hoare triple {1195#false} assume true; {1195#false} is VALID [2018-11-14 16:53:44,801 INFO L273 TraceCheckUtils]: 42: Hoare triple {1195#false} assume !!(~x~0 < ~n~0);~y~0 := ~x~0 + 1; {1195#false} is VALID [2018-11-14 16:53:44,801 INFO L273 TraceCheckUtils]: 43: Hoare triple {1195#false} assume true; {1195#false} is VALID [2018-11-14 16:53:44,801 INFO L273 TraceCheckUtils]: 44: Hoare triple {1195#false} assume !!(~y~0 < ~n~0);call #t~mem13 := read~int(~#set~0.base, ~#set~0.offset + ~x~0 * 4, 4);call #t~mem14 := read~int(~#set~0.base, ~#set~0.offset + ~y~0 * 4, 4); {1195#false} is VALID [2018-11-14 16:53:44,802 INFO L256 TraceCheckUtils]: 45: Hoare triple {1195#false} call __VERIFIER_assert((if #t~mem13 != #t~mem14 then 1 else 0)); {1195#false} is VALID [2018-11-14 16:53:44,802 INFO L273 TraceCheckUtils]: 46: Hoare triple {1195#false} ~cond := #in~cond; {1195#false} is VALID [2018-11-14 16:53:44,803 INFO L273 TraceCheckUtils]: 47: Hoare triple {1195#false} assume ~cond == 0; {1195#false} is VALID [2018-11-14 16:53:44,803 INFO L273 TraceCheckUtils]: 48: Hoare triple {1195#false} assume !false; {1195#false} is VALID [2018-11-14 16:53:44,807 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-11-14 16:53:44,829 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 16:53:44,829 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 6 [2018-11-14 16:53:44,829 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 49 [2018-11-14 16:53:44,830 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 16:53:44,830 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2018-11-14 16:53:44,999 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 57 edges. 57 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 16:53:44,999 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-14 16:53:45,000 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-14 16:53:45,000 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2018-11-14 16:53:45,001 INFO L87 Difference]: Start difference. First operand 65 states and 77 transitions. Second operand 6 states. [2018-11-14 16:53:45,558 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:53:45,558 INFO L93 Difference]: Finished difference Result 111 states and 139 transitions. [2018-11-14 16:53:45,558 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-14 16:53:45,558 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 49 [2018-11-14 16:53:45,559 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 16:53:45,559 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-14 16:53:45,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 98 transitions. [2018-11-14 16:53:45,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-14 16:53:45,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 98 transitions. [2018-11-14 16:53:45,565 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 98 transitions. [2018-11-14 16:53:45,729 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 98 edges. 98 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 16:53:45,733 INFO L225 Difference]: With dead ends: 111 [2018-11-14 16:53:45,733 INFO L226 Difference]: Without dead ends: 96 [2018-11-14 16:53:45,734 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2018-11-14 16:53:45,734 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2018-11-14 16:53:45,785 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 81. [2018-11-14 16:53:45,785 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 16:53:45,785 INFO L82 GeneralOperation]: Start isEquivalent. First operand 96 states. Second operand 81 states. [2018-11-14 16:53:45,785 INFO L74 IsIncluded]: Start isIncluded. First operand 96 states. Second operand 81 states. [2018-11-14 16:53:45,785 INFO L87 Difference]: Start difference. First operand 96 states. Second operand 81 states. [2018-11-14 16:53:45,791 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:53:45,792 INFO L93 Difference]: Finished difference Result 96 states and 122 transitions. [2018-11-14 16:53:45,792 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 122 transitions. [2018-11-14 16:53:45,793 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:53:45,793 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:53:45,793 INFO L74 IsIncluded]: Start isIncluded. First operand 81 states. Second operand 96 states. [2018-11-14 16:53:45,793 INFO L87 Difference]: Start difference. First operand 81 states. Second operand 96 states. [2018-11-14 16:53:45,799 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:53:45,800 INFO L93 Difference]: Finished difference Result 96 states and 122 transitions. [2018-11-14 16:53:45,800 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 122 transitions. [2018-11-14 16:53:45,801 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:53:45,801 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:53:45,801 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 16:53:45,801 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 16:53:45,801 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2018-11-14 16:53:45,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 100 transitions. [2018-11-14 16:53:45,806 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 100 transitions. Word has length 49 [2018-11-14 16:53:45,806 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 16:53:45,806 INFO L480 AbstractCegarLoop]: Abstraction has 81 states and 100 transitions. [2018-11-14 16:53:45,806 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-14 16:53:45,807 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 100 transitions. [2018-11-14 16:53:45,808 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2018-11-14 16:53:45,808 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 16:53:45,809 INFO L375 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 16:53:45,809 INFO L423 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 16:53:45,809 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 16:53:45,809 INFO L82 PathProgramCache]: Analyzing trace with hash -389827402, now seen corresponding path program 2 times [2018-11-14 16:53:45,809 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 16:53:45,810 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 16:53:45,811 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 16:53:45,811 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 16:53:45,811 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 16:53:45,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:53:46,018 INFO L256 TraceCheckUtils]: 0: Hoare triple {1790#true} call ULTIMATE.init(); {1790#true} is VALID [2018-11-14 16:53:46,018 INFO L273 TraceCheckUtils]: 1: Hoare triple {1790#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {1790#true} is VALID [2018-11-14 16:53:46,019 INFO L273 TraceCheckUtils]: 2: Hoare triple {1790#true} assume true; {1790#true} is VALID [2018-11-14 16:53:46,019 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1790#true} {1790#true} #126#return; {1790#true} is VALID [2018-11-14 16:53:46,019 INFO L256 TraceCheckUtils]: 4: Hoare triple {1790#true} call #t~ret15 := main(); {1790#true} is VALID [2018-11-14 16:53:46,020 INFO L273 TraceCheckUtils]: 5: Hoare triple {1790#true} ~n~0 := 0;call ~#set~0.base, ~#set~0.offset := #Ultimate.alloc(400000);havoc ~x~0;havoc ~y~0;~x~0 := 0; {1790#true} is VALID [2018-11-14 16:53:46,020 INFO L273 TraceCheckUtils]: 6: Hoare triple {1790#true} assume true; {1790#true} is VALID [2018-11-14 16:53:46,020 INFO L273 TraceCheckUtils]: 7: Hoare triple {1790#true} assume !(~x~0 < ~n~0); {1790#true} is VALID [2018-11-14 16:53:46,021 INFO L273 TraceCheckUtils]: 8: Hoare triple {1790#true} call ~#values~0.base, ~#values~0.offset := #Ultimate.alloc(400000);havoc ~v~0;~v~0 := 0; {1792#(= main_~v~0 0)} is VALID [2018-11-14 16:53:46,021 INFO L273 TraceCheckUtils]: 9: Hoare triple {1792#(= main_~v~0 0)} assume true; {1792#(= main_~v~0 0)} is VALID [2018-11-14 16:53:46,021 INFO L273 TraceCheckUtils]: 10: Hoare triple {1792#(= main_~v~0 0)} assume !!(~v~0 < 100000);call #t~mem7 := read~int(~#values~0.base, ~#values~0.offset + ~v~0 * 4, 4); {1792#(= main_~v~0 0)} is VALID [2018-11-14 16:53:46,022 INFO L256 TraceCheckUtils]: 11: Hoare triple {1792#(= main_~v~0 0)} call #t~ret8 := elem_exists(~#set~0.base, ~#set~0.offset, ~n~0, #t~mem7); {1790#true} is VALID [2018-11-14 16:53:46,022 INFO L273 TraceCheckUtils]: 12: Hoare triple {1790#true} ~set.base, ~set.offset := #in~set.base, #in~set.offset;~size := #in~size;~value := #in~value;havoc ~i~0;~i~0 := 0; {1790#true} is VALID [2018-11-14 16:53:46,022 INFO L273 TraceCheckUtils]: 13: Hoare triple {1790#true} assume true; {1790#true} is VALID [2018-11-14 16:53:46,022 INFO L273 TraceCheckUtils]: 14: Hoare triple {1790#true} assume !(~i~0 < ~size); {1790#true} is VALID [2018-11-14 16:53:46,023 INFO L273 TraceCheckUtils]: 15: Hoare triple {1790#true} #res := 0; {1790#true} is VALID [2018-11-14 16:53:46,023 INFO L273 TraceCheckUtils]: 16: Hoare triple {1790#true} assume true; {1790#true} is VALID [2018-11-14 16:53:46,028 INFO L268 TraceCheckUtils]: 17: Hoare quadruple {1790#true} {1792#(= main_~v~0 0)} #132#return; {1792#(= main_~v~0 0)} is VALID [2018-11-14 16:53:46,029 INFO L273 TraceCheckUtils]: 18: Hoare triple {1792#(= main_~v~0 0)} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647; {1792#(= main_~v~0 0)} is VALID [2018-11-14 16:53:46,031 INFO L273 TraceCheckUtils]: 19: Hoare triple {1792#(= main_~v~0 0)} assume #t~ret8 == 0;havoc #t~mem7;havoc #t~ret8;call #t~mem9 := read~int(~#values~0.base, ~#values~0.offset + ~v~0 * 4, 4); {1792#(= main_~v~0 0)} is VALID [2018-11-14 16:53:46,032 INFO L256 TraceCheckUtils]: 20: Hoare triple {1792#(= main_~v~0 0)} call #t~ret10 := insert(~#set~0.base, ~#set~0.offset, ~n~0, #t~mem9); {1790#true} is VALID [2018-11-14 16:53:46,032 INFO L273 TraceCheckUtils]: 21: Hoare triple {1790#true} ~set.base, ~set.offset := #in~set.base, #in~set.offset;~size := #in~size;~value := #in~value;call write~int(~value, ~set.base, ~set.offset + ~size * 4, 4);#res := ~size + 1; {1790#true} is VALID [2018-11-14 16:53:46,032 INFO L273 TraceCheckUtils]: 22: Hoare triple {1790#true} assume true; {1790#true} is VALID [2018-11-14 16:53:46,036 INFO L268 TraceCheckUtils]: 23: Hoare quadruple {1790#true} {1792#(= main_~v~0 0)} #134#return; {1792#(= main_~v~0 0)} is VALID [2018-11-14 16:53:46,037 INFO L273 TraceCheckUtils]: 24: Hoare triple {1792#(= main_~v~0 0)} assume -2147483648 <= #t~ret10 && #t~ret10 <= 2147483647;~n~0 := #t~ret10;havoc #t~ret10;havoc #t~mem9; {1792#(= main_~v~0 0)} is VALID [2018-11-14 16:53:46,037 INFO L273 TraceCheckUtils]: 25: Hoare triple {1792#(= main_~v~0 0)} #t~post6 := ~v~0;~v~0 := #t~post6 + 1;havoc #t~post6; {1793#(<= main_~v~0 1)} is VALID [2018-11-14 16:53:46,039 INFO L273 TraceCheckUtils]: 26: Hoare triple {1793#(<= main_~v~0 1)} assume true; {1793#(<= main_~v~0 1)} is VALID [2018-11-14 16:53:46,039 INFO L273 TraceCheckUtils]: 27: Hoare triple {1793#(<= main_~v~0 1)} assume !!(~v~0 < 100000);call #t~mem7 := read~int(~#values~0.base, ~#values~0.offset + ~v~0 * 4, 4); {1793#(<= main_~v~0 1)} is VALID [2018-11-14 16:53:46,040 INFO L256 TraceCheckUtils]: 28: Hoare triple {1793#(<= main_~v~0 1)} call #t~ret8 := elem_exists(~#set~0.base, ~#set~0.offset, ~n~0, #t~mem7); {1790#true} is VALID [2018-11-14 16:53:46,040 INFO L273 TraceCheckUtils]: 29: Hoare triple {1790#true} ~set.base, ~set.offset := #in~set.base, #in~set.offset;~size := #in~size;~value := #in~value;havoc ~i~0;~i~0 := 0; {1790#true} is VALID [2018-11-14 16:53:46,041 INFO L273 TraceCheckUtils]: 30: Hoare triple {1790#true} assume true; {1790#true} is VALID [2018-11-14 16:53:46,041 INFO L273 TraceCheckUtils]: 31: Hoare triple {1790#true} assume !!(~i~0 < ~size);call #t~mem1 := read~int(~set.base, ~set.offset + ~i~0 * 4, 4); {1790#true} is VALID [2018-11-14 16:53:46,041 INFO L273 TraceCheckUtils]: 32: Hoare triple {1790#true} assume #t~mem1 == ~value;havoc #t~mem1;#res := 1; {1790#true} is VALID [2018-11-14 16:53:46,042 INFO L273 TraceCheckUtils]: 33: Hoare triple {1790#true} assume true; {1790#true} is VALID [2018-11-14 16:53:46,056 INFO L268 TraceCheckUtils]: 34: Hoare quadruple {1790#true} {1793#(<= main_~v~0 1)} #132#return; {1793#(<= main_~v~0 1)} is VALID [2018-11-14 16:53:46,072 INFO L273 TraceCheckUtils]: 35: Hoare triple {1793#(<= main_~v~0 1)} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647; {1793#(<= main_~v~0 1)} is VALID [2018-11-14 16:53:46,081 INFO L273 TraceCheckUtils]: 36: Hoare triple {1793#(<= main_~v~0 1)} assume !(#t~ret8 == 0);havoc #t~mem7;havoc #t~ret8; {1793#(<= main_~v~0 1)} is VALID [2018-11-14 16:53:46,091 INFO L273 TraceCheckUtils]: 37: Hoare triple {1793#(<= main_~v~0 1)} #t~post6 := ~v~0;~v~0 := #t~post6 + 1;havoc #t~post6; {1794#(<= main_~v~0 2)} is VALID [2018-11-14 16:53:46,097 INFO L273 TraceCheckUtils]: 38: Hoare triple {1794#(<= main_~v~0 2)} assume true; {1794#(<= main_~v~0 2)} is VALID [2018-11-14 16:53:46,099 INFO L273 TraceCheckUtils]: 39: Hoare triple {1794#(<= main_~v~0 2)} assume !!(~v~0 < 100000);call #t~mem7 := read~int(~#values~0.base, ~#values~0.offset + ~v~0 * 4, 4); {1794#(<= main_~v~0 2)} is VALID [2018-11-14 16:53:46,099 INFO L256 TraceCheckUtils]: 40: Hoare triple {1794#(<= main_~v~0 2)} call #t~ret8 := elem_exists(~#set~0.base, ~#set~0.offset, ~n~0, #t~mem7); {1790#true} is VALID [2018-11-14 16:53:46,099 INFO L273 TraceCheckUtils]: 41: Hoare triple {1790#true} ~set.base, ~set.offset := #in~set.base, #in~set.offset;~size := #in~size;~value := #in~value;havoc ~i~0;~i~0 := 0; {1790#true} is VALID [2018-11-14 16:53:46,099 INFO L273 TraceCheckUtils]: 42: Hoare triple {1790#true} assume true; {1790#true} is VALID [2018-11-14 16:53:46,099 INFO L273 TraceCheckUtils]: 43: Hoare triple {1790#true} assume !!(~i~0 < ~size);call #t~mem1 := read~int(~set.base, ~set.offset + ~i~0 * 4, 4); {1790#true} is VALID [2018-11-14 16:53:46,100 INFO L273 TraceCheckUtils]: 44: Hoare triple {1790#true} assume #t~mem1 == ~value;havoc #t~mem1;#res := 1; {1790#true} is VALID [2018-11-14 16:53:46,100 INFO L273 TraceCheckUtils]: 45: Hoare triple {1790#true} assume true; {1790#true} is VALID [2018-11-14 16:53:46,101 INFO L268 TraceCheckUtils]: 46: Hoare quadruple {1790#true} {1794#(<= main_~v~0 2)} #132#return; {1794#(<= main_~v~0 2)} is VALID [2018-11-14 16:53:46,102 INFO L273 TraceCheckUtils]: 47: Hoare triple {1794#(<= main_~v~0 2)} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647; {1794#(<= main_~v~0 2)} is VALID [2018-11-14 16:53:46,102 INFO L273 TraceCheckUtils]: 48: Hoare triple {1794#(<= main_~v~0 2)} assume !(#t~ret8 == 0);havoc #t~mem7;havoc #t~ret8; {1794#(<= main_~v~0 2)} is VALID [2018-11-14 16:53:46,104 INFO L273 TraceCheckUtils]: 49: Hoare triple {1794#(<= main_~v~0 2)} #t~post6 := ~v~0;~v~0 := #t~post6 + 1;havoc #t~post6; {1795#(<= main_~v~0 3)} is VALID [2018-11-14 16:53:46,104 INFO L273 TraceCheckUtils]: 50: Hoare triple {1795#(<= main_~v~0 3)} assume true; {1795#(<= main_~v~0 3)} is VALID [2018-11-14 16:53:46,106 INFO L273 TraceCheckUtils]: 51: Hoare triple {1795#(<= main_~v~0 3)} assume !(~v~0 < 100000); {1791#false} is VALID [2018-11-14 16:53:46,106 INFO L273 TraceCheckUtils]: 52: Hoare triple {1791#false} ~x~0 := 0; {1791#false} is VALID [2018-11-14 16:53:46,106 INFO L273 TraceCheckUtils]: 53: Hoare triple {1791#false} assume true; {1791#false} is VALID [2018-11-14 16:53:46,107 INFO L273 TraceCheckUtils]: 54: Hoare triple {1791#false} assume !!(~x~0 < ~n~0);~y~0 := ~x~0 + 1; {1791#false} is VALID [2018-11-14 16:53:46,107 INFO L273 TraceCheckUtils]: 55: Hoare triple {1791#false} assume true; {1791#false} is VALID [2018-11-14 16:53:46,107 INFO L273 TraceCheckUtils]: 56: Hoare triple {1791#false} assume !!(~y~0 < ~n~0);call #t~mem13 := read~int(~#set~0.base, ~#set~0.offset + ~x~0 * 4, 4);call #t~mem14 := read~int(~#set~0.base, ~#set~0.offset + ~y~0 * 4, 4); {1791#false} is VALID [2018-11-14 16:53:46,108 INFO L256 TraceCheckUtils]: 57: Hoare triple {1791#false} call __VERIFIER_assert((if #t~mem13 != #t~mem14 then 1 else 0)); {1791#false} is VALID [2018-11-14 16:53:46,108 INFO L273 TraceCheckUtils]: 58: Hoare triple {1791#false} ~cond := #in~cond; {1791#false} is VALID [2018-11-14 16:53:46,108 INFO L273 TraceCheckUtils]: 59: Hoare triple {1791#false} assume ~cond == 0; {1791#false} is VALID [2018-11-14 16:53:46,108 INFO L273 TraceCheckUtils]: 60: Hoare triple {1791#false} assume !false; {1791#false} is VALID [2018-11-14 16:53:46,113 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2018-11-14 16:53:46,113 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-14 16:53:46,113 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-14 16:53:46,122 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-14 16:53:46,181 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-14 16:53:46,181 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-14 16:53:46,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:53:46,202 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 16:53:46,600 INFO L256 TraceCheckUtils]: 0: Hoare triple {1790#true} call ULTIMATE.init(); {1790#true} is VALID [2018-11-14 16:53:46,601 INFO L273 TraceCheckUtils]: 1: Hoare triple {1790#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {1790#true} is VALID [2018-11-14 16:53:46,601 INFO L273 TraceCheckUtils]: 2: Hoare triple {1790#true} assume true; {1790#true} is VALID [2018-11-14 16:53:46,602 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1790#true} {1790#true} #126#return; {1790#true} is VALID [2018-11-14 16:53:46,602 INFO L256 TraceCheckUtils]: 4: Hoare triple {1790#true} call #t~ret15 := main(); {1790#true} is VALID [2018-11-14 16:53:46,604 INFO L273 TraceCheckUtils]: 5: Hoare triple {1790#true} ~n~0 := 0;call ~#set~0.base, ~#set~0.offset := #Ultimate.alloc(400000);havoc ~x~0;havoc ~y~0;~x~0 := 0; {1814#(<= main_~n~0 0)} is VALID [2018-11-14 16:53:46,604 INFO L273 TraceCheckUtils]: 6: Hoare triple {1814#(<= main_~n~0 0)} assume true; {1814#(<= main_~n~0 0)} is VALID [2018-11-14 16:53:46,605 INFO L273 TraceCheckUtils]: 7: Hoare triple {1814#(<= main_~n~0 0)} assume !(~x~0 < ~n~0); {1814#(<= main_~n~0 0)} is VALID [2018-11-14 16:53:46,605 INFO L273 TraceCheckUtils]: 8: Hoare triple {1814#(<= main_~n~0 0)} call ~#values~0.base, ~#values~0.offset := #Ultimate.alloc(400000);havoc ~v~0;~v~0 := 0; {1814#(<= main_~n~0 0)} is VALID [2018-11-14 16:53:46,606 INFO L273 TraceCheckUtils]: 9: Hoare triple {1814#(<= main_~n~0 0)} assume true; {1814#(<= main_~n~0 0)} is VALID [2018-11-14 16:53:46,607 INFO L273 TraceCheckUtils]: 10: Hoare triple {1814#(<= main_~n~0 0)} assume !!(~v~0 < 100000);call #t~mem7 := read~int(~#values~0.base, ~#values~0.offset + ~v~0 * 4, 4); {1814#(<= main_~n~0 0)} is VALID [2018-11-14 16:53:46,607 INFO L256 TraceCheckUtils]: 11: Hoare triple {1814#(<= main_~n~0 0)} call #t~ret8 := elem_exists(~#set~0.base, ~#set~0.offset, ~n~0, #t~mem7); {1790#true} is VALID [2018-11-14 16:53:46,607 INFO L273 TraceCheckUtils]: 12: Hoare triple {1790#true} ~set.base, ~set.offset := #in~set.base, #in~set.offset;~size := #in~size;~value := #in~value;havoc ~i~0;~i~0 := 0; {1790#true} is VALID [2018-11-14 16:53:46,608 INFO L273 TraceCheckUtils]: 13: Hoare triple {1790#true} assume true; {1790#true} is VALID [2018-11-14 16:53:46,608 INFO L273 TraceCheckUtils]: 14: Hoare triple {1790#true} assume !(~i~0 < ~size); {1790#true} is VALID [2018-11-14 16:53:46,609 INFO L273 TraceCheckUtils]: 15: Hoare triple {1790#true} #res := 0; {1790#true} is VALID [2018-11-14 16:53:46,609 INFO L273 TraceCheckUtils]: 16: Hoare triple {1790#true} assume true; {1790#true} is VALID [2018-11-14 16:53:46,611 INFO L268 TraceCheckUtils]: 17: Hoare quadruple {1790#true} {1814#(<= main_~n~0 0)} #132#return; {1814#(<= main_~n~0 0)} is VALID [2018-11-14 16:53:46,611 INFO L273 TraceCheckUtils]: 18: Hoare triple {1814#(<= main_~n~0 0)} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647; {1814#(<= main_~n~0 0)} is VALID [2018-11-14 16:53:46,612 INFO L273 TraceCheckUtils]: 19: Hoare triple {1814#(<= main_~n~0 0)} assume #t~ret8 == 0;havoc #t~mem7;havoc #t~ret8;call #t~mem9 := read~int(~#values~0.base, ~#values~0.offset + ~v~0 * 4, 4); {1814#(<= main_~n~0 0)} is VALID [2018-11-14 16:53:46,612 INFO L256 TraceCheckUtils]: 20: Hoare triple {1814#(<= main_~n~0 0)} call #t~ret10 := insert(~#set~0.base, ~#set~0.offset, ~n~0, #t~mem9); {1790#true} is VALID [2018-11-14 16:53:46,613 INFO L273 TraceCheckUtils]: 21: Hoare triple {1790#true} ~set.base, ~set.offset := #in~set.base, #in~set.offset;~size := #in~size;~value := #in~value;call write~int(~value, ~set.base, ~set.offset + ~size * 4, 4);#res := ~size + 1; {1863#(<= |insert_#res| (+ |insert_#in~size| 1))} is VALID [2018-11-14 16:53:46,613 INFO L273 TraceCheckUtils]: 22: Hoare triple {1863#(<= |insert_#res| (+ |insert_#in~size| 1))} assume true; {1863#(<= |insert_#res| (+ |insert_#in~size| 1))} is VALID [2018-11-14 16:53:46,615 INFO L268 TraceCheckUtils]: 23: Hoare quadruple {1863#(<= |insert_#res| (+ |insert_#in~size| 1))} {1814#(<= main_~n~0 0)} #134#return; {1870#(<= |main_#t~ret10| 1)} is VALID [2018-11-14 16:53:46,616 INFO L273 TraceCheckUtils]: 24: Hoare triple {1870#(<= |main_#t~ret10| 1)} assume -2147483648 <= #t~ret10 && #t~ret10 <= 2147483647;~n~0 := #t~ret10;havoc #t~ret10;havoc #t~mem9; {1874#(<= main_~n~0 1)} is VALID [2018-11-14 16:53:46,617 INFO L273 TraceCheckUtils]: 25: Hoare triple {1874#(<= main_~n~0 1)} #t~post6 := ~v~0;~v~0 := #t~post6 + 1;havoc #t~post6; {1874#(<= main_~n~0 1)} is VALID [2018-11-14 16:53:46,617 INFO L273 TraceCheckUtils]: 26: Hoare triple {1874#(<= main_~n~0 1)} assume true; {1874#(<= main_~n~0 1)} is VALID [2018-11-14 16:53:46,618 INFO L273 TraceCheckUtils]: 27: Hoare triple {1874#(<= main_~n~0 1)} assume !!(~v~0 < 100000);call #t~mem7 := read~int(~#values~0.base, ~#values~0.offset + ~v~0 * 4, 4); {1874#(<= main_~n~0 1)} is VALID [2018-11-14 16:53:46,618 INFO L256 TraceCheckUtils]: 28: Hoare triple {1874#(<= main_~n~0 1)} call #t~ret8 := elem_exists(~#set~0.base, ~#set~0.offset, ~n~0, #t~mem7); {1790#true} is VALID [2018-11-14 16:53:46,619 INFO L273 TraceCheckUtils]: 29: Hoare triple {1790#true} ~set.base, ~set.offset := #in~set.base, #in~set.offset;~size := #in~size;~value := #in~value;havoc ~i~0;~i~0 := 0; {1790#true} is VALID [2018-11-14 16:53:46,619 INFO L273 TraceCheckUtils]: 30: Hoare triple {1790#true} assume true; {1790#true} is VALID [2018-11-14 16:53:46,619 INFO L273 TraceCheckUtils]: 31: Hoare triple {1790#true} assume !!(~i~0 < ~size);call #t~mem1 := read~int(~set.base, ~set.offset + ~i~0 * 4, 4); {1790#true} is VALID [2018-11-14 16:53:46,620 INFO L273 TraceCheckUtils]: 32: Hoare triple {1790#true} assume #t~mem1 == ~value;havoc #t~mem1;#res := 1; {1790#true} is VALID [2018-11-14 16:53:46,620 INFO L273 TraceCheckUtils]: 33: Hoare triple {1790#true} assume true; {1790#true} is VALID [2018-11-14 16:53:46,623 INFO L268 TraceCheckUtils]: 34: Hoare quadruple {1790#true} {1874#(<= main_~n~0 1)} #132#return; {1874#(<= main_~n~0 1)} is VALID [2018-11-14 16:53:46,623 INFO L273 TraceCheckUtils]: 35: Hoare triple {1874#(<= main_~n~0 1)} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647; {1874#(<= main_~n~0 1)} is VALID [2018-11-14 16:53:46,624 INFO L273 TraceCheckUtils]: 36: Hoare triple {1874#(<= main_~n~0 1)} assume !(#t~ret8 == 0);havoc #t~mem7;havoc #t~ret8; {1874#(<= main_~n~0 1)} is VALID [2018-11-14 16:53:46,624 INFO L273 TraceCheckUtils]: 37: Hoare triple {1874#(<= main_~n~0 1)} #t~post6 := ~v~0;~v~0 := #t~post6 + 1;havoc #t~post6; {1874#(<= main_~n~0 1)} is VALID [2018-11-14 16:53:46,624 INFO L273 TraceCheckUtils]: 38: Hoare triple {1874#(<= main_~n~0 1)} assume true; {1874#(<= main_~n~0 1)} is VALID [2018-11-14 16:53:46,625 INFO L273 TraceCheckUtils]: 39: Hoare triple {1874#(<= main_~n~0 1)} assume !!(~v~0 < 100000);call #t~mem7 := read~int(~#values~0.base, ~#values~0.offset + ~v~0 * 4, 4); {1874#(<= main_~n~0 1)} is VALID [2018-11-14 16:53:46,625 INFO L256 TraceCheckUtils]: 40: Hoare triple {1874#(<= main_~n~0 1)} call #t~ret8 := elem_exists(~#set~0.base, ~#set~0.offset, ~n~0, #t~mem7); {1790#true} is VALID [2018-11-14 16:53:46,625 INFO L273 TraceCheckUtils]: 41: Hoare triple {1790#true} ~set.base, ~set.offset := #in~set.base, #in~set.offset;~size := #in~size;~value := #in~value;havoc ~i~0;~i~0 := 0; {1790#true} is VALID [2018-11-14 16:53:46,625 INFO L273 TraceCheckUtils]: 42: Hoare triple {1790#true} assume true; {1790#true} is VALID [2018-11-14 16:53:46,626 INFO L273 TraceCheckUtils]: 43: Hoare triple {1790#true} assume !!(~i~0 < ~size);call #t~mem1 := read~int(~set.base, ~set.offset + ~i~0 * 4, 4); {1790#true} is VALID [2018-11-14 16:53:46,626 INFO L273 TraceCheckUtils]: 44: Hoare triple {1790#true} assume #t~mem1 == ~value;havoc #t~mem1;#res := 1; {1790#true} is VALID [2018-11-14 16:53:46,626 INFO L273 TraceCheckUtils]: 45: Hoare triple {1790#true} assume true; {1790#true} is VALID [2018-11-14 16:53:46,627 INFO L268 TraceCheckUtils]: 46: Hoare quadruple {1790#true} {1874#(<= main_~n~0 1)} #132#return; {1874#(<= main_~n~0 1)} is VALID [2018-11-14 16:53:46,628 INFO L273 TraceCheckUtils]: 47: Hoare triple {1874#(<= main_~n~0 1)} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647; {1874#(<= main_~n~0 1)} is VALID [2018-11-14 16:53:46,628 INFO L273 TraceCheckUtils]: 48: Hoare triple {1874#(<= main_~n~0 1)} assume !(#t~ret8 == 0);havoc #t~mem7;havoc #t~ret8; {1874#(<= main_~n~0 1)} is VALID [2018-11-14 16:53:46,629 INFO L273 TraceCheckUtils]: 49: Hoare triple {1874#(<= main_~n~0 1)} #t~post6 := ~v~0;~v~0 := #t~post6 + 1;havoc #t~post6; {1874#(<= main_~n~0 1)} is VALID [2018-11-14 16:53:46,630 INFO L273 TraceCheckUtils]: 50: Hoare triple {1874#(<= main_~n~0 1)} assume true; {1874#(<= main_~n~0 1)} is VALID [2018-11-14 16:53:46,631 INFO L273 TraceCheckUtils]: 51: Hoare triple {1874#(<= main_~n~0 1)} assume !(~v~0 < 100000); {1874#(<= main_~n~0 1)} is VALID [2018-11-14 16:53:46,634 INFO L273 TraceCheckUtils]: 52: Hoare triple {1874#(<= main_~n~0 1)} ~x~0 := 0; {1959#(and (<= main_~n~0 1) (<= 0 main_~x~0))} is VALID [2018-11-14 16:53:46,635 INFO L273 TraceCheckUtils]: 53: Hoare triple {1959#(and (<= main_~n~0 1) (<= 0 main_~x~0))} assume true; {1959#(and (<= main_~n~0 1) (<= 0 main_~x~0))} is VALID [2018-11-14 16:53:46,636 INFO L273 TraceCheckUtils]: 54: Hoare triple {1959#(and (<= main_~n~0 1) (<= 0 main_~x~0))} assume !!(~x~0 < ~n~0);~y~0 := ~x~0 + 1; {1966#(and (<= 1 main_~y~0) (<= main_~n~0 1))} is VALID [2018-11-14 16:53:46,637 INFO L273 TraceCheckUtils]: 55: Hoare triple {1966#(and (<= 1 main_~y~0) (<= main_~n~0 1))} assume true; {1966#(and (<= 1 main_~y~0) (<= main_~n~0 1))} is VALID [2018-11-14 16:53:46,637 INFO L273 TraceCheckUtils]: 56: Hoare triple {1966#(and (<= 1 main_~y~0) (<= main_~n~0 1))} assume !!(~y~0 < ~n~0);call #t~mem13 := read~int(~#set~0.base, ~#set~0.offset + ~x~0 * 4, 4);call #t~mem14 := read~int(~#set~0.base, ~#set~0.offset + ~y~0 * 4, 4); {1791#false} is VALID [2018-11-14 16:53:46,638 INFO L256 TraceCheckUtils]: 57: Hoare triple {1791#false} call __VERIFIER_assert((if #t~mem13 != #t~mem14 then 1 else 0)); {1791#false} is VALID [2018-11-14 16:53:46,638 INFO L273 TraceCheckUtils]: 58: Hoare triple {1791#false} ~cond := #in~cond; {1791#false} is VALID [2018-11-14 16:53:46,638 INFO L273 TraceCheckUtils]: 59: Hoare triple {1791#false} assume ~cond == 0; {1791#false} is VALID [2018-11-14 16:53:46,638 INFO L273 TraceCheckUtils]: 60: Hoare triple {1791#false} assume !false; {1791#false} is VALID [2018-11-14 16:53:46,643 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2018-11-14 16:53:46,664 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 16:53:46,664 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 8] total 12 [2018-11-14 16:53:46,664 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 61 [2018-11-14 16:53:46,666 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 16:53:46,666 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states. [2018-11-14 16:53:46,784 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 81 edges. 81 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 16:53:46,785 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-11-14 16:53:46,785 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-11-14 16:53:46,785 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2018-11-14 16:53:46,786 INFO L87 Difference]: Start difference. First operand 81 states and 100 transitions. Second operand 12 states. [2018-11-14 16:53:49,514 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:53:49,515 INFO L93 Difference]: Finished difference Result 182 states and 236 transitions. [2018-11-14 16:53:49,515 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-11-14 16:53:49,515 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 61 [2018-11-14 16:53:49,515 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 16:53:49,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-11-14 16:53:49,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 199 transitions. [2018-11-14 16:53:49,522 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-11-14 16:53:49,528 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 199 transitions. [2018-11-14 16:53:49,529 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 22 states and 199 transitions. [2018-11-14 16:53:49,765 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 199 edges. 199 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 16:53:49,770 INFO L225 Difference]: With dead ends: 182 [2018-11-14 16:53:49,770 INFO L226 Difference]: Without dead ends: 159 [2018-11-14 16:53:49,771 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 57 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 120 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=197, Invalid=505, Unknown=0, NotChecked=0, Total=702 [2018-11-14 16:53:49,772 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2018-11-14 16:53:49,841 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 111. [2018-11-14 16:53:49,841 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 16:53:49,841 INFO L82 GeneralOperation]: Start isEquivalent. First operand 159 states. Second operand 111 states. [2018-11-14 16:53:49,841 INFO L74 IsIncluded]: Start isIncluded. First operand 159 states. Second operand 111 states. [2018-11-14 16:53:49,842 INFO L87 Difference]: Start difference. First operand 159 states. Second operand 111 states. [2018-11-14 16:53:49,850 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:53:49,850 INFO L93 Difference]: Finished difference Result 159 states and 208 transitions. [2018-11-14 16:53:49,850 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 208 transitions. [2018-11-14 16:53:49,851 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:53:49,852 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:53:49,852 INFO L74 IsIncluded]: Start isIncluded. First operand 111 states. Second operand 159 states. [2018-11-14 16:53:49,852 INFO L87 Difference]: Start difference. First operand 111 states. Second operand 159 states. [2018-11-14 16:53:49,860 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:53:49,860 INFO L93 Difference]: Finished difference Result 159 states and 208 transitions. [2018-11-14 16:53:49,861 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 208 transitions. [2018-11-14 16:53:49,862 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:53:49,862 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:53:49,862 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 16:53:49,862 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 16:53:49,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 111 states. [2018-11-14 16:53:49,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 142 transitions. [2018-11-14 16:53:49,867 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 142 transitions. Word has length 61 [2018-11-14 16:53:49,868 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 16:53:49,868 INFO L480 AbstractCegarLoop]: Abstraction has 111 states and 142 transitions. [2018-11-14 16:53:49,868 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-11-14 16:53:49,868 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 142 transitions. [2018-11-14 16:53:49,870 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2018-11-14 16:53:49,871 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 16:53:49,871 INFO L375 BasicCegarLoop]: trace histogram [5, 4, 4, 4, 4, 4, 4, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 16:53:49,871 INFO L423 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 16:53:49,871 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 16:53:49,872 INFO L82 PathProgramCache]: Analyzing trace with hash -1837095063, now seen corresponding path program 3 times [2018-11-14 16:53:49,872 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 16:53:49,872 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 16:53:49,873 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 16:53:49,873 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-14 16:53:49,873 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 16:53:49,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:53:50,019 INFO L256 TraceCheckUtils]: 0: Hoare triple {2716#true} call ULTIMATE.init(); {2716#true} is VALID [2018-11-14 16:53:50,020 INFO L273 TraceCheckUtils]: 1: Hoare triple {2716#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {2716#true} is VALID [2018-11-14 16:53:50,020 INFO L273 TraceCheckUtils]: 2: Hoare triple {2716#true} assume true; {2716#true} is VALID [2018-11-14 16:53:50,020 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {2716#true} {2716#true} #126#return; {2716#true} is VALID [2018-11-14 16:53:50,021 INFO L256 TraceCheckUtils]: 4: Hoare triple {2716#true} call #t~ret15 := main(); {2716#true} is VALID [2018-11-14 16:53:50,021 INFO L273 TraceCheckUtils]: 5: Hoare triple {2716#true} ~n~0 := 0;call ~#set~0.base, ~#set~0.offset := #Ultimate.alloc(400000);havoc ~x~0;havoc ~y~0;~x~0 := 0; {2716#true} is VALID [2018-11-14 16:53:50,021 INFO L273 TraceCheckUtils]: 6: Hoare triple {2716#true} assume true; {2716#true} is VALID [2018-11-14 16:53:50,021 INFO L273 TraceCheckUtils]: 7: Hoare triple {2716#true} assume !(~x~0 < ~n~0); {2716#true} is VALID [2018-11-14 16:53:50,028 INFO L273 TraceCheckUtils]: 8: Hoare triple {2716#true} call ~#values~0.base, ~#values~0.offset := #Ultimate.alloc(400000);havoc ~v~0;~v~0 := 0; {2718#(= main_~v~0 0)} is VALID [2018-11-14 16:53:50,028 INFO L273 TraceCheckUtils]: 9: Hoare triple {2718#(= main_~v~0 0)} assume true; {2718#(= main_~v~0 0)} is VALID [2018-11-14 16:53:50,030 INFO L273 TraceCheckUtils]: 10: Hoare triple {2718#(= main_~v~0 0)} assume !!(~v~0 < 100000);call #t~mem7 := read~int(~#values~0.base, ~#values~0.offset + ~v~0 * 4, 4); {2718#(= main_~v~0 0)} is VALID [2018-11-14 16:53:50,030 INFO L256 TraceCheckUtils]: 11: Hoare triple {2718#(= main_~v~0 0)} call #t~ret8 := elem_exists(~#set~0.base, ~#set~0.offset, ~n~0, #t~mem7); {2716#true} is VALID [2018-11-14 16:53:50,030 INFO L273 TraceCheckUtils]: 12: Hoare triple {2716#true} ~set.base, ~set.offset := #in~set.base, #in~set.offset;~size := #in~size;~value := #in~value;havoc ~i~0;~i~0 := 0; {2716#true} is VALID [2018-11-14 16:53:50,030 INFO L273 TraceCheckUtils]: 13: Hoare triple {2716#true} assume true; {2716#true} is VALID [2018-11-14 16:53:50,030 INFO L273 TraceCheckUtils]: 14: Hoare triple {2716#true} assume !(~i~0 < ~size); {2716#true} is VALID [2018-11-14 16:53:50,030 INFO L273 TraceCheckUtils]: 15: Hoare triple {2716#true} #res := 0; {2716#true} is VALID [2018-11-14 16:53:50,031 INFO L273 TraceCheckUtils]: 16: Hoare triple {2716#true} assume true; {2716#true} is VALID [2018-11-14 16:53:50,033 INFO L268 TraceCheckUtils]: 17: Hoare quadruple {2716#true} {2718#(= main_~v~0 0)} #132#return; {2718#(= main_~v~0 0)} is VALID [2018-11-14 16:53:50,033 INFO L273 TraceCheckUtils]: 18: Hoare triple {2718#(= main_~v~0 0)} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647; {2718#(= main_~v~0 0)} is VALID [2018-11-14 16:53:50,035 INFO L273 TraceCheckUtils]: 19: Hoare triple {2718#(= main_~v~0 0)} assume #t~ret8 == 0;havoc #t~mem7;havoc #t~ret8;call #t~mem9 := read~int(~#values~0.base, ~#values~0.offset + ~v~0 * 4, 4); {2718#(= main_~v~0 0)} is VALID [2018-11-14 16:53:50,035 INFO L256 TraceCheckUtils]: 20: Hoare triple {2718#(= main_~v~0 0)} call #t~ret10 := insert(~#set~0.base, ~#set~0.offset, ~n~0, #t~mem9); {2716#true} is VALID [2018-11-14 16:53:50,035 INFO L273 TraceCheckUtils]: 21: Hoare triple {2716#true} ~set.base, ~set.offset := #in~set.base, #in~set.offset;~size := #in~size;~value := #in~value;call write~int(~value, ~set.base, ~set.offset + ~size * 4, 4);#res := ~size + 1; {2716#true} is VALID [2018-11-14 16:53:50,035 INFO L273 TraceCheckUtils]: 22: Hoare triple {2716#true} assume true; {2716#true} is VALID [2018-11-14 16:53:50,037 INFO L268 TraceCheckUtils]: 23: Hoare quadruple {2716#true} {2718#(= main_~v~0 0)} #134#return; {2718#(= main_~v~0 0)} is VALID [2018-11-14 16:53:50,037 INFO L273 TraceCheckUtils]: 24: Hoare triple {2718#(= main_~v~0 0)} assume -2147483648 <= #t~ret10 && #t~ret10 <= 2147483647;~n~0 := #t~ret10;havoc #t~ret10;havoc #t~mem9; {2718#(= main_~v~0 0)} is VALID [2018-11-14 16:53:50,038 INFO L273 TraceCheckUtils]: 25: Hoare triple {2718#(= main_~v~0 0)} #t~post6 := ~v~0;~v~0 := #t~post6 + 1;havoc #t~post6; {2719#(<= main_~v~0 1)} is VALID [2018-11-14 16:53:50,038 INFO L273 TraceCheckUtils]: 26: Hoare triple {2719#(<= main_~v~0 1)} assume true; {2719#(<= main_~v~0 1)} is VALID [2018-11-14 16:53:50,042 INFO L273 TraceCheckUtils]: 27: Hoare triple {2719#(<= main_~v~0 1)} assume !!(~v~0 < 100000);call #t~mem7 := read~int(~#values~0.base, ~#values~0.offset + ~v~0 * 4, 4); {2719#(<= main_~v~0 1)} is VALID [2018-11-14 16:53:50,042 INFO L256 TraceCheckUtils]: 28: Hoare triple {2719#(<= main_~v~0 1)} call #t~ret8 := elem_exists(~#set~0.base, ~#set~0.offset, ~n~0, #t~mem7); {2716#true} is VALID [2018-11-14 16:53:50,042 INFO L273 TraceCheckUtils]: 29: Hoare triple {2716#true} ~set.base, ~set.offset := #in~set.base, #in~set.offset;~size := #in~size;~value := #in~value;havoc ~i~0;~i~0 := 0; {2716#true} is VALID [2018-11-14 16:53:50,042 INFO L273 TraceCheckUtils]: 30: Hoare triple {2716#true} assume true; {2716#true} is VALID [2018-11-14 16:53:50,043 INFO L273 TraceCheckUtils]: 31: Hoare triple {2716#true} assume !(~i~0 < ~size); {2716#true} is VALID [2018-11-14 16:53:50,043 INFO L273 TraceCheckUtils]: 32: Hoare triple {2716#true} #res := 0; {2716#true} is VALID [2018-11-14 16:53:50,043 INFO L273 TraceCheckUtils]: 33: Hoare triple {2716#true} assume true; {2716#true} is VALID [2018-11-14 16:53:50,045 INFO L268 TraceCheckUtils]: 34: Hoare quadruple {2716#true} {2719#(<= main_~v~0 1)} #132#return; {2719#(<= main_~v~0 1)} is VALID [2018-11-14 16:53:50,045 INFO L273 TraceCheckUtils]: 35: Hoare triple {2719#(<= main_~v~0 1)} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647; {2719#(<= main_~v~0 1)} is VALID [2018-11-14 16:53:50,047 INFO L273 TraceCheckUtils]: 36: Hoare triple {2719#(<= main_~v~0 1)} assume #t~ret8 == 0;havoc #t~mem7;havoc #t~ret8;call #t~mem9 := read~int(~#values~0.base, ~#values~0.offset + ~v~0 * 4, 4); {2719#(<= main_~v~0 1)} is VALID [2018-11-14 16:53:50,047 INFO L256 TraceCheckUtils]: 37: Hoare triple {2719#(<= main_~v~0 1)} call #t~ret10 := insert(~#set~0.base, ~#set~0.offset, ~n~0, #t~mem9); {2716#true} is VALID [2018-11-14 16:53:50,047 INFO L273 TraceCheckUtils]: 38: Hoare triple {2716#true} ~set.base, ~set.offset := #in~set.base, #in~set.offset;~size := #in~size;~value := #in~value;call write~int(~value, ~set.base, ~set.offset + ~size * 4, 4);#res := ~size + 1; {2716#true} is VALID [2018-11-14 16:53:50,047 INFO L273 TraceCheckUtils]: 39: Hoare triple {2716#true} assume true; {2716#true} is VALID [2018-11-14 16:53:50,050 INFO L268 TraceCheckUtils]: 40: Hoare quadruple {2716#true} {2719#(<= main_~v~0 1)} #134#return; {2719#(<= main_~v~0 1)} is VALID [2018-11-14 16:53:50,050 INFO L273 TraceCheckUtils]: 41: Hoare triple {2719#(<= main_~v~0 1)} assume -2147483648 <= #t~ret10 && #t~ret10 <= 2147483647;~n~0 := #t~ret10;havoc #t~ret10;havoc #t~mem9; {2719#(<= main_~v~0 1)} is VALID [2018-11-14 16:53:50,052 INFO L273 TraceCheckUtils]: 42: Hoare triple {2719#(<= main_~v~0 1)} #t~post6 := ~v~0;~v~0 := #t~post6 + 1;havoc #t~post6; {2720#(<= main_~v~0 2)} is VALID [2018-11-14 16:53:50,052 INFO L273 TraceCheckUtils]: 43: Hoare triple {2720#(<= main_~v~0 2)} assume true; {2720#(<= main_~v~0 2)} is VALID [2018-11-14 16:53:50,054 INFO L273 TraceCheckUtils]: 44: Hoare triple {2720#(<= main_~v~0 2)} assume !!(~v~0 < 100000);call #t~mem7 := read~int(~#values~0.base, ~#values~0.offset + ~v~0 * 4, 4); {2720#(<= main_~v~0 2)} is VALID [2018-11-14 16:53:50,054 INFO L256 TraceCheckUtils]: 45: Hoare triple {2720#(<= main_~v~0 2)} call #t~ret8 := elem_exists(~#set~0.base, ~#set~0.offset, ~n~0, #t~mem7); {2716#true} is VALID [2018-11-14 16:53:50,054 INFO L273 TraceCheckUtils]: 46: Hoare triple {2716#true} ~set.base, ~set.offset := #in~set.base, #in~set.offset;~size := #in~size;~value := #in~value;havoc ~i~0;~i~0 := 0; {2716#true} is VALID [2018-11-14 16:53:50,054 INFO L273 TraceCheckUtils]: 47: Hoare triple {2716#true} assume true; {2716#true} is VALID [2018-11-14 16:53:50,054 INFO L273 TraceCheckUtils]: 48: Hoare triple {2716#true} assume !!(~i~0 < ~size);call #t~mem1 := read~int(~set.base, ~set.offset + ~i~0 * 4, 4); {2716#true} is VALID [2018-11-14 16:53:50,054 INFO L273 TraceCheckUtils]: 49: Hoare triple {2716#true} assume #t~mem1 == ~value;havoc #t~mem1;#res := 1; {2716#true} is VALID [2018-11-14 16:53:50,054 INFO L273 TraceCheckUtils]: 50: Hoare triple {2716#true} assume true; {2716#true} is VALID [2018-11-14 16:53:50,056 INFO L268 TraceCheckUtils]: 51: Hoare quadruple {2716#true} {2720#(<= main_~v~0 2)} #132#return; {2720#(<= main_~v~0 2)} is VALID [2018-11-14 16:53:50,056 INFO L273 TraceCheckUtils]: 52: Hoare triple {2720#(<= main_~v~0 2)} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647; {2720#(<= main_~v~0 2)} is VALID [2018-11-14 16:53:50,058 INFO L273 TraceCheckUtils]: 53: Hoare triple {2720#(<= main_~v~0 2)} assume !(#t~ret8 == 0);havoc #t~mem7;havoc #t~ret8; {2720#(<= main_~v~0 2)} is VALID [2018-11-14 16:53:50,058 INFO L273 TraceCheckUtils]: 54: Hoare triple {2720#(<= main_~v~0 2)} #t~post6 := ~v~0;~v~0 := #t~post6 + 1;havoc #t~post6; {2721#(<= main_~v~0 3)} is VALID [2018-11-14 16:53:50,060 INFO L273 TraceCheckUtils]: 55: Hoare triple {2721#(<= main_~v~0 3)} assume true; {2721#(<= main_~v~0 3)} is VALID [2018-11-14 16:53:50,060 INFO L273 TraceCheckUtils]: 56: Hoare triple {2721#(<= main_~v~0 3)} assume !!(~v~0 < 100000);call #t~mem7 := read~int(~#values~0.base, ~#values~0.offset + ~v~0 * 4, 4); {2721#(<= main_~v~0 3)} is VALID [2018-11-14 16:53:50,060 INFO L256 TraceCheckUtils]: 57: Hoare triple {2721#(<= main_~v~0 3)} call #t~ret8 := elem_exists(~#set~0.base, ~#set~0.offset, ~n~0, #t~mem7); {2716#true} is VALID [2018-11-14 16:53:50,060 INFO L273 TraceCheckUtils]: 58: Hoare triple {2716#true} ~set.base, ~set.offset := #in~set.base, #in~set.offset;~size := #in~size;~value := #in~value;havoc ~i~0;~i~0 := 0; {2716#true} is VALID [2018-11-14 16:53:50,060 INFO L273 TraceCheckUtils]: 59: Hoare triple {2716#true} assume true; {2716#true} is VALID [2018-11-14 16:53:50,061 INFO L273 TraceCheckUtils]: 60: Hoare triple {2716#true} assume !!(~i~0 < ~size);call #t~mem1 := read~int(~set.base, ~set.offset + ~i~0 * 4, 4); {2716#true} is VALID [2018-11-14 16:53:50,061 INFO L273 TraceCheckUtils]: 61: Hoare triple {2716#true} assume #t~mem1 == ~value;havoc #t~mem1;#res := 1; {2716#true} is VALID [2018-11-14 16:53:50,061 INFO L273 TraceCheckUtils]: 62: Hoare triple {2716#true} assume true; {2716#true} is VALID [2018-11-14 16:53:50,062 INFO L268 TraceCheckUtils]: 63: Hoare quadruple {2716#true} {2721#(<= main_~v~0 3)} #132#return; {2721#(<= main_~v~0 3)} is VALID [2018-11-14 16:53:50,062 INFO L273 TraceCheckUtils]: 64: Hoare triple {2721#(<= main_~v~0 3)} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647; {2721#(<= main_~v~0 3)} is VALID [2018-11-14 16:53:50,062 INFO L273 TraceCheckUtils]: 65: Hoare triple {2721#(<= main_~v~0 3)} assume !(#t~ret8 == 0);havoc #t~mem7;havoc #t~ret8; {2721#(<= main_~v~0 3)} is VALID [2018-11-14 16:53:50,063 INFO L273 TraceCheckUtils]: 66: Hoare triple {2721#(<= main_~v~0 3)} #t~post6 := ~v~0;~v~0 := #t~post6 + 1;havoc #t~post6; {2722#(<= main_~v~0 4)} is VALID [2018-11-14 16:53:50,063 INFO L273 TraceCheckUtils]: 67: Hoare triple {2722#(<= main_~v~0 4)} assume true; {2722#(<= main_~v~0 4)} is VALID [2018-11-14 16:53:50,064 INFO L273 TraceCheckUtils]: 68: Hoare triple {2722#(<= main_~v~0 4)} assume !(~v~0 < 100000); {2717#false} is VALID [2018-11-14 16:53:50,064 INFO L273 TraceCheckUtils]: 69: Hoare triple {2717#false} ~x~0 := 0; {2717#false} is VALID [2018-11-14 16:53:50,064 INFO L273 TraceCheckUtils]: 70: Hoare triple {2717#false} assume true; {2717#false} is VALID [2018-11-14 16:53:50,064 INFO L273 TraceCheckUtils]: 71: Hoare triple {2717#false} assume !!(~x~0 < ~n~0);~y~0 := ~x~0 + 1; {2717#false} is VALID [2018-11-14 16:53:50,064 INFO L273 TraceCheckUtils]: 72: Hoare triple {2717#false} assume true; {2717#false} is VALID [2018-11-14 16:53:50,064 INFO L273 TraceCheckUtils]: 73: Hoare triple {2717#false} assume !!(~y~0 < ~n~0);call #t~mem13 := read~int(~#set~0.base, ~#set~0.offset + ~x~0 * 4, 4);call #t~mem14 := read~int(~#set~0.base, ~#set~0.offset + ~y~0 * 4, 4); {2717#false} is VALID [2018-11-14 16:53:50,064 INFO L256 TraceCheckUtils]: 74: Hoare triple {2717#false} call __VERIFIER_assert((if #t~mem13 != #t~mem14 then 1 else 0)); {2717#false} is VALID [2018-11-14 16:53:50,064 INFO L273 TraceCheckUtils]: 75: Hoare triple {2717#false} ~cond := #in~cond; {2717#false} is VALID [2018-11-14 16:53:50,065 INFO L273 TraceCheckUtils]: 76: Hoare triple {2717#false} assume ~cond == 0; {2717#false} is VALID [2018-11-14 16:53:50,065 INFO L273 TraceCheckUtils]: 77: Hoare triple {2717#false} assume !false; {2717#false} is VALID [2018-11-14 16:53:50,068 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 0 proven. 46 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2018-11-14 16:53:50,068 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-14 16:53:50,068 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-14 16:53:50,077 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-14 16:53:50,133 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2018-11-14 16:53:50,134 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-14 16:53:50,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:53:50,170 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 16:53:50,533 INFO L256 TraceCheckUtils]: 0: Hoare triple {2716#true} call ULTIMATE.init(); {2716#true} is VALID [2018-11-14 16:53:50,533 INFO L273 TraceCheckUtils]: 1: Hoare triple {2716#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {2716#true} is VALID [2018-11-14 16:53:50,533 INFO L273 TraceCheckUtils]: 2: Hoare triple {2716#true} assume true; {2716#true} is VALID [2018-11-14 16:53:50,534 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {2716#true} {2716#true} #126#return; {2716#true} is VALID [2018-11-14 16:53:50,534 INFO L256 TraceCheckUtils]: 4: Hoare triple {2716#true} call #t~ret15 := main(); {2716#true} is VALID [2018-11-14 16:53:50,534 INFO L273 TraceCheckUtils]: 5: Hoare triple {2716#true} ~n~0 := 0;call ~#set~0.base, ~#set~0.offset := #Ultimate.alloc(400000);havoc ~x~0;havoc ~y~0;~x~0 := 0; {2716#true} is VALID [2018-11-14 16:53:50,534 INFO L273 TraceCheckUtils]: 6: Hoare triple {2716#true} assume true; {2716#true} is VALID [2018-11-14 16:53:50,534 INFO L273 TraceCheckUtils]: 7: Hoare triple {2716#true} assume !(~x~0 < ~n~0); {2716#true} is VALID [2018-11-14 16:53:50,535 INFO L273 TraceCheckUtils]: 8: Hoare triple {2716#true} call ~#values~0.base, ~#values~0.offset := #Ultimate.alloc(400000);havoc ~v~0;~v~0 := 0; {2750#(<= main_~v~0 0)} is VALID [2018-11-14 16:53:50,535 INFO L273 TraceCheckUtils]: 9: Hoare triple {2750#(<= main_~v~0 0)} assume true; {2750#(<= main_~v~0 0)} is VALID [2018-11-14 16:53:50,540 INFO L273 TraceCheckUtils]: 10: Hoare triple {2750#(<= main_~v~0 0)} assume !!(~v~0 < 100000);call #t~mem7 := read~int(~#values~0.base, ~#values~0.offset + ~v~0 * 4, 4); {2750#(<= main_~v~0 0)} is VALID [2018-11-14 16:53:50,540 INFO L256 TraceCheckUtils]: 11: Hoare triple {2750#(<= main_~v~0 0)} call #t~ret8 := elem_exists(~#set~0.base, ~#set~0.offset, ~n~0, #t~mem7); {2716#true} is VALID [2018-11-14 16:53:50,540 INFO L273 TraceCheckUtils]: 12: Hoare triple {2716#true} ~set.base, ~set.offset := #in~set.base, #in~set.offset;~size := #in~size;~value := #in~value;havoc ~i~0;~i~0 := 0; {2716#true} is VALID [2018-11-14 16:53:50,540 INFO L273 TraceCheckUtils]: 13: Hoare triple {2716#true} assume true; {2716#true} is VALID [2018-11-14 16:53:50,540 INFO L273 TraceCheckUtils]: 14: Hoare triple {2716#true} assume !(~i~0 < ~size); {2716#true} is VALID [2018-11-14 16:53:50,541 INFO L273 TraceCheckUtils]: 15: Hoare triple {2716#true} #res := 0; {2716#true} is VALID [2018-11-14 16:53:50,541 INFO L273 TraceCheckUtils]: 16: Hoare triple {2716#true} assume true; {2716#true} is VALID [2018-11-14 16:53:50,542 INFO L268 TraceCheckUtils]: 17: Hoare quadruple {2716#true} {2750#(<= main_~v~0 0)} #132#return; {2750#(<= main_~v~0 0)} is VALID [2018-11-14 16:53:50,546 INFO L273 TraceCheckUtils]: 18: Hoare triple {2750#(<= main_~v~0 0)} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647; {2750#(<= main_~v~0 0)} is VALID [2018-11-14 16:53:50,546 INFO L273 TraceCheckUtils]: 19: Hoare triple {2750#(<= main_~v~0 0)} assume #t~ret8 == 0;havoc #t~mem7;havoc #t~ret8;call #t~mem9 := read~int(~#values~0.base, ~#values~0.offset + ~v~0 * 4, 4); {2750#(<= main_~v~0 0)} is VALID [2018-11-14 16:53:50,546 INFO L256 TraceCheckUtils]: 20: Hoare triple {2750#(<= main_~v~0 0)} call #t~ret10 := insert(~#set~0.base, ~#set~0.offset, ~n~0, #t~mem9); {2716#true} is VALID [2018-11-14 16:53:50,546 INFO L273 TraceCheckUtils]: 21: Hoare triple {2716#true} ~set.base, ~set.offset := #in~set.base, #in~set.offset;~size := #in~size;~value := #in~value;call write~int(~value, ~set.base, ~set.offset + ~size * 4, 4);#res := ~size + 1; {2716#true} is VALID [2018-11-14 16:53:50,547 INFO L273 TraceCheckUtils]: 22: Hoare triple {2716#true} assume true; {2716#true} is VALID [2018-11-14 16:53:50,548 INFO L268 TraceCheckUtils]: 23: Hoare quadruple {2716#true} {2750#(<= main_~v~0 0)} #134#return; {2750#(<= main_~v~0 0)} is VALID [2018-11-14 16:53:50,549 INFO L273 TraceCheckUtils]: 24: Hoare triple {2750#(<= main_~v~0 0)} assume -2147483648 <= #t~ret10 && #t~ret10 <= 2147483647;~n~0 := #t~ret10;havoc #t~ret10;havoc #t~mem9; {2750#(<= main_~v~0 0)} is VALID [2018-11-14 16:53:50,550 INFO L273 TraceCheckUtils]: 25: Hoare triple {2750#(<= main_~v~0 0)} #t~post6 := ~v~0;~v~0 := #t~post6 + 1;havoc #t~post6; {2719#(<= main_~v~0 1)} is VALID [2018-11-14 16:53:50,551 INFO L273 TraceCheckUtils]: 26: Hoare triple {2719#(<= main_~v~0 1)} assume true; {2719#(<= main_~v~0 1)} is VALID [2018-11-14 16:53:50,551 INFO L273 TraceCheckUtils]: 27: Hoare triple {2719#(<= main_~v~0 1)} assume !!(~v~0 < 100000);call #t~mem7 := read~int(~#values~0.base, ~#values~0.offset + ~v~0 * 4, 4); {2719#(<= main_~v~0 1)} is VALID [2018-11-14 16:53:50,552 INFO L256 TraceCheckUtils]: 28: Hoare triple {2719#(<= main_~v~0 1)} call #t~ret8 := elem_exists(~#set~0.base, ~#set~0.offset, ~n~0, #t~mem7); {2716#true} is VALID [2018-11-14 16:53:50,552 INFO L273 TraceCheckUtils]: 29: Hoare triple {2716#true} ~set.base, ~set.offset := #in~set.base, #in~set.offset;~size := #in~size;~value := #in~value;havoc ~i~0;~i~0 := 0; {2716#true} is VALID [2018-11-14 16:53:50,552 INFO L273 TraceCheckUtils]: 30: Hoare triple {2716#true} assume true; {2716#true} is VALID [2018-11-14 16:53:50,553 INFO L273 TraceCheckUtils]: 31: Hoare triple {2716#true} assume !(~i~0 < ~size); {2716#true} is VALID [2018-11-14 16:53:50,553 INFO L273 TraceCheckUtils]: 32: Hoare triple {2716#true} #res := 0; {2716#true} is VALID [2018-11-14 16:53:50,553 INFO L273 TraceCheckUtils]: 33: Hoare triple {2716#true} assume true; {2716#true} is VALID [2018-11-14 16:53:50,555 INFO L268 TraceCheckUtils]: 34: Hoare quadruple {2716#true} {2719#(<= main_~v~0 1)} #132#return; {2719#(<= main_~v~0 1)} is VALID [2018-11-14 16:53:50,556 INFO L273 TraceCheckUtils]: 35: Hoare triple {2719#(<= main_~v~0 1)} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647; {2719#(<= main_~v~0 1)} is VALID [2018-11-14 16:53:50,559 INFO L273 TraceCheckUtils]: 36: Hoare triple {2719#(<= main_~v~0 1)} assume #t~ret8 == 0;havoc #t~mem7;havoc #t~ret8;call #t~mem9 := read~int(~#values~0.base, ~#values~0.offset + ~v~0 * 4, 4); {2719#(<= main_~v~0 1)} is VALID [2018-11-14 16:53:50,560 INFO L256 TraceCheckUtils]: 37: Hoare triple {2719#(<= main_~v~0 1)} call #t~ret10 := insert(~#set~0.base, ~#set~0.offset, ~n~0, #t~mem9); {2716#true} is VALID [2018-11-14 16:53:50,560 INFO L273 TraceCheckUtils]: 38: Hoare triple {2716#true} ~set.base, ~set.offset := #in~set.base, #in~set.offset;~size := #in~size;~value := #in~value;call write~int(~value, ~set.base, ~set.offset + ~size * 4, 4);#res := ~size + 1; {2716#true} is VALID [2018-11-14 16:53:50,560 INFO L273 TraceCheckUtils]: 39: Hoare triple {2716#true} assume true; {2716#true} is VALID [2018-11-14 16:53:50,562 INFO L268 TraceCheckUtils]: 40: Hoare quadruple {2716#true} {2719#(<= main_~v~0 1)} #134#return; {2719#(<= main_~v~0 1)} is VALID [2018-11-14 16:53:50,562 INFO L273 TraceCheckUtils]: 41: Hoare triple {2719#(<= main_~v~0 1)} assume -2147483648 <= #t~ret10 && #t~ret10 <= 2147483647;~n~0 := #t~ret10;havoc #t~ret10;havoc #t~mem9; {2719#(<= main_~v~0 1)} is VALID [2018-11-14 16:53:50,564 INFO L273 TraceCheckUtils]: 42: Hoare triple {2719#(<= main_~v~0 1)} #t~post6 := ~v~0;~v~0 := #t~post6 + 1;havoc #t~post6; {2720#(<= main_~v~0 2)} is VALID [2018-11-14 16:53:50,564 INFO L273 TraceCheckUtils]: 43: Hoare triple {2720#(<= main_~v~0 2)} assume true; {2720#(<= main_~v~0 2)} is VALID [2018-11-14 16:53:50,566 INFO L273 TraceCheckUtils]: 44: Hoare triple {2720#(<= main_~v~0 2)} assume !!(~v~0 < 100000);call #t~mem7 := read~int(~#values~0.base, ~#values~0.offset + ~v~0 * 4, 4); {2720#(<= main_~v~0 2)} is VALID [2018-11-14 16:53:50,566 INFO L256 TraceCheckUtils]: 45: Hoare triple {2720#(<= main_~v~0 2)} call #t~ret8 := elem_exists(~#set~0.base, ~#set~0.offset, ~n~0, #t~mem7); {2716#true} is VALID [2018-11-14 16:53:50,566 INFO L273 TraceCheckUtils]: 46: Hoare triple {2716#true} ~set.base, ~set.offset := #in~set.base, #in~set.offset;~size := #in~size;~value := #in~value;havoc ~i~0;~i~0 := 0; {2716#true} is VALID [2018-11-14 16:53:50,566 INFO L273 TraceCheckUtils]: 47: Hoare triple {2716#true} assume true; {2716#true} is VALID [2018-11-14 16:53:50,566 INFO L273 TraceCheckUtils]: 48: Hoare triple {2716#true} assume !!(~i~0 < ~size);call #t~mem1 := read~int(~set.base, ~set.offset + ~i~0 * 4, 4); {2716#true} is VALID [2018-11-14 16:53:50,567 INFO L273 TraceCheckUtils]: 49: Hoare triple {2716#true} assume #t~mem1 == ~value;havoc #t~mem1;#res := 1; {2716#true} is VALID [2018-11-14 16:53:50,567 INFO L273 TraceCheckUtils]: 50: Hoare triple {2716#true} assume true; {2716#true} is VALID [2018-11-14 16:53:50,568 INFO L268 TraceCheckUtils]: 51: Hoare quadruple {2716#true} {2720#(<= main_~v~0 2)} #132#return; {2720#(<= main_~v~0 2)} is VALID [2018-11-14 16:53:50,569 INFO L273 TraceCheckUtils]: 52: Hoare triple {2720#(<= main_~v~0 2)} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647; {2720#(<= main_~v~0 2)} is VALID [2018-11-14 16:53:50,569 INFO L273 TraceCheckUtils]: 53: Hoare triple {2720#(<= main_~v~0 2)} assume !(#t~ret8 == 0);havoc #t~mem7;havoc #t~ret8; {2720#(<= main_~v~0 2)} is VALID [2018-11-14 16:53:50,571 INFO L273 TraceCheckUtils]: 54: Hoare triple {2720#(<= main_~v~0 2)} #t~post6 := ~v~0;~v~0 := #t~post6 + 1;havoc #t~post6; {2721#(<= main_~v~0 3)} is VALID [2018-11-14 16:53:50,571 INFO L273 TraceCheckUtils]: 55: Hoare triple {2721#(<= main_~v~0 3)} assume true; {2721#(<= main_~v~0 3)} is VALID [2018-11-14 16:53:50,573 INFO L273 TraceCheckUtils]: 56: Hoare triple {2721#(<= main_~v~0 3)} assume !!(~v~0 < 100000);call #t~mem7 := read~int(~#values~0.base, ~#values~0.offset + ~v~0 * 4, 4); {2721#(<= main_~v~0 3)} is VALID [2018-11-14 16:53:50,573 INFO L256 TraceCheckUtils]: 57: Hoare triple {2721#(<= main_~v~0 3)} call #t~ret8 := elem_exists(~#set~0.base, ~#set~0.offset, ~n~0, #t~mem7); {2716#true} is VALID [2018-11-14 16:53:50,573 INFO L273 TraceCheckUtils]: 58: Hoare triple {2716#true} ~set.base, ~set.offset := #in~set.base, #in~set.offset;~size := #in~size;~value := #in~value;havoc ~i~0;~i~0 := 0; {2716#true} is VALID [2018-11-14 16:53:50,573 INFO L273 TraceCheckUtils]: 59: Hoare triple {2716#true} assume true; {2716#true} is VALID [2018-11-14 16:53:50,573 INFO L273 TraceCheckUtils]: 60: Hoare triple {2716#true} assume !!(~i~0 < ~size);call #t~mem1 := read~int(~set.base, ~set.offset + ~i~0 * 4, 4); {2716#true} is VALID [2018-11-14 16:53:50,574 INFO L273 TraceCheckUtils]: 61: Hoare triple {2716#true} assume #t~mem1 == ~value;havoc #t~mem1;#res := 1; {2716#true} is VALID [2018-11-14 16:53:50,574 INFO L273 TraceCheckUtils]: 62: Hoare triple {2716#true} assume true; {2716#true} is VALID [2018-11-14 16:53:50,579 INFO L268 TraceCheckUtils]: 63: Hoare quadruple {2716#true} {2721#(<= main_~v~0 3)} #132#return; {2721#(<= main_~v~0 3)} is VALID [2018-11-14 16:53:50,581 INFO L273 TraceCheckUtils]: 64: Hoare triple {2721#(<= main_~v~0 3)} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647; {2721#(<= main_~v~0 3)} is VALID [2018-11-14 16:53:50,586 INFO L273 TraceCheckUtils]: 65: Hoare triple {2721#(<= main_~v~0 3)} assume !(#t~ret8 == 0);havoc #t~mem7;havoc #t~ret8; {2721#(<= main_~v~0 3)} is VALID [2018-11-14 16:53:50,588 INFO L273 TraceCheckUtils]: 66: Hoare triple {2721#(<= main_~v~0 3)} #t~post6 := ~v~0;~v~0 := #t~post6 + 1;havoc #t~post6; {2722#(<= main_~v~0 4)} is VALID [2018-11-14 16:53:50,588 INFO L273 TraceCheckUtils]: 67: Hoare triple {2722#(<= main_~v~0 4)} assume true; {2722#(<= main_~v~0 4)} is VALID [2018-11-14 16:53:50,591 INFO L273 TraceCheckUtils]: 68: Hoare triple {2722#(<= main_~v~0 4)} assume !(~v~0 < 100000); {2717#false} is VALID [2018-11-14 16:53:50,591 INFO L273 TraceCheckUtils]: 69: Hoare triple {2717#false} ~x~0 := 0; {2717#false} is VALID [2018-11-14 16:53:50,591 INFO L273 TraceCheckUtils]: 70: Hoare triple {2717#false} assume true; {2717#false} is VALID [2018-11-14 16:53:50,591 INFO L273 TraceCheckUtils]: 71: Hoare triple {2717#false} assume !!(~x~0 < ~n~0);~y~0 := ~x~0 + 1; {2717#false} is VALID [2018-11-14 16:53:50,591 INFO L273 TraceCheckUtils]: 72: Hoare triple {2717#false} assume true; {2717#false} is VALID [2018-11-14 16:53:50,591 INFO L273 TraceCheckUtils]: 73: Hoare triple {2717#false} assume !!(~y~0 < ~n~0);call #t~mem13 := read~int(~#set~0.base, ~#set~0.offset + ~x~0 * 4, 4);call #t~mem14 := read~int(~#set~0.base, ~#set~0.offset + ~y~0 * 4, 4); {2717#false} is VALID [2018-11-14 16:53:50,591 INFO L256 TraceCheckUtils]: 74: Hoare triple {2717#false} call __VERIFIER_assert((if #t~mem13 != #t~mem14 then 1 else 0)); {2717#false} is VALID [2018-11-14 16:53:50,592 INFO L273 TraceCheckUtils]: 75: Hoare triple {2717#false} ~cond := #in~cond; {2717#false} is VALID [2018-11-14 16:53:50,592 INFO L273 TraceCheckUtils]: 76: Hoare triple {2717#false} assume ~cond == 0; {2717#false} is VALID [2018-11-14 16:53:50,592 INFO L273 TraceCheckUtils]: 77: Hoare triple {2717#false} assume !false; {2717#false} is VALID [2018-11-14 16:53:50,597 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 0 proven. 46 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2018-11-14 16:53:50,620 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 16:53:50,621 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 8 [2018-11-14 16:53:50,621 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 78 [2018-11-14 16:53:50,621 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 16:53:50,622 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states. [2018-11-14 16:53:50,708 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 74 edges. 74 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 16:53:50,708 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-14 16:53:50,708 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-14 16:53:50,708 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2018-11-14 16:53:50,709 INFO L87 Difference]: Start difference. First operand 111 states and 142 transitions. Second operand 8 states. [2018-11-14 16:53:51,205 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:53:51,206 INFO L93 Difference]: Finished difference Result 188 states and 247 transitions. [2018-11-14 16:53:51,206 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-14 16:53:51,206 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 78 [2018-11-14 16:53:51,206 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 16:53:51,207 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-11-14 16:53:51,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 120 transitions. [2018-11-14 16:53:51,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-11-14 16:53:51,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 120 transitions. [2018-11-14 16:53:51,213 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 120 transitions. [2018-11-14 16:53:51,385 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 120 edges. 120 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 16:53:51,391 INFO L225 Difference]: With dead ends: 188 [2018-11-14 16:53:51,391 INFO L226 Difference]: Without dead ends: 173 [2018-11-14 16:53:51,392 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 78 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2018-11-14 16:53:51,392 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 173 states. [2018-11-14 16:53:51,499 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 173 to 137. [2018-11-14 16:53:51,499 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 16:53:51,499 INFO L82 GeneralOperation]: Start isEquivalent. First operand 173 states. Second operand 137 states. [2018-11-14 16:53:51,499 INFO L74 IsIncluded]: Start isIncluded. First operand 173 states. Second operand 137 states. [2018-11-14 16:53:51,499 INFO L87 Difference]: Start difference. First operand 173 states. Second operand 137 states. [2018-11-14 16:53:51,509 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:53:51,510 INFO L93 Difference]: Finished difference Result 173 states and 230 transitions. [2018-11-14 16:53:51,510 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 230 transitions. [2018-11-14 16:53:51,511 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:53:51,511 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:53:51,511 INFO L74 IsIncluded]: Start isIncluded. First operand 137 states. Second operand 173 states. [2018-11-14 16:53:51,511 INFO L87 Difference]: Start difference. First operand 137 states. Second operand 173 states. [2018-11-14 16:53:51,520 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:53:51,520 INFO L93 Difference]: Finished difference Result 173 states and 230 transitions. [2018-11-14 16:53:51,521 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 230 transitions. [2018-11-14 16:53:51,522 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:53:51,522 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:53:51,522 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 16:53:51,522 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 16:53:51,522 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 137 states. [2018-11-14 16:53:51,528 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 179 transitions. [2018-11-14 16:53:51,528 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 179 transitions. Word has length 78 [2018-11-14 16:53:51,529 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 16:53:51,529 INFO L480 AbstractCegarLoop]: Abstraction has 137 states and 179 transitions. [2018-11-14 16:53:51,529 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-14 16:53:51,529 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 179 transitions. [2018-11-14 16:53:51,530 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2018-11-14 16:53:51,531 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 16:53:51,531 INFO L375 BasicCegarLoop]: trace histogram [6, 5, 5, 5, 5, 5, 5, 5, 5, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 16:53:51,531 INFO L423 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 16:53:51,531 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 16:53:51,531 INFO L82 PathProgramCache]: Analyzing trace with hash 1956572023, now seen corresponding path program 4 times [2018-11-14 16:53:51,532 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 16:53:51,532 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 16:53:51,532 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 16:53:51,533 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-14 16:53:51,533 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 16:53:51,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:53:51,772 INFO L256 TraceCheckUtils]: 0: Hoare triple {3728#true} call ULTIMATE.init(); {3728#true} is VALID [2018-11-14 16:53:51,773 INFO L273 TraceCheckUtils]: 1: Hoare triple {3728#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {3728#true} is VALID [2018-11-14 16:53:51,773 INFO L273 TraceCheckUtils]: 2: Hoare triple {3728#true} assume true; {3728#true} is VALID [2018-11-14 16:53:51,773 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {3728#true} {3728#true} #126#return; {3728#true} is VALID [2018-11-14 16:53:51,774 INFO L256 TraceCheckUtils]: 4: Hoare triple {3728#true} call #t~ret15 := main(); {3728#true} is VALID [2018-11-14 16:53:51,774 INFO L273 TraceCheckUtils]: 5: Hoare triple {3728#true} ~n~0 := 0;call ~#set~0.base, ~#set~0.offset := #Ultimate.alloc(400000);havoc ~x~0;havoc ~y~0;~x~0 := 0; {3728#true} is VALID [2018-11-14 16:53:51,774 INFO L273 TraceCheckUtils]: 6: Hoare triple {3728#true} assume true; {3728#true} is VALID [2018-11-14 16:53:51,774 INFO L273 TraceCheckUtils]: 7: Hoare triple {3728#true} assume !(~x~0 < ~n~0); {3728#true} is VALID [2018-11-14 16:53:51,789 INFO L273 TraceCheckUtils]: 8: Hoare triple {3728#true} call ~#values~0.base, ~#values~0.offset := #Ultimate.alloc(400000);havoc ~v~0;~v~0 := 0; {3730#(= main_~v~0 0)} is VALID [2018-11-14 16:53:51,798 INFO L273 TraceCheckUtils]: 9: Hoare triple {3730#(= main_~v~0 0)} assume true; {3730#(= main_~v~0 0)} is VALID [2018-11-14 16:53:51,811 INFO L273 TraceCheckUtils]: 10: Hoare triple {3730#(= main_~v~0 0)} assume !!(~v~0 < 100000);call #t~mem7 := read~int(~#values~0.base, ~#values~0.offset + ~v~0 * 4, 4); {3730#(= main_~v~0 0)} is VALID [2018-11-14 16:53:51,811 INFO L256 TraceCheckUtils]: 11: Hoare triple {3730#(= main_~v~0 0)} call #t~ret8 := elem_exists(~#set~0.base, ~#set~0.offset, ~n~0, #t~mem7); {3728#true} is VALID [2018-11-14 16:53:51,811 INFO L273 TraceCheckUtils]: 12: Hoare triple {3728#true} ~set.base, ~set.offset := #in~set.base, #in~set.offset;~size := #in~size;~value := #in~value;havoc ~i~0;~i~0 := 0; {3728#true} is VALID [2018-11-14 16:53:51,812 INFO L273 TraceCheckUtils]: 13: Hoare triple {3728#true} assume true; {3728#true} is VALID [2018-11-14 16:53:51,812 INFO L273 TraceCheckUtils]: 14: Hoare triple {3728#true} assume !(~i~0 < ~size); {3728#true} is VALID [2018-11-14 16:53:51,812 INFO L273 TraceCheckUtils]: 15: Hoare triple {3728#true} #res := 0; {3728#true} is VALID [2018-11-14 16:53:51,812 INFO L273 TraceCheckUtils]: 16: Hoare triple {3728#true} assume true; {3728#true} is VALID [2018-11-14 16:53:51,829 INFO L268 TraceCheckUtils]: 17: Hoare quadruple {3728#true} {3730#(= main_~v~0 0)} #132#return; {3730#(= main_~v~0 0)} is VALID [2018-11-14 16:53:51,836 INFO L273 TraceCheckUtils]: 18: Hoare triple {3730#(= main_~v~0 0)} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647; {3730#(= main_~v~0 0)} is VALID [2018-11-14 16:53:51,836 INFO L273 TraceCheckUtils]: 19: Hoare triple {3730#(= main_~v~0 0)} assume #t~ret8 == 0;havoc #t~mem7;havoc #t~ret8;call #t~mem9 := read~int(~#values~0.base, ~#values~0.offset + ~v~0 * 4, 4); {3730#(= main_~v~0 0)} is VALID [2018-11-14 16:53:51,837 INFO L256 TraceCheckUtils]: 20: Hoare triple {3730#(= main_~v~0 0)} call #t~ret10 := insert(~#set~0.base, ~#set~0.offset, ~n~0, #t~mem9); {3728#true} is VALID [2018-11-14 16:53:51,837 INFO L273 TraceCheckUtils]: 21: Hoare triple {3728#true} ~set.base, ~set.offset := #in~set.base, #in~set.offset;~size := #in~size;~value := #in~value;call write~int(~value, ~set.base, ~set.offset + ~size * 4, 4);#res := ~size + 1; {3728#true} is VALID [2018-11-14 16:53:51,837 INFO L273 TraceCheckUtils]: 22: Hoare triple {3728#true} assume true; {3728#true} is VALID [2018-11-14 16:53:51,838 INFO L268 TraceCheckUtils]: 23: Hoare quadruple {3728#true} {3730#(= main_~v~0 0)} #134#return; {3730#(= main_~v~0 0)} is VALID [2018-11-14 16:53:51,838 INFO L273 TraceCheckUtils]: 24: Hoare triple {3730#(= main_~v~0 0)} assume -2147483648 <= #t~ret10 && #t~ret10 <= 2147483647;~n~0 := #t~ret10;havoc #t~ret10;havoc #t~mem9; {3730#(= main_~v~0 0)} is VALID [2018-11-14 16:53:51,839 INFO L273 TraceCheckUtils]: 25: Hoare triple {3730#(= main_~v~0 0)} #t~post6 := ~v~0;~v~0 := #t~post6 + 1;havoc #t~post6; {3731#(<= main_~v~0 1)} is VALID [2018-11-14 16:53:51,839 INFO L273 TraceCheckUtils]: 26: Hoare triple {3731#(<= main_~v~0 1)} assume true; {3731#(<= main_~v~0 1)} is VALID [2018-11-14 16:53:51,839 INFO L273 TraceCheckUtils]: 27: Hoare triple {3731#(<= main_~v~0 1)} assume !!(~v~0 < 100000);call #t~mem7 := read~int(~#values~0.base, ~#values~0.offset + ~v~0 * 4, 4); {3731#(<= main_~v~0 1)} is VALID [2018-11-14 16:53:51,840 INFO L256 TraceCheckUtils]: 28: Hoare triple {3731#(<= main_~v~0 1)} call #t~ret8 := elem_exists(~#set~0.base, ~#set~0.offset, ~n~0, #t~mem7); {3728#true} is VALID [2018-11-14 16:53:51,840 INFO L273 TraceCheckUtils]: 29: Hoare triple {3728#true} ~set.base, ~set.offset := #in~set.base, #in~set.offset;~size := #in~size;~value := #in~value;havoc ~i~0;~i~0 := 0; {3728#true} is VALID [2018-11-14 16:53:51,840 INFO L273 TraceCheckUtils]: 30: Hoare triple {3728#true} assume true; {3728#true} is VALID [2018-11-14 16:53:51,840 INFO L273 TraceCheckUtils]: 31: Hoare triple {3728#true} assume !(~i~0 < ~size); {3728#true} is VALID [2018-11-14 16:53:51,840 INFO L273 TraceCheckUtils]: 32: Hoare triple {3728#true} #res := 0; {3728#true} is VALID [2018-11-14 16:53:51,840 INFO L273 TraceCheckUtils]: 33: Hoare triple {3728#true} assume true; {3728#true} is VALID [2018-11-14 16:53:51,842 INFO L268 TraceCheckUtils]: 34: Hoare quadruple {3728#true} {3731#(<= main_~v~0 1)} #132#return; {3731#(<= main_~v~0 1)} is VALID [2018-11-14 16:53:51,842 INFO L273 TraceCheckUtils]: 35: Hoare triple {3731#(<= main_~v~0 1)} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647; {3731#(<= main_~v~0 1)} is VALID [2018-11-14 16:53:51,843 INFO L273 TraceCheckUtils]: 36: Hoare triple {3731#(<= main_~v~0 1)} assume #t~ret8 == 0;havoc #t~mem7;havoc #t~ret8;call #t~mem9 := read~int(~#values~0.base, ~#values~0.offset + ~v~0 * 4, 4); {3731#(<= main_~v~0 1)} is VALID [2018-11-14 16:53:51,843 INFO L256 TraceCheckUtils]: 37: Hoare triple {3731#(<= main_~v~0 1)} call #t~ret10 := insert(~#set~0.base, ~#set~0.offset, ~n~0, #t~mem9); {3728#true} is VALID [2018-11-14 16:53:51,843 INFO L273 TraceCheckUtils]: 38: Hoare triple {3728#true} ~set.base, ~set.offset := #in~set.base, #in~set.offset;~size := #in~size;~value := #in~value;call write~int(~value, ~set.base, ~set.offset + ~size * 4, 4);#res := ~size + 1; {3728#true} is VALID [2018-11-14 16:53:51,843 INFO L273 TraceCheckUtils]: 39: Hoare triple {3728#true} assume true; {3728#true} is VALID [2018-11-14 16:53:51,844 INFO L268 TraceCheckUtils]: 40: Hoare quadruple {3728#true} {3731#(<= main_~v~0 1)} #134#return; {3731#(<= main_~v~0 1)} is VALID [2018-11-14 16:53:51,844 INFO L273 TraceCheckUtils]: 41: Hoare triple {3731#(<= main_~v~0 1)} assume -2147483648 <= #t~ret10 && #t~ret10 <= 2147483647;~n~0 := #t~ret10;havoc #t~ret10;havoc #t~mem9; {3731#(<= main_~v~0 1)} is VALID [2018-11-14 16:53:51,845 INFO L273 TraceCheckUtils]: 42: Hoare triple {3731#(<= main_~v~0 1)} #t~post6 := ~v~0;~v~0 := #t~post6 + 1;havoc #t~post6; {3732#(<= main_~v~0 2)} is VALID [2018-11-14 16:53:51,845 INFO L273 TraceCheckUtils]: 43: Hoare triple {3732#(<= main_~v~0 2)} assume true; {3732#(<= main_~v~0 2)} is VALID [2018-11-14 16:53:51,846 INFO L273 TraceCheckUtils]: 44: Hoare triple {3732#(<= main_~v~0 2)} assume !!(~v~0 < 100000);call #t~mem7 := read~int(~#values~0.base, ~#values~0.offset + ~v~0 * 4, 4); {3732#(<= main_~v~0 2)} is VALID [2018-11-14 16:53:51,846 INFO L256 TraceCheckUtils]: 45: Hoare triple {3732#(<= main_~v~0 2)} call #t~ret8 := elem_exists(~#set~0.base, ~#set~0.offset, ~n~0, #t~mem7); {3728#true} is VALID [2018-11-14 16:53:51,846 INFO L273 TraceCheckUtils]: 46: Hoare triple {3728#true} ~set.base, ~set.offset := #in~set.base, #in~set.offset;~size := #in~size;~value := #in~value;havoc ~i~0;~i~0 := 0; {3728#true} is VALID [2018-11-14 16:53:51,847 INFO L273 TraceCheckUtils]: 47: Hoare triple {3728#true} assume true; {3728#true} is VALID [2018-11-14 16:53:51,847 INFO L273 TraceCheckUtils]: 48: Hoare triple {3728#true} assume !!(~i~0 < ~size);call #t~mem1 := read~int(~set.base, ~set.offset + ~i~0 * 4, 4); {3728#true} is VALID [2018-11-14 16:53:51,847 INFO L273 TraceCheckUtils]: 49: Hoare triple {3728#true} assume #t~mem1 == ~value;havoc #t~mem1;#res := 1; {3728#true} is VALID [2018-11-14 16:53:51,847 INFO L273 TraceCheckUtils]: 50: Hoare triple {3728#true} assume true; {3728#true} is VALID [2018-11-14 16:53:51,849 INFO L268 TraceCheckUtils]: 51: Hoare quadruple {3728#true} {3732#(<= main_~v~0 2)} #132#return; {3732#(<= main_~v~0 2)} is VALID [2018-11-14 16:53:51,849 INFO L273 TraceCheckUtils]: 52: Hoare triple {3732#(<= main_~v~0 2)} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647; {3732#(<= main_~v~0 2)} is VALID [2018-11-14 16:53:51,850 INFO L273 TraceCheckUtils]: 53: Hoare triple {3732#(<= main_~v~0 2)} assume !(#t~ret8 == 0);havoc #t~mem7;havoc #t~ret8; {3732#(<= main_~v~0 2)} is VALID [2018-11-14 16:53:51,850 INFO L273 TraceCheckUtils]: 54: Hoare triple {3732#(<= main_~v~0 2)} #t~post6 := ~v~0;~v~0 := #t~post6 + 1;havoc #t~post6; {3733#(<= main_~v~0 3)} is VALID [2018-11-14 16:53:51,851 INFO L273 TraceCheckUtils]: 55: Hoare triple {3733#(<= main_~v~0 3)} assume true; {3733#(<= main_~v~0 3)} is VALID [2018-11-14 16:53:51,851 INFO L273 TraceCheckUtils]: 56: Hoare triple {3733#(<= main_~v~0 3)} assume !!(~v~0 < 100000);call #t~mem7 := read~int(~#values~0.base, ~#values~0.offset + ~v~0 * 4, 4); {3733#(<= main_~v~0 3)} is VALID [2018-11-14 16:53:51,851 INFO L256 TraceCheckUtils]: 57: Hoare triple {3733#(<= main_~v~0 3)} call #t~ret8 := elem_exists(~#set~0.base, ~#set~0.offset, ~n~0, #t~mem7); {3728#true} is VALID [2018-11-14 16:53:51,851 INFO L273 TraceCheckUtils]: 58: Hoare triple {3728#true} ~set.base, ~set.offset := #in~set.base, #in~set.offset;~size := #in~size;~value := #in~value;havoc ~i~0;~i~0 := 0; {3728#true} is VALID [2018-11-14 16:53:51,851 INFO L273 TraceCheckUtils]: 59: Hoare triple {3728#true} assume true; {3728#true} is VALID [2018-11-14 16:53:51,851 INFO L273 TraceCheckUtils]: 60: Hoare triple {3728#true} assume !!(~i~0 < ~size);call #t~mem1 := read~int(~set.base, ~set.offset + ~i~0 * 4, 4); {3728#true} is VALID [2018-11-14 16:53:51,852 INFO L273 TraceCheckUtils]: 61: Hoare triple {3728#true} assume #t~mem1 == ~value;havoc #t~mem1;#res := 1; {3728#true} is VALID [2018-11-14 16:53:51,852 INFO L273 TraceCheckUtils]: 62: Hoare triple {3728#true} assume true; {3728#true} is VALID [2018-11-14 16:53:51,853 INFO L268 TraceCheckUtils]: 63: Hoare quadruple {3728#true} {3733#(<= main_~v~0 3)} #132#return; {3733#(<= main_~v~0 3)} is VALID [2018-11-14 16:53:51,859 INFO L273 TraceCheckUtils]: 64: Hoare triple {3733#(<= main_~v~0 3)} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647; {3733#(<= main_~v~0 3)} is VALID [2018-11-14 16:53:51,859 INFO L273 TraceCheckUtils]: 65: Hoare triple {3733#(<= main_~v~0 3)} assume !(#t~ret8 == 0);havoc #t~mem7;havoc #t~ret8; {3733#(<= main_~v~0 3)} is VALID [2018-11-14 16:53:51,860 INFO L273 TraceCheckUtils]: 66: Hoare triple {3733#(<= main_~v~0 3)} #t~post6 := ~v~0;~v~0 := #t~post6 + 1;havoc #t~post6; {3734#(<= main_~v~0 4)} is VALID [2018-11-14 16:53:51,860 INFO L273 TraceCheckUtils]: 67: Hoare triple {3734#(<= main_~v~0 4)} assume true; {3734#(<= main_~v~0 4)} is VALID [2018-11-14 16:53:51,860 INFO L273 TraceCheckUtils]: 68: Hoare triple {3734#(<= main_~v~0 4)} assume !!(~v~0 < 100000);call #t~mem7 := read~int(~#values~0.base, ~#values~0.offset + ~v~0 * 4, 4); {3734#(<= main_~v~0 4)} is VALID [2018-11-14 16:53:51,860 INFO L256 TraceCheckUtils]: 69: Hoare triple {3734#(<= main_~v~0 4)} call #t~ret8 := elem_exists(~#set~0.base, ~#set~0.offset, ~n~0, #t~mem7); {3728#true} is VALID [2018-11-14 16:53:51,861 INFO L273 TraceCheckUtils]: 70: Hoare triple {3728#true} ~set.base, ~set.offset := #in~set.base, #in~set.offset;~size := #in~size;~value := #in~value;havoc ~i~0;~i~0 := 0; {3728#true} is VALID [2018-11-14 16:53:51,861 INFO L273 TraceCheckUtils]: 71: Hoare triple {3728#true} assume true; {3728#true} is VALID [2018-11-14 16:53:51,861 INFO L273 TraceCheckUtils]: 72: Hoare triple {3728#true} assume !!(~i~0 < ~size);call #t~mem1 := read~int(~set.base, ~set.offset + ~i~0 * 4, 4); {3728#true} is VALID [2018-11-14 16:53:51,861 INFO L273 TraceCheckUtils]: 73: Hoare triple {3728#true} assume #t~mem1 == ~value;havoc #t~mem1;#res := 1; {3728#true} is VALID [2018-11-14 16:53:51,861 INFO L273 TraceCheckUtils]: 74: Hoare triple {3728#true} assume true; {3728#true} is VALID [2018-11-14 16:53:51,862 INFO L268 TraceCheckUtils]: 75: Hoare quadruple {3728#true} {3734#(<= main_~v~0 4)} #132#return; {3734#(<= main_~v~0 4)} is VALID [2018-11-14 16:53:51,862 INFO L273 TraceCheckUtils]: 76: Hoare triple {3734#(<= main_~v~0 4)} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647; {3734#(<= main_~v~0 4)} is VALID [2018-11-14 16:53:51,863 INFO L273 TraceCheckUtils]: 77: Hoare triple {3734#(<= main_~v~0 4)} assume !(#t~ret8 == 0);havoc #t~mem7;havoc #t~ret8; {3734#(<= main_~v~0 4)} is VALID [2018-11-14 16:53:51,863 INFO L273 TraceCheckUtils]: 78: Hoare triple {3734#(<= main_~v~0 4)} #t~post6 := ~v~0;~v~0 := #t~post6 + 1;havoc #t~post6; {3735#(<= main_~v~0 5)} is VALID [2018-11-14 16:53:51,864 INFO L273 TraceCheckUtils]: 79: Hoare triple {3735#(<= main_~v~0 5)} assume true; {3735#(<= main_~v~0 5)} is VALID [2018-11-14 16:53:51,864 INFO L273 TraceCheckUtils]: 80: Hoare triple {3735#(<= main_~v~0 5)} assume !(~v~0 < 100000); {3729#false} is VALID [2018-11-14 16:53:51,864 INFO L273 TraceCheckUtils]: 81: Hoare triple {3729#false} ~x~0 := 0; {3729#false} is VALID [2018-11-14 16:53:51,864 INFO L273 TraceCheckUtils]: 82: Hoare triple {3729#false} assume true; {3729#false} is VALID [2018-11-14 16:53:51,864 INFO L273 TraceCheckUtils]: 83: Hoare triple {3729#false} assume !!(~x~0 < ~n~0);~y~0 := ~x~0 + 1; {3729#false} is VALID [2018-11-14 16:53:51,864 INFO L273 TraceCheckUtils]: 84: Hoare triple {3729#false} assume true; {3729#false} is VALID [2018-11-14 16:53:51,865 INFO L273 TraceCheckUtils]: 85: Hoare triple {3729#false} assume !!(~y~0 < ~n~0);call #t~mem13 := read~int(~#set~0.base, ~#set~0.offset + ~x~0 * 4, 4);call #t~mem14 := read~int(~#set~0.base, ~#set~0.offset + ~y~0 * 4, 4); {3729#false} is VALID [2018-11-14 16:53:51,865 INFO L256 TraceCheckUtils]: 86: Hoare triple {3729#false} call __VERIFIER_assert((if #t~mem13 != #t~mem14 then 1 else 0)); {3729#false} is VALID [2018-11-14 16:53:51,865 INFO L273 TraceCheckUtils]: 87: Hoare triple {3729#false} ~cond := #in~cond; {3729#false} is VALID [2018-11-14 16:53:51,865 INFO L273 TraceCheckUtils]: 88: Hoare triple {3729#false} assume ~cond == 0; {3729#false} is VALID [2018-11-14 16:53:51,865 INFO L273 TraceCheckUtils]: 89: Hoare triple {3729#false} assume !false; {3729#false} is VALID [2018-11-14 16:53:51,870 INFO L134 CoverageAnalysis]: Checked inductivity of 129 backedges. 0 proven. 72 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2018-11-14 16:53:51,870 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-14 16:53:51,871 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-14 16:53:51,879 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-14 16:53:51,943 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-14 16:53:51,943 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-14 16:53:51,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:53:51,987 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 16:53:52,524 INFO L256 TraceCheckUtils]: 0: Hoare triple {3728#true} call ULTIMATE.init(); {3728#true} is VALID [2018-11-14 16:53:52,525 INFO L273 TraceCheckUtils]: 1: Hoare triple {3728#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {3728#true} is VALID [2018-11-14 16:53:52,525 INFO L273 TraceCheckUtils]: 2: Hoare triple {3728#true} assume true; {3728#true} is VALID [2018-11-14 16:53:52,525 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {3728#true} {3728#true} #126#return; {3728#true} is VALID [2018-11-14 16:53:52,525 INFO L256 TraceCheckUtils]: 4: Hoare triple {3728#true} call #t~ret15 := main(); {3728#true} is VALID [2018-11-14 16:53:52,526 INFO L273 TraceCheckUtils]: 5: Hoare triple {3728#true} ~n~0 := 0;call ~#set~0.base, ~#set~0.offset := #Ultimate.alloc(400000);havoc ~x~0;havoc ~y~0;~x~0 := 0; {3728#true} is VALID [2018-11-14 16:53:52,526 INFO L273 TraceCheckUtils]: 6: Hoare triple {3728#true} assume true; {3728#true} is VALID [2018-11-14 16:53:52,526 INFO L273 TraceCheckUtils]: 7: Hoare triple {3728#true} assume !(~x~0 < ~n~0); {3728#true} is VALID [2018-11-14 16:53:52,527 INFO L273 TraceCheckUtils]: 8: Hoare triple {3728#true} call ~#values~0.base, ~#values~0.offset := #Ultimate.alloc(400000);havoc ~v~0;~v~0 := 0; {3763#(<= main_~v~0 0)} is VALID [2018-11-14 16:53:52,527 INFO L273 TraceCheckUtils]: 9: Hoare triple {3763#(<= main_~v~0 0)} assume true; {3763#(<= main_~v~0 0)} is VALID [2018-11-14 16:53:52,528 INFO L273 TraceCheckUtils]: 10: Hoare triple {3763#(<= main_~v~0 0)} assume !!(~v~0 < 100000);call #t~mem7 := read~int(~#values~0.base, ~#values~0.offset + ~v~0 * 4, 4); {3763#(<= main_~v~0 0)} is VALID [2018-11-14 16:53:52,528 INFO L256 TraceCheckUtils]: 11: Hoare triple {3763#(<= main_~v~0 0)} call #t~ret8 := elem_exists(~#set~0.base, ~#set~0.offset, ~n~0, #t~mem7); {3728#true} is VALID [2018-11-14 16:53:52,528 INFO L273 TraceCheckUtils]: 12: Hoare triple {3728#true} ~set.base, ~set.offset := #in~set.base, #in~set.offset;~size := #in~size;~value := #in~value;havoc ~i~0;~i~0 := 0; {3728#true} is VALID [2018-11-14 16:53:52,528 INFO L273 TraceCheckUtils]: 13: Hoare triple {3728#true} assume true; {3728#true} is VALID [2018-11-14 16:53:52,528 INFO L273 TraceCheckUtils]: 14: Hoare triple {3728#true} assume !(~i~0 < ~size); {3728#true} is VALID [2018-11-14 16:53:52,528 INFO L273 TraceCheckUtils]: 15: Hoare triple {3728#true} #res := 0; {3728#true} is VALID [2018-11-14 16:53:52,528 INFO L273 TraceCheckUtils]: 16: Hoare triple {3728#true} assume true; {3728#true} is VALID [2018-11-14 16:53:52,530 INFO L268 TraceCheckUtils]: 17: Hoare quadruple {3728#true} {3763#(<= main_~v~0 0)} #132#return; {3763#(<= main_~v~0 0)} is VALID [2018-11-14 16:53:52,530 INFO L273 TraceCheckUtils]: 18: Hoare triple {3763#(<= main_~v~0 0)} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647; {3763#(<= main_~v~0 0)} is VALID [2018-11-14 16:53:52,530 INFO L273 TraceCheckUtils]: 19: Hoare triple {3763#(<= main_~v~0 0)} assume #t~ret8 == 0;havoc #t~mem7;havoc #t~ret8;call #t~mem9 := read~int(~#values~0.base, ~#values~0.offset + ~v~0 * 4, 4); {3763#(<= main_~v~0 0)} is VALID [2018-11-14 16:53:52,530 INFO L256 TraceCheckUtils]: 20: Hoare triple {3763#(<= main_~v~0 0)} call #t~ret10 := insert(~#set~0.base, ~#set~0.offset, ~n~0, #t~mem9); {3728#true} is VALID [2018-11-14 16:53:52,531 INFO L273 TraceCheckUtils]: 21: Hoare triple {3728#true} ~set.base, ~set.offset := #in~set.base, #in~set.offset;~size := #in~size;~value := #in~value;call write~int(~value, ~set.base, ~set.offset + ~size * 4, 4);#res := ~size + 1; {3728#true} is VALID [2018-11-14 16:53:52,531 INFO L273 TraceCheckUtils]: 22: Hoare triple {3728#true} assume true; {3728#true} is VALID [2018-11-14 16:53:52,532 INFO L268 TraceCheckUtils]: 23: Hoare quadruple {3728#true} {3763#(<= main_~v~0 0)} #134#return; {3763#(<= main_~v~0 0)} is VALID [2018-11-14 16:53:52,533 INFO L273 TraceCheckUtils]: 24: Hoare triple {3763#(<= main_~v~0 0)} assume -2147483648 <= #t~ret10 && #t~ret10 <= 2147483647;~n~0 := #t~ret10;havoc #t~ret10;havoc #t~mem9; {3763#(<= main_~v~0 0)} is VALID [2018-11-14 16:53:52,544 INFO L273 TraceCheckUtils]: 25: Hoare triple {3763#(<= main_~v~0 0)} #t~post6 := ~v~0;~v~0 := #t~post6 + 1;havoc #t~post6; {3731#(<= main_~v~0 1)} is VALID [2018-11-14 16:53:52,544 INFO L273 TraceCheckUtils]: 26: Hoare triple {3731#(<= main_~v~0 1)} assume true; {3731#(<= main_~v~0 1)} is VALID [2018-11-14 16:53:52,545 INFO L273 TraceCheckUtils]: 27: Hoare triple {3731#(<= main_~v~0 1)} assume !!(~v~0 < 100000);call #t~mem7 := read~int(~#values~0.base, ~#values~0.offset + ~v~0 * 4, 4); {3731#(<= main_~v~0 1)} is VALID [2018-11-14 16:53:52,545 INFO L256 TraceCheckUtils]: 28: Hoare triple {3731#(<= main_~v~0 1)} call #t~ret8 := elem_exists(~#set~0.base, ~#set~0.offset, ~n~0, #t~mem7); {3728#true} is VALID [2018-11-14 16:53:52,545 INFO L273 TraceCheckUtils]: 29: Hoare triple {3728#true} ~set.base, ~set.offset := #in~set.base, #in~set.offset;~size := #in~size;~value := #in~value;havoc ~i~0;~i~0 := 0; {3728#true} is VALID [2018-11-14 16:53:52,545 INFO L273 TraceCheckUtils]: 30: Hoare triple {3728#true} assume true; {3728#true} is VALID [2018-11-14 16:53:52,545 INFO L273 TraceCheckUtils]: 31: Hoare triple {3728#true} assume !(~i~0 < ~size); {3728#true} is VALID [2018-11-14 16:53:52,545 INFO L273 TraceCheckUtils]: 32: Hoare triple {3728#true} #res := 0; {3728#true} is VALID [2018-11-14 16:53:52,546 INFO L273 TraceCheckUtils]: 33: Hoare triple {3728#true} assume true; {3728#true} is VALID [2018-11-14 16:53:52,547 INFO L268 TraceCheckUtils]: 34: Hoare quadruple {3728#true} {3731#(<= main_~v~0 1)} #132#return; {3731#(<= main_~v~0 1)} is VALID [2018-11-14 16:53:52,547 INFO L273 TraceCheckUtils]: 35: Hoare triple {3731#(<= main_~v~0 1)} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647; {3731#(<= main_~v~0 1)} is VALID [2018-11-14 16:53:52,547 INFO L273 TraceCheckUtils]: 36: Hoare triple {3731#(<= main_~v~0 1)} assume #t~ret8 == 0;havoc #t~mem7;havoc #t~ret8;call #t~mem9 := read~int(~#values~0.base, ~#values~0.offset + ~v~0 * 4, 4); {3731#(<= main_~v~0 1)} is VALID [2018-11-14 16:53:52,548 INFO L256 TraceCheckUtils]: 37: Hoare triple {3731#(<= main_~v~0 1)} call #t~ret10 := insert(~#set~0.base, ~#set~0.offset, ~n~0, #t~mem9); {3728#true} is VALID [2018-11-14 16:53:52,548 INFO L273 TraceCheckUtils]: 38: Hoare triple {3728#true} ~set.base, ~set.offset := #in~set.base, #in~set.offset;~size := #in~size;~value := #in~value;call write~int(~value, ~set.base, ~set.offset + ~size * 4, 4);#res := ~size + 1; {3728#true} is VALID [2018-11-14 16:53:52,548 INFO L273 TraceCheckUtils]: 39: Hoare triple {3728#true} assume true; {3728#true} is VALID [2018-11-14 16:53:52,549 INFO L268 TraceCheckUtils]: 40: Hoare quadruple {3728#true} {3731#(<= main_~v~0 1)} #134#return; {3731#(<= main_~v~0 1)} is VALID [2018-11-14 16:53:52,549 INFO L273 TraceCheckUtils]: 41: Hoare triple {3731#(<= main_~v~0 1)} assume -2147483648 <= #t~ret10 && #t~ret10 <= 2147483647;~n~0 := #t~ret10;havoc #t~ret10;havoc #t~mem9; {3731#(<= main_~v~0 1)} is VALID [2018-11-14 16:53:52,550 INFO L273 TraceCheckUtils]: 42: Hoare triple {3731#(<= main_~v~0 1)} #t~post6 := ~v~0;~v~0 := #t~post6 + 1;havoc #t~post6; {3732#(<= main_~v~0 2)} is VALID [2018-11-14 16:53:52,550 INFO L273 TraceCheckUtils]: 43: Hoare triple {3732#(<= main_~v~0 2)} assume true; {3732#(<= main_~v~0 2)} is VALID [2018-11-14 16:53:52,550 INFO L273 TraceCheckUtils]: 44: Hoare triple {3732#(<= main_~v~0 2)} assume !!(~v~0 < 100000);call #t~mem7 := read~int(~#values~0.base, ~#values~0.offset + ~v~0 * 4, 4); {3732#(<= main_~v~0 2)} is VALID [2018-11-14 16:53:52,551 INFO L256 TraceCheckUtils]: 45: Hoare triple {3732#(<= main_~v~0 2)} call #t~ret8 := elem_exists(~#set~0.base, ~#set~0.offset, ~n~0, #t~mem7); {3728#true} is VALID [2018-11-14 16:53:52,551 INFO L273 TraceCheckUtils]: 46: Hoare triple {3728#true} ~set.base, ~set.offset := #in~set.base, #in~set.offset;~size := #in~size;~value := #in~value;havoc ~i~0;~i~0 := 0; {3728#true} is VALID [2018-11-14 16:53:52,551 INFO L273 TraceCheckUtils]: 47: Hoare triple {3728#true} assume true; {3728#true} is VALID [2018-11-14 16:53:52,551 INFO L273 TraceCheckUtils]: 48: Hoare triple {3728#true} assume !!(~i~0 < ~size);call #t~mem1 := read~int(~set.base, ~set.offset + ~i~0 * 4, 4); {3728#true} is VALID [2018-11-14 16:53:52,552 INFO L273 TraceCheckUtils]: 49: Hoare triple {3728#true} assume #t~mem1 == ~value;havoc #t~mem1;#res := 1; {3728#true} is VALID [2018-11-14 16:53:52,552 INFO L273 TraceCheckUtils]: 50: Hoare triple {3728#true} assume true; {3728#true} is VALID [2018-11-14 16:53:52,553 INFO L268 TraceCheckUtils]: 51: Hoare quadruple {3728#true} {3732#(<= main_~v~0 2)} #132#return; {3732#(<= main_~v~0 2)} is VALID [2018-11-14 16:53:52,571 INFO L273 TraceCheckUtils]: 52: Hoare triple {3732#(<= main_~v~0 2)} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647; {3732#(<= main_~v~0 2)} is VALID [2018-11-14 16:53:52,576 INFO L273 TraceCheckUtils]: 53: Hoare triple {3732#(<= main_~v~0 2)} assume !(#t~ret8 == 0);havoc #t~mem7;havoc #t~ret8; {3732#(<= main_~v~0 2)} is VALID [2018-11-14 16:53:52,576 INFO L273 TraceCheckUtils]: 54: Hoare triple {3732#(<= main_~v~0 2)} #t~post6 := ~v~0;~v~0 := #t~post6 + 1;havoc #t~post6; {3733#(<= main_~v~0 3)} is VALID [2018-11-14 16:53:52,577 INFO L273 TraceCheckUtils]: 55: Hoare triple {3733#(<= main_~v~0 3)} assume true; {3733#(<= main_~v~0 3)} is VALID [2018-11-14 16:53:52,577 INFO L273 TraceCheckUtils]: 56: Hoare triple {3733#(<= main_~v~0 3)} assume !!(~v~0 < 100000);call #t~mem7 := read~int(~#values~0.base, ~#values~0.offset + ~v~0 * 4, 4); {3733#(<= main_~v~0 3)} is VALID [2018-11-14 16:53:52,577 INFO L256 TraceCheckUtils]: 57: Hoare triple {3733#(<= main_~v~0 3)} call #t~ret8 := elem_exists(~#set~0.base, ~#set~0.offset, ~n~0, #t~mem7); {3728#true} is VALID [2018-11-14 16:53:52,577 INFO L273 TraceCheckUtils]: 58: Hoare triple {3728#true} ~set.base, ~set.offset := #in~set.base, #in~set.offset;~size := #in~size;~value := #in~value;havoc ~i~0;~i~0 := 0; {3728#true} is VALID [2018-11-14 16:53:52,577 INFO L273 TraceCheckUtils]: 59: Hoare triple {3728#true} assume true; {3728#true} is VALID [2018-11-14 16:53:52,578 INFO L273 TraceCheckUtils]: 60: Hoare triple {3728#true} assume !!(~i~0 < ~size);call #t~mem1 := read~int(~set.base, ~set.offset + ~i~0 * 4, 4); {3728#true} is VALID [2018-11-14 16:53:52,578 INFO L273 TraceCheckUtils]: 61: Hoare triple {3728#true} assume #t~mem1 == ~value;havoc #t~mem1;#res := 1; {3728#true} is VALID [2018-11-14 16:53:52,578 INFO L273 TraceCheckUtils]: 62: Hoare triple {3728#true} assume true; {3728#true} is VALID [2018-11-14 16:53:52,579 INFO L268 TraceCheckUtils]: 63: Hoare quadruple {3728#true} {3733#(<= main_~v~0 3)} #132#return; {3733#(<= main_~v~0 3)} is VALID [2018-11-14 16:53:52,579 INFO L273 TraceCheckUtils]: 64: Hoare triple {3733#(<= main_~v~0 3)} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647; {3733#(<= main_~v~0 3)} is VALID [2018-11-14 16:53:52,580 INFO L273 TraceCheckUtils]: 65: Hoare triple {3733#(<= main_~v~0 3)} assume !(#t~ret8 == 0);havoc #t~mem7;havoc #t~ret8; {3733#(<= main_~v~0 3)} is VALID [2018-11-14 16:53:52,580 INFO L273 TraceCheckUtils]: 66: Hoare triple {3733#(<= main_~v~0 3)} #t~post6 := ~v~0;~v~0 := #t~post6 + 1;havoc #t~post6; {3734#(<= main_~v~0 4)} is VALID [2018-11-14 16:53:52,580 INFO L273 TraceCheckUtils]: 67: Hoare triple {3734#(<= main_~v~0 4)} assume true; {3734#(<= main_~v~0 4)} is VALID [2018-11-14 16:53:52,581 INFO L273 TraceCheckUtils]: 68: Hoare triple {3734#(<= main_~v~0 4)} assume !!(~v~0 < 100000);call #t~mem7 := read~int(~#values~0.base, ~#values~0.offset + ~v~0 * 4, 4); {3734#(<= main_~v~0 4)} is VALID [2018-11-14 16:53:52,581 INFO L256 TraceCheckUtils]: 69: Hoare triple {3734#(<= main_~v~0 4)} call #t~ret8 := elem_exists(~#set~0.base, ~#set~0.offset, ~n~0, #t~mem7); {3728#true} is VALID [2018-11-14 16:53:52,581 INFO L273 TraceCheckUtils]: 70: Hoare triple {3728#true} ~set.base, ~set.offset := #in~set.base, #in~set.offset;~size := #in~size;~value := #in~value;havoc ~i~0;~i~0 := 0; {3728#true} is VALID [2018-11-14 16:53:52,581 INFO L273 TraceCheckUtils]: 71: Hoare triple {3728#true} assume true; {3728#true} is VALID [2018-11-14 16:53:52,581 INFO L273 TraceCheckUtils]: 72: Hoare triple {3728#true} assume !!(~i~0 < ~size);call #t~mem1 := read~int(~set.base, ~set.offset + ~i~0 * 4, 4); {3728#true} is VALID [2018-11-14 16:53:52,581 INFO L273 TraceCheckUtils]: 73: Hoare triple {3728#true} assume #t~mem1 == ~value;havoc #t~mem1;#res := 1; {3728#true} is VALID [2018-11-14 16:53:52,582 INFO L273 TraceCheckUtils]: 74: Hoare triple {3728#true} assume true; {3728#true} is VALID [2018-11-14 16:53:52,583 INFO L268 TraceCheckUtils]: 75: Hoare quadruple {3728#true} {3734#(<= main_~v~0 4)} #132#return; {3734#(<= main_~v~0 4)} is VALID [2018-11-14 16:53:52,584 INFO L273 TraceCheckUtils]: 76: Hoare triple {3734#(<= main_~v~0 4)} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647; {3734#(<= main_~v~0 4)} is VALID [2018-11-14 16:53:52,584 INFO L273 TraceCheckUtils]: 77: Hoare triple {3734#(<= main_~v~0 4)} assume !(#t~ret8 == 0);havoc #t~mem7;havoc #t~ret8; {3734#(<= main_~v~0 4)} is VALID [2018-11-14 16:53:52,585 INFO L273 TraceCheckUtils]: 78: Hoare triple {3734#(<= main_~v~0 4)} #t~post6 := ~v~0;~v~0 := #t~post6 + 1;havoc #t~post6; {3735#(<= main_~v~0 5)} is VALID [2018-11-14 16:53:52,586 INFO L273 TraceCheckUtils]: 79: Hoare triple {3735#(<= main_~v~0 5)} assume true; {3735#(<= main_~v~0 5)} is VALID [2018-11-14 16:53:52,586 INFO L273 TraceCheckUtils]: 80: Hoare triple {3735#(<= main_~v~0 5)} assume !(~v~0 < 100000); {3729#false} is VALID [2018-11-14 16:53:52,586 INFO L273 TraceCheckUtils]: 81: Hoare triple {3729#false} ~x~0 := 0; {3729#false} is VALID [2018-11-14 16:53:52,587 INFO L273 TraceCheckUtils]: 82: Hoare triple {3729#false} assume true; {3729#false} is VALID [2018-11-14 16:53:52,587 INFO L273 TraceCheckUtils]: 83: Hoare triple {3729#false} assume !!(~x~0 < ~n~0);~y~0 := ~x~0 + 1; {3729#false} is VALID [2018-11-14 16:53:52,587 INFO L273 TraceCheckUtils]: 84: Hoare triple {3729#false} assume true; {3729#false} is VALID [2018-11-14 16:53:52,587 INFO L273 TraceCheckUtils]: 85: Hoare triple {3729#false} assume !!(~y~0 < ~n~0);call #t~mem13 := read~int(~#set~0.base, ~#set~0.offset + ~x~0 * 4, 4);call #t~mem14 := read~int(~#set~0.base, ~#set~0.offset + ~y~0 * 4, 4); {3729#false} is VALID [2018-11-14 16:53:52,588 INFO L256 TraceCheckUtils]: 86: Hoare triple {3729#false} call __VERIFIER_assert((if #t~mem13 != #t~mem14 then 1 else 0)); {3729#false} is VALID [2018-11-14 16:53:52,588 INFO L273 TraceCheckUtils]: 87: Hoare triple {3729#false} ~cond := #in~cond; {3729#false} is VALID [2018-11-14 16:53:52,588 INFO L273 TraceCheckUtils]: 88: Hoare triple {3729#false} assume ~cond == 0; {3729#false} is VALID [2018-11-14 16:53:52,588 INFO L273 TraceCheckUtils]: 89: Hoare triple {3729#false} assume !false; {3729#false} is VALID [2018-11-14 16:53:52,593 INFO L134 CoverageAnalysis]: Checked inductivity of 129 backedges. 0 proven. 72 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2018-11-14 16:53:52,614 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 16:53:52,615 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 9 [2018-11-14 16:53:52,615 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 90 [2018-11-14 16:53:52,616 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 16:53:52,616 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states. [2018-11-14 16:53:52,693 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 81 edges. 81 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 16:53:52,694 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-14 16:53:52,694 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-14 16:53:52,694 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2018-11-14 16:53:52,694 INFO L87 Difference]: Start difference. First operand 137 states and 179 transitions. Second operand 9 states. [2018-11-14 16:53:53,373 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:53:53,373 INFO L93 Difference]: Finished difference Result 214 states and 284 transitions. [2018-11-14 16:53:53,373 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-14 16:53:53,373 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 90 [2018-11-14 16:53:53,374 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 16:53:53,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-11-14 16:53:53,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 131 transitions. [2018-11-14 16:53:53,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-11-14 16:53:53,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 131 transitions. [2018-11-14 16:53:53,380 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states and 131 transitions. [2018-11-14 16:53:53,547 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 131 edges. 131 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 16:53:53,553 INFO L225 Difference]: With dead ends: 214 [2018-11-14 16:53:53,553 INFO L226 Difference]: Without dead ends: 199 [2018-11-14 16:53:53,554 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 90 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2018-11-14 16:53:53,554 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 199 states. [2018-11-14 16:53:53,712 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 199 to 163. [2018-11-14 16:53:53,713 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 16:53:53,713 INFO L82 GeneralOperation]: Start isEquivalent. First operand 199 states. Second operand 163 states. [2018-11-14 16:53:53,713 INFO L74 IsIncluded]: Start isIncluded. First operand 199 states. Second operand 163 states. [2018-11-14 16:53:53,713 INFO L87 Difference]: Start difference. First operand 199 states. Second operand 163 states. [2018-11-14 16:53:53,724 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:53:53,724 INFO L93 Difference]: Finished difference Result 199 states and 267 transitions. [2018-11-14 16:53:53,725 INFO L276 IsEmpty]: Start isEmpty. Operand 199 states and 267 transitions. [2018-11-14 16:53:53,726 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:53:53,726 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:53:53,726 INFO L74 IsIncluded]: Start isIncluded. First operand 163 states. Second operand 199 states. [2018-11-14 16:53:53,726 INFO L87 Difference]: Start difference. First operand 163 states. Second operand 199 states. [2018-11-14 16:53:53,737 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:53:53,737 INFO L93 Difference]: Finished difference Result 199 states and 267 transitions. [2018-11-14 16:53:53,738 INFO L276 IsEmpty]: Start isEmpty. Operand 199 states and 267 transitions. [2018-11-14 16:53:53,739 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:53:53,739 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:53:53,739 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 16:53:53,739 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 16:53:53,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 163 states. [2018-11-14 16:53:53,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 216 transitions. [2018-11-14 16:53:53,747 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 216 transitions. Word has length 90 [2018-11-14 16:53:53,747 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 16:53:53,747 INFO L480 AbstractCegarLoop]: Abstraction has 163 states and 216 transitions. [2018-11-14 16:53:53,748 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-14 16:53:53,748 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 216 transitions. [2018-11-14 16:53:53,749 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2018-11-14 16:53:53,750 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 16:53:53,750 INFO L375 BasicCegarLoop]: trace histogram [7, 6, 6, 6, 6, 6, 6, 6, 6, 4, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 16:53:53,750 INFO L423 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 16:53:53,750 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 16:53:53,750 INFO L82 PathProgramCache]: Analyzing trace with hash 1977748101, now seen corresponding path program 5 times [2018-11-14 16:53:53,751 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 16:53:53,751 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 16:53:53,751 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 16:53:53,752 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-14 16:53:53,752 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 16:53:53,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:53:54,063 INFO L256 TraceCheckUtils]: 0: Hoare triple {4897#true} call ULTIMATE.init(); {4897#true} is VALID [2018-11-14 16:53:54,063 INFO L273 TraceCheckUtils]: 1: Hoare triple {4897#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {4897#true} is VALID [2018-11-14 16:53:54,063 INFO L273 TraceCheckUtils]: 2: Hoare triple {4897#true} assume true; {4897#true} is VALID [2018-11-14 16:53:54,063 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {4897#true} {4897#true} #126#return; {4897#true} is VALID [2018-11-14 16:53:54,064 INFO L256 TraceCheckUtils]: 4: Hoare triple {4897#true} call #t~ret15 := main(); {4897#true} is VALID [2018-11-14 16:53:54,064 INFO L273 TraceCheckUtils]: 5: Hoare triple {4897#true} ~n~0 := 0;call ~#set~0.base, ~#set~0.offset := #Ultimate.alloc(400000);havoc ~x~0;havoc ~y~0;~x~0 := 0; {4897#true} is VALID [2018-11-14 16:53:54,064 INFO L273 TraceCheckUtils]: 6: Hoare triple {4897#true} assume true; {4897#true} is VALID [2018-11-14 16:53:54,064 INFO L273 TraceCheckUtils]: 7: Hoare triple {4897#true} assume !(~x~0 < ~n~0); {4897#true} is VALID [2018-11-14 16:53:54,065 INFO L273 TraceCheckUtils]: 8: Hoare triple {4897#true} call ~#values~0.base, ~#values~0.offset := #Ultimate.alloc(400000);havoc ~v~0;~v~0 := 0; {4899#(= main_~v~0 0)} is VALID [2018-11-14 16:53:54,065 INFO L273 TraceCheckUtils]: 9: Hoare triple {4899#(= main_~v~0 0)} assume true; {4899#(= main_~v~0 0)} is VALID [2018-11-14 16:53:54,066 INFO L273 TraceCheckUtils]: 10: Hoare triple {4899#(= main_~v~0 0)} assume !!(~v~0 < 100000);call #t~mem7 := read~int(~#values~0.base, ~#values~0.offset + ~v~0 * 4, 4); {4899#(= main_~v~0 0)} is VALID [2018-11-14 16:53:54,066 INFO L256 TraceCheckUtils]: 11: Hoare triple {4899#(= main_~v~0 0)} call #t~ret8 := elem_exists(~#set~0.base, ~#set~0.offset, ~n~0, #t~mem7); {4897#true} is VALID [2018-11-14 16:53:54,066 INFO L273 TraceCheckUtils]: 12: Hoare triple {4897#true} ~set.base, ~set.offset := #in~set.base, #in~set.offset;~size := #in~size;~value := #in~value;havoc ~i~0;~i~0 := 0; {4897#true} is VALID [2018-11-14 16:53:54,066 INFO L273 TraceCheckUtils]: 13: Hoare triple {4897#true} assume true; {4897#true} is VALID [2018-11-14 16:53:54,066 INFO L273 TraceCheckUtils]: 14: Hoare triple {4897#true} assume !(~i~0 < ~size); {4897#true} is VALID [2018-11-14 16:53:54,066 INFO L273 TraceCheckUtils]: 15: Hoare triple {4897#true} #res := 0; {4897#true} is VALID [2018-11-14 16:53:54,066 INFO L273 TraceCheckUtils]: 16: Hoare triple {4897#true} assume true; {4897#true} is VALID [2018-11-14 16:53:54,067 INFO L268 TraceCheckUtils]: 17: Hoare quadruple {4897#true} {4899#(= main_~v~0 0)} #132#return; {4899#(= main_~v~0 0)} is VALID [2018-11-14 16:53:54,067 INFO L273 TraceCheckUtils]: 18: Hoare triple {4899#(= main_~v~0 0)} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647; {4899#(= main_~v~0 0)} is VALID [2018-11-14 16:53:54,068 INFO L273 TraceCheckUtils]: 19: Hoare triple {4899#(= main_~v~0 0)} assume #t~ret8 == 0;havoc #t~mem7;havoc #t~ret8;call #t~mem9 := read~int(~#values~0.base, ~#values~0.offset + ~v~0 * 4, 4); {4899#(= main_~v~0 0)} is VALID [2018-11-14 16:53:54,068 INFO L256 TraceCheckUtils]: 20: Hoare triple {4899#(= main_~v~0 0)} call #t~ret10 := insert(~#set~0.base, ~#set~0.offset, ~n~0, #t~mem9); {4897#true} is VALID [2018-11-14 16:53:54,068 INFO L273 TraceCheckUtils]: 21: Hoare triple {4897#true} ~set.base, ~set.offset := #in~set.base, #in~set.offset;~size := #in~size;~value := #in~value;call write~int(~value, ~set.base, ~set.offset + ~size * 4, 4);#res := ~size + 1; {4897#true} is VALID [2018-11-14 16:53:54,068 INFO L273 TraceCheckUtils]: 22: Hoare triple {4897#true} assume true; {4897#true} is VALID [2018-11-14 16:53:54,069 INFO L268 TraceCheckUtils]: 23: Hoare quadruple {4897#true} {4899#(= main_~v~0 0)} #134#return; {4899#(= main_~v~0 0)} is VALID [2018-11-14 16:53:54,069 INFO L273 TraceCheckUtils]: 24: Hoare triple {4899#(= main_~v~0 0)} assume -2147483648 <= #t~ret10 && #t~ret10 <= 2147483647;~n~0 := #t~ret10;havoc #t~ret10;havoc #t~mem9; {4899#(= main_~v~0 0)} is VALID [2018-11-14 16:53:54,069 INFO L273 TraceCheckUtils]: 25: Hoare triple {4899#(= main_~v~0 0)} #t~post6 := ~v~0;~v~0 := #t~post6 + 1;havoc #t~post6; {4900#(<= main_~v~0 1)} is VALID [2018-11-14 16:53:54,070 INFO L273 TraceCheckUtils]: 26: Hoare triple {4900#(<= main_~v~0 1)} assume true; {4900#(<= main_~v~0 1)} is VALID [2018-11-14 16:53:54,070 INFO L273 TraceCheckUtils]: 27: Hoare triple {4900#(<= main_~v~0 1)} assume !!(~v~0 < 100000);call #t~mem7 := read~int(~#values~0.base, ~#values~0.offset + ~v~0 * 4, 4); {4900#(<= main_~v~0 1)} is VALID [2018-11-14 16:53:54,070 INFO L256 TraceCheckUtils]: 28: Hoare triple {4900#(<= main_~v~0 1)} call #t~ret8 := elem_exists(~#set~0.base, ~#set~0.offset, ~n~0, #t~mem7); {4897#true} is VALID [2018-11-14 16:53:54,071 INFO L273 TraceCheckUtils]: 29: Hoare triple {4897#true} ~set.base, ~set.offset := #in~set.base, #in~set.offset;~size := #in~size;~value := #in~value;havoc ~i~0;~i~0 := 0; {4897#true} is VALID [2018-11-14 16:53:54,071 INFO L273 TraceCheckUtils]: 30: Hoare triple {4897#true} assume true; {4897#true} is VALID [2018-11-14 16:53:54,071 INFO L273 TraceCheckUtils]: 31: Hoare triple {4897#true} assume !(~i~0 < ~size); {4897#true} is VALID [2018-11-14 16:53:54,071 INFO L273 TraceCheckUtils]: 32: Hoare triple {4897#true} #res := 0; {4897#true} is VALID [2018-11-14 16:53:54,071 INFO L273 TraceCheckUtils]: 33: Hoare triple {4897#true} assume true; {4897#true} is VALID [2018-11-14 16:53:54,072 INFO L268 TraceCheckUtils]: 34: Hoare quadruple {4897#true} {4900#(<= main_~v~0 1)} #132#return; {4900#(<= main_~v~0 1)} is VALID [2018-11-14 16:53:54,073 INFO L273 TraceCheckUtils]: 35: Hoare triple {4900#(<= main_~v~0 1)} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647; {4900#(<= main_~v~0 1)} is VALID [2018-11-14 16:53:54,073 INFO L273 TraceCheckUtils]: 36: Hoare triple {4900#(<= main_~v~0 1)} assume #t~ret8 == 0;havoc #t~mem7;havoc #t~ret8;call #t~mem9 := read~int(~#values~0.base, ~#values~0.offset + ~v~0 * 4, 4); {4900#(<= main_~v~0 1)} is VALID [2018-11-14 16:53:54,073 INFO L256 TraceCheckUtils]: 37: Hoare triple {4900#(<= main_~v~0 1)} call #t~ret10 := insert(~#set~0.base, ~#set~0.offset, ~n~0, #t~mem9); {4897#true} is VALID [2018-11-14 16:53:54,074 INFO L273 TraceCheckUtils]: 38: Hoare triple {4897#true} ~set.base, ~set.offset := #in~set.base, #in~set.offset;~size := #in~size;~value := #in~value;call write~int(~value, ~set.base, ~set.offset + ~size * 4, 4);#res := ~size + 1; {4897#true} is VALID [2018-11-14 16:53:54,074 INFO L273 TraceCheckUtils]: 39: Hoare triple {4897#true} assume true; {4897#true} is VALID [2018-11-14 16:53:54,074 INFO L268 TraceCheckUtils]: 40: Hoare quadruple {4897#true} {4900#(<= main_~v~0 1)} #134#return; {4900#(<= main_~v~0 1)} is VALID [2018-11-14 16:53:54,075 INFO L273 TraceCheckUtils]: 41: Hoare triple {4900#(<= main_~v~0 1)} assume -2147483648 <= #t~ret10 && #t~ret10 <= 2147483647;~n~0 := #t~ret10;havoc #t~ret10;havoc #t~mem9; {4900#(<= main_~v~0 1)} is VALID [2018-11-14 16:53:54,075 INFO L273 TraceCheckUtils]: 42: Hoare triple {4900#(<= main_~v~0 1)} #t~post6 := ~v~0;~v~0 := #t~post6 + 1;havoc #t~post6; {4901#(<= main_~v~0 2)} is VALID [2018-11-14 16:53:54,076 INFO L273 TraceCheckUtils]: 43: Hoare triple {4901#(<= main_~v~0 2)} assume true; {4901#(<= main_~v~0 2)} is VALID [2018-11-14 16:53:54,076 INFO L273 TraceCheckUtils]: 44: Hoare triple {4901#(<= main_~v~0 2)} assume !!(~v~0 < 100000);call #t~mem7 := read~int(~#values~0.base, ~#values~0.offset + ~v~0 * 4, 4); {4901#(<= main_~v~0 2)} is VALID [2018-11-14 16:53:54,076 INFO L256 TraceCheckUtils]: 45: Hoare triple {4901#(<= main_~v~0 2)} call #t~ret8 := elem_exists(~#set~0.base, ~#set~0.offset, ~n~0, #t~mem7); {4897#true} is VALID [2018-11-14 16:53:54,077 INFO L273 TraceCheckUtils]: 46: Hoare triple {4897#true} ~set.base, ~set.offset := #in~set.base, #in~set.offset;~size := #in~size;~value := #in~value;havoc ~i~0;~i~0 := 0; {4897#true} is VALID [2018-11-14 16:53:54,077 INFO L273 TraceCheckUtils]: 47: Hoare triple {4897#true} assume true; {4897#true} is VALID [2018-11-14 16:53:54,077 INFO L273 TraceCheckUtils]: 48: Hoare triple {4897#true} assume !!(~i~0 < ~size);call #t~mem1 := read~int(~set.base, ~set.offset + ~i~0 * 4, 4); {4897#true} is VALID [2018-11-14 16:53:54,077 INFO L273 TraceCheckUtils]: 49: Hoare triple {4897#true} assume #t~mem1 == ~value;havoc #t~mem1;#res := 1; {4897#true} is VALID [2018-11-14 16:53:54,077 INFO L273 TraceCheckUtils]: 50: Hoare triple {4897#true} assume true; {4897#true} is VALID [2018-11-14 16:53:54,079 INFO L268 TraceCheckUtils]: 51: Hoare quadruple {4897#true} {4901#(<= main_~v~0 2)} #132#return; {4901#(<= main_~v~0 2)} is VALID [2018-11-14 16:53:54,079 INFO L273 TraceCheckUtils]: 52: Hoare triple {4901#(<= main_~v~0 2)} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647; {4901#(<= main_~v~0 2)} is VALID [2018-11-14 16:53:54,079 INFO L273 TraceCheckUtils]: 53: Hoare triple {4901#(<= main_~v~0 2)} assume !(#t~ret8 == 0);havoc #t~mem7;havoc #t~ret8; {4901#(<= main_~v~0 2)} is VALID [2018-11-14 16:53:54,080 INFO L273 TraceCheckUtils]: 54: Hoare triple {4901#(<= main_~v~0 2)} #t~post6 := ~v~0;~v~0 := #t~post6 + 1;havoc #t~post6; {4902#(<= main_~v~0 3)} is VALID [2018-11-14 16:53:54,080 INFO L273 TraceCheckUtils]: 55: Hoare triple {4902#(<= main_~v~0 3)} assume true; {4902#(<= main_~v~0 3)} is VALID [2018-11-14 16:53:54,080 INFO L273 TraceCheckUtils]: 56: Hoare triple {4902#(<= main_~v~0 3)} assume !!(~v~0 < 100000);call #t~mem7 := read~int(~#values~0.base, ~#values~0.offset + ~v~0 * 4, 4); {4902#(<= main_~v~0 3)} is VALID [2018-11-14 16:53:54,081 INFO L256 TraceCheckUtils]: 57: Hoare triple {4902#(<= main_~v~0 3)} call #t~ret8 := elem_exists(~#set~0.base, ~#set~0.offset, ~n~0, #t~mem7); {4897#true} is VALID [2018-11-14 16:53:54,081 INFO L273 TraceCheckUtils]: 58: Hoare triple {4897#true} ~set.base, ~set.offset := #in~set.base, #in~set.offset;~size := #in~size;~value := #in~value;havoc ~i~0;~i~0 := 0; {4897#true} is VALID [2018-11-14 16:53:54,081 INFO L273 TraceCheckUtils]: 59: Hoare triple {4897#true} assume true; {4897#true} is VALID [2018-11-14 16:53:54,081 INFO L273 TraceCheckUtils]: 60: Hoare triple {4897#true} assume !!(~i~0 < ~size);call #t~mem1 := read~int(~set.base, ~set.offset + ~i~0 * 4, 4); {4897#true} is VALID [2018-11-14 16:53:54,081 INFO L273 TraceCheckUtils]: 61: Hoare triple {4897#true} assume #t~mem1 == ~value;havoc #t~mem1;#res := 1; {4897#true} is VALID [2018-11-14 16:53:54,081 INFO L273 TraceCheckUtils]: 62: Hoare triple {4897#true} assume true; {4897#true} is VALID [2018-11-14 16:53:54,082 INFO L268 TraceCheckUtils]: 63: Hoare quadruple {4897#true} {4902#(<= main_~v~0 3)} #132#return; {4902#(<= main_~v~0 3)} is VALID [2018-11-14 16:53:54,083 INFO L273 TraceCheckUtils]: 64: Hoare triple {4902#(<= main_~v~0 3)} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647; {4902#(<= main_~v~0 3)} is VALID [2018-11-14 16:53:54,083 INFO L273 TraceCheckUtils]: 65: Hoare triple {4902#(<= main_~v~0 3)} assume !(#t~ret8 == 0);havoc #t~mem7;havoc #t~ret8; {4902#(<= main_~v~0 3)} is VALID [2018-11-14 16:53:54,084 INFO L273 TraceCheckUtils]: 66: Hoare triple {4902#(<= main_~v~0 3)} #t~post6 := ~v~0;~v~0 := #t~post6 + 1;havoc #t~post6; {4903#(<= main_~v~0 4)} is VALID [2018-11-14 16:53:54,084 INFO L273 TraceCheckUtils]: 67: Hoare triple {4903#(<= main_~v~0 4)} assume true; {4903#(<= main_~v~0 4)} is VALID [2018-11-14 16:53:54,085 INFO L273 TraceCheckUtils]: 68: Hoare triple {4903#(<= main_~v~0 4)} assume !!(~v~0 < 100000);call #t~mem7 := read~int(~#values~0.base, ~#values~0.offset + ~v~0 * 4, 4); {4903#(<= main_~v~0 4)} is VALID [2018-11-14 16:53:54,085 INFO L256 TraceCheckUtils]: 69: Hoare triple {4903#(<= main_~v~0 4)} call #t~ret8 := elem_exists(~#set~0.base, ~#set~0.offset, ~n~0, #t~mem7); {4897#true} is VALID [2018-11-14 16:53:54,085 INFO L273 TraceCheckUtils]: 70: Hoare triple {4897#true} ~set.base, ~set.offset := #in~set.base, #in~set.offset;~size := #in~size;~value := #in~value;havoc ~i~0;~i~0 := 0; {4897#true} is VALID [2018-11-14 16:53:54,085 INFO L273 TraceCheckUtils]: 71: Hoare triple {4897#true} assume true; {4897#true} is VALID [2018-11-14 16:53:54,085 INFO L273 TraceCheckUtils]: 72: Hoare triple {4897#true} assume !!(~i~0 < ~size);call #t~mem1 := read~int(~set.base, ~set.offset + ~i~0 * 4, 4); {4897#true} is VALID [2018-11-14 16:53:54,085 INFO L273 TraceCheckUtils]: 73: Hoare triple {4897#true} assume #t~mem1 == ~value;havoc #t~mem1;#res := 1; {4897#true} is VALID [2018-11-14 16:53:54,086 INFO L273 TraceCheckUtils]: 74: Hoare triple {4897#true} assume true; {4897#true} is VALID [2018-11-14 16:53:54,086 INFO L268 TraceCheckUtils]: 75: Hoare quadruple {4897#true} {4903#(<= main_~v~0 4)} #132#return; {4903#(<= main_~v~0 4)} is VALID [2018-11-14 16:53:54,086 INFO L273 TraceCheckUtils]: 76: Hoare triple {4903#(<= main_~v~0 4)} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647; {4903#(<= main_~v~0 4)} is VALID [2018-11-14 16:53:54,087 INFO L273 TraceCheckUtils]: 77: Hoare triple {4903#(<= main_~v~0 4)} assume !(#t~ret8 == 0);havoc #t~mem7;havoc #t~ret8; {4903#(<= main_~v~0 4)} is VALID [2018-11-14 16:53:54,087 INFO L273 TraceCheckUtils]: 78: Hoare triple {4903#(<= main_~v~0 4)} #t~post6 := ~v~0;~v~0 := #t~post6 + 1;havoc #t~post6; {4904#(<= main_~v~0 5)} is VALID [2018-11-14 16:53:54,105 INFO L273 TraceCheckUtils]: 79: Hoare triple {4904#(<= main_~v~0 5)} assume true; {4904#(<= main_~v~0 5)} is VALID [2018-11-14 16:53:54,118 INFO L273 TraceCheckUtils]: 80: Hoare triple {4904#(<= main_~v~0 5)} assume !!(~v~0 < 100000);call #t~mem7 := read~int(~#values~0.base, ~#values~0.offset + ~v~0 * 4, 4); {4904#(<= main_~v~0 5)} is VALID [2018-11-14 16:53:54,118 INFO L256 TraceCheckUtils]: 81: Hoare triple {4904#(<= main_~v~0 5)} call #t~ret8 := elem_exists(~#set~0.base, ~#set~0.offset, ~n~0, #t~mem7); {4897#true} is VALID [2018-11-14 16:53:54,118 INFO L273 TraceCheckUtils]: 82: Hoare triple {4897#true} ~set.base, ~set.offset := #in~set.base, #in~set.offset;~size := #in~size;~value := #in~value;havoc ~i~0;~i~0 := 0; {4897#true} is VALID [2018-11-14 16:53:54,118 INFO L273 TraceCheckUtils]: 83: Hoare triple {4897#true} assume true; {4897#true} is VALID [2018-11-14 16:53:54,119 INFO L273 TraceCheckUtils]: 84: Hoare triple {4897#true} assume !!(~i~0 < ~size);call #t~mem1 := read~int(~set.base, ~set.offset + ~i~0 * 4, 4); {4897#true} is VALID [2018-11-14 16:53:54,119 INFO L273 TraceCheckUtils]: 85: Hoare triple {4897#true} assume #t~mem1 == ~value;havoc #t~mem1;#res := 1; {4897#true} is VALID [2018-11-14 16:53:54,119 INFO L273 TraceCheckUtils]: 86: Hoare triple {4897#true} assume true; {4897#true} is VALID [2018-11-14 16:53:54,134 INFO L268 TraceCheckUtils]: 87: Hoare quadruple {4897#true} {4904#(<= main_~v~0 5)} #132#return; {4904#(<= main_~v~0 5)} is VALID [2018-11-14 16:53:54,143 INFO L273 TraceCheckUtils]: 88: Hoare triple {4904#(<= main_~v~0 5)} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647; {4904#(<= main_~v~0 5)} is VALID [2018-11-14 16:53:54,156 INFO L273 TraceCheckUtils]: 89: Hoare triple {4904#(<= main_~v~0 5)} assume !(#t~ret8 == 0);havoc #t~mem7;havoc #t~ret8; {4904#(<= main_~v~0 5)} is VALID [2018-11-14 16:53:54,165 INFO L273 TraceCheckUtils]: 90: Hoare triple {4904#(<= main_~v~0 5)} #t~post6 := ~v~0;~v~0 := #t~post6 + 1;havoc #t~post6; {4905#(<= main_~v~0 6)} is VALID [2018-11-14 16:53:54,174 INFO L273 TraceCheckUtils]: 91: Hoare triple {4905#(<= main_~v~0 6)} assume true; {4905#(<= main_~v~0 6)} is VALID [2018-11-14 16:53:54,186 INFO L273 TraceCheckUtils]: 92: Hoare triple {4905#(<= main_~v~0 6)} assume !(~v~0 < 100000); {4898#false} is VALID [2018-11-14 16:53:54,187 INFO L273 TraceCheckUtils]: 93: Hoare triple {4898#false} ~x~0 := 0; {4898#false} is VALID [2018-11-14 16:53:54,187 INFO L273 TraceCheckUtils]: 94: Hoare triple {4898#false} assume true; {4898#false} is VALID [2018-11-14 16:53:54,187 INFO L273 TraceCheckUtils]: 95: Hoare triple {4898#false} assume !!(~x~0 < ~n~0);~y~0 := ~x~0 + 1; {4898#false} is VALID [2018-11-14 16:53:54,187 INFO L273 TraceCheckUtils]: 96: Hoare triple {4898#false} assume true; {4898#false} is VALID [2018-11-14 16:53:54,187 INFO L273 TraceCheckUtils]: 97: Hoare triple {4898#false} assume !!(~y~0 < ~n~0);call #t~mem13 := read~int(~#set~0.base, ~#set~0.offset + ~x~0 * 4, 4);call #t~mem14 := read~int(~#set~0.base, ~#set~0.offset + ~y~0 * 4, 4); {4898#false} is VALID [2018-11-14 16:53:54,187 INFO L256 TraceCheckUtils]: 98: Hoare triple {4898#false} call __VERIFIER_assert((if #t~mem13 != #t~mem14 then 1 else 0)); {4898#false} is VALID [2018-11-14 16:53:54,188 INFO L273 TraceCheckUtils]: 99: Hoare triple {4898#false} ~cond := #in~cond; {4898#false} is VALID [2018-11-14 16:53:54,188 INFO L273 TraceCheckUtils]: 100: Hoare triple {4898#false} assume ~cond == 0; {4898#false} is VALID [2018-11-14 16:53:54,188 INFO L273 TraceCheckUtils]: 101: Hoare triple {4898#false} assume !false; {4898#false} is VALID [2018-11-14 16:53:54,196 INFO L134 CoverageAnalysis]: Checked inductivity of 189 backedges. 0 proven. 104 refuted. 0 times theorem prover too weak. 85 trivial. 0 not checked. [2018-11-14 16:53:54,196 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-14 16:53:54,196 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-14 16:53:54,207 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-11-14 16:53:54,264 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 7 check-sat command(s) [2018-11-14 16:53:54,264 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-14 16:53:54,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:53:54,293 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 16:53:54,559 INFO L256 TraceCheckUtils]: 0: Hoare triple {4897#true} call ULTIMATE.init(); {4897#true} is VALID [2018-11-14 16:53:54,559 INFO L273 TraceCheckUtils]: 1: Hoare triple {4897#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {4897#true} is VALID [2018-11-14 16:53:54,560 INFO L273 TraceCheckUtils]: 2: Hoare triple {4897#true} assume true; {4897#true} is VALID [2018-11-14 16:53:54,560 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {4897#true} {4897#true} #126#return; {4897#true} is VALID [2018-11-14 16:53:54,560 INFO L256 TraceCheckUtils]: 4: Hoare triple {4897#true} call #t~ret15 := main(); {4897#true} is VALID [2018-11-14 16:53:54,561 INFO L273 TraceCheckUtils]: 5: Hoare triple {4897#true} ~n~0 := 0;call ~#set~0.base, ~#set~0.offset := #Ultimate.alloc(400000);havoc ~x~0;havoc ~y~0;~x~0 := 0; {4924#(<= 0 main_~n~0)} is VALID [2018-11-14 16:53:54,561 INFO L273 TraceCheckUtils]: 6: Hoare triple {4924#(<= 0 main_~n~0)} assume true; {4924#(<= 0 main_~n~0)} is VALID [2018-11-14 16:53:54,562 INFO L273 TraceCheckUtils]: 7: Hoare triple {4924#(<= 0 main_~n~0)} assume !(~x~0 < ~n~0); {4924#(<= 0 main_~n~0)} is VALID [2018-11-14 16:53:54,562 INFO L273 TraceCheckUtils]: 8: Hoare triple {4924#(<= 0 main_~n~0)} call ~#values~0.base, ~#values~0.offset := #Ultimate.alloc(400000);havoc ~v~0;~v~0 := 0; {4924#(<= 0 main_~n~0)} is VALID [2018-11-14 16:53:54,562 INFO L273 TraceCheckUtils]: 9: Hoare triple {4924#(<= 0 main_~n~0)} assume true; {4924#(<= 0 main_~n~0)} is VALID [2018-11-14 16:53:54,562 INFO L273 TraceCheckUtils]: 10: Hoare triple {4924#(<= 0 main_~n~0)} assume !!(~v~0 < 100000);call #t~mem7 := read~int(~#values~0.base, ~#values~0.offset + ~v~0 * 4, 4); {4924#(<= 0 main_~n~0)} is VALID [2018-11-14 16:53:54,563 INFO L256 TraceCheckUtils]: 11: Hoare triple {4924#(<= 0 main_~n~0)} call #t~ret8 := elem_exists(~#set~0.base, ~#set~0.offset, ~n~0, #t~mem7); {4897#true} is VALID [2018-11-14 16:53:54,563 INFO L273 TraceCheckUtils]: 12: Hoare triple {4897#true} ~set.base, ~set.offset := #in~set.base, #in~set.offset;~size := #in~size;~value := #in~value;havoc ~i~0;~i~0 := 0; {4897#true} is VALID [2018-11-14 16:53:54,563 INFO L273 TraceCheckUtils]: 13: Hoare triple {4897#true} assume true; {4897#true} is VALID [2018-11-14 16:53:54,563 INFO L273 TraceCheckUtils]: 14: Hoare triple {4897#true} assume !(~i~0 < ~size); {4897#true} is VALID [2018-11-14 16:53:54,563 INFO L273 TraceCheckUtils]: 15: Hoare triple {4897#true} #res := 0; {4897#true} is VALID [2018-11-14 16:53:54,563 INFO L273 TraceCheckUtils]: 16: Hoare triple {4897#true} assume true; {4897#true} is VALID [2018-11-14 16:53:54,564 INFO L268 TraceCheckUtils]: 17: Hoare quadruple {4897#true} {4924#(<= 0 main_~n~0)} #132#return; {4924#(<= 0 main_~n~0)} is VALID [2018-11-14 16:53:54,565 INFO L273 TraceCheckUtils]: 18: Hoare triple {4924#(<= 0 main_~n~0)} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647; {4924#(<= 0 main_~n~0)} is VALID [2018-11-14 16:53:54,565 INFO L273 TraceCheckUtils]: 19: Hoare triple {4924#(<= 0 main_~n~0)} assume #t~ret8 == 0;havoc #t~mem7;havoc #t~ret8;call #t~mem9 := read~int(~#values~0.base, ~#values~0.offset + ~v~0 * 4, 4); {4924#(<= 0 main_~n~0)} is VALID [2018-11-14 16:53:54,565 INFO L256 TraceCheckUtils]: 20: Hoare triple {4924#(<= 0 main_~n~0)} call #t~ret10 := insert(~#set~0.base, ~#set~0.offset, ~n~0, #t~mem9); {4897#true} is VALID [2018-11-14 16:53:54,566 INFO L273 TraceCheckUtils]: 21: Hoare triple {4897#true} ~set.base, ~set.offset := #in~set.base, #in~set.offset;~size := #in~size;~value := #in~value;call write~int(~value, ~set.base, ~set.offset + ~size * 4, 4);#res := ~size + 1; {4973#(<= (+ |insert_#in~size| 1) |insert_#res|)} is VALID [2018-11-14 16:53:54,566 INFO L273 TraceCheckUtils]: 22: Hoare triple {4973#(<= (+ |insert_#in~size| 1) |insert_#res|)} assume true; {4973#(<= (+ |insert_#in~size| 1) |insert_#res|)} is VALID [2018-11-14 16:53:54,567 INFO L268 TraceCheckUtils]: 23: Hoare quadruple {4973#(<= (+ |insert_#in~size| 1) |insert_#res|)} {4924#(<= 0 main_~n~0)} #134#return; {4980#(<= 1 |main_#t~ret10|)} is VALID [2018-11-14 16:53:54,568 INFO L273 TraceCheckUtils]: 24: Hoare triple {4980#(<= 1 |main_#t~ret10|)} assume -2147483648 <= #t~ret10 && #t~ret10 <= 2147483647;~n~0 := #t~ret10;havoc #t~ret10;havoc #t~mem9; {4984#(<= 1 main_~n~0)} is VALID [2018-11-14 16:53:54,568 INFO L273 TraceCheckUtils]: 25: Hoare triple {4984#(<= 1 main_~n~0)} #t~post6 := ~v~0;~v~0 := #t~post6 + 1;havoc #t~post6; {4984#(<= 1 main_~n~0)} is VALID [2018-11-14 16:53:54,568 INFO L273 TraceCheckUtils]: 26: Hoare triple {4984#(<= 1 main_~n~0)} assume true; {4984#(<= 1 main_~n~0)} is VALID [2018-11-14 16:53:54,569 INFO L273 TraceCheckUtils]: 27: Hoare triple {4984#(<= 1 main_~n~0)} assume !!(~v~0 < 100000);call #t~mem7 := read~int(~#values~0.base, ~#values~0.offset + ~v~0 * 4, 4); {4984#(<= 1 main_~n~0)} is VALID [2018-11-14 16:53:54,569 INFO L256 TraceCheckUtils]: 28: Hoare triple {4984#(<= 1 main_~n~0)} call #t~ret8 := elem_exists(~#set~0.base, ~#set~0.offset, ~n~0, #t~mem7); {4897#true} is VALID [2018-11-14 16:53:54,569 INFO L273 TraceCheckUtils]: 29: Hoare triple {4897#true} ~set.base, ~set.offset := #in~set.base, #in~set.offset;~size := #in~size;~value := #in~value;havoc ~i~0;~i~0 := 0; {5000#(and (<= |elem_exists_#in~size| elem_exists_~size) (<= elem_exists_~i~0 0))} is VALID [2018-11-14 16:53:54,570 INFO L273 TraceCheckUtils]: 30: Hoare triple {5000#(and (<= |elem_exists_#in~size| elem_exists_~size) (<= elem_exists_~i~0 0))} assume true; {5000#(and (<= |elem_exists_#in~size| elem_exists_~size) (<= elem_exists_~i~0 0))} is VALID [2018-11-14 16:53:54,571 INFO L273 TraceCheckUtils]: 31: Hoare triple {5000#(and (<= |elem_exists_#in~size| elem_exists_~size) (<= elem_exists_~i~0 0))} assume !(~i~0 < ~size); {5007#(<= |elem_exists_#in~size| 0)} is VALID [2018-11-14 16:53:54,571 INFO L273 TraceCheckUtils]: 32: Hoare triple {5007#(<= |elem_exists_#in~size| 0)} #res := 0; {5007#(<= |elem_exists_#in~size| 0)} is VALID [2018-11-14 16:53:54,572 INFO L273 TraceCheckUtils]: 33: Hoare triple {5007#(<= |elem_exists_#in~size| 0)} assume true; {5007#(<= |elem_exists_#in~size| 0)} is VALID [2018-11-14 16:53:54,573 INFO L268 TraceCheckUtils]: 34: Hoare quadruple {5007#(<= |elem_exists_#in~size| 0)} {4984#(<= 1 main_~n~0)} #132#return; {4898#false} is VALID [2018-11-14 16:53:54,573 INFO L273 TraceCheckUtils]: 35: Hoare triple {4898#false} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647; {4898#false} is VALID [2018-11-14 16:53:54,574 INFO L273 TraceCheckUtils]: 36: Hoare triple {4898#false} assume #t~ret8 == 0;havoc #t~mem7;havoc #t~ret8;call #t~mem9 := read~int(~#values~0.base, ~#values~0.offset + ~v~0 * 4, 4); {4898#false} is VALID [2018-11-14 16:53:54,574 INFO L256 TraceCheckUtils]: 37: Hoare triple {4898#false} call #t~ret10 := insert(~#set~0.base, ~#set~0.offset, ~n~0, #t~mem9); {4898#false} is VALID [2018-11-14 16:53:54,574 INFO L273 TraceCheckUtils]: 38: Hoare triple {4898#false} ~set.base, ~set.offset := #in~set.base, #in~set.offset;~size := #in~size;~value := #in~value;call write~int(~value, ~set.base, ~set.offset + ~size * 4, 4);#res := ~size + 1; {4898#false} is VALID [2018-11-14 16:53:54,574 INFO L273 TraceCheckUtils]: 39: Hoare triple {4898#false} assume true; {4898#false} is VALID [2018-11-14 16:53:54,575 INFO L268 TraceCheckUtils]: 40: Hoare quadruple {4898#false} {4898#false} #134#return; {4898#false} is VALID [2018-11-14 16:53:54,575 INFO L273 TraceCheckUtils]: 41: Hoare triple {4898#false} assume -2147483648 <= #t~ret10 && #t~ret10 <= 2147483647;~n~0 := #t~ret10;havoc #t~ret10;havoc #t~mem9; {4898#false} is VALID [2018-11-14 16:53:54,575 INFO L273 TraceCheckUtils]: 42: Hoare triple {4898#false} #t~post6 := ~v~0;~v~0 := #t~post6 + 1;havoc #t~post6; {4898#false} is VALID [2018-11-14 16:53:54,575 INFO L273 TraceCheckUtils]: 43: Hoare triple {4898#false} assume true; {4898#false} is VALID [2018-11-14 16:53:54,575 INFO L273 TraceCheckUtils]: 44: Hoare triple {4898#false} assume !!(~v~0 < 100000);call #t~mem7 := read~int(~#values~0.base, ~#values~0.offset + ~v~0 * 4, 4); {4898#false} is VALID [2018-11-14 16:53:54,576 INFO L256 TraceCheckUtils]: 45: Hoare triple {4898#false} call #t~ret8 := elem_exists(~#set~0.base, ~#set~0.offset, ~n~0, #t~mem7); {4898#false} is VALID [2018-11-14 16:53:54,576 INFO L273 TraceCheckUtils]: 46: Hoare triple {4898#false} ~set.base, ~set.offset := #in~set.base, #in~set.offset;~size := #in~size;~value := #in~value;havoc ~i~0;~i~0 := 0; {4898#false} is VALID [2018-11-14 16:53:54,576 INFO L273 TraceCheckUtils]: 47: Hoare triple {4898#false} assume true; {4898#false} is VALID [2018-11-14 16:53:54,577 INFO L273 TraceCheckUtils]: 48: Hoare triple {4898#false} assume !!(~i~0 < ~size);call #t~mem1 := read~int(~set.base, ~set.offset + ~i~0 * 4, 4); {4898#false} is VALID [2018-11-14 16:53:54,577 INFO L273 TraceCheckUtils]: 49: Hoare triple {4898#false} assume #t~mem1 == ~value;havoc #t~mem1;#res := 1; {4898#false} is VALID [2018-11-14 16:53:54,577 INFO L273 TraceCheckUtils]: 50: Hoare triple {4898#false} assume true; {4898#false} is VALID [2018-11-14 16:53:54,577 INFO L268 TraceCheckUtils]: 51: Hoare quadruple {4898#false} {4898#false} #132#return; {4898#false} is VALID [2018-11-14 16:53:54,577 INFO L273 TraceCheckUtils]: 52: Hoare triple {4898#false} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647; {4898#false} is VALID [2018-11-14 16:53:54,578 INFO L273 TraceCheckUtils]: 53: Hoare triple {4898#false} assume !(#t~ret8 == 0);havoc #t~mem7;havoc #t~ret8; {4898#false} is VALID [2018-11-14 16:53:54,578 INFO L273 TraceCheckUtils]: 54: Hoare triple {4898#false} #t~post6 := ~v~0;~v~0 := #t~post6 + 1;havoc #t~post6; {4898#false} is VALID [2018-11-14 16:53:54,578 INFO L273 TraceCheckUtils]: 55: Hoare triple {4898#false} assume true; {4898#false} is VALID [2018-11-14 16:53:54,578 INFO L273 TraceCheckUtils]: 56: Hoare triple {4898#false} assume !!(~v~0 < 100000);call #t~mem7 := read~int(~#values~0.base, ~#values~0.offset + ~v~0 * 4, 4); {4898#false} is VALID [2018-11-14 16:53:54,578 INFO L256 TraceCheckUtils]: 57: Hoare triple {4898#false} call #t~ret8 := elem_exists(~#set~0.base, ~#set~0.offset, ~n~0, #t~mem7); {4898#false} is VALID [2018-11-14 16:53:54,578 INFO L273 TraceCheckUtils]: 58: Hoare triple {4898#false} ~set.base, ~set.offset := #in~set.base, #in~set.offset;~size := #in~size;~value := #in~value;havoc ~i~0;~i~0 := 0; {4898#false} is VALID [2018-11-14 16:53:54,578 INFO L273 TraceCheckUtils]: 59: Hoare triple {4898#false} assume true; {4898#false} is VALID [2018-11-14 16:53:54,578 INFO L273 TraceCheckUtils]: 60: Hoare triple {4898#false} assume !!(~i~0 < ~size);call #t~mem1 := read~int(~set.base, ~set.offset + ~i~0 * 4, 4); {4898#false} is VALID [2018-11-14 16:53:54,579 INFO L273 TraceCheckUtils]: 61: Hoare triple {4898#false} assume #t~mem1 == ~value;havoc #t~mem1;#res := 1; {4898#false} is VALID [2018-11-14 16:53:54,579 INFO L273 TraceCheckUtils]: 62: Hoare triple {4898#false} assume true; {4898#false} is VALID [2018-11-14 16:53:54,579 INFO L268 TraceCheckUtils]: 63: Hoare quadruple {4898#false} {4898#false} #132#return; {4898#false} is VALID [2018-11-14 16:53:54,579 INFO L273 TraceCheckUtils]: 64: Hoare triple {4898#false} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647; {4898#false} is VALID [2018-11-14 16:53:54,579 INFO L273 TraceCheckUtils]: 65: Hoare triple {4898#false} assume !(#t~ret8 == 0);havoc #t~mem7;havoc #t~ret8; {4898#false} is VALID [2018-11-14 16:53:54,579 INFO L273 TraceCheckUtils]: 66: Hoare triple {4898#false} #t~post6 := ~v~0;~v~0 := #t~post6 + 1;havoc #t~post6; {4898#false} is VALID [2018-11-14 16:53:54,579 INFO L273 TraceCheckUtils]: 67: Hoare triple {4898#false} assume true; {4898#false} is VALID [2018-11-14 16:53:54,579 INFO L273 TraceCheckUtils]: 68: Hoare triple {4898#false} assume !!(~v~0 < 100000);call #t~mem7 := read~int(~#values~0.base, ~#values~0.offset + ~v~0 * 4, 4); {4898#false} is VALID [2018-11-14 16:53:54,580 INFO L256 TraceCheckUtils]: 69: Hoare triple {4898#false} call #t~ret8 := elem_exists(~#set~0.base, ~#set~0.offset, ~n~0, #t~mem7); {4898#false} is VALID [2018-11-14 16:53:54,580 INFO L273 TraceCheckUtils]: 70: Hoare triple {4898#false} ~set.base, ~set.offset := #in~set.base, #in~set.offset;~size := #in~size;~value := #in~value;havoc ~i~0;~i~0 := 0; {4898#false} is VALID [2018-11-14 16:53:54,580 INFO L273 TraceCheckUtils]: 71: Hoare triple {4898#false} assume true; {4898#false} is VALID [2018-11-14 16:53:54,580 INFO L273 TraceCheckUtils]: 72: Hoare triple {4898#false} assume !!(~i~0 < ~size);call #t~mem1 := read~int(~set.base, ~set.offset + ~i~0 * 4, 4); {4898#false} is VALID [2018-11-14 16:53:54,580 INFO L273 TraceCheckUtils]: 73: Hoare triple {4898#false} assume #t~mem1 == ~value;havoc #t~mem1;#res := 1; {4898#false} is VALID [2018-11-14 16:53:54,580 INFO L273 TraceCheckUtils]: 74: Hoare triple {4898#false} assume true; {4898#false} is VALID [2018-11-14 16:53:54,580 INFO L268 TraceCheckUtils]: 75: Hoare quadruple {4898#false} {4898#false} #132#return; {4898#false} is VALID [2018-11-14 16:53:54,580 INFO L273 TraceCheckUtils]: 76: Hoare triple {4898#false} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647; {4898#false} is VALID [2018-11-14 16:53:54,581 INFO L273 TraceCheckUtils]: 77: Hoare triple {4898#false} assume !(#t~ret8 == 0);havoc #t~mem7;havoc #t~ret8; {4898#false} is VALID [2018-11-14 16:53:54,581 INFO L273 TraceCheckUtils]: 78: Hoare triple {4898#false} #t~post6 := ~v~0;~v~0 := #t~post6 + 1;havoc #t~post6; {4898#false} is VALID [2018-11-14 16:53:54,581 INFO L273 TraceCheckUtils]: 79: Hoare triple {4898#false} assume true; {4898#false} is VALID [2018-11-14 16:53:54,581 INFO L273 TraceCheckUtils]: 80: Hoare triple {4898#false} assume !!(~v~0 < 100000);call #t~mem7 := read~int(~#values~0.base, ~#values~0.offset + ~v~0 * 4, 4); {4898#false} is VALID [2018-11-14 16:53:54,581 INFO L256 TraceCheckUtils]: 81: Hoare triple {4898#false} call #t~ret8 := elem_exists(~#set~0.base, ~#set~0.offset, ~n~0, #t~mem7); {4898#false} is VALID [2018-11-14 16:53:54,581 INFO L273 TraceCheckUtils]: 82: Hoare triple {4898#false} ~set.base, ~set.offset := #in~set.base, #in~set.offset;~size := #in~size;~value := #in~value;havoc ~i~0;~i~0 := 0; {4898#false} is VALID [2018-11-14 16:53:54,581 INFO L273 TraceCheckUtils]: 83: Hoare triple {4898#false} assume true; {4898#false} is VALID [2018-11-14 16:53:54,582 INFO L273 TraceCheckUtils]: 84: Hoare triple {4898#false} assume !!(~i~0 < ~size);call #t~mem1 := read~int(~set.base, ~set.offset + ~i~0 * 4, 4); {4898#false} is VALID [2018-11-14 16:53:54,582 INFO L273 TraceCheckUtils]: 85: Hoare triple {4898#false} assume #t~mem1 == ~value;havoc #t~mem1;#res := 1; {4898#false} is VALID [2018-11-14 16:53:54,582 INFO L273 TraceCheckUtils]: 86: Hoare triple {4898#false} assume true; {4898#false} is VALID [2018-11-14 16:53:54,582 INFO L268 TraceCheckUtils]: 87: Hoare quadruple {4898#false} {4898#false} #132#return; {4898#false} is VALID [2018-11-14 16:53:54,582 INFO L273 TraceCheckUtils]: 88: Hoare triple {4898#false} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647; {4898#false} is VALID [2018-11-14 16:53:54,582 INFO L273 TraceCheckUtils]: 89: Hoare triple {4898#false} assume !(#t~ret8 == 0);havoc #t~mem7;havoc #t~ret8; {4898#false} is VALID [2018-11-14 16:53:54,583 INFO L273 TraceCheckUtils]: 90: Hoare triple {4898#false} #t~post6 := ~v~0;~v~0 := #t~post6 + 1;havoc #t~post6; {4898#false} is VALID [2018-11-14 16:53:54,583 INFO L273 TraceCheckUtils]: 91: Hoare triple {4898#false} assume true; {4898#false} is VALID [2018-11-14 16:53:54,583 INFO L273 TraceCheckUtils]: 92: Hoare triple {4898#false} assume !(~v~0 < 100000); {4898#false} is VALID [2018-11-14 16:53:54,583 INFO L273 TraceCheckUtils]: 93: Hoare triple {4898#false} ~x~0 := 0; {4898#false} is VALID [2018-11-14 16:53:54,583 INFO L273 TraceCheckUtils]: 94: Hoare triple {4898#false} assume true; {4898#false} is VALID [2018-11-14 16:53:54,583 INFO L273 TraceCheckUtils]: 95: Hoare triple {4898#false} assume !!(~x~0 < ~n~0);~y~0 := ~x~0 + 1; {4898#false} is VALID [2018-11-14 16:53:54,584 INFO L273 TraceCheckUtils]: 96: Hoare triple {4898#false} assume true; {4898#false} is VALID [2018-11-14 16:53:54,584 INFO L273 TraceCheckUtils]: 97: Hoare triple {4898#false} assume !!(~y~0 < ~n~0);call #t~mem13 := read~int(~#set~0.base, ~#set~0.offset + ~x~0 * 4, 4);call #t~mem14 := read~int(~#set~0.base, ~#set~0.offset + ~y~0 * 4, 4); {4898#false} is VALID [2018-11-14 16:53:54,584 INFO L256 TraceCheckUtils]: 98: Hoare triple {4898#false} call __VERIFIER_assert((if #t~mem13 != #t~mem14 then 1 else 0)); {4898#false} is VALID [2018-11-14 16:53:54,584 INFO L273 TraceCheckUtils]: 99: Hoare triple {4898#false} ~cond := #in~cond; {4898#false} is VALID [2018-11-14 16:53:54,584 INFO L273 TraceCheckUtils]: 100: Hoare triple {4898#false} assume ~cond == 0; {4898#false} is VALID [2018-11-14 16:53:54,584 INFO L273 TraceCheckUtils]: 101: Hoare triple {4898#false} assume !false; {4898#false} is VALID [2018-11-14 16:53:54,591 INFO L134 CoverageAnalysis]: Checked inductivity of 189 backedges. 96 proven. 0 refuted. 0 times theorem prover too weak. 93 trivial. 0 not checked. [2018-11-14 16:53:54,614 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-14 16:53:54,614 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [9] total 15 [2018-11-14 16:53:54,615 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 102 [2018-11-14 16:53:54,615 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 16:53:54,616 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 15 states. [2018-11-14 16:53:54,732 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 121 edges. 121 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 16:53:54,732 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-11-14 16:53:54,732 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-11-14 16:53:54,732 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=161, Unknown=0, NotChecked=0, Total=210 [2018-11-14 16:53:54,733 INFO L87 Difference]: Start difference. First operand 163 states and 216 transitions. Second operand 15 states. [2018-11-14 16:53:57,990 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:53:57,990 INFO L93 Difference]: Finished difference Result 309 states and 449 transitions. [2018-11-14 16:53:57,990 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2018-11-14 16:53:57,990 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 102 [2018-11-14 16:53:57,990 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 16:53:57,991 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2018-11-14 16:53:57,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 282 transitions. [2018-11-14 16:53:57,999 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2018-11-14 16:53:58,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 282 transitions. [2018-11-14 16:53:58,007 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 36 states and 282 transitions. [2018-11-14 16:53:58,747 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 282 edges. 282 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 16:53:58,760 INFO L225 Difference]: With dead ends: 309 [2018-11-14 16:53:58,760 INFO L226 Difference]: Without dead ends: 234 [2018-11-14 16:53:58,762 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 140 GetRequests, 97 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 508 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=491, Invalid=1489, Unknown=0, NotChecked=0, Total=1980 [2018-11-14 16:53:58,763 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 234 states. [2018-11-14 16:53:59,032 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 234 to 194. [2018-11-14 16:53:59,032 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 16:53:59,032 INFO L82 GeneralOperation]: Start isEquivalent. First operand 234 states. Second operand 194 states. [2018-11-14 16:53:59,032 INFO L74 IsIncluded]: Start isIncluded. First operand 234 states. Second operand 194 states. [2018-11-14 16:53:59,032 INFO L87 Difference]: Start difference. First operand 234 states. Second operand 194 states. [2018-11-14 16:53:59,047 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:53:59,048 INFO L93 Difference]: Finished difference Result 234 states and 342 transitions. [2018-11-14 16:53:59,048 INFO L276 IsEmpty]: Start isEmpty. Operand 234 states and 342 transitions. [2018-11-14 16:53:59,050 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:53:59,050 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:53:59,050 INFO L74 IsIncluded]: Start isIncluded. First operand 194 states. Second operand 234 states. [2018-11-14 16:53:59,050 INFO L87 Difference]: Start difference. First operand 194 states. Second operand 234 states. [2018-11-14 16:53:59,065 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:53:59,065 INFO L93 Difference]: Finished difference Result 234 states and 342 transitions. [2018-11-14 16:53:59,065 INFO L276 IsEmpty]: Start isEmpty. Operand 234 states and 342 transitions. [2018-11-14 16:53:59,067 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:53:59,067 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:53:59,067 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 16:53:59,067 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 16:53:59,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 194 states. [2018-11-14 16:53:59,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194 states to 194 states and 264 transitions. [2018-11-14 16:53:59,077 INFO L78 Accepts]: Start accepts. Automaton has 194 states and 264 transitions. Word has length 102 [2018-11-14 16:53:59,077 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 16:53:59,077 INFO L480 AbstractCegarLoop]: Abstraction has 194 states and 264 transitions. [2018-11-14 16:53:59,077 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-11-14 16:53:59,077 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 264 transitions. [2018-11-14 16:53:59,080 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2018-11-14 16:53:59,080 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 16:53:59,080 INFO L375 BasicCegarLoop]: trace histogram [8, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 5, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 16:53:59,080 INFO L423 AbstractCegarLoop]: === Iteration 9 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 16:53:59,080 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 16:53:59,081 INFO L82 PathProgramCache]: Analyzing trace with hash -1682517700, now seen corresponding path program 6 times [2018-11-14 16:53:59,081 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 16:53:59,081 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 16:53:59,082 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 16:53:59,082 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-14 16:53:59,082 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 16:53:59,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:53:59,326 INFO L256 TraceCheckUtils]: 0: Hoare triple {6399#true} call ULTIMATE.init(); {6399#true} is VALID [2018-11-14 16:53:59,327 INFO L273 TraceCheckUtils]: 1: Hoare triple {6399#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {6399#true} is VALID [2018-11-14 16:53:59,327 INFO L273 TraceCheckUtils]: 2: Hoare triple {6399#true} assume true; {6399#true} is VALID [2018-11-14 16:53:59,327 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {6399#true} {6399#true} #126#return; {6399#true} is VALID [2018-11-14 16:53:59,327 INFO L256 TraceCheckUtils]: 4: Hoare triple {6399#true} call #t~ret15 := main(); {6399#true} is VALID [2018-11-14 16:53:59,327 INFO L273 TraceCheckUtils]: 5: Hoare triple {6399#true} ~n~0 := 0;call ~#set~0.base, ~#set~0.offset := #Ultimate.alloc(400000);havoc ~x~0;havoc ~y~0;~x~0 := 0; {6399#true} is VALID [2018-11-14 16:53:59,328 INFO L273 TraceCheckUtils]: 6: Hoare triple {6399#true} assume true; {6399#true} is VALID [2018-11-14 16:53:59,328 INFO L273 TraceCheckUtils]: 7: Hoare triple {6399#true} assume !(~x~0 < ~n~0); {6399#true} is VALID [2018-11-14 16:53:59,328 INFO L273 TraceCheckUtils]: 8: Hoare triple {6399#true} call ~#values~0.base, ~#values~0.offset := #Ultimate.alloc(400000);havoc ~v~0;~v~0 := 0; {6399#true} is VALID [2018-11-14 16:53:59,328 INFO L273 TraceCheckUtils]: 9: Hoare triple {6399#true} assume true; {6399#true} is VALID [2018-11-14 16:53:59,329 INFO L273 TraceCheckUtils]: 10: Hoare triple {6399#true} assume !!(~v~0 < 100000);call #t~mem7 := read~int(~#values~0.base, ~#values~0.offset + ~v~0 * 4, 4); {6399#true} is VALID [2018-11-14 16:53:59,329 INFO L256 TraceCheckUtils]: 11: Hoare triple {6399#true} call #t~ret8 := elem_exists(~#set~0.base, ~#set~0.offset, ~n~0, #t~mem7); {6399#true} is VALID [2018-11-14 16:53:59,329 INFO L273 TraceCheckUtils]: 12: Hoare triple {6399#true} ~set.base, ~set.offset := #in~set.base, #in~set.offset;~size := #in~size;~value := #in~value;havoc ~i~0;~i~0 := 0; {6399#true} is VALID [2018-11-14 16:53:59,329 INFO L273 TraceCheckUtils]: 13: Hoare triple {6399#true} assume true; {6399#true} is VALID [2018-11-14 16:53:59,329 INFO L273 TraceCheckUtils]: 14: Hoare triple {6399#true} assume !(~i~0 < ~size); {6399#true} is VALID [2018-11-14 16:53:59,330 INFO L273 TraceCheckUtils]: 15: Hoare triple {6399#true} #res := 0; {6399#true} is VALID [2018-11-14 16:53:59,330 INFO L273 TraceCheckUtils]: 16: Hoare triple {6399#true} assume true; {6399#true} is VALID [2018-11-14 16:53:59,330 INFO L268 TraceCheckUtils]: 17: Hoare quadruple {6399#true} {6399#true} #132#return; {6399#true} is VALID [2018-11-14 16:53:59,330 INFO L273 TraceCheckUtils]: 18: Hoare triple {6399#true} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647; {6399#true} is VALID [2018-11-14 16:53:59,330 INFO L273 TraceCheckUtils]: 19: Hoare triple {6399#true} assume #t~ret8 == 0;havoc #t~mem7;havoc #t~ret8;call #t~mem9 := read~int(~#values~0.base, ~#values~0.offset + ~v~0 * 4, 4); {6399#true} is VALID [2018-11-14 16:53:59,330 INFO L256 TraceCheckUtils]: 20: Hoare triple {6399#true} call #t~ret10 := insert(~#set~0.base, ~#set~0.offset, ~n~0, #t~mem9); {6399#true} is VALID [2018-11-14 16:53:59,331 INFO L273 TraceCheckUtils]: 21: Hoare triple {6399#true} ~set.base, ~set.offset := #in~set.base, #in~set.offset;~size := #in~size;~value := #in~value;call write~int(~value, ~set.base, ~set.offset + ~size * 4, 4);#res := ~size + 1; {6399#true} is VALID [2018-11-14 16:53:59,331 INFO L273 TraceCheckUtils]: 22: Hoare triple {6399#true} assume true; {6399#true} is VALID [2018-11-14 16:53:59,331 INFO L268 TraceCheckUtils]: 23: Hoare quadruple {6399#true} {6399#true} #134#return; {6399#true} is VALID [2018-11-14 16:53:59,331 INFO L273 TraceCheckUtils]: 24: Hoare triple {6399#true} assume -2147483648 <= #t~ret10 && #t~ret10 <= 2147483647;~n~0 := #t~ret10;havoc #t~ret10;havoc #t~mem9; {6399#true} is VALID [2018-11-14 16:53:59,331 INFO L273 TraceCheckUtils]: 25: Hoare triple {6399#true} #t~post6 := ~v~0;~v~0 := #t~post6 + 1;havoc #t~post6; {6399#true} is VALID [2018-11-14 16:53:59,331 INFO L273 TraceCheckUtils]: 26: Hoare triple {6399#true} assume true; {6399#true} is VALID [2018-11-14 16:53:59,331 INFO L273 TraceCheckUtils]: 27: Hoare triple {6399#true} assume !!(~v~0 < 100000);call #t~mem7 := read~int(~#values~0.base, ~#values~0.offset + ~v~0 * 4, 4); {6399#true} is VALID [2018-11-14 16:53:59,332 INFO L256 TraceCheckUtils]: 28: Hoare triple {6399#true} call #t~ret8 := elem_exists(~#set~0.base, ~#set~0.offset, ~n~0, #t~mem7); {6399#true} is VALID [2018-11-14 16:53:59,332 INFO L273 TraceCheckUtils]: 29: Hoare triple {6399#true} ~set.base, ~set.offset := #in~set.base, #in~set.offset;~size := #in~size;~value := #in~value;havoc ~i~0;~i~0 := 0; {6399#true} is VALID [2018-11-14 16:53:59,332 INFO L273 TraceCheckUtils]: 30: Hoare triple {6399#true} assume true; {6399#true} is VALID [2018-11-14 16:53:59,332 INFO L273 TraceCheckUtils]: 31: Hoare triple {6399#true} assume !!(~i~0 < ~size);call #t~mem1 := read~int(~set.base, ~set.offset + ~i~0 * 4, 4); {6399#true} is VALID [2018-11-14 16:53:59,333 INFO L273 TraceCheckUtils]: 32: Hoare triple {6399#true} assume #t~mem1 == ~value;havoc #t~mem1;#res := 1; {6401#(= 1 |elem_exists_#res|)} is VALID [2018-11-14 16:53:59,333 INFO L273 TraceCheckUtils]: 33: Hoare triple {6401#(= 1 |elem_exists_#res|)} assume true; {6401#(= 1 |elem_exists_#res|)} is VALID [2018-11-14 16:53:59,335 INFO L268 TraceCheckUtils]: 34: Hoare quadruple {6401#(= 1 |elem_exists_#res|)} {6399#true} #132#return; {6402#(= |main_#t~ret8| 1)} is VALID [2018-11-14 16:53:59,335 INFO L273 TraceCheckUtils]: 35: Hoare triple {6402#(= |main_#t~ret8| 1)} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647; {6402#(= |main_#t~ret8| 1)} is VALID [2018-11-14 16:53:59,336 INFO L273 TraceCheckUtils]: 36: Hoare triple {6402#(= |main_#t~ret8| 1)} assume #t~ret8 == 0;havoc #t~mem7;havoc #t~ret8;call #t~mem9 := read~int(~#values~0.base, ~#values~0.offset + ~v~0 * 4, 4); {6400#false} is VALID [2018-11-14 16:53:59,336 INFO L256 TraceCheckUtils]: 37: Hoare triple {6400#false} call #t~ret10 := insert(~#set~0.base, ~#set~0.offset, ~n~0, #t~mem9); {6399#true} is VALID [2018-11-14 16:53:59,336 INFO L273 TraceCheckUtils]: 38: Hoare triple {6399#true} ~set.base, ~set.offset := #in~set.base, #in~set.offset;~size := #in~size;~value := #in~value;call write~int(~value, ~set.base, ~set.offset + ~size * 4, 4);#res := ~size + 1; {6399#true} is VALID [2018-11-14 16:53:59,336 INFO L273 TraceCheckUtils]: 39: Hoare triple {6399#true} assume true; {6399#true} is VALID [2018-11-14 16:53:59,337 INFO L268 TraceCheckUtils]: 40: Hoare quadruple {6399#true} {6400#false} #134#return; {6400#false} is VALID [2018-11-14 16:53:59,337 INFO L273 TraceCheckUtils]: 41: Hoare triple {6400#false} assume -2147483648 <= #t~ret10 && #t~ret10 <= 2147483647;~n~0 := #t~ret10;havoc #t~ret10;havoc #t~mem9; {6400#false} is VALID [2018-11-14 16:53:59,337 INFO L273 TraceCheckUtils]: 42: Hoare triple {6400#false} #t~post6 := ~v~0;~v~0 := #t~post6 + 1;havoc #t~post6; {6400#false} is VALID [2018-11-14 16:53:59,337 INFO L273 TraceCheckUtils]: 43: Hoare triple {6400#false} assume true; {6400#false} is VALID [2018-11-14 16:53:59,338 INFO L273 TraceCheckUtils]: 44: Hoare triple {6400#false} assume !!(~v~0 < 100000);call #t~mem7 := read~int(~#values~0.base, ~#values~0.offset + ~v~0 * 4, 4); {6400#false} is VALID [2018-11-14 16:53:59,338 INFO L256 TraceCheckUtils]: 45: Hoare triple {6400#false} call #t~ret8 := elem_exists(~#set~0.base, ~#set~0.offset, ~n~0, #t~mem7); {6399#true} is VALID [2018-11-14 16:53:59,338 INFO L273 TraceCheckUtils]: 46: Hoare triple {6399#true} ~set.base, ~set.offset := #in~set.base, #in~set.offset;~size := #in~size;~value := #in~value;havoc ~i~0;~i~0 := 0; {6399#true} is VALID [2018-11-14 16:53:59,338 INFO L273 TraceCheckUtils]: 47: Hoare triple {6399#true} assume true; {6399#true} is VALID [2018-11-14 16:53:59,339 INFO L273 TraceCheckUtils]: 48: Hoare triple {6399#true} assume !!(~i~0 < ~size);call #t~mem1 := read~int(~set.base, ~set.offset + ~i~0 * 4, 4); {6399#true} is VALID [2018-11-14 16:53:59,339 INFO L273 TraceCheckUtils]: 49: Hoare triple {6399#true} assume #t~mem1 == ~value;havoc #t~mem1;#res := 1; {6399#true} is VALID [2018-11-14 16:53:59,339 INFO L273 TraceCheckUtils]: 50: Hoare triple {6399#true} assume true; {6399#true} is VALID [2018-11-14 16:53:59,339 INFO L268 TraceCheckUtils]: 51: Hoare quadruple {6399#true} {6400#false} #132#return; {6400#false} is VALID [2018-11-14 16:53:59,339 INFO L273 TraceCheckUtils]: 52: Hoare triple {6400#false} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647; {6400#false} is VALID [2018-11-14 16:53:59,340 INFO L273 TraceCheckUtils]: 53: Hoare triple {6400#false} assume !(#t~ret8 == 0);havoc #t~mem7;havoc #t~ret8; {6400#false} is VALID [2018-11-14 16:53:59,340 INFO L273 TraceCheckUtils]: 54: Hoare triple {6400#false} #t~post6 := ~v~0;~v~0 := #t~post6 + 1;havoc #t~post6; {6400#false} is VALID [2018-11-14 16:53:59,340 INFO L273 TraceCheckUtils]: 55: Hoare triple {6400#false} assume true; {6400#false} is VALID [2018-11-14 16:53:59,340 INFO L273 TraceCheckUtils]: 56: Hoare triple {6400#false} assume !!(~v~0 < 100000);call #t~mem7 := read~int(~#values~0.base, ~#values~0.offset + ~v~0 * 4, 4); {6400#false} is VALID [2018-11-14 16:53:59,340 INFO L256 TraceCheckUtils]: 57: Hoare triple {6400#false} call #t~ret8 := elem_exists(~#set~0.base, ~#set~0.offset, ~n~0, #t~mem7); {6399#true} is VALID [2018-11-14 16:53:59,341 INFO L273 TraceCheckUtils]: 58: Hoare triple {6399#true} ~set.base, ~set.offset := #in~set.base, #in~set.offset;~size := #in~size;~value := #in~value;havoc ~i~0;~i~0 := 0; {6399#true} is VALID [2018-11-14 16:53:59,341 INFO L273 TraceCheckUtils]: 59: Hoare triple {6399#true} assume true; {6399#true} is VALID [2018-11-14 16:53:59,341 INFO L273 TraceCheckUtils]: 60: Hoare triple {6399#true} assume !!(~i~0 < ~size);call #t~mem1 := read~int(~set.base, ~set.offset + ~i~0 * 4, 4); {6399#true} is VALID [2018-11-14 16:53:59,341 INFO L273 TraceCheckUtils]: 61: Hoare triple {6399#true} assume #t~mem1 == ~value;havoc #t~mem1;#res := 1; {6399#true} is VALID [2018-11-14 16:53:59,341 INFO L273 TraceCheckUtils]: 62: Hoare triple {6399#true} assume true; {6399#true} is VALID [2018-11-14 16:53:59,342 INFO L268 TraceCheckUtils]: 63: Hoare quadruple {6399#true} {6400#false} #132#return; {6400#false} is VALID [2018-11-14 16:53:59,342 INFO L273 TraceCheckUtils]: 64: Hoare triple {6400#false} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647; {6400#false} is VALID [2018-11-14 16:53:59,342 INFO L273 TraceCheckUtils]: 65: Hoare triple {6400#false} assume !(#t~ret8 == 0);havoc #t~mem7;havoc #t~ret8; {6400#false} is VALID [2018-11-14 16:53:59,342 INFO L273 TraceCheckUtils]: 66: Hoare triple {6400#false} #t~post6 := ~v~0;~v~0 := #t~post6 + 1;havoc #t~post6; {6400#false} is VALID [2018-11-14 16:53:59,342 INFO L273 TraceCheckUtils]: 67: Hoare triple {6400#false} assume true; {6400#false} is VALID [2018-11-14 16:53:59,343 INFO L273 TraceCheckUtils]: 68: Hoare triple {6400#false} assume !!(~v~0 < 100000);call #t~mem7 := read~int(~#values~0.base, ~#values~0.offset + ~v~0 * 4, 4); {6400#false} is VALID [2018-11-14 16:53:59,343 INFO L256 TraceCheckUtils]: 69: Hoare triple {6400#false} call #t~ret8 := elem_exists(~#set~0.base, ~#set~0.offset, ~n~0, #t~mem7); {6399#true} is VALID [2018-11-14 16:53:59,343 INFO L273 TraceCheckUtils]: 70: Hoare triple {6399#true} ~set.base, ~set.offset := #in~set.base, #in~set.offset;~size := #in~size;~value := #in~value;havoc ~i~0;~i~0 := 0; {6399#true} is VALID [2018-11-14 16:53:59,343 INFO L273 TraceCheckUtils]: 71: Hoare triple {6399#true} assume true; {6399#true} is VALID [2018-11-14 16:53:59,343 INFO L273 TraceCheckUtils]: 72: Hoare triple {6399#true} assume !!(~i~0 < ~size);call #t~mem1 := read~int(~set.base, ~set.offset + ~i~0 * 4, 4); {6399#true} is VALID [2018-11-14 16:53:59,344 INFO L273 TraceCheckUtils]: 73: Hoare triple {6399#true} assume #t~mem1 == ~value;havoc #t~mem1;#res := 1; {6399#true} is VALID [2018-11-14 16:53:59,344 INFO L273 TraceCheckUtils]: 74: Hoare triple {6399#true} assume true; {6399#true} is VALID [2018-11-14 16:53:59,344 INFO L268 TraceCheckUtils]: 75: Hoare quadruple {6399#true} {6400#false} #132#return; {6400#false} is VALID [2018-11-14 16:53:59,344 INFO L273 TraceCheckUtils]: 76: Hoare triple {6400#false} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647; {6400#false} is VALID [2018-11-14 16:53:59,344 INFO L273 TraceCheckUtils]: 77: Hoare triple {6400#false} assume !(#t~ret8 == 0);havoc #t~mem7;havoc #t~ret8; {6400#false} is VALID [2018-11-14 16:53:59,345 INFO L273 TraceCheckUtils]: 78: Hoare triple {6400#false} #t~post6 := ~v~0;~v~0 := #t~post6 + 1;havoc #t~post6; {6400#false} is VALID [2018-11-14 16:53:59,345 INFO L273 TraceCheckUtils]: 79: Hoare triple {6400#false} assume true; {6400#false} is VALID [2018-11-14 16:53:59,345 INFO L273 TraceCheckUtils]: 80: Hoare triple {6400#false} assume !!(~v~0 < 100000);call #t~mem7 := read~int(~#values~0.base, ~#values~0.offset + ~v~0 * 4, 4); {6400#false} is VALID [2018-11-14 16:53:59,345 INFO L256 TraceCheckUtils]: 81: Hoare triple {6400#false} call #t~ret8 := elem_exists(~#set~0.base, ~#set~0.offset, ~n~0, #t~mem7); {6399#true} is VALID [2018-11-14 16:53:59,346 INFO L273 TraceCheckUtils]: 82: Hoare triple {6399#true} ~set.base, ~set.offset := #in~set.base, #in~set.offset;~size := #in~size;~value := #in~value;havoc ~i~0;~i~0 := 0; {6399#true} is VALID [2018-11-14 16:53:59,346 INFO L273 TraceCheckUtils]: 83: Hoare triple {6399#true} assume true; {6399#true} is VALID [2018-11-14 16:53:59,346 INFO L273 TraceCheckUtils]: 84: Hoare triple {6399#true} assume !!(~i~0 < ~size);call #t~mem1 := read~int(~set.base, ~set.offset + ~i~0 * 4, 4); {6399#true} is VALID [2018-11-14 16:53:59,346 INFO L273 TraceCheckUtils]: 85: Hoare triple {6399#true} assume #t~mem1 == ~value;havoc #t~mem1;#res := 1; {6399#true} is VALID [2018-11-14 16:53:59,346 INFO L273 TraceCheckUtils]: 86: Hoare triple {6399#true} assume true; {6399#true} is VALID [2018-11-14 16:53:59,347 INFO L268 TraceCheckUtils]: 87: Hoare quadruple {6399#true} {6400#false} #132#return; {6400#false} is VALID [2018-11-14 16:53:59,347 INFO L273 TraceCheckUtils]: 88: Hoare triple {6400#false} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647; {6400#false} is VALID [2018-11-14 16:53:59,347 INFO L273 TraceCheckUtils]: 89: Hoare triple {6400#false} assume !(#t~ret8 == 0);havoc #t~mem7;havoc #t~ret8; {6400#false} is VALID [2018-11-14 16:53:59,347 INFO L273 TraceCheckUtils]: 90: Hoare triple {6400#false} #t~post6 := ~v~0;~v~0 := #t~post6 + 1;havoc #t~post6; {6400#false} is VALID [2018-11-14 16:53:59,347 INFO L273 TraceCheckUtils]: 91: Hoare triple {6400#false} assume true; {6400#false} is VALID [2018-11-14 16:53:59,348 INFO L273 TraceCheckUtils]: 92: Hoare triple {6400#false} assume !!(~v~0 < 100000);call #t~mem7 := read~int(~#values~0.base, ~#values~0.offset + ~v~0 * 4, 4); {6400#false} is VALID [2018-11-14 16:53:59,348 INFO L256 TraceCheckUtils]: 93: Hoare triple {6400#false} call #t~ret8 := elem_exists(~#set~0.base, ~#set~0.offset, ~n~0, #t~mem7); {6399#true} is VALID [2018-11-14 16:53:59,348 INFO L273 TraceCheckUtils]: 94: Hoare triple {6399#true} ~set.base, ~set.offset := #in~set.base, #in~set.offset;~size := #in~size;~value := #in~value;havoc ~i~0;~i~0 := 0; {6399#true} is VALID [2018-11-14 16:53:59,348 INFO L273 TraceCheckUtils]: 95: Hoare triple {6399#true} assume true; {6399#true} is VALID [2018-11-14 16:53:59,348 INFO L273 TraceCheckUtils]: 96: Hoare triple {6399#true} assume !!(~i~0 < ~size);call #t~mem1 := read~int(~set.base, ~set.offset + ~i~0 * 4, 4); {6399#true} is VALID [2018-11-14 16:53:59,349 INFO L273 TraceCheckUtils]: 97: Hoare triple {6399#true} assume #t~mem1 == ~value;havoc #t~mem1;#res := 1; {6399#true} is VALID [2018-11-14 16:53:59,349 INFO L273 TraceCheckUtils]: 98: Hoare triple {6399#true} assume true; {6399#true} is VALID [2018-11-14 16:53:59,349 INFO L268 TraceCheckUtils]: 99: Hoare quadruple {6399#true} {6400#false} #132#return; {6400#false} is VALID [2018-11-14 16:53:59,349 INFO L273 TraceCheckUtils]: 100: Hoare triple {6400#false} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647; {6400#false} is VALID [2018-11-14 16:53:59,349 INFO L273 TraceCheckUtils]: 101: Hoare triple {6400#false} assume !(#t~ret8 == 0);havoc #t~mem7;havoc #t~ret8; {6400#false} is VALID [2018-11-14 16:53:59,350 INFO L273 TraceCheckUtils]: 102: Hoare triple {6400#false} #t~post6 := ~v~0;~v~0 := #t~post6 + 1;havoc #t~post6; {6400#false} is VALID [2018-11-14 16:53:59,350 INFO L273 TraceCheckUtils]: 103: Hoare triple {6400#false} assume true; {6400#false} is VALID [2018-11-14 16:53:59,350 INFO L273 TraceCheckUtils]: 104: Hoare triple {6400#false} assume !(~v~0 < 100000); {6400#false} is VALID [2018-11-14 16:53:59,350 INFO L273 TraceCheckUtils]: 105: Hoare triple {6400#false} ~x~0 := 0; {6400#false} is VALID [2018-11-14 16:53:59,350 INFO L273 TraceCheckUtils]: 106: Hoare triple {6400#false} assume true; {6400#false} is VALID [2018-11-14 16:53:59,351 INFO L273 TraceCheckUtils]: 107: Hoare triple {6400#false} assume !!(~x~0 < ~n~0);~y~0 := ~x~0 + 1; {6400#false} is VALID [2018-11-14 16:53:59,351 INFO L273 TraceCheckUtils]: 108: Hoare triple {6400#false} assume true; {6400#false} is VALID [2018-11-14 16:53:59,351 INFO L273 TraceCheckUtils]: 109: Hoare triple {6400#false} assume !!(~y~0 < ~n~0);call #t~mem13 := read~int(~#set~0.base, ~#set~0.offset + ~x~0 * 4, 4);call #t~mem14 := read~int(~#set~0.base, ~#set~0.offset + ~y~0 * 4, 4); {6400#false} is VALID [2018-11-14 16:53:59,351 INFO L256 TraceCheckUtils]: 110: Hoare triple {6400#false} call __VERIFIER_assert((if #t~mem13 != #t~mem14 then 1 else 0)); {6400#false} is VALID [2018-11-14 16:53:59,352 INFO L273 TraceCheckUtils]: 111: Hoare triple {6400#false} ~cond := #in~cond; {6400#false} is VALID [2018-11-14 16:53:59,352 INFO L273 TraceCheckUtils]: 112: Hoare triple {6400#false} assume ~cond == 0; {6400#false} is VALID [2018-11-14 16:53:59,352 INFO L273 TraceCheckUtils]: 113: Hoare triple {6400#false} assume !false; {6400#false} is VALID [2018-11-14 16:53:59,363 INFO L134 CoverageAnalysis]: Checked inductivity of 265 backedges. 66 proven. 10 refuted. 0 times theorem prover too weak. 189 trivial. 0 not checked. [2018-11-14 16:53:59,363 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-14 16:53:59,364 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-14 16:53:59,372 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-11-14 16:53:59,417 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2018-11-14 16:53:59,417 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-14 16:53:59,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:53:59,449 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 16:53:59,567 INFO L256 TraceCheckUtils]: 0: Hoare triple {6399#true} call ULTIMATE.init(); {6399#true} is VALID [2018-11-14 16:53:59,568 INFO L273 TraceCheckUtils]: 1: Hoare triple {6399#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {6399#true} is VALID [2018-11-14 16:53:59,568 INFO L273 TraceCheckUtils]: 2: Hoare triple {6399#true} assume true; {6399#true} is VALID [2018-11-14 16:53:59,569 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {6399#true} {6399#true} #126#return; {6399#true} is VALID [2018-11-14 16:53:59,569 INFO L256 TraceCheckUtils]: 4: Hoare triple {6399#true} call #t~ret15 := main(); {6399#true} is VALID [2018-11-14 16:53:59,569 INFO L273 TraceCheckUtils]: 5: Hoare triple {6399#true} ~n~0 := 0;call ~#set~0.base, ~#set~0.offset := #Ultimate.alloc(400000);havoc ~x~0;havoc ~y~0;~x~0 := 0; {6399#true} is VALID [2018-11-14 16:53:59,569 INFO L273 TraceCheckUtils]: 6: Hoare triple {6399#true} assume true; {6399#true} is VALID [2018-11-14 16:53:59,570 INFO L273 TraceCheckUtils]: 7: Hoare triple {6399#true} assume !(~x~0 < ~n~0); {6399#true} is VALID [2018-11-14 16:53:59,570 INFO L273 TraceCheckUtils]: 8: Hoare triple {6399#true} call ~#values~0.base, ~#values~0.offset := #Ultimate.alloc(400000);havoc ~v~0;~v~0 := 0; {6399#true} is VALID [2018-11-14 16:53:59,570 INFO L273 TraceCheckUtils]: 9: Hoare triple {6399#true} assume true; {6399#true} is VALID [2018-11-14 16:53:59,570 INFO L273 TraceCheckUtils]: 10: Hoare triple {6399#true} assume !!(~v~0 < 100000);call #t~mem7 := read~int(~#values~0.base, ~#values~0.offset + ~v~0 * 4, 4); {6399#true} is VALID [2018-11-14 16:53:59,570 INFO L256 TraceCheckUtils]: 11: Hoare triple {6399#true} call #t~ret8 := elem_exists(~#set~0.base, ~#set~0.offset, ~n~0, #t~mem7); {6399#true} is VALID [2018-11-14 16:53:59,570 INFO L273 TraceCheckUtils]: 12: Hoare triple {6399#true} ~set.base, ~set.offset := #in~set.base, #in~set.offset;~size := #in~size;~value := #in~value;havoc ~i~0;~i~0 := 0; {6399#true} is VALID [2018-11-14 16:53:59,570 INFO L273 TraceCheckUtils]: 13: Hoare triple {6399#true} assume true; {6399#true} is VALID [2018-11-14 16:53:59,571 INFO L273 TraceCheckUtils]: 14: Hoare triple {6399#true} assume !(~i~0 < ~size); {6399#true} is VALID [2018-11-14 16:53:59,571 INFO L273 TraceCheckUtils]: 15: Hoare triple {6399#true} #res := 0; {6399#true} is VALID [2018-11-14 16:53:59,571 INFO L273 TraceCheckUtils]: 16: Hoare triple {6399#true} assume true; {6399#true} is VALID [2018-11-14 16:53:59,571 INFO L268 TraceCheckUtils]: 17: Hoare quadruple {6399#true} {6399#true} #132#return; {6399#true} is VALID [2018-11-14 16:53:59,571 INFO L273 TraceCheckUtils]: 18: Hoare triple {6399#true} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647; {6399#true} is VALID [2018-11-14 16:53:59,571 INFO L273 TraceCheckUtils]: 19: Hoare triple {6399#true} assume #t~ret8 == 0;havoc #t~mem7;havoc #t~ret8;call #t~mem9 := read~int(~#values~0.base, ~#values~0.offset + ~v~0 * 4, 4); {6399#true} is VALID [2018-11-14 16:53:59,572 INFO L256 TraceCheckUtils]: 20: Hoare triple {6399#true} call #t~ret10 := insert(~#set~0.base, ~#set~0.offset, ~n~0, #t~mem9); {6399#true} is VALID [2018-11-14 16:53:59,572 INFO L273 TraceCheckUtils]: 21: Hoare triple {6399#true} ~set.base, ~set.offset := #in~set.base, #in~set.offset;~size := #in~size;~value := #in~value;call write~int(~value, ~set.base, ~set.offset + ~size * 4, 4);#res := ~size + 1; {6399#true} is VALID [2018-11-14 16:53:59,572 INFO L273 TraceCheckUtils]: 22: Hoare triple {6399#true} assume true; {6399#true} is VALID [2018-11-14 16:53:59,572 INFO L268 TraceCheckUtils]: 23: Hoare quadruple {6399#true} {6399#true} #134#return; {6399#true} is VALID [2018-11-14 16:53:59,572 INFO L273 TraceCheckUtils]: 24: Hoare triple {6399#true} assume -2147483648 <= #t~ret10 && #t~ret10 <= 2147483647;~n~0 := #t~ret10;havoc #t~ret10;havoc #t~mem9; {6399#true} is VALID [2018-11-14 16:53:59,572 INFO L273 TraceCheckUtils]: 25: Hoare triple {6399#true} #t~post6 := ~v~0;~v~0 := #t~post6 + 1;havoc #t~post6; {6399#true} is VALID [2018-11-14 16:53:59,573 INFO L273 TraceCheckUtils]: 26: Hoare triple {6399#true} assume true; {6399#true} is VALID [2018-11-14 16:53:59,573 INFO L273 TraceCheckUtils]: 27: Hoare triple {6399#true} assume !!(~v~0 < 100000);call #t~mem7 := read~int(~#values~0.base, ~#values~0.offset + ~v~0 * 4, 4); {6399#true} is VALID [2018-11-14 16:53:59,573 INFO L256 TraceCheckUtils]: 28: Hoare triple {6399#true} call #t~ret8 := elem_exists(~#set~0.base, ~#set~0.offset, ~n~0, #t~mem7); {6399#true} is VALID [2018-11-14 16:53:59,573 INFO L273 TraceCheckUtils]: 29: Hoare triple {6399#true} ~set.base, ~set.offset := #in~set.base, #in~set.offset;~size := #in~size;~value := #in~value;havoc ~i~0;~i~0 := 0; {6399#true} is VALID [2018-11-14 16:53:59,573 INFO L273 TraceCheckUtils]: 30: Hoare triple {6399#true} assume true; {6399#true} is VALID [2018-11-14 16:53:59,573 INFO L273 TraceCheckUtils]: 31: Hoare triple {6399#true} assume !!(~i~0 < ~size);call #t~mem1 := read~int(~set.base, ~set.offset + ~i~0 * 4, 4); {6399#true} is VALID [2018-11-14 16:53:59,574 INFO L273 TraceCheckUtils]: 32: Hoare triple {6399#true} assume #t~mem1 == ~value;havoc #t~mem1;#res := 1; {6502#(<= 1 |elem_exists_#res|)} is VALID [2018-11-14 16:53:59,574 INFO L273 TraceCheckUtils]: 33: Hoare triple {6502#(<= 1 |elem_exists_#res|)} assume true; {6502#(<= 1 |elem_exists_#res|)} is VALID [2018-11-14 16:53:59,576 INFO L268 TraceCheckUtils]: 34: Hoare quadruple {6502#(<= 1 |elem_exists_#res|)} {6399#true} #132#return; {6509#(<= 1 |main_#t~ret8|)} is VALID [2018-11-14 16:53:59,577 INFO L273 TraceCheckUtils]: 35: Hoare triple {6509#(<= 1 |main_#t~ret8|)} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647; {6509#(<= 1 |main_#t~ret8|)} is VALID [2018-11-14 16:53:59,577 INFO L273 TraceCheckUtils]: 36: Hoare triple {6509#(<= 1 |main_#t~ret8|)} assume #t~ret8 == 0;havoc #t~mem7;havoc #t~ret8;call #t~mem9 := read~int(~#values~0.base, ~#values~0.offset + ~v~0 * 4, 4); {6400#false} is VALID [2018-11-14 16:53:59,577 INFO L256 TraceCheckUtils]: 37: Hoare triple {6400#false} call #t~ret10 := insert(~#set~0.base, ~#set~0.offset, ~n~0, #t~mem9); {6400#false} is VALID [2018-11-14 16:53:59,577 INFO L273 TraceCheckUtils]: 38: Hoare triple {6400#false} ~set.base, ~set.offset := #in~set.base, #in~set.offset;~size := #in~size;~value := #in~value;call write~int(~value, ~set.base, ~set.offset + ~size * 4, 4);#res := ~size + 1; {6400#false} is VALID [2018-11-14 16:53:59,578 INFO L273 TraceCheckUtils]: 39: Hoare triple {6400#false} assume true; {6400#false} is VALID [2018-11-14 16:53:59,578 INFO L268 TraceCheckUtils]: 40: Hoare quadruple {6400#false} {6400#false} #134#return; {6400#false} is VALID [2018-11-14 16:53:59,578 INFO L273 TraceCheckUtils]: 41: Hoare triple {6400#false} assume -2147483648 <= #t~ret10 && #t~ret10 <= 2147483647;~n~0 := #t~ret10;havoc #t~ret10;havoc #t~mem9; {6400#false} is VALID [2018-11-14 16:53:59,578 INFO L273 TraceCheckUtils]: 42: Hoare triple {6400#false} #t~post6 := ~v~0;~v~0 := #t~post6 + 1;havoc #t~post6; {6400#false} is VALID [2018-11-14 16:53:59,579 INFO L273 TraceCheckUtils]: 43: Hoare triple {6400#false} assume true; {6400#false} is VALID [2018-11-14 16:53:59,579 INFO L273 TraceCheckUtils]: 44: Hoare triple {6400#false} assume !!(~v~0 < 100000);call #t~mem7 := read~int(~#values~0.base, ~#values~0.offset + ~v~0 * 4, 4); {6400#false} is VALID [2018-11-14 16:53:59,579 INFO L256 TraceCheckUtils]: 45: Hoare triple {6400#false} call #t~ret8 := elem_exists(~#set~0.base, ~#set~0.offset, ~n~0, #t~mem7); {6400#false} is VALID [2018-11-14 16:53:59,579 INFO L273 TraceCheckUtils]: 46: Hoare triple {6400#false} ~set.base, ~set.offset := #in~set.base, #in~set.offset;~size := #in~size;~value := #in~value;havoc ~i~0;~i~0 := 0; {6400#false} is VALID [2018-11-14 16:53:59,580 INFO L273 TraceCheckUtils]: 47: Hoare triple {6400#false} assume true; {6400#false} is VALID [2018-11-14 16:53:59,580 INFO L273 TraceCheckUtils]: 48: Hoare triple {6400#false} assume !!(~i~0 < ~size);call #t~mem1 := read~int(~set.base, ~set.offset + ~i~0 * 4, 4); {6400#false} is VALID [2018-11-14 16:53:59,580 INFO L273 TraceCheckUtils]: 49: Hoare triple {6400#false} assume #t~mem1 == ~value;havoc #t~mem1;#res := 1; {6400#false} is VALID [2018-11-14 16:53:59,580 INFO L273 TraceCheckUtils]: 50: Hoare triple {6400#false} assume true; {6400#false} is VALID [2018-11-14 16:53:59,580 INFO L268 TraceCheckUtils]: 51: Hoare quadruple {6400#false} {6400#false} #132#return; {6400#false} is VALID [2018-11-14 16:53:59,580 INFO L273 TraceCheckUtils]: 52: Hoare triple {6400#false} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647; {6400#false} is VALID [2018-11-14 16:53:59,581 INFO L273 TraceCheckUtils]: 53: Hoare triple {6400#false} assume !(#t~ret8 == 0);havoc #t~mem7;havoc #t~ret8; {6400#false} is VALID [2018-11-14 16:53:59,581 INFO L273 TraceCheckUtils]: 54: Hoare triple {6400#false} #t~post6 := ~v~0;~v~0 := #t~post6 + 1;havoc #t~post6; {6400#false} is VALID [2018-11-14 16:53:59,581 INFO L273 TraceCheckUtils]: 55: Hoare triple {6400#false} assume true; {6400#false} is VALID [2018-11-14 16:53:59,581 INFO L273 TraceCheckUtils]: 56: Hoare triple {6400#false} assume !!(~v~0 < 100000);call #t~mem7 := read~int(~#values~0.base, ~#values~0.offset + ~v~0 * 4, 4); {6400#false} is VALID [2018-11-14 16:53:59,581 INFO L256 TraceCheckUtils]: 57: Hoare triple {6400#false} call #t~ret8 := elem_exists(~#set~0.base, ~#set~0.offset, ~n~0, #t~mem7); {6400#false} is VALID [2018-11-14 16:53:59,581 INFO L273 TraceCheckUtils]: 58: Hoare triple {6400#false} ~set.base, ~set.offset := #in~set.base, #in~set.offset;~size := #in~size;~value := #in~value;havoc ~i~0;~i~0 := 0; {6400#false} is VALID [2018-11-14 16:53:59,581 INFO L273 TraceCheckUtils]: 59: Hoare triple {6400#false} assume true; {6400#false} is VALID [2018-11-14 16:53:59,582 INFO L273 TraceCheckUtils]: 60: Hoare triple {6400#false} assume !!(~i~0 < ~size);call #t~mem1 := read~int(~set.base, ~set.offset + ~i~0 * 4, 4); {6400#false} is VALID [2018-11-14 16:53:59,582 INFO L273 TraceCheckUtils]: 61: Hoare triple {6400#false} assume #t~mem1 == ~value;havoc #t~mem1;#res := 1; {6400#false} is VALID [2018-11-14 16:53:59,582 INFO L273 TraceCheckUtils]: 62: Hoare triple {6400#false} assume true; {6400#false} is VALID [2018-11-14 16:53:59,582 INFO L268 TraceCheckUtils]: 63: Hoare quadruple {6400#false} {6400#false} #132#return; {6400#false} is VALID [2018-11-14 16:53:59,582 INFO L273 TraceCheckUtils]: 64: Hoare triple {6400#false} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647; {6400#false} is VALID [2018-11-14 16:53:59,582 INFO L273 TraceCheckUtils]: 65: Hoare triple {6400#false} assume !(#t~ret8 == 0);havoc #t~mem7;havoc #t~ret8; {6400#false} is VALID [2018-11-14 16:53:59,583 INFO L273 TraceCheckUtils]: 66: Hoare triple {6400#false} #t~post6 := ~v~0;~v~0 := #t~post6 + 1;havoc #t~post6; {6400#false} is VALID [2018-11-14 16:53:59,583 INFO L273 TraceCheckUtils]: 67: Hoare triple {6400#false} assume true; {6400#false} is VALID [2018-11-14 16:53:59,583 INFO L273 TraceCheckUtils]: 68: Hoare triple {6400#false} assume !!(~v~0 < 100000);call #t~mem7 := read~int(~#values~0.base, ~#values~0.offset + ~v~0 * 4, 4); {6400#false} is VALID [2018-11-14 16:53:59,583 INFO L256 TraceCheckUtils]: 69: Hoare triple {6400#false} call #t~ret8 := elem_exists(~#set~0.base, ~#set~0.offset, ~n~0, #t~mem7); {6400#false} is VALID [2018-11-14 16:53:59,583 INFO L273 TraceCheckUtils]: 70: Hoare triple {6400#false} ~set.base, ~set.offset := #in~set.base, #in~set.offset;~size := #in~size;~value := #in~value;havoc ~i~0;~i~0 := 0; {6400#false} is VALID [2018-11-14 16:53:59,583 INFO L273 TraceCheckUtils]: 71: Hoare triple {6400#false} assume true; {6400#false} is VALID [2018-11-14 16:53:59,583 INFO L273 TraceCheckUtils]: 72: Hoare triple {6400#false} assume !!(~i~0 < ~size);call #t~mem1 := read~int(~set.base, ~set.offset + ~i~0 * 4, 4); {6400#false} is VALID [2018-11-14 16:53:59,584 INFO L273 TraceCheckUtils]: 73: Hoare triple {6400#false} assume #t~mem1 == ~value;havoc #t~mem1;#res := 1; {6400#false} is VALID [2018-11-14 16:53:59,584 INFO L273 TraceCheckUtils]: 74: Hoare triple {6400#false} assume true; {6400#false} is VALID [2018-11-14 16:53:59,584 INFO L268 TraceCheckUtils]: 75: Hoare quadruple {6400#false} {6400#false} #132#return; {6400#false} is VALID [2018-11-14 16:53:59,584 INFO L273 TraceCheckUtils]: 76: Hoare triple {6400#false} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647; {6400#false} is VALID [2018-11-14 16:53:59,584 INFO L273 TraceCheckUtils]: 77: Hoare triple {6400#false} assume !(#t~ret8 == 0);havoc #t~mem7;havoc #t~ret8; {6400#false} is VALID [2018-11-14 16:53:59,584 INFO L273 TraceCheckUtils]: 78: Hoare triple {6400#false} #t~post6 := ~v~0;~v~0 := #t~post6 + 1;havoc #t~post6; {6400#false} is VALID [2018-11-14 16:53:59,585 INFO L273 TraceCheckUtils]: 79: Hoare triple {6400#false} assume true; {6400#false} is VALID [2018-11-14 16:53:59,585 INFO L273 TraceCheckUtils]: 80: Hoare triple {6400#false} assume !!(~v~0 < 100000);call #t~mem7 := read~int(~#values~0.base, ~#values~0.offset + ~v~0 * 4, 4); {6400#false} is VALID [2018-11-14 16:53:59,585 INFO L256 TraceCheckUtils]: 81: Hoare triple {6400#false} call #t~ret8 := elem_exists(~#set~0.base, ~#set~0.offset, ~n~0, #t~mem7); {6400#false} is VALID [2018-11-14 16:53:59,585 INFO L273 TraceCheckUtils]: 82: Hoare triple {6400#false} ~set.base, ~set.offset := #in~set.base, #in~set.offset;~size := #in~size;~value := #in~value;havoc ~i~0;~i~0 := 0; {6400#false} is VALID [2018-11-14 16:53:59,585 INFO L273 TraceCheckUtils]: 83: Hoare triple {6400#false} assume true; {6400#false} is VALID [2018-11-14 16:53:59,585 INFO L273 TraceCheckUtils]: 84: Hoare triple {6400#false} assume !!(~i~0 < ~size);call #t~mem1 := read~int(~set.base, ~set.offset + ~i~0 * 4, 4); {6400#false} is VALID [2018-11-14 16:53:59,585 INFO L273 TraceCheckUtils]: 85: Hoare triple {6400#false} assume #t~mem1 == ~value;havoc #t~mem1;#res := 1; {6400#false} is VALID [2018-11-14 16:53:59,586 INFO L273 TraceCheckUtils]: 86: Hoare triple {6400#false} assume true; {6400#false} is VALID [2018-11-14 16:53:59,586 INFO L268 TraceCheckUtils]: 87: Hoare quadruple {6400#false} {6400#false} #132#return; {6400#false} is VALID [2018-11-14 16:53:59,586 INFO L273 TraceCheckUtils]: 88: Hoare triple {6400#false} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647; {6400#false} is VALID [2018-11-14 16:53:59,586 INFO L273 TraceCheckUtils]: 89: Hoare triple {6400#false} assume !(#t~ret8 == 0);havoc #t~mem7;havoc #t~ret8; {6400#false} is VALID [2018-11-14 16:53:59,586 INFO L273 TraceCheckUtils]: 90: Hoare triple {6400#false} #t~post6 := ~v~0;~v~0 := #t~post6 + 1;havoc #t~post6; {6400#false} is VALID [2018-11-14 16:53:59,586 INFO L273 TraceCheckUtils]: 91: Hoare triple {6400#false} assume true; {6400#false} is VALID [2018-11-14 16:53:59,586 INFO L273 TraceCheckUtils]: 92: Hoare triple {6400#false} assume !!(~v~0 < 100000);call #t~mem7 := read~int(~#values~0.base, ~#values~0.offset + ~v~0 * 4, 4); {6400#false} is VALID [2018-11-14 16:53:59,587 INFO L256 TraceCheckUtils]: 93: Hoare triple {6400#false} call #t~ret8 := elem_exists(~#set~0.base, ~#set~0.offset, ~n~0, #t~mem7); {6400#false} is VALID [2018-11-14 16:53:59,587 INFO L273 TraceCheckUtils]: 94: Hoare triple {6400#false} ~set.base, ~set.offset := #in~set.base, #in~set.offset;~size := #in~size;~value := #in~value;havoc ~i~0;~i~0 := 0; {6400#false} is VALID [2018-11-14 16:53:59,587 INFO L273 TraceCheckUtils]: 95: Hoare triple {6400#false} assume true; {6400#false} is VALID [2018-11-14 16:53:59,587 INFO L273 TraceCheckUtils]: 96: Hoare triple {6400#false} assume !!(~i~0 < ~size);call #t~mem1 := read~int(~set.base, ~set.offset + ~i~0 * 4, 4); {6400#false} is VALID [2018-11-14 16:53:59,587 INFO L273 TraceCheckUtils]: 97: Hoare triple {6400#false} assume #t~mem1 == ~value;havoc #t~mem1;#res := 1; {6400#false} is VALID [2018-11-14 16:53:59,587 INFO L273 TraceCheckUtils]: 98: Hoare triple {6400#false} assume true; {6400#false} is VALID [2018-11-14 16:53:59,587 INFO L268 TraceCheckUtils]: 99: Hoare quadruple {6400#false} {6400#false} #132#return; {6400#false} is VALID [2018-11-14 16:53:59,588 INFO L273 TraceCheckUtils]: 100: Hoare triple {6400#false} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647; {6400#false} is VALID [2018-11-14 16:53:59,588 INFO L273 TraceCheckUtils]: 101: Hoare triple {6400#false} assume !(#t~ret8 == 0);havoc #t~mem7;havoc #t~ret8; {6400#false} is VALID [2018-11-14 16:53:59,588 INFO L273 TraceCheckUtils]: 102: Hoare triple {6400#false} #t~post6 := ~v~0;~v~0 := #t~post6 + 1;havoc #t~post6; {6400#false} is VALID [2018-11-14 16:53:59,588 INFO L273 TraceCheckUtils]: 103: Hoare triple {6400#false} assume true; {6400#false} is VALID [2018-11-14 16:53:59,588 INFO L273 TraceCheckUtils]: 104: Hoare triple {6400#false} assume !(~v~0 < 100000); {6400#false} is VALID [2018-11-14 16:53:59,588 INFO L273 TraceCheckUtils]: 105: Hoare triple {6400#false} ~x~0 := 0; {6400#false} is VALID [2018-11-14 16:53:59,588 INFO L273 TraceCheckUtils]: 106: Hoare triple {6400#false} assume true; {6400#false} is VALID [2018-11-14 16:53:59,589 INFO L273 TraceCheckUtils]: 107: Hoare triple {6400#false} assume !!(~x~0 < ~n~0);~y~0 := ~x~0 + 1; {6400#false} is VALID [2018-11-14 16:53:59,589 INFO L273 TraceCheckUtils]: 108: Hoare triple {6400#false} assume true; {6400#false} is VALID [2018-11-14 16:53:59,589 INFO L273 TraceCheckUtils]: 109: Hoare triple {6400#false} assume !!(~y~0 < ~n~0);call #t~mem13 := read~int(~#set~0.base, ~#set~0.offset + ~x~0 * 4, 4);call #t~mem14 := read~int(~#set~0.base, ~#set~0.offset + ~y~0 * 4, 4); {6400#false} is VALID [2018-11-14 16:53:59,589 INFO L256 TraceCheckUtils]: 110: Hoare triple {6400#false} call __VERIFIER_assert((if #t~mem13 != #t~mem14 then 1 else 0)); {6400#false} is VALID [2018-11-14 16:53:59,589 INFO L273 TraceCheckUtils]: 111: Hoare triple {6400#false} ~cond := #in~cond; {6400#false} is VALID [2018-11-14 16:53:59,589 INFO L273 TraceCheckUtils]: 112: Hoare triple {6400#false} assume ~cond == 0; {6400#false} is VALID [2018-11-14 16:53:59,589 INFO L273 TraceCheckUtils]: 113: Hoare triple {6400#false} assume !false; {6400#false} is VALID [2018-11-14 16:53:59,599 INFO L134 CoverageAnalysis]: Checked inductivity of 265 backedges. 124 proven. 0 refuted. 0 times theorem prover too weak. 141 trivial. 0 not checked. [2018-11-14 16:53:59,620 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-14 16:53:59,620 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 6 [2018-11-14 16:53:59,621 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 114 [2018-11-14 16:53:59,628 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 16:53:59,628 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2018-11-14 16:53:59,723 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 69 edges. 69 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 16:53:59,723 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-14 16:53:59,723 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-14 16:53:59,723 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-11-14 16:53:59,724 INFO L87 Difference]: Start difference. First operand 194 states and 264 transitions. Second operand 6 states. [2018-11-14 16:54:00,287 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:54:00,288 INFO L93 Difference]: Finished difference Result 332 states and 448 transitions. [2018-11-14 16:54:00,288 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-14 16:54:00,288 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 114 [2018-11-14 16:54:00,288 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 16:54:00,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-14 16:54:00,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 91 transitions. [2018-11-14 16:54:00,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-14 16:54:00,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 91 transitions. [2018-11-14 16:54:00,292 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 91 transitions. [2018-11-14 16:54:00,461 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 91 edges. 91 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 16:54:00,467 INFO L225 Difference]: With dead ends: 332 [2018-11-14 16:54:00,467 INFO L226 Difference]: Without dead ends: 194 [2018-11-14 16:54:00,469 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 113 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-11-14 16:54:00,469 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 194 states. [2018-11-14 16:54:00,981 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 194 to 190. [2018-11-14 16:54:00,981 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 16:54:00,981 INFO L82 GeneralOperation]: Start isEquivalent. First operand 194 states. Second operand 190 states. [2018-11-14 16:54:00,981 INFO L74 IsIncluded]: Start isIncluded. First operand 194 states. Second operand 190 states. [2018-11-14 16:54:00,981 INFO L87 Difference]: Start difference. First operand 194 states. Second operand 190 states. [2018-11-14 16:54:00,991 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:54:00,991 INFO L93 Difference]: Finished difference Result 194 states and 247 transitions. [2018-11-14 16:54:00,992 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 247 transitions. [2018-11-14 16:54:00,993 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:54:00,993 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:54:00,993 INFO L74 IsIncluded]: Start isIncluded. First operand 190 states. Second operand 194 states. [2018-11-14 16:54:00,993 INFO L87 Difference]: Start difference. First operand 190 states. Second operand 194 states. [2018-11-14 16:54:01,002 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:54:01,002 INFO L93 Difference]: Finished difference Result 194 states and 247 transitions. [2018-11-14 16:54:01,002 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 247 transitions. [2018-11-14 16:54:01,003 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:54:01,004 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:54:01,004 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 16:54:01,004 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 16:54:01,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 190 states. [2018-11-14 16:54:01,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 190 states to 190 states and 243 transitions. [2018-11-14 16:54:01,012 INFO L78 Accepts]: Start accepts. Automaton has 190 states and 243 transitions. Word has length 114 [2018-11-14 16:54:01,012 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 16:54:01,012 INFO L480 AbstractCegarLoop]: Abstraction has 190 states and 243 transitions. [2018-11-14 16:54:01,012 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-14 16:54:01,012 INFO L276 IsEmpty]: Start isEmpty. Operand 190 states and 243 transitions. [2018-11-14 16:54:01,014 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2018-11-14 16:54:01,014 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 16:54:01,014 INFO L375 BasicCegarLoop]: trace histogram [8, 8, 7, 7, 7, 7, 7, 7, 7, 6, 5, 5, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 16:54:01,015 INFO L423 AbstractCegarLoop]: === Iteration 10 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 16:54:01,015 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 16:54:01,015 INFO L82 PathProgramCache]: Analyzing trace with hash -811874770, now seen corresponding path program 1 times [2018-11-14 16:54:01,015 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 16:54:01,015 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 16:54:01,016 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 16:54:01,016 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-14 16:54:01,016 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 16:54:01,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:54:01,506 INFO L256 TraceCheckUtils]: 0: Hoare triple {7819#true} call ULTIMATE.init(); {7819#true} is VALID [2018-11-14 16:54:01,506 INFO L273 TraceCheckUtils]: 1: Hoare triple {7819#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {7819#true} is VALID [2018-11-14 16:54:01,506 INFO L273 TraceCheckUtils]: 2: Hoare triple {7819#true} assume true; {7819#true} is VALID [2018-11-14 16:54:01,507 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {7819#true} {7819#true} #126#return; {7819#true} is VALID [2018-11-14 16:54:01,507 INFO L256 TraceCheckUtils]: 4: Hoare triple {7819#true} call #t~ret15 := main(); {7819#true} is VALID [2018-11-14 16:54:01,507 INFO L273 TraceCheckUtils]: 5: Hoare triple {7819#true} ~n~0 := 0;call ~#set~0.base, ~#set~0.offset := #Ultimate.alloc(400000);havoc ~x~0;havoc ~y~0;~x~0 := 0; {7819#true} is VALID [2018-11-14 16:54:01,507 INFO L273 TraceCheckUtils]: 6: Hoare triple {7819#true} assume true; {7819#true} is VALID [2018-11-14 16:54:01,507 INFO L273 TraceCheckUtils]: 7: Hoare triple {7819#true} assume !(~x~0 < ~n~0); {7819#true} is VALID [2018-11-14 16:54:01,507 INFO L273 TraceCheckUtils]: 8: Hoare triple {7819#true} call ~#values~0.base, ~#values~0.offset := #Ultimate.alloc(400000);havoc ~v~0;~v~0 := 0; {7821#(= main_~v~0 0)} is VALID [2018-11-14 16:54:01,508 INFO L273 TraceCheckUtils]: 9: Hoare triple {7821#(= main_~v~0 0)} assume true; {7821#(= main_~v~0 0)} is VALID [2018-11-14 16:54:01,508 INFO L273 TraceCheckUtils]: 10: Hoare triple {7821#(= main_~v~0 0)} assume !!(~v~0 < 100000);call #t~mem7 := read~int(~#values~0.base, ~#values~0.offset + ~v~0 * 4, 4); {7821#(= main_~v~0 0)} is VALID [2018-11-14 16:54:01,508 INFO L256 TraceCheckUtils]: 11: Hoare triple {7821#(= main_~v~0 0)} call #t~ret8 := elem_exists(~#set~0.base, ~#set~0.offset, ~n~0, #t~mem7); {7819#true} is VALID [2018-11-14 16:54:01,508 INFO L273 TraceCheckUtils]: 12: Hoare triple {7819#true} ~set.base, ~set.offset := #in~set.base, #in~set.offset;~size := #in~size;~value := #in~value;havoc ~i~0;~i~0 := 0; {7819#true} is VALID [2018-11-14 16:54:01,508 INFO L273 TraceCheckUtils]: 13: Hoare triple {7819#true} assume true; {7819#true} is VALID [2018-11-14 16:54:01,509 INFO L273 TraceCheckUtils]: 14: Hoare triple {7819#true} assume !(~i~0 < ~size); {7819#true} is VALID [2018-11-14 16:54:01,509 INFO L273 TraceCheckUtils]: 15: Hoare triple {7819#true} #res := 0; {7819#true} is VALID [2018-11-14 16:54:01,509 INFO L273 TraceCheckUtils]: 16: Hoare triple {7819#true} assume true; {7819#true} is VALID [2018-11-14 16:54:01,509 INFO L268 TraceCheckUtils]: 17: Hoare quadruple {7819#true} {7821#(= main_~v~0 0)} #132#return; {7821#(= main_~v~0 0)} is VALID [2018-11-14 16:54:01,510 INFO L273 TraceCheckUtils]: 18: Hoare triple {7821#(= main_~v~0 0)} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647; {7821#(= main_~v~0 0)} is VALID [2018-11-14 16:54:01,510 INFO L273 TraceCheckUtils]: 19: Hoare triple {7821#(= main_~v~0 0)} assume #t~ret8 == 0;havoc #t~mem7;havoc #t~ret8;call #t~mem9 := read~int(~#values~0.base, ~#values~0.offset + ~v~0 * 4, 4); {7821#(= main_~v~0 0)} is VALID [2018-11-14 16:54:01,510 INFO L256 TraceCheckUtils]: 20: Hoare triple {7821#(= main_~v~0 0)} call #t~ret10 := insert(~#set~0.base, ~#set~0.offset, ~n~0, #t~mem9); {7819#true} is VALID [2018-11-14 16:54:01,510 INFO L273 TraceCheckUtils]: 21: Hoare triple {7819#true} ~set.base, ~set.offset := #in~set.base, #in~set.offset;~size := #in~size;~value := #in~value;call write~int(~value, ~set.base, ~set.offset + ~size * 4, 4);#res := ~size + 1; {7819#true} is VALID [2018-11-14 16:54:01,511 INFO L273 TraceCheckUtils]: 22: Hoare triple {7819#true} assume true; {7819#true} is VALID [2018-11-14 16:54:01,512 INFO L268 TraceCheckUtils]: 23: Hoare quadruple {7819#true} {7821#(= main_~v~0 0)} #134#return; {7821#(= main_~v~0 0)} is VALID [2018-11-14 16:54:01,512 INFO L273 TraceCheckUtils]: 24: Hoare triple {7821#(= main_~v~0 0)} assume -2147483648 <= #t~ret10 && #t~ret10 <= 2147483647;~n~0 := #t~ret10;havoc #t~ret10;havoc #t~mem9; {7821#(= main_~v~0 0)} is VALID [2018-11-14 16:54:01,512 INFO L273 TraceCheckUtils]: 25: Hoare triple {7821#(= main_~v~0 0)} #t~post6 := ~v~0;~v~0 := #t~post6 + 1;havoc #t~post6; {7822#(<= main_~v~0 1)} is VALID [2018-11-14 16:54:01,513 INFO L273 TraceCheckUtils]: 26: Hoare triple {7822#(<= main_~v~0 1)} assume true; {7822#(<= main_~v~0 1)} is VALID [2018-11-14 16:54:01,513 INFO L273 TraceCheckUtils]: 27: Hoare triple {7822#(<= main_~v~0 1)} assume !!(~v~0 < 100000);call #t~mem7 := read~int(~#values~0.base, ~#values~0.offset + ~v~0 * 4, 4); {7822#(<= main_~v~0 1)} is VALID [2018-11-14 16:54:01,513 INFO L256 TraceCheckUtils]: 28: Hoare triple {7822#(<= main_~v~0 1)} call #t~ret8 := elem_exists(~#set~0.base, ~#set~0.offset, ~n~0, #t~mem7); {7819#true} is VALID [2018-11-14 16:54:01,513 INFO L273 TraceCheckUtils]: 29: Hoare triple {7819#true} ~set.base, ~set.offset := #in~set.base, #in~set.offset;~size := #in~size;~value := #in~value;havoc ~i~0;~i~0 := 0; {7819#true} is VALID [2018-11-14 16:54:01,513 INFO L273 TraceCheckUtils]: 30: Hoare triple {7819#true} assume true; {7819#true} is VALID [2018-11-14 16:54:01,513 INFO L273 TraceCheckUtils]: 31: Hoare triple {7819#true} assume !!(~i~0 < ~size);call #t~mem1 := read~int(~set.base, ~set.offset + ~i~0 * 4, 4); {7819#true} is VALID [2018-11-14 16:54:01,514 INFO L273 TraceCheckUtils]: 32: Hoare triple {7819#true} assume #t~mem1 == ~value;havoc #t~mem1;#res := 1; {7819#true} is VALID [2018-11-14 16:54:01,514 INFO L273 TraceCheckUtils]: 33: Hoare triple {7819#true} assume true; {7819#true} is VALID [2018-11-14 16:54:01,514 INFO L268 TraceCheckUtils]: 34: Hoare quadruple {7819#true} {7822#(<= main_~v~0 1)} #132#return; {7822#(<= main_~v~0 1)} is VALID [2018-11-14 16:54:01,515 INFO L273 TraceCheckUtils]: 35: Hoare triple {7822#(<= main_~v~0 1)} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647; {7822#(<= main_~v~0 1)} is VALID [2018-11-14 16:54:01,515 INFO L273 TraceCheckUtils]: 36: Hoare triple {7822#(<= main_~v~0 1)} assume !(#t~ret8 == 0);havoc #t~mem7;havoc #t~ret8; {7822#(<= main_~v~0 1)} is VALID [2018-11-14 16:54:01,516 INFO L273 TraceCheckUtils]: 37: Hoare triple {7822#(<= main_~v~0 1)} #t~post6 := ~v~0;~v~0 := #t~post6 + 1;havoc #t~post6; {7823#(<= main_~v~0 2)} is VALID [2018-11-14 16:54:01,516 INFO L273 TraceCheckUtils]: 38: Hoare triple {7823#(<= main_~v~0 2)} assume true; {7823#(<= main_~v~0 2)} is VALID [2018-11-14 16:54:01,517 INFO L273 TraceCheckUtils]: 39: Hoare triple {7823#(<= main_~v~0 2)} assume !!(~v~0 < 100000);call #t~mem7 := read~int(~#values~0.base, ~#values~0.offset + ~v~0 * 4, 4); {7823#(<= main_~v~0 2)} is VALID [2018-11-14 16:54:01,517 INFO L256 TraceCheckUtils]: 40: Hoare triple {7823#(<= main_~v~0 2)} call #t~ret8 := elem_exists(~#set~0.base, ~#set~0.offset, ~n~0, #t~mem7); {7819#true} is VALID [2018-11-14 16:54:01,517 INFO L273 TraceCheckUtils]: 41: Hoare triple {7819#true} ~set.base, ~set.offset := #in~set.base, #in~set.offset;~size := #in~size;~value := #in~value;havoc ~i~0;~i~0 := 0; {7819#true} is VALID [2018-11-14 16:54:01,517 INFO L273 TraceCheckUtils]: 42: Hoare triple {7819#true} assume true; {7819#true} is VALID [2018-11-14 16:54:01,518 INFO L273 TraceCheckUtils]: 43: Hoare triple {7819#true} assume !!(~i~0 < ~size);call #t~mem1 := read~int(~set.base, ~set.offset + ~i~0 * 4, 4); {7819#true} is VALID [2018-11-14 16:54:01,518 INFO L273 TraceCheckUtils]: 44: Hoare triple {7819#true} assume #t~mem1 == ~value;havoc #t~mem1;#res := 1; {7819#true} is VALID [2018-11-14 16:54:01,518 INFO L273 TraceCheckUtils]: 45: Hoare triple {7819#true} assume true; {7819#true} is VALID [2018-11-14 16:54:01,519 INFO L268 TraceCheckUtils]: 46: Hoare quadruple {7819#true} {7823#(<= main_~v~0 2)} #132#return; {7823#(<= main_~v~0 2)} is VALID [2018-11-14 16:54:01,520 INFO L273 TraceCheckUtils]: 47: Hoare triple {7823#(<= main_~v~0 2)} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647; {7823#(<= main_~v~0 2)} is VALID [2018-11-14 16:54:01,520 INFO L273 TraceCheckUtils]: 48: Hoare triple {7823#(<= main_~v~0 2)} assume !(#t~ret8 == 0);havoc #t~mem7;havoc #t~ret8; {7823#(<= main_~v~0 2)} is VALID [2018-11-14 16:54:01,521 INFO L273 TraceCheckUtils]: 49: Hoare triple {7823#(<= main_~v~0 2)} #t~post6 := ~v~0;~v~0 := #t~post6 + 1;havoc #t~post6; {7824#(<= main_~v~0 3)} is VALID [2018-11-14 16:54:01,521 INFO L273 TraceCheckUtils]: 50: Hoare triple {7824#(<= main_~v~0 3)} assume true; {7824#(<= main_~v~0 3)} is VALID [2018-11-14 16:54:01,521 INFO L273 TraceCheckUtils]: 51: Hoare triple {7824#(<= main_~v~0 3)} assume !!(~v~0 < 100000);call #t~mem7 := read~int(~#values~0.base, ~#values~0.offset + ~v~0 * 4, 4); {7824#(<= main_~v~0 3)} is VALID [2018-11-14 16:54:01,521 INFO L256 TraceCheckUtils]: 52: Hoare triple {7824#(<= main_~v~0 3)} call #t~ret8 := elem_exists(~#set~0.base, ~#set~0.offset, ~n~0, #t~mem7); {7819#true} is VALID [2018-11-14 16:54:01,522 INFO L273 TraceCheckUtils]: 53: Hoare triple {7819#true} ~set.base, ~set.offset := #in~set.base, #in~set.offset;~size := #in~size;~value := #in~value;havoc ~i~0;~i~0 := 0; {7819#true} is VALID [2018-11-14 16:54:01,522 INFO L273 TraceCheckUtils]: 54: Hoare triple {7819#true} assume true; {7819#true} is VALID [2018-11-14 16:54:01,522 INFO L273 TraceCheckUtils]: 55: Hoare triple {7819#true} assume !!(~i~0 < ~size);call #t~mem1 := read~int(~set.base, ~set.offset + ~i~0 * 4, 4); {7819#true} is VALID [2018-11-14 16:54:01,522 INFO L273 TraceCheckUtils]: 56: Hoare triple {7819#true} assume #t~mem1 == ~value;havoc #t~mem1;#res := 1; {7819#true} is VALID [2018-11-14 16:54:01,522 INFO L273 TraceCheckUtils]: 57: Hoare triple {7819#true} assume true; {7819#true} is VALID [2018-11-14 16:54:01,523 INFO L268 TraceCheckUtils]: 58: Hoare quadruple {7819#true} {7824#(<= main_~v~0 3)} #132#return; {7824#(<= main_~v~0 3)} is VALID [2018-11-14 16:54:01,523 INFO L273 TraceCheckUtils]: 59: Hoare triple {7824#(<= main_~v~0 3)} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647; {7824#(<= main_~v~0 3)} is VALID [2018-11-14 16:54:01,524 INFO L273 TraceCheckUtils]: 60: Hoare triple {7824#(<= main_~v~0 3)} assume !(#t~ret8 == 0);havoc #t~mem7;havoc #t~ret8; {7824#(<= main_~v~0 3)} is VALID [2018-11-14 16:54:01,524 INFO L273 TraceCheckUtils]: 61: Hoare triple {7824#(<= main_~v~0 3)} #t~post6 := ~v~0;~v~0 := #t~post6 + 1;havoc #t~post6; {7825#(<= main_~v~0 4)} is VALID [2018-11-14 16:54:01,525 INFO L273 TraceCheckUtils]: 62: Hoare triple {7825#(<= main_~v~0 4)} assume true; {7825#(<= main_~v~0 4)} is VALID [2018-11-14 16:54:01,525 INFO L273 TraceCheckUtils]: 63: Hoare triple {7825#(<= main_~v~0 4)} assume !!(~v~0 < 100000);call #t~mem7 := read~int(~#values~0.base, ~#values~0.offset + ~v~0 * 4, 4); {7825#(<= main_~v~0 4)} is VALID [2018-11-14 16:54:01,525 INFO L256 TraceCheckUtils]: 64: Hoare triple {7825#(<= main_~v~0 4)} call #t~ret8 := elem_exists(~#set~0.base, ~#set~0.offset, ~n~0, #t~mem7); {7819#true} is VALID [2018-11-14 16:54:01,525 INFO L273 TraceCheckUtils]: 65: Hoare triple {7819#true} ~set.base, ~set.offset := #in~set.base, #in~set.offset;~size := #in~size;~value := #in~value;havoc ~i~0;~i~0 := 0; {7819#true} is VALID [2018-11-14 16:54:01,525 INFO L273 TraceCheckUtils]: 66: Hoare triple {7819#true} assume true; {7819#true} is VALID [2018-11-14 16:54:01,525 INFO L273 TraceCheckUtils]: 67: Hoare triple {7819#true} assume !!(~i~0 < ~size);call #t~mem1 := read~int(~set.base, ~set.offset + ~i~0 * 4, 4); {7819#true} is VALID [2018-11-14 16:54:01,526 INFO L273 TraceCheckUtils]: 68: Hoare triple {7819#true} assume #t~mem1 == ~value;havoc #t~mem1;#res := 1; {7819#true} is VALID [2018-11-14 16:54:01,526 INFO L273 TraceCheckUtils]: 69: Hoare triple {7819#true} assume true; {7819#true} is VALID [2018-11-14 16:54:01,526 INFO L268 TraceCheckUtils]: 70: Hoare quadruple {7819#true} {7825#(<= main_~v~0 4)} #132#return; {7825#(<= main_~v~0 4)} is VALID [2018-11-14 16:54:01,527 INFO L273 TraceCheckUtils]: 71: Hoare triple {7825#(<= main_~v~0 4)} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647; {7825#(<= main_~v~0 4)} is VALID [2018-11-14 16:54:01,527 INFO L273 TraceCheckUtils]: 72: Hoare triple {7825#(<= main_~v~0 4)} assume !(#t~ret8 == 0);havoc #t~mem7;havoc #t~ret8; {7825#(<= main_~v~0 4)} is VALID [2018-11-14 16:54:01,528 INFO L273 TraceCheckUtils]: 73: Hoare triple {7825#(<= main_~v~0 4)} #t~post6 := ~v~0;~v~0 := #t~post6 + 1;havoc #t~post6; {7826#(<= main_~v~0 5)} is VALID [2018-11-14 16:54:01,529 INFO L273 TraceCheckUtils]: 74: Hoare triple {7826#(<= main_~v~0 5)} assume true; {7826#(<= main_~v~0 5)} is VALID [2018-11-14 16:54:01,529 INFO L273 TraceCheckUtils]: 75: Hoare triple {7826#(<= main_~v~0 5)} assume !!(~v~0 < 100000);call #t~mem7 := read~int(~#values~0.base, ~#values~0.offset + ~v~0 * 4, 4); {7826#(<= main_~v~0 5)} is VALID [2018-11-14 16:54:01,529 INFO L256 TraceCheckUtils]: 76: Hoare triple {7826#(<= main_~v~0 5)} call #t~ret8 := elem_exists(~#set~0.base, ~#set~0.offset, ~n~0, #t~mem7); {7819#true} is VALID [2018-11-14 16:54:01,529 INFO L273 TraceCheckUtils]: 77: Hoare triple {7819#true} ~set.base, ~set.offset := #in~set.base, #in~set.offset;~size := #in~size;~value := #in~value;havoc ~i~0;~i~0 := 0; {7819#true} is VALID [2018-11-14 16:54:01,529 INFO L273 TraceCheckUtils]: 78: Hoare triple {7819#true} assume true; {7819#true} is VALID [2018-11-14 16:54:01,529 INFO L273 TraceCheckUtils]: 79: Hoare triple {7819#true} assume !!(~i~0 < ~size);call #t~mem1 := read~int(~set.base, ~set.offset + ~i~0 * 4, 4); {7819#true} is VALID [2018-11-14 16:54:01,530 INFO L273 TraceCheckUtils]: 80: Hoare triple {7819#true} assume #t~mem1 == ~value;havoc #t~mem1;#res := 1; {7819#true} is VALID [2018-11-14 16:54:01,530 INFO L273 TraceCheckUtils]: 81: Hoare triple {7819#true} assume true; {7819#true} is VALID [2018-11-14 16:54:01,530 INFO L268 TraceCheckUtils]: 82: Hoare quadruple {7819#true} {7826#(<= main_~v~0 5)} #132#return; {7826#(<= main_~v~0 5)} is VALID [2018-11-14 16:54:01,531 INFO L273 TraceCheckUtils]: 83: Hoare triple {7826#(<= main_~v~0 5)} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647; {7826#(<= main_~v~0 5)} is VALID [2018-11-14 16:54:01,531 INFO L273 TraceCheckUtils]: 84: Hoare triple {7826#(<= main_~v~0 5)} assume !(#t~ret8 == 0);havoc #t~mem7;havoc #t~ret8; {7826#(<= main_~v~0 5)} is VALID [2018-11-14 16:54:01,532 INFO L273 TraceCheckUtils]: 85: Hoare triple {7826#(<= main_~v~0 5)} #t~post6 := ~v~0;~v~0 := #t~post6 + 1;havoc #t~post6; {7827#(<= main_~v~0 6)} is VALID [2018-11-14 16:54:01,532 INFO L273 TraceCheckUtils]: 86: Hoare triple {7827#(<= main_~v~0 6)} assume true; {7827#(<= main_~v~0 6)} is VALID [2018-11-14 16:54:01,533 INFO L273 TraceCheckUtils]: 87: Hoare triple {7827#(<= main_~v~0 6)} assume !!(~v~0 < 100000);call #t~mem7 := read~int(~#values~0.base, ~#values~0.offset + ~v~0 * 4, 4); {7827#(<= main_~v~0 6)} is VALID [2018-11-14 16:54:01,533 INFO L256 TraceCheckUtils]: 88: Hoare triple {7827#(<= main_~v~0 6)} call #t~ret8 := elem_exists(~#set~0.base, ~#set~0.offset, ~n~0, #t~mem7); {7819#true} is VALID [2018-11-14 16:54:01,533 INFO L273 TraceCheckUtils]: 89: Hoare triple {7819#true} ~set.base, ~set.offset := #in~set.base, #in~set.offset;~size := #in~size;~value := #in~value;havoc ~i~0;~i~0 := 0; {7819#true} is VALID [2018-11-14 16:54:01,534 INFO L273 TraceCheckUtils]: 90: Hoare triple {7819#true} assume true; {7819#true} is VALID [2018-11-14 16:54:01,534 INFO L273 TraceCheckUtils]: 91: Hoare triple {7819#true} assume !!(~i~0 < ~size);call #t~mem1 := read~int(~set.base, ~set.offset + ~i~0 * 4, 4); {7819#true} is VALID [2018-11-14 16:54:01,534 INFO L273 TraceCheckUtils]: 92: Hoare triple {7819#true} assume !(#t~mem1 == ~value);havoc #t~mem1; {7819#true} is VALID [2018-11-14 16:54:01,534 INFO L273 TraceCheckUtils]: 93: Hoare triple {7819#true} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {7819#true} is VALID [2018-11-14 16:54:01,535 INFO L273 TraceCheckUtils]: 94: Hoare triple {7819#true} assume true; {7819#true} is VALID [2018-11-14 16:54:01,535 INFO L273 TraceCheckUtils]: 95: Hoare triple {7819#true} assume !(~i~0 < ~size); {7819#true} is VALID [2018-11-14 16:54:01,535 INFO L273 TraceCheckUtils]: 96: Hoare triple {7819#true} #res := 0; {7819#true} is VALID [2018-11-14 16:54:01,535 INFO L273 TraceCheckUtils]: 97: Hoare triple {7819#true} assume true; {7819#true} is VALID [2018-11-14 16:54:01,536 INFO L268 TraceCheckUtils]: 98: Hoare quadruple {7819#true} {7827#(<= main_~v~0 6)} #132#return; {7827#(<= main_~v~0 6)} is VALID [2018-11-14 16:54:01,537 INFO L273 TraceCheckUtils]: 99: Hoare triple {7827#(<= main_~v~0 6)} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647; {7827#(<= main_~v~0 6)} is VALID [2018-11-14 16:54:01,537 INFO L273 TraceCheckUtils]: 100: Hoare triple {7827#(<= main_~v~0 6)} assume #t~ret8 == 0;havoc #t~mem7;havoc #t~ret8;call #t~mem9 := read~int(~#values~0.base, ~#values~0.offset + ~v~0 * 4, 4); {7827#(<= main_~v~0 6)} is VALID [2018-11-14 16:54:01,538 INFO L256 TraceCheckUtils]: 101: Hoare triple {7827#(<= main_~v~0 6)} call #t~ret10 := insert(~#set~0.base, ~#set~0.offset, ~n~0, #t~mem9); {7819#true} is VALID [2018-11-14 16:54:01,538 INFO L273 TraceCheckUtils]: 102: Hoare triple {7819#true} ~set.base, ~set.offset := #in~set.base, #in~set.offset;~size := #in~size;~value := #in~value;call write~int(~value, ~set.base, ~set.offset + ~size * 4, 4);#res := ~size + 1; {7819#true} is VALID [2018-11-14 16:54:01,538 INFO L273 TraceCheckUtils]: 103: Hoare triple {7819#true} assume true; {7819#true} is VALID [2018-11-14 16:54:01,538 INFO L268 TraceCheckUtils]: 104: Hoare quadruple {7819#true} {7827#(<= main_~v~0 6)} #134#return; {7827#(<= main_~v~0 6)} is VALID [2018-11-14 16:54:01,539 INFO L273 TraceCheckUtils]: 105: Hoare triple {7827#(<= main_~v~0 6)} assume -2147483648 <= #t~ret10 && #t~ret10 <= 2147483647;~n~0 := #t~ret10;havoc #t~ret10;havoc #t~mem9; {7827#(<= main_~v~0 6)} is VALID [2018-11-14 16:54:01,539 INFO L273 TraceCheckUtils]: 106: Hoare triple {7827#(<= main_~v~0 6)} #t~post6 := ~v~0;~v~0 := #t~post6 + 1;havoc #t~post6; {7828#(<= main_~v~0 7)} is VALID [2018-11-14 16:54:01,540 INFO L273 TraceCheckUtils]: 107: Hoare triple {7828#(<= main_~v~0 7)} assume true; {7828#(<= main_~v~0 7)} is VALID [2018-11-14 16:54:01,541 INFO L273 TraceCheckUtils]: 108: Hoare triple {7828#(<= main_~v~0 7)} assume !(~v~0 < 100000); {7820#false} is VALID [2018-11-14 16:54:01,541 INFO L273 TraceCheckUtils]: 109: Hoare triple {7820#false} ~x~0 := 0; {7820#false} is VALID [2018-11-14 16:54:01,541 INFO L273 TraceCheckUtils]: 110: Hoare triple {7820#false} assume true; {7820#false} is VALID [2018-11-14 16:54:01,541 INFO L273 TraceCheckUtils]: 111: Hoare triple {7820#false} assume !!(~x~0 < ~n~0);~y~0 := ~x~0 + 1; {7820#false} is VALID [2018-11-14 16:54:01,541 INFO L273 TraceCheckUtils]: 112: Hoare triple {7820#false} assume true; {7820#false} is VALID [2018-11-14 16:54:01,542 INFO L273 TraceCheckUtils]: 113: Hoare triple {7820#false} assume !!(~y~0 < ~n~0);call #t~mem13 := read~int(~#set~0.base, ~#set~0.offset + ~x~0 * 4, 4);call #t~mem14 := read~int(~#set~0.base, ~#set~0.offset + ~y~0 * 4, 4); {7820#false} is VALID [2018-11-14 16:54:01,542 INFO L256 TraceCheckUtils]: 114: Hoare triple {7820#false} call __VERIFIER_assert((if #t~mem13 != #t~mem14 then 1 else 0)); {7820#false} is VALID [2018-11-14 16:54:01,542 INFO L273 TraceCheckUtils]: 115: Hoare triple {7820#false} ~cond := #in~cond; {7820#false} is VALID [2018-11-14 16:54:01,542 INFO L273 TraceCheckUtils]: 116: Hoare triple {7820#false} assume ~cond == 0; {7820#false} is VALID [2018-11-14 16:54:01,542 INFO L273 TraceCheckUtils]: 117: Hoare triple {7820#false} assume !false; {7820#false} is VALID [2018-11-14 16:54:01,551 INFO L134 CoverageAnalysis]: Checked inductivity of 280 backedges. 0 proven. 142 refuted. 0 times theorem prover too weak. 138 trivial. 0 not checked. [2018-11-14 16:54:01,551 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-14 16:54:01,551 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-14 16:54:01,562 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 16:54:01,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:54:01,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:54:01,642 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 16:54:01,810 INFO L256 TraceCheckUtils]: 0: Hoare triple {7819#true} call ULTIMATE.init(); {7819#true} is VALID [2018-11-14 16:54:01,810 INFO L273 TraceCheckUtils]: 1: Hoare triple {7819#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {7819#true} is VALID [2018-11-14 16:54:01,811 INFO L273 TraceCheckUtils]: 2: Hoare triple {7819#true} assume true; {7819#true} is VALID [2018-11-14 16:54:01,811 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {7819#true} {7819#true} #126#return; {7819#true} is VALID [2018-11-14 16:54:01,811 INFO L256 TraceCheckUtils]: 4: Hoare triple {7819#true} call #t~ret15 := main(); {7819#true} is VALID [2018-11-14 16:54:01,811 INFO L273 TraceCheckUtils]: 5: Hoare triple {7819#true} ~n~0 := 0;call ~#set~0.base, ~#set~0.offset := #Ultimate.alloc(400000);havoc ~x~0;havoc ~y~0;~x~0 := 0; {7819#true} is VALID [2018-11-14 16:54:01,812 INFO L273 TraceCheckUtils]: 6: Hoare triple {7819#true} assume true; {7819#true} is VALID [2018-11-14 16:54:01,812 INFO L273 TraceCheckUtils]: 7: Hoare triple {7819#true} assume !(~x~0 < ~n~0); {7819#true} is VALID [2018-11-14 16:54:01,813 INFO L273 TraceCheckUtils]: 8: Hoare triple {7819#true} call ~#values~0.base, ~#values~0.offset := #Ultimate.alloc(400000);havoc ~v~0;~v~0 := 0; {7856#(<= main_~v~0 0)} is VALID [2018-11-14 16:54:01,813 INFO L273 TraceCheckUtils]: 9: Hoare triple {7856#(<= main_~v~0 0)} assume true; {7856#(<= main_~v~0 0)} is VALID [2018-11-14 16:54:01,814 INFO L273 TraceCheckUtils]: 10: Hoare triple {7856#(<= main_~v~0 0)} assume !!(~v~0 < 100000);call #t~mem7 := read~int(~#values~0.base, ~#values~0.offset + ~v~0 * 4, 4); {7856#(<= main_~v~0 0)} is VALID [2018-11-14 16:54:01,814 INFO L256 TraceCheckUtils]: 11: Hoare triple {7856#(<= main_~v~0 0)} call #t~ret8 := elem_exists(~#set~0.base, ~#set~0.offset, ~n~0, #t~mem7); {7819#true} is VALID [2018-11-14 16:54:01,814 INFO L273 TraceCheckUtils]: 12: Hoare triple {7819#true} ~set.base, ~set.offset := #in~set.base, #in~set.offset;~size := #in~size;~value := #in~value;havoc ~i~0;~i~0 := 0; {7819#true} is VALID [2018-11-14 16:54:01,814 INFO L273 TraceCheckUtils]: 13: Hoare triple {7819#true} assume true; {7819#true} is VALID [2018-11-14 16:54:01,815 INFO L273 TraceCheckUtils]: 14: Hoare triple {7819#true} assume !(~i~0 < ~size); {7819#true} is VALID [2018-11-14 16:54:01,815 INFO L273 TraceCheckUtils]: 15: Hoare triple {7819#true} #res := 0; {7819#true} is VALID [2018-11-14 16:54:01,815 INFO L273 TraceCheckUtils]: 16: Hoare triple {7819#true} assume true; {7819#true} is VALID [2018-11-14 16:54:01,816 INFO L268 TraceCheckUtils]: 17: Hoare quadruple {7819#true} {7856#(<= main_~v~0 0)} #132#return; {7856#(<= main_~v~0 0)} is VALID [2018-11-14 16:54:01,816 INFO L273 TraceCheckUtils]: 18: Hoare triple {7856#(<= main_~v~0 0)} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647; {7856#(<= main_~v~0 0)} is VALID [2018-11-14 16:54:01,816 INFO L273 TraceCheckUtils]: 19: Hoare triple {7856#(<= main_~v~0 0)} assume #t~ret8 == 0;havoc #t~mem7;havoc #t~ret8;call #t~mem9 := read~int(~#values~0.base, ~#values~0.offset + ~v~0 * 4, 4); {7856#(<= main_~v~0 0)} is VALID [2018-11-14 16:54:01,816 INFO L256 TraceCheckUtils]: 20: Hoare triple {7856#(<= main_~v~0 0)} call #t~ret10 := insert(~#set~0.base, ~#set~0.offset, ~n~0, #t~mem9); {7819#true} is VALID [2018-11-14 16:54:01,817 INFO L273 TraceCheckUtils]: 21: Hoare triple {7819#true} ~set.base, ~set.offset := #in~set.base, #in~set.offset;~size := #in~size;~value := #in~value;call write~int(~value, ~set.base, ~set.offset + ~size * 4, 4);#res := ~size + 1; {7819#true} is VALID [2018-11-14 16:54:01,817 INFO L273 TraceCheckUtils]: 22: Hoare triple {7819#true} assume true; {7819#true} is VALID [2018-11-14 16:54:01,817 INFO L268 TraceCheckUtils]: 23: Hoare quadruple {7819#true} {7856#(<= main_~v~0 0)} #134#return; {7856#(<= main_~v~0 0)} is VALID [2018-11-14 16:54:01,818 INFO L273 TraceCheckUtils]: 24: Hoare triple {7856#(<= main_~v~0 0)} assume -2147483648 <= #t~ret10 && #t~ret10 <= 2147483647;~n~0 := #t~ret10;havoc #t~ret10;havoc #t~mem9; {7856#(<= main_~v~0 0)} is VALID [2018-11-14 16:54:01,818 INFO L273 TraceCheckUtils]: 25: Hoare triple {7856#(<= main_~v~0 0)} #t~post6 := ~v~0;~v~0 := #t~post6 + 1;havoc #t~post6; {7822#(<= main_~v~0 1)} is VALID [2018-11-14 16:54:01,819 INFO L273 TraceCheckUtils]: 26: Hoare triple {7822#(<= main_~v~0 1)} assume true; {7822#(<= main_~v~0 1)} is VALID [2018-11-14 16:54:01,819 INFO L273 TraceCheckUtils]: 27: Hoare triple {7822#(<= main_~v~0 1)} assume !!(~v~0 < 100000);call #t~mem7 := read~int(~#values~0.base, ~#values~0.offset + ~v~0 * 4, 4); {7822#(<= main_~v~0 1)} is VALID [2018-11-14 16:54:01,819 INFO L256 TraceCheckUtils]: 28: Hoare triple {7822#(<= main_~v~0 1)} call #t~ret8 := elem_exists(~#set~0.base, ~#set~0.offset, ~n~0, #t~mem7); {7819#true} is VALID [2018-11-14 16:54:01,819 INFO L273 TraceCheckUtils]: 29: Hoare triple {7819#true} ~set.base, ~set.offset := #in~set.base, #in~set.offset;~size := #in~size;~value := #in~value;havoc ~i~0;~i~0 := 0; {7819#true} is VALID [2018-11-14 16:54:01,819 INFO L273 TraceCheckUtils]: 30: Hoare triple {7819#true} assume true; {7819#true} is VALID [2018-11-14 16:54:01,819 INFO L273 TraceCheckUtils]: 31: Hoare triple {7819#true} assume !!(~i~0 < ~size);call #t~mem1 := read~int(~set.base, ~set.offset + ~i~0 * 4, 4); {7819#true} is VALID [2018-11-14 16:54:01,819 INFO L273 TraceCheckUtils]: 32: Hoare triple {7819#true} assume #t~mem1 == ~value;havoc #t~mem1;#res := 1; {7819#true} is VALID [2018-11-14 16:54:01,820 INFO L273 TraceCheckUtils]: 33: Hoare triple {7819#true} assume true; {7819#true} is VALID [2018-11-14 16:54:01,820 INFO L268 TraceCheckUtils]: 34: Hoare quadruple {7819#true} {7822#(<= main_~v~0 1)} #132#return; {7822#(<= main_~v~0 1)} is VALID [2018-11-14 16:54:01,821 INFO L273 TraceCheckUtils]: 35: Hoare triple {7822#(<= main_~v~0 1)} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647; {7822#(<= main_~v~0 1)} is VALID [2018-11-14 16:54:01,821 INFO L273 TraceCheckUtils]: 36: Hoare triple {7822#(<= main_~v~0 1)} assume !(#t~ret8 == 0);havoc #t~mem7;havoc #t~ret8; {7822#(<= main_~v~0 1)} is VALID [2018-11-14 16:54:01,822 INFO L273 TraceCheckUtils]: 37: Hoare triple {7822#(<= main_~v~0 1)} #t~post6 := ~v~0;~v~0 := #t~post6 + 1;havoc #t~post6; {7823#(<= main_~v~0 2)} is VALID [2018-11-14 16:54:01,822 INFO L273 TraceCheckUtils]: 38: Hoare triple {7823#(<= main_~v~0 2)} assume true; {7823#(<= main_~v~0 2)} is VALID [2018-11-14 16:54:01,823 INFO L273 TraceCheckUtils]: 39: Hoare triple {7823#(<= main_~v~0 2)} assume !!(~v~0 < 100000);call #t~mem7 := read~int(~#values~0.base, ~#values~0.offset + ~v~0 * 4, 4); {7823#(<= main_~v~0 2)} is VALID [2018-11-14 16:54:01,823 INFO L256 TraceCheckUtils]: 40: Hoare triple {7823#(<= main_~v~0 2)} call #t~ret8 := elem_exists(~#set~0.base, ~#set~0.offset, ~n~0, #t~mem7); {7819#true} is VALID [2018-11-14 16:54:01,823 INFO L273 TraceCheckUtils]: 41: Hoare triple {7819#true} ~set.base, ~set.offset := #in~set.base, #in~set.offset;~size := #in~size;~value := #in~value;havoc ~i~0;~i~0 := 0; {7819#true} is VALID [2018-11-14 16:54:01,824 INFO L273 TraceCheckUtils]: 42: Hoare triple {7819#true} assume true; {7819#true} is VALID [2018-11-14 16:54:01,824 INFO L273 TraceCheckUtils]: 43: Hoare triple {7819#true} assume !!(~i~0 < ~size);call #t~mem1 := read~int(~set.base, ~set.offset + ~i~0 * 4, 4); {7819#true} is VALID [2018-11-14 16:54:01,824 INFO L273 TraceCheckUtils]: 44: Hoare triple {7819#true} assume #t~mem1 == ~value;havoc #t~mem1;#res := 1; {7819#true} is VALID [2018-11-14 16:54:01,824 INFO L273 TraceCheckUtils]: 45: Hoare triple {7819#true} assume true; {7819#true} is VALID [2018-11-14 16:54:01,825 INFO L268 TraceCheckUtils]: 46: Hoare quadruple {7819#true} {7823#(<= main_~v~0 2)} #132#return; {7823#(<= main_~v~0 2)} is VALID [2018-11-14 16:54:01,826 INFO L273 TraceCheckUtils]: 47: Hoare triple {7823#(<= main_~v~0 2)} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647; {7823#(<= main_~v~0 2)} is VALID [2018-11-14 16:54:01,826 INFO L273 TraceCheckUtils]: 48: Hoare triple {7823#(<= main_~v~0 2)} assume !(#t~ret8 == 0);havoc #t~mem7;havoc #t~ret8; {7823#(<= main_~v~0 2)} is VALID [2018-11-14 16:54:01,827 INFO L273 TraceCheckUtils]: 49: Hoare triple {7823#(<= main_~v~0 2)} #t~post6 := ~v~0;~v~0 := #t~post6 + 1;havoc #t~post6; {7824#(<= main_~v~0 3)} is VALID [2018-11-14 16:54:01,827 INFO L273 TraceCheckUtils]: 50: Hoare triple {7824#(<= main_~v~0 3)} assume true; {7824#(<= main_~v~0 3)} is VALID [2018-11-14 16:54:01,827 INFO L273 TraceCheckUtils]: 51: Hoare triple {7824#(<= main_~v~0 3)} assume !!(~v~0 < 100000);call #t~mem7 := read~int(~#values~0.base, ~#values~0.offset + ~v~0 * 4, 4); {7824#(<= main_~v~0 3)} is VALID [2018-11-14 16:54:01,827 INFO L256 TraceCheckUtils]: 52: Hoare triple {7824#(<= main_~v~0 3)} call #t~ret8 := elem_exists(~#set~0.base, ~#set~0.offset, ~n~0, #t~mem7); {7819#true} is VALID [2018-11-14 16:54:01,827 INFO L273 TraceCheckUtils]: 53: Hoare triple {7819#true} ~set.base, ~set.offset := #in~set.base, #in~set.offset;~size := #in~size;~value := #in~value;havoc ~i~0;~i~0 := 0; {7819#true} is VALID [2018-11-14 16:54:01,828 INFO L273 TraceCheckUtils]: 54: Hoare triple {7819#true} assume true; {7819#true} is VALID [2018-11-14 16:54:01,828 INFO L273 TraceCheckUtils]: 55: Hoare triple {7819#true} assume !!(~i~0 < ~size);call #t~mem1 := read~int(~set.base, ~set.offset + ~i~0 * 4, 4); {7819#true} is VALID [2018-11-14 16:54:01,828 INFO L273 TraceCheckUtils]: 56: Hoare triple {7819#true} assume #t~mem1 == ~value;havoc #t~mem1;#res := 1; {7819#true} is VALID [2018-11-14 16:54:01,828 INFO L273 TraceCheckUtils]: 57: Hoare triple {7819#true} assume true; {7819#true} is VALID [2018-11-14 16:54:01,829 INFO L268 TraceCheckUtils]: 58: Hoare quadruple {7819#true} {7824#(<= main_~v~0 3)} #132#return; {7824#(<= main_~v~0 3)} is VALID [2018-11-14 16:54:01,830 INFO L273 TraceCheckUtils]: 59: Hoare triple {7824#(<= main_~v~0 3)} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647; {7824#(<= main_~v~0 3)} is VALID [2018-11-14 16:54:01,830 INFO L273 TraceCheckUtils]: 60: Hoare triple {7824#(<= main_~v~0 3)} assume !(#t~ret8 == 0);havoc #t~mem7;havoc #t~ret8; {7824#(<= main_~v~0 3)} is VALID [2018-11-14 16:54:01,830 INFO L273 TraceCheckUtils]: 61: Hoare triple {7824#(<= main_~v~0 3)} #t~post6 := ~v~0;~v~0 := #t~post6 + 1;havoc #t~post6; {7825#(<= main_~v~0 4)} is VALID [2018-11-14 16:54:01,831 INFO L273 TraceCheckUtils]: 62: Hoare triple {7825#(<= main_~v~0 4)} assume true; {7825#(<= main_~v~0 4)} is VALID [2018-11-14 16:54:01,831 INFO L273 TraceCheckUtils]: 63: Hoare triple {7825#(<= main_~v~0 4)} assume !!(~v~0 < 100000);call #t~mem7 := read~int(~#values~0.base, ~#values~0.offset + ~v~0 * 4, 4); {7825#(<= main_~v~0 4)} is VALID [2018-11-14 16:54:01,831 INFO L256 TraceCheckUtils]: 64: Hoare triple {7825#(<= main_~v~0 4)} call #t~ret8 := elem_exists(~#set~0.base, ~#set~0.offset, ~n~0, #t~mem7); {7819#true} is VALID [2018-11-14 16:54:01,831 INFO L273 TraceCheckUtils]: 65: Hoare triple {7819#true} ~set.base, ~set.offset := #in~set.base, #in~set.offset;~size := #in~size;~value := #in~value;havoc ~i~0;~i~0 := 0; {7819#true} is VALID [2018-11-14 16:54:01,831 INFO L273 TraceCheckUtils]: 66: Hoare triple {7819#true} assume true; {7819#true} is VALID [2018-11-14 16:54:01,832 INFO L273 TraceCheckUtils]: 67: Hoare triple {7819#true} assume !!(~i~0 < ~size);call #t~mem1 := read~int(~set.base, ~set.offset + ~i~0 * 4, 4); {7819#true} is VALID [2018-11-14 16:54:01,832 INFO L273 TraceCheckUtils]: 68: Hoare triple {7819#true} assume #t~mem1 == ~value;havoc #t~mem1;#res := 1; {7819#true} is VALID [2018-11-14 16:54:01,832 INFO L273 TraceCheckUtils]: 69: Hoare triple {7819#true} assume true; {7819#true} is VALID [2018-11-14 16:54:01,833 INFO L268 TraceCheckUtils]: 70: Hoare quadruple {7819#true} {7825#(<= main_~v~0 4)} #132#return; {7825#(<= main_~v~0 4)} is VALID [2018-11-14 16:54:01,833 INFO L273 TraceCheckUtils]: 71: Hoare triple {7825#(<= main_~v~0 4)} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647; {7825#(<= main_~v~0 4)} is VALID [2018-11-14 16:54:01,834 INFO L273 TraceCheckUtils]: 72: Hoare triple {7825#(<= main_~v~0 4)} assume !(#t~ret8 == 0);havoc #t~mem7;havoc #t~ret8; {7825#(<= main_~v~0 4)} is VALID [2018-11-14 16:54:01,835 INFO L273 TraceCheckUtils]: 73: Hoare triple {7825#(<= main_~v~0 4)} #t~post6 := ~v~0;~v~0 := #t~post6 + 1;havoc #t~post6; {7826#(<= main_~v~0 5)} is VALID [2018-11-14 16:54:01,835 INFO L273 TraceCheckUtils]: 74: Hoare triple {7826#(<= main_~v~0 5)} assume true; {7826#(<= main_~v~0 5)} is VALID [2018-11-14 16:54:01,836 INFO L273 TraceCheckUtils]: 75: Hoare triple {7826#(<= main_~v~0 5)} assume !!(~v~0 < 100000);call #t~mem7 := read~int(~#values~0.base, ~#values~0.offset + ~v~0 * 4, 4); {7826#(<= main_~v~0 5)} is VALID [2018-11-14 16:54:01,836 INFO L256 TraceCheckUtils]: 76: Hoare triple {7826#(<= main_~v~0 5)} call #t~ret8 := elem_exists(~#set~0.base, ~#set~0.offset, ~n~0, #t~mem7); {7819#true} is VALID [2018-11-14 16:54:01,836 INFO L273 TraceCheckUtils]: 77: Hoare triple {7819#true} ~set.base, ~set.offset := #in~set.base, #in~set.offset;~size := #in~size;~value := #in~value;havoc ~i~0;~i~0 := 0; {7819#true} is VALID [2018-11-14 16:54:01,836 INFO L273 TraceCheckUtils]: 78: Hoare triple {7819#true} assume true; {7819#true} is VALID [2018-11-14 16:54:01,837 INFO L273 TraceCheckUtils]: 79: Hoare triple {7819#true} assume !!(~i~0 < ~size);call #t~mem1 := read~int(~set.base, ~set.offset + ~i~0 * 4, 4); {7819#true} is VALID [2018-11-14 16:54:01,837 INFO L273 TraceCheckUtils]: 80: Hoare triple {7819#true} assume #t~mem1 == ~value;havoc #t~mem1;#res := 1; {7819#true} is VALID [2018-11-14 16:54:01,837 INFO L273 TraceCheckUtils]: 81: Hoare triple {7819#true} assume true; {7819#true} is VALID [2018-11-14 16:54:01,838 INFO L268 TraceCheckUtils]: 82: Hoare quadruple {7819#true} {7826#(<= main_~v~0 5)} #132#return; {7826#(<= main_~v~0 5)} is VALID [2018-11-14 16:54:01,839 INFO L273 TraceCheckUtils]: 83: Hoare triple {7826#(<= main_~v~0 5)} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647; {7826#(<= main_~v~0 5)} is VALID [2018-11-14 16:54:01,839 INFO L273 TraceCheckUtils]: 84: Hoare triple {7826#(<= main_~v~0 5)} assume !(#t~ret8 == 0);havoc #t~mem7;havoc #t~ret8; {7826#(<= main_~v~0 5)} is VALID [2018-11-14 16:54:01,840 INFO L273 TraceCheckUtils]: 85: Hoare triple {7826#(<= main_~v~0 5)} #t~post6 := ~v~0;~v~0 := #t~post6 + 1;havoc #t~post6; {7827#(<= main_~v~0 6)} is VALID [2018-11-14 16:54:01,840 INFO L273 TraceCheckUtils]: 86: Hoare triple {7827#(<= main_~v~0 6)} assume true; {7827#(<= main_~v~0 6)} is VALID [2018-11-14 16:54:01,841 INFO L273 TraceCheckUtils]: 87: Hoare triple {7827#(<= main_~v~0 6)} assume !!(~v~0 < 100000);call #t~mem7 := read~int(~#values~0.base, ~#values~0.offset + ~v~0 * 4, 4); {7827#(<= main_~v~0 6)} is VALID [2018-11-14 16:54:01,841 INFO L256 TraceCheckUtils]: 88: Hoare triple {7827#(<= main_~v~0 6)} call #t~ret8 := elem_exists(~#set~0.base, ~#set~0.offset, ~n~0, #t~mem7); {7819#true} is VALID [2018-11-14 16:54:01,841 INFO L273 TraceCheckUtils]: 89: Hoare triple {7819#true} ~set.base, ~set.offset := #in~set.base, #in~set.offset;~size := #in~size;~value := #in~value;havoc ~i~0;~i~0 := 0; {7819#true} is VALID [2018-11-14 16:54:01,842 INFO L273 TraceCheckUtils]: 90: Hoare triple {7819#true} assume true; {7819#true} is VALID [2018-11-14 16:54:01,842 INFO L273 TraceCheckUtils]: 91: Hoare triple {7819#true} assume !!(~i~0 < ~size);call #t~mem1 := read~int(~set.base, ~set.offset + ~i~0 * 4, 4); {7819#true} is VALID [2018-11-14 16:54:01,842 INFO L273 TraceCheckUtils]: 92: Hoare triple {7819#true} assume !(#t~mem1 == ~value);havoc #t~mem1; {7819#true} is VALID [2018-11-14 16:54:01,842 INFO L273 TraceCheckUtils]: 93: Hoare triple {7819#true} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {7819#true} is VALID [2018-11-14 16:54:01,843 INFO L273 TraceCheckUtils]: 94: Hoare triple {7819#true} assume true; {7819#true} is VALID [2018-11-14 16:54:01,843 INFO L273 TraceCheckUtils]: 95: Hoare triple {7819#true} assume !(~i~0 < ~size); {7819#true} is VALID [2018-11-14 16:54:01,843 INFO L273 TraceCheckUtils]: 96: Hoare triple {7819#true} #res := 0; {7819#true} is VALID [2018-11-14 16:54:01,843 INFO L273 TraceCheckUtils]: 97: Hoare triple {7819#true} assume true; {7819#true} is VALID [2018-11-14 16:54:01,844 INFO L268 TraceCheckUtils]: 98: Hoare quadruple {7819#true} {7827#(<= main_~v~0 6)} #132#return; {7827#(<= main_~v~0 6)} is VALID [2018-11-14 16:54:01,845 INFO L273 TraceCheckUtils]: 99: Hoare triple {7827#(<= main_~v~0 6)} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647; {7827#(<= main_~v~0 6)} is VALID [2018-11-14 16:54:01,845 INFO L273 TraceCheckUtils]: 100: Hoare triple {7827#(<= main_~v~0 6)} assume #t~ret8 == 0;havoc #t~mem7;havoc #t~ret8;call #t~mem9 := read~int(~#values~0.base, ~#values~0.offset + ~v~0 * 4, 4); {7827#(<= main_~v~0 6)} is VALID [2018-11-14 16:54:01,845 INFO L256 TraceCheckUtils]: 101: Hoare triple {7827#(<= main_~v~0 6)} call #t~ret10 := insert(~#set~0.base, ~#set~0.offset, ~n~0, #t~mem9); {7819#true} is VALID [2018-11-14 16:54:01,845 INFO L273 TraceCheckUtils]: 102: Hoare triple {7819#true} ~set.base, ~set.offset := #in~set.base, #in~set.offset;~size := #in~size;~value := #in~value;call write~int(~value, ~set.base, ~set.offset + ~size * 4, 4);#res := ~size + 1; {7819#true} is VALID [2018-11-14 16:54:01,846 INFO L273 TraceCheckUtils]: 103: Hoare triple {7819#true} assume true; {7819#true} is VALID [2018-11-14 16:54:01,864 INFO L268 TraceCheckUtils]: 104: Hoare quadruple {7819#true} {7827#(<= main_~v~0 6)} #134#return; {7827#(<= main_~v~0 6)} is VALID [2018-11-14 16:54:01,865 INFO L273 TraceCheckUtils]: 105: Hoare triple {7827#(<= main_~v~0 6)} assume -2147483648 <= #t~ret10 && #t~ret10 <= 2147483647;~n~0 := #t~ret10;havoc #t~ret10;havoc #t~mem9; {7827#(<= main_~v~0 6)} is VALID [2018-11-14 16:54:01,867 INFO L273 TraceCheckUtils]: 106: Hoare triple {7827#(<= main_~v~0 6)} #t~post6 := ~v~0;~v~0 := #t~post6 + 1;havoc #t~post6; {7828#(<= main_~v~0 7)} is VALID [2018-11-14 16:54:01,867 INFO L273 TraceCheckUtils]: 107: Hoare triple {7828#(<= main_~v~0 7)} assume true; {7828#(<= main_~v~0 7)} is VALID [2018-11-14 16:54:01,870 INFO L273 TraceCheckUtils]: 108: Hoare triple {7828#(<= main_~v~0 7)} assume !(~v~0 < 100000); {7820#false} is VALID [2018-11-14 16:54:01,870 INFO L273 TraceCheckUtils]: 109: Hoare triple {7820#false} ~x~0 := 0; {7820#false} is VALID [2018-11-14 16:54:01,870 INFO L273 TraceCheckUtils]: 110: Hoare triple {7820#false} assume true; {7820#false} is VALID [2018-11-14 16:54:01,870 INFO L273 TraceCheckUtils]: 111: Hoare triple {7820#false} assume !!(~x~0 < ~n~0);~y~0 := ~x~0 + 1; {7820#false} is VALID [2018-11-14 16:54:01,870 INFO L273 TraceCheckUtils]: 112: Hoare triple {7820#false} assume true; {7820#false} is VALID [2018-11-14 16:54:01,870 INFO L273 TraceCheckUtils]: 113: Hoare triple {7820#false} assume !!(~y~0 < ~n~0);call #t~mem13 := read~int(~#set~0.base, ~#set~0.offset + ~x~0 * 4, 4);call #t~mem14 := read~int(~#set~0.base, ~#set~0.offset + ~y~0 * 4, 4); {7820#false} is VALID [2018-11-14 16:54:01,871 INFO L256 TraceCheckUtils]: 114: Hoare triple {7820#false} call __VERIFIER_assert((if #t~mem13 != #t~mem14 then 1 else 0)); {7820#false} is VALID [2018-11-14 16:54:01,871 INFO L273 TraceCheckUtils]: 115: Hoare triple {7820#false} ~cond := #in~cond; {7820#false} is VALID [2018-11-14 16:54:01,871 INFO L273 TraceCheckUtils]: 116: Hoare triple {7820#false} assume ~cond == 0; {7820#false} is VALID [2018-11-14 16:54:01,871 INFO L273 TraceCheckUtils]: 117: Hoare triple {7820#false} assume !false; {7820#false} is VALID [2018-11-14 16:54:01,878 INFO L134 CoverageAnalysis]: Checked inductivity of 280 backedges. 0 proven. 142 refuted. 0 times theorem prover too weak. 138 trivial. 0 not checked. [2018-11-14 16:54:01,899 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 16:54:01,899 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 11 [2018-11-14 16:54:01,899 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 118 [2018-11-14 16:54:01,900 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 16:54:01,900 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states. [2018-11-14 16:54:01,989 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 97 edges. 97 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 16:54:01,989 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-11-14 16:54:01,989 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-14 16:54:01,990 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2018-11-14 16:54:01,990 INFO L87 Difference]: Start difference. First operand 190 states and 243 transitions. Second operand 11 states. [2018-11-14 16:54:03,708 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:54:03,708 INFO L93 Difference]: Finished difference Result 271 states and 348 transitions. [2018-11-14 16:54:03,708 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-11-14 16:54:03,708 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 118 [2018-11-14 16:54:03,709 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 16:54:03,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2018-11-14 16:54:03,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 153 transitions. [2018-11-14 16:54:03,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2018-11-14 16:54:03,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 153 transitions. [2018-11-14 16:54:03,714 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states and 153 transitions. [2018-11-14 16:54:03,974 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 153 edges. 153 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 16:54:03,984 INFO L225 Difference]: With dead ends: 271 [2018-11-14 16:54:03,985 INFO L226 Difference]: Without dead ends: 256 [2018-11-14 16:54:03,985 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 127 GetRequests, 118 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2018-11-14 16:54:03,986 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 256 states. [2018-11-14 16:54:04,246 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 256 to 216. [2018-11-14 16:54:04,247 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 16:54:04,247 INFO L82 GeneralOperation]: Start isEquivalent. First operand 256 states. Second operand 216 states. [2018-11-14 16:54:04,247 INFO L74 IsIncluded]: Start isIncluded. First operand 256 states. Second operand 216 states. [2018-11-14 16:54:04,247 INFO L87 Difference]: Start difference. First operand 256 states. Second operand 216 states. [2018-11-14 16:54:04,256 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:54:04,256 INFO L93 Difference]: Finished difference Result 256 states and 331 transitions. [2018-11-14 16:54:04,257 INFO L276 IsEmpty]: Start isEmpty. Operand 256 states and 331 transitions. [2018-11-14 16:54:04,258 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:54:04,258 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:54:04,259 INFO L74 IsIncluded]: Start isIncluded. First operand 216 states. Second operand 256 states. [2018-11-14 16:54:04,259 INFO L87 Difference]: Start difference. First operand 216 states. Second operand 256 states. [2018-11-14 16:54:04,269 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:54:04,270 INFO L93 Difference]: Finished difference Result 256 states and 331 transitions. [2018-11-14 16:54:04,270 INFO L276 IsEmpty]: Start isEmpty. Operand 256 states and 331 transitions. [2018-11-14 16:54:04,271 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:54:04,272 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:54:04,272 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 16:54:04,272 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 16:54:04,272 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 216 states. [2018-11-14 16:54:04,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 216 states to 216 states and 278 transitions. [2018-11-14 16:54:04,280 INFO L78 Accepts]: Start accepts. Automaton has 216 states and 278 transitions. Word has length 118 [2018-11-14 16:54:04,281 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 16:54:04,281 INFO L480 AbstractCegarLoop]: Abstraction has 216 states and 278 transitions. [2018-11-14 16:54:04,281 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-11-14 16:54:04,281 INFO L276 IsEmpty]: Start isEmpty. Operand 216 states and 278 transitions. [2018-11-14 16:54:04,284 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2018-11-14 16:54:04,284 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 16:54:04,284 INFO L375 BasicCegarLoop]: trace histogram [9, 9, 8, 8, 8, 8, 8, 8, 8, 7, 6, 6, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 16:54:04,285 INFO L423 AbstractCegarLoop]: === Iteration 11 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 16:54:04,285 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 16:54:04,285 INFO L82 PathProgramCache]: Analyzing trace with hash 303128928, now seen corresponding path program 2 times [2018-11-14 16:54:04,285 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 16:54:04,285 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 16:54:04,286 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 16:54:04,286 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 16:54:04,286 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 16:54:04,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:54:04,791 INFO L256 TraceCheckUtils]: 0: Hoare triple {9332#true} call ULTIMATE.init(); {9332#true} is VALID [2018-11-14 16:54:04,791 INFO L273 TraceCheckUtils]: 1: Hoare triple {9332#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {9332#true} is VALID [2018-11-14 16:54:04,791 INFO L273 TraceCheckUtils]: 2: Hoare triple {9332#true} assume true; {9332#true} is VALID [2018-11-14 16:54:04,792 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {9332#true} {9332#true} #126#return; {9332#true} is VALID [2018-11-14 16:54:04,792 INFO L256 TraceCheckUtils]: 4: Hoare triple {9332#true} call #t~ret15 := main(); {9332#true} is VALID [2018-11-14 16:54:04,792 INFO L273 TraceCheckUtils]: 5: Hoare triple {9332#true} ~n~0 := 0;call ~#set~0.base, ~#set~0.offset := #Ultimate.alloc(400000);havoc ~x~0;havoc ~y~0;~x~0 := 0; {9332#true} is VALID [2018-11-14 16:54:04,792 INFO L273 TraceCheckUtils]: 6: Hoare triple {9332#true} assume true; {9332#true} is VALID [2018-11-14 16:54:04,792 INFO L273 TraceCheckUtils]: 7: Hoare triple {9332#true} assume !(~x~0 < ~n~0); {9332#true} is VALID [2018-11-14 16:54:04,793 INFO L273 TraceCheckUtils]: 8: Hoare triple {9332#true} call ~#values~0.base, ~#values~0.offset := #Ultimate.alloc(400000);havoc ~v~0;~v~0 := 0; {9334#(= main_~v~0 0)} is VALID [2018-11-14 16:54:04,793 INFO L273 TraceCheckUtils]: 9: Hoare triple {9334#(= main_~v~0 0)} assume true; {9334#(= main_~v~0 0)} is VALID [2018-11-14 16:54:04,794 INFO L273 TraceCheckUtils]: 10: Hoare triple {9334#(= main_~v~0 0)} assume !!(~v~0 < 100000);call #t~mem7 := read~int(~#values~0.base, ~#values~0.offset + ~v~0 * 4, 4); {9334#(= main_~v~0 0)} is VALID [2018-11-14 16:54:04,794 INFO L256 TraceCheckUtils]: 11: Hoare triple {9334#(= main_~v~0 0)} call #t~ret8 := elem_exists(~#set~0.base, ~#set~0.offset, ~n~0, #t~mem7); {9332#true} is VALID [2018-11-14 16:54:04,794 INFO L273 TraceCheckUtils]: 12: Hoare triple {9332#true} ~set.base, ~set.offset := #in~set.base, #in~set.offset;~size := #in~size;~value := #in~value;havoc ~i~0;~i~0 := 0; {9332#true} is VALID [2018-11-14 16:54:04,794 INFO L273 TraceCheckUtils]: 13: Hoare triple {9332#true} assume true; {9332#true} is VALID [2018-11-14 16:54:04,794 INFO L273 TraceCheckUtils]: 14: Hoare triple {9332#true} assume !(~i~0 < ~size); {9332#true} is VALID [2018-11-14 16:54:04,794 INFO L273 TraceCheckUtils]: 15: Hoare triple {9332#true} #res := 0; {9332#true} is VALID [2018-11-14 16:54:04,794 INFO L273 TraceCheckUtils]: 16: Hoare triple {9332#true} assume true; {9332#true} is VALID [2018-11-14 16:54:04,795 INFO L268 TraceCheckUtils]: 17: Hoare quadruple {9332#true} {9334#(= main_~v~0 0)} #132#return; {9334#(= main_~v~0 0)} is VALID [2018-11-14 16:54:04,796 INFO L273 TraceCheckUtils]: 18: Hoare triple {9334#(= main_~v~0 0)} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647; {9334#(= main_~v~0 0)} is VALID [2018-11-14 16:54:04,796 INFO L273 TraceCheckUtils]: 19: Hoare triple {9334#(= main_~v~0 0)} assume #t~ret8 == 0;havoc #t~mem7;havoc #t~ret8;call #t~mem9 := read~int(~#values~0.base, ~#values~0.offset + ~v~0 * 4, 4); {9334#(= main_~v~0 0)} is VALID [2018-11-14 16:54:04,796 INFO L256 TraceCheckUtils]: 20: Hoare triple {9334#(= main_~v~0 0)} call #t~ret10 := insert(~#set~0.base, ~#set~0.offset, ~n~0, #t~mem9); {9332#true} is VALID [2018-11-14 16:54:04,796 INFO L273 TraceCheckUtils]: 21: Hoare triple {9332#true} ~set.base, ~set.offset := #in~set.base, #in~set.offset;~size := #in~size;~value := #in~value;call write~int(~value, ~set.base, ~set.offset + ~size * 4, 4);#res := ~size + 1; {9332#true} is VALID [2018-11-14 16:54:04,797 INFO L273 TraceCheckUtils]: 22: Hoare triple {9332#true} assume true; {9332#true} is VALID [2018-11-14 16:54:04,798 INFO L268 TraceCheckUtils]: 23: Hoare quadruple {9332#true} {9334#(= main_~v~0 0)} #134#return; {9334#(= main_~v~0 0)} is VALID [2018-11-14 16:54:04,798 INFO L273 TraceCheckUtils]: 24: Hoare triple {9334#(= main_~v~0 0)} assume -2147483648 <= #t~ret10 && #t~ret10 <= 2147483647;~n~0 := #t~ret10;havoc #t~ret10;havoc #t~mem9; {9334#(= main_~v~0 0)} is VALID [2018-11-14 16:54:04,799 INFO L273 TraceCheckUtils]: 25: Hoare triple {9334#(= main_~v~0 0)} #t~post6 := ~v~0;~v~0 := #t~post6 + 1;havoc #t~post6; {9335#(<= main_~v~0 1)} is VALID [2018-11-14 16:54:04,800 INFO L273 TraceCheckUtils]: 26: Hoare triple {9335#(<= main_~v~0 1)} assume true; {9335#(<= main_~v~0 1)} is VALID [2018-11-14 16:54:04,800 INFO L273 TraceCheckUtils]: 27: Hoare triple {9335#(<= main_~v~0 1)} assume !!(~v~0 < 100000);call #t~mem7 := read~int(~#values~0.base, ~#values~0.offset + ~v~0 * 4, 4); {9335#(<= main_~v~0 1)} is VALID [2018-11-14 16:54:04,800 INFO L256 TraceCheckUtils]: 28: Hoare triple {9335#(<= main_~v~0 1)} call #t~ret8 := elem_exists(~#set~0.base, ~#set~0.offset, ~n~0, #t~mem7); {9332#true} is VALID [2018-11-14 16:54:04,801 INFO L273 TraceCheckUtils]: 29: Hoare triple {9332#true} ~set.base, ~set.offset := #in~set.base, #in~set.offset;~size := #in~size;~value := #in~value;havoc ~i~0;~i~0 := 0; {9332#true} is VALID [2018-11-14 16:54:04,801 INFO L273 TraceCheckUtils]: 30: Hoare triple {9332#true} assume true; {9332#true} is VALID [2018-11-14 16:54:04,801 INFO L273 TraceCheckUtils]: 31: Hoare triple {9332#true} assume !!(~i~0 < ~size);call #t~mem1 := read~int(~set.base, ~set.offset + ~i~0 * 4, 4); {9332#true} is VALID [2018-11-14 16:54:04,801 INFO L273 TraceCheckUtils]: 32: Hoare triple {9332#true} assume #t~mem1 == ~value;havoc #t~mem1;#res := 1; {9332#true} is VALID [2018-11-14 16:54:04,801 INFO L273 TraceCheckUtils]: 33: Hoare triple {9332#true} assume true; {9332#true} is VALID [2018-11-14 16:54:04,803 INFO L268 TraceCheckUtils]: 34: Hoare quadruple {9332#true} {9335#(<= main_~v~0 1)} #132#return; {9335#(<= main_~v~0 1)} is VALID [2018-11-14 16:54:04,803 INFO L273 TraceCheckUtils]: 35: Hoare triple {9335#(<= main_~v~0 1)} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647; {9335#(<= main_~v~0 1)} is VALID [2018-11-14 16:54:04,804 INFO L273 TraceCheckUtils]: 36: Hoare triple {9335#(<= main_~v~0 1)} assume !(#t~ret8 == 0);havoc #t~mem7;havoc #t~ret8; {9335#(<= main_~v~0 1)} is VALID [2018-11-14 16:54:04,804 INFO L273 TraceCheckUtils]: 37: Hoare triple {9335#(<= main_~v~0 1)} #t~post6 := ~v~0;~v~0 := #t~post6 + 1;havoc #t~post6; {9336#(<= main_~v~0 2)} is VALID [2018-11-14 16:54:04,805 INFO L273 TraceCheckUtils]: 38: Hoare triple {9336#(<= main_~v~0 2)} assume true; {9336#(<= main_~v~0 2)} is VALID [2018-11-14 16:54:04,805 INFO L273 TraceCheckUtils]: 39: Hoare triple {9336#(<= main_~v~0 2)} assume !!(~v~0 < 100000);call #t~mem7 := read~int(~#values~0.base, ~#values~0.offset + ~v~0 * 4, 4); {9336#(<= main_~v~0 2)} is VALID [2018-11-14 16:54:04,805 INFO L256 TraceCheckUtils]: 40: Hoare triple {9336#(<= main_~v~0 2)} call #t~ret8 := elem_exists(~#set~0.base, ~#set~0.offset, ~n~0, #t~mem7); {9332#true} is VALID [2018-11-14 16:54:04,805 INFO L273 TraceCheckUtils]: 41: Hoare triple {9332#true} ~set.base, ~set.offset := #in~set.base, #in~set.offset;~size := #in~size;~value := #in~value;havoc ~i~0;~i~0 := 0; {9332#true} is VALID [2018-11-14 16:54:04,805 INFO L273 TraceCheckUtils]: 42: Hoare triple {9332#true} assume true; {9332#true} is VALID [2018-11-14 16:54:04,805 INFO L273 TraceCheckUtils]: 43: Hoare triple {9332#true} assume !!(~i~0 < ~size);call #t~mem1 := read~int(~set.base, ~set.offset + ~i~0 * 4, 4); {9332#true} is VALID [2018-11-14 16:54:04,806 INFO L273 TraceCheckUtils]: 44: Hoare triple {9332#true} assume #t~mem1 == ~value;havoc #t~mem1;#res := 1; {9332#true} is VALID [2018-11-14 16:54:04,806 INFO L273 TraceCheckUtils]: 45: Hoare triple {9332#true} assume true; {9332#true} is VALID [2018-11-14 16:54:04,807 INFO L268 TraceCheckUtils]: 46: Hoare quadruple {9332#true} {9336#(<= main_~v~0 2)} #132#return; {9336#(<= main_~v~0 2)} is VALID [2018-11-14 16:54:04,808 INFO L273 TraceCheckUtils]: 47: Hoare triple {9336#(<= main_~v~0 2)} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647; {9336#(<= main_~v~0 2)} is VALID [2018-11-14 16:54:04,808 INFO L273 TraceCheckUtils]: 48: Hoare triple {9336#(<= main_~v~0 2)} assume !(#t~ret8 == 0);havoc #t~mem7;havoc #t~ret8; {9336#(<= main_~v~0 2)} is VALID [2018-11-14 16:54:04,809 INFO L273 TraceCheckUtils]: 49: Hoare triple {9336#(<= main_~v~0 2)} #t~post6 := ~v~0;~v~0 := #t~post6 + 1;havoc #t~post6; {9337#(<= main_~v~0 3)} is VALID [2018-11-14 16:54:04,809 INFO L273 TraceCheckUtils]: 50: Hoare triple {9337#(<= main_~v~0 3)} assume true; {9337#(<= main_~v~0 3)} is VALID [2018-11-14 16:54:04,810 INFO L273 TraceCheckUtils]: 51: Hoare triple {9337#(<= main_~v~0 3)} assume !!(~v~0 < 100000);call #t~mem7 := read~int(~#values~0.base, ~#values~0.offset + ~v~0 * 4, 4); {9337#(<= main_~v~0 3)} is VALID [2018-11-14 16:54:04,810 INFO L256 TraceCheckUtils]: 52: Hoare triple {9337#(<= main_~v~0 3)} call #t~ret8 := elem_exists(~#set~0.base, ~#set~0.offset, ~n~0, #t~mem7); {9332#true} is VALID [2018-11-14 16:54:04,810 INFO L273 TraceCheckUtils]: 53: Hoare triple {9332#true} ~set.base, ~set.offset := #in~set.base, #in~set.offset;~size := #in~size;~value := #in~value;havoc ~i~0;~i~0 := 0; {9332#true} is VALID [2018-11-14 16:54:04,810 INFO L273 TraceCheckUtils]: 54: Hoare triple {9332#true} assume true; {9332#true} is VALID [2018-11-14 16:54:04,810 INFO L273 TraceCheckUtils]: 55: Hoare triple {9332#true} assume !!(~i~0 < ~size);call #t~mem1 := read~int(~set.base, ~set.offset + ~i~0 * 4, 4); {9332#true} is VALID [2018-11-14 16:54:04,810 INFO L273 TraceCheckUtils]: 56: Hoare triple {9332#true} assume #t~mem1 == ~value;havoc #t~mem1;#res := 1; {9332#true} is VALID [2018-11-14 16:54:04,810 INFO L273 TraceCheckUtils]: 57: Hoare triple {9332#true} assume true; {9332#true} is VALID [2018-11-14 16:54:04,812 INFO L268 TraceCheckUtils]: 58: Hoare quadruple {9332#true} {9337#(<= main_~v~0 3)} #132#return; {9337#(<= main_~v~0 3)} is VALID [2018-11-14 16:54:04,812 INFO L273 TraceCheckUtils]: 59: Hoare triple {9337#(<= main_~v~0 3)} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647; {9337#(<= main_~v~0 3)} is VALID [2018-11-14 16:54:04,813 INFO L273 TraceCheckUtils]: 60: Hoare triple {9337#(<= main_~v~0 3)} assume !(#t~ret8 == 0);havoc #t~mem7;havoc #t~ret8; {9337#(<= main_~v~0 3)} is VALID [2018-11-14 16:54:04,814 INFO L273 TraceCheckUtils]: 61: Hoare triple {9337#(<= main_~v~0 3)} #t~post6 := ~v~0;~v~0 := #t~post6 + 1;havoc #t~post6; {9338#(<= main_~v~0 4)} is VALID [2018-11-14 16:54:04,814 INFO L273 TraceCheckUtils]: 62: Hoare triple {9338#(<= main_~v~0 4)} assume true; {9338#(<= main_~v~0 4)} is VALID [2018-11-14 16:54:04,814 INFO L273 TraceCheckUtils]: 63: Hoare triple {9338#(<= main_~v~0 4)} assume !!(~v~0 < 100000);call #t~mem7 := read~int(~#values~0.base, ~#values~0.offset + ~v~0 * 4, 4); {9338#(<= main_~v~0 4)} is VALID [2018-11-14 16:54:04,814 INFO L256 TraceCheckUtils]: 64: Hoare triple {9338#(<= main_~v~0 4)} call #t~ret8 := elem_exists(~#set~0.base, ~#set~0.offset, ~n~0, #t~mem7); {9332#true} is VALID [2018-11-14 16:54:04,814 INFO L273 TraceCheckUtils]: 65: Hoare triple {9332#true} ~set.base, ~set.offset := #in~set.base, #in~set.offset;~size := #in~size;~value := #in~value;havoc ~i~0;~i~0 := 0; {9332#true} is VALID [2018-11-14 16:54:04,815 INFO L273 TraceCheckUtils]: 66: Hoare triple {9332#true} assume true; {9332#true} is VALID [2018-11-14 16:54:04,815 INFO L273 TraceCheckUtils]: 67: Hoare triple {9332#true} assume !!(~i~0 < ~size);call #t~mem1 := read~int(~set.base, ~set.offset + ~i~0 * 4, 4); {9332#true} is VALID [2018-11-14 16:54:04,815 INFO L273 TraceCheckUtils]: 68: Hoare triple {9332#true} assume #t~mem1 == ~value;havoc #t~mem1;#res := 1; {9332#true} is VALID [2018-11-14 16:54:04,815 INFO L273 TraceCheckUtils]: 69: Hoare triple {9332#true} assume true; {9332#true} is VALID [2018-11-14 16:54:04,816 INFO L268 TraceCheckUtils]: 70: Hoare quadruple {9332#true} {9338#(<= main_~v~0 4)} #132#return; {9338#(<= main_~v~0 4)} is VALID [2018-11-14 16:54:04,817 INFO L273 TraceCheckUtils]: 71: Hoare triple {9338#(<= main_~v~0 4)} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647; {9338#(<= main_~v~0 4)} is VALID [2018-11-14 16:54:04,817 INFO L273 TraceCheckUtils]: 72: Hoare triple {9338#(<= main_~v~0 4)} assume !(#t~ret8 == 0);havoc #t~mem7;havoc #t~ret8; {9338#(<= main_~v~0 4)} is VALID [2018-11-14 16:54:04,818 INFO L273 TraceCheckUtils]: 73: Hoare triple {9338#(<= main_~v~0 4)} #t~post6 := ~v~0;~v~0 := #t~post6 + 1;havoc #t~post6; {9339#(<= main_~v~0 5)} is VALID [2018-11-14 16:54:04,818 INFO L273 TraceCheckUtils]: 74: Hoare triple {9339#(<= main_~v~0 5)} assume true; {9339#(<= main_~v~0 5)} is VALID [2018-11-14 16:54:04,818 INFO L273 TraceCheckUtils]: 75: Hoare triple {9339#(<= main_~v~0 5)} assume !!(~v~0 < 100000);call #t~mem7 := read~int(~#values~0.base, ~#values~0.offset + ~v~0 * 4, 4); {9339#(<= main_~v~0 5)} is VALID [2018-11-14 16:54:04,819 INFO L256 TraceCheckUtils]: 76: Hoare triple {9339#(<= main_~v~0 5)} call #t~ret8 := elem_exists(~#set~0.base, ~#set~0.offset, ~n~0, #t~mem7); {9332#true} is VALID [2018-11-14 16:54:04,819 INFO L273 TraceCheckUtils]: 77: Hoare triple {9332#true} ~set.base, ~set.offset := #in~set.base, #in~set.offset;~size := #in~size;~value := #in~value;havoc ~i~0;~i~0 := 0; {9332#true} is VALID [2018-11-14 16:54:04,819 INFO L273 TraceCheckUtils]: 78: Hoare triple {9332#true} assume true; {9332#true} is VALID [2018-11-14 16:54:04,819 INFO L273 TraceCheckUtils]: 79: Hoare triple {9332#true} assume !!(~i~0 < ~size);call #t~mem1 := read~int(~set.base, ~set.offset + ~i~0 * 4, 4); {9332#true} is VALID [2018-11-14 16:54:04,819 INFO L273 TraceCheckUtils]: 80: Hoare triple {9332#true} assume #t~mem1 == ~value;havoc #t~mem1;#res := 1; {9332#true} is VALID [2018-11-14 16:54:04,819 INFO L273 TraceCheckUtils]: 81: Hoare triple {9332#true} assume true; {9332#true} is VALID [2018-11-14 16:54:04,821 INFO L268 TraceCheckUtils]: 82: Hoare quadruple {9332#true} {9339#(<= main_~v~0 5)} #132#return; {9339#(<= main_~v~0 5)} is VALID [2018-11-14 16:54:04,821 INFO L273 TraceCheckUtils]: 83: Hoare triple {9339#(<= main_~v~0 5)} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647; {9339#(<= main_~v~0 5)} is VALID [2018-11-14 16:54:04,822 INFO L273 TraceCheckUtils]: 84: Hoare triple {9339#(<= main_~v~0 5)} assume !(#t~ret8 == 0);havoc #t~mem7;havoc #t~ret8; {9339#(<= main_~v~0 5)} is VALID [2018-11-14 16:54:04,822 INFO L273 TraceCheckUtils]: 85: Hoare triple {9339#(<= main_~v~0 5)} #t~post6 := ~v~0;~v~0 := #t~post6 + 1;havoc #t~post6; {9340#(<= main_~v~0 6)} is VALID [2018-11-14 16:54:04,823 INFO L273 TraceCheckUtils]: 86: Hoare triple {9340#(<= main_~v~0 6)} assume true; {9340#(<= main_~v~0 6)} is VALID [2018-11-14 16:54:04,823 INFO L273 TraceCheckUtils]: 87: Hoare triple {9340#(<= main_~v~0 6)} assume !!(~v~0 < 100000);call #t~mem7 := read~int(~#values~0.base, ~#values~0.offset + ~v~0 * 4, 4); {9340#(<= main_~v~0 6)} is VALID [2018-11-14 16:54:04,824 INFO L256 TraceCheckUtils]: 88: Hoare triple {9340#(<= main_~v~0 6)} call #t~ret8 := elem_exists(~#set~0.base, ~#set~0.offset, ~n~0, #t~mem7); {9332#true} is VALID [2018-11-14 16:54:04,824 INFO L273 TraceCheckUtils]: 89: Hoare triple {9332#true} ~set.base, ~set.offset := #in~set.base, #in~set.offset;~size := #in~size;~value := #in~value;havoc ~i~0;~i~0 := 0; {9332#true} is VALID [2018-11-14 16:54:04,824 INFO L273 TraceCheckUtils]: 90: Hoare triple {9332#true} assume true; {9332#true} is VALID [2018-11-14 16:54:04,824 INFO L273 TraceCheckUtils]: 91: Hoare triple {9332#true} assume !!(~i~0 < ~size);call #t~mem1 := read~int(~set.base, ~set.offset + ~i~0 * 4, 4); {9332#true} is VALID [2018-11-14 16:54:04,825 INFO L273 TraceCheckUtils]: 92: Hoare triple {9332#true} assume #t~mem1 == ~value;havoc #t~mem1;#res := 1; {9332#true} is VALID [2018-11-14 16:54:04,825 INFO L273 TraceCheckUtils]: 93: Hoare triple {9332#true} assume true; {9332#true} is VALID [2018-11-14 16:54:04,826 INFO L268 TraceCheckUtils]: 94: Hoare quadruple {9332#true} {9340#(<= main_~v~0 6)} #132#return; {9340#(<= main_~v~0 6)} is VALID [2018-11-14 16:54:04,827 INFO L273 TraceCheckUtils]: 95: Hoare triple {9340#(<= main_~v~0 6)} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647; {9340#(<= main_~v~0 6)} is VALID [2018-11-14 16:54:04,827 INFO L273 TraceCheckUtils]: 96: Hoare triple {9340#(<= main_~v~0 6)} assume !(#t~ret8 == 0);havoc #t~mem7;havoc #t~ret8; {9340#(<= main_~v~0 6)} is VALID [2018-11-14 16:54:04,827 INFO L273 TraceCheckUtils]: 97: Hoare triple {9340#(<= main_~v~0 6)} #t~post6 := ~v~0;~v~0 := #t~post6 + 1;havoc #t~post6; {9341#(<= main_~v~0 7)} is VALID [2018-11-14 16:54:04,828 INFO L273 TraceCheckUtils]: 98: Hoare triple {9341#(<= main_~v~0 7)} assume true; {9341#(<= main_~v~0 7)} is VALID [2018-11-14 16:54:04,828 INFO L273 TraceCheckUtils]: 99: Hoare triple {9341#(<= main_~v~0 7)} assume !!(~v~0 < 100000);call #t~mem7 := read~int(~#values~0.base, ~#values~0.offset + ~v~0 * 4, 4); {9341#(<= main_~v~0 7)} is VALID [2018-11-14 16:54:04,828 INFO L256 TraceCheckUtils]: 100: Hoare triple {9341#(<= main_~v~0 7)} call #t~ret8 := elem_exists(~#set~0.base, ~#set~0.offset, ~n~0, #t~mem7); {9332#true} is VALID [2018-11-14 16:54:04,828 INFO L273 TraceCheckUtils]: 101: Hoare triple {9332#true} ~set.base, ~set.offset := #in~set.base, #in~set.offset;~size := #in~size;~value := #in~value;havoc ~i~0;~i~0 := 0; {9332#true} is VALID [2018-11-14 16:54:04,829 INFO L273 TraceCheckUtils]: 102: Hoare triple {9332#true} assume true; {9332#true} is VALID [2018-11-14 16:54:04,829 INFO L273 TraceCheckUtils]: 103: Hoare triple {9332#true} assume !!(~i~0 < ~size);call #t~mem1 := read~int(~set.base, ~set.offset + ~i~0 * 4, 4); {9332#true} is VALID [2018-11-14 16:54:04,829 INFO L273 TraceCheckUtils]: 104: Hoare triple {9332#true} assume !(#t~mem1 == ~value);havoc #t~mem1; {9332#true} is VALID [2018-11-14 16:54:04,829 INFO L273 TraceCheckUtils]: 105: Hoare triple {9332#true} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {9332#true} is VALID [2018-11-14 16:54:04,829 INFO L273 TraceCheckUtils]: 106: Hoare triple {9332#true} assume true; {9332#true} is VALID [2018-11-14 16:54:04,830 INFO L273 TraceCheckUtils]: 107: Hoare triple {9332#true} assume !(~i~0 < ~size); {9332#true} is VALID [2018-11-14 16:54:04,830 INFO L273 TraceCheckUtils]: 108: Hoare triple {9332#true} #res := 0; {9332#true} is VALID [2018-11-14 16:54:04,830 INFO L273 TraceCheckUtils]: 109: Hoare triple {9332#true} assume true; {9332#true} is VALID [2018-11-14 16:54:04,831 INFO L268 TraceCheckUtils]: 110: Hoare quadruple {9332#true} {9341#(<= main_~v~0 7)} #132#return; {9341#(<= main_~v~0 7)} is VALID [2018-11-14 16:54:04,832 INFO L273 TraceCheckUtils]: 111: Hoare triple {9341#(<= main_~v~0 7)} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647; {9341#(<= main_~v~0 7)} is VALID [2018-11-14 16:54:04,833 INFO L273 TraceCheckUtils]: 112: Hoare triple {9341#(<= main_~v~0 7)} assume #t~ret8 == 0;havoc #t~mem7;havoc #t~ret8;call #t~mem9 := read~int(~#values~0.base, ~#values~0.offset + ~v~0 * 4, 4); {9341#(<= main_~v~0 7)} is VALID [2018-11-14 16:54:04,833 INFO L256 TraceCheckUtils]: 113: Hoare triple {9341#(<= main_~v~0 7)} call #t~ret10 := insert(~#set~0.base, ~#set~0.offset, ~n~0, #t~mem9); {9332#true} is VALID [2018-11-14 16:54:04,833 INFO L273 TraceCheckUtils]: 114: Hoare triple {9332#true} ~set.base, ~set.offset := #in~set.base, #in~set.offset;~size := #in~size;~value := #in~value;call write~int(~value, ~set.base, ~set.offset + ~size * 4, 4);#res := ~size + 1; {9332#true} is VALID [2018-11-14 16:54:04,833 INFO L273 TraceCheckUtils]: 115: Hoare triple {9332#true} assume true; {9332#true} is VALID [2018-11-14 16:54:04,834 INFO L268 TraceCheckUtils]: 116: Hoare quadruple {9332#true} {9341#(<= main_~v~0 7)} #134#return; {9341#(<= main_~v~0 7)} is VALID [2018-11-14 16:54:04,835 INFO L273 TraceCheckUtils]: 117: Hoare triple {9341#(<= main_~v~0 7)} assume -2147483648 <= #t~ret10 && #t~ret10 <= 2147483647;~n~0 := #t~ret10;havoc #t~ret10;havoc #t~mem9; {9341#(<= main_~v~0 7)} is VALID [2018-11-14 16:54:04,835 INFO L273 TraceCheckUtils]: 118: Hoare triple {9341#(<= main_~v~0 7)} #t~post6 := ~v~0;~v~0 := #t~post6 + 1;havoc #t~post6; {9342#(<= main_~v~0 8)} is VALID [2018-11-14 16:54:04,836 INFO L273 TraceCheckUtils]: 119: Hoare triple {9342#(<= main_~v~0 8)} assume true; {9342#(<= main_~v~0 8)} is VALID [2018-11-14 16:54:04,836 INFO L273 TraceCheckUtils]: 120: Hoare triple {9342#(<= main_~v~0 8)} assume !(~v~0 < 100000); {9333#false} is VALID [2018-11-14 16:54:04,836 INFO L273 TraceCheckUtils]: 121: Hoare triple {9333#false} ~x~0 := 0; {9333#false} is VALID [2018-11-14 16:54:04,837 INFO L273 TraceCheckUtils]: 122: Hoare triple {9333#false} assume true; {9333#false} is VALID [2018-11-14 16:54:04,837 INFO L273 TraceCheckUtils]: 123: Hoare triple {9333#false} assume !!(~x~0 < ~n~0);~y~0 := ~x~0 + 1; {9333#false} is VALID [2018-11-14 16:54:04,837 INFO L273 TraceCheckUtils]: 124: Hoare triple {9333#false} assume true; {9333#false} is VALID [2018-11-14 16:54:04,837 INFO L273 TraceCheckUtils]: 125: Hoare triple {9333#false} assume !!(~y~0 < ~n~0);call #t~mem13 := read~int(~#set~0.base, ~#set~0.offset + ~x~0 * 4, 4);call #t~mem14 := read~int(~#set~0.base, ~#set~0.offset + ~y~0 * 4, 4); {9333#false} is VALID [2018-11-14 16:54:04,838 INFO L256 TraceCheckUtils]: 126: Hoare triple {9333#false} call __VERIFIER_assert((if #t~mem13 != #t~mem14 then 1 else 0)); {9333#false} is VALID [2018-11-14 16:54:04,838 INFO L273 TraceCheckUtils]: 127: Hoare triple {9333#false} ~cond := #in~cond; {9333#false} is VALID [2018-11-14 16:54:04,838 INFO L273 TraceCheckUtils]: 128: Hoare triple {9333#false} assume ~cond == 0; {9333#false} is VALID [2018-11-14 16:54:04,838 INFO L273 TraceCheckUtils]: 129: Hoare triple {9333#false} assume !false; {9333#false} is VALID [2018-11-14 16:54:04,848 INFO L134 CoverageAnalysis]: Checked inductivity of 367 backedges. 0 proven. 186 refuted. 0 times theorem prover too weak. 181 trivial. 0 not checked. [2018-11-14 16:54:04,848 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-14 16:54:04,848 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-14 16:54:04,857 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-14 16:54:04,922 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-14 16:54:04,922 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-14 16:54:04,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:54:04,950 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 16:54:05,175 INFO L256 TraceCheckUtils]: 0: Hoare triple {9332#true} call ULTIMATE.init(); {9332#true} is VALID [2018-11-14 16:54:05,175 INFO L273 TraceCheckUtils]: 1: Hoare triple {9332#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {9332#true} is VALID [2018-11-14 16:54:05,175 INFO L273 TraceCheckUtils]: 2: Hoare triple {9332#true} assume true; {9332#true} is VALID [2018-11-14 16:54:05,176 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {9332#true} {9332#true} #126#return; {9332#true} is VALID [2018-11-14 16:54:05,176 INFO L256 TraceCheckUtils]: 4: Hoare triple {9332#true} call #t~ret15 := main(); {9332#true} is VALID [2018-11-14 16:54:05,176 INFO L273 TraceCheckUtils]: 5: Hoare triple {9332#true} ~n~0 := 0;call ~#set~0.base, ~#set~0.offset := #Ultimate.alloc(400000);havoc ~x~0;havoc ~y~0;~x~0 := 0; {9332#true} is VALID [2018-11-14 16:54:05,176 INFO L273 TraceCheckUtils]: 6: Hoare triple {9332#true} assume true; {9332#true} is VALID [2018-11-14 16:54:05,177 INFO L273 TraceCheckUtils]: 7: Hoare triple {9332#true} assume !(~x~0 < ~n~0); {9332#true} is VALID [2018-11-14 16:54:05,177 INFO L273 TraceCheckUtils]: 8: Hoare triple {9332#true} call ~#values~0.base, ~#values~0.offset := #Ultimate.alloc(400000);havoc ~v~0;~v~0 := 0; {9370#(<= main_~v~0 0)} is VALID [2018-11-14 16:54:05,178 INFO L273 TraceCheckUtils]: 9: Hoare triple {9370#(<= main_~v~0 0)} assume true; {9370#(<= main_~v~0 0)} is VALID [2018-11-14 16:54:05,178 INFO L273 TraceCheckUtils]: 10: Hoare triple {9370#(<= main_~v~0 0)} assume !!(~v~0 < 100000);call #t~mem7 := read~int(~#values~0.base, ~#values~0.offset + ~v~0 * 4, 4); {9370#(<= main_~v~0 0)} is VALID [2018-11-14 16:54:05,178 INFO L256 TraceCheckUtils]: 11: Hoare triple {9370#(<= main_~v~0 0)} call #t~ret8 := elem_exists(~#set~0.base, ~#set~0.offset, ~n~0, #t~mem7); {9332#true} is VALID [2018-11-14 16:54:05,178 INFO L273 TraceCheckUtils]: 12: Hoare triple {9332#true} ~set.base, ~set.offset := #in~set.base, #in~set.offset;~size := #in~size;~value := #in~value;havoc ~i~0;~i~0 := 0; {9332#true} is VALID [2018-11-14 16:54:05,178 INFO L273 TraceCheckUtils]: 13: Hoare triple {9332#true} assume true; {9332#true} is VALID [2018-11-14 16:54:05,178 INFO L273 TraceCheckUtils]: 14: Hoare triple {9332#true} assume !(~i~0 < ~size); {9332#true} is VALID [2018-11-14 16:54:05,178 INFO L273 TraceCheckUtils]: 15: Hoare triple {9332#true} #res := 0; {9332#true} is VALID [2018-11-14 16:54:05,179 INFO L273 TraceCheckUtils]: 16: Hoare triple {9332#true} assume true; {9332#true} is VALID [2018-11-14 16:54:05,179 INFO L268 TraceCheckUtils]: 17: Hoare quadruple {9332#true} {9370#(<= main_~v~0 0)} #132#return; {9370#(<= main_~v~0 0)} is VALID [2018-11-14 16:54:05,180 INFO L273 TraceCheckUtils]: 18: Hoare triple {9370#(<= main_~v~0 0)} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647; {9370#(<= main_~v~0 0)} is VALID [2018-11-14 16:54:05,180 INFO L273 TraceCheckUtils]: 19: Hoare triple {9370#(<= main_~v~0 0)} assume #t~ret8 == 0;havoc #t~mem7;havoc #t~ret8;call #t~mem9 := read~int(~#values~0.base, ~#values~0.offset + ~v~0 * 4, 4); {9370#(<= main_~v~0 0)} is VALID [2018-11-14 16:54:05,180 INFO L256 TraceCheckUtils]: 20: Hoare triple {9370#(<= main_~v~0 0)} call #t~ret10 := insert(~#set~0.base, ~#set~0.offset, ~n~0, #t~mem9); {9332#true} is VALID [2018-11-14 16:54:05,180 INFO L273 TraceCheckUtils]: 21: Hoare triple {9332#true} ~set.base, ~set.offset := #in~set.base, #in~set.offset;~size := #in~size;~value := #in~value;call write~int(~value, ~set.base, ~set.offset + ~size * 4, 4);#res := ~size + 1; {9332#true} is VALID [2018-11-14 16:54:05,180 INFO L273 TraceCheckUtils]: 22: Hoare triple {9332#true} assume true; {9332#true} is VALID [2018-11-14 16:54:05,181 INFO L268 TraceCheckUtils]: 23: Hoare quadruple {9332#true} {9370#(<= main_~v~0 0)} #134#return; {9370#(<= main_~v~0 0)} is VALID [2018-11-14 16:54:05,182 INFO L273 TraceCheckUtils]: 24: Hoare triple {9370#(<= main_~v~0 0)} assume -2147483648 <= #t~ret10 && #t~ret10 <= 2147483647;~n~0 := #t~ret10;havoc #t~ret10;havoc #t~mem9; {9370#(<= main_~v~0 0)} is VALID [2018-11-14 16:54:05,182 INFO L273 TraceCheckUtils]: 25: Hoare triple {9370#(<= main_~v~0 0)} #t~post6 := ~v~0;~v~0 := #t~post6 + 1;havoc #t~post6; {9335#(<= main_~v~0 1)} is VALID [2018-11-14 16:54:05,182 INFO L273 TraceCheckUtils]: 26: Hoare triple {9335#(<= main_~v~0 1)} assume true; {9335#(<= main_~v~0 1)} is VALID [2018-11-14 16:54:05,183 INFO L273 TraceCheckUtils]: 27: Hoare triple {9335#(<= main_~v~0 1)} assume !!(~v~0 < 100000);call #t~mem7 := read~int(~#values~0.base, ~#values~0.offset + ~v~0 * 4, 4); {9335#(<= main_~v~0 1)} is VALID [2018-11-14 16:54:05,183 INFO L256 TraceCheckUtils]: 28: Hoare triple {9335#(<= main_~v~0 1)} call #t~ret8 := elem_exists(~#set~0.base, ~#set~0.offset, ~n~0, #t~mem7); {9332#true} is VALID [2018-11-14 16:54:05,183 INFO L273 TraceCheckUtils]: 29: Hoare triple {9332#true} ~set.base, ~set.offset := #in~set.base, #in~set.offset;~size := #in~size;~value := #in~value;havoc ~i~0;~i~0 := 0; {9332#true} is VALID [2018-11-14 16:54:05,183 INFO L273 TraceCheckUtils]: 30: Hoare triple {9332#true} assume true; {9332#true} is VALID [2018-11-14 16:54:05,183 INFO L273 TraceCheckUtils]: 31: Hoare triple {9332#true} assume !!(~i~0 < ~size);call #t~mem1 := read~int(~set.base, ~set.offset + ~i~0 * 4, 4); {9332#true} is VALID [2018-11-14 16:54:05,184 INFO L273 TraceCheckUtils]: 32: Hoare triple {9332#true} assume #t~mem1 == ~value;havoc #t~mem1;#res := 1; {9332#true} is VALID [2018-11-14 16:54:05,184 INFO L273 TraceCheckUtils]: 33: Hoare triple {9332#true} assume true; {9332#true} is VALID [2018-11-14 16:54:05,185 INFO L268 TraceCheckUtils]: 34: Hoare quadruple {9332#true} {9335#(<= main_~v~0 1)} #132#return; {9335#(<= main_~v~0 1)} is VALID [2018-11-14 16:54:05,185 INFO L273 TraceCheckUtils]: 35: Hoare triple {9335#(<= main_~v~0 1)} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647; {9335#(<= main_~v~0 1)} is VALID [2018-11-14 16:54:05,186 INFO L273 TraceCheckUtils]: 36: Hoare triple {9335#(<= main_~v~0 1)} assume !(#t~ret8 == 0);havoc #t~mem7;havoc #t~ret8; {9335#(<= main_~v~0 1)} is VALID [2018-11-14 16:54:05,186 INFO L273 TraceCheckUtils]: 37: Hoare triple {9335#(<= main_~v~0 1)} #t~post6 := ~v~0;~v~0 := #t~post6 + 1;havoc #t~post6; {9336#(<= main_~v~0 2)} is VALID [2018-11-14 16:54:05,187 INFO L273 TraceCheckUtils]: 38: Hoare triple {9336#(<= main_~v~0 2)} assume true; {9336#(<= main_~v~0 2)} is VALID [2018-11-14 16:54:05,187 INFO L273 TraceCheckUtils]: 39: Hoare triple {9336#(<= main_~v~0 2)} assume !!(~v~0 < 100000);call #t~mem7 := read~int(~#values~0.base, ~#values~0.offset + ~v~0 * 4, 4); {9336#(<= main_~v~0 2)} is VALID [2018-11-14 16:54:05,187 INFO L256 TraceCheckUtils]: 40: Hoare triple {9336#(<= main_~v~0 2)} call #t~ret8 := elem_exists(~#set~0.base, ~#set~0.offset, ~n~0, #t~mem7); {9332#true} is VALID [2018-11-14 16:54:05,187 INFO L273 TraceCheckUtils]: 41: Hoare triple {9332#true} ~set.base, ~set.offset := #in~set.base, #in~set.offset;~size := #in~size;~value := #in~value;havoc ~i~0;~i~0 := 0; {9332#true} is VALID [2018-11-14 16:54:05,187 INFO L273 TraceCheckUtils]: 42: Hoare triple {9332#true} assume true; {9332#true} is VALID [2018-11-14 16:54:05,187 INFO L273 TraceCheckUtils]: 43: Hoare triple {9332#true} assume !!(~i~0 < ~size);call #t~mem1 := read~int(~set.base, ~set.offset + ~i~0 * 4, 4); {9332#true} is VALID [2018-11-14 16:54:05,188 INFO L273 TraceCheckUtils]: 44: Hoare triple {9332#true} assume #t~mem1 == ~value;havoc #t~mem1;#res := 1; {9332#true} is VALID [2018-11-14 16:54:05,188 INFO L273 TraceCheckUtils]: 45: Hoare triple {9332#true} assume true; {9332#true} is VALID [2018-11-14 16:54:05,189 INFO L268 TraceCheckUtils]: 46: Hoare quadruple {9332#true} {9336#(<= main_~v~0 2)} #132#return; {9336#(<= main_~v~0 2)} is VALID [2018-11-14 16:54:05,190 INFO L273 TraceCheckUtils]: 47: Hoare triple {9336#(<= main_~v~0 2)} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647; {9336#(<= main_~v~0 2)} is VALID [2018-11-14 16:54:05,190 INFO L273 TraceCheckUtils]: 48: Hoare triple {9336#(<= main_~v~0 2)} assume !(#t~ret8 == 0);havoc #t~mem7;havoc #t~ret8; {9336#(<= main_~v~0 2)} is VALID [2018-11-14 16:54:05,191 INFO L273 TraceCheckUtils]: 49: Hoare triple {9336#(<= main_~v~0 2)} #t~post6 := ~v~0;~v~0 := #t~post6 + 1;havoc #t~post6; {9337#(<= main_~v~0 3)} is VALID [2018-11-14 16:54:05,191 INFO L273 TraceCheckUtils]: 50: Hoare triple {9337#(<= main_~v~0 3)} assume true; {9337#(<= main_~v~0 3)} is VALID [2018-11-14 16:54:05,192 INFO L273 TraceCheckUtils]: 51: Hoare triple {9337#(<= main_~v~0 3)} assume !!(~v~0 < 100000);call #t~mem7 := read~int(~#values~0.base, ~#values~0.offset + ~v~0 * 4, 4); {9337#(<= main_~v~0 3)} is VALID [2018-11-14 16:54:05,192 INFO L256 TraceCheckUtils]: 52: Hoare triple {9337#(<= main_~v~0 3)} call #t~ret8 := elem_exists(~#set~0.base, ~#set~0.offset, ~n~0, #t~mem7); {9332#true} is VALID [2018-11-14 16:54:05,192 INFO L273 TraceCheckUtils]: 53: Hoare triple {9332#true} ~set.base, ~set.offset := #in~set.base, #in~set.offset;~size := #in~size;~value := #in~value;havoc ~i~0;~i~0 := 0; {9332#true} is VALID [2018-11-14 16:54:05,192 INFO L273 TraceCheckUtils]: 54: Hoare triple {9332#true} assume true; {9332#true} is VALID [2018-11-14 16:54:05,193 INFO L273 TraceCheckUtils]: 55: Hoare triple {9332#true} assume !!(~i~0 < ~size);call #t~mem1 := read~int(~set.base, ~set.offset + ~i~0 * 4, 4); {9332#true} is VALID [2018-11-14 16:54:05,193 INFO L273 TraceCheckUtils]: 56: Hoare triple {9332#true} assume #t~mem1 == ~value;havoc #t~mem1;#res := 1; {9332#true} is VALID [2018-11-14 16:54:05,193 INFO L273 TraceCheckUtils]: 57: Hoare triple {9332#true} assume true; {9332#true} is VALID [2018-11-14 16:54:05,194 INFO L268 TraceCheckUtils]: 58: Hoare quadruple {9332#true} {9337#(<= main_~v~0 3)} #132#return; {9337#(<= main_~v~0 3)} is VALID [2018-11-14 16:54:05,194 INFO L273 TraceCheckUtils]: 59: Hoare triple {9337#(<= main_~v~0 3)} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647; {9337#(<= main_~v~0 3)} is VALID [2018-11-14 16:54:05,195 INFO L273 TraceCheckUtils]: 60: Hoare triple {9337#(<= main_~v~0 3)} assume !(#t~ret8 == 0);havoc #t~mem7;havoc #t~ret8; {9337#(<= main_~v~0 3)} is VALID [2018-11-14 16:54:05,195 INFO L273 TraceCheckUtils]: 61: Hoare triple {9337#(<= main_~v~0 3)} #t~post6 := ~v~0;~v~0 := #t~post6 + 1;havoc #t~post6; {9338#(<= main_~v~0 4)} is VALID [2018-11-14 16:54:05,215 INFO L273 TraceCheckUtils]: 62: Hoare triple {9338#(<= main_~v~0 4)} assume true; {9338#(<= main_~v~0 4)} is VALID [2018-11-14 16:54:05,215 INFO L273 TraceCheckUtils]: 63: Hoare triple {9338#(<= main_~v~0 4)} assume !!(~v~0 < 100000);call #t~mem7 := read~int(~#values~0.base, ~#values~0.offset + ~v~0 * 4, 4); {9338#(<= main_~v~0 4)} is VALID [2018-11-14 16:54:05,216 INFO L256 TraceCheckUtils]: 64: Hoare triple {9338#(<= main_~v~0 4)} call #t~ret8 := elem_exists(~#set~0.base, ~#set~0.offset, ~n~0, #t~mem7); {9332#true} is VALID [2018-11-14 16:54:05,216 INFO L273 TraceCheckUtils]: 65: Hoare triple {9332#true} ~set.base, ~set.offset := #in~set.base, #in~set.offset;~size := #in~size;~value := #in~value;havoc ~i~0;~i~0 := 0; {9332#true} is VALID [2018-11-14 16:54:05,216 INFO L273 TraceCheckUtils]: 66: Hoare triple {9332#true} assume true; {9332#true} is VALID [2018-11-14 16:54:05,216 INFO L273 TraceCheckUtils]: 67: Hoare triple {9332#true} assume !!(~i~0 < ~size);call #t~mem1 := read~int(~set.base, ~set.offset + ~i~0 * 4, 4); {9332#true} is VALID [2018-11-14 16:54:05,216 INFO L273 TraceCheckUtils]: 68: Hoare triple {9332#true} assume #t~mem1 == ~value;havoc #t~mem1;#res := 1; {9332#true} is VALID [2018-11-14 16:54:05,216 INFO L273 TraceCheckUtils]: 69: Hoare triple {9332#true} assume true; {9332#true} is VALID [2018-11-14 16:54:05,217 INFO L268 TraceCheckUtils]: 70: Hoare quadruple {9332#true} {9338#(<= main_~v~0 4)} #132#return; {9338#(<= main_~v~0 4)} is VALID [2018-11-14 16:54:05,218 INFO L273 TraceCheckUtils]: 71: Hoare triple {9338#(<= main_~v~0 4)} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647; {9338#(<= main_~v~0 4)} is VALID [2018-11-14 16:54:05,218 INFO L273 TraceCheckUtils]: 72: Hoare triple {9338#(<= main_~v~0 4)} assume !(#t~ret8 == 0);havoc #t~mem7;havoc #t~ret8; {9338#(<= main_~v~0 4)} is VALID [2018-11-14 16:54:05,219 INFO L273 TraceCheckUtils]: 73: Hoare triple {9338#(<= main_~v~0 4)} #t~post6 := ~v~0;~v~0 := #t~post6 + 1;havoc #t~post6; {9339#(<= main_~v~0 5)} is VALID [2018-11-14 16:54:05,219 INFO L273 TraceCheckUtils]: 74: Hoare triple {9339#(<= main_~v~0 5)} assume true; {9339#(<= main_~v~0 5)} is VALID [2018-11-14 16:54:05,220 INFO L273 TraceCheckUtils]: 75: Hoare triple {9339#(<= main_~v~0 5)} assume !!(~v~0 < 100000);call #t~mem7 := read~int(~#values~0.base, ~#values~0.offset + ~v~0 * 4, 4); {9339#(<= main_~v~0 5)} is VALID [2018-11-14 16:54:05,220 INFO L256 TraceCheckUtils]: 76: Hoare triple {9339#(<= main_~v~0 5)} call #t~ret8 := elem_exists(~#set~0.base, ~#set~0.offset, ~n~0, #t~mem7); {9332#true} is VALID [2018-11-14 16:54:05,220 INFO L273 TraceCheckUtils]: 77: Hoare triple {9332#true} ~set.base, ~set.offset := #in~set.base, #in~set.offset;~size := #in~size;~value := #in~value;havoc ~i~0;~i~0 := 0; {9332#true} is VALID [2018-11-14 16:54:05,220 INFO L273 TraceCheckUtils]: 78: Hoare triple {9332#true} assume true; {9332#true} is VALID [2018-11-14 16:54:05,220 INFO L273 TraceCheckUtils]: 79: Hoare triple {9332#true} assume !!(~i~0 < ~size);call #t~mem1 := read~int(~set.base, ~set.offset + ~i~0 * 4, 4); {9332#true} is VALID [2018-11-14 16:54:05,221 INFO L273 TraceCheckUtils]: 80: Hoare triple {9332#true} assume #t~mem1 == ~value;havoc #t~mem1;#res := 1; {9332#true} is VALID [2018-11-14 16:54:05,221 INFO L273 TraceCheckUtils]: 81: Hoare triple {9332#true} assume true; {9332#true} is VALID [2018-11-14 16:54:05,222 INFO L268 TraceCheckUtils]: 82: Hoare quadruple {9332#true} {9339#(<= main_~v~0 5)} #132#return; {9339#(<= main_~v~0 5)} is VALID [2018-11-14 16:54:05,222 INFO L273 TraceCheckUtils]: 83: Hoare triple {9339#(<= main_~v~0 5)} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647; {9339#(<= main_~v~0 5)} is VALID [2018-11-14 16:54:05,223 INFO L273 TraceCheckUtils]: 84: Hoare triple {9339#(<= main_~v~0 5)} assume !(#t~ret8 == 0);havoc #t~mem7;havoc #t~ret8; {9339#(<= main_~v~0 5)} is VALID [2018-11-14 16:54:05,223 INFO L273 TraceCheckUtils]: 85: Hoare triple {9339#(<= main_~v~0 5)} #t~post6 := ~v~0;~v~0 := #t~post6 + 1;havoc #t~post6; {9340#(<= main_~v~0 6)} is VALID [2018-11-14 16:54:05,223 INFO L273 TraceCheckUtils]: 86: Hoare triple {9340#(<= main_~v~0 6)} assume true; {9340#(<= main_~v~0 6)} is VALID [2018-11-14 16:54:05,224 INFO L273 TraceCheckUtils]: 87: Hoare triple {9340#(<= main_~v~0 6)} assume !!(~v~0 < 100000);call #t~mem7 := read~int(~#values~0.base, ~#values~0.offset + ~v~0 * 4, 4); {9340#(<= main_~v~0 6)} is VALID [2018-11-14 16:54:05,224 INFO L256 TraceCheckUtils]: 88: Hoare triple {9340#(<= main_~v~0 6)} call #t~ret8 := elem_exists(~#set~0.base, ~#set~0.offset, ~n~0, #t~mem7); {9332#true} is VALID [2018-11-14 16:54:05,224 INFO L273 TraceCheckUtils]: 89: Hoare triple {9332#true} ~set.base, ~set.offset := #in~set.base, #in~set.offset;~size := #in~size;~value := #in~value;havoc ~i~0;~i~0 := 0; {9332#true} is VALID [2018-11-14 16:54:05,224 INFO L273 TraceCheckUtils]: 90: Hoare triple {9332#true} assume true; {9332#true} is VALID [2018-11-14 16:54:05,224 INFO L273 TraceCheckUtils]: 91: Hoare triple {9332#true} assume !!(~i~0 < ~size);call #t~mem1 := read~int(~set.base, ~set.offset + ~i~0 * 4, 4); {9332#true} is VALID [2018-11-14 16:54:05,225 INFO L273 TraceCheckUtils]: 92: Hoare triple {9332#true} assume #t~mem1 == ~value;havoc #t~mem1;#res := 1; {9332#true} is VALID [2018-11-14 16:54:05,225 INFO L273 TraceCheckUtils]: 93: Hoare triple {9332#true} assume true; {9332#true} is VALID [2018-11-14 16:54:05,226 INFO L268 TraceCheckUtils]: 94: Hoare quadruple {9332#true} {9340#(<= main_~v~0 6)} #132#return; {9340#(<= main_~v~0 6)} is VALID [2018-11-14 16:54:05,226 INFO L273 TraceCheckUtils]: 95: Hoare triple {9340#(<= main_~v~0 6)} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647; {9340#(<= main_~v~0 6)} is VALID [2018-11-14 16:54:05,227 INFO L273 TraceCheckUtils]: 96: Hoare triple {9340#(<= main_~v~0 6)} assume !(#t~ret8 == 0);havoc #t~mem7;havoc #t~ret8; {9340#(<= main_~v~0 6)} is VALID [2018-11-14 16:54:05,228 INFO L273 TraceCheckUtils]: 97: Hoare triple {9340#(<= main_~v~0 6)} #t~post6 := ~v~0;~v~0 := #t~post6 + 1;havoc #t~post6; {9341#(<= main_~v~0 7)} is VALID [2018-11-14 16:54:05,228 INFO L273 TraceCheckUtils]: 98: Hoare triple {9341#(<= main_~v~0 7)} assume true; {9341#(<= main_~v~0 7)} is VALID [2018-11-14 16:54:05,229 INFO L273 TraceCheckUtils]: 99: Hoare triple {9341#(<= main_~v~0 7)} assume !!(~v~0 < 100000);call #t~mem7 := read~int(~#values~0.base, ~#values~0.offset + ~v~0 * 4, 4); {9341#(<= main_~v~0 7)} is VALID [2018-11-14 16:54:05,229 INFO L256 TraceCheckUtils]: 100: Hoare triple {9341#(<= main_~v~0 7)} call #t~ret8 := elem_exists(~#set~0.base, ~#set~0.offset, ~n~0, #t~mem7); {9332#true} is VALID [2018-11-14 16:54:05,229 INFO L273 TraceCheckUtils]: 101: Hoare triple {9332#true} ~set.base, ~set.offset := #in~set.base, #in~set.offset;~size := #in~size;~value := #in~value;havoc ~i~0;~i~0 := 0; {9332#true} is VALID [2018-11-14 16:54:05,229 INFO L273 TraceCheckUtils]: 102: Hoare triple {9332#true} assume true; {9332#true} is VALID [2018-11-14 16:54:05,229 INFO L273 TraceCheckUtils]: 103: Hoare triple {9332#true} assume !!(~i~0 < ~size);call #t~mem1 := read~int(~set.base, ~set.offset + ~i~0 * 4, 4); {9332#true} is VALID [2018-11-14 16:54:05,230 INFO L273 TraceCheckUtils]: 104: Hoare triple {9332#true} assume !(#t~mem1 == ~value);havoc #t~mem1; {9332#true} is VALID [2018-11-14 16:54:05,230 INFO L273 TraceCheckUtils]: 105: Hoare triple {9332#true} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {9332#true} is VALID [2018-11-14 16:54:05,230 INFO L273 TraceCheckUtils]: 106: Hoare triple {9332#true} assume true; {9332#true} is VALID [2018-11-14 16:54:05,230 INFO L273 TraceCheckUtils]: 107: Hoare triple {9332#true} assume !(~i~0 < ~size); {9332#true} is VALID [2018-11-14 16:54:05,230 INFO L273 TraceCheckUtils]: 108: Hoare triple {9332#true} #res := 0; {9332#true} is VALID [2018-11-14 16:54:05,231 INFO L273 TraceCheckUtils]: 109: Hoare triple {9332#true} assume true; {9332#true} is VALID [2018-11-14 16:54:05,232 INFO L268 TraceCheckUtils]: 110: Hoare quadruple {9332#true} {9341#(<= main_~v~0 7)} #132#return; {9341#(<= main_~v~0 7)} is VALID [2018-11-14 16:54:05,232 INFO L273 TraceCheckUtils]: 111: Hoare triple {9341#(<= main_~v~0 7)} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647; {9341#(<= main_~v~0 7)} is VALID [2018-11-14 16:54:05,233 INFO L273 TraceCheckUtils]: 112: Hoare triple {9341#(<= main_~v~0 7)} assume #t~ret8 == 0;havoc #t~mem7;havoc #t~ret8;call #t~mem9 := read~int(~#values~0.base, ~#values~0.offset + ~v~0 * 4, 4); {9341#(<= main_~v~0 7)} is VALID [2018-11-14 16:54:05,233 INFO L256 TraceCheckUtils]: 113: Hoare triple {9341#(<= main_~v~0 7)} call #t~ret10 := insert(~#set~0.base, ~#set~0.offset, ~n~0, #t~mem9); {9332#true} is VALID [2018-11-14 16:54:05,233 INFO L273 TraceCheckUtils]: 114: Hoare triple {9332#true} ~set.base, ~set.offset := #in~set.base, #in~set.offset;~size := #in~size;~value := #in~value;call write~int(~value, ~set.base, ~set.offset + ~size * 4, 4);#res := ~size + 1; {9332#true} is VALID [2018-11-14 16:54:05,233 INFO L273 TraceCheckUtils]: 115: Hoare triple {9332#true} assume true; {9332#true} is VALID [2018-11-14 16:54:05,234 INFO L268 TraceCheckUtils]: 116: Hoare quadruple {9332#true} {9341#(<= main_~v~0 7)} #134#return; {9341#(<= main_~v~0 7)} is VALID [2018-11-14 16:54:05,234 INFO L273 TraceCheckUtils]: 117: Hoare triple {9341#(<= main_~v~0 7)} assume -2147483648 <= #t~ret10 && #t~ret10 <= 2147483647;~n~0 := #t~ret10;havoc #t~ret10;havoc #t~mem9; {9341#(<= main_~v~0 7)} is VALID [2018-11-14 16:54:05,235 INFO L273 TraceCheckUtils]: 118: Hoare triple {9341#(<= main_~v~0 7)} #t~post6 := ~v~0;~v~0 := #t~post6 + 1;havoc #t~post6; {9342#(<= main_~v~0 8)} is VALID [2018-11-14 16:54:05,235 INFO L273 TraceCheckUtils]: 119: Hoare triple {9342#(<= main_~v~0 8)} assume true; {9342#(<= main_~v~0 8)} is VALID [2018-11-14 16:54:05,235 INFO L273 TraceCheckUtils]: 120: Hoare triple {9342#(<= main_~v~0 8)} assume !(~v~0 < 100000); {9333#false} is VALID [2018-11-14 16:54:05,236 INFO L273 TraceCheckUtils]: 121: Hoare triple {9333#false} ~x~0 := 0; {9333#false} is VALID [2018-11-14 16:54:05,236 INFO L273 TraceCheckUtils]: 122: Hoare triple {9333#false} assume true; {9333#false} is VALID [2018-11-14 16:54:05,236 INFO L273 TraceCheckUtils]: 123: Hoare triple {9333#false} assume !!(~x~0 < ~n~0);~y~0 := ~x~0 + 1; {9333#false} is VALID [2018-11-14 16:54:05,236 INFO L273 TraceCheckUtils]: 124: Hoare triple {9333#false} assume true; {9333#false} is VALID [2018-11-14 16:54:05,236 INFO L273 TraceCheckUtils]: 125: Hoare triple {9333#false} assume !!(~y~0 < ~n~0);call #t~mem13 := read~int(~#set~0.base, ~#set~0.offset + ~x~0 * 4, 4);call #t~mem14 := read~int(~#set~0.base, ~#set~0.offset + ~y~0 * 4, 4); {9333#false} is VALID [2018-11-14 16:54:05,237 INFO L256 TraceCheckUtils]: 126: Hoare triple {9333#false} call __VERIFIER_assert((if #t~mem13 != #t~mem14 then 1 else 0)); {9333#false} is VALID [2018-11-14 16:54:05,237 INFO L273 TraceCheckUtils]: 127: Hoare triple {9333#false} ~cond := #in~cond; {9333#false} is VALID [2018-11-14 16:54:05,237 INFO L273 TraceCheckUtils]: 128: Hoare triple {9333#false} assume ~cond == 0; {9333#false} is VALID [2018-11-14 16:54:05,237 INFO L273 TraceCheckUtils]: 129: Hoare triple {9333#false} assume !false; {9333#false} is VALID [2018-11-14 16:54:05,246 INFO L134 CoverageAnalysis]: Checked inductivity of 367 backedges. 0 proven. 186 refuted. 0 times theorem prover too weak. 181 trivial. 0 not checked. [2018-11-14 16:54:05,266 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 16:54:05,266 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 12 [2018-11-14 16:54:05,267 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 130 [2018-11-14 16:54:05,267 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 16:54:05,268 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states. [2018-11-14 16:54:05,357 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 104 edges. 104 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 16:54:05,357 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-11-14 16:54:05,357 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-11-14 16:54:05,358 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2018-11-14 16:54:05,358 INFO L87 Difference]: Start difference. First operand 216 states and 278 transitions. Second operand 12 states. [2018-11-14 16:54:06,631 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:54:06,631 INFO L93 Difference]: Finished difference Result 297 states and 383 transitions. [2018-11-14 16:54:06,631 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-14 16:54:06,632 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 130 [2018-11-14 16:54:06,632 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 16:54:06,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-11-14 16:54:06,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 164 transitions. [2018-11-14 16:54:06,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-11-14 16:54:06,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 164 transitions. [2018-11-14 16:54:06,637 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states and 164 transitions. [2018-11-14 16:54:07,181 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 164 edges. 164 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 16:54:07,189 INFO L225 Difference]: With dead ends: 297 [2018-11-14 16:54:07,189 INFO L226 Difference]: Without dead ends: 282 [2018-11-14 16:54:07,190 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 140 GetRequests, 130 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2018-11-14 16:54:07,190 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 282 states. [2018-11-14 16:54:07,551 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 282 to 242. [2018-11-14 16:54:07,552 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 16:54:07,552 INFO L82 GeneralOperation]: Start isEquivalent. First operand 282 states. Second operand 242 states. [2018-11-14 16:54:07,552 INFO L74 IsIncluded]: Start isIncluded. First operand 282 states. Second operand 242 states. [2018-11-14 16:54:07,552 INFO L87 Difference]: Start difference. First operand 282 states. Second operand 242 states. [2018-11-14 16:54:07,564 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:54:07,564 INFO L93 Difference]: Finished difference Result 282 states and 366 transitions. [2018-11-14 16:54:07,565 INFO L276 IsEmpty]: Start isEmpty. Operand 282 states and 366 transitions. [2018-11-14 16:54:07,566 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:54:07,567 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:54:07,567 INFO L74 IsIncluded]: Start isIncluded. First operand 242 states. Second operand 282 states. [2018-11-14 16:54:07,567 INFO L87 Difference]: Start difference. First operand 242 states. Second operand 282 states. [2018-11-14 16:54:07,579 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:54:07,579 INFO L93 Difference]: Finished difference Result 282 states and 366 transitions. [2018-11-14 16:54:07,579 INFO L276 IsEmpty]: Start isEmpty. Operand 282 states and 366 transitions. [2018-11-14 16:54:07,581 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:54:07,581 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:54:07,581 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 16:54:07,581 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 16:54:07,582 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 242 states. [2018-11-14 16:54:07,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 242 states to 242 states and 313 transitions. [2018-11-14 16:54:07,591 INFO L78 Accepts]: Start accepts. Automaton has 242 states and 313 transitions. Word has length 130 [2018-11-14 16:54:07,591 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 16:54:07,592 INFO L480 AbstractCegarLoop]: Abstraction has 242 states and 313 transitions. [2018-11-14 16:54:07,592 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-11-14 16:54:07,592 INFO L276 IsEmpty]: Start isEmpty. Operand 242 states and 313 transitions. [2018-11-14 16:54:07,594 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2018-11-14 16:54:07,594 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 16:54:07,595 INFO L375 BasicCegarLoop]: trace histogram [10, 10, 9, 9, 9, 9, 9, 9, 9, 8, 7, 7, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 16:54:07,595 INFO L423 AbstractCegarLoop]: === Iteration 12 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 16:54:07,595 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 16:54:07,595 INFO L82 PathProgramCache]: Analyzing trace with hash 932037010, now seen corresponding path program 3 times [2018-11-14 16:54:07,596 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 16:54:07,596 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 16:54:07,596 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 16:54:07,596 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-14 16:54:07,597 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 16:54:07,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:54:08,642 INFO L256 TraceCheckUtils]: 0: Hoare triple {11002#true} call ULTIMATE.init(); {11002#true} is VALID [2018-11-14 16:54:08,642 INFO L273 TraceCheckUtils]: 1: Hoare triple {11002#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {11002#true} is VALID [2018-11-14 16:54:08,642 INFO L273 TraceCheckUtils]: 2: Hoare triple {11002#true} assume true; {11002#true} is VALID [2018-11-14 16:54:08,642 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {11002#true} {11002#true} #126#return; {11002#true} is VALID [2018-11-14 16:54:08,643 INFO L256 TraceCheckUtils]: 4: Hoare triple {11002#true} call #t~ret15 := main(); {11002#true} is VALID [2018-11-14 16:54:08,643 INFO L273 TraceCheckUtils]: 5: Hoare triple {11002#true} ~n~0 := 0;call ~#set~0.base, ~#set~0.offset := #Ultimate.alloc(400000);havoc ~x~0;havoc ~y~0;~x~0 := 0; {11002#true} is VALID [2018-11-14 16:54:08,643 INFO L273 TraceCheckUtils]: 6: Hoare triple {11002#true} assume true; {11002#true} is VALID [2018-11-14 16:54:08,643 INFO L273 TraceCheckUtils]: 7: Hoare triple {11002#true} assume !(~x~0 < ~n~0); {11002#true} is VALID [2018-11-14 16:54:08,644 INFO L273 TraceCheckUtils]: 8: Hoare triple {11002#true} call ~#values~0.base, ~#values~0.offset := #Ultimate.alloc(400000);havoc ~v~0;~v~0 := 0; {11004#(= main_~v~0 0)} is VALID [2018-11-14 16:54:08,644 INFO L273 TraceCheckUtils]: 9: Hoare triple {11004#(= main_~v~0 0)} assume true; {11004#(= main_~v~0 0)} is VALID [2018-11-14 16:54:08,645 INFO L273 TraceCheckUtils]: 10: Hoare triple {11004#(= main_~v~0 0)} assume !!(~v~0 < 100000);call #t~mem7 := read~int(~#values~0.base, ~#values~0.offset + ~v~0 * 4, 4); {11004#(= main_~v~0 0)} is VALID [2018-11-14 16:54:08,645 INFO L256 TraceCheckUtils]: 11: Hoare triple {11004#(= main_~v~0 0)} call #t~ret8 := elem_exists(~#set~0.base, ~#set~0.offset, ~n~0, #t~mem7); {11002#true} is VALID [2018-11-14 16:54:08,645 INFO L273 TraceCheckUtils]: 12: Hoare triple {11002#true} ~set.base, ~set.offset := #in~set.base, #in~set.offset;~size := #in~size;~value := #in~value;havoc ~i~0;~i~0 := 0; {11002#true} is VALID [2018-11-14 16:54:08,645 INFO L273 TraceCheckUtils]: 13: Hoare triple {11002#true} assume true; {11002#true} is VALID [2018-11-14 16:54:08,645 INFO L273 TraceCheckUtils]: 14: Hoare triple {11002#true} assume !(~i~0 < ~size); {11002#true} is VALID [2018-11-14 16:54:08,645 INFO L273 TraceCheckUtils]: 15: Hoare triple {11002#true} #res := 0; {11002#true} is VALID [2018-11-14 16:54:08,645 INFO L273 TraceCheckUtils]: 16: Hoare triple {11002#true} assume true; {11002#true} is VALID [2018-11-14 16:54:08,646 INFO L268 TraceCheckUtils]: 17: Hoare quadruple {11002#true} {11004#(= main_~v~0 0)} #132#return; {11004#(= main_~v~0 0)} is VALID [2018-11-14 16:54:08,646 INFO L273 TraceCheckUtils]: 18: Hoare triple {11004#(= main_~v~0 0)} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647; {11004#(= main_~v~0 0)} is VALID [2018-11-14 16:54:08,647 INFO L273 TraceCheckUtils]: 19: Hoare triple {11004#(= main_~v~0 0)} assume #t~ret8 == 0;havoc #t~mem7;havoc #t~ret8;call #t~mem9 := read~int(~#values~0.base, ~#values~0.offset + ~v~0 * 4, 4); {11004#(= main_~v~0 0)} is VALID [2018-11-14 16:54:08,647 INFO L256 TraceCheckUtils]: 20: Hoare triple {11004#(= main_~v~0 0)} call #t~ret10 := insert(~#set~0.base, ~#set~0.offset, ~n~0, #t~mem9); {11002#true} is VALID [2018-11-14 16:54:08,647 INFO L273 TraceCheckUtils]: 21: Hoare triple {11002#true} ~set.base, ~set.offset := #in~set.base, #in~set.offset;~size := #in~size;~value := #in~value;call write~int(~value, ~set.base, ~set.offset + ~size * 4, 4);#res := ~size + 1; {11002#true} is VALID [2018-11-14 16:54:08,647 INFO L273 TraceCheckUtils]: 22: Hoare triple {11002#true} assume true; {11002#true} is VALID [2018-11-14 16:54:08,648 INFO L268 TraceCheckUtils]: 23: Hoare quadruple {11002#true} {11004#(= main_~v~0 0)} #134#return; {11004#(= main_~v~0 0)} is VALID [2018-11-14 16:54:08,648 INFO L273 TraceCheckUtils]: 24: Hoare triple {11004#(= main_~v~0 0)} assume -2147483648 <= #t~ret10 && #t~ret10 <= 2147483647;~n~0 := #t~ret10;havoc #t~ret10;havoc #t~mem9; {11004#(= main_~v~0 0)} is VALID [2018-11-14 16:54:08,648 INFO L273 TraceCheckUtils]: 25: Hoare triple {11004#(= main_~v~0 0)} #t~post6 := ~v~0;~v~0 := #t~post6 + 1;havoc #t~post6; {11005#(<= main_~v~0 1)} is VALID [2018-11-14 16:54:08,649 INFO L273 TraceCheckUtils]: 26: Hoare triple {11005#(<= main_~v~0 1)} assume true; {11005#(<= main_~v~0 1)} is VALID [2018-11-14 16:54:08,649 INFO L273 TraceCheckUtils]: 27: Hoare triple {11005#(<= main_~v~0 1)} assume !!(~v~0 < 100000);call #t~mem7 := read~int(~#values~0.base, ~#values~0.offset + ~v~0 * 4, 4); {11005#(<= main_~v~0 1)} is VALID [2018-11-14 16:54:08,649 INFO L256 TraceCheckUtils]: 28: Hoare triple {11005#(<= main_~v~0 1)} call #t~ret8 := elem_exists(~#set~0.base, ~#set~0.offset, ~n~0, #t~mem7); {11002#true} is VALID [2018-11-14 16:54:08,649 INFO L273 TraceCheckUtils]: 29: Hoare triple {11002#true} ~set.base, ~set.offset := #in~set.base, #in~set.offset;~size := #in~size;~value := #in~value;havoc ~i~0;~i~0 := 0; {11002#true} is VALID [2018-11-14 16:54:08,649 INFO L273 TraceCheckUtils]: 30: Hoare triple {11002#true} assume true; {11002#true} is VALID [2018-11-14 16:54:08,650 INFO L273 TraceCheckUtils]: 31: Hoare triple {11002#true} assume !!(~i~0 < ~size);call #t~mem1 := read~int(~set.base, ~set.offset + ~i~0 * 4, 4); {11002#true} is VALID [2018-11-14 16:54:08,650 INFO L273 TraceCheckUtils]: 32: Hoare triple {11002#true} assume #t~mem1 == ~value;havoc #t~mem1;#res := 1; {11002#true} is VALID [2018-11-14 16:54:08,650 INFO L273 TraceCheckUtils]: 33: Hoare triple {11002#true} assume true; {11002#true} is VALID [2018-11-14 16:54:08,651 INFO L268 TraceCheckUtils]: 34: Hoare quadruple {11002#true} {11005#(<= main_~v~0 1)} #132#return; {11005#(<= main_~v~0 1)} is VALID [2018-11-14 16:54:08,652 INFO L273 TraceCheckUtils]: 35: Hoare triple {11005#(<= main_~v~0 1)} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647; {11005#(<= main_~v~0 1)} is VALID [2018-11-14 16:54:08,652 INFO L273 TraceCheckUtils]: 36: Hoare triple {11005#(<= main_~v~0 1)} assume !(#t~ret8 == 0);havoc #t~mem7;havoc #t~ret8; {11005#(<= main_~v~0 1)} is VALID [2018-11-14 16:54:08,653 INFO L273 TraceCheckUtils]: 37: Hoare triple {11005#(<= main_~v~0 1)} #t~post6 := ~v~0;~v~0 := #t~post6 + 1;havoc #t~post6; {11006#(<= main_~v~0 2)} is VALID [2018-11-14 16:54:08,653 INFO L273 TraceCheckUtils]: 38: Hoare triple {11006#(<= main_~v~0 2)} assume true; {11006#(<= main_~v~0 2)} is VALID [2018-11-14 16:54:08,653 INFO L273 TraceCheckUtils]: 39: Hoare triple {11006#(<= main_~v~0 2)} assume !!(~v~0 < 100000);call #t~mem7 := read~int(~#values~0.base, ~#values~0.offset + ~v~0 * 4, 4); {11006#(<= main_~v~0 2)} is VALID [2018-11-14 16:54:08,654 INFO L256 TraceCheckUtils]: 40: Hoare triple {11006#(<= main_~v~0 2)} call #t~ret8 := elem_exists(~#set~0.base, ~#set~0.offset, ~n~0, #t~mem7); {11002#true} is VALID [2018-11-14 16:54:08,654 INFO L273 TraceCheckUtils]: 41: Hoare triple {11002#true} ~set.base, ~set.offset := #in~set.base, #in~set.offset;~size := #in~size;~value := #in~value;havoc ~i~0;~i~0 := 0; {11002#true} is VALID [2018-11-14 16:54:08,654 INFO L273 TraceCheckUtils]: 42: Hoare triple {11002#true} assume true; {11002#true} is VALID [2018-11-14 16:54:08,654 INFO L273 TraceCheckUtils]: 43: Hoare triple {11002#true} assume !!(~i~0 < ~size);call #t~mem1 := read~int(~set.base, ~set.offset + ~i~0 * 4, 4); {11002#true} is VALID [2018-11-14 16:54:08,654 INFO L273 TraceCheckUtils]: 44: Hoare triple {11002#true} assume #t~mem1 == ~value;havoc #t~mem1;#res := 1; {11002#true} is VALID [2018-11-14 16:54:08,654 INFO L273 TraceCheckUtils]: 45: Hoare triple {11002#true} assume true; {11002#true} is VALID [2018-11-14 16:54:08,655 INFO L268 TraceCheckUtils]: 46: Hoare quadruple {11002#true} {11006#(<= main_~v~0 2)} #132#return; {11006#(<= main_~v~0 2)} is VALID [2018-11-14 16:54:08,655 INFO L273 TraceCheckUtils]: 47: Hoare triple {11006#(<= main_~v~0 2)} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647; {11006#(<= main_~v~0 2)} is VALID [2018-11-14 16:54:08,655 INFO L273 TraceCheckUtils]: 48: Hoare triple {11006#(<= main_~v~0 2)} assume !(#t~ret8 == 0);havoc #t~mem7;havoc #t~ret8; {11006#(<= main_~v~0 2)} is VALID [2018-11-14 16:54:08,656 INFO L273 TraceCheckUtils]: 49: Hoare triple {11006#(<= main_~v~0 2)} #t~post6 := ~v~0;~v~0 := #t~post6 + 1;havoc #t~post6; {11007#(<= main_~v~0 3)} is VALID [2018-11-14 16:54:08,657 INFO L273 TraceCheckUtils]: 50: Hoare triple {11007#(<= main_~v~0 3)} assume true; {11007#(<= main_~v~0 3)} is VALID [2018-11-14 16:54:08,657 INFO L273 TraceCheckUtils]: 51: Hoare triple {11007#(<= main_~v~0 3)} assume !!(~v~0 < 100000);call #t~mem7 := read~int(~#values~0.base, ~#values~0.offset + ~v~0 * 4, 4); {11007#(<= main_~v~0 3)} is VALID [2018-11-14 16:54:08,657 INFO L256 TraceCheckUtils]: 52: Hoare triple {11007#(<= main_~v~0 3)} call #t~ret8 := elem_exists(~#set~0.base, ~#set~0.offset, ~n~0, #t~mem7); {11002#true} is VALID [2018-11-14 16:54:08,657 INFO L273 TraceCheckUtils]: 53: Hoare triple {11002#true} ~set.base, ~set.offset := #in~set.base, #in~set.offset;~size := #in~size;~value := #in~value;havoc ~i~0;~i~0 := 0; {11002#true} is VALID [2018-11-14 16:54:08,658 INFO L273 TraceCheckUtils]: 54: Hoare triple {11002#true} assume true; {11002#true} is VALID [2018-11-14 16:54:08,658 INFO L273 TraceCheckUtils]: 55: Hoare triple {11002#true} assume !!(~i~0 < ~size);call #t~mem1 := read~int(~set.base, ~set.offset + ~i~0 * 4, 4); {11002#true} is VALID [2018-11-14 16:54:08,658 INFO L273 TraceCheckUtils]: 56: Hoare triple {11002#true} assume #t~mem1 == ~value;havoc #t~mem1;#res := 1; {11002#true} is VALID [2018-11-14 16:54:08,658 INFO L273 TraceCheckUtils]: 57: Hoare triple {11002#true} assume true; {11002#true} is VALID [2018-11-14 16:54:08,659 INFO L268 TraceCheckUtils]: 58: Hoare quadruple {11002#true} {11007#(<= main_~v~0 3)} #132#return; {11007#(<= main_~v~0 3)} is VALID [2018-11-14 16:54:08,660 INFO L273 TraceCheckUtils]: 59: Hoare triple {11007#(<= main_~v~0 3)} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647; {11007#(<= main_~v~0 3)} is VALID [2018-11-14 16:54:08,660 INFO L273 TraceCheckUtils]: 60: Hoare triple {11007#(<= main_~v~0 3)} assume !(#t~ret8 == 0);havoc #t~mem7;havoc #t~ret8; {11007#(<= main_~v~0 3)} is VALID [2018-11-14 16:54:08,661 INFO L273 TraceCheckUtils]: 61: Hoare triple {11007#(<= main_~v~0 3)} #t~post6 := ~v~0;~v~0 := #t~post6 + 1;havoc #t~post6; {11008#(<= main_~v~0 4)} is VALID [2018-11-14 16:54:08,661 INFO L273 TraceCheckUtils]: 62: Hoare triple {11008#(<= main_~v~0 4)} assume true; {11008#(<= main_~v~0 4)} is VALID [2018-11-14 16:54:08,662 INFO L273 TraceCheckUtils]: 63: Hoare triple {11008#(<= main_~v~0 4)} assume !!(~v~0 < 100000);call #t~mem7 := read~int(~#values~0.base, ~#values~0.offset + ~v~0 * 4, 4); {11008#(<= main_~v~0 4)} is VALID [2018-11-14 16:54:08,662 INFO L256 TraceCheckUtils]: 64: Hoare triple {11008#(<= main_~v~0 4)} call #t~ret8 := elem_exists(~#set~0.base, ~#set~0.offset, ~n~0, #t~mem7); {11002#true} is VALID [2018-11-14 16:54:08,662 INFO L273 TraceCheckUtils]: 65: Hoare triple {11002#true} ~set.base, ~set.offset := #in~set.base, #in~set.offset;~size := #in~size;~value := #in~value;havoc ~i~0;~i~0 := 0; {11002#true} is VALID [2018-11-14 16:54:08,662 INFO L273 TraceCheckUtils]: 66: Hoare triple {11002#true} assume true; {11002#true} is VALID [2018-11-14 16:54:08,662 INFO L273 TraceCheckUtils]: 67: Hoare triple {11002#true} assume !!(~i~0 < ~size);call #t~mem1 := read~int(~set.base, ~set.offset + ~i~0 * 4, 4); {11002#true} is VALID [2018-11-14 16:54:08,662 INFO L273 TraceCheckUtils]: 68: Hoare triple {11002#true} assume #t~mem1 == ~value;havoc #t~mem1;#res := 1; {11002#true} is VALID [2018-11-14 16:54:08,662 INFO L273 TraceCheckUtils]: 69: Hoare triple {11002#true} assume true; {11002#true} is VALID [2018-11-14 16:54:08,663 INFO L268 TraceCheckUtils]: 70: Hoare quadruple {11002#true} {11008#(<= main_~v~0 4)} #132#return; {11008#(<= main_~v~0 4)} is VALID [2018-11-14 16:54:08,663 INFO L273 TraceCheckUtils]: 71: Hoare triple {11008#(<= main_~v~0 4)} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647; {11008#(<= main_~v~0 4)} is VALID [2018-11-14 16:54:08,664 INFO L273 TraceCheckUtils]: 72: Hoare triple {11008#(<= main_~v~0 4)} assume !(#t~ret8 == 0);havoc #t~mem7;havoc #t~ret8; {11008#(<= main_~v~0 4)} is VALID [2018-11-14 16:54:08,664 INFO L273 TraceCheckUtils]: 73: Hoare triple {11008#(<= main_~v~0 4)} #t~post6 := ~v~0;~v~0 := #t~post6 + 1;havoc #t~post6; {11009#(<= main_~v~0 5)} is VALID [2018-11-14 16:54:08,665 INFO L273 TraceCheckUtils]: 74: Hoare triple {11009#(<= main_~v~0 5)} assume true; {11009#(<= main_~v~0 5)} is VALID [2018-11-14 16:54:08,665 INFO L273 TraceCheckUtils]: 75: Hoare triple {11009#(<= main_~v~0 5)} assume !!(~v~0 < 100000);call #t~mem7 := read~int(~#values~0.base, ~#values~0.offset + ~v~0 * 4, 4); {11009#(<= main_~v~0 5)} is VALID [2018-11-14 16:54:08,666 INFO L256 TraceCheckUtils]: 76: Hoare triple {11009#(<= main_~v~0 5)} call #t~ret8 := elem_exists(~#set~0.base, ~#set~0.offset, ~n~0, #t~mem7); {11002#true} is VALID [2018-11-14 16:54:08,666 INFO L273 TraceCheckUtils]: 77: Hoare triple {11002#true} ~set.base, ~set.offset := #in~set.base, #in~set.offset;~size := #in~size;~value := #in~value;havoc ~i~0;~i~0 := 0; {11002#true} is VALID [2018-11-14 16:54:08,666 INFO L273 TraceCheckUtils]: 78: Hoare triple {11002#true} assume true; {11002#true} is VALID [2018-11-14 16:54:08,666 INFO L273 TraceCheckUtils]: 79: Hoare triple {11002#true} assume !!(~i~0 < ~size);call #t~mem1 := read~int(~set.base, ~set.offset + ~i~0 * 4, 4); {11002#true} is VALID [2018-11-14 16:54:08,667 INFO L273 TraceCheckUtils]: 80: Hoare triple {11002#true} assume #t~mem1 == ~value;havoc #t~mem1;#res := 1; {11002#true} is VALID [2018-11-14 16:54:08,667 INFO L273 TraceCheckUtils]: 81: Hoare triple {11002#true} assume true; {11002#true} is VALID [2018-11-14 16:54:08,668 INFO L268 TraceCheckUtils]: 82: Hoare quadruple {11002#true} {11009#(<= main_~v~0 5)} #132#return; {11009#(<= main_~v~0 5)} is VALID [2018-11-14 16:54:08,668 INFO L273 TraceCheckUtils]: 83: Hoare triple {11009#(<= main_~v~0 5)} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647; {11009#(<= main_~v~0 5)} is VALID [2018-11-14 16:54:08,669 INFO L273 TraceCheckUtils]: 84: Hoare triple {11009#(<= main_~v~0 5)} assume !(#t~ret8 == 0);havoc #t~mem7;havoc #t~ret8; {11009#(<= main_~v~0 5)} is VALID [2018-11-14 16:54:08,670 INFO L273 TraceCheckUtils]: 85: Hoare triple {11009#(<= main_~v~0 5)} #t~post6 := ~v~0;~v~0 := #t~post6 + 1;havoc #t~post6; {11010#(<= main_~v~0 6)} is VALID [2018-11-14 16:54:08,670 INFO L273 TraceCheckUtils]: 86: Hoare triple {11010#(<= main_~v~0 6)} assume true; {11010#(<= main_~v~0 6)} is VALID [2018-11-14 16:54:08,671 INFO L273 TraceCheckUtils]: 87: Hoare triple {11010#(<= main_~v~0 6)} assume !!(~v~0 < 100000);call #t~mem7 := read~int(~#values~0.base, ~#values~0.offset + ~v~0 * 4, 4); {11010#(<= main_~v~0 6)} is VALID [2018-11-14 16:54:08,671 INFO L256 TraceCheckUtils]: 88: Hoare triple {11010#(<= main_~v~0 6)} call #t~ret8 := elem_exists(~#set~0.base, ~#set~0.offset, ~n~0, #t~mem7); {11002#true} is VALID [2018-11-14 16:54:08,671 INFO L273 TraceCheckUtils]: 89: Hoare triple {11002#true} ~set.base, ~set.offset := #in~set.base, #in~set.offset;~size := #in~size;~value := #in~value;havoc ~i~0;~i~0 := 0; {11002#true} is VALID [2018-11-14 16:54:08,671 INFO L273 TraceCheckUtils]: 90: Hoare triple {11002#true} assume true; {11002#true} is VALID [2018-11-14 16:54:08,672 INFO L273 TraceCheckUtils]: 91: Hoare triple {11002#true} assume !!(~i~0 < ~size);call #t~mem1 := read~int(~set.base, ~set.offset + ~i~0 * 4, 4); {11002#true} is VALID [2018-11-14 16:54:08,672 INFO L273 TraceCheckUtils]: 92: Hoare triple {11002#true} assume #t~mem1 == ~value;havoc #t~mem1;#res := 1; {11002#true} is VALID [2018-11-14 16:54:08,672 INFO L273 TraceCheckUtils]: 93: Hoare triple {11002#true} assume true; {11002#true} is VALID [2018-11-14 16:54:08,686 INFO L268 TraceCheckUtils]: 94: Hoare quadruple {11002#true} {11010#(<= main_~v~0 6)} #132#return; {11010#(<= main_~v~0 6)} is VALID [2018-11-14 16:54:08,686 INFO L273 TraceCheckUtils]: 95: Hoare triple {11010#(<= main_~v~0 6)} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647; {11010#(<= main_~v~0 6)} is VALID [2018-11-14 16:54:08,686 INFO L273 TraceCheckUtils]: 96: Hoare triple {11010#(<= main_~v~0 6)} assume !(#t~ret8 == 0);havoc #t~mem7;havoc #t~ret8; {11010#(<= main_~v~0 6)} is VALID [2018-11-14 16:54:08,687 INFO L273 TraceCheckUtils]: 97: Hoare triple {11010#(<= main_~v~0 6)} #t~post6 := ~v~0;~v~0 := #t~post6 + 1;havoc #t~post6; {11011#(<= main_~v~0 7)} is VALID [2018-11-14 16:54:08,687 INFO L273 TraceCheckUtils]: 98: Hoare triple {11011#(<= main_~v~0 7)} assume true; {11011#(<= main_~v~0 7)} is VALID [2018-11-14 16:54:08,688 INFO L273 TraceCheckUtils]: 99: Hoare triple {11011#(<= main_~v~0 7)} assume !!(~v~0 < 100000);call #t~mem7 := read~int(~#values~0.base, ~#values~0.offset + ~v~0 * 4, 4); {11011#(<= main_~v~0 7)} is VALID [2018-11-14 16:54:08,688 INFO L256 TraceCheckUtils]: 100: Hoare triple {11011#(<= main_~v~0 7)} call #t~ret8 := elem_exists(~#set~0.base, ~#set~0.offset, ~n~0, #t~mem7); {11002#true} is VALID [2018-11-14 16:54:08,688 INFO L273 TraceCheckUtils]: 101: Hoare triple {11002#true} ~set.base, ~set.offset := #in~set.base, #in~set.offset;~size := #in~size;~value := #in~value;havoc ~i~0;~i~0 := 0; {11002#true} is VALID [2018-11-14 16:54:08,688 INFO L273 TraceCheckUtils]: 102: Hoare triple {11002#true} assume true; {11002#true} is VALID [2018-11-14 16:54:08,688 INFO L273 TraceCheckUtils]: 103: Hoare triple {11002#true} assume !!(~i~0 < ~size);call #t~mem1 := read~int(~set.base, ~set.offset + ~i~0 * 4, 4); {11002#true} is VALID [2018-11-14 16:54:08,688 INFO L273 TraceCheckUtils]: 104: Hoare triple {11002#true} assume #t~mem1 == ~value;havoc #t~mem1;#res := 1; {11002#true} is VALID [2018-11-14 16:54:08,688 INFO L273 TraceCheckUtils]: 105: Hoare triple {11002#true} assume true; {11002#true} is VALID [2018-11-14 16:54:08,689 INFO L268 TraceCheckUtils]: 106: Hoare quadruple {11002#true} {11011#(<= main_~v~0 7)} #132#return; {11011#(<= main_~v~0 7)} is VALID [2018-11-14 16:54:08,690 INFO L273 TraceCheckUtils]: 107: Hoare triple {11011#(<= main_~v~0 7)} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647; {11011#(<= main_~v~0 7)} is VALID [2018-11-14 16:54:08,690 INFO L273 TraceCheckUtils]: 108: Hoare triple {11011#(<= main_~v~0 7)} assume !(#t~ret8 == 0);havoc #t~mem7;havoc #t~ret8; {11011#(<= main_~v~0 7)} is VALID [2018-11-14 16:54:08,691 INFO L273 TraceCheckUtils]: 109: Hoare triple {11011#(<= main_~v~0 7)} #t~post6 := ~v~0;~v~0 := #t~post6 + 1;havoc #t~post6; {11012#(<= main_~v~0 8)} is VALID [2018-11-14 16:54:08,691 INFO L273 TraceCheckUtils]: 110: Hoare triple {11012#(<= main_~v~0 8)} assume true; {11012#(<= main_~v~0 8)} is VALID [2018-11-14 16:54:08,692 INFO L273 TraceCheckUtils]: 111: Hoare triple {11012#(<= main_~v~0 8)} assume !!(~v~0 < 100000);call #t~mem7 := read~int(~#values~0.base, ~#values~0.offset + ~v~0 * 4, 4); {11012#(<= main_~v~0 8)} is VALID [2018-11-14 16:54:08,692 INFO L256 TraceCheckUtils]: 112: Hoare triple {11012#(<= main_~v~0 8)} call #t~ret8 := elem_exists(~#set~0.base, ~#set~0.offset, ~n~0, #t~mem7); {11002#true} is VALID [2018-11-14 16:54:08,692 INFO L273 TraceCheckUtils]: 113: Hoare triple {11002#true} ~set.base, ~set.offset := #in~set.base, #in~set.offset;~size := #in~size;~value := #in~value;havoc ~i~0;~i~0 := 0; {11002#true} is VALID [2018-11-14 16:54:08,692 INFO L273 TraceCheckUtils]: 114: Hoare triple {11002#true} assume true; {11002#true} is VALID [2018-11-14 16:54:08,692 INFO L273 TraceCheckUtils]: 115: Hoare triple {11002#true} assume !!(~i~0 < ~size);call #t~mem1 := read~int(~set.base, ~set.offset + ~i~0 * 4, 4); {11002#true} is VALID [2018-11-14 16:54:08,692 INFO L273 TraceCheckUtils]: 116: Hoare triple {11002#true} assume !(#t~mem1 == ~value);havoc #t~mem1; {11002#true} is VALID [2018-11-14 16:54:08,692 INFO L273 TraceCheckUtils]: 117: Hoare triple {11002#true} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {11002#true} is VALID [2018-11-14 16:54:08,693 INFO L273 TraceCheckUtils]: 118: Hoare triple {11002#true} assume true; {11002#true} is VALID [2018-11-14 16:54:08,693 INFO L273 TraceCheckUtils]: 119: Hoare triple {11002#true} assume !(~i~0 < ~size); {11002#true} is VALID [2018-11-14 16:54:08,693 INFO L273 TraceCheckUtils]: 120: Hoare triple {11002#true} #res := 0; {11002#true} is VALID [2018-11-14 16:54:08,693 INFO L273 TraceCheckUtils]: 121: Hoare triple {11002#true} assume true; {11002#true} is VALID [2018-11-14 16:54:08,694 INFO L268 TraceCheckUtils]: 122: Hoare quadruple {11002#true} {11012#(<= main_~v~0 8)} #132#return; {11012#(<= main_~v~0 8)} is VALID [2018-11-14 16:54:08,694 INFO L273 TraceCheckUtils]: 123: Hoare triple {11012#(<= main_~v~0 8)} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647; {11012#(<= main_~v~0 8)} is VALID [2018-11-14 16:54:08,694 INFO L273 TraceCheckUtils]: 124: Hoare triple {11012#(<= main_~v~0 8)} assume #t~ret8 == 0;havoc #t~mem7;havoc #t~ret8;call #t~mem9 := read~int(~#values~0.base, ~#values~0.offset + ~v~0 * 4, 4); {11012#(<= main_~v~0 8)} is VALID [2018-11-14 16:54:08,695 INFO L256 TraceCheckUtils]: 125: Hoare triple {11012#(<= main_~v~0 8)} call #t~ret10 := insert(~#set~0.base, ~#set~0.offset, ~n~0, #t~mem9); {11002#true} is VALID [2018-11-14 16:54:08,695 INFO L273 TraceCheckUtils]: 126: Hoare triple {11002#true} ~set.base, ~set.offset := #in~set.base, #in~set.offset;~size := #in~size;~value := #in~value;call write~int(~value, ~set.base, ~set.offset + ~size * 4, 4);#res := ~size + 1; {11002#true} is VALID [2018-11-14 16:54:08,695 INFO L273 TraceCheckUtils]: 127: Hoare triple {11002#true} assume true; {11002#true} is VALID [2018-11-14 16:54:08,696 INFO L268 TraceCheckUtils]: 128: Hoare quadruple {11002#true} {11012#(<= main_~v~0 8)} #134#return; {11012#(<= main_~v~0 8)} is VALID [2018-11-14 16:54:08,697 INFO L273 TraceCheckUtils]: 129: Hoare triple {11012#(<= main_~v~0 8)} assume -2147483648 <= #t~ret10 && #t~ret10 <= 2147483647;~n~0 := #t~ret10;havoc #t~ret10;havoc #t~mem9; {11012#(<= main_~v~0 8)} is VALID [2018-11-14 16:54:08,697 INFO L273 TraceCheckUtils]: 130: Hoare triple {11012#(<= main_~v~0 8)} #t~post6 := ~v~0;~v~0 := #t~post6 + 1;havoc #t~post6; {11013#(<= main_~v~0 9)} is VALID [2018-11-14 16:54:08,698 INFO L273 TraceCheckUtils]: 131: Hoare triple {11013#(<= main_~v~0 9)} assume true; {11013#(<= main_~v~0 9)} is VALID [2018-11-14 16:54:08,698 INFO L273 TraceCheckUtils]: 132: Hoare triple {11013#(<= main_~v~0 9)} assume !(~v~0 < 100000); {11003#false} is VALID [2018-11-14 16:54:08,698 INFO L273 TraceCheckUtils]: 133: Hoare triple {11003#false} ~x~0 := 0; {11003#false} is VALID [2018-11-14 16:54:08,698 INFO L273 TraceCheckUtils]: 134: Hoare triple {11003#false} assume true; {11003#false} is VALID [2018-11-14 16:54:08,698 INFO L273 TraceCheckUtils]: 135: Hoare triple {11003#false} assume !!(~x~0 < ~n~0);~y~0 := ~x~0 + 1; {11003#false} is VALID [2018-11-14 16:54:08,698 INFO L273 TraceCheckUtils]: 136: Hoare triple {11003#false} assume true; {11003#false} is VALID [2018-11-14 16:54:08,699 INFO L273 TraceCheckUtils]: 137: Hoare triple {11003#false} assume !!(~y~0 < ~n~0);call #t~mem13 := read~int(~#set~0.base, ~#set~0.offset + ~x~0 * 4, 4);call #t~mem14 := read~int(~#set~0.base, ~#set~0.offset + ~y~0 * 4, 4); {11003#false} is VALID [2018-11-14 16:54:08,699 INFO L256 TraceCheckUtils]: 138: Hoare triple {11003#false} call __VERIFIER_assert((if #t~mem13 != #t~mem14 then 1 else 0)); {11003#false} is VALID [2018-11-14 16:54:08,699 INFO L273 TraceCheckUtils]: 139: Hoare triple {11003#false} ~cond := #in~cond; {11003#false} is VALID [2018-11-14 16:54:08,699 INFO L273 TraceCheckUtils]: 140: Hoare triple {11003#false} assume ~cond == 0; {11003#false} is VALID [2018-11-14 16:54:08,699 INFO L273 TraceCheckUtils]: 141: Hoare triple {11003#false} assume !false; {11003#false} is VALID [2018-11-14 16:54:08,710 INFO L134 CoverageAnalysis]: Checked inductivity of 466 backedges. 0 proven. 236 refuted. 0 times theorem prover too weak. 230 trivial. 0 not checked. [2018-11-14 16:54:08,710 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-14 16:54:08,711 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-14 16:54:08,719 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-14 16:54:08,756 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-11-14 16:54:08,756 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-14 16:54:08,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:54:08,788 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 16:54:09,677 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 40 treesize of output 48 [2018-11-14 16:54:09,702 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 39 treesize of output 51 [2018-11-14 16:54:09,710 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-11-14 16:54:09,757 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 34 treesize of output 53 [2018-11-14 16:54:09,766 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2018-11-14 16:54:09,802 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-11-14 16:54:09,850 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 9 dim-0 vars, and 3 xjuncts. [2018-11-14 16:54:09,850 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 5 variables, input treesize:51, output treesize:104 [2018-11-14 16:54:09,862 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-14 16:54:18,584 WARN L179 SmtUtils]: Spent 7.72 s on a formula simplification. DAG size of input: 56 DAG size of output: 33 [2018-11-14 16:54:19,354 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 59 treesize of output 55 [2018-11-14 16:54:19,363 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 36 [2018-11-14 16:54:19,366 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-14 16:54:19,412 INFO L682 Elim1Store]: detected equality via solver [2018-11-14 16:54:19,417 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 35 [2018-11-14 16:54:19,421 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-14 16:54:19,462 INFO L682 Elim1Store]: detected equality via solver [2018-11-14 16:54:19,463 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 31 [2018-11-14 16:54:19,466 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-14 16:54:19,494 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-14 16:54:19,557 INFO L267 ElimStorePlain]: Start of recursive call 1: 8 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-14 16:54:19,558 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 10 variables, input treesize:83, output treesize:4 [2018-11-14 16:54:19,563 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-14 16:54:19,647 INFO L256 TraceCheckUtils]: 0: Hoare triple {11002#true} call ULTIMATE.init(); {11002#true} is VALID [2018-11-14 16:54:19,647 INFO L273 TraceCheckUtils]: 1: Hoare triple {11002#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {11002#true} is VALID [2018-11-14 16:54:19,647 INFO L273 TraceCheckUtils]: 2: Hoare triple {11002#true} assume true; {11002#true} is VALID [2018-11-14 16:54:19,647 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {11002#true} {11002#true} #126#return; {11002#true} is VALID [2018-11-14 16:54:19,647 INFO L256 TraceCheckUtils]: 4: Hoare triple {11002#true} call #t~ret15 := main(); {11002#true} is VALID [2018-11-14 16:54:19,648 INFO L273 TraceCheckUtils]: 5: Hoare triple {11002#true} ~n~0 := 0;call ~#set~0.base, ~#set~0.offset := #Ultimate.alloc(400000);havoc ~x~0;havoc ~y~0;~x~0 := 0; {11032#(= |main_~#set~0.offset| 0)} is VALID [2018-11-14 16:54:19,648 INFO L273 TraceCheckUtils]: 6: Hoare triple {11032#(= |main_~#set~0.offset| 0)} assume true; {11032#(= |main_~#set~0.offset| 0)} is VALID [2018-11-14 16:54:19,648 INFO L273 TraceCheckUtils]: 7: Hoare triple {11032#(= |main_~#set~0.offset| 0)} assume !(~x~0 < ~n~0); {11032#(= |main_~#set~0.offset| 0)} is VALID [2018-11-14 16:54:19,666 INFO L273 TraceCheckUtils]: 8: Hoare triple {11032#(= |main_~#set~0.offset| 0)} call ~#values~0.base, ~#values~0.offset := #Ultimate.alloc(400000);havoc ~v~0;~v~0 := 0; {11032#(= |main_~#set~0.offset| 0)} is VALID [2018-11-14 16:54:19,680 INFO L273 TraceCheckUtils]: 9: Hoare triple {11032#(= |main_~#set~0.offset| 0)} assume true; {11032#(= |main_~#set~0.offset| 0)} is VALID [2018-11-14 16:54:19,689 INFO L273 TraceCheckUtils]: 10: Hoare triple {11032#(= |main_~#set~0.offset| 0)} assume !!(~v~0 < 100000);call #t~mem7 := read~int(~#values~0.base, ~#values~0.offset + ~v~0 * 4, 4); {11032#(= |main_~#set~0.offset| 0)} is VALID [2018-11-14 16:54:19,689 INFO L256 TraceCheckUtils]: 11: Hoare triple {11032#(= |main_~#set~0.offset| 0)} call #t~ret8 := elem_exists(~#set~0.base, ~#set~0.offset, ~n~0, #t~mem7); {11002#true} is VALID [2018-11-14 16:54:19,689 INFO L273 TraceCheckUtils]: 12: Hoare triple {11002#true} ~set.base, ~set.offset := #in~set.base, #in~set.offset;~size := #in~size;~value := #in~value;havoc ~i~0;~i~0 := 0; {11002#true} is VALID [2018-11-14 16:54:19,689 INFO L273 TraceCheckUtils]: 13: Hoare triple {11002#true} assume true; {11002#true} is VALID [2018-11-14 16:54:19,690 INFO L273 TraceCheckUtils]: 14: Hoare triple {11002#true} assume !(~i~0 < ~size); {11002#true} is VALID [2018-11-14 16:54:19,690 INFO L273 TraceCheckUtils]: 15: Hoare triple {11002#true} #res := 0; {11002#true} is VALID [2018-11-14 16:54:19,690 INFO L273 TraceCheckUtils]: 16: Hoare triple {11002#true} assume true; {11002#true} is VALID [2018-11-14 16:54:19,704 INFO L268 TraceCheckUtils]: 17: Hoare quadruple {11002#true} {11032#(= |main_~#set~0.offset| 0)} #132#return; {11032#(= |main_~#set~0.offset| 0)} is VALID [2018-11-14 16:54:19,704 INFO L273 TraceCheckUtils]: 18: Hoare triple {11032#(= |main_~#set~0.offset| 0)} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647; {11032#(= |main_~#set~0.offset| 0)} is VALID [2018-11-14 16:54:19,704 INFO L273 TraceCheckUtils]: 19: Hoare triple {11032#(= |main_~#set~0.offset| 0)} assume #t~ret8 == 0;havoc #t~mem7;havoc #t~ret8;call #t~mem9 := read~int(~#values~0.base, ~#values~0.offset + ~v~0 * 4, 4); {11032#(= |main_~#set~0.offset| 0)} is VALID [2018-11-14 16:54:19,705 INFO L256 TraceCheckUtils]: 20: Hoare triple {11032#(= |main_~#set~0.offset| 0)} call #t~ret10 := insert(~#set~0.base, ~#set~0.offset, ~n~0, #t~mem9); {11002#true} is VALID [2018-11-14 16:54:19,705 INFO L273 TraceCheckUtils]: 21: Hoare triple {11002#true} ~set.base, ~set.offset := #in~set.base, #in~set.offset;~size := #in~size;~value := #in~value;call write~int(~value, ~set.base, ~set.offset + ~size * 4, 4);#res := ~size + 1; {11002#true} is VALID [2018-11-14 16:54:19,705 INFO L273 TraceCheckUtils]: 22: Hoare triple {11002#true} assume true; {11002#true} is VALID [2018-11-14 16:54:19,706 INFO L268 TraceCheckUtils]: 23: Hoare quadruple {11002#true} {11032#(= |main_~#set~0.offset| 0)} #134#return; {11032#(= |main_~#set~0.offset| 0)} is VALID [2018-11-14 16:54:19,706 INFO L273 TraceCheckUtils]: 24: Hoare triple {11032#(= |main_~#set~0.offset| 0)} assume -2147483648 <= #t~ret10 && #t~ret10 <= 2147483647;~n~0 := #t~ret10;havoc #t~ret10;havoc #t~mem9; {11032#(= |main_~#set~0.offset| 0)} is VALID [2018-11-14 16:54:19,706 INFO L273 TraceCheckUtils]: 25: Hoare triple {11032#(= |main_~#set~0.offset| 0)} #t~post6 := ~v~0;~v~0 := #t~post6 + 1;havoc #t~post6; {11032#(= |main_~#set~0.offset| 0)} is VALID [2018-11-14 16:54:19,706 INFO L273 TraceCheckUtils]: 26: Hoare triple {11032#(= |main_~#set~0.offset| 0)} assume true; {11032#(= |main_~#set~0.offset| 0)} is VALID [2018-11-14 16:54:19,707 INFO L273 TraceCheckUtils]: 27: Hoare triple {11032#(= |main_~#set~0.offset| 0)} assume !!(~v~0 < 100000);call #t~mem7 := read~int(~#values~0.base, ~#values~0.offset + ~v~0 * 4, 4); {11032#(= |main_~#set~0.offset| 0)} is VALID [2018-11-14 16:54:19,707 INFO L256 TraceCheckUtils]: 28: Hoare triple {11032#(= |main_~#set~0.offset| 0)} call #t~ret8 := elem_exists(~#set~0.base, ~#set~0.offset, ~n~0, #t~mem7); {11002#true} is VALID [2018-11-14 16:54:19,707 INFO L273 TraceCheckUtils]: 29: Hoare triple {11002#true} ~set.base, ~set.offset := #in~set.base, #in~set.offset;~size := #in~size;~value := #in~value;havoc ~i~0;~i~0 := 0; {11002#true} is VALID [2018-11-14 16:54:19,707 INFO L273 TraceCheckUtils]: 30: Hoare triple {11002#true} assume true; {11002#true} is VALID [2018-11-14 16:54:19,707 INFO L273 TraceCheckUtils]: 31: Hoare triple {11002#true} assume !!(~i~0 < ~size);call #t~mem1 := read~int(~set.base, ~set.offset + ~i~0 * 4, 4); {11002#true} is VALID [2018-11-14 16:54:19,707 INFO L273 TraceCheckUtils]: 32: Hoare triple {11002#true} assume #t~mem1 == ~value;havoc #t~mem1;#res := 1; {11002#true} is VALID [2018-11-14 16:54:19,707 INFO L273 TraceCheckUtils]: 33: Hoare triple {11002#true} assume true; {11002#true} is VALID [2018-11-14 16:54:19,708 INFO L268 TraceCheckUtils]: 34: Hoare quadruple {11002#true} {11032#(= |main_~#set~0.offset| 0)} #132#return; {11032#(= |main_~#set~0.offset| 0)} is VALID [2018-11-14 16:54:19,708 INFO L273 TraceCheckUtils]: 35: Hoare triple {11032#(= |main_~#set~0.offset| 0)} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647; {11032#(= |main_~#set~0.offset| 0)} is VALID [2018-11-14 16:54:19,709 INFO L273 TraceCheckUtils]: 36: Hoare triple {11032#(= |main_~#set~0.offset| 0)} assume !(#t~ret8 == 0);havoc #t~mem7;havoc #t~ret8; {11032#(= |main_~#set~0.offset| 0)} is VALID [2018-11-14 16:54:19,709 INFO L273 TraceCheckUtils]: 37: Hoare triple {11032#(= |main_~#set~0.offset| 0)} #t~post6 := ~v~0;~v~0 := #t~post6 + 1;havoc #t~post6; {11032#(= |main_~#set~0.offset| 0)} is VALID [2018-11-14 16:54:19,710 INFO L273 TraceCheckUtils]: 38: Hoare triple {11032#(= |main_~#set~0.offset| 0)} assume true; {11032#(= |main_~#set~0.offset| 0)} is VALID [2018-11-14 16:54:19,710 INFO L273 TraceCheckUtils]: 39: Hoare triple {11032#(= |main_~#set~0.offset| 0)} assume !!(~v~0 < 100000);call #t~mem7 := read~int(~#values~0.base, ~#values~0.offset + ~v~0 * 4, 4); {11032#(= |main_~#set~0.offset| 0)} is VALID [2018-11-14 16:54:19,711 INFO L256 TraceCheckUtils]: 40: Hoare triple {11032#(= |main_~#set~0.offset| 0)} call #t~ret8 := elem_exists(~#set~0.base, ~#set~0.offset, ~n~0, #t~mem7); {11002#true} is VALID [2018-11-14 16:54:19,711 INFO L273 TraceCheckUtils]: 41: Hoare triple {11002#true} ~set.base, ~set.offset := #in~set.base, #in~set.offset;~size := #in~size;~value := #in~value;havoc ~i~0;~i~0 := 0; {11002#true} is VALID [2018-11-14 16:54:19,711 INFO L273 TraceCheckUtils]: 42: Hoare triple {11002#true} assume true; {11002#true} is VALID [2018-11-14 16:54:19,711 INFO L273 TraceCheckUtils]: 43: Hoare triple {11002#true} assume !!(~i~0 < ~size);call #t~mem1 := read~int(~set.base, ~set.offset + ~i~0 * 4, 4); {11002#true} is VALID [2018-11-14 16:54:19,711 INFO L273 TraceCheckUtils]: 44: Hoare triple {11002#true} assume #t~mem1 == ~value;havoc #t~mem1;#res := 1; {11002#true} is VALID [2018-11-14 16:54:19,712 INFO L273 TraceCheckUtils]: 45: Hoare triple {11002#true} assume true; {11002#true} is VALID [2018-11-14 16:54:19,713 INFO L268 TraceCheckUtils]: 46: Hoare quadruple {11002#true} {11032#(= |main_~#set~0.offset| 0)} #132#return; {11032#(= |main_~#set~0.offset| 0)} is VALID [2018-11-14 16:54:19,713 INFO L273 TraceCheckUtils]: 47: Hoare triple {11032#(= |main_~#set~0.offset| 0)} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647; {11032#(= |main_~#set~0.offset| 0)} is VALID [2018-11-14 16:54:19,714 INFO L273 TraceCheckUtils]: 48: Hoare triple {11032#(= |main_~#set~0.offset| 0)} assume !(#t~ret8 == 0);havoc #t~mem7;havoc #t~ret8; {11032#(= |main_~#set~0.offset| 0)} is VALID [2018-11-14 16:54:19,714 INFO L273 TraceCheckUtils]: 49: Hoare triple {11032#(= |main_~#set~0.offset| 0)} #t~post6 := ~v~0;~v~0 := #t~post6 + 1;havoc #t~post6; {11032#(= |main_~#set~0.offset| 0)} is VALID [2018-11-14 16:54:19,714 INFO L273 TraceCheckUtils]: 50: Hoare triple {11032#(= |main_~#set~0.offset| 0)} assume true; {11032#(= |main_~#set~0.offset| 0)} is VALID [2018-11-14 16:54:19,715 INFO L273 TraceCheckUtils]: 51: Hoare triple {11032#(= |main_~#set~0.offset| 0)} assume !!(~v~0 < 100000);call #t~mem7 := read~int(~#values~0.base, ~#values~0.offset + ~v~0 * 4, 4); {11032#(= |main_~#set~0.offset| 0)} is VALID [2018-11-14 16:54:19,715 INFO L256 TraceCheckUtils]: 52: Hoare triple {11032#(= |main_~#set~0.offset| 0)} call #t~ret8 := elem_exists(~#set~0.base, ~#set~0.offset, ~n~0, #t~mem7); {11002#true} is VALID [2018-11-14 16:54:19,715 INFO L273 TraceCheckUtils]: 53: Hoare triple {11002#true} ~set.base, ~set.offset := #in~set.base, #in~set.offset;~size := #in~size;~value := #in~value;havoc ~i~0;~i~0 := 0; {11002#true} is VALID [2018-11-14 16:54:19,715 INFO L273 TraceCheckUtils]: 54: Hoare triple {11002#true} assume true; {11002#true} is VALID [2018-11-14 16:54:19,715 INFO L273 TraceCheckUtils]: 55: Hoare triple {11002#true} assume !!(~i~0 < ~size);call #t~mem1 := read~int(~set.base, ~set.offset + ~i~0 * 4, 4); {11002#true} is VALID [2018-11-14 16:54:19,715 INFO L273 TraceCheckUtils]: 56: Hoare triple {11002#true} assume #t~mem1 == ~value;havoc #t~mem1;#res := 1; {11002#true} is VALID [2018-11-14 16:54:19,715 INFO L273 TraceCheckUtils]: 57: Hoare triple {11002#true} assume true; {11002#true} is VALID [2018-11-14 16:54:19,716 INFO L268 TraceCheckUtils]: 58: Hoare quadruple {11002#true} {11032#(= |main_~#set~0.offset| 0)} #132#return; {11032#(= |main_~#set~0.offset| 0)} is VALID [2018-11-14 16:54:19,716 INFO L273 TraceCheckUtils]: 59: Hoare triple {11032#(= |main_~#set~0.offset| 0)} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647; {11032#(= |main_~#set~0.offset| 0)} is VALID [2018-11-14 16:54:19,717 INFO L273 TraceCheckUtils]: 60: Hoare triple {11032#(= |main_~#set~0.offset| 0)} assume !(#t~ret8 == 0);havoc #t~mem7;havoc #t~ret8; {11032#(= |main_~#set~0.offset| 0)} is VALID [2018-11-14 16:54:19,717 INFO L273 TraceCheckUtils]: 61: Hoare triple {11032#(= |main_~#set~0.offset| 0)} #t~post6 := ~v~0;~v~0 := #t~post6 + 1;havoc #t~post6; {11032#(= |main_~#set~0.offset| 0)} is VALID [2018-11-14 16:54:19,717 INFO L273 TraceCheckUtils]: 62: Hoare triple {11032#(= |main_~#set~0.offset| 0)} assume true; {11032#(= |main_~#set~0.offset| 0)} is VALID [2018-11-14 16:54:19,718 INFO L273 TraceCheckUtils]: 63: Hoare triple {11032#(= |main_~#set~0.offset| 0)} assume !!(~v~0 < 100000);call #t~mem7 := read~int(~#values~0.base, ~#values~0.offset + ~v~0 * 4, 4); {11032#(= |main_~#set~0.offset| 0)} is VALID [2018-11-14 16:54:19,718 INFO L256 TraceCheckUtils]: 64: Hoare triple {11032#(= |main_~#set~0.offset| 0)} call #t~ret8 := elem_exists(~#set~0.base, ~#set~0.offset, ~n~0, #t~mem7); {11002#true} is VALID [2018-11-14 16:54:19,718 INFO L273 TraceCheckUtils]: 65: Hoare triple {11002#true} ~set.base, ~set.offset := #in~set.base, #in~set.offset;~size := #in~size;~value := #in~value;havoc ~i~0;~i~0 := 0; {11002#true} is VALID [2018-11-14 16:54:19,718 INFO L273 TraceCheckUtils]: 66: Hoare triple {11002#true} assume true; {11002#true} is VALID [2018-11-14 16:54:19,718 INFO L273 TraceCheckUtils]: 67: Hoare triple {11002#true} assume !!(~i~0 < ~size);call #t~mem1 := read~int(~set.base, ~set.offset + ~i~0 * 4, 4); {11002#true} is VALID [2018-11-14 16:54:19,718 INFO L273 TraceCheckUtils]: 68: Hoare triple {11002#true} assume #t~mem1 == ~value;havoc #t~mem1;#res := 1; {11002#true} is VALID [2018-11-14 16:54:19,718 INFO L273 TraceCheckUtils]: 69: Hoare triple {11002#true} assume true; {11002#true} is VALID [2018-11-14 16:54:19,719 INFO L268 TraceCheckUtils]: 70: Hoare quadruple {11002#true} {11032#(= |main_~#set~0.offset| 0)} #132#return; {11032#(= |main_~#set~0.offset| 0)} is VALID [2018-11-14 16:54:19,719 INFO L273 TraceCheckUtils]: 71: Hoare triple {11032#(= |main_~#set~0.offset| 0)} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647; {11032#(= |main_~#set~0.offset| 0)} is VALID [2018-11-14 16:54:19,720 INFO L273 TraceCheckUtils]: 72: Hoare triple {11032#(= |main_~#set~0.offset| 0)} assume !(#t~ret8 == 0);havoc #t~mem7;havoc #t~ret8; {11032#(= |main_~#set~0.offset| 0)} is VALID [2018-11-14 16:54:19,720 INFO L273 TraceCheckUtils]: 73: Hoare triple {11032#(= |main_~#set~0.offset| 0)} #t~post6 := ~v~0;~v~0 := #t~post6 + 1;havoc #t~post6; {11032#(= |main_~#set~0.offset| 0)} is VALID [2018-11-14 16:54:19,721 INFO L273 TraceCheckUtils]: 74: Hoare triple {11032#(= |main_~#set~0.offset| 0)} assume true; {11032#(= |main_~#set~0.offset| 0)} is VALID [2018-11-14 16:54:19,721 INFO L273 TraceCheckUtils]: 75: Hoare triple {11032#(= |main_~#set~0.offset| 0)} assume !!(~v~0 < 100000);call #t~mem7 := read~int(~#values~0.base, ~#values~0.offset + ~v~0 * 4, 4); {11032#(= |main_~#set~0.offset| 0)} is VALID [2018-11-14 16:54:19,721 INFO L256 TraceCheckUtils]: 76: Hoare triple {11032#(= |main_~#set~0.offset| 0)} call #t~ret8 := elem_exists(~#set~0.base, ~#set~0.offset, ~n~0, #t~mem7); {11002#true} is VALID [2018-11-14 16:54:19,722 INFO L273 TraceCheckUtils]: 77: Hoare triple {11002#true} ~set.base, ~set.offset := #in~set.base, #in~set.offset;~size := #in~size;~value := #in~value;havoc ~i~0;~i~0 := 0; {11002#true} is VALID [2018-11-14 16:54:19,722 INFO L273 TraceCheckUtils]: 78: Hoare triple {11002#true} assume true; {11002#true} is VALID [2018-11-14 16:54:19,722 INFO L273 TraceCheckUtils]: 79: Hoare triple {11002#true} assume !!(~i~0 < ~size);call #t~mem1 := read~int(~set.base, ~set.offset + ~i~0 * 4, 4); {11002#true} is VALID [2018-11-14 16:54:19,722 INFO L273 TraceCheckUtils]: 80: Hoare triple {11002#true} assume #t~mem1 == ~value;havoc #t~mem1;#res := 1; {11002#true} is VALID [2018-11-14 16:54:19,722 INFO L273 TraceCheckUtils]: 81: Hoare triple {11002#true} assume true; {11002#true} is VALID [2018-11-14 16:54:19,723 INFO L268 TraceCheckUtils]: 82: Hoare quadruple {11002#true} {11032#(= |main_~#set~0.offset| 0)} #132#return; {11032#(= |main_~#set~0.offset| 0)} is VALID [2018-11-14 16:54:19,724 INFO L273 TraceCheckUtils]: 83: Hoare triple {11032#(= |main_~#set~0.offset| 0)} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647; {11032#(= |main_~#set~0.offset| 0)} is VALID [2018-11-14 16:54:19,724 INFO L273 TraceCheckUtils]: 84: Hoare triple {11032#(= |main_~#set~0.offset| 0)} assume !(#t~ret8 == 0);havoc #t~mem7;havoc #t~ret8; {11032#(= |main_~#set~0.offset| 0)} is VALID [2018-11-14 16:54:19,725 INFO L273 TraceCheckUtils]: 85: Hoare triple {11032#(= |main_~#set~0.offset| 0)} #t~post6 := ~v~0;~v~0 := #t~post6 + 1;havoc #t~post6; {11032#(= |main_~#set~0.offset| 0)} is VALID [2018-11-14 16:54:19,725 INFO L273 TraceCheckUtils]: 86: Hoare triple {11032#(= |main_~#set~0.offset| 0)} assume true; {11032#(= |main_~#set~0.offset| 0)} is VALID [2018-11-14 16:54:19,726 INFO L273 TraceCheckUtils]: 87: Hoare triple {11032#(= |main_~#set~0.offset| 0)} assume !!(~v~0 < 100000);call #t~mem7 := read~int(~#values~0.base, ~#values~0.offset + ~v~0 * 4, 4); {11032#(= |main_~#set~0.offset| 0)} is VALID [2018-11-14 16:54:19,726 INFO L256 TraceCheckUtils]: 88: Hoare triple {11032#(= |main_~#set~0.offset| 0)} call #t~ret8 := elem_exists(~#set~0.base, ~#set~0.offset, ~n~0, #t~mem7); {11002#true} is VALID [2018-11-14 16:54:19,726 INFO L273 TraceCheckUtils]: 89: Hoare triple {11002#true} ~set.base, ~set.offset := #in~set.base, #in~set.offset;~size := #in~size;~value := #in~value;havoc ~i~0;~i~0 := 0; {11002#true} is VALID [2018-11-14 16:54:19,727 INFO L273 TraceCheckUtils]: 90: Hoare triple {11002#true} assume true; {11002#true} is VALID [2018-11-14 16:54:19,727 INFO L273 TraceCheckUtils]: 91: Hoare triple {11002#true} assume !!(~i~0 < ~size);call #t~mem1 := read~int(~set.base, ~set.offset + ~i~0 * 4, 4); {11002#true} is VALID [2018-11-14 16:54:19,727 INFO L273 TraceCheckUtils]: 92: Hoare triple {11002#true} assume #t~mem1 == ~value;havoc #t~mem1;#res := 1; {11002#true} is VALID [2018-11-14 16:54:19,727 INFO L273 TraceCheckUtils]: 93: Hoare triple {11002#true} assume true; {11002#true} is VALID [2018-11-14 16:54:19,728 INFO L268 TraceCheckUtils]: 94: Hoare quadruple {11002#true} {11032#(= |main_~#set~0.offset| 0)} #132#return; {11032#(= |main_~#set~0.offset| 0)} is VALID [2018-11-14 16:54:19,729 INFO L273 TraceCheckUtils]: 95: Hoare triple {11032#(= |main_~#set~0.offset| 0)} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647; {11032#(= |main_~#set~0.offset| 0)} is VALID [2018-11-14 16:54:19,729 INFO L273 TraceCheckUtils]: 96: Hoare triple {11032#(= |main_~#set~0.offset| 0)} assume !(#t~ret8 == 0);havoc #t~mem7;havoc #t~ret8; {11032#(= |main_~#set~0.offset| 0)} is VALID [2018-11-14 16:54:19,729 INFO L273 TraceCheckUtils]: 97: Hoare triple {11032#(= |main_~#set~0.offset| 0)} #t~post6 := ~v~0;~v~0 := #t~post6 + 1;havoc #t~post6; {11032#(= |main_~#set~0.offset| 0)} is VALID [2018-11-14 16:54:19,730 INFO L273 TraceCheckUtils]: 98: Hoare triple {11032#(= |main_~#set~0.offset| 0)} assume true; {11032#(= |main_~#set~0.offset| 0)} is VALID [2018-11-14 16:54:19,730 INFO L273 TraceCheckUtils]: 99: Hoare triple {11032#(= |main_~#set~0.offset| 0)} assume !!(~v~0 < 100000);call #t~mem7 := read~int(~#values~0.base, ~#values~0.offset + ~v~0 * 4, 4); {11032#(= |main_~#set~0.offset| 0)} is VALID [2018-11-14 16:54:19,730 INFO L256 TraceCheckUtils]: 100: Hoare triple {11032#(= |main_~#set~0.offset| 0)} call #t~ret8 := elem_exists(~#set~0.base, ~#set~0.offset, ~n~0, #t~mem7); {11002#true} is VALID [2018-11-14 16:54:19,730 INFO L273 TraceCheckUtils]: 101: Hoare triple {11002#true} ~set.base, ~set.offset := #in~set.base, #in~set.offset;~size := #in~size;~value := #in~value;havoc ~i~0;~i~0 := 0; {11002#true} is VALID [2018-11-14 16:54:19,730 INFO L273 TraceCheckUtils]: 102: Hoare triple {11002#true} assume true; {11002#true} is VALID [2018-11-14 16:54:19,730 INFO L273 TraceCheckUtils]: 103: Hoare triple {11002#true} assume !!(~i~0 < ~size);call #t~mem1 := read~int(~set.base, ~set.offset + ~i~0 * 4, 4); {11002#true} is VALID [2018-11-14 16:54:19,731 INFO L273 TraceCheckUtils]: 104: Hoare triple {11002#true} assume #t~mem1 == ~value;havoc #t~mem1;#res := 1; {11330#(= |elem_exists_#res| 1)} is VALID [2018-11-14 16:54:19,731 INFO L273 TraceCheckUtils]: 105: Hoare triple {11330#(= |elem_exists_#res| 1)} assume true; {11330#(= |elem_exists_#res| 1)} is VALID [2018-11-14 16:54:19,733 INFO L268 TraceCheckUtils]: 106: Hoare quadruple {11330#(= |elem_exists_#res| 1)} {11032#(= |main_~#set~0.offset| 0)} #132#return; {11337#(and (= 1 |main_#t~ret8|) (= |main_~#set~0.offset| 0))} is VALID [2018-11-14 16:54:19,733 INFO L273 TraceCheckUtils]: 107: Hoare triple {11337#(and (= 1 |main_#t~ret8|) (= |main_~#set~0.offset| 0))} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647; {11337#(and (= 1 |main_#t~ret8|) (= |main_~#set~0.offset| 0))} is VALID [2018-11-14 16:54:19,734 INFO L273 TraceCheckUtils]: 108: Hoare triple {11337#(and (= 1 |main_#t~ret8|) (= |main_~#set~0.offset| 0))} assume !(#t~ret8 == 0);havoc #t~mem7;havoc #t~ret8; {11032#(= |main_~#set~0.offset| 0)} is VALID [2018-11-14 16:54:19,734 INFO L273 TraceCheckUtils]: 109: Hoare triple {11032#(= |main_~#set~0.offset| 0)} #t~post6 := ~v~0;~v~0 := #t~post6 + 1;havoc #t~post6; {11032#(= |main_~#set~0.offset| 0)} is VALID [2018-11-14 16:54:19,735 INFO L273 TraceCheckUtils]: 110: Hoare triple {11032#(= |main_~#set~0.offset| 0)} assume true; {11032#(= |main_~#set~0.offset| 0)} is VALID [2018-11-14 16:54:19,736 INFO L273 TraceCheckUtils]: 111: Hoare triple {11032#(= |main_~#set~0.offset| 0)} assume !!(~v~0 < 100000);call #t~mem7 := read~int(~#values~0.base, ~#values~0.offset + ~v~0 * 4, 4); {11353#(and (= (select (select |#memory_int| |main_~#values~0.base|) (+ (* 4 main_~v~0) |main_~#values~0.offset|)) |main_#t~mem7|) (= |main_~#set~0.offset| 0))} is VALID [2018-11-14 16:54:19,736 INFO L256 TraceCheckUtils]: 112: Hoare triple {11353#(and (= (select (select |#memory_int| |main_~#values~0.base|) (+ (* 4 main_~v~0) |main_~#values~0.offset|)) |main_#t~mem7|) (= |main_~#set~0.offset| 0))} call #t~ret8 := elem_exists(~#set~0.base, ~#set~0.offset, ~n~0, #t~mem7); {11002#true} is VALID [2018-11-14 16:54:19,737 INFO L273 TraceCheckUtils]: 113: Hoare triple {11002#true} ~set.base, ~set.offset := #in~set.base, #in~set.offset;~size := #in~size;~value := #in~value;havoc ~i~0;~i~0 := 0; {11360#(and (= |elem_exists_#in~set.offset| elem_exists_~set.offset) (<= |elem_exists_#in~size| elem_exists_~size) (= elem_exists_~i~0 0) (= elem_exists_~set.base |elem_exists_#in~set.base|) (= elem_exists_~value |elem_exists_#in~value|))} is VALID [2018-11-14 16:54:19,738 INFO L273 TraceCheckUtils]: 114: Hoare triple {11360#(and (= |elem_exists_#in~set.offset| elem_exists_~set.offset) (<= |elem_exists_#in~size| elem_exists_~size) (= elem_exists_~i~0 0) (= elem_exists_~set.base |elem_exists_#in~set.base|) (= elem_exists_~value |elem_exists_#in~value|))} assume true; {11360#(and (= |elem_exists_#in~set.offset| elem_exists_~set.offset) (<= |elem_exists_#in~size| elem_exists_~size) (= elem_exists_~i~0 0) (= elem_exists_~set.base |elem_exists_#in~set.base|) (= elem_exists_~value |elem_exists_#in~value|))} is VALID [2018-11-14 16:54:19,739 INFO L273 TraceCheckUtils]: 115: Hoare triple {11360#(and (= |elem_exists_#in~set.offset| elem_exists_~set.offset) (<= |elem_exists_#in~size| elem_exists_~size) (= elem_exists_~i~0 0) (= elem_exists_~set.base |elem_exists_#in~set.base|) (= elem_exists_~value |elem_exists_#in~value|))} assume !!(~i~0 < ~size);call #t~mem1 := read~int(~set.base, ~set.offset + ~i~0 * 4, 4); {11367#(and (= |elem_exists_#t~mem1| (select (select |#memory_int| |elem_exists_#in~set.base|) (+ |elem_exists_#in~set.offset| (* 4 elem_exists_~i~0)))) (<= |elem_exists_#in~size| elem_exists_~size) (= elem_exists_~i~0 0) (= elem_exists_~value |elem_exists_#in~value|))} is VALID [2018-11-14 16:54:19,740 INFO L273 TraceCheckUtils]: 116: Hoare triple {11367#(and (= |elem_exists_#t~mem1| (select (select |#memory_int| |elem_exists_#in~set.base|) (+ |elem_exists_#in~set.offset| (* 4 elem_exists_~i~0)))) (<= |elem_exists_#in~size| elem_exists_~size) (= elem_exists_~i~0 0) (= elem_exists_~value |elem_exists_#in~value|))} assume !(#t~mem1 == ~value);havoc #t~mem1; {11371#(and (not (= |elem_exists_#in~value| (select (select |#memory_int| |elem_exists_#in~set.base|) (+ |elem_exists_#in~set.offset| (* 4 elem_exists_~i~0))))) (<= |elem_exists_#in~size| elem_exists_~size) (= elem_exists_~i~0 0))} is VALID [2018-11-14 16:54:19,741 INFO L273 TraceCheckUtils]: 117: Hoare triple {11371#(and (not (= |elem_exists_#in~value| (select (select |#memory_int| |elem_exists_#in~set.base|) (+ |elem_exists_#in~set.offset| (* 4 elem_exists_~i~0))))) (<= |elem_exists_#in~size| elem_exists_~size) (= elem_exists_~i~0 0))} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {11375#(and (not (= (select (select |#memory_int| |elem_exists_#in~set.base|) |elem_exists_#in~set.offset|) |elem_exists_#in~value|)) (<= elem_exists_~i~0 1) (<= |elem_exists_#in~size| elem_exists_~size))} is VALID [2018-11-14 16:54:19,742 INFO L273 TraceCheckUtils]: 118: Hoare triple {11375#(and (not (= (select (select |#memory_int| |elem_exists_#in~set.base|) |elem_exists_#in~set.offset|) |elem_exists_#in~value|)) (<= elem_exists_~i~0 1) (<= |elem_exists_#in~size| elem_exists_~size))} assume true; {11375#(and (not (= (select (select |#memory_int| |elem_exists_#in~set.base|) |elem_exists_#in~set.offset|) |elem_exists_#in~value|)) (<= elem_exists_~i~0 1) (<= |elem_exists_#in~size| elem_exists_~size))} is VALID [2018-11-14 16:54:19,743 INFO L273 TraceCheckUtils]: 119: Hoare triple {11375#(and (not (= (select (select |#memory_int| |elem_exists_#in~set.base|) |elem_exists_#in~set.offset|) |elem_exists_#in~value|)) (<= elem_exists_~i~0 1) (<= |elem_exists_#in~size| elem_exists_~size))} assume !(~i~0 < ~size); {11382#(and (<= |elem_exists_#in~size| 1) (not (= (select (select |#memory_int| |elem_exists_#in~set.base|) |elem_exists_#in~set.offset|) |elem_exists_#in~value|)))} is VALID [2018-11-14 16:54:19,743 INFO L273 TraceCheckUtils]: 120: Hoare triple {11382#(and (<= |elem_exists_#in~size| 1) (not (= (select (select |#memory_int| |elem_exists_#in~set.base|) |elem_exists_#in~set.offset|) |elem_exists_#in~value|)))} #res := 0; {11382#(and (<= |elem_exists_#in~size| 1) (not (= (select (select |#memory_int| |elem_exists_#in~set.base|) |elem_exists_#in~set.offset|) |elem_exists_#in~value|)))} is VALID [2018-11-14 16:54:19,744 INFO L273 TraceCheckUtils]: 121: Hoare triple {11382#(and (<= |elem_exists_#in~size| 1) (not (= (select (select |#memory_int| |elem_exists_#in~set.base|) |elem_exists_#in~set.offset|) |elem_exists_#in~value|)))} assume true; {11382#(and (<= |elem_exists_#in~size| 1) (not (= (select (select |#memory_int| |elem_exists_#in~set.base|) |elem_exists_#in~set.offset|) |elem_exists_#in~value|)))} is VALID [2018-11-14 16:54:19,746 INFO L268 TraceCheckUtils]: 122: Hoare quadruple {11382#(and (<= |elem_exists_#in~size| 1) (not (= (select (select |#memory_int| |elem_exists_#in~set.base|) |elem_exists_#in~set.offset|) |elem_exists_#in~value|)))} {11353#(and (= (select (select |#memory_int| |main_~#values~0.base|) (+ (* 4 main_~v~0) |main_~#values~0.offset|)) |main_#t~mem7|) (= |main_~#set~0.offset| 0))} #132#return; {11392#(and (not (= (select (select |#memory_int| |main_~#set~0.base|) |main_~#set~0.offset|) (select (select |#memory_int| |main_~#values~0.base|) (+ (* 4 main_~v~0) |main_~#values~0.offset|)))) (= |main_~#set~0.offset| 0) (<= main_~n~0 1))} is VALID [2018-11-14 16:54:19,747 INFO L273 TraceCheckUtils]: 123: Hoare triple {11392#(and (not (= (select (select |#memory_int| |main_~#set~0.base|) |main_~#set~0.offset|) (select (select |#memory_int| |main_~#values~0.base|) (+ (* 4 main_~v~0) |main_~#values~0.offset|)))) (= |main_~#set~0.offset| 0) (<= main_~n~0 1))} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647; {11392#(and (not (= (select (select |#memory_int| |main_~#set~0.base|) |main_~#set~0.offset|) (select (select |#memory_int| |main_~#values~0.base|) (+ (* 4 main_~v~0) |main_~#values~0.offset|)))) (= |main_~#set~0.offset| 0) (<= main_~n~0 1))} is VALID [2018-11-14 16:54:19,749 INFO L273 TraceCheckUtils]: 124: Hoare triple {11392#(and (not (= (select (select |#memory_int| |main_~#set~0.base|) |main_~#set~0.offset|) (select (select |#memory_int| |main_~#values~0.base|) (+ (* 4 main_~v~0) |main_~#values~0.offset|)))) (= |main_~#set~0.offset| 0) (<= main_~n~0 1))} assume #t~ret8 == 0;havoc #t~mem7;havoc #t~ret8;call #t~mem9 := read~int(~#values~0.base, ~#values~0.offset + ~v~0 * 4, 4); {11399#(and (= |main_~#set~0.offset| 0) (<= main_~n~0 1) (exists ((main_~v~0 Int) (|main_~#values~0.offset| Int) (|main_~#values~0.base| Int)) (and (not (= (select (select |#memory_int| |main_~#set~0.base|) |main_~#set~0.offset|) (select (select |#memory_int| |main_~#values~0.base|) (+ (* 4 main_~v~0) |main_~#values~0.offset|)))) (= (select (select |#memory_int| |main_~#values~0.base|) (+ (* 4 main_~v~0) |main_~#values~0.offset|)) |main_#t~mem9|))))} is VALID [2018-11-14 16:54:19,750 INFO L256 TraceCheckUtils]: 125: Hoare triple {11399#(and (= |main_~#set~0.offset| 0) (<= main_~n~0 1) (exists ((main_~v~0 Int) (|main_~#values~0.offset| Int) (|main_~#values~0.base| Int)) (and (not (= (select (select |#memory_int| |main_~#set~0.base|) |main_~#set~0.offset|) (select (select |#memory_int| |main_~#values~0.base|) (+ (* 4 main_~v~0) |main_~#values~0.offset|)))) (= (select (select |#memory_int| |main_~#values~0.base|) (+ (* 4 main_~v~0) |main_~#values~0.offset|)) |main_#t~mem9|))))} call #t~ret10 := insert(~#set~0.base, ~#set~0.offset, ~n~0, #t~mem9); {11403#(= |#memory_int| |old(#memory_int)|)} is VALID [2018-11-14 16:54:19,752 INFO L273 TraceCheckUtils]: 126: Hoare triple {11403#(= |#memory_int| |old(#memory_int)|)} ~set.base, ~set.offset := #in~set.base, #in~set.offset;~size := #in~size;~value := #in~value;call write~int(~value, ~set.base, ~set.offset + ~size * 4, 4);#res := ~size + 1; {11407#(exists ((insert_~size Int)) (and (= |#memory_int| (store |old(#memory_int)| |insert_#in~set.base| (store (select |old(#memory_int)| |insert_#in~set.base|) (+ (* 4 insert_~size) |insert_#in~set.offset|) |insert_#in~value|))) (<= |insert_#res| (+ insert_~size 1)) (<= insert_~size |insert_#in~size|)))} is VALID [2018-11-14 16:54:19,753 INFO L273 TraceCheckUtils]: 127: Hoare triple {11407#(exists ((insert_~size Int)) (and (= |#memory_int| (store |old(#memory_int)| |insert_#in~set.base| (store (select |old(#memory_int)| |insert_#in~set.base|) (+ (* 4 insert_~size) |insert_#in~set.offset|) |insert_#in~value|))) (<= |insert_#res| (+ insert_~size 1)) (<= insert_~size |insert_#in~size|)))} assume true; {11407#(exists ((insert_~size Int)) (and (= |#memory_int| (store |old(#memory_int)| |insert_#in~set.base| (store (select |old(#memory_int)| |insert_#in~set.base|) (+ (* 4 insert_~size) |insert_#in~set.offset|) |insert_#in~value|))) (<= |insert_#res| (+ insert_~size 1)) (<= insert_~size |insert_#in~size|)))} is VALID [2018-11-14 16:54:19,756 INFO L268 TraceCheckUtils]: 128: Hoare quadruple {11407#(exists ((insert_~size Int)) (and (= |#memory_int| (store |old(#memory_int)| |insert_#in~set.base| (store (select |old(#memory_int)| |insert_#in~set.base|) (+ (* 4 insert_~size) |insert_#in~set.offset|) |insert_#in~value|))) (<= |insert_#res| (+ insert_~size 1)) (<= insert_~size |insert_#in~size|)))} {11399#(and (= |main_~#set~0.offset| 0) (<= main_~n~0 1) (exists ((main_~v~0 Int) (|main_~#values~0.offset| Int) (|main_~#values~0.base| Int)) (and (not (= (select (select |#memory_int| |main_~#set~0.base|) |main_~#set~0.offset|) (select (select |#memory_int| |main_~#values~0.base|) (+ (* 4 main_~v~0) |main_~#values~0.offset|)))) (= (select (select |#memory_int| |main_~#values~0.base|) (+ (* 4 main_~v~0) |main_~#values~0.offset|)) |main_#t~mem9|))))} #134#return; {11414#(or (and (exists ((v_prenex_6 Int) (v_prenex_4 Int) (v_prenex_5 Int) (insert_~size Int)) (and (<= insert_~size 1) (<= |main_#t~ret10| (+ insert_~size 1)) (not (= (select (select |#memory_int| |main_~#set~0.base|) |main_~#set~0.offset|) (select (select |#memory_int| v_prenex_6) (+ (* 4 v_prenex_4) v_prenex_5)))) (= (select (select |#memory_int| |main_~#set~0.base|) (+ |main_~#set~0.offset| (* 4 insert_~size))) (select (select |#memory_int| v_prenex_6) (+ (* 4 v_prenex_4) v_prenex_5))))) (= |main_~#set~0.offset| 0)) (and (= |main_~#set~0.offset| 0) (<= |main_#t~ret10| 1)))} is VALID [2018-11-14 16:54:19,763 INFO L273 TraceCheckUtils]: 129: Hoare triple {11414#(or (and (exists ((v_prenex_6 Int) (v_prenex_4 Int) (v_prenex_5 Int) (insert_~size Int)) (and (<= insert_~size 1) (<= |main_#t~ret10| (+ insert_~size 1)) (not (= (select (select |#memory_int| |main_~#set~0.base|) |main_~#set~0.offset|) (select (select |#memory_int| v_prenex_6) (+ (* 4 v_prenex_4) v_prenex_5)))) (= (select (select |#memory_int| |main_~#set~0.base|) (+ |main_~#set~0.offset| (* 4 insert_~size))) (select (select |#memory_int| v_prenex_6) (+ (* 4 v_prenex_4) v_prenex_5))))) (= |main_~#set~0.offset| 0)) (and (= |main_~#set~0.offset| 0) (<= |main_#t~ret10| 1)))} assume -2147483648 <= #t~ret10 && #t~ret10 <= 2147483647;~n~0 := #t~ret10;havoc #t~ret10;havoc #t~mem9; {11418#(or (and (= |main_~#set~0.offset| 0) (<= main_~n~0 1)) (and (exists ((v_prenex_6 Int) (v_prenex_4 Int) (v_prenex_5 Int) (insert_~size Int)) (and (<= insert_~size 1) (not (= (select (select |#memory_int| |main_~#set~0.base|) |main_~#set~0.offset|) (select (select |#memory_int| v_prenex_6) (+ (* 4 v_prenex_4) v_prenex_5)))) (<= main_~n~0 (+ insert_~size 1)) (= (select (select |#memory_int| |main_~#set~0.base|) (+ |main_~#set~0.offset| (* 4 insert_~size))) (select (select |#memory_int| v_prenex_6) (+ (* 4 v_prenex_4) v_prenex_5))))) (= |main_~#set~0.offset| 0)))} is VALID [2018-11-14 16:54:19,763 INFO L273 TraceCheckUtils]: 130: Hoare triple {11418#(or (and (= |main_~#set~0.offset| 0) (<= main_~n~0 1)) (and (exists ((v_prenex_6 Int) (v_prenex_4 Int) (v_prenex_5 Int) (insert_~size Int)) (and (<= insert_~size 1) (not (= (select (select |#memory_int| |main_~#set~0.base|) |main_~#set~0.offset|) (select (select |#memory_int| v_prenex_6) (+ (* 4 v_prenex_4) v_prenex_5)))) (<= main_~n~0 (+ insert_~size 1)) (= (select (select |#memory_int| |main_~#set~0.base|) (+ |main_~#set~0.offset| (* 4 insert_~size))) (select (select |#memory_int| v_prenex_6) (+ (* 4 v_prenex_4) v_prenex_5))))) (= |main_~#set~0.offset| 0)))} #t~post6 := ~v~0;~v~0 := #t~post6 + 1;havoc #t~post6; {11418#(or (and (= |main_~#set~0.offset| 0) (<= main_~n~0 1)) (and (exists ((v_prenex_6 Int) (v_prenex_4 Int) (v_prenex_5 Int) (insert_~size Int)) (and (<= insert_~size 1) (not (= (select (select |#memory_int| |main_~#set~0.base|) |main_~#set~0.offset|) (select (select |#memory_int| v_prenex_6) (+ (* 4 v_prenex_4) v_prenex_5)))) (<= main_~n~0 (+ insert_~size 1)) (= (select (select |#memory_int| |main_~#set~0.base|) (+ |main_~#set~0.offset| (* 4 insert_~size))) (select (select |#memory_int| v_prenex_6) (+ (* 4 v_prenex_4) v_prenex_5))))) (= |main_~#set~0.offset| 0)))} is VALID [2018-11-14 16:54:19,764 INFO L273 TraceCheckUtils]: 131: Hoare triple {11418#(or (and (= |main_~#set~0.offset| 0) (<= main_~n~0 1)) (and (exists ((v_prenex_6 Int) (v_prenex_4 Int) (v_prenex_5 Int) (insert_~size Int)) (and (<= insert_~size 1) (not (= (select (select |#memory_int| |main_~#set~0.base|) |main_~#set~0.offset|) (select (select |#memory_int| v_prenex_6) (+ (* 4 v_prenex_4) v_prenex_5)))) (<= main_~n~0 (+ insert_~size 1)) (= (select (select |#memory_int| |main_~#set~0.base|) (+ |main_~#set~0.offset| (* 4 insert_~size))) (select (select |#memory_int| v_prenex_6) (+ (* 4 v_prenex_4) v_prenex_5))))) (= |main_~#set~0.offset| 0)))} assume true; {11418#(or (and (= |main_~#set~0.offset| 0) (<= main_~n~0 1)) (and (exists ((v_prenex_6 Int) (v_prenex_4 Int) (v_prenex_5 Int) (insert_~size Int)) (and (<= insert_~size 1) (not (= (select (select |#memory_int| |main_~#set~0.base|) |main_~#set~0.offset|) (select (select |#memory_int| v_prenex_6) (+ (* 4 v_prenex_4) v_prenex_5)))) (<= main_~n~0 (+ insert_~size 1)) (= (select (select |#memory_int| |main_~#set~0.base|) (+ |main_~#set~0.offset| (* 4 insert_~size))) (select (select |#memory_int| v_prenex_6) (+ (* 4 v_prenex_4) v_prenex_5))))) (= |main_~#set~0.offset| 0)))} is VALID [2018-11-14 16:54:19,764 INFO L273 TraceCheckUtils]: 132: Hoare triple {11418#(or (and (= |main_~#set~0.offset| 0) (<= main_~n~0 1)) (and (exists ((v_prenex_6 Int) (v_prenex_4 Int) (v_prenex_5 Int) (insert_~size Int)) (and (<= insert_~size 1) (not (= (select (select |#memory_int| |main_~#set~0.base|) |main_~#set~0.offset|) (select (select |#memory_int| v_prenex_6) (+ (* 4 v_prenex_4) v_prenex_5)))) (<= main_~n~0 (+ insert_~size 1)) (= (select (select |#memory_int| |main_~#set~0.base|) (+ |main_~#set~0.offset| (* 4 insert_~size))) (select (select |#memory_int| v_prenex_6) (+ (* 4 v_prenex_4) v_prenex_5))))) (= |main_~#set~0.offset| 0)))} assume !(~v~0 < 100000); {11418#(or (and (= |main_~#set~0.offset| 0) (<= main_~n~0 1)) (and (exists ((v_prenex_6 Int) (v_prenex_4 Int) (v_prenex_5 Int) (insert_~size Int)) (and (<= insert_~size 1) (not (= (select (select |#memory_int| |main_~#set~0.base|) |main_~#set~0.offset|) (select (select |#memory_int| v_prenex_6) (+ (* 4 v_prenex_4) v_prenex_5)))) (<= main_~n~0 (+ insert_~size 1)) (= (select (select |#memory_int| |main_~#set~0.base|) (+ |main_~#set~0.offset| (* 4 insert_~size))) (select (select |#memory_int| v_prenex_6) (+ (* 4 v_prenex_4) v_prenex_5))))) (= |main_~#set~0.offset| 0)))} is VALID [2018-11-14 16:54:19,765 INFO L273 TraceCheckUtils]: 133: Hoare triple {11418#(or (and (= |main_~#set~0.offset| 0) (<= main_~n~0 1)) (and (exists ((v_prenex_6 Int) (v_prenex_4 Int) (v_prenex_5 Int) (insert_~size Int)) (and (<= insert_~size 1) (not (= (select (select |#memory_int| |main_~#set~0.base|) |main_~#set~0.offset|) (select (select |#memory_int| v_prenex_6) (+ (* 4 v_prenex_4) v_prenex_5)))) (<= main_~n~0 (+ insert_~size 1)) (= (select (select |#memory_int| |main_~#set~0.base|) (+ |main_~#set~0.offset| (* 4 insert_~size))) (select (select |#memory_int| v_prenex_6) (+ (* 4 v_prenex_4) v_prenex_5))))) (= |main_~#set~0.offset| 0)))} ~x~0 := 0; {11431#(or (and (= main_~x~0 0) (= |main_~#set~0.offset| 0) (<= main_~n~0 1)) (and (exists ((v_prenex_6 Int) (v_prenex_4 Int) (v_prenex_5 Int) (insert_~size Int)) (and (<= insert_~size 1) (not (= (select (select |#memory_int| |main_~#set~0.base|) |main_~#set~0.offset|) (select (select |#memory_int| v_prenex_6) (+ (* 4 v_prenex_4) v_prenex_5)))) (<= main_~n~0 (+ insert_~size 1)) (= (select (select |#memory_int| |main_~#set~0.base|) (+ |main_~#set~0.offset| (* 4 insert_~size))) (select (select |#memory_int| v_prenex_6) (+ (* 4 v_prenex_4) v_prenex_5))))) (= main_~x~0 0) (= |main_~#set~0.offset| 0)))} is VALID [2018-11-14 16:54:19,765 INFO L273 TraceCheckUtils]: 134: Hoare triple {11431#(or (and (= main_~x~0 0) (= |main_~#set~0.offset| 0) (<= main_~n~0 1)) (and (exists ((v_prenex_6 Int) (v_prenex_4 Int) (v_prenex_5 Int) (insert_~size Int)) (and (<= insert_~size 1) (not (= (select (select |#memory_int| |main_~#set~0.base|) |main_~#set~0.offset|) (select (select |#memory_int| v_prenex_6) (+ (* 4 v_prenex_4) v_prenex_5)))) (<= main_~n~0 (+ insert_~size 1)) (= (select (select |#memory_int| |main_~#set~0.base|) (+ |main_~#set~0.offset| (* 4 insert_~size))) (select (select |#memory_int| v_prenex_6) (+ (* 4 v_prenex_4) v_prenex_5))))) (= main_~x~0 0) (= |main_~#set~0.offset| 0)))} assume true; {11431#(or (and (= main_~x~0 0) (= |main_~#set~0.offset| 0) (<= main_~n~0 1)) (and (exists ((v_prenex_6 Int) (v_prenex_4 Int) (v_prenex_5 Int) (insert_~size Int)) (and (<= insert_~size 1) (not (= (select (select |#memory_int| |main_~#set~0.base|) |main_~#set~0.offset|) (select (select |#memory_int| v_prenex_6) (+ (* 4 v_prenex_4) v_prenex_5)))) (<= main_~n~0 (+ insert_~size 1)) (= (select (select |#memory_int| |main_~#set~0.base|) (+ |main_~#set~0.offset| (* 4 insert_~size))) (select (select |#memory_int| v_prenex_6) (+ (* 4 v_prenex_4) v_prenex_5))))) (= main_~x~0 0) (= |main_~#set~0.offset| 0)))} is VALID [2018-11-14 16:54:19,766 INFO L273 TraceCheckUtils]: 135: Hoare triple {11431#(or (and (= main_~x~0 0) (= |main_~#set~0.offset| 0) (<= main_~n~0 1)) (and (exists ((v_prenex_6 Int) (v_prenex_4 Int) (v_prenex_5 Int) (insert_~size Int)) (and (<= insert_~size 1) (not (= (select (select |#memory_int| |main_~#set~0.base|) |main_~#set~0.offset|) (select (select |#memory_int| v_prenex_6) (+ (* 4 v_prenex_4) v_prenex_5)))) (<= main_~n~0 (+ insert_~size 1)) (= (select (select |#memory_int| |main_~#set~0.base|) (+ |main_~#set~0.offset| (* 4 insert_~size))) (select (select |#memory_int| v_prenex_6) (+ (* 4 v_prenex_4) v_prenex_5))))) (= main_~x~0 0) (= |main_~#set~0.offset| 0)))} assume !!(~x~0 < ~n~0);~y~0 := ~x~0 + 1; {11438#(or (and (<= (+ main_~x~0 1) main_~y~0) (= main_~x~0 0) (= |main_~#set~0.offset| 0) (<= main_~n~0 1)) (and (exists ((v_prenex_6 Int) (v_prenex_4 Int) (v_prenex_5 Int) (insert_~size Int)) (and (<= insert_~size 1) (not (= (select (select |#memory_int| |main_~#set~0.base|) |main_~#set~0.offset|) (select (select |#memory_int| v_prenex_6) (+ (* 4 v_prenex_4) v_prenex_5)))) (<= main_~n~0 (+ insert_~size 1)) (= (select (select |#memory_int| |main_~#set~0.base|) (+ |main_~#set~0.offset| (* 4 insert_~size))) (select (select |#memory_int| v_prenex_6) (+ (* 4 v_prenex_4) v_prenex_5))))) (<= (+ main_~x~0 1) main_~y~0) (= main_~x~0 0) (= |main_~#set~0.offset| 0)))} is VALID [2018-11-14 16:54:19,766 INFO L273 TraceCheckUtils]: 136: Hoare triple {11438#(or (and (<= (+ main_~x~0 1) main_~y~0) (= main_~x~0 0) (= |main_~#set~0.offset| 0) (<= main_~n~0 1)) (and (exists ((v_prenex_6 Int) (v_prenex_4 Int) (v_prenex_5 Int) (insert_~size Int)) (and (<= insert_~size 1) (not (= (select (select |#memory_int| |main_~#set~0.base|) |main_~#set~0.offset|) (select (select |#memory_int| v_prenex_6) (+ (* 4 v_prenex_4) v_prenex_5)))) (<= main_~n~0 (+ insert_~size 1)) (= (select (select |#memory_int| |main_~#set~0.base|) (+ |main_~#set~0.offset| (* 4 insert_~size))) (select (select |#memory_int| v_prenex_6) (+ (* 4 v_prenex_4) v_prenex_5))))) (<= (+ main_~x~0 1) main_~y~0) (= main_~x~0 0) (= |main_~#set~0.offset| 0)))} assume true; {11438#(or (and (<= (+ main_~x~0 1) main_~y~0) (= main_~x~0 0) (= |main_~#set~0.offset| 0) (<= main_~n~0 1)) (and (exists ((v_prenex_6 Int) (v_prenex_4 Int) (v_prenex_5 Int) (insert_~size Int)) (and (<= insert_~size 1) (not (= (select (select |#memory_int| |main_~#set~0.base|) |main_~#set~0.offset|) (select (select |#memory_int| v_prenex_6) (+ (* 4 v_prenex_4) v_prenex_5)))) (<= main_~n~0 (+ insert_~size 1)) (= (select (select |#memory_int| |main_~#set~0.base|) (+ |main_~#set~0.offset| (* 4 insert_~size))) (select (select |#memory_int| v_prenex_6) (+ (* 4 v_prenex_4) v_prenex_5))))) (<= (+ main_~x~0 1) main_~y~0) (= main_~x~0 0) (= |main_~#set~0.offset| 0)))} is VALID [2018-11-14 16:54:19,768 INFO L273 TraceCheckUtils]: 137: Hoare triple {11438#(or (and (<= (+ main_~x~0 1) main_~y~0) (= main_~x~0 0) (= |main_~#set~0.offset| 0) (<= main_~n~0 1)) (and (exists ((v_prenex_6 Int) (v_prenex_4 Int) (v_prenex_5 Int) (insert_~size Int)) (and (<= insert_~size 1) (not (= (select (select |#memory_int| |main_~#set~0.base|) |main_~#set~0.offset|) (select (select |#memory_int| v_prenex_6) (+ (* 4 v_prenex_4) v_prenex_5)))) (<= main_~n~0 (+ insert_~size 1)) (= (select (select |#memory_int| |main_~#set~0.base|) (+ |main_~#set~0.offset| (* 4 insert_~size))) (select (select |#memory_int| v_prenex_6) (+ (* 4 v_prenex_4) v_prenex_5))))) (<= (+ main_~x~0 1) main_~y~0) (= main_~x~0 0) (= |main_~#set~0.offset| 0)))} assume !!(~y~0 < ~n~0);call #t~mem13 := read~int(~#set~0.base, ~#set~0.offset + ~x~0 * 4, 4);call #t~mem14 := read~int(~#set~0.base, ~#set~0.offset + ~y~0 * 4, 4); {11445#(not (= |main_#t~mem14| |main_#t~mem13|))} is VALID [2018-11-14 16:54:19,769 INFO L256 TraceCheckUtils]: 138: Hoare triple {11445#(not (= |main_#t~mem14| |main_#t~mem13|))} call __VERIFIER_assert((if #t~mem13 != #t~mem14 then 1 else 0)); {11449#(= |__VERIFIER_assert_#in~cond| 1)} is VALID [2018-11-14 16:54:19,769 INFO L273 TraceCheckUtils]: 139: Hoare triple {11449#(= |__VERIFIER_assert_#in~cond| 1)} ~cond := #in~cond; {11453#(= 1 __VERIFIER_assert_~cond)} is VALID [2018-11-14 16:54:19,770 INFO L273 TraceCheckUtils]: 140: Hoare triple {11453#(= 1 __VERIFIER_assert_~cond)} assume ~cond == 0; {11003#false} is VALID [2018-11-14 16:54:19,770 INFO L273 TraceCheckUtils]: 141: Hoare triple {11003#false} assume !false; {11003#false} is VALID [2018-11-14 16:54:19,820 INFO L134 CoverageAnalysis]: Checked inductivity of 466 backedges. 135 proven. 6 refuted. 0 times theorem prover too weak. 325 trivial. 0 not checked. [2018-11-14 16:54:19,855 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 16:54:19,855 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 22] total 32 [2018-11-14 16:54:19,856 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 142 [2018-11-14 16:54:19,869 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 16:54:19,869 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 32 states. [2018-11-14 16:54:21,031 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 150 edges. 149 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2018-11-14 16:54:21,031 INFO L459 AbstractCegarLoop]: Interpolant automaton has 32 states [2018-11-14 16:54:21,031 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2018-11-14 16:54:21,032 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=871, Unknown=1, NotChecked=0, Total=992 [2018-11-14 16:54:21,032 INFO L87 Difference]: Start difference. First operand 242 states and 313 transitions. Second operand 32 states. [2018-11-14 16:54:25,254 WARN L179 SmtUtils]: Spent 153.00 ms on a formula simplification that was a NOOP. DAG size: 19 [2018-11-14 16:54:26,611 WARN L179 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 48 [2018-11-14 16:54:28,375 WARN L179 SmtUtils]: Spent 894.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 46 [2018-11-14 16:54:37,693 WARN L179 SmtUtils]: Spent 1.68 s on a formula simplification. DAG size of input: 46 DAG size of output: 46 [2018-11-14 16:54:46,218 WARN L179 SmtUtils]: Spent 8.28 s on a formula simplification. DAG size of input: 44 DAG size of output: 42 [2018-11-14 16:54:46,632 WARN L179 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 45 [2018-11-14 16:55:02,559 WARN L179 SmtUtils]: Spent 394.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 50 [2018-11-14 16:55:03,943 WARN L179 SmtUtils]: Spent 198.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 47