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-18e5b2d-m [2018-11-18 22:46:50,666 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-18 22:46:50,669 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-18 22:46:50,682 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-18 22:46:50,682 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-18 22:46:50,683 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-18 22:46:50,685 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-18 22:46:50,687 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-18 22:46:50,689 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-18 22:46:50,690 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-18 22:46:50,691 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-18 22:46:50,691 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-18 22:46:50,692 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-18 22:46:50,693 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-18 22:46:50,694 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-18 22:46:50,695 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-18 22:46:50,696 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-18 22:46:50,698 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-18 22:46:50,701 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-18 22:46:50,705 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-18 22:46:50,708 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-18 22:46:50,712 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-18 22:46:50,717 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-18 22:46:50,717 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-18 22:46:50,718 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-18 22:46:50,720 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-18 22:46:50,722 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-18 22:46:50,726 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-18 22:46:50,727 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-18 22:46:50,730 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-18 22:46:50,731 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-18 22:46:50,731 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-18 22:46:50,733 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-18 22:46:50,733 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-18 22:46:50,735 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-18 22:46:50,735 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-18 22:46:50,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-18 22:46:50,765 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-18 22:46:50,765 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-18 22:46:50,766 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-18 22:46:50,766 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-11-18 22:46:50,767 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-18 22:46:50,767 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-18 22:46:50,767 INFO L133 SettingsManager]: * Use SBE=true [2018-11-18 22:46:50,768 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-18 22:46:50,769 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-18 22:46:50,769 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-18 22:46:50,769 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-18 22:46:50,769 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-18 22:46:50,769 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-18 22:46:50,770 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-18 22:46:50,770 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-18 22:46:50,770 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-18 22:46:50,770 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-18 22:46:50,770 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-18 22:46:50,771 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-18 22:46:50,771 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-18 22:46:50,771 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-18 22:46:50,771 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-18 22:46:50,771 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-18 22:46:50,773 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-18 22:46:50,773 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-18 22:46:50,773 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-18 22:46:50,774 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-18 22:46:50,774 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-18 22:46:50,774 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-18 22:46:50,774 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-18 22:46:50,774 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-18 22:46:50,841 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-18 22:46:50,857 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-18 22:46:50,862 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-18 22:46:50,864 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-18 22:46:50,865 INFO L276 PluginConnector]: CDTParser initialized [2018-11-18 22:46:50,866 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-18 22:46:50,941 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/96b59ff9e/86a699bcb8174aba916750dc5a26a7fc/FLAG899c26cd4 [2018-11-18 22:46:51,417 INFO L307 CDTParser]: Found 1 translation units. [2018-11-18 22:46:51,418 INFO L161 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/array-examples/data_structures_set_multi_proc_true-unreach-call_ground.i [2018-11-18 22:46:51,425 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/96b59ff9e/86a699bcb8174aba916750dc5a26a7fc/FLAG899c26cd4 [2018-11-18 22:46:51,791 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/96b59ff9e/86a699bcb8174aba916750dc5a26a7fc [2018-11-18 22:46:51,803 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-18 22:46:51,804 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-11-18 22:46:51,806 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-18 22:46:51,806 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-18 22:46:51,810 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-18 22:46:51,811 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 10:46:51" (1/1) ... [2018-11-18 22:46:51,814 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5a17c509 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:46:51, skipping insertion in model container [2018-11-18 22:46:51,815 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 10:46:51" (1/1) ... [2018-11-18 22:46:51,826 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-18 22:46:51,852 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-18 22:46:52,136 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-18 22:46:52,153 INFO L191 MainTranslator]: Completed pre-run [2018-11-18 22:46:52,201 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-18 22:46:52,226 INFO L195 MainTranslator]: Completed translation [2018-11-18 22:46:52,226 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:46:52 WrapperNode [2018-11-18 22:46:52,227 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-18 22:46:52,227 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-18 22:46:52,228 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-18 22:46:52,228 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-18 22:46:52,245 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:46:52" (1/1) ... [2018-11-18 22:46:52,245 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:46:52" (1/1) ... [2018-11-18 22:46:52,257 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:46:52" (1/1) ... [2018-11-18 22:46:52,259 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:46:52" (1/1) ... [2018-11-18 22:46:52,283 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:46:52" (1/1) ... [2018-11-18 22:46:52,299 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:46:52" (1/1) ... [2018-11-18 22:46:52,301 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:46:52" (1/1) ... [2018-11-18 22:46:52,304 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-18 22:46:52,305 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-18 22:46:52,305 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-18 22:46:52,305 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-18 22:46:52,306 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:46:52" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-18 22:46:52,439 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-18 22:46:52,439 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-18 22:46:52,439 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2018-11-18 22:46:52,439 INFO L138 BoogieDeclarations]: Found implementation of procedure insert [2018-11-18 22:46:52,440 INFO L138 BoogieDeclarations]: Found implementation of procedure elem_exists [2018-11-18 22:46:52,440 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-18 22:46:52,440 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2018-11-18 22:46:52,440 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2018-11-18 22:46:52,440 INFO L130 BoogieDeclarations]: Found specification of procedure insert [2018-11-18 22:46:52,440 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-18 22:46:52,441 INFO L130 BoogieDeclarations]: Found specification of procedure elem_exists [2018-11-18 22:46:52,441 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-18 22:46:52,441 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-18 22:46:52,441 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-18 22:46:52,442 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-18 22:46:52,442 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-18 22:46:52,442 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-18 22:46:52,443 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2018-11-18 22:46:53,457 INFO L280 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-18 22:46:53,458 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 10:46:53 BoogieIcfgContainer [2018-11-18 22:46:53,458 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-18 22:46:53,459 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-18 22:46:53,459 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-18 22:46:53,463 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-18 22:46:53,463 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.11 10:46:51" (1/3) ... [2018-11-18 22:46:53,464 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@42334774 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 10:46:53, skipping insertion in model container [2018-11-18 22:46:53,464 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:46:52" (2/3) ... [2018-11-18 22:46:53,465 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@42334774 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 10:46:53, skipping insertion in model container [2018-11-18 22:46:53,465 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 10:46:53" (3/3) ... [2018-11-18 22:46:53,467 INFO L112 eAbstractionObserver]: Analyzing ICFG data_structures_set_multi_proc_true-unreach-call_ground.i [2018-11-18 22:46:53,477 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-18 22:46:53,486 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-18 22:46:53,503 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-18 22:46:53,536 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-18 22:46:53,537 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-18 22:46:53,537 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-18 22:46:53,537 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-18 22:46:53,537 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-18 22:46:53,538 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-18 22:46:53,538 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-18 22:46:53,538 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-18 22:46:53,538 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-18 22:46:53,560 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states. [2018-11-18 22:46:53,567 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-11-18 22:46:53,567 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 22:46:53,568 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 22:46:53,571 INFO L423 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 22:46:53,578 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 22:46:53,578 INFO L82 PathProgramCache]: Analyzing trace with hash 2009943675, now seen corresponding path program 1 times [2018-11-18 22:46:53,580 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 22:46:53,581 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 22:46:53,633 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 22:46:53,633 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 22:46:53,633 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 22:46:53,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:46:53,857 INFO L256 TraceCheckUtils]: 0: Hoare triple {57#true} call ULTIMATE.init(); {57#true} is VALID [2018-11-18 22:46:53,862 INFO L273 TraceCheckUtils]: 1: Hoare triple {57#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {57#true} is VALID [2018-11-18 22:46:53,862 INFO L273 TraceCheckUtils]: 2: Hoare triple {57#true} assume true; {57#true} is VALID [2018-11-18 22:46:53,863 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {57#true} {57#true} #126#return; {57#true} is VALID [2018-11-18 22:46:53,863 INFO L256 TraceCheckUtils]: 4: Hoare triple {57#true} call #t~ret15 := main(); {57#true} is VALID [2018-11-18 22:46:53,865 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-18 22:46:53,866 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-18 22:46:53,867 INFO L273 TraceCheckUtils]: 7: Hoare triple {59#(and (= main_~n~0 0) (= main_~x~0 0))} assume !!(~x~0 < ~n~0);~y~0 := 1 + ~x~0; {60#(and (= main_~n~0 0) (<= (+ main_~x~0 1) main_~y~0) (= main_~x~0 0))} is VALID [2018-11-18 22:46:53,868 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-18 22:46:53,874 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 + 4 * ~x~0, 4);call #t~mem5 := read~int(~#set~0.base, ~#set~0.offset + 4 * ~y~0, 4); {58#false} is VALID [2018-11-18 22:46:53,875 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-18 22:46:53,875 INFO L273 TraceCheckUtils]: 11: Hoare triple {58#false} ~cond := #in~cond; {58#false} is VALID [2018-11-18 22:46:53,875 INFO L273 TraceCheckUtils]: 12: Hoare triple {58#false} assume 0 == ~cond; {58#false} is VALID [2018-11-18 22:46:53,876 INFO L273 TraceCheckUtils]: 13: Hoare triple {58#false} assume !false; {58#false} is VALID [2018-11-18 22:46:53,880 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 22:46:53,882 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 22:46:53,882 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-18 22:46:53,887 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2018-11-18 22:46:53,890 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-18 22:46:53,893 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2018-11-18 22:46:53,954 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-18 22:46:53,955 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-18 22:46:53,963 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-18 22:46:53,964 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-18 22:46:53,967 INFO L87 Difference]: Start difference. First operand 54 states. Second operand 4 states. [2018-11-18 22:46:54,841 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:46:54,841 INFO L93 Difference]: Finished difference Result 110 states and 147 transitions. [2018-11-18 22:46:54,842 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 22:46:54,842 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2018-11-18 22:46:54,842 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 22:46:54,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-18 22:46:54,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 147 transitions. [2018-11-18 22:46:54,860 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-18 22:46:54,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 147 transitions. [2018-11-18 22:46:54,871 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 147 transitions. [2018-11-18 22:46:55,298 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-18 22:46:55,313 INFO L225 Difference]: With dead ends: 110 [2018-11-18 22:46:55,314 INFO L226 Difference]: Without dead ends: 51 [2018-11-18 22:46:55,318 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-18 22:46:55,338 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2018-11-18 22:46:55,399 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 49. [2018-11-18 22:46:55,400 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-18 22:46:55,400 INFO L82 GeneralOperation]: Start isEquivalent. First operand 51 states. Second operand 49 states. [2018-11-18 22:46:55,401 INFO L74 IsIncluded]: Start isIncluded. First operand 51 states. Second operand 49 states. [2018-11-18 22:46:55,402 INFO L87 Difference]: Start difference. First operand 51 states. Second operand 49 states. [2018-11-18 22:46:55,409 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:46:55,410 INFO L93 Difference]: Finished difference Result 51 states and 59 transitions. [2018-11-18 22:46:55,410 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 59 transitions. [2018-11-18 22:46:55,411 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:46:55,411 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:46:55,412 INFO L74 IsIncluded]: Start isIncluded. First operand 49 states. Second operand 51 states. [2018-11-18 22:46:55,412 INFO L87 Difference]: Start difference. First operand 49 states. Second operand 51 states. [2018-11-18 22:46:55,418 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:46:55,418 INFO L93 Difference]: Finished difference Result 51 states and 59 transitions. [2018-11-18 22:46:55,419 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 59 transitions. [2018-11-18 22:46:55,420 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:46:55,420 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:46:55,420 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-18 22:46:55,421 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-18 22:46:55,421 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2018-11-18 22:46:55,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 56 transitions. [2018-11-18 22:46:55,427 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 56 transitions. Word has length 14 [2018-11-18 22:46:55,427 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 22:46:55,427 INFO L480 AbstractCegarLoop]: Abstraction has 49 states and 56 transitions. [2018-11-18 22:46:55,428 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-18 22:46:55,428 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 56 transitions. [2018-11-18 22:46:55,430 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-11-18 22:46:55,430 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 22:46:55,430 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-18 22:46:55,431 INFO L423 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 22:46:55,431 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 22:46:55,432 INFO L82 PathProgramCache]: Analyzing trace with hash 1004147866, now seen corresponding path program 1 times [2018-11-18 22:46:55,432 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 22:46:55,432 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 22:46:55,433 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 22:46:55,434 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 22:46:55,434 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 22:46:55,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:46:55,562 INFO L256 TraceCheckUtils]: 0: Hoare triple {373#true} call ULTIMATE.init(); {373#true} is VALID [2018-11-18 22:46:55,563 INFO L273 TraceCheckUtils]: 1: Hoare triple {373#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {373#true} is VALID [2018-11-18 22:46:55,563 INFO L273 TraceCheckUtils]: 2: Hoare triple {373#true} assume true; {373#true} is VALID [2018-11-18 22:46:55,563 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {373#true} {373#true} #126#return; {373#true} is VALID [2018-11-18 22:46:55,564 INFO L256 TraceCheckUtils]: 4: Hoare triple {373#true} call #t~ret15 := main(); {373#true} is VALID [2018-11-18 22:46:55,564 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-18 22:46:55,564 INFO L273 TraceCheckUtils]: 6: Hoare triple {373#true} assume true; {373#true} is VALID [2018-11-18 22:46:55,564 INFO L273 TraceCheckUtils]: 7: Hoare triple {373#true} assume !(~x~0 < ~n~0); {373#true} is VALID [2018-11-18 22:46:55,565 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-18 22:46:55,576 INFO L273 TraceCheckUtils]: 9: Hoare triple {375#(= main_~v~0 0)} assume true; {375#(= main_~v~0 0)} is VALID [2018-11-18 22:46:55,589 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 + 4 * ~v~0, 4); {375#(= main_~v~0 0)} is VALID [2018-11-18 22:46:55,590 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-18 22:46:55,590 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-18 22:46:55,590 INFO L273 TraceCheckUtils]: 13: Hoare triple {373#true} assume true; {373#true} is VALID [2018-11-18 22:46:55,591 INFO L273 TraceCheckUtils]: 14: Hoare triple {373#true} assume !(~i~0 < ~size); {373#true} is VALID [2018-11-18 22:46:55,591 INFO L273 TraceCheckUtils]: 15: Hoare triple {373#true} #res := 0; {373#true} is VALID [2018-11-18 22:46:55,592 INFO L273 TraceCheckUtils]: 16: Hoare triple {373#true} assume true; {373#true} is VALID [2018-11-18 22:46:55,604 INFO L268 TraceCheckUtils]: 17: Hoare quadruple {373#true} {375#(= main_~v~0 0)} #132#return; {375#(= main_~v~0 0)} is VALID [2018-11-18 22:46:55,605 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-18 22:46:55,606 INFO L273 TraceCheckUtils]: 19: Hoare triple {375#(= main_~v~0 0)} assume 0 == #t~ret8;havoc #t~ret8;havoc #t~mem7;call #t~mem9 := read~int(~#values~0.base, ~#values~0.offset + 4 * ~v~0, 4); {375#(= main_~v~0 0)} is VALID [2018-11-18 22:46:55,606 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-18 22:46:55,606 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 + 4 * ~size, 4);#res := 1 + ~size; {373#true} is VALID [2018-11-18 22:46:55,607 INFO L273 TraceCheckUtils]: 22: Hoare triple {373#true} assume true; {373#true} is VALID [2018-11-18 22:46:55,609 INFO L268 TraceCheckUtils]: 23: Hoare quadruple {373#true} {375#(= main_~v~0 0)} #134#return; {375#(= main_~v~0 0)} is VALID [2018-11-18 22:46:55,614 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-18 22:46:55,615 INFO L273 TraceCheckUtils]: 25: Hoare triple {375#(= main_~v~0 0)} #t~post6 := ~v~0;~v~0 := 1 + #t~post6;havoc #t~post6; {376#(<= main_~v~0 1)} is VALID [2018-11-18 22:46:55,619 INFO L273 TraceCheckUtils]: 26: Hoare triple {376#(<= main_~v~0 1)} assume true; {376#(<= main_~v~0 1)} is VALID [2018-11-18 22:46:55,619 INFO L273 TraceCheckUtils]: 27: Hoare triple {376#(<= main_~v~0 1)} assume !(~v~0 < 100000); {374#false} is VALID [2018-11-18 22:46:55,620 INFO L273 TraceCheckUtils]: 28: Hoare triple {374#false} ~x~0 := 0; {374#false} is VALID [2018-11-18 22:46:55,620 INFO L273 TraceCheckUtils]: 29: Hoare triple {374#false} assume true; {374#false} is VALID [2018-11-18 22:46:55,620 INFO L273 TraceCheckUtils]: 30: Hoare triple {374#false} assume !!(~x~0 < ~n~0);~y~0 := 1 + ~x~0; {374#false} is VALID [2018-11-18 22:46:55,621 INFO L273 TraceCheckUtils]: 31: Hoare triple {374#false} assume true; {374#false} is VALID [2018-11-18 22:46:55,621 INFO L273 TraceCheckUtils]: 32: Hoare triple {374#false} assume !!(~y~0 < ~n~0);call #t~mem13 := read~int(~#set~0.base, ~#set~0.offset + 4 * ~x~0, 4);call #t~mem14 := read~int(~#set~0.base, ~#set~0.offset + 4 * ~y~0, 4); {374#false} is VALID [2018-11-18 22:46:55,621 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-18 22:46:55,622 INFO L273 TraceCheckUtils]: 34: Hoare triple {374#false} ~cond := #in~cond; {374#false} is VALID [2018-11-18 22:46:55,622 INFO L273 TraceCheckUtils]: 35: Hoare triple {374#false} assume 0 == ~cond; {374#false} is VALID [2018-11-18 22:46:55,622 INFO L273 TraceCheckUtils]: 36: Hoare triple {374#false} assume !false; {374#false} is VALID [2018-11-18 22:46:55,633 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-18 22:46:55,634 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 22:46:55,634 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-18 22:46:55,645 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 22:46:55,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:46:55,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:46:55,737 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 22:46:56,157 INFO L256 TraceCheckUtils]: 0: Hoare triple {373#true} call ULTIMATE.init(); {373#true} is VALID [2018-11-18 22:46:56,158 INFO L273 TraceCheckUtils]: 1: Hoare triple {373#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {373#true} is VALID [2018-11-18 22:46:56,158 INFO L273 TraceCheckUtils]: 2: Hoare triple {373#true} assume true; {373#true} is VALID [2018-11-18 22:46:56,158 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {373#true} {373#true} #126#return; {373#true} is VALID [2018-11-18 22:46:56,159 INFO L256 TraceCheckUtils]: 4: Hoare triple {373#true} call #t~ret15 := main(); {373#true} is VALID [2018-11-18 22:46:56,159 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-18 22:46:56,159 INFO L273 TraceCheckUtils]: 6: Hoare triple {373#true} assume true; {373#true} is VALID [2018-11-18 22:46:56,159 INFO L273 TraceCheckUtils]: 7: Hoare triple {373#true} assume !(~x~0 < ~n~0); {373#true} is VALID [2018-11-18 22:46:56,160 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-18 22:46:56,162 INFO L273 TraceCheckUtils]: 9: Hoare triple {404#(<= main_~v~0 0)} assume true; {404#(<= main_~v~0 0)} is VALID [2018-11-18 22:46:56,162 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 + 4 * ~v~0, 4); {404#(<= main_~v~0 0)} is VALID [2018-11-18 22:46:56,162 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-18 22:46:56,163 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-18 22:46:56,163 INFO L273 TraceCheckUtils]: 13: Hoare triple {373#true} assume true; {373#true} is VALID [2018-11-18 22:46:56,163 INFO L273 TraceCheckUtils]: 14: Hoare triple {373#true} assume !(~i~0 < ~size); {373#true} is VALID [2018-11-18 22:46:56,164 INFO L273 TraceCheckUtils]: 15: Hoare triple {373#true} #res := 0; {373#true} is VALID [2018-11-18 22:46:56,164 INFO L273 TraceCheckUtils]: 16: Hoare triple {373#true} assume true; {373#true} is VALID [2018-11-18 22:46:56,166 INFO L268 TraceCheckUtils]: 17: Hoare quadruple {373#true} {404#(<= main_~v~0 0)} #132#return; {404#(<= main_~v~0 0)} is VALID [2018-11-18 22:46:56,166 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-18 22:46:56,167 INFO L273 TraceCheckUtils]: 19: Hoare triple {404#(<= main_~v~0 0)} assume 0 == #t~ret8;havoc #t~ret8;havoc #t~mem7;call #t~mem9 := read~int(~#values~0.base, ~#values~0.offset + 4 * ~v~0, 4); {404#(<= main_~v~0 0)} is VALID [2018-11-18 22:46:56,167 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-18 22:46:56,167 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 + 4 * ~size, 4);#res := 1 + ~size; {373#true} is VALID [2018-11-18 22:46:56,168 INFO L273 TraceCheckUtils]: 22: Hoare triple {373#true} assume true; {373#true} is VALID [2018-11-18 22:46:56,178 INFO L268 TraceCheckUtils]: 23: Hoare quadruple {373#true} {404#(<= main_~v~0 0)} #134#return; {404#(<= main_~v~0 0)} is VALID [2018-11-18 22:46:56,179 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-18 22:46:56,179 INFO L273 TraceCheckUtils]: 25: Hoare triple {404#(<= main_~v~0 0)} #t~post6 := ~v~0;~v~0 := 1 + #t~post6;havoc #t~post6; {376#(<= main_~v~0 1)} is VALID [2018-11-18 22:46:56,180 INFO L273 TraceCheckUtils]: 26: Hoare triple {376#(<= main_~v~0 1)} assume true; {376#(<= main_~v~0 1)} is VALID [2018-11-18 22:46:56,181 INFO L273 TraceCheckUtils]: 27: Hoare triple {376#(<= main_~v~0 1)} assume !(~v~0 < 100000); {374#false} is VALID [2018-11-18 22:46:56,181 INFO L273 TraceCheckUtils]: 28: Hoare triple {374#false} ~x~0 := 0; {374#false} is VALID [2018-11-18 22:46:56,182 INFO L273 TraceCheckUtils]: 29: Hoare triple {374#false} assume true; {374#false} is VALID [2018-11-18 22:46:56,182 INFO L273 TraceCheckUtils]: 30: Hoare triple {374#false} assume !!(~x~0 < ~n~0);~y~0 := 1 + ~x~0; {374#false} is VALID [2018-11-18 22:46:56,183 INFO L273 TraceCheckUtils]: 31: Hoare triple {374#false} assume true; {374#false} is VALID [2018-11-18 22:46:56,183 INFO L273 TraceCheckUtils]: 32: Hoare triple {374#false} assume !!(~y~0 < ~n~0);call #t~mem13 := read~int(~#set~0.base, ~#set~0.offset + 4 * ~x~0, 4);call #t~mem14 := read~int(~#set~0.base, ~#set~0.offset + 4 * ~y~0, 4); {374#false} is VALID [2018-11-18 22:46:56,183 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-18 22:46:56,184 INFO L273 TraceCheckUtils]: 34: Hoare triple {374#false} ~cond := #in~cond; {374#false} is VALID [2018-11-18 22:46:56,184 INFO L273 TraceCheckUtils]: 35: Hoare triple {374#false} assume 0 == ~cond; {374#false} is VALID [2018-11-18 22:46:56,184 INFO L273 TraceCheckUtils]: 36: Hoare triple {374#false} assume !false; {374#false} is VALID [2018-11-18 22:46:56,187 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-18 22:46:56,208 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-18 22:46:56,208 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 5 [2018-11-18 22:46:56,210 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 37 [2018-11-18 22:46:56,211 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-18 22:46:56,211 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2018-11-18 22:46:56,370 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-18 22:46:56,370 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-18 22:46:56,370 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-18 22:46:56,370 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-11-18 22:46:56,371 INFO L87 Difference]: Start difference. First operand 49 states and 56 transitions. Second operand 5 states. [2018-11-18 22:46:56,852 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:46:56,852 INFO L93 Difference]: Finished difference Result 87 states and 104 transitions. [2018-11-18 22:46:56,853 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-18 22:46:56,853 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 37 [2018-11-18 22:46:56,853 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 22:46:56,853 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-18 22:46:56,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 87 transitions. [2018-11-18 22:46:56,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-18 22:46:56,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 87 transitions. [2018-11-18 22:46:56,863 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 87 transitions. [2018-11-18 22:46:57,109 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-18 22:46:57,118 INFO L225 Difference]: With dead ends: 87 [2018-11-18 22:46:57,119 INFO L226 Difference]: Without dead ends: 72 [2018-11-18 22:46:57,122 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-18 22:46:57,122 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2018-11-18 22:46:57,185 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 59. [2018-11-18 22:46:57,186 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-18 22:46:57,186 INFO L82 GeneralOperation]: Start isEquivalent. First operand 72 states. Second operand 59 states. [2018-11-18 22:46:57,186 INFO L74 IsIncluded]: Start isIncluded. First operand 72 states. Second operand 59 states. [2018-11-18 22:46:57,187 INFO L87 Difference]: Start difference. First operand 72 states. Second operand 59 states. [2018-11-18 22:46:57,193 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:46:57,194 INFO L93 Difference]: Finished difference Result 72 states and 87 transitions. [2018-11-18 22:46:57,194 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 87 transitions. [2018-11-18 22:46:57,195 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:46:57,196 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:46:57,196 INFO L74 IsIncluded]: Start isIncluded. First operand 59 states. Second operand 72 states. [2018-11-18 22:46:57,196 INFO L87 Difference]: Start difference. First operand 59 states. Second operand 72 states. [2018-11-18 22:46:57,202 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:46:57,202 INFO L93 Difference]: Finished difference Result 72 states and 87 transitions. [2018-11-18 22:46:57,202 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 87 transitions. [2018-11-18 22:46:57,204 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:46:57,204 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:46:57,204 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-18 22:46:57,204 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-18 22:46:57,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2018-11-18 22:46:57,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 69 transitions. [2018-11-18 22:46:57,209 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 69 transitions. Word has length 37 [2018-11-18 22:46:57,209 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 22:46:57,210 INFO L480 AbstractCegarLoop]: Abstraction has 59 states and 69 transitions. [2018-11-18 22:46:57,210 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-18 22:46:57,210 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 69 transitions. [2018-11-18 22:46:57,213 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2018-11-18 22:46:57,213 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 22:46:57,214 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-18 22:46:57,217 INFO L423 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 22:46:57,217 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 22:46:57,217 INFO L82 PathProgramCache]: Analyzing trace with hash -2146245391, now seen corresponding path program 1 times [2018-11-18 22:46:57,218 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 22:46:57,219 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 22:46:57,220 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 22:46:57,220 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 22:46:57,220 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 22:46:57,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:46:57,368 INFO L256 TraceCheckUtils]: 0: Hoare triple {828#true} call ULTIMATE.init(); {828#true} is VALID [2018-11-18 22:46:57,368 INFO L273 TraceCheckUtils]: 1: Hoare triple {828#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {828#true} is VALID [2018-11-18 22:46:57,369 INFO L273 TraceCheckUtils]: 2: Hoare triple {828#true} assume true; {828#true} is VALID [2018-11-18 22:46:57,369 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {828#true} {828#true} #126#return; {828#true} is VALID [2018-11-18 22:46:57,370 INFO L256 TraceCheckUtils]: 4: Hoare triple {828#true} call #t~ret15 := main(); {828#true} is VALID [2018-11-18 22:46:57,370 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-18 22:46:57,370 INFO L273 TraceCheckUtils]: 6: Hoare triple {828#true} assume true; {828#true} is VALID [2018-11-18 22:46:57,371 INFO L273 TraceCheckUtils]: 7: Hoare triple {828#true} assume !(~x~0 < ~n~0); {828#true} is VALID [2018-11-18 22:46:57,371 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-18 22:46:57,371 INFO L273 TraceCheckUtils]: 9: Hoare triple {828#true} assume true; {828#true} is VALID [2018-11-18 22:46:57,371 INFO L273 TraceCheckUtils]: 10: Hoare triple {828#true} assume !!(~v~0 < 100000);call #t~mem7 := read~int(~#values~0.base, ~#values~0.offset + 4 * ~v~0, 4); {828#true} is VALID [2018-11-18 22:46:57,372 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-18 22:46:57,372 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-18 22:46:57,372 INFO L273 TraceCheckUtils]: 13: Hoare triple {828#true} assume true; {828#true} is VALID [2018-11-18 22:46:57,372 INFO L273 TraceCheckUtils]: 14: Hoare triple {828#true} assume !(~i~0 < ~size); {828#true} is VALID [2018-11-18 22:46:57,373 INFO L273 TraceCheckUtils]: 15: Hoare triple {828#true} #res := 0; {828#true} is VALID [2018-11-18 22:46:57,373 INFO L273 TraceCheckUtils]: 16: Hoare triple {828#true} assume true; {828#true} is VALID [2018-11-18 22:46:57,373 INFO L268 TraceCheckUtils]: 17: Hoare quadruple {828#true} {828#true} #132#return; {828#true} is VALID [2018-11-18 22:46:57,373 INFO L273 TraceCheckUtils]: 18: Hoare triple {828#true} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647; {828#true} is VALID [2018-11-18 22:46:57,374 INFO L273 TraceCheckUtils]: 19: Hoare triple {828#true} assume 0 == #t~ret8;havoc #t~ret8;havoc #t~mem7;call #t~mem9 := read~int(~#values~0.base, ~#values~0.offset + 4 * ~v~0, 4); {828#true} is VALID [2018-11-18 22:46:57,374 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-18 22:46:57,374 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 + 4 * ~size, 4);#res := 1 + ~size; {828#true} is VALID [2018-11-18 22:46:57,375 INFO L273 TraceCheckUtils]: 22: Hoare triple {828#true} assume true; {828#true} is VALID [2018-11-18 22:46:57,375 INFO L268 TraceCheckUtils]: 23: Hoare quadruple {828#true} {828#true} #134#return; {828#true} is VALID [2018-11-18 22:46:57,375 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-18 22:46:57,376 INFO L273 TraceCheckUtils]: 25: Hoare triple {828#true} #t~post6 := ~v~0;~v~0 := 1 + #t~post6;havoc #t~post6; {828#true} is VALID [2018-11-18 22:46:57,376 INFO L273 TraceCheckUtils]: 26: Hoare triple {828#true} assume true; {828#true} is VALID [2018-11-18 22:46:57,376 INFO L273 TraceCheckUtils]: 27: Hoare triple {828#true} assume !!(~v~0 < 100000);call #t~mem7 := read~int(~#values~0.base, ~#values~0.offset + 4 * ~v~0, 4); {828#true} is VALID [2018-11-18 22:46:57,376 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-18 22:46:57,377 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-18 22:46:57,377 INFO L273 TraceCheckUtils]: 30: Hoare triple {828#true} assume true; {828#true} is VALID [2018-11-18 22:46:57,377 INFO L273 TraceCheckUtils]: 31: Hoare triple {828#true} assume !(~i~0 < ~size); {828#true} is VALID [2018-11-18 22:46:57,379 INFO L273 TraceCheckUtils]: 32: Hoare triple {828#true} #res := 0; {830#(= 0 |elem_exists_#res|)} is VALID [2018-11-18 22:46:57,394 INFO L273 TraceCheckUtils]: 33: Hoare triple {830#(= 0 |elem_exists_#res|)} assume true; {830#(= 0 |elem_exists_#res|)} is VALID [2018-11-18 22:46:57,396 INFO L268 TraceCheckUtils]: 34: Hoare quadruple {830#(= 0 |elem_exists_#res|)} {828#true} #132#return; {831#(= |main_#t~ret8| 0)} is VALID [2018-11-18 22:46:57,400 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-18 22:46:57,401 INFO L273 TraceCheckUtils]: 36: Hoare triple {831#(= |main_#t~ret8| 0)} assume !(0 == #t~ret8);havoc #t~ret8;havoc #t~mem7; {829#false} is VALID [2018-11-18 22:46:57,401 INFO L273 TraceCheckUtils]: 37: Hoare triple {829#false} #t~post6 := ~v~0;~v~0 := 1 + #t~post6;havoc #t~post6; {829#false} is VALID [2018-11-18 22:46:57,402 INFO L273 TraceCheckUtils]: 38: Hoare triple {829#false} assume true; {829#false} is VALID [2018-11-18 22:46:57,402 INFO L273 TraceCheckUtils]: 39: Hoare triple {829#false} assume !(~v~0 < 100000); {829#false} is VALID [2018-11-18 22:46:57,402 INFO L273 TraceCheckUtils]: 40: Hoare triple {829#false} ~x~0 := 0; {829#false} is VALID [2018-11-18 22:46:57,402 INFO L273 TraceCheckUtils]: 41: Hoare triple {829#false} assume true; {829#false} is VALID [2018-11-18 22:46:57,403 INFO L273 TraceCheckUtils]: 42: Hoare triple {829#false} assume !!(~x~0 < ~n~0);~y~0 := 1 + ~x~0; {829#false} is VALID [2018-11-18 22:46:57,403 INFO L273 TraceCheckUtils]: 43: Hoare triple {829#false} assume true; {829#false} is VALID [2018-11-18 22:46:57,403 INFO L273 TraceCheckUtils]: 44: Hoare triple {829#false} assume !!(~y~0 < ~n~0);call #t~mem13 := read~int(~#set~0.base, ~#set~0.offset + 4 * ~x~0, 4);call #t~mem14 := read~int(~#set~0.base, ~#set~0.offset + 4 * ~y~0, 4); {829#false} is VALID [2018-11-18 22:46:57,403 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-18 22:46:57,404 INFO L273 TraceCheckUtils]: 46: Hoare triple {829#false} ~cond := #in~cond; {829#false} is VALID [2018-11-18 22:46:57,404 INFO L273 TraceCheckUtils]: 47: Hoare triple {829#false} assume 0 == ~cond; {829#false} is VALID [2018-11-18 22:46:57,404 INFO L273 TraceCheckUtils]: 48: Hoare triple {829#false} assume !false; {829#false} is VALID [2018-11-18 22:46:57,408 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-18 22:46:57,408 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 22:46:57,409 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-18 22:46:57,409 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 49 [2018-11-18 22:46:57,410 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-18 22:46:57,410 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2018-11-18 22:46:57,484 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-18 22:46:57,485 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-18 22:46:57,485 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-18 22:46:57,485 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-18 22:46:57,486 INFO L87 Difference]: Start difference. First operand 59 states and 69 transitions. Second operand 4 states. [2018-11-18 22:46:57,693 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:46:57,693 INFO L93 Difference]: Finished difference Result 107 states and 129 transitions. [2018-11-18 22:46:57,693 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-18 22:46:57,694 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 49 [2018-11-18 22:46:57,694 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 22:46:57,694 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-18 22:46:57,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 92 transitions. [2018-11-18 22:46:57,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-18 22:46:57,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 92 transitions. [2018-11-18 22:46:57,701 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 92 transitions. [2018-11-18 22:46:57,915 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-18 22:46:57,918 INFO L225 Difference]: With dead ends: 107 [2018-11-18 22:46:57,918 INFO L226 Difference]: Without dead ends: 67 [2018-11-18 22:46:57,919 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-18 22:46:57,919 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2018-11-18 22:46:57,991 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 65. [2018-11-18 22:46:57,992 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-18 22:46:57,992 INFO L82 GeneralOperation]: Start isEquivalent. First operand 67 states. Second operand 65 states. [2018-11-18 22:46:57,992 INFO L74 IsIncluded]: Start isIncluded. First operand 67 states. Second operand 65 states. [2018-11-18 22:46:57,993 INFO L87 Difference]: Start difference. First operand 67 states. Second operand 65 states. [2018-11-18 22:46:57,997 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:46:57,997 INFO L93 Difference]: Finished difference Result 67 states and 79 transitions. [2018-11-18 22:46:57,997 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 79 transitions. [2018-11-18 22:46:57,999 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:46:57,999 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:46:57,999 INFO L74 IsIncluded]: Start isIncluded. First operand 65 states. Second operand 67 states. [2018-11-18 22:46:57,999 INFO L87 Difference]: Start difference. First operand 65 states. Second operand 67 states. [2018-11-18 22:46:58,003 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:46:58,004 INFO L93 Difference]: Finished difference Result 67 states and 79 transitions. [2018-11-18 22:46:58,004 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 79 transitions. [2018-11-18 22:46:58,005 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:46:58,006 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:46:58,006 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-18 22:46:58,006 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-18 22:46:58,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2018-11-18 22:46:58,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 77 transitions. [2018-11-18 22:46:58,011 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 77 transitions. Word has length 49 [2018-11-18 22:46:58,011 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 22:46:58,011 INFO L480 AbstractCegarLoop]: Abstraction has 65 states and 77 transitions. [2018-11-18 22:46:58,011 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-18 22:46:58,011 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 77 transitions. [2018-11-18 22:46:58,013 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2018-11-18 22:46:58,013 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 22:46:58,013 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-18 22:46:58,014 INFO L423 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 22:46:58,014 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 22:46:58,014 INFO L82 PathProgramCache]: Analyzing trace with hash -728656088, now seen corresponding path program 1 times [2018-11-18 22:46:58,014 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 22:46:58,014 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 22:46:58,015 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 22:46:58,016 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 22:46:58,016 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 22:46:58,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:46:58,154 INFO L256 TraceCheckUtils]: 0: Hoare triple {1194#true} call ULTIMATE.init(); {1194#true} is VALID [2018-11-18 22:46:58,155 INFO L273 TraceCheckUtils]: 1: Hoare triple {1194#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {1194#true} is VALID [2018-11-18 22:46:58,155 INFO L273 TraceCheckUtils]: 2: Hoare triple {1194#true} assume true; {1194#true} is VALID [2018-11-18 22:46:58,156 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1194#true} {1194#true} #126#return; {1194#true} is VALID [2018-11-18 22:46:58,156 INFO L256 TraceCheckUtils]: 4: Hoare triple {1194#true} call #t~ret15 := main(); {1194#true} is VALID [2018-11-18 22:46:58,157 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-18 22:46:58,157 INFO L273 TraceCheckUtils]: 6: Hoare triple {1194#true} assume true; {1194#true} is VALID [2018-11-18 22:46:58,158 INFO L273 TraceCheckUtils]: 7: Hoare triple {1194#true} assume !(~x~0 < ~n~0); {1194#true} is VALID [2018-11-18 22:46:58,161 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-18 22:46:58,162 INFO L273 TraceCheckUtils]: 9: Hoare triple {1196#(= main_~v~0 0)} assume true; {1196#(= main_~v~0 0)} is VALID [2018-11-18 22:46:58,162 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 + 4 * ~v~0, 4); {1196#(= main_~v~0 0)} is VALID [2018-11-18 22:46:58,162 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-18 22:46:58,163 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-18 22:46:58,163 INFO L273 TraceCheckUtils]: 13: Hoare triple {1194#true} assume true; {1194#true} is VALID [2018-11-18 22:46:58,163 INFO L273 TraceCheckUtils]: 14: Hoare triple {1194#true} assume !(~i~0 < ~size); {1194#true} is VALID [2018-11-18 22:46:58,164 INFO L273 TraceCheckUtils]: 15: Hoare triple {1194#true} #res := 0; {1194#true} is VALID [2018-11-18 22:46:58,164 INFO L273 TraceCheckUtils]: 16: Hoare triple {1194#true} assume true; {1194#true} is VALID [2018-11-18 22:46:58,167 INFO L268 TraceCheckUtils]: 17: Hoare quadruple {1194#true} {1196#(= main_~v~0 0)} #132#return; {1196#(= main_~v~0 0)} is VALID [2018-11-18 22:46:58,167 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-18 22:46:58,169 INFO L273 TraceCheckUtils]: 19: Hoare triple {1196#(= main_~v~0 0)} assume 0 == #t~ret8;havoc #t~ret8;havoc #t~mem7;call #t~mem9 := read~int(~#values~0.base, ~#values~0.offset + 4 * ~v~0, 4); {1196#(= main_~v~0 0)} is VALID [2018-11-18 22:46:58,169 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-18 22:46:58,169 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 + 4 * ~size, 4);#res := 1 + ~size; {1194#true} is VALID [2018-11-18 22:46:58,169 INFO L273 TraceCheckUtils]: 22: Hoare triple {1194#true} assume true; {1194#true} is VALID [2018-11-18 22:46:58,171 INFO L268 TraceCheckUtils]: 23: Hoare quadruple {1194#true} {1196#(= main_~v~0 0)} #134#return; {1196#(= main_~v~0 0)} is VALID [2018-11-18 22:46:58,171 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-18 22:46:58,173 INFO L273 TraceCheckUtils]: 25: Hoare triple {1196#(= main_~v~0 0)} #t~post6 := ~v~0;~v~0 := 1 + #t~post6;havoc #t~post6; {1197#(<= main_~v~0 1)} is VALID [2018-11-18 22:46:58,173 INFO L273 TraceCheckUtils]: 26: Hoare triple {1197#(<= main_~v~0 1)} assume true; {1197#(<= main_~v~0 1)} is VALID [2018-11-18 22:46:58,176 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 + 4 * ~v~0, 4); {1197#(<= main_~v~0 1)} is VALID [2018-11-18 22:46:58,176 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-18 22:46:58,176 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-18 22:46:58,177 INFO L273 TraceCheckUtils]: 30: Hoare triple {1194#true} assume true; {1194#true} is VALID [2018-11-18 22:46:58,177 INFO L273 TraceCheckUtils]: 31: Hoare triple {1194#true} assume !!(~i~0 < ~size);call #t~mem1 := read~int(~set.base, ~set.offset + 4 * ~i~0, 4); {1194#true} is VALID [2018-11-18 22:46:58,177 INFO L273 TraceCheckUtils]: 32: Hoare triple {1194#true} assume #t~mem1 == ~value;havoc #t~mem1;#res := 1; {1194#true} is VALID [2018-11-18 22:46:58,178 INFO L273 TraceCheckUtils]: 33: Hoare triple {1194#true} assume true; {1194#true} is VALID [2018-11-18 22:46:58,181 INFO L268 TraceCheckUtils]: 34: Hoare quadruple {1194#true} {1197#(<= main_~v~0 1)} #132#return; {1197#(<= main_~v~0 1)} is VALID [2018-11-18 22:46:58,181 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-18 22:46:58,183 INFO L273 TraceCheckUtils]: 36: Hoare triple {1197#(<= main_~v~0 1)} assume !(0 == #t~ret8);havoc #t~ret8;havoc #t~mem7; {1197#(<= main_~v~0 1)} is VALID [2018-11-18 22:46:58,183 INFO L273 TraceCheckUtils]: 37: Hoare triple {1197#(<= main_~v~0 1)} #t~post6 := ~v~0;~v~0 := 1 + #t~post6;havoc #t~post6; {1198#(<= main_~v~0 2)} is VALID [2018-11-18 22:46:58,186 INFO L273 TraceCheckUtils]: 38: Hoare triple {1198#(<= main_~v~0 2)} assume true; {1198#(<= main_~v~0 2)} is VALID [2018-11-18 22:46:58,186 INFO L273 TraceCheckUtils]: 39: Hoare triple {1198#(<= main_~v~0 2)} assume !(~v~0 < 100000); {1195#false} is VALID [2018-11-18 22:46:58,186 INFO L273 TraceCheckUtils]: 40: Hoare triple {1195#false} ~x~0 := 0; {1195#false} is VALID [2018-11-18 22:46:58,187 INFO L273 TraceCheckUtils]: 41: Hoare triple {1195#false} assume true; {1195#false} is VALID [2018-11-18 22:46:58,187 INFO L273 TraceCheckUtils]: 42: Hoare triple {1195#false} assume !!(~x~0 < ~n~0);~y~0 := 1 + ~x~0; {1195#false} is VALID [2018-11-18 22:46:58,187 INFO L273 TraceCheckUtils]: 43: Hoare triple {1195#false} assume true; {1195#false} is VALID [2018-11-18 22:46:58,188 INFO L273 TraceCheckUtils]: 44: Hoare triple {1195#false} assume !!(~y~0 < ~n~0);call #t~mem13 := read~int(~#set~0.base, ~#set~0.offset + 4 * ~x~0, 4);call #t~mem14 := read~int(~#set~0.base, ~#set~0.offset + 4 * ~y~0, 4); {1195#false} is VALID [2018-11-18 22:46:58,188 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-18 22:46:58,188 INFO L273 TraceCheckUtils]: 46: Hoare triple {1195#false} ~cond := #in~cond; {1195#false} is VALID [2018-11-18 22:46:58,188 INFO L273 TraceCheckUtils]: 47: Hoare triple {1195#false} assume 0 == ~cond; {1195#false} is VALID [2018-11-18 22:46:58,189 INFO L273 TraceCheckUtils]: 48: Hoare triple {1195#false} assume !false; {1195#false} is VALID [2018-11-18 22:46:58,192 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-18 22:46:58,192 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 22:46:58,193 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-18 22:46:58,211 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 22:46:58,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:46:58,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:46:58,277 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 22:46:58,393 INFO L256 TraceCheckUtils]: 0: Hoare triple {1194#true} call ULTIMATE.init(); {1194#true} is VALID [2018-11-18 22:46:58,394 INFO L273 TraceCheckUtils]: 1: Hoare triple {1194#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {1194#true} is VALID [2018-11-18 22:46:58,394 INFO L273 TraceCheckUtils]: 2: Hoare triple {1194#true} assume true; {1194#true} is VALID [2018-11-18 22:46:58,394 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1194#true} {1194#true} #126#return; {1194#true} is VALID [2018-11-18 22:46:58,395 INFO L256 TraceCheckUtils]: 4: Hoare triple {1194#true} call #t~ret15 := main(); {1194#true} is VALID [2018-11-18 22:46:58,395 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-18 22:46:58,395 INFO L273 TraceCheckUtils]: 6: Hoare triple {1194#true} assume true; {1194#true} is VALID [2018-11-18 22:46:58,396 INFO L273 TraceCheckUtils]: 7: Hoare triple {1194#true} assume !(~x~0 < ~n~0); {1194#true} is VALID [2018-11-18 22:46:58,400 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-18 22:46:58,401 INFO L273 TraceCheckUtils]: 9: Hoare triple {1226#(<= main_~v~0 0)} assume true; {1226#(<= main_~v~0 0)} is VALID [2018-11-18 22:46:58,401 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 + 4 * ~v~0, 4); {1226#(<= main_~v~0 0)} is VALID [2018-11-18 22:46:58,401 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-18 22:46:58,402 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-18 22:46:58,402 INFO L273 TraceCheckUtils]: 13: Hoare triple {1194#true} assume true; {1194#true} is VALID [2018-11-18 22:46:58,402 INFO L273 TraceCheckUtils]: 14: Hoare triple {1194#true} assume !(~i~0 < ~size); {1194#true} is VALID [2018-11-18 22:46:58,402 INFO L273 TraceCheckUtils]: 15: Hoare triple {1194#true} #res := 0; {1194#true} is VALID [2018-11-18 22:46:58,403 INFO L273 TraceCheckUtils]: 16: Hoare triple {1194#true} assume true; {1194#true} is VALID [2018-11-18 22:46:58,412 INFO L268 TraceCheckUtils]: 17: Hoare quadruple {1194#true} {1226#(<= main_~v~0 0)} #132#return; {1226#(<= main_~v~0 0)} is VALID [2018-11-18 22:46:58,414 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-18 22:46:58,414 INFO L273 TraceCheckUtils]: 19: Hoare triple {1226#(<= main_~v~0 0)} assume 0 == #t~ret8;havoc #t~ret8;havoc #t~mem7;call #t~mem9 := read~int(~#values~0.base, ~#values~0.offset + 4 * ~v~0, 4); {1226#(<= main_~v~0 0)} is VALID [2018-11-18 22:46:58,414 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-18 22:46:58,415 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 + 4 * ~size, 4);#res := 1 + ~size; {1194#true} is VALID [2018-11-18 22:46:58,415 INFO L273 TraceCheckUtils]: 22: Hoare triple {1194#true} assume true; {1194#true} is VALID [2018-11-18 22:46:58,417 INFO L268 TraceCheckUtils]: 23: Hoare quadruple {1194#true} {1226#(<= main_~v~0 0)} #134#return; {1226#(<= main_~v~0 0)} is VALID [2018-11-18 22:46:58,418 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-18 22:46:58,419 INFO L273 TraceCheckUtils]: 25: Hoare triple {1226#(<= main_~v~0 0)} #t~post6 := ~v~0;~v~0 := 1 + #t~post6;havoc #t~post6; {1197#(<= main_~v~0 1)} is VALID [2018-11-18 22:46:58,420 INFO L273 TraceCheckUtils]: 26: Hoare triple {1197#(<= main_~v~0 1)} assume true; {1197#(<= main_~v~0 1)} is VALID [2018-11-18 22:46:58,420 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 + 4 * ~v~0, 4); {1197#(<= main_~v~0 1)} is VALID [2018-11-18 22:46:58,421 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-18 22:46:58,421 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-18 22:46:58,422 INFO L273 TraceCheckUtils]: 30: Hoare triple {1194#true} assume true; {1194#true} is VALID [2018-11-18 22:46:58,422 INFO L273 TraceCheckUtils]: 31: Hoare triple {1194#true} assume !!(~i~0 < ~size);call #t~mem1 := read~int(~set.base, ~set.offset + 4 * ~i~0, 4); {1194#true} is VALID [2018-11-18 22:46:58,422 INFO L273 TraceCheckUtils]: 32: Hoare triple {1194#true} assume #t~mem1 == ~value;havoc #t~mem1;#res := 1; {1194#true} is VALID [2018-11-18 22:46:58,423 INFO L273 TraceCheckUtils]: 33: Hoare triple {1194#true} assume true; {1194#true} is VALID [2018-11-18 22:46:58,425 INFO L268 TraceCheckUtils]: 34: Hoare quadruple {1194#true} {1197#(<= main_~v~0 1)} #132#return; {1197#(<= main_~v~0 1)} is VALID [2018-11-18 22:46:58,426 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-18 22:46:58,427 INFO L273 TraceCheckUtils]: 36: Hoare triple {1197#(<= main_~v~0 1)} assume !(0 == #t~ret8);havoc #t~ret8;havoc #t~mem7; {1197#(<= main_~v~0 1)} is VALID [2018-11-18 22:46:58,427 INFO L273 TraceCheckUtils]: 37: Hoare triple {1197#(<= main_~v~0 1)} #t~post6 := ~v~0;~v~0 := 1 + #t~post6;havoc #t~post6; {1198#(<= main_~v~0 2)} is VALID [2018-11-18 22:46:58,430 INFO L273 TraceCheckUtils]: 38: Hoare triple {1198#(<= main_~v~0 2)} assume true; {1198#(<= main_~v~0 2)} is VALID [2018-11-18 22:46:58,431 INFO L273 TraceCheckUtils]: 39: Hoare triple {1198#(<= main_~v~0 2)} assume !(~v~0 < 100000); {1195#false} is VALID [2018-11-18 22:46:58,431 INFO L273 TraceCheckUtils]: 40: Hoare triple {1195#false} ~x~0 := 0; {1195#false} is VALID [2018-11-18 22:46:58,431 INFO L273 TraceCheckUtils]: 41: Hoare triple {1195#false} assume true; {1195#false} is VALID [2018-11-18 22:46:58,432 INFO L273 TraceCheckUtils]: 42: Hoare triple {1195#false} assume !!(~x~0 < ~n~0);~y~0 := 1 + ~x~0; {1195#false} is VALID [2018-11-18 22:46:58,432 INFO L273 TraceCheckUtils]: 43: Hoare triple {1195#false} assume true; {1195#false} is VALID [2018-11-18 22:46:58,432 INFO L273 TraceCheckUtils]: 44: Hoare triple {1195#false} assume !!(~y~0 < ~n~0);call #t~mem13 := read~int(~#set~0.base, ~#set~0.offset + 4 * ~x~0, 4);call #t~mem14 := read~int(~#set~0.base, ~#set~0.offset + 4 * ~y~0, 4); {1195#false} is VALID [2018-11-18 22:46:58,433 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-18 22:46:58,433 INFO L273 TraceCheckUtils]: 46: Hoare triple {1195#false} ~cond := #in~cond; {1195#false} is VALID [2018-11-18 22:46:58,434 INFO L273 TraceCheckUtils]: 47: Hoare triple {1195#false} assume 0 == ~cond; {1195#false} is VALID [2018-11-18 22:46:58,434 INFO L273 TraceCheckUtils]: 48: Hoare triple {1195#false} assume !false; {1195#false} is VALID [2018-11-18 22:46:58,437 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-18 22:46:58,455 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-18 22:46:58,456 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 6 [2018-11-18 22:46:58,456 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 49 [2018-11-18 22:46:58,457 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-18 22:46:58,457 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2018-11-18 22:46:58,537 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-18 22:46:58,537 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-18 22:46:58,537 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-18 22:46:58,537 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2018-11-18 22:46:58,538 INFO L87 Difference]: Start difference. First operand 65 states and 77 transitions. Second operand 6 states. [2018-11-18 22:46:58,905 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:46:58,905 INFO L93 Difference]: Finished difference Result 111 states and 139 transitions. [2018-11-18 22:46:58,905 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-18 22:46:58,905 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 49 [2018-11-18 22:46:58,906 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 22:46:58,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-18 22:46:58,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 98 transitions. [2018-11-18 22:46:58,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-18 22:46:58,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 98 transitions. [2018-11-18 22:46:58,913 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 98 transitions. [2018-11-18 22:46:59,085 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-18 22:46:59,089 INFO L225 Difference]: With dead ends: 111 [2018-11-18 22:46:59,089 INFO L226 Difference]: Without dead ends: 96 [2018-11-18 22:46:59,090 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-18 22:46:59,090 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2018-11-18 22:46:59,156 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 81. [2018-11-18 22:46:59,157 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-18 22:46:59,157 INFO L82 GeneralOperation]: Start isEquivalent. First operand 96 states. Second operand 81 states. [2018-11-18 22:46:59,157 INFO L74 IsIncluded]: Start isIncluded. First operand 96 states. Second operand 81 states. [2018-11-18 22:46:59,157 INFO L87 Difference]: Start difference. First operand 96 states. Second operand 81 states. [2018-11-18 22:46:59,163 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:46:59,163 INFO L93 Difference]: Finished difference Result 96 states and 122 transitions. [2018-11-18 22:46:59,164 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 122 transitions. [2018-11-18 22:46:59,165 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:46:59,165 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:46:59,165 INFO L74 IsIncluded]: Start isIncluded. First operand 81 states. Second operand 96 states. [2018-11-18 22:46:59,165 INFO L87 Difference]: Start difference. First operand 81 states. Second operand 96 states. [2018-11-18 22:46:59,171 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:46:59,172 INFO L93 Difference]: Finished difference Result 96 states and 122 transitions. [2018-11-18 22:46:59,172 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 122 transitions. [2018-11-18 22:46:59,173 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:46:59,173 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:46:59,173 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-18 22:46:59,173 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-18 22:46:59,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2018-11-18 22:46:59,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 100 transitions. [2018-11-18 22:46:59,178 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 100 transitions. Word has length 49 [2018-11-18 22:46:59,178 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 22:46:59,179 INFO L480 AbstractCegarLoop]: Abstraction has 81 states and 100 transitions. [2018-11-18 22:46:59,179 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-18 22:46:59,179 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 100 transitions. [2018-11-18 22:46:59,180 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2018-11-18 22:46:59,181 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 22:46:59,181 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-18 22:46:59,181 INFO L423 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 22:46:59,181 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 22:46:59,182 INFO L82 PathProgramCache]: Analyzing trace with hash -389827402, now seen corresponding path program 2 times [2018-11-18 22:46:59,182 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 22:46:59,182 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 22:46:59,183 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 22:46:59,183 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 22:46:59,183 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 22:46:59,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:46:59,358 INFO L256 TraceCheckUtils]: 0: Hoare triple {1790#true} call ULTIMATE.init(); {1790#true} is VALID [2018-11-18 22:46:59,359 INFO L273 TraceCheckUtils]: 1: Hoare triple {1790#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {1790#true} is VALID [2018-11-18 22:46:59,359 INFO L273 TraceCheckUtils]: 2: Hoare triple {1790#true} assume true; {1790#true} is VALID [2018-11-18 22:46:59,360 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1790#true} {1790#true} #126#return; {1790#true} is VALID [2018-11-18 22:46:59,360 INFO L256 TraceCheckUtils]: 4: Hoare triple {1790#true} call #t~ret15 := main(); {1790#true} is VALID [2018-11-18 22:46:59,360 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-18 22:46:59,361 INFO L273 TraceCheckUtils]: 6: Hoare triple {1790#true} assume true; {1790#true} is VALID [2018-11-18 22:46:59,361 INFO L273 TraceCheckUtils]: 7: Hoare triple {1790#true} assume !(~x~0 < ~n~0); {1790#true} is VALID [2018-11-18 22:46:59,362 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-18 22:46:59,362 INFO L273 TraceCheckUtils]: 9: Hoare triple {1792#(= main_~v~0 0)} assume true; {1792#(= main_~v~0 0)} is VALID [2018-11-18 22:46:59,363 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 + 4 * ~v~0, 4); {1792#(= main_~v~0 0)} is VALID [2018-11-18 22:46:59,363 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-18 22:46:59,364 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-18 22:46:59,364 INFO L273 TraceCheckUtils]: 13: Hoare triple {1790#true} assume true; {1790#true} is VALID [2018-11-18 22:46:59,364 INFO L273 TraceCheckUtils]: 14: Hoare triple {1790#true} assume !(~i~0 < ~size); {1790#true} is VALID [2018-11-18 22:46:59,364 INFO L273 TraceCheckUtils]: 15: Hoare triple {1790#true} #res := 0; {1790#true} is VALID [2018-11-18 22:46:59,364 INFO L273 TraceCheckUtils]: 16: Hoare triple {1790#true} assume true; {1790#true} is VALID [2018-11-18 22:46:59,366 INFO L268 TraceCheckUtils]: 17: Hoare quadruple {1790#true} {1792#(= main_~v~0 0)} #132#return; {1792#(= main_~v~0 0)} is VALID [2018-11-18 22:46:59,373 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-18 22:46:59,376 INFO L273 TraceCheckUtils]: 19: Hoare triple {1792#(= main_~v~0 0)} assume 0 == #t~ret8;havoc #t~ret8;havoc #t~mem7;call #t~mem9 := read~int(~#values~0.base, ~#values~0.offset + 4 * ~v~0, 4); {1792#(= main_~v~0 0)} is VALID [2018-11-18 22:46:59,376 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-18 22:46:59,376 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 + 4 * ~size, 4);#res := 1 + ~size; {1790#true} is VALID [2018-11-18 22:46:59,377 INFO L273 TraceCheckUtils]: 22: Hoare triple {1790#true} assume true; {1790#true} is VALID [2018-11-18 22:46:59,381 INFO L268 TraceCheckUtils]: 23: Hoare quadruple {1790#true} {1792#(= main_~v~0 0)} #134#return; {1792#(= main_~v~0 0)} is VALID [2018-11-18 22:46:59,382 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-18 22:46:59,382 INFO L273 TraceCheckUtils]: 25: Hoare triple {1792#(= main_~v~0 0)} #t~post6 := ~v~0;~v~0 := 1 + #t~post6;havoc #t~post6; {1793#(<= main_~v~0 1)} is VALID [2018-11-18 22:46:59,385 INFO L273 TraceCheckUtils]: 26: Hoare triple {1793#(<= main_~v~0 1)} assume true; {1793#(<= main_~v~0 1)} is VALID [2018-11-18 22:46:59,404 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 + 4 * ~v~0, 4); {1793#(<= main_~v~0 1)} is VALID [2018-11-18 22:46:59,404 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-18 22:46:59,405 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-18 22:46:59,405 INFO L273 TraceCheckUtils]: 30: Hoare triple {1790#true} assume true; {1790#true} is VALID [2018-11-18 22:46:59,405 INFO L273 TraceCheckUtils]: 31: Hoare triple {1790#true} assume !!(~i~0 < ~size);call #t~mem1 := read~int(~set.base, ~set.offset + 4 * ~i~0, 4); {1790#true} is VALID [2018-11-18 22:46:59,405 INFO L273 TraceCheckUtils]: 32: Hoare triple {1790#true} assume #t~mem1 == ~value;havoc #t~mem1;#res := 1; {1790#true} is VALID [2018-11-18 22:46:59,406 INFO L273 TraceCheckUtils]: 33: Hoare triple {1790#true} assume true; {1790#true} is VALID [2018-11-18 22:46:59,415 INFO L268 TraceCheckUtils]: 34: Hoare quadruple {1790#true} {1793#(<= main_~v~0 1)} #132#return; {1793#(<= main_~v~0 1)} is VALID [2018-11-18 22:46:59,430 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-18 22:46:59,433 INFO L273 TraceCheckUtils]: 36: Hoare triple {1793#(<= main_~v~0 1)} assume !(0 == #t~ret8);havoc #t~ret8;havoc #t~mem7; {1793#(<= main_~v~0 1)} is VALID [2018-11-18 22:46:59,434 INFO L273 TraceCheckUtils]: 37: Hoare triple {1793#(<= main_~v~0 1)} #t~post6 := ~v~0;~v~0 := 1 + #t~post6;havoc #t~post6; {1794#(<= main_~v~0 2)} is VALID [2018-11-18 22:46:59,435 INFO L273 TraceCheckUtils]: 38: Hoare triple {1794#(<= main_~v~0 2)} assume true; {1794#(<= main_~v~0 2)} is VALID [2018-11-18 22:46:59,435 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 + 4 * ~v~0, 4); {1794#(<= main_~v~0 2)} is VALID [2018-11-18 22:46:59,435 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-18 22:46:59,436 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-18 22:46:59,436 INFO L273 TraceCheckUtils]: 42: Hoare triple {1790#true} assume true; {1790#true} is VALID [2018-11-18 22:46:59,436 INFO L273 TraceCheckUtils]: 43: Hoare triple {1790#true} assume !!(~i~0 < ~size);call #t~mem1 := read~int(~set.base, ~set.offset + 4 * ~i~0, 4); {1790#true} is VALID [2018-11-18 22:46:59,436 INFO L273 TraceCheckUtils]: 44: Hoare triple {1790#true} assume #t~mem1 == ~value;havoc #t~mem1;#res := 1; {1790#true} is VALID [2018-11-18 22:46:59,436 INFO L273 TraceCheckUtils]: 45: Hoare triple {1790#true} assume true; {1790#true} is VALID [2018-11-18 22:46:59,439 INFO L268 TraceCheckUtils]: 46: Hoare quadruple {1790#true} {1794#(<= main_~v~0 2)} #132#return; {1794#(<= main_~v~0 2)} is VALID [2018-11-18 22:46:59,440 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-18 22:46:59,441 INFO L273 TraceCheckUtils]: 48: Hoare triple {1794#(<= main_~v~0 2)} assume !(0 == #t~ret8);havoc #t~ret8;havoc #t~mem7; {1794#(<= main_~v~0 2)} is VALID [2018-11-18 22:46:59,441 INFO L273 TraceCheckUtils]: 49: Hoare triple {1794#(<= main_~v~0 2)} #t~post6 := ~v~0;~v~0 := 1 + #t~post6;havoc #t~post6; {1795#(<= main_~v~0 3)} is VALID [2018-11-18 22:46:59,444 INFO L273 TraceCheckUtils]: 50: Hoare triple {1795#(<= main_~v~0 3)} assume true; {1795#(<= main_~v~0 3)} is VALID [2018-11-18 22:46:59,445 INFO L273 TraceCheckUtils]: 51: Hoare triple {1795#(<= main_~v~0 3)} assume !(~v~0 < 100000); {1791#false} is VALID [2018-11-18 22:46:59,445 INFO L273 TraceCheckUtils]: 52: Hoare triple {1791#false} ~x~0 := 0; {1791#false} is VALID [2018-11-18 22:46:59,445 INFO L273 TraceCheckUtils]: 53: Hoare triple {1791#false} assume true; {1791#false} is VALID [2018-11-18 22:46:59,446 INFO L273 TraceCheckUtils]: 54: Hoare triple {1791#false} assume !!(~x~0 < ~n~0);~y~0 := 1 + ~x~0; {1791#false} is VALID [2018-11-18 22:46:59,446 INFO L273 TraceCheckUtils]: 55: Hoare triple {1791#false} assume true; {1791#false} is VALID [2018-11-18 22:46:59,446 INFO L273 TraceCheckUtils]: 56: Hoare triple {1791#false} assume !!(~y~0 < ~n~0);call #t~mem13 := read~int(~#set~0.base, ~#set~0.offset + 4 * ~x~0, 4);call #t~mem14 := read~int(~#set~0.base, ~#set~0.offset + 4 * ~y~0, 4); {1791#false} is VALID [2018-11-18 22:46:59,447 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-18 22:46:59,447 INFO L273 TraceCheckUtils]: 58: Hoare triple {1791#false} ~cond := #in~cond; {1791#false} is VALID [2018-11-18 22:46:59,447 INFO L273 TraceCheckUtils]: 59: Hoare triple {1791#false} assume 0 == ~cond; {1791#false} is VALID [2018-11-18 22:46:59,447 INFO L273 TraceCheckUtils]: 60: Hoare triple {1791#false} assume !false; {1791#false} is VALID [2018-11-18 22:46:59,452 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-18 22:46:59,452 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 22:46:59,452 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-18 22:46:59,461 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-18 22:46:59,516 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-18 22:46:59,516 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-18 22:46:59,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:46:59,538 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 22:46:59,982 INFO L256 TraceCheckUtils]: 0: Hoare triple {1790#true} call ULTIMATE.init(); {1790#true} is VALID [2018-11-18 22:46:59,983 INFO L273 TraceCheckUtils]: 1: Hoare triple {1790#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {1790#true} is VALID [2018-11-18 22:46:59,983 INFO L273 TraceCheckUtils]: 2: Hoare triple {1790#true} assume true; {1790#true} is VALID [2018-11-18 22:46:59,984 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1790#true} {1790#true} #126#return; {1790#true} is VALID [2018-11-18 22:46:59,984 INFO L256 TraceCheckUtils]: 4: Hoare triple {1790#true} call #t~ret15 := main(); {1790#true} is VALID [2018-11-18 22:46:59,985 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-18 22:46:59,985 INFO L273 TraceCheckUtils]: 6: Hoare triple {1814#(<= main_~n~0 0)} assume true; {1814#(<= main_~n~0 0)} is VALID [2018-11-18 22:46:59,986 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-18 22:46:59,986 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-18 22:46:59,986 INFO L273 TraceCheckUtils]: 9: Hoare triple {1814#(<= main_~n~0 0)} assume true; {1814#(<= main_~n~0 0)} is VALID [2018-11-18 22:46:59,987 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 + 4 * ~v~0, 4); {1814#(<= main_~n~0 0)} is VALID [2018-11-18 22:46:59,987 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-18 22:46:59,987 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-18 22:46:59,988 INFO L273 TraceCheckUtils]: 13: Hoare triple {1790#true} assume true; {1790#true} is VALID [2018-11-18 22:46:59,988 INFO L273 TraceCheckUtils]: 14: Hoare triple {1790#true} assume !(~i~0 < ~size); {1790#true} is VALID [2018-11-18 22:46:59,989 INFO L273 TraceCheckUtils]: 15: Hoare triple {1790#true} #res := 0; {1790#true} is VALID [2018-11-18 22:46:59,989 INFO L273 TraceCheckUtils]: 16: Hoare triple {1790#true} assume true; {1790#true} is VALID [2018-11-18 22:46:59,990 INFO L268 TraceCheckUtils]: 17: Hoare quadruple {1790#true} {1814#(<= main_~n~0 0)} #132#return; {1814#(<= main_~n~0 0)} is VALID [2018-11-18 22:46:59,991 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-18 22:46:59,991 INFO L273 TraceCheckUtils]: 19: Hoare triple {1814#(<= main_~n~0 0)} assume 0 == #t~ret8;havoc #t~ret8;havoc #t~mem7;call #t~mem9 := read~int(~#values~0.base, ~#values~0.offset + 4 * ~v~0, 4); {1814#(<= main_~n~0 0)} is VALID [2018-11-18 22:46:59,992 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-18 22:46:59,992 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 + 4 * ~size, 4);#res := 1 + ~size; {1863#(<= |insert_#res| (+ |insert_#in~size| 1))} is VALID [2018-11-18 22:46:59,993 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-18 22:46:59,995 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-18 22:46:59,996 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-18 22:46:59,997 INFO L273 TraceCheckUtils]: 25: Hoare triple {1874#(<= main_~n~0 1)} #t~post6 := ~v~0;~v~0 := 1 + #t~post6;havoc #t~post6; {1874#(<= main_~n~0 1)} is VALID [2018-11-18 22:46:59,998 INFO L273 TraceCheckUtils]: 26: Hoare triple {1874#(<= main_~n~0 1)} assume true; {1874#(<= main_~n~0 1)} is VALID [2018-11-18 22:46:59,998 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 + 4 * ~v~0, 4); {1874#(<= main_~n~0 1)} is VALID [2018-11-18 22:46:59,999 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-18 22:46:59,999 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-18 22:46:59,999 INFO L273 TraceCheckUtils]: 30: Hoare triple {1790#true} assume true; {1790#true} is VALID [2018-11-18 22:47:00,000 INFO L273 TraceCheckUtils]: 31: Hoare triple {1790#true} assume !!(~i~0 < ~size);call #t~mem1 := read~int(~set.base, ~set.offset + 4 * ~i~0, 4); {1790#true} is VALID [2018-11-18 22:47:00,000 INFO L273 TraceCheckUtils]: 32: Hoare triple {1790#true} assume #t~mem1 == ~value;havoc #t~mem1;#res := 1; {1790#true} is VALID [2018-11-18 22:47:00,001 INFO L273 TraceCheckUtils]: 33: Hoare triple {1790#true} assume true; {1790#true} is VALID [2018-11-18 22:47:00,003 INFO L268 TraceCheckUtils]: 34: Hoare quadruple {1790#true} {1874#(<= main_~n~0 1)} #132#return; {1874#(<= main_~n~0 1)} is VALID [2018-11-18 22:47:00,003 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-18 22:47:00,004 INFO L273 TraceCheckUtils]: 36: Hoare triple {1874#(<= main_~n~0 1)} assume !(0 == #t~ret8);havoc #t~ret8;havoc #t~mem7; {1874#(<= main_~n~0 1)} is VALID [2018-11-18 22:47:00,004 INFO L273 TraceCheckUtils]: 37: Hoare triple {1874#(<= main_~n~0 1)} #t~post6 := ~v~0;~v~0 := 1 + #t~post6;havoc #t~post6; {1874#(<= main_~n~0 1)} is VALID [2018-11-18 22:47:00,005 INFO L273 TraceCheckUtils]: 38: Hoare triple {1874#(<= main_~n~0 1)} assume true; {1874#(<= main_~n~0 1)} is VALID [2018-11-18 22:47:00,005 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 + 4 * ~v~0, 4); {1874#(<= main_~n~0 1)} is VALID [2018-11-18 22:47:00,005 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-18 22:47:00,006 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-18 22:47:00,006 INFO L273 TraceCheckUtils]: 42: Hoare triple {1790#true} assume true; {1790#true} is VALID [2018-11-18 22:47:00,006 INFO L273 TraceCheckUtils]: 43: Hoare triple {1790#true} assume !!(~i~0 < ~size);call #t~mem1 := read~int(~set.base, ~set.offset + 4 * ~i~0, 4); {1790#true} is VALID [2018-11-18 22:47:00,006 INFO L273 TraceCheckUtils]: 44: Hoare triple {1790#true} assume #t~mem1 == ~value;havoc #t~mem1;#res := 1; {1790#true} is VALID [2018-11-18 22:47:00,006 INFO L273 TraceCheckUtils]: 45: Hoare triple {1790#true} assume true; {1790#true} is VALID [2018-11-18 22:47:00,007 INFO L268 TraceCheckUtils]: 46: Hoare quadruple {1790#true} {1874#(<= main_~n~0 1)} #132#return; {1874#(<= main_~n~0 1)} is VALID [2018-11-18 22:47:00,008 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-18 22:47:00,009 INFO L273 TraceCheckUtils]: 48: Hoare triple {1874#(<= main_~n~0 1)} assume !(0 == #t~ret8);havoc #t~ret8;havoc #t~mem7; {1874#(<= main_~n~0 1)} is VALID [2018-11-18 22:47:00,009 INFO L273 TraceCheckUtils]: 49: Hoare triple {1874#(<= main_~n~0 1)} #t~post6 := ~v~0;~v~0 := 1 + #t~post6;havoc #t~post6; {1874#(<= main_~n~0 1)} is VALID [2018-11-18 22:47:00,009 INFO L273 TraceCheckUtils]: 50: Hoare triple {1874#(<= main_~n~0 1)} assume true; {1874#(<= main_~n~0 1)} is VALID [2018-11-18 22:47:00,010 INFO L273 TraceCheckUtils]: 51: Hoare triple {1874#(<= main_~n~0 1)} assume !(~v~0 < 100000); {1874#(<= main_~n~0 1)} is VALID [2018-11-18 22:47:00,013 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-18 22:47:00,014 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-18 22:47:00,015 INFO L273 TraceCheckUtils]: 54: Hoare triple {1959#(and (<= main_~n~0 1) (<= 0 main_~x~0))} assume !!(~x~0 < ~n~0);~y~0 := 1 + ~x~0; {1966#(and (<= 1 main_~y~0) (<= main_~n~0 1))} is VALID [2018-11-18 22:47:00,015 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-18 22:47:00,016 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 + 4 * ~x~0, 4);call #t~mem14 := read~int(~#set~0.base, ~#set~0.offset + 4 * ~y~0, 4); {1791#false} is VALID [2018-11-18 22:47:00,016 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-18 22:47:00,017 INFO L273 TraceCheckUtils]: 58: Hoare triple {1791#false} ~cond := #in~cond; {1791#false} is VALID [2018-11-18 22:47:00,017 INFO L273 TraceCheckUtils]: 59: Hoare triple {1791#false} assume 0 == ~cond; {1791#false} is VALID [2018-11-18 22:47:00,017 INFO L273 TraceCheckUtils]: 60: Hoare triple {1791#false} assume !false; {1791#false} is VALID [2018-11-18 22:47:00,022 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-18 22:47:00,041 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-18 22:47:00,041 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 8] total 12 [2018-11-18 22:47:00,042 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 61 [2018-11-18 22:47:00,042 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-18 22:47:00,042 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states. [2018-11-18 22:47:00,163 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-18 22:47:00,163 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-11-18 22:47:00,164 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-11-18 22:47:00,164 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2018-11-18 22:47:00,165 INFO L87 Difference]: Start difference. First operand 81 states and 100 transitions. Second operand 12 states. [2018-11-18 22:47:03,088 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:47:03,089 INFO L93 Difference]: Finished difference Result 182 states and 236 transitions. [2018-11-18 22:47:03,089 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-11-18 22:47:03,089 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 61 [2018-11-18 22:47:03,089 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 22:47:03,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-11-18 22:47:03,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 199 transitions. [2018-11-18 22:47:03,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-11-18 22:47:03,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 199 transitions. [2018-11-18 22:47:03,108 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 22 states and 199 transitions. [2018-11-18 22:47:03,346 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-18 22:47:03,351 INFO L225 Difference]: With dead ends: 182 [2018-11-18 22:47:03,351 INFO L226 Difference]: Without dead ends: 159 [2018-11-18 22:47:03,352 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-18 22:47:03,353 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2018-11-18 22:47:03,424 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 111. [2018-11-18 22:47:03,424 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-18 22:47:03,424 INFO L82 GeneralOperation]: Start isEquivalent. First operand 159 states. Second operand 111 states. [2018-11-18 22:47:03,424 INFO L74 IsIncluded]: Start isIncluded. First operand 159 states. Second operand 111 states. [2018-11-18 22:47:03,424 INFO L87 Difference]: Start difference. First operand 159 states. Second operand 111 states. [2018-11-18 22:47:03,432 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:47:03,433 INFO L93 Difference]: Finished difference Result 159 states and 208 transitions. [2018-11-18 22:47:03,433 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 208 transitions. [2018-11-18 22:47:03,434 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:47:03,434 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:47:03,434 INFO L74 IsIncluded]: Start isIncluded. First operand 111 states. Second operand 159 states. [2018-11-18 22:47:03,434 INFO L87 Difference]: Start difference. First operand 111 states. Second operand 159 states. [2018-11-18 22:47:03,443 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:47:03,443 INFO L93 Difference]: Finished difference Result 159 states and 208 transitions. [2018-11-18 22:47:03,443 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 208 transitions. [2018-11-18 22:47:03,444 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:47:03,444 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:47:03,445 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-18 22:47:03,445 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-18 22:47:03,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 111 states. [2018-11-18 22:47:03,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 142 transitions. [2018-11-18 22:47:03,450 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 142 transitions. Word has length 61 [2018-11-18 22:47:03,450 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 22:47:03,450 INFO L480 AbstractCegarLoop]: Abstraction has 111 states and 142 transitions. [2018-11-18 22:47:03,450 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-11-18 22:47:03,451 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 142 transitions. [2018-11-18 22:47:03,452 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2018-11-18 22:47:03,452 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 22:47:03,453 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-18 22:47:03,453 INFO L423 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 22:47:03,453 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 22:47:03,453 INFO L82 PathProgramCache]: Analyzing trace with hash -1837095063, now seen corresponding path program 3 times [2018-11-18 22:47:03,453 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 22:47:03,453 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 22:47:03,454 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 22:47:03,455 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 22:47:03,455 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 22:47:03,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:47:03,658 INFO L256 TraceCheckUtils]: 0: Hoare triple {2716#true} call ULTIMATE.init(); {2716#true} is VALID [2018-11-18 22:47:03,658 INFO L273 TraceCheckUtils]: 1: Hoare triple {2716#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {2716#true} is VALID [2018-11-18 22:47:03,658 INFO L273 TraceCheckUtils]: 2: Hoare triple {2716#true} assume true; {2716#true} is VALID [2018-11-18 22:47:03,659 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {2716#true} {2716#true} #126#return; {2716#true} is VALID [2018-11-18 22:47:03,659 INFO L256 TraceCheckUtils]: 4: Hoare triple {2716#true} call #t~ret15 := main(); {2716#true} is VALID [2018-11-18 22:47:03,659 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-18 22:47:03,659 INFO L273 TraceCheckUtils]: 6: Hoare triple {2716#true} assume true; {2716#true} is VALID [2018-11-18 22:47:03,660 INFO L273 TraceCheckUtils]: 7: Hoare triple {2716#true} assume !(~x~0 < ~n~0); {2716#true} is VALID [2018-11-18 22:47:03,668 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-18 22:47:03,669 INFO L273 TraceCheckUtils]: 9: Hoare triple {2718#(= main_~v~0 0)} assume true; {2718#(= main_~v~0 0)} is VALID [2018-11-18 22:47:03,674 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 + 4 * ~v~0, 4); {2718#(= main_~v~0 0)} is VALID [2018-11-18 22:47:03,674 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-18 22:47:03,674 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-18 22:47:03,674 INFO L273 TraceCheckUtils]: 13: Hoare triple {2716#true} assume true; {2716#true} is VALID [2018-11-18 22:47:03,674 INFO L273 TraceCheckUtils]: 14: Hoare triple {2716#true} assume !(~i~0 < ~size); {2716#true} is VALID [2018-11-18 22:47:03,675 INFO L273 TraceCheckUtils]: 15: Hoare triple {2716#true} #res := 0; {2716#true} is VALID [2018-11-18 22:47:03,675 INFO L273 TraceCheckUtils]: 16: Hoare triple {2716#true} assume true; {2716#true} is VALID [2018-11-18 22:47:03,676 INFO L268 TraceCheckUtils]: 17: Hoare quadruple {2716#true} {2718#(= main_~v~0 0)} #132#return; {2718#(= main_~v~0 0)} is VALID [2018-11-18 22:47:03,676 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-18 22:47:03,677 INFO L273 TraceCheckUtils]: 19: Hoare triple {2718#(= main_~v~0 0)} assume 0 == #t~ret8;havoc #t~ret8;havoc #t~mem7;call #t~mem9 := read~int(~#values~0.base, ~#values~0.offset + 4 * ~v~0, 4); {2718#(= main_~v~0 0)} is VALID [2018-11-18 22:47:03,677 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-18 22:47:03,677 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 + 4 * ~size, 4);#res := 1 + ~size; {2716#true} is VALID [2018-11-18 22:47:03,677 INFO L273 TraceCheckUtils]: 22: Hoare triple {2716#true} assume true; {2716#true} is VALID [2018-11-18 22:47:03,679 INFO L268 TraceCheckUtils]: 23: Hoare quadruple {2716#true} {2718#(= main_~v~0 0)} #134#return; {2718#(= main_~v~0 0)} is VALID [2018-11-18 22:47:03,679 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-18 22:47:03,681 INFO L273 TraceCheckUtils]: 25: Hoare triple {2718#(= main_~v~0 0)} #t~post6 := ~v~0;~v~0 := 1 + #t~post6;havoc #t~post6; {2719#(<= main_~v~0 1)} is VALID [2018-11-18 22:47:03,681 INFO L273 TraceCheckUtils]: 26: Hoare triple {2719#(<= main_~v~0 1)} assume true; {2719#(<= main_~v~0 1)} is VALID [2018-11-18 22:47:03,691 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 + 4 * ~v~0, 4); {2719#(<= main_~v~0 1)} is VALID [2018-11-18 22:47:03,691 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-18 22:47:03,692 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-18 22:47:03,692 INFO L273 TraceCheckUtils]: 30: Hoare triple {2716#true} assume true; {2716#true} is VALID [2018-11-18 22:47:03,692 INFO L273 TraceCheckUtils]: 31: Hoare triple {2716#true} assume !(~i~0 < ~size); {2716#true} is VALID [2018-11-18 22:47:03,692 INFO L273 TraceCheckUtils]: 32: Hoare triple {2716#true} #res := 0; {2716#true} is VALID [2018-11-18 22:47:03,692 INFO L273 TraceCheckUtils]: 33: Hoare triple {2716#true} assume true; {2716#true} is VALID [2018-11-18 22:47:03,697 INFO L268 TraceCheckUtils]: 34: Hoare quadruple {2716#true} {2719#(<= main_~v~0 1)} #132#return; {2719#(<= main_~v~0 1)} is VALID [2018-11-18 22:47:03,698 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-18 22:47:03,703 INFO L273 TraceCheckUtils]: 36: Hoare triple {2719#(<= main_~v~0 1)} assume 0 == #t~ret8;havoc #t~ret8;havoc #t~mem7;call #t~mem9 := read~int(~#values~0.base, ~#values~0.offset + 4 * ~v~0, 4); {2719#(<= main_~v~0 1)} is VALID [2018-11-18 22:47:03,703 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-18 22:47:03,703 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 + 4 * ~size, 4);#res := 1 + ~size; {2716#true} is VALID [2018-11-18 22:47:03,703 INFO L273 TraceCheckUtils]: 39: Hoare triple {2716#true} assume true; {2716#true} is VALID [2018-11-18 22:47:03,710 INFO L268 TraceCheckUtils]: 40: Hoare quadruple {2716#true} {2719#(<= main_~v~0 1)} #134#return; {2719#(<= main_~v~0 1)} is VALID [2018-11-18 22:47:03,712 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-18 22:47:03,712 INFO L273 TraceCheckUtils]: 42: Hoare triple {2719#(<= main_~v~0 1)} #t~post6 := ~v~0;~v~0 := 1 + #t~post6;havoc #t~post6; {2720#(<= main_~v~0 2)} is VALID [2018-11-18 22:47:03,715 INFO L273 TraceCheckUtils]: 43: Hoare triple {2720#(<= main_~v~0 2)} assume true; {2720#(<= main_~v~0 2)} is VALID [2018-11-18 22:47:03,715 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 + 4 * ~v~0, 4); {2720#(<= main_~v~0 2)} is VALID [2018-11-18 22:47:03,715 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-18 22:47:03,715 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-18 22:47:03,715 INFO L273 TraceCheckUtils]: 47: Hoare triple {2716#true} assume true; {2716#true} is VALID [2018-11-18 22:47:03,716 INFO L273 TraceCheckUtils]: 48: Hoare triple {2716#true} assume !!(~i~0 < ~size);call #t~mem1 := read~int(~set.base, ~set.offset + 4 * ~i~0, 4); {2716#true} is VALID [2018-11-18 22:47:03,716 INFO L273 TraceCheckUtils]: 49: Hoare triple {2716#true} assume #t~mem1 == ~value;havoc #t~mem1;#res := 1; {2716#true} is VALID [2018-11-18 22:47:03,716 INFO L273 TraceCheckUtils]: 50: Hoare triple {2716#true} assume true; {2716#true} is VALID [2018-11-18 22:47:03,717 INFO L268 TraceCheckUtils]: 51: Hoare quadruple {2716#true} {2720#(<= main_~v~0 2)} #132#return; {2720#(<= main_~v~0 2)} is VALID [2018-11-18 22:47:03,717 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-18 22:47:03,718 INFO L273 TraceCheckUtils]: 53: Hoare triple {2720#(<= main_~v~0 2)} assume !(0 == #t~ret8);havoc #t~ret8;havoc #t~mem7; {2720#(<= main_~v~0 2)} is VALID [2018-11-18 22:47:03,718 INFO L273 TraceCheckUtils]: 54: Hoare triple {2720#(<= main_~v~0 2)} #t~post6 := ~v~0;~v~0 := 1 + #t~post6;havoc #t~post6; {2721#(<= main_~v~0 3)} is VALID [2018-11-18 22:47:03,719 INFO L273 TraceCheckUtils]: 55: Hoare triple {2721#(<= main_~v~0 3)} assume true; {2721#(<= main_~v~0 3)} is VALID [2018-11-18 22:47:03,719 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 + 4 * ~v~0, 4); {2721#(<= main_~v~0 3)} is VALID [2018-11-18 22:47:03,720 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-18 22:47:03,720 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-18 22:47:03,720 INFO L273 TraceCheckUtils]: 59: Hoare triple {2716#true} assume true; {2716#true} is VALID [2018-11-18 22:47:03,720 INFO L273 TraceCheckUtils]: 60: Hoare triple {2716#true} assume !!(~i~0 < ~size);call #t~mem1 := read~int(~set.base, ~set.offset + 4 * ~i~0, 4); {2716#true} is VALID [2018-11-18 22:47:03,720 INFO L273 TraceCheckUtils]: 61: Hoare triple {2716#true} assume #t~mem1 == ~value;havoc #t~mem1;#res := 1; {2716#true} is VALID [2018-11-18 22:47:03,721 INFO L273 TraceCheckUtils]: 62: Hoare triple {2716#true} assume true; {2716#true} is VALID [2018-11-18 22:47:03,722 INFO L268 TraceCheckUtils]: 63: Hoare quadruple {2716#true} {2721#(<= main_~v~0 3)} #132#return; {2721#(<= main_~v~0 3)} is VALID [2018-11-18 22:47:03,723 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-18 22:47:03,723 INFO L273 TraceCheckUtils]: 65: Hoare triple {2721#(<= main_~v~0 3)} assume !(0 == #t~ret8);havoc #t~ret8;havoc #t~mem7; {2721#(<= main_~v~0 3)} is VALID [2018-11-18 22:47:03,724 INFO L273 TraceCheckUtils]: 66: Hoare triple {2721#(<= main_~v~0 3)} #t~post6 := ~v~0;~v~0 := 1 + #t~post6;havoc #t~post6; {2722#(<= main_~v~0 4)} is VALID [2018-11-18 22:47:03,724 INFO L273 TraceCheckUtils]: 67: Hoare triple {2722#(<= main_~v~0 4)} assume true; {2722#(<= main_~v~0 4)} is VALID [2018-11-18 22:47:03,725 INFO L273 TraceCheckUtils]: 68: Hoare triple {2722#(<= main_~v~0 4)} assume !(~v~0 < 100000); {2717#false} is VALID [2018-11-18 22:47:03,725 INFO L273 TraceCheckUtils]: 69: Hoare triple {2717#false} ~x~0 := 0; {2717#false} is VALID [2018-11-18 22:47:03,725 INFO L273 TraceCheckUtils]: 70: Hoare triple {2717#false} assume true; {2717#false} is VALID [2018-11-18 22:47:03,726 INFO L273 TraceCheckUtils]: 71: Hoare triple {2717#false} assume !!(~x~0 < ~n~0);~y~0 := 1 + ~x~0; {2717#false} is VALID [2018-11-18 22:47:03,726 INFO L273 TraceCheckUtils]: 72: Hoare triple {2717#false} assume true; {2717#false} is VALID [2018-11-18 22:47:03,726 INFO L273 TraceCheckUtils]: 73: Hoare triple {2717#false} assume !!(~y~0 < ~n~0);call #t~mem13 := read~int(~#set~0.base, ~#set~0.offset + 4 * ~x~0, 4);call #t~mem14 := read~int(~#set~0.base, ~#set~0.offset + 4 * ~y~0, 4); {2717#false} is VALID [2018-11-18 22:47:03,726 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-18 22:47:03,726 INFO L273 TraceCheckUtils]: 75: Hoare triple {2717#false} ~cond := #in~cond; {2717#false} is VALID [2018-11-18 22:47:03,727 INFO L273 TraceCheckUtils]: 76: Hoare triple {2717#false} assume 0 == ~cond; {2717#false} is VALID [2018-11-18 22:47:03,727 INFO L273 TraceCheckUtils]: 77: Hoare triple {2717#false} assume !false; {2717#false} is VALID [2018-11-18 22:47:03,730 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-18 22:47:03,730 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 22:47:03,730 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-18 22:47:03,739 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-18 22:47:03,802 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2018-11-18 22:47:03,803 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-18 22:47:03,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:47:03,840 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 22:47:04,015 INFO L256 TraceCheckUtils]: 0: Hoare triple {2716#true} call ULTIMATE.init(); {2716#true} is VALID [2018-11-18 22:47:04,015 INFO L273 TraceCheckUtils]: 1: Hoare triple {2716#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {2716#true} is VALID [2018-11-18 22:47:04,015 INFO L273 TraceCheckUtils]: 2: Hoare triple {2716#true} assume true; {2716#true} is VALID [2018-11-18 22:47:04,015 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {2716#true} {2716#true} #126#return; {2716#true} is VALID [2018-11-18 22:47:04,015 INFO L256 TraceCheckUtils]: 4: Hoare triple {2716#true} call #t~ret15 := main(); {2716#true} is VALID [2018-11-18 22:47:04,015 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-18 22:47:04,016 INFO L273 TraceCheckUtils]: 6: Hoare triple {2716#true} assume true; {2716#true} is VALID [2018-11-18 22:47:04,016 INFO L273 TraceCheckUtils]: 7: Hoare triple {2716#true} assume !(~x~0 < ~n~0); {2716#true} is VALID [2018-11-18 22:47:04,016 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-18 22:47:04,017 INFO L273 TraceCheckUtils]: 9: Hoare triple {2750#(<= main_~v~0 0)} assume true; {2750#(<= main_~v~0 0)} is VALID [2018-11-18 22:47:04,017 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 + 4 * ~v~0, 4); {2750#(<= main_~v~0 0)} is VALID [2018-11-18 22:47:04,017 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-18 22:47:04,017 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-18 22:47:04,017 INFO L273 TraceCheckUtils]: 13: Hoare triple {2716#true} assume true; {2716#true} is VALID [2018-11-18 22:47:04,018 INFO L273 TraceCheckUtils]: 14: Hoare triple {2716#true} assume !(~i~0 < ~size); {2716#true} is VALID [2018-11-18 22:47:04,018 INFO L273 TraceCheckUtils]: 15: Hoare triple {2716#true} #res := 0; {2716#true} is VALID [2018-11-18 22:47:04,018 INFO L273 TraceCheckUtils]: 16: Hoare triple {2716#true} assume true; {2716#true} is VALID [2018-11-18 22:47:04,019 INFO L268 TraceCheckUtils]: 17: Hoare quadruple {2716#true} {2750#(<= main_~v~0 0)} #132#return; {2750#(<= main_~v~0 0)} is VALID [2018-11-18 22:47:04,019 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-18 22:47:04,020 INFO L273 TraceCheckUtils]: 19: Hoare triple {2750#(<= main_~v~0 0)} assume 0 == #t~ret8;havoc #t~ret8;havoc #t~mem7;call #t~mem9 := read~int(~#values~0.base, ~#values~0.offset + 4 * ~v~0, 4); {2750#(<= main_~v~0 0)} is VALID [2018-11-18 22:47:04,020 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-18 22:47:04,020 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 + 4 * ~size, 4);#res := 1 + ~size; {2716#true} is VALID [2018-11-18 22:47:04,020 INFO L273 TraceCheckUtils]: 22: Hoare triple {2716#true} assume true; {2716#true} is VALID [2018-11-18 22:47:04,022 INFO L268 TraceCheckUtils]: 23: Hoare quadruple {2716#true} {2750#(<= main_~v~0 0)} #134#return; {2750#(<= main_~v~0 0)} is VALID [2018-11-18 22:47:04,022 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-18 22:47:04,023 INFO L273 TraceCheckUtils]: 25: Hoare triple {2750#(<= main_~v~0 0)} #t~post6 := ~v~0;~v~0 := 1 + #t~post6;havoc #t~post6; {2719#(<= main_~v~0 1)} is VALID [2018-11-18 22:47:04,024 INFO L273 TraceCheckUtils]: 26: Hoare triple {2719#(<= main_~v~0 1)} assume true; {2719#(<= main_~v~0 1)} is VALID [2018-11-18 22:47:04,025 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 + 4 * ~v~0, 4); {2719#(<= main_~v~0 1)} is VALID [2018-11-18 22:47:04,025 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-18 22:47:04,025 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-18 22:47:04,025 INFO L273 TraceCheckUtils]: 30: Hoare triple {2716#true} assume true; {2716#true} is VALID [2018-11-18 22:47:04,026 INFO L273 TraceCheckUtils]: 31: Hoare triple {2716#true} assume !(~i~0 < ~size); {2716#true} is VALID [2018-11-18 22:47:04,026 INFO L273 TraceCheckUtils]: 32: Hoare triple {2716#true} #res := 0; {2716#true} is VALID [2018-11-18 22:47:04,026 INFO L273 TraceCheckUtils]: 33: Hoare triple {2716#true} assume true; {2716#true} is VALID [2018-11-18 22:47:04,028 INFO L268 TraceCheckUtils]: 34: Hoare quadruple {2716#true} {2719#(<= main_~v~0 1)} #132#return; {2719#(<= main_~v~0 1)} is VALID [2018-11-18 22:47:04,028 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-18 22:47:04,029 INFO L273 TraceCheckUtils]: 36: Hoare triple {2719#(<= main_~v~0 1)} assume 0 == #t~ret8;havoc #t~ret8;havoc #t~mem7;call #t~mem9 := read~int(~#values~0.base, ~#values~0.offset + 4 * ~v~0, 4); {2719#(<= main_~v~0 1)} is VALID [2018-11-18 22:47:04,029 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-18 22:47:04,029 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 + 4 * ~size, 4);#res := 1 + ~size; {2716#true} is VALID [2018-11-18 22:47:04,029 INFO L273 TraceCheckUtils]: 39: Hoare triple {2716#true} assume true; {2716#true} is VALID [2018-11-18 22:47:04,032 INFO L268 TraceCheckUtils]: 40: Hoare quadruple {2716#true} {2719#(<= main_~v~0 1)} #134#return; {2719#(<= main_~v~0 1)} is VALID [2018-11-18 22:47:04,033 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-18 22:47:04,033 INFO L273 TraceCheckUtils]: 42: Hoare triple {2719#(<= main_~v~0 1)} #t~post6 := ~v~0;~v~0 := 1 + #t~post6;havoc #t~post6; {2720#(<= main_~v~0 2)} is VALID [2018-11-18 22:47:04,034 INFO L273 TraceCheckUtils]: 43: Hoare triple {2720#(<= main_~v~0 2)} assume true; {2720#(<= main_~v~0 2)} is VALID [2018-11-18 22:47:04,034 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 + 4 * ~v~0, 4); {2720#(<= main_~v~0 2)} is VALID [2018-11-18 22:47:04,034 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-18 22:47:04,035 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-18 22:47:04,035 INFO L273 TraceCheckUtils]: 47: Hoare triple {2716#true} assume true; {2716#true} is VALID [2018-11-18 22:47:04,035 INFO L273 TraceCheckUtils]: 48: Hoare triple {2716#true} assume !!(~i~0 < ~size);call #t~mem1 := read~int(~set.base, ~set.offset + 4 * ~i~0, 4); {2716#true} is VALID [2018-11-18 22:47:04,035 INFO L273 TraceCheckUtils]: 49: Hoare triple {2716#true} assume #t~mem1 == ~value;havoc #t~mem1;#res := 1; {2716#true} is VALID [2018-11-18 22:47:04,035 INFO L273 TraceCheckUtils]: 50: Hoare triple {2716#true} assume true; {2716#true} is VALID [2018-11-18 22:47:04,039 INFO L268 TraceCheckUtils]: 51: Hoare quadruple {2716#true} {2720#(<= main_~v~0 2)} #132#return; {2720#(<= main_~v~0 2)} is VALID [2018-11-18 22:47:04,039 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-18 22:47:04,040 INFO L273 TraceCheckUtils]: 53: Hoare triple {2720#(<= main_~v~0 2)} assume !(0 == #t~ret8);havoc #t~ret8;havoc #t~mem7; {2720#(<= main_~v~0 2)} is VALID [2018-11-18 22:47:04,040 INFO L273 TraceCheckUtils]: 54: Hoare triple {2720#(<= main_~v~0 2)} #t~post6 := ~v~0;~v~0 := 1 + #t~post6;havoc #t~post6; {2721#(<= main_~v~0 3)} is VALID [2018-11-18 22:47:04,041 INFO L273 TraceCheckUtils]: 55: Hoare triple {2721#(<= main_~v~0 3)} assume true; {2721#(<= main_~v~0 3)} is VALID [2018-11-18 22:47:04,044 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 + 4 * ~v~0, 4); {2721#(<= main_~v~0 3)} is VALID [2018-11-18 22:47:04,044 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-18 22:47:04,044 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-18 22:47:04,045 INFO L273 TraceCheckUtils]: 59: Hoare triple {2716#true} assume true; {2716#true} is VALID [2018-11-18 22:47:04,045 INFO L273 TraceCheckUtils]: 60: Hoare triple {2716#true} assume !!(~i~0 < ~size);call #t~mem1 := read~int(~set.base, ~set.offset + 4 * ~i~0, 4); {2716#true} is VALID [2018-11-18 22:47:04,045 INFO L273 TraceCheckUtils]: 61: Hoare triple {2716#true} assume #t~mem1 == ~value;havoc #t~mem1;#res := 1; {2716#true} is VALID [2018-11-18 22:47:04,045 INFO L273 TraceCheckUtils]: 62: Hoare triple {2716#true} assume true; {2716#true} is VALID [2018-11-18 22:47:04,046 INFO L268 TraceCheckUtils]: 63: Hoare quadruple {2716#true} {2721#(<= main_~v~0 3)} #132#return; {2721#(<= main_~v~0 3)} is VALID [2018-11-18 22:47:04,047 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-18 22:47:04,047 INFO L273 TraceCheckUtils]: 65: Hoare triple {2721#(<= main_~v~0 3)} assume !(0 == #t~ret8);havoc #t~ret8;havoc #t~mem7; {2721#(<= main_~v~0 3)} is VALID [2018-11-18 22:47:04,048 INFO L273 TraceCheckUtils]: 66: Hoare triple {2721#(<= main_~v~0 3)} #t~post6 := ~v~0;~v~0 := 1 + #t~post6;havoc #t~post6; {2722#(<= main_~v~0 4)} is VALID [2018-11-18 22:47:04,048 INFO L273 TraceCheckUtils]: 67: Hoare triple {2722#(<= main_~v~0 4)} assume true; {2722#(<= main_~v~0 4)} is VALID [2018-11-18 22:47:04,049 INFO L273 TraceCheckUtils]: 68: Hoare triple {2722#(<= main_~v~0 4)} assume !(~v~0 < 100000); {2717#false} is VALID [2018-11-18 22:47:04,049 INFO L273 TraceCheckUtils]: 69: Hoare triple {2717#false} ~x~0 := 0; {2717#false} is VALID [2018-11-18 22:47:04,049 INFO L273 TraceCheckUtils]: 70: Hoare triple {2717#false} assume true; {2717#false} is VALID [2018-11-18 22:47:04,049 INFO L273 TraceCheckUtils]: 71: Hoare triple {2717#false} assume !!(~x~0 < ~n~0);~y~0 := 1 + ~x~0; {2717#false} is VALID [2018-11-18 22:47:04,049 INFO L273 TraceCheckUtils]: 72: Hoare triple {2717#false} assume true; {2717#false} is VALID [2018-11-18 22:47:04,050 INFO L273 TraceCheckUtils]: 73: Hoare triple {2717#false} assume !!(~y~0 < ~n~0);call #t~mem13 := read~int(~#set~0.base, ~#set~0.offset + 4 * ~x~0, 4);call #t~mem14 := read~int(~#set~0.base, ~#set~0.offset + 4 * ~y~0, 4); {2717#false} is VALID [2018-11-18 22:47:04,050 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-18 22:47:04,050 INFO L273 TraceCheckUtils]: 75: Hoare triple {2717#false} ~cond := #in~cond; {2717#false} is VALID [2018-11-18 22:47:04,050 INFO L273 TraceCheckUtils]: 76: Hoare triple {2717#false} assume 0 == ~cond; {2717#false} is VALID [2018-11-18 22:47:04,050 INFO L273 TraceCheckUtils]: 77: Hoare triple {2717#false} assume !false; {2717#false} is VALID [2018-11-18 22:47:04,058 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-18 22:47:04,076 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-18 22:47:04,077 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 8 [2018-11-18 22:47:04,077 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 78 [2018-11-18 22:47:04,078 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-18 22:47:04,078 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states. [2018-11-18 22:47:04,246 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-18 22:47:04,247 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-18 22:47:04,247 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-18 22:47:04,247 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2018-11-18 22:47:04,247 INFO L87 Difference]: Start difference. First operand 111 states and 142 transitions. Second operand 8 states. [2018-11-18 22:47:04,734 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:47:04,735 INFO L93 Difference]: Finished difference Result 188 states and 247 transitions. [2018-11-18 22:47:04,735 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-18 22:47:04,735 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 78 [2018-11-18 22:47:04,735 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 22:47:04,735 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-11-18 22:47:04,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 120 transitions. [2018-11-18 22:47:04,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-11-18 22:47:04,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 120 transitions. [2018-11-18 22:47:04,741 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 120 transitions. [2018-11-18 22:47:04,945 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-18 22:47:04,952 INFO L225 Difference]: With dead ends: 188 [2018-11-18 22:47:04,952 INFO L226 Difference]: Without dead ends: 173 [2018-11-18 22:47:04,953 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-18 22:47:04,953 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 173 states. [2018-11-18 22:47:05,077 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 173 to 137. [2018-11-18 22:47:05,078 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-18 22:47:05,078 INFO L82 GeneralOperation]: Start isEquivalent. First operand 173 states. Second operand 137 states. [2018-11-18 22:47:05,078 INFO L74 IsIncluded]: Start isIncluded. First operand 173 states. Second operand 137 states. [2018-11-18 22:47:05,078 INFO L87 Difference]: Start difference. First operand 173 states. Second operand 137 states. [2018-11-18 22:47:05,089 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:47:05,090 INFO L93 Difference]: Finished difference Result 173 states and 230 transitions. [2018-11-18 22:47:05,090 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 230 transitions. [2018-11-18 22:47:05,091 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:47:05,091 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:47:05,091 INFO L74 IsIncluded]: Start isIncluded. First operand 137 states. Second operand 173 states. [2018-11-18 22:47:05,091 INFO L87 Difference]: Start difference. First operand 137 states. Second operand 173 states. [2018-11-18 22:47:05,102 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:47:05,102 INFO L93 Difference]: Finished difference Result 173 states and 230 transitions. [2018-11-18 22:47:05,103 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 230 transitions. [2018-11-18 22:47:05,104 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:47:05,104 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:47:05,104 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-18 22:47:05,104 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-18 22:47:05,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 137 states. [2018-11-18 22:47:05,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 179 transitions. [2018-11-18 22:47:05,115 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 179 transitions. Word has length 78 [2018-11-18 22:47:05,116 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 22:47:05,116 INFO L480 AbstractCegarLoop]: Abstraction has 137 states and 179 transitions. [2018-11-18 22:47:05,116 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-18 22:47:05,116 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 179 transitions. [2018-11-18 22:47:05,118 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2018-11-18 22:47:05,118 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 22:47:05,118 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-18 22:47:05,118 INFO L423 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 22:47:05,118 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 22:47:05,120 INFO L82 PathProgramCache]: Analyzing trace with hash 1956572023, now seen corresponding path program 4 times [2018-11-18 22:47:05,120 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 22:47:05,120 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 22:47:05,121 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 22:47:05,121 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 22:47:05,122 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 22:47:05,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:47:05,671 INFO L256 TraceCheckUtils]: 0: Hoare triple {3728#true} call ULTIMATE.init(); {3728#true} is VALID [2018-11-18 22:47:05,672 INFO L273 TraceCheckUtils]: 1: Hoare triple {3728#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {3728#true} is VALID [2018-11-18 22:47:05,672 INFO L273 TraceCheckUtils]: 2: Hoare triple {3728#true} assume true; {3728#true} is VALID [2018-11-18 22:47:05,672 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {3728#true} {3728#true} #126#return; {3728#true} is VALID [2018-11-18 22:47:05,672 INFO L256 TraceCheckUtils]: 4: Hoare triple {3728#true} call #t~ret15 := main(); {3728#true} is VALID [2018-11-18 22:47:05,673 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-18 22:47:05,673 INFO L273 TraceCheckUtils]: 6: Hoare triple {3728#true} assume true; {3728#true} is VALID [2018-11-18 22:47:05,673 INFO L273 TraceCheckUtils]: 7: Hoare triple {3728#true} assume !(~x~0 < ~n~0); {3728#true} is VALID [2018-11-18 22:47:05,674 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-18 22:47:05,674 INFO L273 TraceCheckUtils]: 9: Hoare triple {3730#(= main_~v~0 0)} assume true; {3730#(= main_~v~0 0)} is VALID [2018-11-18 22:47:05,674 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 + 4 * ~v~0, 4); {3730#(= main_~v~0 0)} is VALID [2018-11-18 22:47:05,675 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-18 22:47:05,675 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-18 22:47:05,675 INFO L273 TraceCheckUtils]: 13: Hoare triple {3728#true} assume true; {3728#true} is VALID [2018-11-18 22:47:05,675 INFO L273 TraceCheckUtils]: 14: Hoare triple {3728#true} assume !(~i~0 < ~size); {3728#true} is VALID [2018-11-18 22:47:05,675 INFO L273 TraceCheckUtils]: 15: Hoare triple {3728#true} #res := 0; {3728#true} is VALID [2018-11-18 22:47:05,675 INFO L273 TraceCheckUtils]: 16: Hoare triple {3728#true} assume true; {3728#true} is VALID [2018-11-18 22:47:05,676 INFO L268 TraceCheckUtils]: 17: Hoare quadruple {3728#true} {3730#(= main_~v~0 0)} #132#return; {3730#(= main_~v~0 0)} is VALID [2018-11-18 22:47:05,677 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-18 22:47:05,677 INFO L273 TraceCheckUtils]: 19: Hoare triple {3730#(= main_~v~0 0)} assume 0 == #t~ret8;havoc #t~ret8;havoc #t~mem7;call #t~mem9 := read~int(~#values~0.base, ~#values~0.offset + 4 * ~v~0, 4); {3730#(= main_~v~0 0)} is VALID [2018-11-18 22:47:05,677 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-18 22:47:05,677 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 + 4 * ~size, 4);#res := 1 + ~size; {3728#true} is VALID [2018-11-18 22:47:05,678 INFO L273 TraceCheckUtils]: 22: Hoare triple {3728#true} assume true; {3728#true} is VALID [2018-11-18 22:47:05,689 INFO L268 TraceCheckUtils]: 23: Hoare quadruple {3728#true} {3730#(= main_~v~0 0)} #134#return; {3730#(= main_~v~0 0)} is VALID [2018-11-18 22:47:05,689 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-18 22:47:05,690 INFO L273 TraceCheckUtils]: 25: Hoare triple {3730#(= main_~v~0 0)} #t~post6 := ~v~0;~v~0 := 1 + #t~post6;havoc #t~post6; {3731#(<= main_~v~0 1)} is VALID [2018-11-18 22:47:05,690 INFO L273 TraceCheckUtils]: 26: Hoare triple {3731#(<= main_~v~0 1)} assume true; {3731#(<= main_~v~0 1)} is VALID [2018-11-18 22:47:05,690 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 + 4 * ~v~0, 4); {3731#(<= main_~v~0 1)} is VALID [2018-11-18 22:47:05,690 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-18 22:47:05,691 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-18 22:47:05,691 INFO L273 TraceCheckUtils]: 30: Hoare triple {3728#true} assume true; {3728#true} is VALID [2018-11-18 22:47:05,691 INFO L273 TraceCheckUtils]: 31: Hoare triple {3728#true} assume !(~i~0 < ~size); {3728#true} is VALID [2018-11-18 22:47:05,691 INFO L273 TraceCheckUtils]: 32: Hoare triple {3728#true} #res := 0; {3728#true} is VALID [2018-11-18 22:47:05,691 INFO L273 TraceCheckUtils]: 33: Hoare triple {3728#true} assume true; {3728#true} is VALID [2018-11-18 22:47:05,692 INFO L268 TraceCheckUtils]: 34: Hoare quadruple {3728#true} {3731#(<= main_~v~0 1)} #132#return; {3731#(<= main_~v~0 1)} is VALID [2018-11-18 22:47:05,693 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-18 22:47:05,693 INFO L273 TraceCheckUtils]: 36: Hoare triple {3731#(<= main_~v~0 1)} assume 0 == #t~ret8;havoc #t~ret8;havoc #t~mem7;call #t~mem9 := read~int(~#values~0.base, ~#values~0.offset + 4 * ~v~0, 4); {3731#(<= main_~v~0 1)} is VALID [2018-11-18 22:47:05,693 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-18 22:47:05,693 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 + 4 * ~size, 4);#res := 1 + ~size; {3728#true} is VALID [2018-11-18 22:47:05,693 INFO L273 TraceCheckUtils]: 39: Hoare triple {3728#true} assume true; {3728#true} is VALID [2018-11-18 22:47:05,694 INFO L268 TraceCheckUtils]: 40: Hoare quadruple {3728#true} {3731#(<= main_~v~0 1)} #134#return; {3731#(<= main_~v~0 1)} is VALID [2018-11-18 22:47:05,695 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-18 22:47:05,695 INFO L273 TraceCheckUtils]: 42: Hoare triple {3731#(<= main_~v~0 1)} #t~post6 := ~v~0;~v~0 := 1 + #t~post6;havoc #t~post6; {3732#(<= main_~v~0 2)} is VALID [2018-11-18 22:47:05,696 INFO L273 TraceCheckUtils]: 43: Hoare triple {3732#(<= main_~v~0 2)} assume true; {3732#(<= main_~v~0 2)} is VALID [2018-11-18 22:47:05,696 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 + 4 * ~v~0, 4); {3732#(<= main_~v~0 2)} is VALID [2018-11-18 22:47:05,696 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-18 22:47:05,697 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-18 22:47:05,697 INFO L273 TraceCheckUtils]: 47: Hoare triple {3728#true} assume true; {3728#true} is VALID [2018-11-18 22:47:05,697 INFO L273 TraceCheckUtils]: 48: Hoare triple {3728#true} assume !!(~i~0 < ~size);call #t~mem1 := read~int(~set.base, ~set.offset + 4 * ~i~0, 4); {3728#true} is VALID [2018-11-18 22:47:05,697 INFO L273 TraceCheckUtils]: 49: Hoare triple {3728#true} assume #t~mem1 == ~value;havoc #t~mem1;#res := 1; {3728#true} is VALID [2018-11-18 22:47:05,697 INFO L273 TraceCheckUtils]: 50: Hoare triple {3728#true} assume true; {3728#true} is VALID [2018-11-18 22:47:05,699 INFO L268 TraceCheckUtils]: 51: Hoare quadruple {3728#true} {3732#(<= main_~v~0 2)} #132#return; {3732#(<= main_~v~0 2)} is VALID [2018-11-18 22:47:05,699 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-18 22:47:05,700 INFO L273 TraceCheckUtils]: 53: Hoare triple {3732#(<= main_~v~0 2)} assume !(0 == #t~ret8);havoc #t~ret8;havoc #t~mem7; {3732#(<= main_~v~0 2)} is VALID [2018-11-18 22:47:05,700 INFO L273 TraceCheckUtils]: 54: Hoare triple {3732#(<= main_~v~0 2)} #t~post6 := ~v~0;~v~0 := 1 + #t~post6;havoc #t~post6; {3733#(<= main_~v~0 3)} is VALID [2018-11-18 22:47:05,701 INFO L273 TraceCheckUtils]: 55: Hoare triple {3733#(<= main_~v~0 3)} assume true; {3733#(<= main_~v~0 3)} is VALID [2018-11-18 22:47:05,701 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 + 4 * ~v~0, 4); {3733#(<= main_~v~0 3)} is VALID [2018-11-18 22:47:05,701 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-18 22:47:05,701 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-18 22:47:05,701 INFO L273 TraceCheckUtils]: 59: Hoare triple {3728#true} assume true; {3728#true} is VALID [2018-11-18 22:47:05,702 INFO L273 TraceCheckUtils]: 60: Hoare triple {3728#true} assume !!(~i~0 < ~size);call #t~mem1 := read~int(~set.base, ~set.offset + 4 * ~i~0, 4); {3728#true} is VALID [2018-11-18 22:47:05,702 INFO L273 TraceCheckUtils]: 61: Hoare triple {3728#true} assume #t~mem1 == ~value;havoc #t~mem1;#res := 1; {3728#true} is VALID [2018-11-18 22:47:05,702 INFO L273 TraceCheckUtils]: 62: Hoare triple {3728#true} assume true; {3728#true} is VALID [2018-11-18 22:47:05,703 INFO L268 TraceCheckUtils]: 63: Hoare quadruple {3728#true} {3733#(<= main_~v~0 3)} #132#return; {3733#(<= main_~v~0 3)} is VALID [2018-11-18 22:47:05,703 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-18 22:47:05,704 INFO L273 TraceCheckUtils]: 65: Hoare triple {3733#(<= main_~v~0 3)} assume !(0 == #t~ret8);havoc #t~ret8;havoc #t~mem7; {3733#(<= main_~v~0 3)} is VALID [2018-11-18 22:47:05,704 INFO L273 TraceCheckUtils]: 66: Hoare triple {3733#(<= main_~v~0 3)} #t~post6 := ~v~0;~v~0 := 1 + #t~post6;havoc #t~post6; {3734#(<= main_~v~0 4)} is VALID [2018-11-18 22:47:05,705 INFO L273 TraceCheckUtils]: 67: Hoare triple {3734#(<= main_~v~0 4)} assume true; {3734#(<= main_~v~0 4)} is VALID [2018-11-18 22:47:05,705 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 + 4 * ~v~0, 4); {3734#(<= main_~v~0 4)} is VALID [2018-11-18 22:47:05,705 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-18 22:47:05,705 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-18 22:47:05,705 INFO L273 TraceCheckUtils]: 71: Hoare triple {3728#true} assume true; {3728#true} is VALID [2018-11-18 22:47:05,706 INFO L273 TraceCheckUtils]: 72: Hoare triple {3728#true} assume !!(~i~0 < ~size);call #t~mem1 := read~int(~set.base, ~set.offset + 4 * ~i~0, 4); {3728#true} is VALID [2018-11-18 22:47:05,706 INFO L273 TraceCheckUtils]: 73: Hoare triple {3728#true} assume #t~mem1 == ~value;havoc #t~mem1;#res := 1; {3728#true} is VALID [2018-11-18 22:47:05,706 INFO L273 TraceCheckUtils]: 74: Hoare triple {3728#true} assume true; {3728#true} is VALID [2018-11-18 22:47:05,707 INFO L268 TraceCheckUtils]: 75: Hoare quadruple {3728#true} {3734#(<= main_~v~0 4)} #132#return; {3734#(<= main_~v~0 4)} is VALID [2018-11-18 22:47:05,707 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-18 22:47:05,707 INFO L273 TraceCheckUtils]: 77: Hoare triple {3734#(<= main_~v~0 4)} assume !(0 == #t~ret8);havoc #t~ret8;havoc #t~mem7; {3734#(<= main_~v~0 4)} is VALID [2018-11-18 22:47:05,708 INFO L273 TraceCheckUtils]: 78: Hoare triple {3734#(<= main_~v~0 4)} #t~post6 := ~v~0;~v~0 := 1 + #t~post6;havoc #t~post6; {3735#(<= main_~v~0 5)} is VALID [2018-11-18 22:47:05,708 INFO L273 TraceCheckUtils]: 79: Hoare triple {3735#(<= main_~v~0 5)} assume true; {3735#(<= main_~v~0 5)} is VALID [2018-11-18 22:47:05,709 INFO L273 TraceCheckUtils]: 80: Hoare triple {3735#(<= main_~v~0 5)} assume !(~v~0 < 100000); {3729#false} is VALID [2018-11-18 22:47:05,709 INFO L273 TraceCheckUtils]: 81: Hoare triple {3729#false} ~x~0 := 0; {3729#false} is VALID [2018-11-18 22:47:05,709 INFO L273 TraceCheckUtils]: 82: Hoare triple {3729#false} assume true; {3729#false} is VALID [2018-11-18 22:47:05,709 INFO L273 TraceCheckUtils]: 83: Hoare triple {3729#false} assume !!(~x~0 < ~n~0);~y~0 := 1 + ~x~0; {3729#false} is VALID [2018-11-18 22:47:05,710 INFO L273 TraceCheckUtils]: 84: Hoare triple {3729#false} assume true; {3729#false} is VALID [2018-11-18 22:47:05,710 INFO L273 TraceCheckUtils]: 85: Hoare triple {3729#false} assume !!(~y~0 < ~n~0);call #t~mem13 := read~int(~#set~0.base, ~#set~0.offset + 4 * ~x~0, 4);call #t~mem14 := read~int(~#set~0.base, ~#set~0.offset + 4 * ~y~0, 4); {3729#false} is VALID [2018-11-18 22:47:05,710 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-18 22:47:05,710 INFO L273 TraceCheckUtils]: 87: Hoare triple {3729#false} ~cond := #in~cond; {3729#false} is VALID [2018-11-18 22:47:05,710 INFO L273 TraceCheckUtils]: 88: Hoare triple {3729#false} assume 0 == ~cond; {3729#false} is VALID [2018-11-18 22:47:05,711 INFO L273 TraceCheckUtils]: 89: Hoare triple {3729#false} assume !false; {3729#false} is VALID [2018-11-18 22:47:05,715 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-18 22:47:05,715 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 22:47:05,715 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-18 22:47:05,725 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-18 22:47:05,772 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-18 22:47:05,773 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-18 22:47:05,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:47:05,795 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 22:47:06,117 INFO L256 TraceCheckUtils]: 0: Hoare triple {3728#true} call ULTIMATE.init(); {3728#true} is VALID [2018-11-18 22:47:06,117 INFO L273 TraceCheckUtils]: 1: Hoare triple {3728#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {3728#true} is VALID [2018-11-18 22:47:06,118 INFO L273 TraceCheckUtils]: 2: Hoare triple {3728#true} assume true; {3728#true} is VALID [2018-11-18 22:47:06,118 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {3728#true} {3728#true} #126#return; {3728#true} is VALID [2018-11-18 22:47:06,118 INFO L256 TraceCheckUtils]: 4: Hoare triple {3728#true} call #t~ret15 := main(); {3728#true} is VALID [2018-11-18 22:47:06,119 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-18 22:47:06,119 INFO L273 TraceCheckUtils]: 6: Hoare triple {3728#true} assume true; {3728#true} is VALID [2018-11-18 22:47:06,119 INFO L273 TraceCheckUtils]: 7: Hoare triple {3728#true} assume !(~x~0 < ~n~0); {3728#true} is VALID [2018-11-18 22:47:06,127 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-18 22:47:06,127 INFO L273 TraceCheckUtils]: 9: Hoare triple {3763#(<= main_~v~0 0)} assume true; {3763#(<= main_~v~0 0)} is VALID [2018-11-18 22:47:06,127 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 + 4 * ~v~0, 4); {3763#(<= main_~v~0 0)} is VALID [2018-11-18 22:47:06,128 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-18 22:47:06,128 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-18 22:47:06,128 INFO L273 TraceCheckUtils]: 13: Hoare triple {3728#true} assume true; {3728#true} is VALID [2018-11-18 22:47:06,128 INFO L273 TraceCheckUtils]: 14: Hoare triple {3728#true} assume !(~i~0 < ~size); {3728#true} is VALID [2018-11-18 22:47:06,128 INFO L273 TraceCheckUtils]: 15: Hoare triple {3728#true} #res := 0; {3728#true} is VALID [2018-11-18 22:47:06,128 INFO L273 TraceCheckUtils]: 16: Hoare triple {3728#true} assume true; {3728#true} is VALID [2018-11-18 22:47:06,129 INFO L268 TraceCheckUtils]: 17: Hoare quadruple {3728#true} {3763#(<= main_~v~0 0)} #132#return; {3763#(<= main_~v~0 0)} is VALID [2018-11-18 22:47:06,130 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-18 22:47:06,130 INFO L273 TraceCheckUtils]: 19: Hoare triple {3763#(<= main_~v~0 0)} assume 0 == #t~ret8;havoc #t~ret8;havoc #t~mem7;call #t~mem9 := read~int(~#values~0.base, ~#values~0.offset + 4 * ~v~0, 4); {3763#(<= main_~v~0 0)} is VALID [2018-11-18 22:47:06,130 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-18 22:47:06,130 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 + 4 * ~size, 4);#res := 1 + ~size; {3728#true} is VALID [2018-11-18 22:47:06,130 INFO L273 TraceCheckUtils]: 22: Hoare triple {3728#true} assume true; {3728#true} is VALID [2018-11-18 22:47:06,132 INFO L268 TraceCheckUtils]: 23: Hoare quadruple {3728#true} {3763#(<= main_~v~0 0)} #134#return; {3763#(<= main_~v~0 0)} is VALID [2018-11-18 22:47:06,132 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-18 22:47:06,132 INFO L273 TraceCheckUtils]: 25: Hoare triple {3763#(<= main_~v~0 0)} #t~post6 := ~v~0;~v~0 := 1 + #t~post6;havoc #t~post6; {3731#(<= main_~v~0 1)} is VALID [2018-11-18 22:47:06,133 INFO L273 TraceCheckUtils]: 26: Hoare triple {3731#(<= main_~v~0 1)} assume true; {3731#(<= main_~v~0 1)} is VALID [2018-11-18 22:47:06,133 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 + 4 * ~v~0, 4); {3731#(<= main_~v~0 1)} is VALID [2018-11-18 22:47:06,134 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-18 22:47:06,134 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-18 22:47:06,134 INFO L273 TraceCheckUtils]: 30: Hoare triple {3728#true} assume true; {3728#true} is VALID [2018-11-18 22:47:06,134 INFO L273 TraceCheckUtils]: 31: Hoare triple {3728#true} assume !(~i~0 < ~size); {3728#true} is VALID [2018-11-18 22:47:06,134 INFO L273 TraceCheckUtils]: 32: Hoare triple {3728#true} #res := 0; {3728#true} is VALID [2018-11-18 22:47:06,135 INFO L273 TraceCheckUtils]: 33: Hoare triple {3728#true} assume true; {3728#true} is VALID [2018-11-18 22:47:06,136 INFO L268 TraceCheckUtils]: 34: Hoare quadruple {3728#true} {3731#(<= main_~v~0 1)} #132#return; {3731#(<= main_~v~0 1)} is VALID [2018-11-18 22:47:06,137 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-18 22:47:06,137 INFO L273 TraceCheckUtils]: 36: Hoare triple {3731#(<= main_~v~0 1)} assume 0 == #t~ret8;havoc #t~ret8;havoc #t~mem7;call #t~mem9 := read~int(~#values~0.base, ~#values~0.offset + 4 * ~v~0, 4); {3731#(<= main_~v~0 1)} is VALID [2018-11-18 22:47:06,137 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-18 22:47:06,137 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 + 4 * ~size, 4);#res := 1 + ~size; {3728#true} is VALID [2018-11-18 22:47:06,138 INFO L273 TraceCheckUtils]: 39: Hoare triple {3728#true} assume true; {3728#true} is VALID [2018-11-18 22:47:06,139 INFO L268 TraceCheckUtils]: 40: Hoare quadruple {3728#true} {3731#(<= main_~v~0 1)} #134#return; {3731#(<= main_~v~0 1)} is VALID [2018-11-18 22:47:06,139 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-18 22:47:06,140 INFO L273 TraceCheckUtils]: 42: Hoare triple {3731#(<= main_~v~0 1)} #t~post6 := ~v~0;~v~0 := 1 + #t~post6;havoc #t~post6; {3732#(<= main_~v~0 2)} is VALID [2018-11-18 22:47:06,140 INFO L273 TraceCheckUtils]: 43: Hoare triple {3732#(<= main_~v~0 2)} assume true; {3732#(<= main_~v~0 2)} is VALID [2018-11-18 22:47:06,141 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 + 4 * ~v~0, 4); {3732#(<= main_~v~0 2)} is VALID [2018-11-18 22:47:06,141 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-18 22:47:06,141 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-18 22:47:06,142 INFO L273 TraceCheckUtils]: 47: Hoare triple {3728#true} assume true; {3728#true} is VALID [2018-11-18 22:47:06,142 INFO L273 TraceCheckUtils]: 48: Hoare triple {3728#true} assume !!(~i~0 < ~size);call #t~mem1 := read~int(~set.base, ~set.offset + 4 * ~i~0, 4); {3728#true} is VALID [2018-11-18 22:47:06,142 INFO L273 TraceCheckUtils]: 49: Hoare triple {3728#true} assume #t~mem1 == ~value;havoc #t~mem1;#res := 1; {3728#true} is VALID [2018-11-18 22:47:06,142 INFO L273 TraceCheckUtils]: 50: Hoare triple {3728#true} assume true; {3728#true} is VALID [2018-11-18 22:47:06,144 INFO L268 TraceCheckUtils]: 51: Hoare quadruple {3728#true} {3732#(<= main_~v~0 2)} #132#return; {3732#(<= main_~v~0 2)} is VALID [2018-11-18 22:47:06,162 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-18 22:47:06,171 INFO L273 TraceCheckUtils]: 53: Hoare triple {3732#(<= main_~v~0 2)} assume !(0 == #t~ret8);havoc #t~ret8;havoc #t~mem7; {3732#(<= main_~v~0 2)} is VALID [2018-11-18 22:47:06,173 INFO L273 TraceCheckUtils]: 54: Hoare triple {3732#(<= main_~v~0 2)} #t~post6 := ~v~0;~v~0 := 1 + #t~post6;havoc #t~post6; {3733#(<= main_~v~0 3)} is VALID [2018-11-18 22:47:06,173 INFO L273 TraceCheckUtils]: 55: Hoare triple {3733#(<= main_~v~0 3)} assume true; {3733#(<= main_~v~0 3)} is VALID [2018-11-18 22:47:06,174 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 + 4 * ~v~0, 4); {3733#(<= main_~v~0 3)} is VALID [2018-11-18 22:47:06,174 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-18 22:47:06,174 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-18 22:47:06,174 INFO L273 TraceCheckUtils]: 59: Hoare triple {3728#true} assume true; {3728#true} is VALID [2018-11-18 22:47:06,174 INFO L273 TraceCheckUtils]: 60: Hoare triple {3728#true} assume !!(~i~0 < ~size);call #t~mem1 := read~int(~set.base, ~set.offset + 4 * ~i~0, 4); {3728#true} is VALID [2018-11-18 22:47:06,174 INFO L273 TraceCheckUtils]: 61: Hoare triple {3728#true} assume #t~mem1 == ~value;havoc #t~mem1;#res := 1; {3728#true} is VALID [2018-11-18 22:47:06,174 INFO L273 TraceCheckUtils]: 62: Hoare triple {3728#true} assume true; {3728#true} is VALID [2018-11-18 22:47:06,175 INFO L268 TraceCheckUtils]: 63: Hoare quadruple {3728#true} {3733#(<= main_~v~0 3)} #132#return; {3733#(<= main_~v~0 3)} is VALID [2018-11-18 22:47:06,176 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-18 22:47:06,176 INFO L273 TraceCheckUtils]: 65: Hoare triple {3733#(<= main_~v~0 3)} assume !(0 == #t~ret8);havoc #t~ret8;havoc #t~mem7; {3733#(<= main_~v~0 3)} is VALID [2018-11-18 22:47:06,177 INFO L273 TraceCheckUtils]: 66: Hoare triple {3733#(<= main_~v~0 3)} #t~post6 := ~v~0;~v~0 := 1 + #t~post6;havoc #t~post6; {3734#(<= main_~v~0 4)} is VALID [2018-11-18 22:47:06,177 INFO L273 TraceCheckUtils]: 67: Hoare triple {3734#(<= main_~v~0 4)} assume true; {3734#(<= main_~v~0 4)} is VALID [2018-11-18 22:47:06,177 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 + 4 * ~v~0, 4); {3734#(<= main_~v~0 4)} is VALID [2018-11-18 22:47:06,177 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-18 22:47:06,178 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-18 22:47:06,178 INFO L273 TraceCheckUtils]: 71: Hoare triple {3728#true} assume true; {3728#true} is VALID [2018-11-18 22:47:06,178 INFO L273 TraceCheckUtils]: 72: Hoare triple {3728#true} assume !!(~i~0 < ~size);call #t~mem1 := read~int(~set.base, ~set.offset + 4 * ~i~0, 4); {3728#true} is VALID [2018-11-18 22:47:06,178 INFO L273 TraceCheckUtils]: 73: Hoare triple {3728#true} assume #t~mem1 == ~value;havoc #t~mem1;#res := 1; {3728#true} is VALID [2018-11-18 22:47:06,178 INFO L273 TraceCheckUtils]: 74: Hoare triple {3728#true} assume true; {3728#true} is VALID [2018-11-18 22:47:06,179 INFO L268 TraceCheckUtils]: 75: Hoare quadruple {3728#true} {3734#(<= main_~v~0 4)} #132#return; {3734#(<= main_~v~0 4)} is VALID [2018-11-18 22:47:06,180 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-18 22:47:06,180 INFO L273 TraceCheckUtils]: 77: Hoare triple {3734#(<= main_~v~0 4)} assume !(0 == #t~ret8);havoc #t~ret8;havoc #t~mem7; {3734#(<= main_~v~0 4)} is VALID [2018-11-18 22:47:06,181 INFO L273 TraceCheckUtils]: 78: Hoare triple {3734#(<= main_~v~0 4)} #t~post6 := ~v~0;~v~0 := 1 + #t~post6;havoc #t~post6; {3735#(<= main_~v~0 5)} is VALID [2018-11-18 22:47:06,181 INFO L273 TraceCheckUtils]: 79: Hoare triple {3735#(<= main_~v~0 5)} assume true; {3735#(<= main_~v~0 5)} is VALID [2018-11-18 22:47:06,182 INFO L273 TraceCheckUtils]: 80: Hoare triple {3735#(<= main_~v~0 5)} assume !(~v~0 < 100000); {3729#false} is VALID [2018-11-18 22:47:06,182 INFO L273 TraceCheckUtils]: 81: Hoare triple {3729#false} ~x~0 := 0; {3729#false} is VALID [2018-11-18 22:47:06,182 INFO L273 TraceCheckUtils]: 82: Hoare triple {3729#false} assume true; {3729#false} is VALID [2018-11-18 22:47:06,182 INFO L273 TraceCheckUtils]: 83: Hoare triple {3729#false} assume !!(~x~0 < ~n~0);~y~0 := 1 + ~x~0; {3729#false} is VALID [2018-11-18 22:47:06,182 INFO L273 TraceCheckUtils]: 84: Hoare triple {3729#false} assume true; {3729#false} is VALID [2018-11-18 22:47:06,183 INFO L273 TraceCheckUtils]: 85: Hoare triple {3729#false} assume !!(~y~0 < ~n~0);call #t~mem13 := read~int(~#set~0.base, ~#set~0.offset + 4 * ~x~0, 4);call #t~mem14 := read~int(~#set~0.base, ~#set~0.offset + 4 * ~y~0, 4); {3729#false} is VALID [2018-11-18 22:47:06,183 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-18 22:47:06,183 INFO L273 TraceCheckUtils]: 87: Hoare triple {3729#false} ~cond := #in~cond; {3729#false} is VALID [2018-11-18 22:47:06,183 INFO L273 TraceCheckUtils]: 88: Hoare triple {3729#false} assume 0 == ~cond; {3729#false} is VALID [2018-11-18 22:47:06,183 INFO L273 TraceCheckUtils]: 89: Hoare triple {3729#false} assume !false; {3729#false} is VALID [2018-11-18 22:47:06,187 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-18 22:47:06,207 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-18 22:47:06,208 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 9 [2018-11-18 22:47:06,208 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 90 [2018-11-18 22:47:06,209 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-18 22:47:06,209 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states. [2018-11-18 22:47:06,291 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-18 22:47:06,291 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-18 22:47:06,292 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-18 22:47:06,292 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2018-11-18 22:47:06,292 INFO L87 Difference]: Start difference. First operand 137 states and 179 transitions. Second operand 9 states. [2018-11-18 22:47:07,177 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:47:07,178 INFO L93 Difference]: Finished difference Result 214 states and 284 transitions. [2018-11-18 22:47:07,178 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-18 22:47:07,178 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 90 [2018-11-18 22:47:07,179 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 22:47:07,179 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-11-18 22:47:07,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 131 transitions. [2018-11-18 22:47:07,184 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-11-18 22:47:07,187 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 131 transitions. [2018-11-18 22:47:07,187 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states and 131 transitions. [2018-11-18 22:47:07,899 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-18 22:47:07,906 INFO L225 Difference]: With dead ends: 214 [2018-11-18 22:47:07,907 INFO L226 Difference]: Without dead ends: 199 [2018-11-18 22:47:07,907 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 90 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2018-11-18 22:47:07,908 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 199 states. [2018-11-18 22:47:08,024 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 199 to 163. [2018-11-18 22:47:08,024 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-18 22:47:08,024 INFO L82 GeneralOperation]: Start isEquivalent. First operand 199 states. Second operand 163 states. [2018-11-18 22:47:08,024 INFO L74 IsIncluded]: Start isIncluded. First operand 199 states. Second operand 163 states. [2018-11-18 22:47:08,025 INFO L87 Difference]: Start difference. First operand 199 states. Second operand 163 states. [2018-11-18 22:47:08,037 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:47:08,037 INFO L93 Difference]: Finished difference Result 199 states and 267 transitions. [2018-11-18 22:47:08,037 INFO L276 IsEmpty]: Start isEmpty. Operand 199 states and 267 transitions. [2018-11-18 22:47:08,039 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:47:08,039 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:47:08,039 INFO L74 IsIncluded]: Start isIncluded. First operand 163 states. Second operand 199 states. [2018-11-18 22:47:08,039 INFO L87 Difference]: Start difference. First operand 163 states. Second operand 199 states. [2018-11-18 22:47:08,051 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:47:08,051 INFO L93 Difference]: Finished difference Result 199 states and 267 transitions. [2018-11-18 22:47:08,051 INFO L276 IsEmpty]: Start isEmpty. Operand 199 states and 267 transitions. [2018-11-18 22:47:08,053 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:47:08,053 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:47:08,053 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-18 22:47:08,053 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-18 22:47:08,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 163 states. [2018-11-18 22:47:08,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 216 transitions. [2018-11-18 22:47:08,062 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 216 transitions. Word has length 90 [2018-11-18 22:47:08,063 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 22:47:08,063 INFO L480 AbstractCegarLoop]: Abstraction has 163 states and 216 transitions. [2018-11-18 22:47:08,063 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-18 22:47:08,063 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 216 transitions. [2018-11-18 22:47:08,065 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2018-11-18 22:47:08,065 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 22:47:08,065 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-18 22:47:08,066 INFO L423 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 22:47:08,066 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 22:47:08,066 INFO L82 PathProgramCache]: Analyzing trace with hash 1977748101, now seen corresponding path program 5 times [2018-11-18 22:47:08,066 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 22:47:08,067 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 22:47:08,067 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 22:47:08,068 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 22:47:08,068 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 22:47:08,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:47:08,486 INFO L256 TraceCheckUtils]: 0: Hoare triple {4897#true} call ULTIMATE.init(); {4897#true} is VALID [2018-11-18 22:47:08,486 INFO L273 TraceCheckUtils]: 1: Hoare triple {4897#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {4897#true} is VALID [2018-11-18 22:47:08,486 INFO L273 TraceCheckUtils]: 2: Hoare triple {4897#true} assume true; {4897#true} is VALID [2018-11-18 22:47:08,486 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {4897#true} {4897#true} #126#return; {4897#true} is VALID [2018-11-18 22:47:08,487 INFO L256 TraceCheckUtils]: 4: Hoare triple {4897#true} call #t~ret15 := main(); {4897#true} is VALID [2018-11-18 22:47:08,487 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-18 22:47:08,487 INFO L273 TraceCheckUtils]: 6: Hoare triple {4897#true} assume true; {4897#true} is VALID [2018-11-18 22:47:08,487 INFO L273 TraceCheckUtils]: 7: Hoare triple {4897#true} assume !(~x~0 < ~n~0); {4897#true} is VALID [2018-11-18 22:47:08,488 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-18 22:47:08,488 INFO L273 TraceCheckUtils]: 9: Hoare triple {4899#(= main_~v~0 0)} assume true; {4899#(= main_~v~0 0)} is VALID [2018-11-18 22:47:08,488 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 + 4 * ~v~0, 4); {4899#(= main_~v~0 0)} is VALID [2018-11-18 22:47:08,488 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-18 22:47:08,489 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-18 22:47:08,489 INFO L273 TraceCheckUtils]: 13: Hoare triple {4897#true} assume true; {4897#true} is VALID [2018-11-18 22:47:08,489 INFO L273 TraceCheckUtils]: 14: Hoare triple {4897#true} assume !(~i~0 < ~size); {4897#true} is VALID [2018-11-18 22:47:08,489 INFO L273 TraceCheckUtils]: 15: Hoare triple {4897#true} #res := 0; {4897#true} is VALID [2018-11-18 22:47:08,489 INFO L273 TraceCheckUtils]: 16: Hoare triple {4897#true} assume true; {4897#true} is VALID [2018-11-18 22:47:08,490 INFO L268 TraceCheckUtils]: 17: Hoare quadruple {4897#true} {4899#(= main_~v~0 0)} #132#return; {4899#(= main_~v~0 0)} is VALID [2018-11-18 22:47:08,490 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-18 22:47:08,490 INFO L273 TraceCheckUtils]: 19: Hoare triple {4899#(= main_~v~0 0)} assume 0 == #t~ret8;havoc #t~ret8;havoc #t~mem7;call #t~mem9 := read~int(~#values~0.base, ~#values~0.offset + 4 * ~v~0, 4); {4899#(= main_~v~0 0)} is VALID [2018-11-18 22:47:08,491 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-18 22:47:08,491 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 + 4 * ~size, 4);#res := 1 + ~size; {4897#true} is VALID [2018-11-18 22:47:08,491 INFO L273 TraceCheckUtils]: 22: Hoare triple {4897#true} assume true; {4897#true} is VALID [2018-11-18 22:47:08,491 INFO L268 TraceCheckUtils]: 23: Hoare quadruple {4897#true} {4899#(= main_~v~0 0)} #134#return; {4899#(= main_~v~0 0)} is VALID [2018-11-18 22:47:08,492 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-18 22:47:08,492 INFO L273 TraceCheckUtils]: 25: Hoare triple {4899#(= main_~v~0 0)} #t~post6 := ~v~0;~v~0 := 1 + #t~post6;havoc #t~post6; {4900#(<= main_~v~0 1)} is VALID [2018-11-18 22:47:08,493 INFO L273 TraceCheckUtils]: 26: Hoare triple {4900#(<= main_~v~0 1)} assume true; {4900#(<= main_~v~0 1)} is VALID [2018-11-18 22:47:08,493 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 + 4 * ~v~0, 4); {4900#(<= main_~v~0 1)} is VALID [2018-11-18 22:47:08,494 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-18 22:47:08,494 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-18 22:47:08,494 INFO L273 TraceCheckUtils]: 30: Hoare triple {4897#true} assume true; {4897#true} is VALID [2018-11-18 22:47:08,494 INFO L273 TraceCheckUtils]: 31: Hoare triple {4897#true} assume !(~i~0 < ~size); {4897#true} is VALID [2018-11-18 22:47:08,495 INFO L273 TraceCheckUtils]: 32: Hoare triple {4897#true} #res := 0; {4897#true} is VALID [2018-11-18 22:47:08,495 INFO L273 TraceCheckUtils]: 33: Hoare triple {4897#true} assume true; {4897#true} is VALID [2018-11-18 22:47:08,496 INFO L268 TraceCheckUtils]: 34: Hoare quadruple {4897#true} {4900#(<= main_~v~0 1)} #132#return; {4900#(<= main_~v~0 1)} is VALID [2018-11-18 22:47:08,496 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-18 22:47:08,497 INFO L273 TraceCheckUtils]: 36: Hoare triple {4900#(<= main_~v~0 1)} assume 0 == #t~ret8;havoc #t~ret8;havoc #t~mem7;call #t~mem9 := read~int(~#values~0.base, ~#values~0.offset + 4 * ~v~0, 4); {4900#(<= main_~v~0 1)} is VALID [2018-11-18 22:47:08,497 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-18 22:47:08,498 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 + 4 * ~size, 4);#res := 1 + ~size; {4897#true} is VALID [2018-11-18 22:47:08,498 INFO L273 TraceCheckUtils]: 39: Hoare triple {4897#true} assume true; {4897#true} is VALID [2018-11-18 22:47:08,499 INFO L268 TraceCheckUtils]: 40: Hoare quadruple {4897#true} {4900#(<= main_~v~0 1)} #134#return; {4900#(<= main_~v~0 1)} is VALID [2018-11-18 22:47:08,500 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-18 22:47:08,501 INFO L273 TraceCheckUtils]: 42: Hoare triple {4900#(<= main_~v~0 1)} #t~post6 := ~v~0;~v~0 := 1 + #t~post6;havoc #t~post6; {4901#(<= main_~v~0 2)} is VALID [2018-11-18 22:47:08,501 INFO L273 TraceCheckUtils]: 43: Hoare triple {4901#(<= main_~v~0 2)} assume true; {4901#(<= main_~v~0 2)} is VALID [2018-11-18 22:47:08,501 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 + 4 * ~v~0, 4); {4901#(<= main_~v~0 2)} is VALID [2018-11-18 22:47:08,502 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-18 22:47:08,502 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-18 22:47:08,502 INFO L273 TraceCheckUtils]: 47: Hoare triple {4897#true} assume true; {4897#true} is VALID [2018-11-18 22:47:08,502 INFO L273 TraceCheckUtils]: 48: Hoare triple {4897#true} assume !!(~i~0 < ~size);call #t~mem1 := read~int(~set.base, ~set.offset + 4 * ~i~0, 4); {4897#true} is VALID [2018-11-18 22:47:08,502 INFO L273 TraceCheckUtils]: 49: Hoare triple {4897#true} assume #t~mem1 == ~value;havoc #t~mem1;#res := 1; {4897#true} is VALID [2018-11-18 22:47:08,502 INFO L273 TraceCheckUtils]: 50: Hoare triple {4897#true} assume true; {4897#true} is VALID [2018-11-18 22:47:08,503 INFO L268 TraceCheckUtils]: 51: Hoare quadruple {4897#true} {4901#(<= main_~v~0 2)} #132#return; {4901#(<= main_~v~0 2)} is VALID [2018-11-18 22:47:08,504 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-18 22:47:08,504 INFO L273 TraceCheckUtils]: 53: Hoare triple {4901#(<= main_~v~0 2)} assume !(0 == #t~ret8);havoc #t~ret8;havoc #t~mem7; {4901#(<= main_~v~0 2)} is VALID [2018-11-18 22:47:08,505 INFO L273 TraceCheckUtils]: 54: Hoare triple {4901#(<= main_~v~0 2)} #t~post6 := ~v~0;~v~0 := 1 + #t~post6;havoc #t~post6; {4902#(<= main_~v~0 3)} is VALID [2018-11-18 22:47:08,505 INFO L273 TraceCheckUtils]: 55: Hoare triple {4902#(<= main_~v~0 3)} assume true; {4902#(<= main_~v~0 3)} is VALID [2018-11-18 22:47:08,506 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 + 4 * ~v~0, 4); {4902#(<= main_~v~0 3)} is VALID [2018-11-18 22:47:08,506 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-18 22:47:08,506 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-18 22:47:08,507 INFO L273 TraceCheckUtils]: 59: Hoare triple {4897#true} assume true; {4897#true} is VALID [2018-11-18 22:47:08,507 INFO L273 TraceCheckUtils]: 60: Hoare triple {4897#true} assume !!(~i~0 < ~size);call #t~mem1 := read~int(~set.base, ~set.offset + 4 * ~i~0, 4); {4897#true} is VALID [2018-11-18 22:47:08,507 INFO L273 TraceCheckUtils]: 61: Hoare triple {4897#true} assume #t~mem1 == ~value;havoc #t~mem1;#res := 1; {4897#true} is VALID [2018-11-18 22:47:08,507 INFO L273 TraceCheckUtils]: 62: Hoare triple {4897#true} assume true; {4897#true} is VALID [2018-11-18 22:47:08,508 INFO L268 TraceCheckUtils]: 63: Hoare quadruple {4897#true} {4902#(<= main_~v~0 3)} #132#return; {4902#(<= main_~v~0 3)} is VALID [2018-11-18 22:47:08,509 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-18 22:47:08,509 INFO L273 TraceCheckUtils]: 65: Hoare triple {4902#(<= main_~v~0 3)} assume !(0 == #t~ret8);havoc #t~ret8;havoc #t~mem7; {4902#(<= main_~v~0 3)} is VALID [2018-11-18 22:47:08,509 INFO L273 TraceCheckUtils]: 66: Hoare triple {4902#(<= main_~v~0 3)} #t~post6 := ~v~0;~v~0 := 1 + #t~post6;havoc #t~post6; {4903#(<= main_~v~0 4)} is VALID [2018-11-18 22:47:08,510 INFO L273 TraceCheckUtils]: 67: Hoare triple {4903#(<= main_~v~0 4)} assume true; {4903#(<= main_~v~0 4)} is VALID [2018-11-18 22:47:08,510 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 + 4 * ~v~0, 4); {4903#(<= main_~v~0 4)} is VALID [2018-11-18 22:47:08,510 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-18 22:47:08,510 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-18 22:47:08,511 INFO L273 TraceCheckUtils]: 71: Hoare triple {4897#true} assume true; {4897#true} is VALID [2018-11-18 22:47:08,511 INFO L273 TraceCheckUtils]: 72: Hoare triple {4897#true} assume !!(~i~0 < ~size);call #t~mem1 := read~int(~set.base, ~set.offset + 4 * ~i~0, 4); {4897#true} is VALID [2018-11-18 22:47:08,511 INFO L273 TraceCheckUtils]: 73: Hoare triple {4897#true} assume #t~mem1 == ~value;havoc #t~mem1;#res := 1; {4897#true} is VALID [2018-11-18 22:47:08,511 INFO L273 TraceCheckUtils]: 74: Hoare triple {4897#true} assume true; {4897#true} is VALID [2018-11-18 22:47:08,512 INFO L268 TraceCheckUtils]: 75: Hoare quadruple {4897#true} {4903#(<= main_~v~0 4)} #132#return; {4903#(<= main_~v~0 4)} is VALID [2018-11-18 22:47:08,513 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-18 22:47:08,513 INFO L273 TraceCheckUtils]: 77: Hoare triple {4903#(<= main_~v~0 4)} assume !(0 == #t~ret8);havoc #t~ret8;havoc #t~mem7; {4903#(<= main_~v~0 4)} is VALID [2018-11-18 22:47:08,514 INFO L273 TraceCheckUtils]: 78: Hoare triple {4903#(<= main_~v~0 4)} #t~post6 := ~v~0;~v~0 := 1 + #t~post6;havoc #t~post6; {4904#(<= main_~v~0 5)} is VALID [2018-11-18 22:47:08,531 INFO L273 TraceCheckUtils]: 79: Hoare triple {4904#(<= main_~v~0 5)} assume true; {4904#(<= main_~v~0 5)} is VALID [2018-11-18 22:47:08,540 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 + 4 * ~v~0, 4); {4904#(<= main_~v~0 5)} is VALID [2018-11-18 22:47:08,540 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-18 22:47:08,540 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-18 22:47:08,540 INFO L273 TraceCheckUtils]: 83: Hoare triple {4897#true} assume true; {4897#true} is VALID [2018-11-18 22:47:08,541 INFO L273 TraceCheckUtils]: 84: Hoare triple {4897#true} assume !!(~i~0 < ~size);call #t~mem1 := read~int(~set.base, ~set.offset + 4 * ~i~0, 4); {4897#true} is VALID [2018-11-18 22:47:08,541 INFO L273 TraceCheckUtils]: 85: Hoare triple {4897#true} assume #t~mem1 == ~value;havoc #t~mem1;#res := 1; {4897#true} is VALID [2018-11-18 22:47:08,541 INFO L273 TraceCheckUtils]: 86: Hoare triple {4897#true} assume true; {4897#true} is VALID [2018-11-18 22:47:08,555 INFO L268 TraceCheckUtils]: 87: Hoare quadruple {4897#true} {4904#(<= main_~v~0 5)} #132#return; {4904#(<= main_~v~0 5)} is VALID [2018-11-18 22:47:08,564 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-18 22:47:08,577 INFO L273 TraceCheckUtils]: 89: Hoare triple {4904#(<= main_~v~0 5)} assume !(0 == #t~ret8);havoc #t~ret8;havoc #t~mem7; {4904#(<= main_~v~0 5)} is VALID [2018-11-18 22:47:08,586 INFO L273 TraceCheckUtils]: 90: Hoare triple {4904#(<= main_~v~0 5)} #t~post6 := ~v~0;~v~0 := 1 + #t~post6;havoc #t~post6; {4905#(<= main_~v~0 6)} is VALID [2018-11-18 22:47:08,599 INFO L273 TraceCheckUtils]: 91: Hoare triple {4905#(<= main_~v~0 6)} assume true; {4905#(<= main_~v~0 6)} is VALID [2018-11-18 22:47:08,608 INFO L273 TraceCheckUtils]: 92: Hoare triple {4905#(<= main_~v~0 6)} assume !(~v~0 < 100000); {4898#false} is VALID [2018-11-18 22:47:08,608 INFO L273 TraceCheckUtils]: 93: Hoare triple {4898#false} ~x~0 := 0; {4898#false} is VALID [2018-11-18 22:47:08,608 INFO L273 TraceCheckUtils]: 94: Hoare triple {4898#false} assume true; {4898#false} is VALID [2018-11-18 22:47:08,609 INFO L273 TraceCheckUtils]: 95: Hoare triple {4898#false} assume !!(~x~0 < ~n~0);~y~0 := 1 + ~x~0; {4898#false} is VALID [2018-11-18 22:47:08,609 INFO L273 TraceCheckUtils]: 96: Hoare triple {4898#false} assume true; {4898#false} is VALID [2018-11-18 22:47:08,609 INFO L273 TraceCheckUtils]: 97: Hoare triple {4898#false} assume !!(~y~0 < ~n~0);call #t~mem13 := read~int(~#set~0.base, ~#set~0.offset + 4 * ~x~0, 4);call #t~mem14 := read~int(~#set~0.base, ~#set~0.offset + 4 * ~y~0, 4); {4898#false} is VALID [2018-11-18 22:47:08,609 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-18 22:47:08,609 INFO L273 TraceCheckUtils]: 99: Hoare triple {4898#false} ~cond := #in~cond; {4898#false} is VALID [2018-11-18 22:47:08,610 INFO L273 TraceCheckUtils]: 100: Hoare triple {4898#false} assume 0 == ~cond; {4898#false} is VALID [2018-11-18 22:47:08,610 INFO L273 TraceCheckUtils]: 101: Hoare triple {4898#false} assume !false; {4898#false} is VALID [2018-11-18 22:47:08,617 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-18 22:47:08,617 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 22:47:08,617 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-18 22:47:08,635 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-11-18 22:47:08,697 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 7 check-sat command(s) [2018-11-18 22:47:08,697 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-18 22:47:08,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:47:08,722 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 22:47:08,921 INFO L256 TraceCheckUtils]: 0: Hoare triple {4897#true} call ULTIMATE.init(); {4897#true} is VALID [2018-11-18 22:47:08,921 INFO L273 TraceCheckUtils]: 1: Hoare triple {4897#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {4897#true} is VALID [2018-11-18 22:47:08,921 INFO L273 TraceCheckUtils]: 2: Hoare triple {4897#true} assume true; {4897#true} is VALID [2018-11-18 22:47:08,922 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {4897#true} {4897#true} #126#return; {4897#true} is VALID [2018-11-18 22:47:08,922 INFO L256 TraceCheckUtils]: 4: Hoare triple {4897#true} call #t~ret15 := main(); {4897#true} is VALID [2018-11-18 22:47:08,923 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-18 22:47:08,923 INFO L273 TraceCheckUtils]: 6: Hoare triple {4924#(<= 0 main_~n~0)} assume true; {4924#(<= 0 main_~n~0)} is VALID [2018-11-18 22:47:08,923 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-18 22:47:08,924 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-18 22:47:08,924 INFO L273 TraceCheckUtils]: 9: Hoare triple {4924#(<= 0 main_~n~0)} assume true; {4924#(<= 0 main_~n~0)} is VALID [2018-11-18 22:47:08,924 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 + 4 * ~v~0, 4); {4924#(<= 0 main_~n~0)} is VALID [2018-11-18 22:47:08,925 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-18 22:47:08,925 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-18 22:47:08,925 INFO L273 TraceCheckUtils]: 13: Hoare triple {4897#true} assume true; {4897#true} is VALID [2018-11-18 22:47:08,925 INFO L273 TraceCheckUtils]: 14: Hoare triple {4897#true} assume !(~i~0 < ~size); {4897#true} is VALID [2018-11-18 22:47:08,925 INFO L273 TraceCheckUtils]: 15: Hoare triple {4897#true} #res := 0; {4897#true} is VALID [2018-11-18 22:47:08,925 INFO L273 TraceCheckUtils]: 16: Hoare triple {4897#true} assume true; {4897#true} is VALID [2018-11-18 22:47:08,926 INFO L268 TraceCheckUtils]: 17: Hoare quadruple {4897#true} {4924#(<= 0 main_~n~0)} #132#return; {4924#(<= 0 main_~n~0)} is VALID [2018-11-18 22:47:08,926 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-18 22:47:08,927 INFO L273 TraceCheckUtils]: 19: Hoare triple {4924#(<= 0 main_~n~0)} assume 0 == #t~ret8;havoc #t~ret8;havoc #t~mem7;call #t~mem9 := read~int(~#values~0.base, ~#values~0.offset + 4 * ~v~0, 4); {4924#(<= 0 main_~n~0)} is VALID [2018-11-18 22:47:08,927 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-18 22:47:08,928 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 + 4 * ~size, 4);#res := 1 + ~size; {4973#(<= (+ |insert_#in~size| 1) |insert_#res|)} is VALID [2018-11-18 22:47:08,929 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-18 22:47:08,930 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-18 22:47:08,931 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-18 22:47:08,931 INFO L273 TraceCheckUtils]: 25: Hoare triple {4984#(<= 1 main_~n~0)} #t~post6 := ~v~0;~v~0 := 1 + #t~post6;havoc #t~post6; {4984#(<= 1 main_~n~0)} is VALID [2018-11-18 22:47:08,932 INFO L273 TraceCheckUtils]: 26: Hoare triple {4984#(<= 1 main_~n~0)} assume true; {4984#(<= 1 main_~n~0)} is VALID [2018-11-18 22:47:08,932 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 + 4 * ~v~0, 4); {4984#(<= 1 main_~n~0)} is VALID [2018-11-18 22:47:08,933 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-18 22:47:08,936 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-18 22:47:08,936 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-18 22:47:08,937 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-18 22:47:08,937 INFO L273 TraceCheckUtils]: 32: Hoare triple {5007#(<= |elem_exists_#in~size| 0)} #res := 0; {5007#(<= |elem_exists_#in~size| 0)} is VALID [2018-11-18 22:47:08,938 INFO L273 TraceCheckUtils]: 33: Hoare triple {5007#(<= |elem_exists_#in~size| 0)} assume true; {5007#(<= |elem_exists_#in~size| 0)} is VALID [2018-11-18 22:47:08,938 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-18 22:47:08,939 INFO L273 TraceCheckUtils]: 35: Hoare triple {4898#false} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647; {4898#false} is VALID [2018-11-18 22:47:08,939 INFO L273 TraceCheckUtils]: 36: Hoare triple {4898#false} assume 0 == #t~ret8;havoc #t~ret8;havoc #t~mem7;call #t~mem9 := read~int(~#values~0.base, ~#values~0.offset + 4 * ~v~0, 4); {4898#false} is VALID [2018-11-18 22:47:08,939 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-18 22:47:08,939 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 + 4 * ~size, 4);#res := 1 + ~size; {4898#false} is VALID [2018-11-18 22:47:08,939 INFO L273 TraceCheckUtils]: 39: Hoare triple {4898#false} assume true; {4898#false} is VALID [2018-11-18 22:47:08,939 INFO L268 TraceCheckUtils]: 40: Hoare quadruple {4898#false} {4898#false} #134#return; {4898#false} is VALID [2018-11-18 22:47:08,939 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-18 22:47:08,940 INFO L273 TraceCheckUtils]: 42: Hoare triple {4898#false} #t~post6 := ~v~0;~v~0 := 1 + #t~post6;havoc #t~post6; {4898#false} is VALID [2018-11-18 22:47:08,940 INFO L273 TraceCheckUtils]: 43: Hoare triple {4898#false} assume true; {4898#false} is VALID [2018-11-18 22:47:08,940 INFO L273 TraceCheckUtils]: 44: Hoare triple {4898#false} assume !!(~v~0 < 100000);call #t~mem7 := read~int(~#values~0.base, ~#values~0.offset + 4 * ~v~0, 4); {4898#false} is VALID [2018-11-18 22:47:08,940 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-18 22:47:08,941 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-18 22:47:08,941 INFO L273 TraceCheckUtils]: 47: Hoare triple {4898#false} assume true; {4898#false} is VALID [2018-11-18 22:47:08,941 INFO L273 TraceCheckUtils]: 48: Hoare triple {4898#false} assume !!(~i~0 < ~size);call #t~mem1 := read~int(~set.base, ~set.offset + 4 * ~i~0, 4); {4898#false} is VALID [2018-11-18 22:47:08,941 INFO L273 TraceCheckUtils]: 49: Hoare triple {4898#false} assume #t~mem1 == ~value;havoc #t~mem1;#res := 1; {4898#false} is VALID [2018-11-18 22:47:08,942 INFO L273 TraceCheckUtils]: 50: Hoare triple {4898#false} assume true; {4898#false} is VALID [2018-11-18 22:47:08,942 INFO L268 TraceCheckUtils]: 51: Hoare quadruple {4898#false} {4898#false} #132#return; {4898#false} is VALID [2018-11-18 22:47:08,942 INFO L273 TraceCheckUtils]: 52: Hoare triple {4898#false} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647; {4898#false} is VALID [2018-11-18 22:47:08,942 INFO L273 TraceCheckUtils]: 53: Hoare triple {4898#false} assume !(0 == #t~ret8);havoc #t~ret8;havoc #t~mem7; {4898#false} is VALID [2018-11-18 22:47:08,942 INFO L273 TraceCheckUtils]: 54: Hoare triple {4898#false} #t~post6 := ~v~0;~v~0 := 1 + #t~post6;havoc #t~post6; {4898#false} is VALID [2018-11-18 22:47:08,942 INFO L273 TraceCheckUtils]: 55: Hoare triple {4898#false} assume true; {4898#false} is VALID [2018-11-18 22:47:08,942 INFO L273 TraceCheckUtils]: 56: Hoare triple {4898#false} assume !!(~v~0 < 100000);call #t~mem7 := read~int(~#values~0.base, ~#values~0.offset + 4 * ~v~0, 4); {4898#false} is VALID [2018-11-18 22:47:08,943 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-18 22:47:08,943 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-18 22:47:08,943 INFO L273 TraceCheckUtils]: 59: Hoare triple {4898#false} assume true; {4898#false} is VALID [2018-11-18 22:47:08,943 INFO L273 TraceCheckUtils]: 60: Hoare triple {4898#false} assume !!(~i~0 < ~size);call #t~mem1 := read~int(~set.base, ~set.offset + 4 * ~i~0, 4); {4898#false} is VALID [2018-11-18 22:47:08,943 INFO L273 TraceCheckUtils]: 61: Hoare triple {4898#false} assume #t~mem1 == ~value;havoc #t~mem1;#res := 1; {4898#false} is VALID [2018-11-18 22:47:08,943 INFO L273 TraceCheckUtils]: 62: Hoare triple {4898#false} assume true; {4898#false} is VALID [2018-11-18 22:47:08,944 INFO L268 TraceCheckUtils]: 63: Hoare quadruple {4898#false} {4898#false} #132#return; {4898#false} is VALID [2018-11-18 22:47:08,944 INFO L273 TraceCheckUtils]: 64: Hoare triple {4898#false} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647; {4898#false} is VALID [2018-11-18 22:47:08,944 INFO L273 TraceCheckUtils]: 65: Hoare triple {4898#false} assume !(0 == #t~ret8);havoc #t~ret8;havoc #t~mem7; {4898#false} is VALID [2018-11-18 22:47:08,944 INFO L273 TraceCheckUtils]: 66: Hoare triple {4898#false} #t~post6 := ~v~0;~v~0 := 1 + #t~post6;havoc #t~post6; {4898#false} is VALID [2018-11-18 22:47:08,944 INFO L273 TraceCheckUtils]: 67: Hoare triple {4898#false} assume true; {4898#false} is VALID [2018-11-18 22:47:08,944 INFO L273 TraceCheckUtils]: 68: Hoare triple {4898#false} assume !!(~v~0 < 100000);call #t~mem7 := read~int(~#values~0.base, ~#values~0.offset + 4 * ~v~0, 4); {4898#false} is VALID [2018-11-18 22:47:08,945 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-18 22:47:08,945 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-18 22:47:08,945 INFO L273 TraceCheckUtils]: 71: Hoare triple {4898#false} assume true; {4898#false} is VALID [2018-11-18 22:47:08,945 INFO L273 TraceCheckUtils]: 72: Hoare triple {4898#false} assume !!(~i~0 < ~size);call #t~mem1 := read~int(~set.base, ~set.offset + 4 * ~i~0, 4); {4898#false} is VALID [2018-11-18 22:47:08,945 INFO L273 TraceCheckUtils]: 73: Hoare triple {4898#false} assume #t~mem1 == ~value;havoc #t~mem1;#res := 1; {4898#false} is VALID [2018-11-18 22:47:08,946 INFO L273 TraceCheckUtils]: 74: Hoare triple {4898#false} assume true; {4898#false} is VALID [2018-11-18 22:47:08,946 INFO L268 TraceCheckUtils]: 75: Hoare quadruple {4898#false} {4898#false} #132#return; {4898#false} is VALID [2018-11-18 22:47:08,946 INFO L273 TraceCheckUtils]: 76: Hoare triple {4898#false} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647; {4898#false} is VALID [2018-11-18 22:47:08,946 INFO L273 TraceCheckUtils]: 77: Hoare triple {4898#false} assume !(0 == #t~ret8);havoc #t~ret8;havoc #t~mem7; {4898#false} is VALID [2018-11-18 22:47:08,946 INFO L273 TraceCheckUtils]: 78: Hoare triple {4898#false} #t~post6 := ~v~0;~v~0 := 1 + #t~post6;havoc #t~post6; {4898#false} is VALID [2018-11-18 22:47:08,946 INFO L273 TraceCheckUtils]: 79: Hoare triple {4898#false} assume true; {4898#false} is VALID [2018-11-18 22:47:08,946 INFO L273 TraceCheckUtils]: 80: Hoare triple {4898#false} assume !!(~v~0 < 100000);call #t~mem7 := read~int(~#values~0.base, ~#values~0.offset + 4 * ~v~0, 4); {4898#false} is VALID [2018-11-18 22:47:08,947 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-18 22:47:08,947 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-18 22:47:08,947 INFO L273 TraceCheckUtils]: 83: Hoare triple {4898#false} assume true; {4898#false} is VALID [2018-11-18 22:47:08,947 INFO L273 TraceCheckUtils]: 84: Hoare triple {4898#false} assume !!(~i~0 < ~size);call #t~mem1 := read~int(~set.base, ~set.offset + 4 * ~i~0, 4); {4898#false} is VALID [2018-11-18 22:47:08,947 INFO L273 TraceCheckUtils]: 85: Hoare triple {4898#false} assume #t~mem1 == ~value;havoc #t~mem1;#res := 1; {4898#false} is VALID [2018-11-18 22:47:08,947 INFO L273 TraceCheckUtils]: 86: Hoare triple {4898#false} assume true; {4898#false} is VALID [2018-11-18 22:47:08,947 INFO L268 TraceCheckUtils]: 87: Hoare quadruple {4898#false} {4898#false} #132#return; {4898#false} is VALID [2018-11-18 22:47:08,947 INFO L273 TraceCheckUtils]: 88: Hoare triple {4898#false} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647; {4898#false} is VALID [2018-11-18 22:47:08,948 INFO L273 TraceCheckUtils]: 89: Hoare triple {4898#false} assume !(0 == #t~ret8);havoc #t~ret8;havoc #t~mem7; {4898#false} is VALID [2018-11-18 22:47:08,948 INFO L273 TraceCheckUtils]: 90: Hoare triple {4898#false} #t~post6 := ~v~0;~v~0 := 1 + #t~post6;havoc #t~post6; {4898#false} is VALID [2018-11-18 22:47:08,948 INFO L273 TraceCheckUtils]: 91: Hoare triple {4898#false} assume true; {4898#false} is VALID [2018-11-18 22:47:08,948 INFO L273 TraceCheckUtils]: 92: Hoare triple {4898#false} assume !(~v~0 < 100000); {4898#false} is VALID [2018-11-18 22:47:08,948 INFO L273 TraceCheckUtils]: 93: Hoare triple {4898#false} ~x~0 := 0; {4898#false} is VALID [2018-11-18 22:47:08,948 INFO L273 TraceCheckUtils]: 94: Hoare triple {4898#false} assume true; {4898#false} is VALID [2018-11-18 22:47:08,948 INFO L273 TraceCheckUtils]: 95: Hoare triple {4898#false} assume !!(~x~0 < ~n~0);~y~0 := 1 + ~x~0; {4898#false} is VALID [2018-11-18 22:47:08,948 INFO L273 TraceCheckUtils]: 96: Hoare triple {4898#false} assume true; {4898#false} is VALID [2018-11-18 22:47:08,948 INFO L273 TraceCheckUtils]: 97: Hoare triple {4898#false} assume !!(~y~0 < ~n~0);call #t~mem13 := read~int(~#set~0.base, ~#set~0.offset + 4 * ~x~0, 4);call #t~mem14 := read~int(~#set~0.base, ~#set~0.offset + 4 * ~y~0, 4); {4898#false} is VALID [2018-11-18 22:47:08,949 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-18 22:47:08,949 INFO L273 TraceCheckUtils]: 99: Hoare triple {4898#false} ~cond := #in~cond; {4898#false} is VALID [2018-11-18 22:47:08,949 INFO L273 TraceCheckUtils]: 100: Hoare triple {4898#false} assume 0 == ~cond; {4898#false} is VALID [2018-11-18 22:47:08,949 INFO L273 TraceCheckUtils]: 101: Hoare triple {4898#false} assume !false; {4898#false} is VALID [2018-11-18 22:47:08,955 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-18 22:47:08,976 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-18 22:47:08,976 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [9] total 15 [2018-11-18 22:47:08,977 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 102 [2018-11-18 22:47:08,979 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-18 22:47:08,979 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 15 states. [2018-11-18 22:47:09,099 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-18 22:47:09,100 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-11-18 22:47:09,100 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-11-18 22:47:09,100 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=161, Unknown=0, NotChecked=0, Total=210 [2018-11-18 22:47:09,101 INFO L87 Difference]: Start difference. First operand 163 states and 216 transitions. Second operand 15 states. [2018-11-18 22:47:12,575 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:47:12,575 INFO L93 Difference]: Finished difference Result 309 states and 449 transitions. [2018-11-18 22:47:12,576 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2018-11-18 22:47:12,576 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 102 [2018-11-18 22:47:12,576 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 22:47:12,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2018-11-18 22:47:12,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 282 transitions. [2018-11-18 22:47:12,584 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2018-11-18 22:47:12,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 282 transitions. [2018-11-18 22:47:12,592 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 36 states and 282 transitions. [2018-11-18 22:47:12,900 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-18 22:47:12,912 INFO L225 Difference]: With dead ends: 309 [2018-11-18 22:47:12,913 INFO L226 Difference]: Without dead ends: 234 [2018-11-18 22:47:12,915 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 140 GetRequests, 97 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 508 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=491, Invalid=1489, Unknown=0, NotChecked=0, Total=1980 [2018-11-18 22:47:12,915 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 234 states. [2018-11-18 22:47:13,182 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 234 to 194. [2018-11-18 22:47:13,182 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-18 22:47:13,182 INFO L82 GeneralOperation]: Start isEquivalent. First operand 234 states. Second operand 194 states. [2018-11-18 22:47:13,182 INFO L74 IsIncluded]: Start isIncluded. First operand 234 states. Second operand 194 states. [2018-11-18 22:47:13,182 INFO L87 Difference]: Start difference. First operand 234 states. Second operand 194 states. [2018-11-18 22:47:13,198 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:47:13,198 INFO L93 Difference]: Finished difference Result 234 states and 342 transitions. [2018-11-18 22:47:13,198 INFO L276 IsEmpty]: Start isEmpty. Operand 234 states and 342 transitions. [2018-11-18 22:47:13,200 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:47:13,200 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:47:13,201 INFO L74 IsIncluded]: Start isIncluded. First operand 194 states. Second operand 234 states. [2018-11-18 22:47:13,201 INFO L87 Difference]: Start difference. First operand 194 states. Second operand 234 states. [2018-11-18 22:47:13,215 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:47:13,216 INFO L93 Difference]: Finished difference Result 234 states and 342 transitions. [2018-11-18 22:47:13,216 INFO L276 IsEmpty]: Start isEmpty. Operand 234 states and 342 transitions. [2018-11-18 22:47:13,218 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:47:13,218 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:47:13,218 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-18 22:47:13,218 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-18 22:47:13,218 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 194 states. [2018-11-18 22:47:13,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194 states to 194 states and 264 transitions. [2018-11-18 22:47:13,226 INFO L78 Accepts]: Start accepts. Automaton has 194 states and 264 transitions. Word has length 102 [2018-11-18 22:47:13,226 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 22:47:13,226 INFO L480 AbstractCegarLoop]: Abstraction has 194 states and 264 transitions. [2018-11-18 22:47:13,226 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-11-18 22:47:13,226 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 264 transitions. [2018-11-18 22:47:13,228 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2018-11-18 22:47:13,229 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 22:47:13,229 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-18 22:47:13,229 INFO L423 AbstractCegarLoop]: === Iteration 9 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 22:47:13,229 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 22:47:13,229 INFO L82 PathProgramCache]: Analyzing trace with hash -1682517700, now seen corresponding path program 6 times [2018-11-18 22:47:13,230 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 22:47:13,230 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 22:47:13,230 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 22:47:13,231 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 22:47:13,231 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 22:47:13,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:47:13,569 INFO L256 TraceCheckUtils]: 0: Hoare triple {6399#true} call ULTIMATE.init(); {6399#true} is VALID [2018-11-18 22:47:13,569 INFO L273 TraceCheckUtils]: 1: Hoare triple {6399#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {6399#true} is VALID [2018-11-18 22:47:13,570 INFO L273 TraceCheckUtils]: 2: Hoare triple {6399#true} assume true; {6399#true} is VALID [2018-11-18 22:47:13,570 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {6399#true} {6399#true} #126#return; {6399#true} is VALID [2018-11-18 22:47:13,570 INFO L256 TraceCheckUtils]: 4: Hoare triple {6399#true} call #t~ret15 := main(); {6399#true} is VALID [2018-11-18 22:47:13,570 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-18 22:47:13,571 INFO L273 TraceCheckUtils]: 6: Hoare triple {6399#true} assume true; {6399#true} is VALID [2018-11-18 22:47:13,571 INFO L273 TraceCheckUtils]: 7: Hoare triple {6399#true} assume !(~x~0 < ~n~0); {6399#true} is VALID [2018-11-18 22:47:13,571 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-18 22:47:13,571 INFO L273 TraceCheckUtils]: 9: Hoare triple {6399#true} assume true; {6399#true} is VALID [2018-11-18 22:47:13,571 INFO L273 TraceCheckUtils]: 10: Hoare triple {6399#true} assume !!(~v~0 < 100000);call #t~mem7 := read~int(~#values~0.base, ~#values~0.offset + 4 * ~v~0, 4); {6399#true} is VALID [2018-11-18 22:47:13,571 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-18 22:47:13,571 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-18 22:47:13,572 INFO L273 TraceCheckUtils]: 13: Hoare triple {6399#true} assume true; {6399#true} is VALID [2018-11-18 22:47:13,572 INFO L273 TraceCheckUtils]: 14: Hoare triple {6399#true} assume !(~i~0 < ~size); {6399#true} is VALID [2018-11-18 22:47:13,572 INFO L273 TraceCheckUtils]: 15: Hoare triple {6399#true} #res := 0; {6399#true} is VALID [2018-11-18 22:47:13,572 INFO L273 TraceCheckUtils]: 16: Hoare triple {6399#true} assume true; {6399#true} is VALID [2018-11-18 22:47:13,572 INFO L268 TraceCheckUtils]: 17: Hoare quadruple {6399#true} {6399#true} #132#return; {6399#true} is VALID [2018-11-18 22:47:13,572 INFO L273 TraceCheckUtils]: 18: Hoare triple {6399#true} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647; {6399#true} is VALID [2018-11-18 22:47:13,572 INFO L273 TraceCheckUtils]: 19: Hoare triple {6399#true} assume 0 == #t~ret8;havoc #t~ret8;havoc #t~mem7;call #t~mem9 := read~int(~#values~0.base, ~#values~0.offset + 4 * ~v~0, 4); {6399#true} is VALID [2018-11-18 22:47:13,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-18 22:47:13,573 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 + 4 * ~size, 4);#res := 1 + ~size; {6399#true} is VALID [2018-11-18 22:47:13,573 INFO L273 TraceCheckUtils]: 22: Hoare triple {6399#true} assume true; {6399#true} is VALID [2018-11-18 22:47:13,573 INFO L268 TraceCheckUtils]: 23: Hoare quadruple {6399#true} {6399#true} #134#return; {6399#true} is VALID [2018-11-18 22:47:13,573 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-18 22:47:13,573 INFO L273 TraceCheckUtils]: 25: Hoare triple {6399#true} #t~post6 := ~v~0;~v~0 := 1 + #t~post6;havoc #t~post6; {6399#true} is VALID [2018-11-18 22:47:13,573 INFO L273 TraceCheckUtils]: 26: Hoare triple {6399#true} assume true; {6399#true} is VALID [2018-11-18 22:47:13,573 INFO L273 TraceCheckUtils]: 27: Hoare triple {6399#true} assume !!(~v~0 < 100000);call #t~mem7 := read~int(~#values~0.base, ~#values~0.offset + 4 * ~v~0, 4); {6399#true} is VALID [2018-11-18 22:47:13,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-18 22:47:13,574 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-18 22:47:13,574 INFO L273 TraceCheckUtils]: 30: Hoare triple {6399#true} assume true; {6399#true} is VALID [2018-11-18 22:47:13,574 INFO L273 TraceCheckUtils]: 31: Hoare triple {6399#true} assume !!(~i~0 < ~size);call #t~mem1 := read~int(~set.base, ~set.offset + 4 * ~i~0, 4); {6399#true} is VALID [2018-11-18 22:47:13,574 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-18 22:47:13,575 INFO L273 TraceCheckUtils]: 33: Hoare triple {6401#(= 1 |elem_exists_#res|)} assume true; {6401#(= 1 |elem_exists_#res|)} is VALID [2018-11-18 22:47:13,576 INFO L268 TraceCheckUtils]: 34: Hoare quadruple {6401#(= 1 |elem_exists_#res|)} {6399#true} #132#return; {6402#(= |main_#t~ret8| 1)} is VALID [2018-11-18 22:47:13,580 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-18 22:47:13,580 INFO L273 TraceCheckUtils]: 36: Hoare triple {6402#(= |main_#t~ret8| 1)} assume 0 == #t~ret8;havoc #t~ret8;havoc #t~mem7;call #t~mem9 := read~int(~#values~0.base, ~#values~0.offset + 4 * ~v~0, 4); {6400#false} is VALID [2018-11-18 22:47:13,581 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-18 22:47:13,581 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 + 4 * ~size, 4);#res := 1 + ~size; {6399#true} is VALID [2018-11-18 22:47:13,581 INFO L273 TraceCheckUtils]: 39: Hoare triple {6399#true} assume true; {6399#true} is VALID [2018-11-18 22:47:13,581 INFO L268 TraceCheckUtils]: 40: Hoare quadruple {6399#true} {6400#false} #134#return; {6400#false} is VALID [2018-11-18 22:47:13,581 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-18 22:47:13,581 INFO L273 TraceCheckUtils]: 42: Hoare triple {6400#false} #t~post6 := ~v~0;~v~0 := 1 + #t~post6;havoc #t~post6; {6400#false} is VALID [2018-11-18 22:47:13,582 INFO L273 TraceCheckUtils]: 43: Hoare triple {6400#false} assume true; {6400#false} is VALID [2018-11-18 22:47:13,582 INFO L273 TraceCheckUtils]: 44: Hoare triple {6400#false} assume !!(~v~0 < 100000);call #t~mem7 := read~int(~#values~0.base, ~#values~0.offset + 4 * ~v~0, 4); {6400#false} is VALID [2018-11-18 22:47:13,582 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-18 22:47:13,582 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-18 22:47:13,582 INFO L273 TraceCheckUtils]: 47: Hoare triple {6399#true} assume true; {6399#true} is VALID [2018-11-18 22:47:13,582 INFO L273 TraceCheckUtils]: 48: Hoare triple {6399#true} assume !!(~i~0 < ~size);call #t~mem1 := read~int(~set.base, ~set.offset + 4 * ~i~0, 4); {6399#true} is VALID [2018-11-18 22:47:13,582 INFO L273 TraceCheckUtils]: 49: Hoare triple {6399#true} assume #t~mem1 == ~value;havoc #t~mem1;#res := 1; {6399#true} is VALID [2018-11-18 22:47:13,582 INFO L273 TraceCheckUtils]: 50: Hoare triple {6399#true} assume true; {6399#true} is VALID [2018-11-18 22:47:13,583 INFO L268 TraceCheckUtils]: 51: Hoare quadruple {6399#true} {6400#false} #132#return; {6400#false} is VALID [2018-11-18 22:47:13,583 INFO L273 TraceCheckUtils]: 52: Hoare triple {6400#false} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647; {6400#false} is VALID [2018-11-18 22:47:13,583 INFO L273 TraceCheckUtils]: 53: Hoare triple {6400#false} assume !(0 == #t~ret8);havoc #t~ret8;havoc #t~mem7; {6400#false} is VALID [2018-11-18 22:47:13,583 INFO L273 TraceCheckUtils]: 54: Hoare triple {6400#false} #t~post6 := ~v~0;~v~0 := 1 + #t~post6;havoc #t~post6; {6400#false} is VALID [2018-11-18 22:47:13,583 INFO L273 TraceCheckUtils]: 55: Hoare triple {6400#false} assume true; {6400#false} is VALID [2018-11-18 22:47:13,583 INFO L273 TraceCheckUtils]: 56: Hoare triple {6400#false} assume !!(~v~0 < 100000);call #t~mem7 := read~int(~#values~0.base, ~#values~0.offset + 4 * ~v~0, 4); {6400#false} is VALID [2018-11-18 22:47:13,583 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-18 22:47:13,583 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-18 22:47:13,584 INFO L273 TraceCheckUtils]: 59: Hoare triple {6399#true} assume true; {6399#true} is VALID [2018-11-18 22:47:13,584 INFO L273 TraceCheckUtils]: 60: Hoare triple {6399#true} assume !!(~i~0 < ~size);call #t~mem1 := read~int(~set.base, ~set.offset + 4 * ~i~0, 4); {6399#true} is VALID [2018-11-18 22:47:13,584 INFO L273 TraceCheckUtils]: 61: Hoare triple {6399#true} assume #t~mem1 == ~value;havoc #t~mem1;#res := 1; {6399#true} is VALID [2018-11-18 22:47:13,584 INFO L273 TraceCheckUtils]: 62: Hoare triple {6399#true} assume true; {6399#true} is VALID [2018-11-18 22:47:13,584 INFO L268 TraceCheckUtils]: 63: Hoare quadruple {6399#true} {6400#false} #132#return; {6400#false} is VALID [2018-11-18 22:47:13,584 INFO L273 TraceCheckUtils]: 64: Hoare triple {6400#false} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647; {6400#false} is VALID [2018-11-18 22:47:13,584 INFO L273 TraceCheckUtils]: 65: Hoare triple {6400#false} assume !(0 == #t~ret8);havoc #t~ret8;havoc #t~mem7; {6400#false} is VALID [2018-11-18 22:47:13,584 INFO L273 TraceCheckUtils]: 66: Hoare triple {6400#false} #t~post6 := ~v~0;~v~0 := 1 + #t~post6;havoc #t~post6; {6400#false} is VALID [2018-11-18 22:47:13,584 INFO L273 TraceCheckUtils]: 67: Hoare triple {6400#false} assume true; {6400#false} is VALID [2018-11-18 22:47:13,585 INFO L273 TraceCheckUtils]: 68: Hoare triple {6400#false} assume !!(~v~0 < 100000);call #t~mem7 := read~int(~#values~0.base, ~#values~0.offset + 4 * ~v~0, 4); {6400#false} is VALID [2018-11-18 22:47:13,585 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-18 22:47:13,585 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-18 22:47:13,585 INFO L273 TraceCheckUtils]: 71: Hoare triple {6399#true} assume true; {6399#true} is VALID [2018-11-18 22:47:13,585 INFO L273 TraceCheckUtils]: 72: Hoare triple {6399#true} assume !!(~i~0 < ~size);call #t~mem1 := read~int(~set.base, ~set.offset + 4 * ~i~0, 4); {6399#true} is VALID [2018-11-18 22:47:13,585 INFO L273 TraceCheckUtils]: 73: Hoare triple {6399#true} assume #t~mem1 == ~value;havoc #t~mem1;#res := 1; {6399#true} is VALID [2018-11-18 22:47:13,586 INFO L273 TraceCheckUtils]: 74: Hoare triple {6399#true} assume true; {6399#true} is VALID [2018-11-18 22:47:13,586 INFO L268 TraceCheckUtils]: 75: Hoare quadruple {6399#true} {6400#false} #132#return; {6400#false} is VALID [2018-11-18 22:47:13,586 INFO L273 TraceCheckUtils]: 76: Hoare triple {6400#false} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647; {6400#false} is VALID [2018-11-18 22:47:13,586 INFO L273 TraceCheckUtils]: 77: Hoare triple {6400#false} assume !(0 == #t~ret8);havoc #t~ret8;havoc #t~mem7; {6400#false} is VALID [2018-11-18 22:47:13,586 INFO L273 TraceCheckUtils]: 78: Hoare triple {6400#false} #t~post6 := ~v~0;~v~0 := 1 + #t~post6;havoc #t~post6; {6400#false} is VALID [2018-11-18 22:47:13,586 INFO L273 TraceCheckUtils]: 79: Hoare triple {6400#false} assume true; {6400#false} is VALID [2018-11-18 22:47:13,587 INFO L273 TraceCheckUtils]: 80: Hoare triple {6400#false} assume !!(~v~0 < 100000);call #t~mem7 := read~int(~#values~0.base, ~#values~0.offset + 4 * ~v~0, 4); {6400#false} is VALID [2018-11-18 22:47:13,587 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-18 22:47:13,587 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-18 22:47:13,587 INFO L273 TraceCheckUtils]: 83: Hoare triple {6399#true} assume true; {6399#true} is VALID [2018-11-18 22:47:13,587 INFO L273 TraceCheckUtils]: 84: Hoare triple {6399#true} assume !!(~i~0 < ~size);call #t~mem1 := read~int(~set.base, ~set.offset + 4 * ~i~0, 4); {6399#true} is VALID [2018-11-18 22:47:13,588 INFO L273 TraceCheckUtils]: 85: Hoare triple {6399#true} assume #t~mem1 == ~value;havoc #t~mem1;#res := 1; {6399#true} is VALID [2018-11-18 22:47:13,588 INFO L273 TraceCheckUtils]: 86: Hoare triple {6399#true} assume true; {6399#true} is VALID [2018-11-18 22:47:13,588 INFO L268 TraceCheckUtils]: 87: Hoare quadruple {6399#true} {6400#false} #132#return; {6400#false} is VALID [2018-11-18 22:47:13,588 INFO L273 TraceCheckUtils]: 88: Hoare triple {6400#false} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647; {6400#false} is VALID [2018-11-18 22:47:13,588 INFO L273 TraceCheckUtils]: 89: Hoare triple {6400#false} assume !(0 == #t~ret8);havoc #t~ret8;havoc #t~mem7; {6400#false} is VALID [2018-11-18 22:47:13,588 INFO L273 TraceCheckUtils]: 90: Hoare triple {6400#false} #t~post6 := ~v~0;~v~0 := 1 + #t~post6;havoc #t~post6; {6400#false} is VALID [2018-11-18 22:47:13,589 INFO L273 TraceCheckUtils]: 91: Hoare triple {6400#false} assume true; {6400#false} is VALID [2018-11-18 22:47:13,589 INFO L273 TraceCheckUtils]: 92: Hoare triple {6400#false} assume !!(~v~0 < 100000);call #t~mem7 := read~int(~#values~0.base, ~#values~0.offset + 4 * ~v~0, 4); {6400#false} is VALID [2018-11-18 22:47:13,589 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-18 22:47:13,589 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-18 22:47:13,589 INFO L273 TraceCheckUtils]: 95: Hoare triple {6399#true} assume true; {6399#true} is VALID [2018-11-18 22:47:13,589 INFO L273 TraceCheckUtils]: 96: Hoare triple {6399#true} assume !!(~i~0 < ~size);call #t~mem1 := read~int(~set.base, ~set.offset + 4 * ~i~0, 4); {6399#true} is VALID [2018-11-18 22:47:13,590 INFO L273 TraceCheckUtils]: 97: Hoare triple {6399#true} assume #t~mem1 == ~value;havoc #t~mem1;#res := 1; {6399#true} is VALID [2018-11-18 22:47:13,590 INFO L273 TraceCheckUtils]: 98: Hoare triple {6399#true} assume true; {6399#true} is VALID [2018-11-18 22:47:13,590 INFO L268 TraceCheckUtils]: 99: Hoare quadruple {6399#true} {6400#false} #132#return; {6400#false} is VALID [2018-11-18 22:47:13,590 INFO L273 TraceCheckUtils]: 100: Hoare triple {6400#false} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647; {6400#false} is VALID [2018-11-18 22:47:13,590 INFO L273 TraceCheckUtils]: 101: Hoare triple {6400#false} assume !(0 == #t~ret8);havoc #t~ret8;havoc #t~mem7; {6400#false} is VALID [2018-11-18 22:47:13,590 INFO L273 TraceCheckUtils]: 102: Hoare triple {6400#false} #t~post6 := ~v~0;~v~0 := 1 + #t~post6;havoc #t~post6; {6400#false} is VALID [2018-11-18 22:47:13,591 INFO L273 TraceCheckUtils]: 103: Hoare triple {6400#false} assume true; {6400#false} is VALID [2018-11-18 22:47:13,591 INFO L273 TraceCheckUtils]: 104: Hoare triple {6400#false} assume !(~v~0 < 100000); {6400#false} is VALID [2018-11-18 22:47:13,591 INFO L273 TraceCheckUtils]: 105: Hoare triple {6400#false} ~x~0 := 0; {6400#false} is VALID [2018-11-18 22:47:13,591 INFO L273 TraceCheckUtils]: 106: Hoare triple {6400#false} assume true; {6400#false} is VALID [2018-11-18 22:47:13,591 INFO L273 TraceCheckUtils]: 107: Hoare triple {6400#false} assume !!(~x~0 < ~n~0);~y~0 := 1 + ~x~0; {6400#false} is VALID [2018-11-18 22:47:13,591 INFO L273 TraceCheckUtils]: 108: Hoare triple {6400#false} assume true; {6400#false} is VALID [2018-11-18 22:47:13,592 INFO L273 TraceCheckUtils]: 109: Hoare triple {6400#false} assume !!(~y~0 < ~n~0);call #t~mem13 := read~int(~#set~0.base, ~#set~0.offset + 4 * ~x~0, 4);call #t~mem14 := read~int(~#set~0.base, ~#set~0.offset + 4 * ~y~0, 4); {6400#false} is VALID [2018-11-18 22:47:13,592 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-18 22:47:13,592 INFO L273 TraceCheckUtils]: 111: Hoare triple {6400#false} ~cond := #in~cond; {6400#false} is VALID [2018-11-18 22:47:13,592 INFO L273 TraceCheckUtils]: 112: Hoare triple {6400#false} assume 0 == ~cond; {6400#false} is VALID [2018-11-18 22:47:13,592 INFO L273 TraceCheckUtils]: 113: Hoare triple {6400#false} assume !false; {6400#false} is VALID [2018-11-18 22:47:13,599 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-18 22:47:13,599 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 22:47:13,599 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-18 22:47:13,613 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-11-18 22:47:13,660 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2018-11-18 22:47:13,660 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-18 22:47:13,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:47:13,696 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 22:47:13,815 INFO L256 TraceCheckUtils]: 0: Hoare triple {6399#true} call ULTIMATE.init(); {6399#true} is VALID [2018-11-18 22:47:13,816 INFO L273 TraceCheckUtils]: 1: Hoare triple {6399#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {6399#true} is VALID [2018-11-18 22:47:13,816 INFO L273 TraceCheckUtils]: 2: Hoare triple {6399#true} assume true; {6399#true} is VALID [2018-11-18 22:47:13,816 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {6399#true} {6399#true} #126#return; {6399#true} is VALID [2018-11-18 22:47:13,817 INFO L256 TraceCheckUtils]: 4: Hoare triple {6399#true} call #t~ret15 := main(); {6399#true} is VALID [2018-11-18 22:47:13,817 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-18 22:47:13,817 INFO L273 TraceCheckUtils]: 6: Hoare triple {6399#true} assume true; {6399#true} is VALID [2018-11-18 22:47:13,817 INFO L273 TraceCheckUtils]: 7: Hoare triple {6399#true} assume !(~x~0 < ~n~0); {6399#true} is VALID [2018-11-18 22:47:13,818 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-18 22:47:13,818 INFO L273 TraceCheckUtils]: 9: Hoare triple {6399#true} assume true; {6399#true} is VALID [2018-11-18 22:47:13,818 INFO L273 TraceCheckUtils]: 10: Hoare triple {6399#true} assume !!(~v~0 < 100000);call #t~mem7 := read~int(~#values~0.base, ~#values~0.offset + 4 * ~v~0, 4); {6399#true} is VALID [2018-11-18 22:47:13,818 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-18 22:47:13,818 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-18 22:47:13,818 INFO L273 TraceCheckUtils]: 13: Hoare triple {6399#true} assume true; {6399#true} is VALID [2018-11-18 22:47:13,819 INFO L273 TraceCheckUtils]: 14: Hoare triple {6399#true} assume !(~i~0 < ~size); {6399#true} is VALID [2018-11-18 22:47:13,819 INFO L273 TraceCheckUtils]: 15: Hoare triple {6399#true} #res := 0; {6399#true} is VALID [2018-11-18 22:47:13,819 INFO L273 TraceCheckUtils]: 16: Hoare triple {6399#true} assume true; {6399#true} is VALID [2018-11-18 22:47:13,819 INFO L268 TraceCheckUtils]: 17: Hoare quadruple {6399#true} {6399#true} #132#return; {6399#true} is VALID [2018-11-18 22:47:13,819 INFO L273 TraceCheckUtils]: 18: Hoare triple {6399#true} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647; {6399#true} is VALID [2018-11-18 22:47:13,819 INFO L273 TraceCheckUtils]: 19: Hoare triple {6399#true} assume 0 == #t~ret8;havoc #t~ret8;havoc #t~mem7;call #t~mem9 := read~int(~#values~0.base, ~#values~0.offset + 4 * ~v~0, 4); {6399#true} is VALID [2018-11-18 22:47:13,819 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-18 22:47:13,820 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 + 4 * ~size, 4);#res := 1 + ~size; {6399#true} is VALID [2018-11-18 22:47:13,820 INFO L273 TraceCheckUtils]: 22: Hoare triple {6399#true} assume true; {6399#true} is VALID [2018-11-18 22:47:13,820 INFO L268 TraceCheckUtils]: 23: Hoare quadruple {6399#true} {6399#true} #134#return; {6399#true} is VALID [2018-11-18 22:47:13,820 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-18 22:47:13,820 INFO L273 TraceCheckUtils]: 25: Hoare triple {6399#true} #t~post6 := ~v~0;~v~0 := 1 + #t~post6;havoc #t~post6; {6399#true} is VALID [2018-11-18 22:47:13,820 INFO L273 TraceCheckUtils]: 26: Hoare triple {6399#true} assume true; {6399#true} is VALID [2018-11-18 22:47:13,821 INFO L273 TraceCheckUtils]: 27: Hoare triple {6399#true} assume !!(~v~0 < 100000);call #t~mem7 := read~int(~#values~0.base, ~#values~0.offset + 4 * ~v~0, 4); {6399#true} is VALID [2018-11-18 22:47:13,821 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-18 22:47:13,821 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-18 22:47:13,821 INFO L273 TraceCheckUtils]: 30: Hoare triple {6399#true} assume true; {6399#true} is VALID [2018-11-18 22:47:13,821 INFO L273 TraceCheckUtils]: 31: Hoare triple {6399#true} assume !!(~i~0 < ~size);call #t~mem1 := read~int(~set.base, ~set.offset + 4 * ~i~0, 4); {6399#true} is VALID [2018-11-18 22:47:13,822 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-18 22:47:13,822 INFO L273 TraceCheckUtils]: 33: Hoare triple {6502#(<= 1 |elem_exists_#res|)} assume true; {6502#(<= 1 |elem_exists_#res|)} is VALID [2018-11-18 22:47:13,824 INFO L268 TraceCheckUtils]: 34: Hoare quadruple {6502#(<= 1 |elem_exists_#res|)} {6399#true} #132#return; {6509#(<= 1 |main_#t~ret8|)} is VALID [2018-11-18 22:47:13,825 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-18 22:47:13,825 INFO L273 TraceCheckUtils]: 36: Hoare triple {6509#(<= 1 |main_#t~ret8|)} assume 0 == #t~ret8;havoc #t~ret8;havoc #t~mem7;call #t~mem9 := read~int(~#values~0.base, ~#values~0.offset + 4 * ~v~0, 4); {6400#false} is VALID [2018-11-18 22:47:13,826 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-18 22:47:13,826 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 + 4 * ~size, 4);#res := 1 + ~size; {6400#false} is VALID [2018-11-18 22:47:13,826 INFO L273 TraceCheckUtils]: 39: Hoare triple {6400#false} assume true; {6400#false} is VALID [2018-11-18 22:47:13,826 INFO L268 TraceCheckUtils]: 40: Hoare quadruple {6400#false} {6400#false} #134#return; {6400#false} is VALID [2018-11-18 22:47:13,827 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-18 22:47:13,827 INFO L273 TraceCheckUtils]: 42: Hoare triple {6400#false} #t~post6 := ~v~0;~v~0 := 1 + #t~post6;havoc #t~post6; {6400#false} is VALID [2018-11-18 22:47:13,827 INFO L273 TraceCheckUtils]: 43: Hoare triple {6400#false} assume true; {6400#false} is VALID [2018-11-18 22:47:13,828 INFO L273 TraceCheckUtils]: 44: Hoare triple {6400#false} assume !!(~v~0 < 100000);call #t~mem7 := read~int(~#values~0.base, ~#values~0.offset + 4 * ~v~0, 4); {6400#false} is VALID [2018-11-18 22:47:13,828 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-18 22:47:13,828 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-18 22:47:13,828 INFO L273 TraceCheckUtils]: 47: Hoare triple {6400#false} assume true; {6400#false} is VALID [2018-11-18 22:47:13,829 INFO L273 TraceCheckUtils]: 48: Hoare triple {6400#false} assume !!(~i~0 < ~size);call #t~mem1 := read~int(~set.base, ~set.offset + 4 * ~i~0, 4); {6400#false} is VALID [2018-11-18 22:47:13,829 INFO L273 TraceCheckUtils]: 49: Hoare triple {6400#false} assume #t~mem1 == ~value;havoc #t~mem1;#res := 1; {6400#false} is VALID [2018-11-18 22:47:13,829 INFO L273 TraceCheckUtils]: 50: Hoare triple {6400#false} assume true; {6400#false} is VALID [2018-11-18 22:47:13,829 INFO L268 TraceCheckUtils]: 51: Hoare quadruple {6400#false} {6400#false} #132#return; {6400#false} is VALID [2018-11-18 22:47:13,830 INFO L273 TraceCheckUtils]: 52: Hoare triple {6400#false} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647; {6400#false} is VALID [2018-11-18 22:47:13,830 INFO L273 TraceCheckUtils]: 53: Hoare triple {6400#false} assume !(0 == #t~ret8);havoc #t~ret8;havoc #t~mem7; {6400#false} is VALID [2018-11-18 22:47:13,830 INFO L273 TraceCheckUtils]: 54: Hoare triple {6400#false} #t~post6 := ~v~0;~v~0 := 1 + #t~post6;havoc #t~post6; {6400#false} is VALID [2018-11-18 22:47:13,830 INFO L273 TraceCheckUtils]: 55: Hoare triple {6400#false} assume true; {6400#false} is VALID [2018-11-18 22:47:13,830 INFO L273 TraceCheckUtils]: 56: Hoare triple {6400#false} assume !!(~v~0 < 100000);call #t~mem7 := read~int(~#values~0.base, ~#values~0.offset + 4 * ~v~0, 4); {6400#false} is VALID [2018-11-18 22:47:13,830 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-18 22:47:13,830 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-18 22:47:13,831 INFO L273 TraceCheckUtils]: 59: Hoare triple {6400#false} assume true; {6400#false} is VALID [2018-11-18 22:47:13,831 INFO L273 TraceCheckUtils]: 60: Hoare triple {6400#false} assume !!(~i~0 < ~size);call #t~mem1 := read~int(~set.base, ~set.offset + 4 * ~i~0, 4); {6400#false} is VALID [2018-11-18 22:47:13,831 INFO L273 TraceCheckUtils]: 61: Hoare triple {6400#false} assume #t~mem1 == ~value;havoc #t~mem1;#res := 1; {6400#false} is VALID [2018-11-18 22:47:13,831 INFO L273 TraceCheckUtils]: 62: Hoare triple {6400#false} assume true; {6400#false} is VALID [2018-11-18 22:47:13,831 INFO L268 TraceCheckUtils]: 63: Hoare quadruple {6400#false} {6400#false} #132#return; {6400#false} is VALID [2018-11-18 22:47:13,831 INFO L273 TraceCheckUtils]: 64: Hoare triple {6400#false} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647; {6400#false} is VALID [2018-11-18 22:47:13,832 INFO L273 TraceCheckUtils]: 65: Hoare triple {6400#false} assume !(0 == #t~ret8);havoc #t~ret8;havoc #t~mem7; {6400#false} is VALID [2018-11-18 22:47:13,832 INFO L273 TraceCheckUtils]: 66: Hoare triple {6400#false} #t~post6 := ~v~0;~v~0 := 1 + #t~post6;havoc #t~post6; {6400#false} is VALID [2018-11-18 22:47:13,832 INFO L273 TraceCheckUtils]: 67: Hoare triple {6400#false} assume true; {6400#false} is VALID [2018-11-18 22:47:13,832 INFO L273 TraceCheckUtils]: 68: Hoare triple {6400#false} assume !!(~v~0 < 100000);call #t~mem7 := read~int(~#values~0.base, ~#values~0.offset + 4 * ~v~0, 4); {6400#false} is VALID [2018-11-18 22:47:13,832 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-18 22:47:13,832 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-18 22:47:13,832 INFO L273 TraceCheckUtils]: 71: Hoare triple {6400#false} assume true; {6400#false} is VALID [2018-11-18 22:47:13,833 INFO L273 TraceCheckUtils]: 72: Hoare triple {6400#false} assume !!(~i~0 < ~size);call #t~mem1 := read~int(~set.base, ~set.offset + 4 * ~i~0, 4); {6400#false} is VALID [2018-11-18 22:47:13,833 INFO L273 TraceCheckUtils]: 73: Hoare triple {6400#false} assume #t~mem1 == ~value;havoc #t~mem1;#res := 1; {6400#false} is VALID [2018-11-18 22:47:13,833 INFO L273 TraceCheckUtils]: 74: Hoare triple {6400#false} assume true; {6400#false} is VALID [2018-11-18 22:47:13,833 INFO L268 TraceCheckUtils]: 75: Hoare quadruple {6400#false} {6400#false} #132#return; {6400#false} is VALID [2018-11-18 22:47:13,833 INFO L273 TraceCheckUtils]: 76: Hoare triple {6400#false} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647; {6400#false} is VALID [2018-11-18 22:47:13,833 INFO L273 TraceCheckUtils]: 77: Hoare triple {6400#false} assume !(0 == #t~ret8);havoc #t~ret8;havoc #t~mem7; {6400#false} is VALID [2018-11-18 22:47:13,834 INFO L273 TraceCheckUtils]: 78: Hoare triple {6400#false} #t~post6 := ~v~0;~v~0 := 1 + #t~post6;havoc #t~post6; {6400#false} is VALID [2018-11-18 22:47:13,834 INFO L273 TraceCheckUtils]: 79: Hoare triple {6400#false} assume true; {6400#false} is VALID [2018-11-18 22:47:13,834 INFO L273 TraceCheckUtils]: 80: Hoare triple {6400#false} assume !!(~v~0 < 100000);call #t~mem7 := read~int(~#values~0.base, ~#values~0.offset + 4 * ~v~0, 4); {6400#false} is VALID [2018-11-18 22:47:13,834 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-18 22:47:13,834 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-18 22:47:13,834 INFO L273 TraceCheckUtils]: 83: Hoare triple {6400#false} assume true; {6400#false} is VALID [2018-11-18 22:47:13,834 INFO L273 TraceCheckUtils]: 84: Hoare triple {6400#false} assume !!(~i~0 < ~size);call #t~mem1 := read~int(~set.base, ~set.offset + 4 * ~i~0, 4); {6400#false} is VALID [2018-11-18 22:47:13,835 INFO L273 TraceCheckUtils]: 85: Hoare triple {6400#false} assume #t~mem1 == ~value;havoc #t~mem1;#res := 1; {6400#false} is VALID [2018-11-18 22:47:13,835 INFO L273 TraceCheckUtils]: 86: Hoare triple {6400#false} assume true; {6400#false} is VALID [2018-11-18 22:47:13,835 INFO L268 TraceCheckUtils]: 87: Hoare quadruple {6400#false} {6400#false} #132#return; {6400#false} is VALID [2018-11-18 22:47:13,835 INFO L273 TraceCheckUtils]: 88: Hoare triple {6400#false} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647; {6400#false} is VALID [2018-11-18 22:47:13,835 INFO L273 TraceCheckUtils]: 89: Hoare triple {6400#false} assume !(0 == #t~ret8);havoc #t~ret8;havoc #t~mem7; {6400#false} is VALID [2018-11-18 22:47:13,835 INFO L273 TraceCheckUtils]: 90: Hoare triple {6400#false} #t~post6 := ~v~0;~v~0 := 1 + #t~post6;havoc #t~post6; {6400#false} is VALID [2018-11-18 22:47:13,835 INFO L273 TraceCheckUtils]: 91: Hoare triple {6400#false} assume true; {6400#false} is VALID [2018-11-18 22:47:13,836 INFO L273 TraceCheckUtils]: 92: Hoare triple {6400#false} assume !!(~v~0 < 100000);call #t~mem7 := read~int(~#values~0.base, ~#values~0.offset + 4 * ~v~0, 4); {6400#false} is VALID [2018-11-18 22:47:13,836 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-18 22:47:13,836 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-18 22:47:13,836 INFO L273 TraceCheckUtils]: 95: Hoare triple {6400#false} assume true; {6400#false} is VALID [2018-11-18 22:47:13,836 INFO L273 TraceCheckUtils]: 96: Hoare triple {6400#false} assume !!(~i~0 < ~size);call #t~mem1 := read~int(~set.base, ~set.offset + 4 * ~i~0, 4); {6400#false} is VALID [2018-11-18 22:47:13,836 INFO L273 TraceCheckUtils]: 97: Hoare triple {6400#false} assume #t~mem1 == ~value;havoc #t~mem1;#res := 1; {6400#false} is VALID [2018-11-18 22:47:13,837 INFO L273 TraceCheckUtils]: 98: Hoare triple {6400#false} assume true; {6400#false} is VALID [2018-11-18 22:47:13,837 INFO L268 TraceCheckUtils]: 99: Hoare quadruple {6400#false} {6400#false} #132#return; {6400#false} is VALID [2018-11-18 22:47:13,837 INFO L273 TraceCheckUtils]: 100: Hoare triple {6400#false} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647; {6400#false} is VALID [2018-11-18 22:47:13,837 INFO L273 TraceCheckUtils]: 101: Hoare triple {6400#false} assume !(0 == #t~ret8);havoc #t~ret8;havoc #t~mem7; {6400#false} is VALID [2018-11-18 22:47:13,837 INFO L273 TraceCheckUtils]: 102: Hoare triple {6400#false} #t~post6 := ~v~0;~v~0 := 1 + #t~post6;havoc #t~post6; {6400#false} is VALID [2018-11-18 22:47:13,837 INFO L273 TraceCheckUtils]: 103: Hoare triple {6400#false} assume true; {6400#false} is VALID [2018-11-18 22:47:13,837 INFO L273 TraceCheckUtils]: 104: Hoare triple {6400#false} assume !(~v~0 < 100000); {6400#false} is VALID [2018-11-18 22:47:13,838 INFO L273 TraceCheckUtils]: 105: Hoare triple {6400#false} ~x~0 := 0; {6400#false} is VALID [2018-11-18 22:47:13,838 INFO L273 TraceCheckUtils]: 106: Hoare triple {6400#false} assume true; {6400#false} is VALID [2018-11-18 22:47:13,838 INFO L273 TraceCheckUtils]: 107: Hoare triple {6400#false} assume !!(~x~0 < ~n~0);~y~0 := 1 + ~x~0; {6400#false} is VALID [2018-11-18 22:47:13,838 INFO L273 TraceCheckUtils]: 108: Hoare triple {6400#false} assume true; {6400#false} is VALID [2018-11-18 22:47:13,838 INFO L273 TraceCheckUtils]: 109: Hoare triple {6400#false} assume !!(~y~0 < ~n~0);call #t~mem13 := read~int(~#set~0.base, ~#set~0.offset + 4 * ~x~0, 4);call #t~mem14 := read~int(~#set~0.base, ~#set~0.offset + 4 * ~y~0, 4); {6400#false} is VALID [2018-11-18 22:47:13,838 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-18 22:47:13,839 INFO L273 TraceCheckUtils]: 111: Hoare triple {6400#false} ~cond := #in~cond; {6400#false} is VALID [2018-11-18 22:47:13,839 INFO L273 TraceCheckUtils]: 112: Hoare triple {6400#false} assume 0 == ~cond; {6400#false} is VALID [2018-11-18 22:47:13,839 INFO L273 TraceCheckUtils]: 113: Hoare triple {6400#false} assume !false; {6400#false} is VALID [2018-11-18 22:47:13,850 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-18 22:47:13,869 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-18 22:47:13,869 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 6 [2018-11-18 22:47:13,870 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 114 [2018-11-18 22:47:13,882 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-18 22:47:13,882 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2018-11-18 22:47:13,973 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-18 22:47:13,973 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-18 22:47:13,974 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-18 22:47:13,974 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-11-18 22:47:13,974 INFO L87 Difference]: Start difference. First operand 194 states and 264 transitions. Second operand 6 states. [2018-11-18 22:47:14,653 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:47:14,653 INFO L93 Difference]: Finished difference Result 332 states and 448 transitions. [2018-11-18 22:47:14,653 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-18 22:47:14,654 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 114 [2018-11-18 22:47:14,654 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 22:47:14,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-18 22:47:14,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 91 transitions. [2018-11-18 22:47:14,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-18 22:47:14,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 91 transitions. [2018-11-18 22:47:14,657 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 91 transitions. [2018-11-18 22:47:14,899 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-18 22:47:14,905 INFO L225 Difference]: With dead ends: 332 [2018-11-18 22:47:14,905 INFO L226 Difference]: Without dead ends: 194 [2018-11-18 22:47:14,910 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 113 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-11-18 22:47:14,911 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 194 states. [2018-11-18 22:47:15,203 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 194 to 190. [2018-11-18 22:47:15,204 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-18 22:47:15,204 INFO L82 GeneralOperation]: Start isEquivalent. First operand 194 states. Second operand 190 states. [2018-11-18 22:47:15,204 INFO L74 IsIncluded]: Start isIncluded. First operand 194 states. Second operand 190 states. [2018-11-18 22:47:15,204 INFO L87 Difference]: Start difference. First operand 194 states. Second operand 190 states. [2018-11-18 22:47:15,213 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:47:15,213 INFO L93 Difference]: Finished difference Result 194 states and 247 transitions. [2018-11-18 22:47:15,213 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 247 transitions. [2018-11-18 22:47:15,214 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:47:15,214 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:47:15,215 INFO L74 IsIncluded]: Start isIncluded. First operand 190 states. Second operand 194 states. [2018-11-18 22:47:15,215 INFO L87 Difference]: Start difference. First operand 190 states. Second operand 194 states. [2018-11-18 22:47:15,222 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:47:15,222 INFO L93 Difference]: Finished difference Result 194 states and 247 transitions. [2018-11-18 22:47:15,222 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 247 transitions. [2018-11-18 22:47:15,224 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:47:15,224 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:47:15,224 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-18 22:47:15,224 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-18 22:47:15,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 190 states. [2018-11-18 22:47:15,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 190 states to 190 states and 243 transitions. [2018-11-18 22:47:15,231 INFO L78 Accepts]: Start accepts. Automaton has 190 states and 243 transitions. Word has length 114 [2018-11-18 22:47:15,231 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 22:47:15,231 INFO L480 AbstractCegarLoop]: Abstraction has 190 states and 243 transitions. [2018-11-18 22:47:15,232 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-18 22:47:15,232 INFO L276 IsEmpty]: Start isEmpty. Operand 190 states and 243 transitions. [2018-11-18 22:47:15,234 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2018-11-18 22:47:15,234 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 22:47:15,234 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-18 22:47:15,234 INFO L423 AbstractCegarLoop]: === Iteration 10 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 22:47:15,235 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 22:47:15,235 INFO L82 PathProgramCache]: Analyzing trace with hash -811874770, now seen corresponding path program 1 times [2018-11-18 22:47:15,235 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 22:47:15,235 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 22:47:15,236 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 22:47:15,236 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 22:47:15,236 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 22:47:15,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:47:15,728 INFO L256 TraceCheckUtils]: 0: Hoare triple {7819#true} call ULTIMATE.init(); {7819#true} is VALID [2018-11-18 22:47:15,728 INFO L273 TraceCheckUtils]: 1: Hoare triple {7819#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {7819#true} is VALID [2018-11-18 22:47:15,728 INFO L273 TraceCheckUtils]: 2: Hoare triple {7819#true} assume true; {7819#true} is VALID [2018-11-18 22:47:15,729 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {7819#true} {7819#true} #126#return; {7819#true} is VALID [2018-11-18 22:47:15,729 INFO L256 TraceCheckUtils]: 4: Hoare triple {7819#true} call #t~ret15 := main(); {7819#true} is VALID [2018-11-18 22:47:15,729 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-18 22:47:15,729 INFO L273 TraceCheckUtils]: 6: Hoare triple {7819#true} assume true; {7819#true} is VALID [2018-11-18 22:47:15,729 INFO L273 TraceCheckUtils]: 7: Hoare triple {7819#true} assume !(~x~0 < ~n~0); {7819#true} is VALID [2018-11-18 22:47:15,730 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-18 22:47:15,730 INFO L273 TraceCheckUtils]: 9: Hoare triple {7821#(= main_~v~0 0)} assume true; {7821#(= main_~v~0 0)} is VALID [2018-11-18 22:47:15,731 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 + 4 * ~v~0, 4); {7821#(= main_~v~0 0)} is VALID [2018-11-18 22:47:15,731 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-18 22:47:15,731 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-18 22:47:15,731 INFO L273 TraceCheckUtils]: 13: Hoare triple {7819#true} assume true; {7819#true} is VALID [2018-11-18 22:47:15,731 INFO L273 TraceCheckUtils]: 14: Hoare triple {7819#true} assume !(~i~0 < ~size); {7819#true} is VALID [2018-11-18 22:47:15,731 INFO L273 TraceCheckUtils]: 15: Hoare triple {7819#true} #res := 0; {7819#true} is VALID [2018-11-18 22:47:15,731 INFO L273 TraceCheckUtils]: 16: Hoare triple {7819#true} assume true; {7819#true} is VALID [2018-11-18 22:47:15,732 INFO L268 TraceCheckUtils]: 17: Hoare quadruple {7819#true} {7821#(= main_~v~0 0)} #132#return; {7821#(= main_~v~0 0)} is VALID [2018-11-18 22:47:15,732 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-18 22:47:15,733 INFO L273 TraceCheckUtils]: 19: Hoare triple {7821#(= main_~v~0 0)} assume 0 == #t~ret8;havoc #t~ret8;havoc #t~mem7;call #t~mem9 := read~int(~#values~0.base, ~#values~0.offset + 4 * ~v~0, 4); {7821#(= main_~v~0 0)} is VALID [2018-11-18 22:47:15,733 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-18 22:47:15,733 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 + 4 * ~size, 4);#res := 1 + ~size; {7819#true} is VALID [2018-11-18 22:47:15,733 INFO L273 TraceCheckUtils]: 22: Hoare triple {7819#true} assume true; {7819#true} is VALID [2018-11-18 22:47:15,734 INFO L268 TraceCheckUtils]: 23: Hoare quadruple {7819#true} {7821#(= main_~v~0 0)} #134#return; {7821#(= main_~v~0 0)} is VALID [2018-11-18 22:47:15,734 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-18 22:47:15,734 INFO L273 TraceCheckUtils]: 25: Hoare triple {7821#(= main_~v~0 0)} #t~post6 := ~v~0;~v~0 := 1 + #t~post6;havoc #t~post6; {7822#(<= main_~v~0 1)} is VALID [2018-11-18 22:47:15,735 INFO L273 TraceCheckUtils]: 26: Hoare triple {7822#(<= main_~v~0 1)} assume true; {7822#(<= main_~v~0 1)} is VALID [2018-11-18 22:47:15,735 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 + 4 * ~v~0, 4); {7822#(<= main_~v~0 1)} is VALID [2018-11-18 22:47:15,735 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-18 22:47:15,736 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-18 22:47:15,736 INFO L273 TraceCheckUtils]: 30: Hoare triple {7819#true} assume true; {7819#true} is VALID [2018-11-18 22:47:15,736 INFO L273 TraceCheckUtils]: 31: Hoare triple {7819#true} assume !!(~i~0 < ~size);call #t~mem1 := read~int(~set.base, ~set.offset + 4 * ~i~0, 4); {7819#true} is VALID [2018-11-18 22:47:15,736 INFO L273 TraceCheckUtils]: 32: Hoare triple {7819#true} assume #t~mem1 == ~value;havoc #t~mem1;#res := 1; {7819#true} is VALID [2018-11-18 22:47:15,736 INFO L273 TraceCheckUtils]: 33: Hoare triple {7819#true} assume true; {7819#true} is VALID [2018-11-18 22:47:15,737 INFO L268 TraceCheckUtils]: 34: Hoare quadruple {7819#true} {7822#(<= main_~v~0 1)} #132#return; {7822#(<= main_~v~0 1)} is VALID [2018-11-18 22:47:15,738 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-18 22:47:15,738 INFO L273 TraceCheckUtils]: 36: Hoare triple {7822#(<= main_~v~0 1)} assume !(0 == #t~ret8);havoc #t~ret8;havoc #t~mem7; {7822#(<= main_~v~0 1)} is VALID [2018-11-18 22:47:15,738 INFO L273 TraceCheckUtils]: 37: Hoare triple {7822#(<= main_~v~0 1)} #t~post6 := ~v~0;~v~0 := 1 + #t~post6;havoc #t~post6; {7823#(<= main_~v~0 2)} is VALID [2018-11-18 22:47:15,739 INFO L273 TraceCheckUtils]: 38: Hoare triple {7823#(<= main_~v~0 2)} assume true; {7823#(<= main_~v~0 2)} is VALID [2018-11-18 22:47:15,739 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 + 4 * ~v~0, 4); {7823#(<= main_~v~0 2)} is VALID [2018-11-18 22:47:15,739 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-18 22:47:15,739 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-18 22:47:15,740 INFO L273 TraceCheckUtils]: 42: Hoare triple {7819#true} assume true; {7819#true} is VALID [2018-11-18 22:47:15,740 INFO L273 TraceCheckUtils]: 43: Hoare triple {7819#true} assume !!(~i~0 < ~size);call #t~mem1 := read~int(~set.base, ~set.offset + 4 * ~i~0, 4); {7819#true} is VALID [2018-11-18 22:47:15,740 INFO L273 TraceCheckUtils]: 44: Hoare triple {7819#true} assume #t~mem1 == ~value;havoc #t~mem1;#res := 1; {7819#true} is VALID [2018-11-18 22:47:15,740 INFO L273 TraceCheckUtils]: 45: Hoare triple {7819#true} assume true; {7819#true} is VALID [2018-11-18 22:47:15,741 INFO L268 TraceCheckUtils]: 46: Hoare quadruple {7819#true} {7823#(<= main_~v~0 2)} #132#return; {7823#(<= main_~v~0 2)} is VALID [2018-11-18 22:47:15,741 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-18 22:47:15,742 INFO L273 TraceCheckUtils]: 48: Hoare triple {7823#(<= main_~v~0 2)} assume !(0 == #t~ret8);havoc #t~ret8;havoc #t~mem7; {7823#(<= main_~v~0 2)} is VALID [2018-11-18 22:47:15,743 INFO L273 TraceCheckUtils]: 49: Hoare triple {7823#(<= main_~v~0 2)} #t~post6 := ~v~0;~v~0 := 1 + #t~post6;havoc #t~post6; {7824#(<= main_~v~0 3)} is VALID [2018-11-18 22:47:15,743 INFO L273 TraceCheckUtils]: 50: Hoare triple {7824#(<= main_~v~0 3)} assume true; {7824#(<= main_~v~0 3)} is VALID [2018-11-18 22:47:15,744 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 + 4 * ~v~0, 4); {7824#(<= main_~v~0 3)} is VALID [2018-11-18 22:47:15,744 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-18 22:47:15,744 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-18 22:47:15,744 INFO L273 TraceCheckUtils]: 54: Hoare triple {7819#true} assume true; {7819#true} is VALID [2018-11-18 22:47:15,745 INFO L273 TraceCheckUtils]: 55: Hoare triple {7819#true} assume !!(~i~0 < ~size);call #t~mem1 := read~int(~set.base, ~set.offset + 4 * ~i~0, 4); {7819#true} is VALID [2018-11-18 22:47:15,745 INFO L273 TraceCheckUtils]: 56: Hoare triple {7819#true} assume #t~mem1 == ~value;havoc #t~mem1;#res := 1; {7819#true} is VALID [2018-11-18 22:47:15,745 INFO L273 TraceCheckUtils]: 57: Hoare triple {7819#true} assume true; {7819#true} is VALID [2018-11-18 22:47:15,746 INFO L268 TraceCheckUtils]: 58: Hoare quadruple {7819#true} {7824#(<= main_~v~0 3)} #132#return; {7824#(<= main_~v~0 3)} is VALID [2018-11-18 22:47:15,746 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-18 22:47:15,747 INFO L273 TraceCheckUtils]: 60: Hoare triple {7824#(<= main_~v~0 3)} assume !(0 == #t~ret8);havoc #t~ret8;havoc #t~mem7; {7824#(<= main_~v~0 3)} is VALID [2018-11-18 22:47:15,747 INFO L273 TraceCheckUtils]: 61: Hoare triple {7824#(<= main_~v~0 3)} #t~post6 := ~v~0;~v~0 := 1 + #t~post6;havoc #t~post6; {7825#(<= main_~v~0 4)} is VALID [2018-11-18 22:47:15,748 INFO L273 TraceCheckUtils]: 62: Hoare triple {7825#(<= main_~v~0 4)} assume true; {7825#(<= main_~v~0 4)} is VALID [2018-11-18 22:47:15,748 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 + 4 * ~v~0, 4); {7825#(<= main_~v~0 4)} is VALID [2018-11-18 22:47:15,748 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-18 22:47:15,748 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-18 22:47:15,748 INFO L273 TraceCheckUtils]: 66: Hoare triple {7819#true} assume true; {7819#true} is VALID [2018-11-18 22:47:15,748 INFO L273 TraceCheckUtils]: 67: Hoare triple {7819#true} assume !!(~i~0 < ~size);call #t~mem1 := read~int(~set.base, ~set.offset + 4 * ~i~0, 4); {7819#true} is VALID [2018-11-18 22:47:15,749 INFO L273 TraceCheckUtils]: 68: Hoare triple {7819#true} assume #t~mem1 == ~value;havoc #t~mem1;#res := 1; {7819#true} is VALID [2018-11-18 22:47:15,749 INFO L273 TraceCheckUtils]: 69: Hoare triple {7819#true} assume true; {7819#true} is VALID [2018-11-18 22:47:15,749 INFO L268 TraceCheckUtils]: 70: Hoare quadruple {7819#true} {7825#(<= main_~v~0 4)} #132#return; {7825#(<= main_~v~0 4)} is VALID [2018-11-18 22:47:15,750 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-18 22:47:15,751 INFO L273 TraceCheckUtils]: 72: Hoare triple {7825#(<= main_~v~0 4)} assume !(0 == #t~ret8);havoc #t~ret8;havoc #t~mem7; {7825#(<= main_~v~0 4)} is VALID [2018-11-18 22:47:15,751 INFO L273 TraceCheckUtils]: 73: Hoare triple {7825#(<= main_~v~0 4)} #t~post6 := ~v~0;~v~0 := 1 + #t~post6;havoc #t~post6; {7826#(<= main_~v~0 5)} is VALID [2018-11-18 22:47:15,752 INFO L273 TraceCheckUtils]: 74: Hoare triple {7826#(<= main_~v~0 5)} assume true; {7826#(<= main_~v~0 5)} is VALID [2018-11-18 22:47:15,752 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 + 4 * ~v~0, 4); {7826#(<= main_~v~0 5)} is VALID [2018-11-18 22:47:15,753 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-18 22:47:15,753 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-18 22:47:15,753 INFO L273 TraceCheckUtils]: 78: Hoare triple {7819#true} assume true; {7819#true} is VALID [2018-11-18 22:47:15,753 INFO L273 TraceCheckUtils]: 79: Hoare triple {7819#true} assume !!(~i~0 < ~size);call #t~mem1 := read~int(~set.base, ~set.offset + 4 * ~i~0, 4); {7819#true} is VALID [2018-11-18 22:47:15,753 INFO L273 TraceCheckUtils]: 80: Hoare triple {7819#true} assume #t~mem1 == ~value;havoc #t~mem1;#res := 1; {7819#true} is VALID [2018-11-18 22:47:15,754 INFO L273 TraceCheckUtils]: 81: Hoare triple {7819#true} assume true; {7819#true} is VALID [2018-11-18 22:47:15,755 INFO L268 TraceCheckUtils]: 82: Hoare quadruple {7819#true} {7826#(<= main_~v~0 5)} #132#return; {7826#(<= main_~v~0 5)} is VALID [2018-11-18 22:47:15,755 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-18 22:47:15,756 INFO L273 TraceCheckUtils]: 84: Hoare triple {7826#(<= main_~v~0 5)} assume !(0 == #t~ret8);havoc #t~ret8;havoc #t~mem7; {7826#(<= main_~v~0 5)} is VALID [2018-11-18 22:47:15,757 INFO L273 TraceCheckUtils]: 85: Hoare triple {7826#(<= main_~v~0 5)} #t~post6 := ~v~0;~v~0 := 1 + #t~post6;havoc #t~post6; {7827#(<= main_~v~0 6)} is VALID [2018-11-18 22:47:15,757 INFO L273 TraceCheckUtils]: 86: Hoare triple {7827#(<= main_~v~0 6)} assume true; {7827#(<= main_~v~0 6)} is VALID [2018-11-18 22:47:15,758 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 + 4 * ~v~0, 4); {7827#(<= main_~v~0 6)} is VALID [2018-11-18 22:47:15,758 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-18 22:47:15,758 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-18 22:47:15,758 INFO L273 TraceCheckUtils]: 90: Hoare triple {7819#true} assume true; {7819#true} is VALID [2018-11-18 22:47:15,759 INFO L273 TraceCheckUtils]: 91: Hoare triple {7819#true} assume !!(~i~0 < ~size);call #t~mem1 := read~int(~set.base, ~set.offset + 4 * ~i~0, 4); {7819#true} is VALID [2018-11-18 22:47:15,759 INFO L273 TraceCheckUtils]: 92: Hoare triple {7819#true} assume !(#t~mem1 == ~value);havoc #t~mem1; {7819#true} is VALID [2018-11-18 22:47:15,759 INFO L273 TraceCheckUtils]: 93: Hoare triple {7819#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {7819#true} is VALID [2018-11-18 22:47:15,759 INFO L273 TraceCheckUtils]: 94: Hoare triple {7819#true} assume true; {7819#true} is VALID [2018-11-18 22:47:15,760 INFO L273 TraceCheckUtils]: 95: Hoare triple {7819#true} assume !(~i~0 < ~size); {7819#true} is VALID [2018-11-18 22:47:15,760 INFO L273 TraceCheckUtils]: 96: Hoare triple {7819#true} #res := 0; {7819#true} is VALID [2018-11-18 22:47:15,760 INFO L273 TraceCheckUtils]: 97: Hoare triple {7819#true} assume true; {7819#true} is VALID [2018-11-18 22:47:15,761 INFO L268 TraceCheckUtils]: 98: Hoare quadruple {7819#true} {7827#(<= main_~v~0 6)} #132#return; {7827#(<= main_~v~0 6)} is VALID [2018-11-18 22:47:15,762 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-18 22:47:15,762 INFO L273 TraceCheckUtils]: 100: Hoare triple {7827#(<= main_~v~0 6)} assume 0 == #t~ret8;havoc #t~ret8;havoc #t~mem7;call #t~mem9 := read~int(~#values~0.base, ~#values~0.offset + 4 * ~v~0, 4); {7827#(<= main_~v~0 6)} is VALID [2018-11-18 22:47:15,762 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-18 22:47:15,762 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 + 4 * ~size, 4);#res := 1 + ~size; {7819#true} is VALID [2018-11-18 22:47:15,763 INFO L273 TraceCheckUtils]: 103: Hoare triple {7819#true} assume true; {7819#true} is VALID [2018-11-18 22:47:15,763 INFO L268 TraceCheckUtils]: 104: Hoare quadruple {7819#true} {7827#(<= main_~v~0 6)} #134#return; {7827#(<= main_~v~0 6)} is VALID [2018-11-18 22:47:15,764 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-18 22:47:15,764 INFO L273 TraceCheckUtils]: 106: Hoare triple {7827#(<= main_~v~0 6)} #t~post6 := ~v~0;~v~0 := 1 + #t~post6;havoc #t~post6; {7828#(<= main_~v~0 7)} is VALID [2018-11-18 22:47:15,764 INFO L273 TraceCheckUtils]: 107: Hoare triple {7828#(<= main_~v~0 7)} assume true; {7828#(<= main_~v~0 7)} is VALID [2018-11-18 22:47:15,765 INFO L273 TraceCheckUtils]: 108: Hoare triple {7828#(<= main_~v~0 7)} assume !(~v~0 < 100000); {7820#false} is VALID [2018-11-18 22:47:15,765 INFO L273 TraceCheckUtils]: 109: Hoare triple {7820#false} ~x~0 := 0; {7820#false} is VALID [2018-11-18 22:47:15,766 INFO L273 TraceCheckUtils]: 110: Hoare triple {7820#false} assume true; {7820#false} is VALID [2018-11-18 22:47:15,766 INFO L273 TraceCheckUtils]: 111: Hoare triple {7820#false} assume !!(~x~0 < ~n~0);~y~0 := 1 + ~x~0; {7820#false} is VALID [2018-11-18 22:47:15,766 INFO L273 TraceCheckUtils]: 112: Hoare triple {7820#false} assume true; {7820#false} is VALID [2018-11-18 22:47:15,766 INFO L273 TraceCheckUtils]: 113: Hoare triple {7820#false} assume !!(~y~0 < ~n~0);call #t~mem13 := read~int(~#set~0.base, ~#set~0.offset + 4 * ~x~0, 4);call #t~mem14 := read~int(~#set~0.base, ~#set~0.offset + 4 * ~y~0, 4); {7820#false} is VALID [2018-11-18 22:47:15,766 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-18 22:47:15,767 INFO L273 TraceCheckUtils]: 115: Hoare triple {7820#false} ~cond := #in~cond; {7820#false} is VALID [2018-11-18 22:47:15,767 INFO L273 TraceCheckUtils]: 116: Hoare triple {7820#false} assume 0 == ~cond; {7820#false} is VALID [2018-11-18 22:47:15,767 INFO L273 TraceCheckUtils]: 117: Hoare triple {7820#false} assume !false; {7820#false} is VALID [2018-11-18 22:47:15,773 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-18 22:47:15,774 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 22:47:15,774 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-18 22:47:15,785 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 22:47:15,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:47:15,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:47:15,869 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 22:47:16,032 INFO L256 TraceCheckUtils]: 0: Hoare triple {7819#true} call ULTIMATE.init(); {7819#true} is VALID [2018-11-18 22:47:16,032 INFO L273 TraceCheckUtils]: 1: Hoare triple {7819#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {7819#true} is VALID [2018-11-18 22:47:16,033 INFO L273 TraceCheckUtils]: 2: Hoare triple {7819#true} assume true; {7819#true} is VALID [2018-11-18 22:47:16,033 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {7819#true} {7819#true} #126#return; {7819#true} is VALID [2018-11-18 22:47:16,033 INFO L256 TraceCheckUtils]: 4: Hoare triple {7819#true} call #t~ret15 := main(); {7819#true} is VALID [2018-11-18 22:47:16,033 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-18 22:47:16,033 INFO L273 TraceCheckUtils]: 6: Hoare triple {7819#true} assume true; {7819#true} is VALID [2018-11-18 22:47:16,034 INFO L273 TraceCheckUtils]: 7: Hoare triple {7819#true} assume !(~x~0 < ~n~0); {7819#true} is VALID [2018-11-18 22:47:16,034 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-18 22:47:16,035 INFO L273 TraceCheckUtils]: 9: Hoare triple {7856#(<= main_~v~0 0)} assume true; {7856#(<= main_~v~0 0)} is VALID [2018-11-18 22:47:16,035 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 + 4 * ~v~0, 4); {7856#(<= main_~v~0 0)} is VALID [2018-11-18 22:47:16,035 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-18 22:47:16,035 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-18 22:47:16,035 INFO L273 TraceCheckUtils]: 13: Hoare triple {7819#true} assume true; {7819#true} is VALID [2018-11-18 22:47:16,035 INFO L273 TraceCheckUtils]: 14: Hoare triple {7819#true} assume !(~i~0 < ~size); {7819#true} is VALID [2018-11-18 22:47:16,036 INFO L273 TraceCheckUtils]: 15: Hoare triple {7819#true} #res := 0; {7819#true} is VALID [2018-11-18 22:47:16,036 INFO L273 TraceCheckUtils]: 16: Hoare triple {7819#true} assume true; {7819#true} is VALID [2018-11-18 22:47:16,036 INFO L268 TraceCheckUtils]: 17: Hoare quadruple {7819#true} {7856#(<= main_~v~0 0)} #132#return; {7856#(<= main_~v~0 0)} is VALID [2018-11-18 22:47:16,037 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-18 22:47:16,037 INFO L273 TraceCheckUtils]: 19: Hoare triple {7856#(<= main_~v~0 0)} assume 0 == #t~ret8;havoc #t~ret8;havoc #t~mem7;call #t~mem9 := read~int(~#values~0.base, ~#values~0.offset + 4 * ~v~0, 4); {7856#(<= main_~v~0 0)} is VALID [2018-11-18 22:47:16,037 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-18 22:47:16,037 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 + 4 * ~size, 4);#res := 1 + ~size; {7819#true} is VALID [2018-11-18 22:47:16,037 INFO L273 TraceCheckUtils]: 22: Hoare triple {7819#true} assume true; {7819#true} is VALID [2018-11-18 22:47:16,038 INFO L268 TraceCheckUtils]: 23: Hoare quadruple {7819#true} {7856#(<= main_~v~0 0)} #134#return; {7856#(<= main_~v~0 0)} is VALID [2018-11-18 22:47:16,039 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-18 22:47:16,040 INFO L273 TraceCheckUtils]: 25: Hoare triple {7856#(<= main_~v~0 0)} #t~post6 := ~v~0;~v~0 := 1 + #t~post6;havoc #t~post6; {7822#(<= main_~v~0 1)} is VALID [2018-11-18 22:47:16,040 INFO L273 TraceCheckUtils]: 26: Hoare triple {7822#(<= main_~v~0 1)} assume true; {7822#(<= main_~v~0 1)} is VALID [2018-11-18 22:47:16,041 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 + 4 * ~v~0, 4); {7822#(<= main_~v~0 1)} is VALID [2018-11-18 22:47:16,041 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-18 22:47:16,041 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-18 22:47:16,041 INFO L273 TraceCheckUtils]: 30: Hoare triple {7819#true} assume true; {7819#true} is VALID [2018-11-18 22:47:16,042 INFO L273 TraceCheckUtils]: 31: Hoare triple {7819#true} assume !!(~i~0 < ~size);call #t~mem1 := read~int(~set.base, ~set.offset + 4 * ~i~0, 4); {7819#true} is VALID [2018-11-18 22:47:16,042 INFO L273 TraceCheckUtils]: 32: Hoare triple {7819#true} assume #t~mem1 == ~value;havoc #t~mem1;#res := 1; {7819#true} is VALID [2018-11-18 22:47:16,042 INFO L273 TraceCheckUtils]: 33: Hoare triple {7819#true} assume true; {7819#true} is VALID [2018-11-18 22:47:16,043 INFO L268 TraceCheckUtils]: 34: Hoare quadruple {7819#true} {7822#(<= main_~v~0 1)} #132#return; {7822#(<= main_~v~0 1)} is VALID [2018-11-18 22:47:16,044 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-18 22:47:16,044 INFO L273 TraceCheckUtils]: 36: Hoare triple {7822#(<= main_~v~0 1)} assume !(0 == #t~ret8);havoc #t~ret8;havoc #t~mem7; {7822#(<= main_~v~0 1)} is VALID [2018-11-18 22:47:16,045 INFO L273 TraceCheckUtils]: 37: Hoare triple {7822#(<= main_~v~0 1)} #t~post6 := ~v~0;~v~0 := 1 + #t~post6;havoc #t~post6; {7823#(<= main_~v~0 2)} is VALID [2018-11-18 22:47:16,045 INFO L273 TraceCheckUtils]: 38: Hoare triple {7823#(<= main_~v~0 2)} assume true; {7823#(<= main_~v~0 2)} is VALID [2018-11-18 22:47:16,046 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 + 4 * ~v~0, 4); {7823#(<= main_~v~0 2)} is VALID [2018-11-18 22:47:16,046 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-18 22:47:16,046 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-18 22:47:16,046 INFO L273 TraceCheckUtils]: 42: Hoare triple {7819#true} assume true; {7819#true} is VALID [2018-11-18 22:47:16,046 INFO L273 TraceCheckUtils]: 43: Hoare triple {7819#true} assume !!(~i~0 < ~size);call #t~mem1 := read~int(~set.base, ~set.offset + 4 * ~i~0, 4); {7819#true} is VALID [2018-11-18 22:47:16,046 INFO L273 TraceCheckUtils]: 44: Hoare triple {7819#true} assume #t~mem1 == ~value;havoc #t~mem1;#res := 1; {7819#true} is VALID [2018-11-18 22:47:16,046 INFO L273 TraceCheckUtils]: 45: Hoare triple {7819#true} assume true; {7819#true} is VALID [2018-11-18 22:47:16,047 INFO L268 TraceCheckUtils]: 46: Hoare quadruple {7819#true} {7823#(<= main_~v~0 2)} #132#return; {7823#(<= main_~v~0 2)} is VALID [2018-11-18 22:47:16,047 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-18 22:47:16,048 INFO L273 TraceCheckUtils]: 48: Hoare triple {7823#(<= main_~v~0 2)} assume !(0 == #t~ret8);havoc #t~ret8;havoc #t~mem7; {7823#(<= main_~v~0 2)} is VALID [2018-11-18 22:47:16,048 INFO L273 TraceCheckUtils]: 49: Hoare triple {7823#(<= main_~v~0 2)} #t~post6 := ~v~0;~v~0 := 1 + #t~post6;havoc #t~post6; {7824#(<= main_~v~0 3)} is VALID [2018-11-18 22:47:16,048 INFO L273 TraceCheckUtils]: 50: Hoare triple {7824#(<= main_~v~0 3)} assume true; {7824#(<= main_~v~0 3)} is VALID [2018-11-18 22:47:16,049 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 + 4 * ~v~0, 4); {7824#(<= main_~v~0 3)} is VALID [2018-11-18 22:47:16,049 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-18 22:47:16,049 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-18 22:47:16,049 INFO L273 TraceCheckUtils]: 54: Hoare triple {7819#true} assume true; {7819#true} is VALID [2018-11-18 22:47:16,049 INFO L273 TraceCheckUtils]: 55: Hoare triple {7819#true} assume !!(~i~0 < ~size);call #t~mem1 := read~int(~set.base, ~set.offset + 4 * ~i~0, 4); {7819#true} is VALID [2018-11-18 22:47:16,049 INFO L273 TraceCheckUtils]: 56: Hoare triple {7819#true} assume #t~mem1 == ~value;havoc #t~mem1;#res := 1; {7819#true} is VALID [2018-11-18 22:47:16,049 INFO L273 TraceCheckUtils]: 57: Hoare triple {7819#true} assume true; {7819#true} is VALID [2018-11-18 22:47:16,050 INFO L268 TraceCheckUtils]: 58: Hoare quadruple {7819#true} {7824#(<= main_~v~0 3)} #132#return; {7824#(<= main_~v~0 3)} is VALID [2018-11-18 22:47:16,050 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-18 22:47:16,051 INFO L273 TraceCheckUtils]: 60: Hoare triple {7824#(<= main_~v~0 3)} assume !(0 == #t~ret8);havoc #t~ret8;havoc #t~mem7; {7824#(<= main_~v~0 3)} is VALID [2018-11-18 22:47:16,051 INFO L273 TraceCheckUtils]: 61: Hoare triple {7824#(<= main_~v~0 3)} #t~post6 := ~v~0;~v~0 := 1 + #t~post6;havoc #t~post6; {7825#(<= main_~v~0 4)} is VALID [2018-11-18 22:47:16,052 INFO L273 TraceCheckUtils]: 62: Hoare triple {7825#(<= main_~v~0 4)} assume true; {7825#(<= main_~v~0 4)} is VALID [2018-11-18 22:47:16,052 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 + 4 * ~v~0, 4); {7825#(<= main_~v~0 4)} is VALID [2018-11-18 22:47:16,053 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-18 22:47:16,053 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-18 22:47:16,053 INFO L273 TraceCheckUtils]: 66: Hoare triple {7819#true} assume true; {7819#true} is VALID [2018-11-18 22:47:16,053 INFO L273 TraceCheckUtils]: 67: Hoare triple {7819#true} assume !!(~i~0 < ~size);call #t~mem1 := read~int(~set.base, ~set.offset + 4 * ~i~0, 4); {7819#true} is VALID [2018-11-18 22:47:16,054 INFO L273 TraceCheckUtils]: 68: Hoare triple {7819#true} assume #t~mem1 == ~value;havoc #t~mem1;#res := 1; {7819#true} is VALID [2018-11-18 22:47:16,054 INFO L273 TraceCheckUtils]: 69: Hoare triple {7819#true} assume true; {7819#true} is VALID [2018-11-18 22:47:16,055 INFO L268 TraceCheckUtils]: 70: Hoare quadruple {7819#true} {7825#(<= main_~v~0 4)} #132#return; {7825#(<= main_~v~0 4)} is VALID [2018-11-18 22:47:16,055 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-18 22:47:16,056 INFO L273 TraceCheckUtils]: 72: Hoare triple {7825#(<= main_~v~0 4)} assume !(0 == #t~ret8);havoc #t~ret8;havoc #t~mem7; {7825#(<= main_~v~0 4)} is VALID [2018-11-18 22:47:16,056 INFO L273 TraceCheckUtils]: 73: Hoare triple {7825#(<= main_~v~0 4)} #t~post6 := ~v~0;~v~0 := 1 + #t~post6;havoc #t~post6; {7826#(<= main_~v~0 5)} is VALID [2018-11-18 22:47:16,057 INFO L273 TraceCheckUtils]: 74: Hoare triple {7826#(<= main_~v~0 5)} assume true; {7826#(<= main_~v~0 5)} is VALID [2018-11-18 22:47:16,057 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 + 4 * ~v~0, 4); {7826#(<= main_~v~0 5)} is VALID [2018-11-18 22:47:16,057 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-18 22:47:16,057 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-18 22:47:16,057 INFO L273 TraceCheckUtils]: 78: Hoare triple {7819#true} assume true; {7819#true} is VALID [2018-11-18 22:47:16,057 INFO L273 TraceCheckUtils]: 79: Hoare triple {7819#true} assume !!(~i~0 < ~size);call #t~mem1 := read~int(~set.base, ~set.offset + 4 * ~i~0, 4); {7819#true} is VALID [2018-11-18 22:47:16,058 INFO L273 TraceCheckUtils]: 80: Hoare triple {7819#true} assume #t~mem1 == ~value;havoc #t~mem1;#res := 1; {7819#true} is VALID [2018-11-18 22:47:16,058 INFO L273 TraceCheckUtils]: 81: Hoare triple {7819#true} assume true; {7819#true} is VALID [2018-11-18 22:47:16,058 INFO L268 TraceCheckUtils]: 82: Hoare quadruple {7819#true} {7826#(<= main_~v~0 5)} #132#return; {7826#(<= main_~v~0 5)} is VALID [2018-11-18 22:47:16,059 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-18 22:47:16,059 INFO L273 TraceCheckUtils]: 84: Hoare triple {7826#(<= main_~v~0 5)} assume !(0 == #t~ret8);havoc #t~ret8;havoc #t~mem7; {7826#(<= main_~v~0 5)} is VALID [2018-11-18 22:47:16,060 INFO L273 TraceCheckUtils]: 85: Hoare triple {7826#(<= main_~v~0 5)} #t~post6 := ~v~0;~v~0 := 1 + #t~post6;havoc #t~post6; {7827#(<= main_~v~0 6)} is VALID [2018-11-18 22:47:16,061 INFO L273 TraceCheckUtils]: 86: Hoare triple {7827#(<= main_~v~0 6)} assume true; {7827#(<= main_~v~0 6)} is VALID [2018-11-18 22:47:16,061 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 + 4 * ~v~0, 4); {7827#(<= main_~v~0 6)} is VALID [2018-11-18 22:47:16,061 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-18 22:47:16,062 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-18 22:47:16,062 INFO L273 TraceCheckUtils]: 90: Hoare triple {7819#true} assume true; {7819#true} is VALID [2018-11-18 22:47:16,062 INFO L273 TraceCheckUtils]: 91: Hoare triple {7819#true} assume !!(~i~0 < ~size);call #t~mem1 := read~int(~set.base, ~set.offset + 4 * ~i~0, 4); {7819#true} is VALID [2018-11-18 22:47:16,062 INFO L273 TraceCheckUtils]: 92: Hoare triple {7819#true} assume !(#t~mem1 == ~value);havoc #t~mem1; {7819#true} is VALID [2018-11-18 22:47:16,063 INFO L273 TraceCheckUtils]: 93: Hoare triple {7819#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {7819#true} is VALID [2018-11-18 22:47:16,063 INFO L273 TraceCheckUtils]: 94: Hoare triple {7819#true} assume true; {7819#true} is VALID [2018-11-18 22:47:16,063 INFO L273 TraceCheckUtils]: 95: Hoare triple {7819#true} assume !(~i~0 < ~size); {7819#true} is VALID [2018-11-18 22:47:16,063 INFO L273 TraceCheckUtils]: 96: Hoare triple {7819#true} #res := 0; {7819#true} is VALID [2018-11-18 22:47:16,063 INFO L273 TraceCheckUtils]: 97: Hoare triple {7819#true} assume true; {7819#true} is VALID [2018-11-18 22:47:16,064 INFO L268 TraceCheckUtils]: 98: Hoare quadruple {7819#true} {7827#(<= main_~v~0 6)} #132#return; {7827#(<= main_~v~0 6)} is VALID [2018-11-18 22:47:16,082 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-18 22:47:16,085 INFO L273 TraceCheckUtils]: 100: Hoare triple {7827#(<= main_~v~0 6)} assume 0 == #t~ret8;havoc #t~ret8;havoc #t~mem7;call #t~mem9 := read~int(~#values~0.base, ~#values~0.offset + 4 * ~v~0, 4); {7827#(<= main_~v~0 6)} is VALID [2018-11-18 22:47:16,086 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-18 22:47:16,086 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 + 4 * ~size, 4);#res := 1 + ~size; {7819#true} is VALID [2018-11-18 22:47:16,086 INFO L273 TraceCheckUtils]: 103: Hoare triple {7819#true} assume true; {7819#true} is VALID [2018-11-18 22:47:16,091 INFO L268 TraceCheckUtils]: 104: Hoare quadruple {7819#true} {7827#(<= main_~v~0 6)} #134#return; {7827#(<= main_~v~0 6)} is VALID [2018-11-18 22:47:16,091 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-18 22:47:16,092 INFO L273 TraceCheckUtils]: 106: Hoare triple {7827#(<= main_~v~0 6)} #t~post6 := ~v~0;~v~0 := 1 + #t~post6;havoc #t~post6; {7828#(<= main_~v~0 7)} is VALID [2018-11-18 22:47:16,092 INFO L273 TraceCheckUtils]: 107: Hoare triple {7828#(<= main_~v~0 7)} assume true; {7828#(<= main_~v~0 7)} is VALID [2018-11-18 22:47:16,093 INFO L273 TraceCheckUtils]: 108: Hoare triple {7828#(<= main_~v~0 7)} assume !(~v~0 < 100000); {7820#false} is VALID [2018-11-18 22:47:16,093 INFO L273 TraceCheckUtils]: 109: Hoare triple {7820#false} ~x~0 := 0; {7820#false} is VALID [2018-11-18 22:47:16,093 INFO L273 TraceCheckUtils]: 110: Hoare triple {7820#false} assume true; {7820#false} is VALID [2018-11-18 22:47:16,093 INFO L273 TraceCheckUtils]: 111: Hoare triple {7820#false} assume !!(~x~0 < ~n~0);~y~0 := 1 + ~x~0; {7820#false} is VALID [2018-11-18 22:47:16,093 INFO L273 TraceCheckUtils]: 112: Hoare triple {7820#false} assume true; {7820#false} is VALID [2018-11-18 22:47:16,093 INFO L273 TraceCheckUtils]: 113: Hoare triple {7820#false} assume !!(~y~0 < ~n~0);call #t~mem13 := read~int(~#set~0.base, ~#set~0.offset + 4 * ~x~0, 4);call #t~mem14 := read~int(~#set~0.base, ~#set~0.offset + 4 * ~y~0, 4); {7820#false} is VALID [2018-11-18 22:47:16,093 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-18 22:47:16,093 INFO L273 TraceCheckUtils]: 115: Hoare triple {7820#false} ~cond := #in~cond; {7820#false} is VALID [2018-11-18 22:47:16,094 INFO L273 TraceCheckUtils]: 116: Hoare triple {7820#false} assume 0 == ~cond; {7820#false} is VALID [2018-11-18 22:47:16,094 INFO L273 TraceCheckUtils]: 117: Hoare triple {7820#false} assume !false; {7820#false} is VALID [2018-11-18 22:47:16,100 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-18 22:47:16,121 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-18 22:47:16,122 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 11 [2018-11-18 22:47:16,122 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 118 [2018-11-18 22:47:16,122 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-18 22:47:16,123 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states. [2018-11-18 22:47:16,228 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-18 22:47:16,228 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-11-18 22:47:16,229 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-18 22:47:16,229 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2018-11-18 22:47:16,229 INFO L87 Difference]: Start difference. First operand 190 states and 243 transitions. Second operand 11 states. [2018-11-18 22:47:18,330 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:47:18,331 INFO L93 Difference]: Finished difference Result 271 states and 348 transitions. [2018-11-18 22:47:18,331 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-11-18 22:47:18,331 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 118 [2018-11-18 22:47:18,331 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 22:47:18,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2018-11-18 22:47:18,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 153 transitions. [2018-11-18 22:47:18,334 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2018-11-18 22:47:18,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 153 transitions. [2018-11-18 22:47:18,336 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states and 153 transitions. [2018-11-18 22:47:19,293 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-18 22:47:19,300 INFO L225 Difference]: With dead ends: 271 [2018-11-18 22:47:19,301 INFO L226 Difference]: Without dead ends: 256 [2018-11-18 22:47:19,301 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-18 22:47:19,302 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 256 states. [2018-11-18 22:47:19,472 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 256 to 216. [2018-11-18 22:47:19,472 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-18 22:47:19,472 INFO L82 GeneralOperation]: Start isEquivalent. First operand 256 states. Second operand 216 states. [2018-11-18 22:47:19,472 INFO L74 IsIncluded]: Start isIncluded. First operand 256 states. Second operand 216 states. [2018-11-18 22:47:19,472 INFO L87 Difference]: Start difference. First operand 256 states. Second operand 216 states. [2018-11-18 22:47:19,481 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:47:19,482 INFO L93 Difference]: Finished difference Result 256 states and 331 transitions. [2018-11-18 22:47:19,482 INFO L276 IsEmpty]: Start isEmpty. Operand 256 states and 331 transitions. [2018-11-18 22:47:19,484 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:47:19,484 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:47:19,484 INFO L74 IsIncluded]: Start isIncluded. First operand 216 states. Second operand 256 states. [2018-11-18 22:47:19,484 INFO L87 Difference]: Start difference. First operand 216 states. Second operand 256 states. [2018-11-18 22:47:19,494 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:47:19,495 INFO L93 Difference]: Finished difference Result 256 states and 331 transitions. [2018-11-18 22:47:19,495 INFO L276 IsEmpty]: Start isEmpty. Operand 256 states and 331 transitions. [2018-11-18 22:47:19,496 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:47:19,497 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:47:19,497 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-18 22:47:19,497 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-18 22:47:19,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 216 states. [2018-11-18 22:47:19,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 216 states to 216 states and 278 transitions. [2018-11-18 22:47:19,505 INFO L78 Accepts]: Start accepts. Automaton has 216 states and 278 transitions. Word has length 118 [2018-11-18 22:47:19,505 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 22:47:19,505 INFO L480 AbstractCegarLoop]: Abstraction has 216 states and 278 transitions. [2018-11-18 22:47:19,505 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-11-18 22:47:19,506 INFO L276 IsEmpty]: Start isEmpty. Operand 216 states and 278 transitions. [2018-11-18 22:47:19,508 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2018-11-18 22:47:19,508 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 22:47:19,508 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-18 22:47:19,508 INFO L423 AbstractCegarLoop]: === Iteration 11 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 22:47:19,509 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 22:47:19,509 INFO L82 PathProgramCache]: Analyzing trace with hash 303128928, now seen corresponding path program 2 times [2018-11-18 22:47:19,509 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 22:47:19,509 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 22:47:19,510 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 22:47:19,510 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 22:47:19,510 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 22:47:19,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:47:20,811 INFO L256 TraceCheckUtils]: 0: Hoare triple {9332#true} call ULTIMATE.init(); {9332#true} is VALID [2018-11-18 22:47:20,811 INFO L273 TraceCheckUtils]: 1: Hoare triple {9332#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {9332#true} is VALID [2018-11-18 22:47:20,811 INFO L273 TraceCheckUtils]: 2: Hoare triple {9332#true} assume true; {9332#true} is VALID [2018-11-18 22:47:20,812 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {9332#true} {9332#true} #126#return; {9332#true} is VALID [2018-11-18 22:47:20,812 INFO L256 TraceCheckUtils]: 4: Hoare triple {9332#true} call #t~ret15 := main(); {9332#true} is VALID [2018-11-18 22:47:20,812 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-18 22:47:20,812 INFO L273 TraceCheckUtils]: 6: Hoare triple {9332#true} assume true; {9332#true} is VALID [2018-11-18 22:47:20,812 INFO L273 TraceCheckUtils]: 7: Hoare triple {9332#true} assume !(~x~0 < ~n~0); {9332#true} is VALID [2018-11-18 22:47:20,813 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-18 22:47:20,813 INFO L273 TraceCheckUtils]: 9: Hoare triple {9334#(= main_~v~0 0)} assume true; {9334#(= main_~v~0 0)} is VALID [2018-11-18 22:47:20,813 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 + 4 * ~v~0, 4); {9334#(= main_~v~0 0)} is VALID [2018-11-18 22:47:20,814 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-18 22:47:20,814 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-18 22:47:20,814 INFO L273 TraceCheckUtils]: 13: Hoare triple {9332#true} assume true; {9332#true} is VALID [2018-11-18 22:47:20,814 INFO L273 TraceCheckUtils]: 14: Hoare triple {9332#true} assume !(~i~0 < ~size); {9332#true} is VALID [2018-11-18 22:47:20,814 INFO L273 TraceCheckUtils]: 15: Hoare triple {9332#true} #res := 0; {9332#true} is VALID [2018-11-18 22:47:20,814 INFO L273 TraceCheckUtils]: 16: Hoare triple {9332#true} assume true; {9332#true} is VALID [2018-11-18 22:47:20,815 INFO L268 TraceCheckUtils]: 17: Hoare quadruple {9332#true} {9334#(= main_~v~0 0)} #132#return; {9334#(= main_~v~0 0)} is VALID [2018-11-18 22:47:20,815 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-18 22:47:20,816 INFO L273 TraceCheckUtils]: 19: Hoare triple {9334#(= main_~v~0 0)} assume 0 == #t~ret8;havoc #t~ret8;havoc #t~mem7;call #t~mem9 := read~int(~#values~0.base, ~#values~0.offset + 4 * ~v~0, 4); {9334#(= main_~v~0 0)} is VALID [2018-11-18 22:47:20,816 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-18 22:47:20,816 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 + 4 * ~size, 4);#res := 1 + ~size; {9332#true} is VALID [2018-11-18 22:47:20,816 INFO L273 TraceCheckUtils]: 22: Hoare triple {9332#true} assume true; {9332#true} is VALID [2018-11-18 22:47:20,817 INFO L268 TraceCheckUtils]: 23: Hoare quadruple {9332#true} {9334#(= main_~v~0 0)} #134#return; {9334#(= main_~v~0 0)} is VALID [2018-11-18 22:47:20,818 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-18 22:47:20,818 INFO L273 TraceCheckUtils]: 25: Hoare triple {9334#(= main_~v~0 0)} #t~post6 := ~v~0;~v~0 := 1 + #t~post6;havoc #t~post6; {9335#(<= main_~v~0 1)} is VALID [2018-11-18 22:47:20,819 INFO L273 TraceCheckUtils]: 26: Hoare triple {9335#(<= main_~v~0 1)} assume true; {9335#(<= main_~v~0 1)} is VALID [2018-11-18 22:47:20,820 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 + 4 * ~v~0, 4); {9335#(<= main_~v~0 1)} is VALID [2018-11-18 22:47:20,820 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-18 22:47:20,820 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-18 22:47:20,820 INFO L273 TraceCheckUtils]: 30: Hoare triple {9332#true} assume true; {9332#true} is VALID [2018-11-18 22:47:20,820 INFO L273 TraceCheckUtils]: 31: Hoare triple {9332#true} assume !!(~i~0 < ~size);call #t~mem1 := read~int(~set.base, ~set.offset + 4 * ~i~0, 4); {9332#true} is VALID [2018-11-18 22:47:20,821 INFO L273 TraceCheckUtils]: 32: Hoare triple {9332#true} assume #t~mem1 == ~value;havoc #t~mem1;#res := 1; {9332#true} is VALID [2018-11-18 22:47:20,821 INFO L273 TraceCheckUtils]: 33: Hoare triple {9332#true} assume true; {9332#true} is VALID [2018-11-18 22:47:20,822 INFO L268 TraceCheckUtils]: 34: Hoare quadruple {9332#true} {9335#(<= main_~v~0 1)} #132#return; {9335#(<= main_~v~0 1)} is VALID [2018-11-18 22:47:20,823 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-18 22:47:20,823 INFO L273 TraceCheckUtils]: 36: Hoare triple {9335#(<= main_~v~0 1)} assume !(0 == #t~ret8);havoc #t~ret8;havoc #t~mem7; {9335#(<= main_~v~0 1)} is VALID [2018-11-18 22:47:20,824 INFO L273 TraceCheckUtils]: 37: Hoare triple {9335#(<= main_~v~0 1)} #t~post6 := ~v~0;~v~0 := 1 + #t~post6;havoc #t~post6; {9336#(<= main_~v~0 2)} is VALID [2018-11-18 22:47:20,824 INFO L273 TraceCheckUtils]: 38: Hoare triple {9336#(<= main_~v~0 2)} assume true; {9336#(<= main_~v~0 2)} is VALID [2018-11-18 22:47:20,825 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 + 4 * ~v~0, 4); {9336#(<= main_~v~0 2)} is VALID [2018-11-18 22:47:20,825 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-18 22:47:20,825 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-18 22:47:20,826 INFO L273 TraceCheckUtils]: 42: Hoare triple {9332#true} assume true; {9332#true} is VALID [2018-11-18 22:47:20,826 INFO L273 TraceCheckUtils]: 43: Hoare triple {9332#true} assume !!(~i~0 < ~size);call #t~mem1 := read~int(~set.base, ~set.offset + 4 * ~i~0, 4); {9332#true} is VALID [2018-11-18 22:47:20,826 INFO L273 TraceCheckUtils]: 44: Hoare triple {9332#true} assume #t~mem1 == ~value;havoc #t~mem1;#res := 1; {9332#true} is VALID [2018-11-18 22:47:20,826 INFO L273 TraceCheckUtils]: 45: Hoare triple {9332#true} assume true; {9332#true} is VALID [2018-11-18 22:47:20,827 INFO L268 TraceCheckUtils]: 46: Hoare quadruple {9332#true} {9336#(<= main_~v~0 2)} #132#return; {9336#(<= main_~v~0 2)} is VALID [2018-11-18 22:47:20,828 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-18 22:47:20,828 INFO L273 TraceCheckUtils]: 48: Hoare triple {9336#(<= main_~v~0 2)} assume !(0 == #t~ret8);havoc #t~ret8;havoc #t~mem7; {9336#(<= main_~v~0 2)} is VALID [2018-11-18 22:47:20,829 INFO L273 TraceCheckUtils]: 49: Hoare triple {9336#(<= main_~v~0 2)} #t~post6 := ~v~0;~v~0 := 1 + #t~post6;havoc #t~post6; {9337#(<= main_~v~0 3)} is VALID [2018-11-18 22:47:20,829 INFO L273 TraceCheckUtils]: 50: Hoare triple {9337#(<= main_~v~0 3)} assume true; {9337#(<= main_~v~0 3)} is VALID [2018-11-18 22:47:20,829 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 + 4 * ~v~0, 4); {9337#(<= main_~v~0 3)} is VALID [2018-11-18 22:47:20,829 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-18 22:47:20,830 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-18 22:47:20,830 INFO L273 TraceCheckUtils]: 54: Hoare triple {9332#true} assume true; {9332#true} is VALID [2018-11-18 22:47:20,830 INFO L273 TraceCheckUtils]: 55: Hoare triple {9332#true} assume !!(~i~0 < ~size);call #t~mem1 := read~int(~set.base, ~set.offset + 4 * ~i~0, 4); {9332#true} is VALID [2018-11-18 22:47:20,830 INFO L273 TraceCheckUtils]: 56: Hoare triple {9332#true} assume #t~mem1 == ~value;havoc #t~mem1;#res := 1; {9332#true} is VALID [2018-11-18 22:47:20,830 INFO L273 TraceCheckUtils]: 57: Hoare triple {9332#true} assume true; {9332#true} is VALID [2018-11-18 22:47:20,832 INFO L268 TraceCheckUtils]: 58: Hoare quadruple {9332#true} {9337#(<= main_~v~0 3)} #132#return; {9337#(<= main_~v~0 3)} is VALID [2018-11-18 22:47:20,832 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-18 22:47:20,832 INFO L273 TraceCheckUtils]: 60: Hoare triple {9337#(<= main_~v~0 3)} assume !(0 == #t~ret8);havoc #t~ret8;havoc #t~mem7; {9337#(<= main_~v~0 3)} is VALID [2018-11-18 22:47:20,833 INFO L273 TraceCheckUtils]: 61: Hoare triple {9337#(<= main_~v~0 3)} #t~post6 := ~v~0;~v~0 := 1 + #t~post6;havoc #t~post6; {9338#(<= main_~v~0 4)} is VALID [2018-11-18 22:47:20,851 INFO L273 TraceCheckUtils]: 62: Hoare triple {9338#(<= main_~v~0 4)} assume true; {9338#(<= main_~v~0 4)} is VALID [2018-11-18 22:47:20,857 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 + 4 * ~v~0, 4); {9338#(<= main_~v~0 4)} is VALID [2018-11-18 22:47:20,857 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-18 22:47:20,857 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-18 22:47:20,857 INFO L273 TraceCheckUtils]: 66: Hoare triple {9332#true} assume true; {9332#true} is VALID [2018-11-18 22:47:20,857 INFO L273 TraceCheckUtils]: 67: Hoare triple {9332#true} assume !!(~i~0 < ~size);call #t~mem1 := read~int(~set.base, ~set.offset + 4 * ~i~0, 4); {9332#true} is VALID [2018-11-18 22:47:20,858 INFO L273 TraceCheckUtils]: 68: Hoare triple {9332#true} assume #t~mem1 == ~value;havoc #t~mem1;#res := 1; {9332#true} is VALID [2018-11-18 22:47:20,858 INFO L273 TraceCheckUtils]: 69: Hoare triple {9332#true} assume true; {9332#true} is VALID [2018-11-18 22:47:20,859 INFO L268 TraceCheckUtils]: 70: Hoare quadruple {9332#true} {9338#(<= main_~v~0 4)} #132#return; {9338#(<= main_~v~0 4)} is VALID [2018-11-18 22:47:20,859 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-18 22:47:20,859 INFO L273 TraceCheckUtils]: 72: Hoare triple {9338#(<= main_~v~0 4)} assume !(0 == #t~ret8);havoc #t~ret8;havoc #t~mem7; {9338#(<= main_~v~0 4)} is VALID [2018-11-18 22:47:20,860 INFO L273 TraceCheckUtils]: 73: Hoare triple {9338#(<= main_~v~0 4)} #t~post6 := ~v~0;~v~0 := 1 + #t~post6;havoc #t~post6; {9339#(<= main_~v~0 5)} is VALID [2018-11-18 22:47:20,860 INFO L273 TraceCheckUtils]: 74: Hoare triple {9339#(<= main_~v~0 5)} assume true; {9339#(<= main_~v~0 5)} is VALID [2018-11-18 22:47:20,860 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 + 4 * ~v~0, 4); {9339#(<= main_~v~0 5)} is VALID [2018-11-18 22:47:20,861 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-18 22:47:20,861 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-18 22:47:20,861 INFO L273 TraceCheckUtils]: 78: Hoare triple {9332#true} assume true; {9332#true} is VALID [2018-11-18 22:47:20,861 INFO L273 TraceCheckUtils]: 79: Hoare triple {9332#true} assume !!(~i~0 < ~size);call #t~mem1 := read~int(~set.base, ~set.offset + 4 * ~i~0, 4); {9332#true} is VALID [2018-11-18 22:47:20,861 INFO L273 TraceCheckUtils]: 80: Hoare triple {9332#true} assume #t~mem1 == ~value;havoc #t~mem1;#res := 1; {9332#true} is VALID [2018-11-18 22:47:20,861 INFO L273 TraceCheckUtils]: 81: Hoare triple {9332#true} assume true; {9332#true} is VALID [2018-11-18 22:47:20,863 INFO L268 TraceCheckUtils]: 82: Hoare quadruple {9332#true} {9339#(<= main_~v~0 5)} #132#return; {9339#(<= main_~v~0 5)} is VALID [2018-11-18 22:47:20,863 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-18 22:47:20,863 INFO L273 TraceCheckUtils]: 84: Hoare triple {9339#(<= main_~v~0 5)} assume !(0 == #t~ret8);havoc #t~ret8;havoc #t~mem7; {9339#(<= main_~v~0 5)} is VALID [2018-11-18 22:47:20,864 INFO L273 TraceCheckUtils]: 85: Hoare triple {9339#(<= main_~v~0 5)} #t~post6 := ~v~0;~v~0 := 1 + #t~post6;havoc #t~post6; {9340#(<= main_~v~0 6)} is VALID [2018-11-18 22:47:20,864 INFO L273 TraceCheckUtils]: 86: Hoare triple {9340#(<= main_~v~0 6)} assume true; {9340#(<= main_~v~0 6)} is VALID [2018-11-18 22:47:20,864 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 + 4 * ~v~0, 4); {9340#(<= main_~v~0 6)} is VALID [2018-11-18 22:47:20,865 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-18 22:47:20,865 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-18 22:47:20,865 INFO L273 TraceCheckUtils]: 90: Hoare triple {9332#true} assume true; {9332#true} is VALID [2018-11-18 22:47:20,865 INFO L273 TraceCheckUtils]: 91: Hoare triple {9332#true} assume !!(~i~0 < ~size);call #t~mem1 := read~int(~set.base, ~set.offset + 4 * ~i~0, 4); {9332#true} is VALID [2018-11-18 22:47:20,865 INFO L273 TraceCheckUtils]: 92: Hoare triple {9332#true} assume #t~mem1 == ~value;havoc #t~mem1;#res := 1; {9332#true} is VALID [2018-11-18 22:47:20,865 INFO L273 TraceCheckUtils]: 93: Hoare triple {9332#true} assume true; {9332#true} is VALID [2018-11-18 22:47:20,867 INFO L268 TraceCheckUtils]: 94: Hoare quadruple {9332#true} {9340#(<= main_~v~0 6)} #132#return; {9340#(<= main_~v~0 6)} is VALID [2018-11-18 22:47:20,867 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-18 22:47:20,868 INFO L273 TraceCheckUtils]: 96: Hoare triple {9340#(<= main_~v~0 6)} assume !(0 == #t~ret8);havoc #t~ret8;havoc #t~mem7; {9340#(<= main_~v~0 6)} is VALID [2018-11-18 22:47:20,868 INFO L273 TraceCheckUtils]: 97: Hoare triple {9340#(<= main_~v~0 6)} #t~post6 := ~v~0;~v~0 := 1 + #t~post6;havoc #t~post6; {9341#(<= main_~v~0 7)} is VALID [2018-11-18 22:47:20,868 INFO L273 TraceCheckUtils]: 98: Hoare triple {9341#(<= main_~v~0 7)} assume true; {9341#(<= main_~v~0 7)} is VALID [2018-11-18 22:47:20,869 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 + 4 * ~v~0, 4); {9341#(<= main_~v~0 7)} is VALID [2018-11-18 22:47:20,869 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-18 22:47:20,869 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-18 22:47:20,869 INFO L273 TraceCheckUtils]: 102: Hoare triple {9332#true} assume true; {9332#true} is VALID [2018-11-18 22:47:20,869 INFO L273 TraceCheckUtils]: 103: Hoare triple {9332#true} assume !!(~i~0 < ~size);call #t~mem1 := read~int(~set.base, ~set.offset + 4 * ~i~0, 4); {9332#true} is VALID [2018-11-18 22:47:20,869 INFO L273 TraceCheckUtils]: 104: Hoare triple {9332#true} assume !(#t~mem1 == ~value);havoc #t~mem1; {9332#true} is VALID [2018-11-18 22:47:20,869 INFO L273 TraceCheckUtils]: 105: Hoare triple {9332#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {9332#true} is VALID [2018-11-18 22:47:20,870 INFO L273 TraceCheckUtils]: 106: Hoare triple {9332#true} assume true; {9332#true} is VALID [2018-11-18 22:47:20,870 INFO L273 TraceCheckUtils]: 107: Hoare triple {9332#true} assume !(~i~0 < ~size); {9332#true} is VALID [2018-11-18 22:47:20,870 INFO L273 TraceCheckUtils]: 108: Hoare triple {9332#true} #res := 0; {9332#true} is VALID [2018-11-18 22:47:20,870 INFO L273 TraceCheckUtils]: 109: Hoare triple {9332#true} assume true; {9332#true} is VALID [2018-11-18 22:47:20,871 INFO L268 TraceCheckUtils]: 110: Hoare quadruple {9332#true} {9341#(<= main_~v~0 7)} #132#return; {9341#(<= main_~v~0 7)} is VALID [2018-11-18 22:47:20,871 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-18 22:47:20,872 INFO L273 TraceCheckUtils]: 112: Hoare triple {9341#(<= main_~v~0 7)} assume 0 == #t~ret8;havoc #t~ret8;havoc #t~mem7;call #t~mem9 := read~int(~#values~0.base, ~#values~0.offset + 4 * ~v~0, 4); {9341#(<= main_~v~0 7)} is VALID [2018-11-18 22:47:20,872 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-18 22:47:20,872 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 + 4 * ~size, 4);#res := 1 + ~size; {9332#true} is VALID [2018-11-18 22:47:20,872 INFO L273 TraceCheckUtils]: 115: Hoare triple {9332#true} assume true; {9332#true} is VALID [2018-11-18 22:47:20,874 INFO L268 TraceCheckUtils]: 116: Hoare quadruple {9332#true} {9341#(<= main_~v~0 7)} #134#return; {9341#(<= main_~v~0 7)} is VALID [2018-11-18 22:47:20,874 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-18 22:47:20,875 INFO L273 TraceCheckUtils]: 118: Hoare triple {9341#(<= main_~v~0 7)} #t~post6 := ~v~0;~v~0 := 1 + #t~post6;havoc #t~post6; {9342#(<= main_~v~0 8)} is VALID [2018-11-18 22:47:20,875 INFO L273 TraceCheckUtils]: 119: Hoare triple {9342#(<= main_~v~0 8)} assume true; {9342#(<= main_~v~0 8)} is VALID [2018-11-18 22:47:20,875 INFO L273 TraceCheckUtils]: 120: Hoare triple {9342#(<= main_~v~0 8)} assume !(~v~0 < 100000); {9333#false} is VALID [2018-11-18 22:47:20,875 INFO L273 TraceCheckUtils]: 121: Hoare triple {9333#false} ~x~0 := 0; {9333#false} is VALID [2018-11-18 22:47:20,875 INFO L273 TraceCheckUtils]: 122: Hoare triple {9333#false} assume true; {9333#false} is VALID [2018-11-18 22:47:20,876 INFO L273 TraceCheckUtils]: 123: Hoare triple {9333#false} assume !!(~x~0 < ~n~0);~y~0 := 1 + ~x~0; {9333#false} is VALID [2018-11-18 22:47:20,876 INFO L273 TraceCheckUtils]: 124: Hoare triple {9333#false} assume true; {9333#false} is VALID [2018-11-18 22:47:20,876 INFO L273 TraceCheckUtils]: 125: Hoare triple {9333#false} assume !!(~y~0 < ~n~0);call #t~mem13 := read~int(~#set~0.base, ~#set~0.offset + 4 * ~x~0, 4);call #t~mem14 := read~int(~#set~0.base, ~#set~0.offset + 4 * ~y~0, 4); {9333#false} is VALID [2018-11-18 22:47:20,876 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-18 22:47:20,876 INFO L273 TraceCheckUtils]: 127: Hoare triple {9333#false} ~cond := #in~cond; {9333#false} is VALID [2018-11-18 22:47:20,876 INFO L273 TraceCheckUtils]: 128: Hoare triple {9333#false} assume 0 == ~cond; {9333#false} is VALID [2018-11-18 22:47:20,877 INFO L273 TraceCheckUtils]: 129: Hoare triple {9333#false} assume !false; {9333#false} is VALID [2018-11-18 22:47:20,885 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-18 22:47:20,885 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 22:47:20,885 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-18 22:47:20,894 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-18 22:47:20,955 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-18 22:47:20,955 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-18 22:47:20,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:47:20,999 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 22:47:21,280 INFO L256 TraceCheckUtils]: 0: Hoare triple {9332#true} call ULTIMATE.init(); {9332#true} is VALID [2018-11-18 22:47:21,280 INFO L273 TraceCheckUtils]: 1: Hoare triple {9332#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {9332#true} is VALID [2018-11-18 22:47:21,280 INFO L273 TraceCheckUtils]: 2: Hoare triple {9332#true} assume true; {9332#true} is VALID [2018-11-18 22:47:21,281 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {9332#true} {9332#true} #126#return; {9332#true} is VALID [2018-11-18 22:47:21,281 INFO L256 TraceCheckUtils]: 4: Hoare triple {9332#true} call #t~ret15 := main(); {9332#true} is VALID [2018-11-18 22:47:21,281 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-18 22:47:21,281 INFO L273 TraceCheckUtils]: 6: Hoare triple {9332#true} assume true; {9332#true} is VALID [2018-11-18 22:47:21,281 INFO L273 TraceCheckUtils]: 7: Hoare triple {9332#true} assume !(~x~0 < ~n~0); {9332#true} is VALID [2018-11-18 22:47:21,282 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-18 22:47:21,282 INFO L273 TraceCheckUtils]: 9: Hoare triple {9370#(<= main_~v~0 0)} assume true; {9370#(<= main_~v~0 0)} is VALID [2018-11-18 22:47:21,283 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 + 4 * ~v~0, 4); {9370#(<= main_~v~0 0)} is VALID [2018-11-18 22:47:21,283 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-18 22:47:21,283 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-18 22:47:21,283 INFO L273 TraceCheckUtils]: 13: Hoare triple {9332#true} assume true; {9332#true} is VALID [2018-11-18 22:47:21,283 INFO L273 TraceCheckUtils]: 14: Hoare triple {9332#true} assume !(~i~0 < ~size); {9332#true} is VALID [2018-11-18 22:47:21,283 INFO L273 TraceCheckUtils]: 15: Hoare triple {9332#true} #res := 0; {9332#true} is VALID [2018-11-18 22:47:21,283 INFO L273 TraceCheckUtils]: 16: Hoare triple {9332#true} assume true; {9332#true} is VALID [2018-11-18 22:47:21,284 INFO L268 TraceCheckUtils]: 17: Hoare quadruple {9332#true} {9370#(<= main_~v~0 0)} #132#return; {9370#(<= main_~v~0 0)} is VALID [2018-11-18 22:47:21,285 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-18 22:47:21,285 INFO L273 TraceCheckUtils]: 19: Hoare triple {9370#(<= main_~v~0 0)} assume 0 == #t~ret8;havoc #t~ret8;havoc #t~mem7;call #t~mem9 := read~int(~#values~0.base, ~#values~0.offset + 4 * ~v~0, 4); {9370#(<= main_~v~0 0)} is VALID [2018-11-18 22:47:21,285 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-18 22:47:21,285 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 + 4 * ~size, 4);#res := 1 + ~size; {9332#true} is VALID [2018-11-18 22:47:21,285 INFO L273 TraceCheckUtils]: 22: Hoare triple {9332#true} assume true; {9332#true} is VALID [2018-11-18 22:47:21,286 INFO L268 TraceCheckUtils]: 23: Hoare quadruple {9332#true} {9370#(<= main_~v~0 0)} #134#return; {9370#(<= main_~v~0 0)} is VALID [2018-11-18 22:47:21,287 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-18 22:47:21,288 INFO L273 TraceCheckUtils]: 25: Hoare triple {9370#(<= main_~v~0 0)} #t~post6 := ~v~0;~v~0 := 1 + #t~post6;havoc #t~post6; {9335#(<= main_~v~0 1)} is VALID [2018-11-18 22:47:21,288 INFO L273 TraceCheckUtils]: 26: Hoare triple {9335#(<= main_~v~0 1)} assume true; {9335#(<= main_~v~0 1)} is VALID [2018-11-18 22:47:21,289 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 + 4 * ~v~0, 4); {9335#(<= main_~v~0 1)} is VALID [2018-11-18 22:47:21,289 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-18 22:47:21,289 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-18 22:47:21,289 INFO L273 TraceCheckUtils]: 30: Hoare triple {9332#true} assume true; {9332#true} is VALID [2018-11-18 22:47:21,289 INFO L273 TraceCheckUtils]: 31: Hoare triple {9332#true} assume !!(~i~0 < ~size);call #t~mem1 := read~int(~set.base, ~set.offset + 4 * ~i~0, 4); {9332#true} is VALID [2018-11-18 22:47:21,290 INFO L273 TraceCheckUtils]: 32: Hoare triple {9332#true} assume #t~mem1 == ~value;havoc #t~mem1;#res := 1; {9332#true} is VALID [2018-11-18 22:47:21,290 INFO L273 TraceCheckUtils]: 33: Hoare triple {9332#true} assume true; {9332#true} is VALID [2018-11-18 22:47:21,291 INFO L268 TraceCheckUtils]: 34: Hoare quadruple {9332#true} {9335#(<= main_~v~0 1)} #132#return; {9335#(<= main_~v~0 1)} is VALID [2018-11-18 22:47:21,292 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-18 22:47:21,292 INFO L273 TraceCheckUtils]: 36: Hoare triple {9335#(<= main_~v~0 1)} assume !(0 == #t~ret8);havoc #t~ret8;havoc #t~mem7; {9335#(<= main_~v~0 1)} is VALID [2018-11-18 22:47:21,292 INFO L273 TraceCheckUtils]: 37: Hoare triple {9335#(<= main_~v~0 1)} #t~post6 := ~v~0;~v~0 := 1 + #t~post6;havoc #t~post6; {9336#(<= main_~v~0 2)} is VALID [2018-11-18 22:47:21,293 INFO L273 TraceCheckUtils]: 38: Hoare triple {9336#(<= main_~v~0 2)} assume true; {9336#(<= main_~v~0 2)} is VALID [2018-11-18 22:47:21,293 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 + 4 * ~v~0, 4); {9336#(<= main_~v~0 2)} is VALID [2018-11-18 22:47:21,293 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-18 22:47:21,293 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-18 22:47:21,293 INFO L273 TraceCheckUtils]: 42: Hoare triple {9332#true} assume true; {9332#true} is VALID [2018-11-18 22:47:21,294 INFO L273 TraceCheckUtils]: 43: Hoare triple {9332#true} assume !!(~i~0 < ~size);call #t~mem1 := read~int(~set.base, ~set.offset + 4 * ~i~0, 4); {9332#true} is VALID [2018-11-18 22:47:21,294 INFO L273 TraceCheckUtils]: 44: Hoare triple {9332#true} assume #t~mem1 == ~value;havoc #t~mem1;#res := 1; {9332#true} is VALID [2018-11-18 22:47:21,294 INFO L273 TraceCheckUtils]: 45: Hoare triple {9332#true} assume true; {9332#true} is VALID [2018-11-18 22:47:21,295 INFO L268 TraceCheckUtils]: 46: Hoare quadruple {9332#true} {9336#(<= main_~v~0 2)} #132#return; {9336#(<= main_~v~0 2)} is VALID [2018-11-18 22:47:21,296 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-18 22:47:21,296 INFO L273 TraceCheckUtils]: 48: Hoare triple {9336#(<= main_~v~0 2)} assume !(0 == #t~ret8);havoc #t~ret8;havoc #t~mem7; {9336#(<= main_~v~0 2)} is VALID [2018-11-18 22:47:21,297 INFO L273 TraceCheckUtils]: 49: Hoare triple {9336#(<= main_~v~0 2)} #t~post6 := ~v~0;~v~0 := 1 + #t~post6;havoc #t~post6; {9337#(<= main_~v~0 3)} is VALID [2018-11-18 22:47:21,297 INFO L273 TraceCheckUtils]: 50: Hoare triple {9337#(<= main_~v~0 3)} assume true; {9337#(<= main_~v~0 3)} is VALID [2018-11-18 22:47:21,297 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 + 4 * ~v~0, 4); {9337#(<= main_~v~0 3)} is VALID [2018-11-18 22:47:21,298 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-18 22:47:21,298 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-18 22:47:21,298 INFO L273 TraceCheckUtils]: 54: Hoare triple {9332#true} assume true; {9332#true} is VALID [2018-11-18 22:47:21,298 INFO L273 TraceCheckUtils]: 55: Hoare triple {9332#true} assume !!(~i~0 < ~size);call #t~mem1 := read~int(~set.base, ~set.offset + 4 * ~i~0, 4); {9332#true} is VALID [2018-11-18 22:47:21,298 INFO L273 TraceCheckUtils]: 56: Hoare triple {9332#true} assume #t~mem1 == ~value;havoc #t~mem1;#res := 1; {9332#true} is VALID [2018-11-18 22:47:21,298 INFO L273 TraceCheckUtils]: 57: Hoare triple {9332#true} assume true; {9332#true} is VALID [2018-11-18 22:47:21,299 INFO L268 TraceCheckUtils]: 58: Hoare quadruple {9332#true} {9337#(<= main_~v~0 3)} #132#return; {9337#(<= main_~v~0 3)} is VALID [2018-11-18 22:47:21,299 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-18 22:47:21,300 INFO L273 TraceCheckUtils]: 60: Hoare triple {9337#(<= main_~v~0 3)} assume !(0 == #t~ret8);havoc #t~ret8;havoc #t~mem7; {9337#(<= main_~v~0 3)} is VALID [2018-11-18 22:47:21,300 INFO L273 TraceCheckUtils]: 61: Hoare triple {9337#(<= main_~v~0 3)} #t~post6 := ~v~0;~v~0 := 1 + #t~post6;havoc #t~post6; {9338#(<= main_~v~0 4)} is VALID [2018-11-18 22:47:21,300 INFO L273 TraceCheckUtils]: 62: Hoare triple {9338#(<= main_~v~0 4)} assume true; {9338#(<= main_~v~0 4)} is VALID [2018-11-18 22:47:21,301 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 + 4 * ~v~0, 4); {9338#(<= main_~v~0 4)} is VALID [2018-11-18 22:47:21,301 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-18 22:47:21,301 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-18 22:47:21,301 INFO L273 TraceCheckUtils]: 66: Hoare triple {9332#true} assume true; {9332#true} is VALID [2018-11-18 22:47:21,301 INFO L273 TraceCheckUtils]: 67: Hoare triple {9332#true} assume !!(~i~0 < ~size);call #t~mem1 := read~int(~set.base, ~set.offset + 4 * ~i~0, 4); {9332#true} is VALID [2018-11-18 22:47:21,301 INFO L273 TraceCheckUtils]: 68: Hoare triple {9332#true} assume #t~mem1 == ~value;havoc #t~mem1;#res := 1; {9332#true} is VALID [2018-11-18 22:47:21,301 INFO L273 TraceCheckUtils]: 69: Hoare triple {9332#true} assume true; {9332#true} is VALID [2018-11-18 22:47:21,303 INFO L268 TraceCheckUtils]: 70: Hoare quadruple {9332#true} {9338#(<= main_~v~0 4)} #132#return; {9338#(<= main_~v~0 4)} is VALID [2018-11-18 22:47:21,303 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-18 22:47:21,303 INFO L273 TraceCheckUtils]: 72: Hoare triple {9338#(<= main_~v~0 4)} assume !(0 == #t~ret8);havoc #t~ret8;havoc #t~mem7; {9338#(<= main_~v~0 4)} is VALID [2018-11-18 22:47:21,304 INFO L273 TraceCheckUtils]: 73: Hoare triple {9338#(<= main_~v~0 4)} #t~post6 := ~v~0;~v~0 := 1 + #t~post6;havoc #t~post6; {9339#(<= main_~v~0 5)} is VALID [2018-11-18 22:47:21,305 INFO L273 TraceCheckUtils]: 74: Hoare triple {9339#(<= main_~v~0 5)} assume true; {9339#(<= main_~v~0 5)} is VALID [2018-11-18 22:47:21,305 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 + 4 * ~v~0, 4); {9339#(<= main_~v~0 5)} is VALID [2018-11-18 22:47:21,305 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-18 22:47:21,306 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-18 22:47:21,306 INFO L273 TraceCheckUtils]: 78: Hoare triple {9332#true} assume true; {9332#true} is VALID [2018-11-18 22:47:21,306 INFO L273 TraceCheckUtils]: 79: Hoare triple {9332#true} assume !!(~i~0 < ~size);call #t~mem1 := read~int(~set.base, ~set.offset + 4 * ~i~0, 4); {9332#true} is VALID [2018-11-18 22:47:21,306 INFO L273 TraceCheckUtils]: 80: Hoare triple {9332#true} assume #t~mem1 == ~value;havoc #t~mem1;#res := 1; {9332#true} is VALID [2018-11-18 22:47:21,306 INFO L273 TraceCheckUtils]: 81: Hoare triple {9332#true} assume true; {9332#true} is VALID [2018-11-18 22:47:21,308 INFO L268 TraceCheckUtils]: 82: Hoare quadruple {9332#true} {9339#(<= main_~v~0 5)} #132#return; {9339#(<= main_~v~0 5)} is VALID [2018-11-18 22:47:21,308 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-18 22:47:21,308 INFO L273 TraceCheckUtils]: 84: Hoare triple {9339#(<= main_~v~0 5)} assume !(0 == #t~ret8);havoc #t~ret8;havoc #t~mem7; {9339#(<= main_~v~0 5)} is VALID [2018-11-18 22:47:21,309 INFO L273 TraceCheckUtils]: 85: Hoare triple {9339#(<= main_~v~0 5)} #t~post6 := ~v~0;~v~0 := 1 + #t~post6;havoc #t~post6; {9340#(<= main_~v~0 6)} is VALID [2018-11-18 22:47:21,309 INFO L273 TraceCheckUtils]: 86: Hoare triple {9340#(<= main_~v~0 6)} assume true; {9340#(<= main_~v~0 6)} is VALID [2018-11-18 22:47:21,309 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 + 4 * ~v~0, 4); {9340#(<= main_~v~0 6)} is VALID [2018-11-18 22:47:21,309 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-18 22:47:21,310 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-18 22:47:21,310 INFO L273 TraceCheckUtils]: 90: Hoare triple {9332#true} assume true; {9332#true} is VALID [2018-11-18 22:47:21,310 INFO L273 TraceCheckUtils]: 91: Hoare triple {9332#true} assume !!(~i~0 < ~size);call #t~mem1 := read~int(~set.base, ~set.offset + 4 * ~i~0, 4); {9332#true} is VALID [2018-11-18 22:47:21,310 INFO L273 TraceCheckUtils]: 92: Hoare triple {9332#true} assume #t~mem1 == ~value;havoc #t~mem1;#res := 1; {9332#true} is VALID [2018-11-18 22:47:21,310 INFO L273 TraceCheckUtils]: 93: Hoare triple {9332#true} assume true; {9332#true} is VALID [2018-11-18 22:47:21,312 INFO L268 TraceCheckUtils]: 94: Hoare quadruple {9332#true} {9340#(<= main_~v~0 6)} #132#return; {9340#(<= main_~v~0 6)} is VALID [2018-11-18 22:47:21,312 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-18 22:47:21,313 INFO L273 TraceCheckUtils]: 96: Hoare triple {9340#(<= main_~v~0 6)} assume !(0 == #t~ret8);havoc #t~ret8;havoc #t~mem7; {9340#(<= main_~v~0 6)} is VALID [2018-11-18 22:47:21,313 INFO L273 TraceCheckUtils]: 97: Hoare triple {9340#(<= main_~v~0 6)} #t~post6 := ~v~0;~v~0 := 1 + #t~post6;havoc #t~post6; {9341#(<= main_~v~0 7)} is VALID [2018-11-18 22:47:21,313 INFO L273 TraceCheckUtils]: 98: Hoare triple {9341#(<= main_~v~0 7)} assume true; {9341#(<= main_~v~0 7)} is VALID [2018-11-18 22:47:21,314 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 + 4 * ~v~0, 4); {9341#(<= main_~v~0 7)} is VALID [2018-11-18 22:47:21,314 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-18 22:47:21,314 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-18 22:47:21,314 INFO L273 TraceCheckUtils]: 102: Hoare triple {9332#true} assume true; {9332#true} is VALID [2018-11-18 22:47:21,314 INFO L273 TraceCheckUtils]: 103: Hoare triple {9332#true} assume !!(~i~0 < ~size);call #t~mem1 := read~int(~set.base, ~set.offset + 4 * ~i~0, 4); {9332#true} is VALID [2018-11-18 22:47:21,314 INFO L273 TraceCheckUtils]: 104: Hoare triple {9332#true} assume !(#t~mem1 == ~value);havoc #t~mem1; {9332#true} is VALID [2018-11-18 22:47:21,315 INFO L273 TraceCheckUtils]: 105: Hoare triple {9332#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {9332#true} is VALID [2018-11-18 22:47:21,315 INFO L273 TraceCheckUtils]: 106: Hoare triple {9332#true} assume true; {9332#true} is VALID [2018-11-18 22:47:21,315 INFO L273 TraceCheckUtils]: 107: Hoare triple {9332#true} assume !(~i~0 < ~size); {9332#true} is VALID [2018-11-18 22:47:21,315 INFO L273 TraceCheckUtils]: 108: Hoare triple {9332#true} #res := 0; {9332#true} is VALID [2018-11-18 22:47:21,315 INFO L273 TraceCheckUtils]: 109: Hoare triple {9332#true} assume true; {9332#true} is VALID [2018-11-18 22:47:21,317 INFO L268 TraceCheckUtils]: 110: Hoare quadruple {9332#true} {9341#(<= main_~v~0 7)} #132#return; {9341#(<= main_~v~0 7)} is VALID [2018-11-18 22:47:21,317 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-18 22:47:21,317 INFO L273 TraceCheckUtils]: 112: Hoare triple {9341#(<= main_~v~0 7)} assume 0 == #t~ret8;havoc #t~ret8;havoc #t~mem7;call #t~mem9 := read~int(~#values~0.base, ~#values~0.offset + 4 * ~v~0, 4); {9341#(<= main_~v~0 7)} is VALID [2018-11-18 22:47:21,317 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-18 22:47:21,317 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 + 4 * ~size, 4);#res := 1 + ~size; {9332#true} is VALID [2018-11-18 22:47:21,318 INFO L273 TraceCheckUtils]: 115: Hoare triple {9332#true} assume true; {9332#true} is VALID [2018-11-18 22:47:21,318 INFO L268 TraceCheckUtils]: 116: Hoare quadruple {9332#true} {9341#(<= main_~v~0 7)} #134#return; {9341#(<= main_~v~0 7)} is VALID [2018-11-18 22:47:21,319 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-18 22:47:21,320 INFO L273 TraceCheckUtils]: 118: Hoare triple {9341#(<= main_~v~0 7)} #t~post6 := ~v~0;~v~0 := 1 + #t~post6;havoc #t~post6; {9342#(<= main_~v~0 8)} is VALID [2018-11-18 22:47:21,320 INFO L273 TraceCheckUtils]: 119: Hoare triple {9342#(<= main_~v~0 8)} assume true; {9342#(<= main_~v~0 8)} is VALID [2018-11-18 22:47:21,321 INFO L273 TraceCheckUtils]: 120: Hoare triple {9342#(<= main_~v~0 8)} assume !(~v~0 < 100000); {9333#false} is VALID [2018-11-18 22:47:21,321 INFO L273 TraceCheckUtils]: 121: Hoare triple {9333#false} ~x~0 := 0; {9333#false} is VALID [2018-11-18 22:47:21,321 INFO L273 TraceCheckUtils]: 122: Hoare triple {9333#false} assume true; {9333#false} is VALID [2018-11-18 22:47:21,321 INFO L273 TraceCheckUtils]: 123: Hoare triple {9333#false} assume !!(~x~0 < ~n~0);~y~0 := 1 + ~x~0; {9333#false} is VALID [2018-11-18 22:47:21,322 INFO L273 TraceCheckUtils]: 124: Hoare triple {9333#false} assume true; {9333#false} is VALID [2018-11-18 22:47:21,322 INFO L273 TraceCheckUtils]: 125: Hoare triple {9333#false} assume !!(~y~0 < ~n~0);call #t~mem13 := read~int(~#set~0.base, ~#set~0.offset + 4 * ~x~0, 4);call #t~mem14 := read~int(~#set~0.base, ~#set~0.offset + 4 * ~y~0, 4); {9333#false} is VALID [2018-11-18 22:47:21,322 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-18 22:47:21,322 INFO L273 TraceCheckUtils]: 127: Hoare triple {9333#false} ~cond := #in~cond; {9333#false} is VALID [2018-11-18 22:47:21,322 INFO L273 TraceCheckUtils]: 128: Hoare triple {9333#false} assume 0 == ~cond; {9333#false} is VALID [2018-11-18 22:47:21,323 INFO L273 TraceCheckUtils]: 129: Hoare triple {9333#false} assume !false; {9333#false} is VALID [2018-11-18 22:47:21,331 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-18 22:47:21,350 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-18 22:47:21,350 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 12 [2018-11-18 22:47:21,351 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 130 [2018-11-18 22:47:21,351 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-18 22:47:21,352 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states. [2018-11-18 22:47:21,448 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-18 22:47:21,448 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-11-18 22:47:21,448 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-11-18 22:47:21,448 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2018-11-18 22:47:21,449 INFO L87 Difference]: Start difference. First operand 216 states and 278 transitions. Second operand 12 states. [2018-11-18 22:47:22,695 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:47:22,696 INFO L93 Difference]: Finished difference Result 297 states and 383 transitions. [2018-11-18 22:47:22,696 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-18 22:47:22,696 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 130 [2018-11-18 22:47:22,696 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 22:47:22,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-11-18 22:47:22,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 164 transitions. [2018-11-18 22:47:22,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-11-18 22:47:22,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 164 transitions. [2018-11-18 22:47:22,701 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states and 164 transitions. [2018-11-18 22:47:23,328 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-18 22:47:23,336 INFO L225 Difference]: With dead ends: 297 [2018-11-18 22:47:23,336 INFO L226 Difference]: Without dead ends: 282 [2018-11-18 22:47:23,337 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 140 GetRequests, 130 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2018-11-18 22:47:23,338 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 282 states. [2018-11-18 22:47:23,667 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 282 to 242. [2018-11-18 22:47:23,667 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-18 22:47:23,667 INFO L82 GeneralOperation]: Start isEquivalent. First operand 282 states. Second operand 242 states. [2018-11-18 22:47:23,668 INFO L74 IsIncluded]: Start isIncluded. First operand 282 states. Second operand 242 states. [2018-11-18 22:47:23,668 INFO L87 Difference]: Start difference. First operand 282 states. Second operand 242 states. [2018-11-18 22:47:23,679 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:47:23,679 INFO L93 Difference]: Finished difference Result 282 states and 366 transitions. [2018-11-18 22:47:23,679 INFO L276 IsEmpty]: Start isEmpty. Operand 282 states and 366 transitions. [2018-11-18 22:47:23,681 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:47:23,681 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:47:23,681 INFO L74 IsIncluded]: Start isIncluded. First operand 242 states. Second operand 282 states. [2018-11-18 22:47:23,681 INFO L87 Difference]: Start difference. First operand 242 states. Second operand 282 states. [2018-11-18 22:47:23,693 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:47:23,694 INFO L93 Difference]: Finished difference Result 282 states and 366 transitions. [2018-11-18 22:47:23,694 INFO L276 IsEmpty]: Start isEmpty. Operand 282 states and 366 transitions. [2018-11-18 22:47:23,696 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:47:23,696 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:47:23,696 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-18 22:47:23,696 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-18 22:47:23,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 242 states. [2018-11-18 22:47:23,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 242 states to 242 states and 313 transitions. [2018-11-18 22:47:23,706 INFO L78 Accepts]: Start accepts. Automaton has 242 states and 313 transitions. Word has length 130 [2018-11-18 22:47:23,706 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 22:47:23,706 INFO L480 AbstractCegarLoop]: Abstraction has 242 states and 313 transitions. [2018-11-18 22:47:23,707 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-11-18 22:47:23,707 INFO L276 IsEmpty]: Start isEmpty. Operand 242 states and 313 transitions. [2018-11-18 22:47:23,709 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2018-11-18 22:47:23,709 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 22:47:23,710 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-18 22:47:23,710 INFO L423 AbstractCegarLoop]: === Iteration 12 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 22:47:23,710 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 22:47:23,710 INFO L82 PathProgramCache]: Analyzing trace with hash 932037010, now seen corresponding path program 3 times [2018-11-18 22:47:23,710 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 22:47:23,711 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 22:47:23,711 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 22:47:23,711 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 22:47:23,712 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 22:47:23,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:47:24,469 INFO L256 TraceCheckUtils]: 0: Hoare triple {11002#true} call ULTIMATE.init(); {11002#true} is VALID [2018-11-18 22:47:24,470 INFO L273 TraceCheckUtils]: 1: Hoare triple {11002#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {11002#true} is VALID [2018-11-18 22:47:24,470 INFO L273 TraceCheckUtils]: 2: Hoare triple {11002#true} assume true; {11002#true} is VALID [2018-11-18 22:47:24,470 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {11002#true} {11002#true} #126#return; {11002#true} is VALID [2018-11-18 22:47:24,471 INFO L256 TraceCheckUtils]: 4: Hoare triple {11002#true} call #t~ret15 := main(); {11002#true} is VALID [2018-11-18 22:47:24,471 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-18 22:47:24,471 INFO L273 TraceCheckUtils]: 6: Hoare triple {11002#true} assume true; {11002#true} is VALID [2018-11-18 22:47:24,471 INFO L273 TraceCheckUtils]: 7: Hoare triple {11002#true} assume !(~x~0 < ~n~0); {11002#true} is VALID [2018-11-18 22:47:24,472 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-18 22:47:24,472 INFO L273 TraceCheckUtils]: 9: Hoare triple {11004#(= main_~v~0 0)} assume true; {11004#(= main_~v~0 0)} is VALID [2018-11-18 22:47:24,472 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 + 4 * ~v~0, 4); {11004#(= main_~v~0 0)} is VALID [2018-11-18 22:47:24,472 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-18 22:47:24,473 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-18 22:47:24,473 INFO L273 TraceCheckUtils]: 13: Hoare triple {11002#true} assume true; {11002#true} is VALID [2018-11-18 22:47:24,473 INFO L273 TraceCheckUtils]: 14: Hoare triple {11002#true} assume !(~i~0 < ~size); {11002#true} is VALID [2018-11-18 22:47:24,473 INFO L273 TraceCheckUtils]: 15: Hoare triple {11002#true} #res := 0; {11002#true} is VALID [2018-11-18 22:47:24,473 INFO L273 TraceCheckUtils]: 16: Hoare triple {11002#true} assume true; {11002#true} is VALID [2018-11-18 22:47:24,474 INFO L268 TraceCheckUtils]: 17: Hoare quadruple {11002#true} {11004#(= main_~v~0 0)} #132#return; {11004#(= main_~v~0 0)} is VALID [2018-11-18 22:47:24,475 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-18 22:47:24,475 INFO L273 TraceCheckUtils]: 19: Hoare triple {11004#(= main_~v~0 0)} assume 0 == #t~ret8;havoc #t~ret8;havoc #t~mem7;call #t~mem9 := read~int(~#values~0.base, ~#values~0.offset + 4 * ~v~0, 4); {11004#(= main_~v~0 0)} is VALID [2018-11-18 22:47:24,475 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-18 22:47:24,475 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 + 4 * ~size, 4);#res := 1 + ~size; {11002#true} is VALID [2018-11-18 22:47:24,475 INFO L273 TraceCheckUtils]: 22: Hoare triple {11002#true} assume true; {11002#true} is VALID [2018-11-18 22:47:24,477 INFO L268 TraceCheckUtils]: 23: Hoare quadruple {11002#true} {11004#(= main_~v~0 0)} #134#return; {11004#(= main_~v~0 0)} is VALID [2018-11-18 22:47:24,477 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-18 22:47:24,478 INFO L273 TraceCheckUtils]: 25: Hoare triple {11004#(= main_~v~0 0)} #t~post6 := ~v~0;~v~0 := 1 + #t~post6;havoc #t~post6; {11005#(<= main_~v~0 1)} is VALID [2018-11-18 22:47:24,479 INFO L273 TraceCheckUtils]: 26: Hoare triple {11005#(<= main_~v~0 1)} assume true; {11005#(<= main_~v~0 1)} is VALID [2018-11-18 22:47:24,479 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 + 4 * ~v~0, 4); {11005#(<= main_~v~0 1)} is VALID [2018-11-18 22:47:24,479 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-18 22:47:24,480 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-18 22:47:24,480 INFO L273 TraceCheckUtils]: 30: Hoare triple {11002#true} assume true; {11002#true} is VALID [2018-11-18 22:47:24,480 INFO L273 TraceCheckUtils]: 31: Hoare triple {11002#true} assume !!(~i~0 < ~size);call #t~mem1 := read~int(~set.base, ~set.offset + 4 * ~i~0, 4); {11002#true} is VALID [2018-11-18 22:47:24,480 INFO L273 TraceCheckUtils]: 32: Hoare triple {11002#true} assume #t~mem1 == ~value;havoc #t~mem1;#res := 1; {11002#true} is VALID [2018-11-18 22:47:24,480 INFO L273 TraceCheckUtils]: 33: Hoare triple {11002#true} assume true; {11002#true} is VALID [2018-11-18 22:47:24,482 INFO L268 TraceCheckUtils]: 34: Hoare quadruple {11002#true} {11005#(<= main_~v~0 1)} #132#return; {11005#(<= main_~v~0 1)} is VALID [2018-11-18 22:47:24,482 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-18 22:47:24,483 INFO L273 TraceCheckUtils]: 36: Hoare triple {11005#(<= main_~v~0 1)} assume !(0 == #t~ret8);havoc #t~ret8;havoc #t~mem7; {11005#(<= main_~v~0 1)} is VALID [2018-11-18 22:47:24,483 INFO L273 TraceCheckUtils]: 37: Hoare triple {11005#(<= main_~v~0 1)} #t~post6 := ~v~0;~v~0 := 1 + #t~post6;havoc #t~post6; {11006#(<= main_~v~0 2)} is VALID [2018-11-18 22:47:24,483 INFO L273 TraceCheckUtils]: 38: Hoare triple {11006#(<= main_~v~0 2)} assume true; {11006#(<= main_~v~0 2)} is VALID [2018-11-18 22:47:24,484 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 + 4 * ~v~0, 4); {11006#(<= main_~v~0 2)} is VALID [2018-11-18 22:47:24,484 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-18 22:47:24,484 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-18 22:47:24,485 INFO L273 TraceCheckUtils]: 42: Hoare triple {11002#true} assume true; {11002#true} is VALID [2018-11-18 22:47:24,485 INFO L273 TraceCheckUtils]: 43: Hoare triple {11002#true} assume !!(~i~0 < ~size);call #t~mem1 := read~int(~set.base, ~set.offset + 4 * ~i~0, 4); {11002#true} is VALID [2018-11-18 22:47:24,485 INFO L273 TraceCheckUtils]: 44: Hoare triple {11002#true} assume #t~mem1 == ~value;havoc #t~mem1;#res := 1; {11002#true} is VALID [2018-11-18 22:47:24,485 INFO L273 TraceCheckUtils]: 45: Hoare triple {11002#true} assume true; {11002#true} is VALID [2018-11-18 22:47:24,487 INFO L268 TraceCheckUtils]: 46: Hoare quadruple {11002#true} {11006#(<= main_~v~0 2)} #132#return; {11006#(<= main_~v~0 2)} is VALID [2018-11-18 22:47:24,487 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-18 22:47:24,487 INFO L273 TraceCheckUtils]: 48: Hoare triple {11006#(<= main_~v~0 2)} assume !(0 == #t~ret8);havoc #t~ret8;havoc #t~mem7; {11006#(<= main_~v~0 2)} is VALID [2018-11-18 22:47:24,488 INFO L273 TraceCheckUtils]: 49: Hoare triple {11006#(<= main_~v~0 2)} #t~post6 := ~v~0;~v~0 := 1 + #t~post6;havoc #t~post6; {11007#(<= main_~v~0 3)} is VALID [2018-11-18 22:47:24,488 INFO L273 TraceCheckUtils]: 50: Hoare triple {11007#(<= main_~v~0 3)} assume true; {11007#(<= main_~v~0 3)} is VALID [2018-11-18 22:47:24,488 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 + 4 * ~v~0, 4); {11007#(<= main_~v~0 3)} is VALID [2018-11-18 22:47:24,489 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-18 22:47:24,489 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-18 22:47:24,489 INFO L273 TraceCheckUtils]: 54: Hoare triple {11002#true} assume true; {11002#true} is VALID [2018-11-18 22:47:24,489 INFO L273 TraceCheckUtils]: 55: Hoare triple {11002#true} assume !!(~i~0 < ~size);call #t~mem1 := read~int(~set.base, ~set.offset + 4 * ~i~0, 4); {11002#true} is VALID [2018-11-18 22:47:24,490 INFO L273 TraceCheckUtils]: 56: Hoare triple {11002#true} assume #t~mem1 == ~value;havoc #t~mem1;#res := 1; {11002#true} is VALID [2018-11-18 22:47:24,490 INFO L273 TraceCheckUtils]: 57: Hoare triple {11002#true} assume true; {11002#true} is VALID [2018-11-18 22:47:24,491 INFO L268 TraceCheckUtils]: 58: Hoare quadruple {11002#true} {11007#(<= main_~v~0 3)} #132#return; {11007#(<= main_~v~0 3)} is VALID [2018-11-18 22:47:24,492 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-18 22:47:24,492 INFO L273 TraceCheckUtils]: 60: Hoare triple {11007#(<= main_~v~0 3)} assume !(0 == #t~ret8);havoc #t~ret8;havoc #t~mem7; {11007#(<= main_~v~0 3)} is VALID [2018-11-18 22:47:24,492 INFO L273 TraceCheckUtils]: 61: Hoare triple {11007#(<= main_~v~0 3)} #t~post6 := ~v~0;~v~0 := 1 + #t~post6;havoc #t~post6; {11008#(<= main_~v~0 4)} is VALID [2018-11-18 22:47:24,493 INFO L273 TraceCheckUtils]: 62: Hoare triple {11008#(<= main_~v~0 4)} assume true; {11008#(<= main_~v~0 4)} is VALID [2018-11-18 22:47:24,493 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 + 4 * ~v~0, 4); {11008#(<= main_~v~0 4)} is VALID [2018-11-18 22:47:24,493 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-18 22:47:24,493 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-18 22:47:24,493 INFO L273 TraceCheckUtils]: 66: Hoare triple {11002#true} assume true; {11002#true} is VALID [2018-11-18 22:47:24,493 INFO L273 TraceCheckUtils]: 67: Hoare triple {11002#true} assume !!(~i~0 < ~size);call #t~mem1 := read~int(~set.base, ~set.offset + 4 * ~i~0, 4); {11002#true} is VALID [2018-11-18 22:47:24,494 INFO L273 TraceCheckUtils]: 68: Hoare triple {11002#true} assume #t~mem1 == ~value;havoc #t~mem1;#res := 1; {11002#true} is VALID [2018-11-18 22:47:24,494 INFO L273 TraceCheckUtils]: 69: Hoare triple {11002#true} assume true; {11002#true} is VALID [2018-11-18 22:47:24,496 INFO L268 TraceCheckUtils]: 70: Hoare quadruple {11002#true} {11008#(<= main_~v~0 4)} #132#return; {11008#(<= main_~v~0 4)} is VALID [2018-11-18 22:47:24,496 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-18 22:47:24,497 INFO L273 TraceCheckUtils]: 72: Hoare triple {11008#(<= main_~v~0 4)} assume !(0 == #t~ret8);havoc #t~ret8;havoc #t~mem7; {11008#(<= main_~v~0 4)} is VALID [2018-11-18 22:47:24,498 INFO L273 TraceCheckUtils]: 73: Hoare triple {11008#(<= main_~v~0 4)} #t~post6 := ~v~0;~v~0 := 1 + #t~post6;havoc #t~post6; {11009#(<= main_~v~0 5)} is VALID [2018-11-18 22:47:24,498 INFO L273 TraceCheckUtils]: 74: Hoare triple {11009#(<= main_~v~0 5)} assume true; {11009#(<= main_~v~0 5)} is VALID [2018-11-18 22:47:24,499 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 + 4 * ~v~0, 4); {11009#(<= main_~v~0 5)} is VALID [2018-11-18 22:47:24,499 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-18 22:47:24,499 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-18 22:47:24,499 INFO L273 TraceCheckUtils]: 78: Hoare triple {11002#true} assume true; {11002#true} is VALID [2018-11-18 22:47:24,499 INFO L273 TraceCheckUtils]: 79: Hoare triple {11002#true} assume !!(~i~0 < ~size);call #t~mem1 := read~int(~set.base, ~set.offset + 4 * ~i~0, 4); {11002#true} is VALID [2018-11-18 22:47:24,499 INFO L273 TraceCheckUtils]: 80: Hoare triple {11002#true} assume #t~mem1 == ~value;havoc #t~mem1;#res := 1; {11002#true} is VALID [2018-11-18 22:47:24,500 INFO L273 TraceCheckUtils]: 81: Hoare triple {11002#true} assume true; {11002#true} is VALID [2018-11-18 22:47:24,501 INFO L268 TraceCheckUtils]: 82: Hoare quadruple {11002#true} {11009#(<= main_~v~0 5)} #132#return; {11009#(<= main_~v~0 5)} is VALID [2018-11-18 22:47:24,502 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-18 22:47:24,503 INFO L273 TraceCheckUtils]: 84: Hoare triple {11009#(<= main_~v~0 5)} assume !(0 == #t~ret8);havoc #t~ret8;havoc #t~mem7; {11009#(<= main_~v~0 5)} is VALID [2018-11-18 22:47:24,504 INFO L273 TraceCheckUtils]: 85: Hoare triple {11009#(<= main_~v~0 5)} #t~post6 := ~v~0;~v~0 := 1 + #t~post6;havoc #t~post6; {11010#(<= main_~v~0 6)} is VALID [2018-11-18 22:47:24,504 INFO L273 TraceCheckUtils]: 86: Hoare triple {11010#(<= main_~v~0 6)} assume true; {11010#(<= main_~v~0 6)} is VALID [2018-11-18 22:47:24,505 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 + 4 * ~v~0, 4); {11010#(<= main_~v~0 6)} is VALID [2018-11-18 22:47:24,505 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-18 22:47:24,505 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-18 22:47:24,506 INFO L273 TraceCheckUtils]: 90: Hoare triple {11002#true} assume true; {11002#true} is VALID [2018-11-18 22:47:24,506 INFO L273 TraceCheckUtils]: 91: Hoare triple {11002#true} assume !!(~i~0 < ~size);call #t~mem1 := read~int(~set.base, ~set.offset + 4 * ~i~0, 4); {11002#true} is VALID [2018-11-18 22:47:24,506 INFO L273 TraceCheckUtils]: 92: Hoare triple {11002#true} assume #t~mem1 == ~value;havoc #t~mem1;#res := 1; {11002#true} is VALID [2018-11-18 22:47:24,507 INFO L273 TraceCheckUtils]: 93: Hoare triple {11002#true} assume true; {11002#true} is VALID [2018-11-18 22:47:24,518 INFO L268 TraceCheckUtils]: 94: Hoare quadruple {11002#true} {11010#(<= main_~v~0 6)} #132#return; {11010#(<= main_~v~0 6)} is VALID [2018-11-18 22:47:24,518 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-18 22:47:24,519 INFO L273 TraceCheckUtils]: 96: Hoare triple {11010#(<= main_~v~0 6)} assume !(0 == #t~ret8);havoc #t~ret8;havoc #t~mem7; {11010#(<= main_~v~0 6)} is VALID [2018-11-18 22:47:24,519 INFO L273 TraceCheckUtils]: 97: Hoare triple {11010#(<= main_~v~0 6)} #t~post6 := ~v~0;~v~0 := 1 + #t~post6;havoc #t~post6; {11011#(<= main_~v~0 7)} is VALID [2018-11-18 22:47:24,520 INFO L273 TraceCheckUtils]: 98: Hoare triple {11011#(<= main_~v~0 7)} assume true; {11011#(<= main_~v~0 7)} is VALID [2018-11-18 22:47:24,520 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 + 4 * ~v~0, 4); {11011#(<= main_~v~0 7)} is VALID [2018-11-18 22:47:24,520 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-18 22:47:24,520 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-18 22:47:24,520 INFO L273 TraceCheckUtils]: 102: Hoare triple {11002#true} assume true; {11002#true} is VALID [2018-11-18 22:47:24,521 INFO L273 TraceCheckUtils]: 103: Hoare triple {11002#true} assume !!(~i~0 < ~size);call #t~mem1 := read~int(~set.base, ~set.offset + 4 * ~i~0, 4); {11002#true} is VALID [2018-11-18 22:47:24,521 INFO L273 TraceCheckUtils]: 104: Hoare triple {11002#true} assume #t~mem1 == ~value;havoc #t~mem1;#res := 1; {11002#true} is VALID [2018-11-18 22:47:24,548 INFO L273 TraceCheckUtils]: 105: Hoare triple {11002#true} assume true; {11002#true} is VALID [2018-11-18 22:47:24,556 INFO L268 TraceCheckUtils]: 106: Hoare quadruple {11002#true} {11011#(<= main_~v~0 7)} #132#return; {11011#(<= main_~v~0 7)} is VALID [2018-11-18 22:47:24,556 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-18 22:47:24,558 INFO L273 TraceCheckUtils]: 108: Hoare triple {11011#(<= main_~v~0 7)} assume !(0 == #t~ret8);havoc #t~ret8;havoc #t~mem7; {11011#(<= main_~v~0 7)} is VALID [2018-11-18 22:47:24,558 INFO L273 TraceCheckUtils]: 109: Hoare triple {11011#(<= main_~v~0 7)} #t~post6 := ~v~0;~v~0 := 1 + #t~post6;havoc #t~post6; {11012#(<= main_~v~0 8)} is VALID [2018-11-18 22:47:24,562 INFO L273 TraceCheckUtils]: 110: Hoare triple {11012#(<= main_~v~0 8)} assume true; {11012#(<= main_~v~0 8)} is VALID [2018-11-18 22:47:24,562 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 + 4 * ~v~0, 4); {11012#(<= main_~v~0 8)} is VALID [2018-11-18 22:47:24,562 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-18 22:47:24,562 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-18 22:47:24,562 INFO L273 TraceCheckUtils]: 114: Hoare triple {11002#true} assume true; {11002#true} is VALID [2018-11-18 22:47:24,563 INFO L273 TraceCheckUtils]: 115: Hoare triple {11002#true} assume !!(~i~0 < ~size);call #t~mem1 := read~int(~set.base, ~set.offset + 4 * ~i~0, 4); {11002#true} is VALID [2018-11-18 22:47:24,563 INFO L273 TraceCheckUtils]: 116: Hoare triple {11002#true} assume !(#t~mem1 == ~value);havoc #t~mem1; {11002#true} is VALID [2018-11-18 22:47:24,563 INFO L273 TraceCheckUtils]: 117: Hoare triple {11002#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {11002#true} is VALID [2018-11-18 22:47:24,563 INFO L273 TraceCheckUtils]: 118: Hoare triple {11002#true} assume true; {11002#true} is VALID [2018-11-18 22:47:24,563 INFO L273 TraceCheckUtils]: 119: Hoare triple {11002#true} assume !(~i~0 < ~size); {11002#true} is VALID [2018-11-18 22:47:24,563 INFO L273 TraceCheckUtils]: 120: Hoare triple {11002#true} #res := 0; {11002#true} is VALID [2018-11-18 22:47:24,563 INFO L273 TraceCheckUtils]: 121: Hoare triple {11002#true} assume true; {11002#true} is VALID [2018-11-18 22:47:24,564 INFO L268 TraceCheckUtils]: 122: Hoare quadruple {11002#true} {11012#(<= main_~v~0 8)} #132#return; {11012#(<= main_~v~0 8)} is VALID [2018-11-18 22:47:24,565 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-18 22:47:24,565 INFO L273 TraceCheckUtils]: 124: Hoare triple {11012#(<= main_~v~0 8)} assume 0 == #t~ret8;havoc #t~ret8;havoc #t~mem7;call #t~mem9 := read~int(~#values~0.base, ~#values~0.offset + 4 * ~v~0, 4); {11012#(<= main_~v~0 8)} is VALID [2018-11-18 22:47:24,565 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-18 22:47:24,566 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 + 4 * ~size, 4);#res := 1 + ~size; {11002#true} is VALID [2018-11-18 22:47:24,566 INFO L273 TraceCheckUtils]: 127: Hoare triple {11002#true} assume true; {11002#true} is VALID [2018-11-18 22:47:24,566 INFO L268 TraceCheckUtils]: 128: Hoare quadruple {11002#true} {11012#(<= main_~v~0 8)} #134#return; {11012#(<= main_~v~0 8)} is VALID [2018-11-18 22:47:24,568 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-18 22:47:24,568 INFO L273 TraceCheckUtils]: 130: Hoare triple {11012#(<= main_~v~0 8)} #t~post6 := ~v~0;~v~0 := 1 + #t~post6;havoc #t~post6; {11013#(<= main_~v~0 9)} is VALID [2018-11-18 22:47:24,570 INFO L273 TraceCheckUtils]: 131: Hoare triple {11013#(<= main_~v~0 9)} assume true; {11013#(<= main_~v~0 9)} is VALID [2018-11-18 22:47:24,570 INFO L273 TraceCheckUtils]: 132: Hoare triple {11013#(<= main_~v~0 9)} assume !(~v~0 < 100000); {11003#false} is VALID [2018-11-18 22:47:24,571 INFO L273 TraceCheckUtils]: 133: Hoare triple {11003#false} ~x~0 := 0; {11003#false} is VALID [2018-11-18 22:47:24,571 INFO L273 TraceCheckUtils]: 134: Hoare triple {11003#false} assume true; {11003#false} is VALID [2018-11-18 22:47:24,571 INFO L273 TraceCheckUtils]: 135: Hoare triple {11003#false} assume !!(~x~0 < ~n~0);~y~0 := 1 + ~x~0; {11003#false} is VALID [2018-11-18 22:47:24,571 INFO L273 TraceCheckUtils]: 136: Hoare triple {11003#false} assume true; {11003#false} is VALID [2018-11-18 22:47:24,571 INFO L273 TraceCheckUtils]: 137: Hoare triple {11003#false} assume !!(~y~0 < ~n~0);call #t~mem13 := read~int(~#set~0.base, ~#set~0.offset + 4 * ~x~0, 4);call #t~mem14 := read~int(~#set~0.base, ~#set~0.offset + 4 * ~y~0, 4); {11003#false} is VALID [2018-11-18 22:47:24,571 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-18 22:47:24,571 INFO L273 TraceCheckUtils]: 139: Hoare triple {11003#false} ~cond := #in~cond; {11003#false} is VALID [2018-11-18 22:47:24,571 INFO L273 TraceCheckUtils]: 140: Hoare triple {11003#false} assume 0 == ~cond; {11003#false} is VALID [2018-11-18 22:47:24,572 INFO L273 TraceCheckUtils]: 141: Hoare triple {11003#false} assume !false; {11003#false} is VALID [2018-11-18 22:47:24,581 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-18 22:47:24,581 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 22:47:24,581 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-18 22:47:24,591 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-18 22:47:24,631 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-11-18 22:47:24,631 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-18 22:47:24,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:47:24,666 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 22:47:25,617 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-18 22:47:25,640 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-18 22:47:25,661 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-11-18 22:47:25,710 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-18 22:47:25,720 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2018-11-18 22:47:25,761 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-11-18 22:47:25,817 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-18 22:47:25,818 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 5 variables, input treesize:51, output treesize:104 [2018-11-18 22:47:25,828 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-18 22:47:27,127 WARN L180 SmtUtils]: Spent 1.21 s on a formula simplification. DAG size of input: 56 DAG size of output: 33 [2018-11-18 22:47:28,142 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-18 22:47:28,153 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-18 22:47:28,155 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 22:47:28,200 INFO L682 Elim1Store]: detected equality via solver [2018-11-18 22:47:28,204 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-18 22:47:28,207 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-18 22:47:28,246 INFO L682 Elim1Store]: detected equality via solver [2018-11-18 22:47:28,248 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-18 22:47:28,250 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-18 22:47:28,278 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-18 22:47:28,338 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-18 22:47:28,339 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 10 variables, input treesize:83, output treesize:4 [2018-11-18 22:47:28,344 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-18 22:47:28,429 INFO L256 TraceCheckUtils]: 0: Hoare triple {11002#true} call ULTIMATE.init(); {11002#true} is VALID [2018-11-18 22:47:28,429 INFO L273 TraceCheckUtils]: 1: Hoare triple {11002#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {11002#true} is VALID [2018-11-18 22:47:28,429 INFO L273 TraceCheckUtils]: 2: Hoare triple {11002#true} assume true; {11002#true} is VALID [2018-11-18 22:47:28,429 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {11002#true} {11002#true} #126#return; {11002#true} is VALID [2018-11-18 22:47:28,429 INFO L256 TraceCheckUtils]: 4: Hoare triple {11002#true} call #t~ret15 := main(); {11002#true} is VALID [2018-11-18 22:47:28,430 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-18 22:47:28,430 INFO L273 TraceCheckUtils]: 6: Hoare triple {11032#(= |main_~#set~0.offset| 0)} assume true; {11032#(= |main_~#set~0.offset| 0)} is VALID [2018-11-18 22:47:28,430 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-18 22:47:28,431 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-18 22:47:28,431 INFO L273 TraceCheckUtils]: 9: Hoare triple {11032#(= |main_~#set~0.offset| 0)} assume true; {11032#(= |main_~#set~0.offset| 0)} is VALID [2018-11-18 22:47:28,431 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 + 4 * ~v~0, 4); {11032#(= |main_~#set~0.offset| 0)} is VALID [2018-11-18 22:47:28,431 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-18 22:47:28,432 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-18 22:47:28,432 INFO L273 TraceCheckUtils]: 13: Hoare triple {11002#true} assume true; {11002#true} is VALID [2018-11-18 22:47:28,432 INFO L273 TraceCheckUtils]: 14: Hoare triple {11002#true} assume !(~i~0 < ~size); {11002#true} is VALID [2018-11-18 22:47:28,432 INFO L273 TraceCheckUtils]: 15: Hoare triple {11002#true} #res := 0; {11002#true} is VALID [2018-11-18 22:47:28,432 INFO L273 TraceCheckUtils]: 16: Hoare triple {11002#true} assume true; {11002#true} is VALID [2018-11-18 22:47:28,433 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-18 22:47:28,433 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-18 22:47:28,433 INFO L273 TraceCheckUtils]: 19: Hoare triple {11032#(= |main_~#set~0.offset| 0)} assume 0 == #t~ret8;havoc #t~ret8;havoc #t~mem7;call #t~mem9 := read~int(~#values~0.base, ~#values~0.offset + 4 * ~v~0, 4); {11032#(= |main_~#set~0.offset| 0)} is VALID [2018-11-18 22:47:28,433 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-18 22:47:28,434 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 + 4 * ~size, 4);#res := 1 + ~size; {11002#true} is VALID [2018-11-18 22:47:28,434 INFO L273 TraceCheckUtils]: 22: Hoare triple {11002#true} assume true; {11002#true} is VALID [2018-11-18 22:47:28,435 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-18 22:47:28,435 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-18 22:47:28,436 INFO L273 TraceCheckUtils]: 25: Hoare triple {11032#(= |main_~#set~0.offset| 0)} #t~post6 := ~v~0;~v~0 := 1 + #t~post6;havoc #t~post6; {11032#(= |main_~#set~0.offset| 0)} is VALID [2018-11-18 22:47:28,436 INFO L273 TraceCheckUtils]: 26: Hoare triple {11032#(= |main_~#set~0.offset| 0)} assume true; {11032#(= |main_~#set~0.offset| 0)} is VALID [2018-11-18 22:47:28,437 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 + 4 * ~v~0, 4); {11032#(= |main_~#set~0.offset| 0)} is VALID [2018-11-18 22:47:28,437 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-18 22:47:28,437 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-18 22:47:28,437 INFO L273 TraceCheckUtils]: 30: Hoare triple {11002#true} assume true; {11002#true} is VALID [2018-11-18 22:47:28,437 INFO L273 TraceCheckUtils]: 31: Hoare triple {11002#true} assume !!(~i~0 < ~size);call #t~mem1 := read~int(~set.base, ~set.offset + 4 * ~i~0, 4); {11002#true} is VALID [2018-11-18 22:47:28,438 INFO L273 TraceCheckUtils]: 32: Hoare triple {11002#true} assume #t~mem1 == ~value;havoc #t~mem1;#res := 1; {11002#true} is VALID [2018-11-18 22:47:28,438 INFO L273 TraceCheckUtils]: 33: Hoare triple {11002#true} assume true; {11002#true} is VALID [2018-11-18 22:47:28,439 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-18 22:47:28,440 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-18 22:47:28,440 INFO L273 TraceCheckUtils]: 36: Hoare triple {11032#(= |main_~#set~0.offset| 0)} assume !(0 == #t~ret8);havoc #t~ret8;havoc #t~mem7; {11032#(= |main_~#set~0.offset| 0)} is VALID [2018-11-18 22:47:28,441 INFO L273 TraceCheckUtils]: 37: Hoare triple {11032#(= |main_~#set~0.offset| 0)} #t~post6 := ~v~0;~v~0 := 1 + #t~post6;havoc #t~post6; {11032#(= |main_~#set~0.offset| 0)} is VALID [2018-11-18 22:47:28,441 INFO L273 TraceCheckUtils]: 38: Hoare triple {11032#(= |main_~#set~0.offset| 0)} assume true; {11032#(= |main_~#set~0.offset| 0)} is VALID [2018-11-18 22:47:28,442 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 + 4 * ~v~0, 4); {11032#(= |main_~#set~0.offset| 0)} is VALID [2018-11-18 22:47:28,442 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-18 22:47:28,442 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-18 22:47:28,442 INFO L273 TraceCheckUtils]: 42: Hoare triple {11002#true} assume true; {11002#true} is VALID [2018-11-18 22:47:28,442 INFO L273 TraceCheckUtils]: 43: Hoare triple {11002#true} assume !!(~i~0 < ~size);call #t~mem1 := read~int(~set.base, ~set.offset + 4 * ~i~0, 4); {11002#true} is VALID [2018-11-18 22:47:28,443 INFO L273 TraceCheckUtils]: 44: Hoare triple {11002#true} assume #t~mem1 == ~value;havoc #t~mem1;#res := 1; {11002#true} is VALID [2018-11-18 22:47:28,443 INFO L273 TraceCheckUtils]: 45: Hoare triple {11002#true} assume true; {11002#true} is VALID [2018-11-18 22:47:28,444 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-18 22:47:28,444 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-18 22:47:28,445 INFO L273 TraceCheckUtils]: 48: Hoare triple {11032#(= |main_~#set~0.offset| 0)} assume !(0 == #t~ret8);havoc #t~ret8;havoc #t~mem7; {11032#(= |main_~#set~0.offset| 0)} is VALID [2018-11-18 22:47:28,446 INFO L273 TraceCheckUtils]: 49: Hoare triple {11032#(= |main_~#set~0.offset| 0)} #t~post6 := ~v~0;~v~0 := 1 + #t~post6;havoc #t~post6; {11032#(= |main_~#set~0.offset| 0)} is VALID [2018-11-18 22:47:28,446 INFO L273 TraceCheckUtils]: 50: Hoare triple {11032#(= |main_~#set~0.offset| 0)} assume true; {11032#(= |main_~#set~0.offset| 0)} is VALID [2018-11-18 22:47:28,447 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 + 4 * ~v~0, 4); {11032#(= |main_~#set~0.offset| 0)} is VALID [2018-11-18 22:47:28,447 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-18 22:47:28,447 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-18 22:47:28,447 INFO L273 TraceCheckUtils]: 54: Hoare triple {11002#true} assume true; {11002#true} is VALID [2018-11-18 22:47:28,447 INFO L273 TraceCheckUtils]: 55: Hoare triple {11002#true} assume !!(~i~0 < ~size);call #t~mem1 := read~int(~set.base, ~set.offset + 4 * ~i~0, 4); {11002#true} is VALID [2018-11-18 22:47:28,448 INFO L273 TraceCheckUtils]: 56: Hoare triple {11002#true} assume #t~mem1 == ~value;havoc #t~mem1;#res := 1; {11002#true} is VALID [2018-11-18 22:47:28,448 INFO L273 TraceCheckUtils]: 57: Hoare triple {11002#true} assume true; {11002#true} is VALID [2018-11-18 22:47:28,449 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-18 22:47:28,449 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-18 22:47:28,450 INFO L273 TraceCheckUtils]: 60: Hoare triple {11032#(= |main_~#set~0.offset| 0)} assume !(0 == #t~ret8);havoc #t~ret8;havoc #t~mem7; {11032#(= |main_~#set~0.offset| 0)} is VALID [2018-11-18 22:47:28,450 INFO L273 TraceCheckUtils]: 61: Hoare triple {11032#(= |main_~#set~0.offset| 0)} #t~post6 := ~v~0;~v~0 := 1 + #t~post6;havoc #t~post6; {11032#(= |main_~#set~0.offset| 0)} is VALID [2018-11-18 22:47:28,451 INFO L273 TraceCheckUtils]: 62: Hoare triple {11032#(= |main_~#set~0.offset| 0)} assume true; {11032#(= |main_~#set~0.offset| 0)} is VALID [2018-11-18 22:47:28,452 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 + 4 * ~v~0, 4); {11032#(= |main_~#set~0.offset| 0)} is VALID [2018-11-18 22:47:28,452 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-18 22:47:28,452 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-18 22:47:28,452 INFO L273 TraceCheckUtils]: 66: Hoare triple {11002#true} assume true; {11002#true} is VALID [2018-11-18 22:47:28,452 INFO L273 TraceCheckUtils]: 67: Hoare triple {11002#true} assume !!(~i~0 < ~size);call #t~mem1 := read~int(~set.base, ~set.offset + 4 * ~i~0, 4); {11002#true} is VALID [2018-11-18 22:47:28,453 INFO L273 TraceCheckUtils]: 68: Hoare triple {11002#true} assume #t~mem1 == ~value;havoc #t~mem1;#res := 1; {11002#true} is VALID [2018-11-18 22:47:28,453 INFO L273 TraceCheckUtils]: 69: Hoare triple {11002#true} assume true; {11002#true} is VALID [2018-11-18 22:47:28,470 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-18 22:47:28,483 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-18 22:47:28,492 INFO L273 TraceCheckUtils]: 72: Hoare triple {11032#(= |main_~#set~0.offset| 0)} assume !(0 == #t~ret8);havoc #t~ret8;havoc #t~mem7; {11032#(= |main_~#set~0.offset| 0)} is VALID [2018-11-18 22:47:28,506 INFO L273 TraceCheckUtils]: 73: Hoare triple {11032#(= |main_~#set~0.offset| 0)} #t~post6 := ~v~0;~v~0 := 1 + #t~post6;havoc #t~post6; {11032#(= |main_~#set~0.offset| 0)} is VALID [2018-11-18 22:47:28,510 INFO L273 TraceCheckUtils]: 74: Hoare triple {11032#(= |main_~#set~0.offset| 0)} assume true; {11032#(= |main_~#set~0.offset| 0)} is VALID [2018-11-18 22:47:28,515 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 + 4 * ~v~0, 4); {11032#(= |main_~#set~0.offset| 0)} is VALID [2018-11-18 22:47:28,515 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-18 22:47:28,515 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-18 22:47:28,515 INFO L273 TraceCheckUtils]: 78: Hoare triple {11002#true} assume true; {11002#true} is VALID [2018-11-18 22:47:28,515 INFO L273 TraceCheckUtils]: 79: Hoare triple {11002#true} assume !!(~i~0 < ~size);call #t~mem1 := read~int(~set.base, ~set.offset + 4 * ~i~0, 4); {11002#true} is VALID [2018-11-18 22:47:28,515 INFO L273 TraceCheckUtils]: 80: Hoare triple {11002#true} assume #t~mem1 == ~value;havoc #t~mem1;#res := 1; {11002#true} is VALID [2018-11-18 22:47:28,516 INFO L273 TraceCheckUtils]: 81: Hoare triple {11002#true} assume true; {11002#true} is VALID [2018-11-18 22:47:28,516 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-18 22:47:28,518 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-18 22:47:28,519 INFO L273 TraceCheckUtils]: 84: Hoare triple {11032#(= |main_~#set~0.offset| 0)} assume !(0 == #t~ret8);havoc #t~ret8;havoc #t~mem7; {11032#(= |main_~#set~0.offset| 0)} is VALID [2018-11-18 22:47:28,522 INFO L273 TraceCheckUtils]: 85: Hoare triple {11032#(= |main_~#set~0.offset| 0)} #t~post6 := ~v~0;~v~0 := 1 + #t~post6;havoc #t~post6; {11032#(= |main_~#set~0.offset| 0)} is VALID [2018-11-18 22:47:28,522 INFO L273 TraceCheckUtils]: 86: Hoare triple {11032#(= |main_~#set~0.offset| 0)} assume true; {11032#(= |main_~#set~0.offset| 0)} is VALID [2018-11-18 22:47:28,524 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 + 4 * ~v~0, 4); {11032#(= |main_~#set~0.offset| 0)} is VALID [2018-11-18 22:47:28,524 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-18 22:47:28,524 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-18 22:47:28,524 INFO L273 TraceCheckUtils]: 90: Hoare triple {11002#true} assume true; {11002#true} is VALID [2018-11-18 22:47:28,524 INFO L273 TraceCheckUtils]: 91: Hoare triple {11002#true} assume !!(~i~0 < ~size);call #t~mem1 := read~int(~set.base, ~set.offset + 4 * ~i~0, 4); {11002#true} is VALID [2018-11-18 22:47:28,524 INFO L273 TraceCheckUtils]: 92: Hoare triple {11002#true} assume #t~mem1 == ~value;havoc #t~mem1;#res := 1; {11002#true} is VALID [2018-11-18 22:47:28,524 INFO L273 TraceCheckUtils]: 93: Hoare triple {11002#true} assume true; {11002#true} is VALID [2018-11-18 22:47:28,525 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-18 22:47:28,526 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-18 22:47:28,528 INFO L273 TraceCheckUtils]: 96: Hoare triple {11032#(= |main_~#set~0.offset| 0)} assume !(0 == #t~ret8);havoc #t~ret8;havoc #t~mem7; {11032#(= |main_~#set~0.offset| 0)} is VALID [2018-11-18 22:47:28,528 INFO L273 TraceCheckUtils]: 97: Hoare triple {11032#(= |main_~#set~0.offset| 0)} #t~post6 := ~v~0;~v~0 := 1 + #t~post6;havoc #t~post6; {11032#(= |main_~#set~0.offset| 0)} is VALID [2018-11-18 22:47:28,533 INFO L273 TraceCheckUtils]: 98: Hoare triple {11032#(= |main_~#set~0.offset| 0)} assume true; {11032#(= |main_~#set~0.offset| 0)} is VALID [2018-11-18 22:47:28,533 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 + 4 * ~v~0, 4); {11032#(= |main_~#set~0.offset| 0)} is VALID [2018-11-18 22:47:28,533 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-18 22:47:28,533 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-18 22:47:28,534 INFO L273 TraceCheckUtils]: 102: Hoare triple {11002#true} assume true; {11002#true} is VALID [2018-11-18 22:47:28,534 INFO L273 TraceCheckUtils]: 103: Hoare triple {11002#true} assume !!(~i~0 < ~size);call #t~mem1 := read~int(~set.base, ~set.offset + 4 * ~i~0, 4); {11002#true} is VALID [2018-11-18 22:47:28,535 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-18 22:47:28,535 INFO L273 TraceCheckUtils]: 105: Hoare triple {11330#(= |elem_exists_#res| 1)} assume true; {11330#(= |elem_exists_#res| 1)} is VALID [2018-11-18 22:47:28,537 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-18 22:47:28,537 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-18 22:47:28,539 INFO L273 TraceCheckUtils]: 108: Hoare triple {11337#(and (= 1 |main_#t~ret8|) (= |main_~#set~0.offset| 0))} assume !(0 == #t~ret8);havoc #t~ret8;havoc #t~mem7; {11032#(= |main_~#set~0.offset| 0)} is VALID [2018-11-18 22:47:28,539 INFO L273 TraceCheckUtils]: 109: Hoare triple {11032#(= |main_~#set~0.offset| 0)} #t~post6 := ~v~0;~v~0 := 1 + #t~post6;havoc #t~post6; {11032#(= |main_~#set~0.offset| 0)} is VALID [2018-11-18 22:47:28,541 INFO L273 TraceCheckUtils]: 110: Hoare triple {11032#(= |main_~#set~0.offset| 0)} assume true; {11032#(= |main_~#set~0.offset| 0)} is VALID [2018-11-18 22:47:28,542 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 + 4 * ~v~0, 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-18 22:47:28,542 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-18 22:47:28,543 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-18 22:47:28,544 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-18 22:47:28,545 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 + 4 * ~i~0, 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-18 22:47:28,547 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-18 22:47:28,548 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 := 1 + #t~post0;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-18 22:47:28,549 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-18 22:47:28,550 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-18 22:47:28,551 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-18 22:47:28,551 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-18 22:47:28,554 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-18 22:47:28,557 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-18 22:47:28,558 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 0 == #t~ret8;havoc #t~ret8;havoc #t~mem7;call #t~mem9 := read~int(~#values~0.base, ~#values~0.offset + 4 * ~v~0, 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-18 22:47:28,560 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-18 22:47:28,564 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 + 4 * ~size, 4);#res := 1 + ~size; {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-18 22:47:28,565 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-18 22:47:28,572 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-18 22:47:28,576 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-18 22:47:28,577 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 := 1 + #t~post6;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-18 22:47:28,577 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-18 22:47:28,579 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-18 22:47:28,580 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-18 22:47:28,581 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-18 22:47:28,582 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 := 1 + ~x~0; {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-18 22:47:28,582 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-18 22:47:28,584 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 + 4 * ~x~0, 4);call #t~mem14 := read~int(~#set~0.base, ~#set~0.offset + 4 * ~y~0, 4); {11445#(not (= |main_#t~mem14| |main_#t~mem13|))} is VALID [2018-11-18 22:47:28,586 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-18 22:47:28,586 INFO L273 TraceCheckUtils]: 139: Hoare triple {11449#(= |__VERIFIER_assert_#in~cond| 1)} ~cond := #in~cond; {11453#(= 1 __VERIFIER_assert_~cond)} is VALID [2018-11-18 22:47:28,587 INFO L273 TraceCheckUtils]: 140: Hoare triple {11453#(= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {11003#false} is VALID [2018-11-18 22:47:28,587 INFO L273 TraceCheckUtils]: 141: Hoare triple {11003#false} assume !false; {11003#false} is VALID [2018-11-18 22:47:28,635 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-18 22:47:28,665 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-18 22:47:28,666 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 22] total 32 [2018-11-18 22:47:28,666 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 142 [2018-11-18 22:47:28,680 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-18 22:47:28,680 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 32 states. [2018-11-18 22:47:29,853 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-18 22:47:29,853 INFO L459 AbstractCegarLoop]: Interpolant automaton has 32 states [2018-11-18 22:47:29,854 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2018-11-18 22:47:29,855 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=872, Unknown=0, NotChecked=0, Total=992 [2018-11-18 22:47:29,855 INFO L87 Difference]: Start difference. First operand 242 states and 313 transitions. Second operand 32 states. [2018-11-18 22:47:42,194 WARN L180 SmtUtils]: Spent 5.98 s on a formula simplification. DAG size of input: 44 DAG size of output: 42 [2018-11-18 22:47:52,065 WARN L180 SmtUtils]: Spent 3.65 s on a formula simplification. DAG size of input: 44 DAG size of output: 42 [2018-11-18 22:47:55,016 WARN L180 SmtUtils]: Spent 2.68 s on a formula simplification. DAG size of input: 46 DAG size of output: 46 [2018-11-18 22:47:55,553 WARN L180 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 47 [2018-11-18 22:48:08,855 WARN L180 SmtUtils]: Spent 7.90 s on a formula simplification. DAG size of input: 45 DAG size of output: 43 [2018-11-18 22:48:15,580 WARN L180 SmtUtils]: Spent 503.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 28 [2018-11-18 22:48:16,744 WARN L180 SmtUtils]: Spent 555.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 30 [2018-11-18 22:48:22,536 WARN L180 SmtUtils]: Spent 1.98 s on a formula simplification. DAG size of input: 45 DAG size of output: 43 [2018-11-18 22:48:24,164 WARN L180 SmtUtils]: Spent 1.27 s on a formula simplification. DAG size of input: 47 DAG size of output: 47 [2018-11-18 22:48:32,710 WARN L180 SmtUtils]: Spent 165.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 49 [2018-11-18 22:48:40,545 WARN L180 SmtUtils]: Spent 7.52 s on a formula simplification. DAG size of input: 44 DAG size of output: 42 [2018-11-18 22:48:46,805 WARN L180 SmtUtils]: Spent 224.00 ms on a formula simplification that was a NOOP. DAG size: 37 [2018-11-18 22:48:57,435 WARN L180 SmtUtils]: Spent 7.20 s on a formula simplification. DAG size of input: 45 DAG size of output: 43 [2018-11-18 22:49:05,662 WARN L180 SmtUtils]: Spent 146.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 30 [2018-11-18 22:49:14,519 WARN L180 SmtUtils]: Spent 7.98 s on a formula simplification. DAG size of input: 45 DAG size of output: 43 [2018-11-18 22:49:18,676 WARN L180 SmtUtils]: Spent 3.28 s on a formula simplification. DAG size of input: 47 DAG size of output: 47 [2018-11-18 22:49:31,730 WARN L180 SmtUtils]: Spent 3.94 s on a formula simplification. DAG size of input: 45 DAG size of output: 43 [2018-11-18 22:49:32,381 WARN L180 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 47 [2018-11-18 22:49:55,342 WARN L180 SmtUtils]: Spent 11.12 s on a formula simplification. DAG size of input: 45 DAG size of output: 43 [2018-11-18 22:49:57,313 WARN L180 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 28