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-industry-pattern/check_removal_from_set_after_insertion_false-unreach-call.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-18e5b2d-m [2018-11-18 23:01:26,130 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-18 23:01:26,132 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-18 23:01:26,144 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-18 23:01:26,145 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-18 23:01:26,146 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-18 23:01:26,147 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-18 23:01:26,149 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-18 23:01:26,150 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-18 23:01:26,151 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-18 23:01:26,152 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-18 23:01:26,152 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-18 23:01:26,153 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-18 23:01:26,154 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-18 23:01:26,156 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-18 23:01:26,157 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-18 23:01:26,160 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-18 23:01:26,165 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-18 23:01:26,167 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-18 23:01:26,169 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-18 23:01:26,171 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-18 23:01:26,172 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-18 23:01:26,175 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-18 23:01:26,175 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-18 23:01:26,175 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-18 23:01:26,176 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-18 23:01:26,177 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-18 23:01:26,177 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-18 23:01:26,178 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-18 23:01:26,179 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-18 23:01:26,179 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-18 23:01:26,180 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-18 23:01:26,180 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-18 23:01:26,180 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-18 23:01:26,183 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-18 23:01:26,184 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-18 23:01:26,184 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2018-11-18 23:01:26,203 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-18 23:01:26,204 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-18 23:01:26,204 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-18 23:01:26,205 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-11-18 23:01:26,205 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-18 23:01:26,206 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-18 23:01:26,208 INFO L133 SettingsManager]: * Use SBE=true [2018-11-18 23:01:26,208 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-18 23:01:26,209 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-18 23:01:26,209 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-18 23:01:26,209 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-18 23:01:26,210 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-18 23:01:26,210 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-18 23:01:26,210 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-18 23:01:26,210 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-18 23:01:26,210 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-18 23:01:26,210 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-18 23:01:26,211 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-18 23:01:26,211 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-18 23:01:26,211 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-18 23:01:26,211 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-18 23:01:26,211 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-18 23:01:26,212 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-18 23:01:26,212 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-18 23:01:26,212 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-18 23:01:26,212 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-18 23:01:26,212 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-18 23:01:26,214 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-18 23:01:26,214 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-18 23:01:26,214 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-18 23:01:26,214 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-18 23:01:26,284 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-18 23:01:26,300 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-18 23:01:26,305 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-18 23:01:26,306 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-18 23:01:26,307 INFO L276 PluginConnector]: CDTParser initialized [2018-11-18 23:01:26,307 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-industry-pattern/check_removal_from_set_after_insertion_false-unreach-call.i [2018-11-18 23:01:26,369 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/57cf8fd52/4d560e370e7d434ca36277bcbd0eedc6/FLAG47a0ec19b [2018-11-18 23:01:26,838 INFO L307 CDTParser]: Found 1 translation units. [2018-11-18 23:01:26,839 INFO L161 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/array-industry-pattern/check_removal_from_set_after_insertion_false-unreach-call.i [2018-11-18 23:01:26,846 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/57cf8fd52/4d560e370e7d434ca36277bcbd0eedc6/FLAG47a0ec19b [2018-11-18 23:01:27,210 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/57cf8fd52/4d560e370e7d434ca36277bcbd0eedc6 [2018-11-18 23:01:27,219 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-18 23:01:27,221 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-11-18 23:01:27,222 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-18 23:01:27,222 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-18 23:01:27,226 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-18 23:01:27,229 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 11:01:27" (1/1) ... [2018-11-18 23:01:27,233 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4efd777d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:01:27, skipping insertion in model container [2018-11-18 23:01:27,233 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 11:01:27" (1/1) ... [2018-11-18 23:01:27,244 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-18 23:01:27,273 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-18 23:01:27,496 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-18 23:01:27,511 INFO L191 MainTranslator]: Completed pre-run [2018-11-18 23:01:27,546 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-18 23:01:27,569 INFO L195 MainTranslator]: Completed translation [2018-11-18 23:01:27,570 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:01:27 WrapperNode [2018-11-18 23:01:27,570 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-18 23:01:27,571 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-18 23:01:27,571 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-18 23:01:27,571 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-18 23:01:27,588 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:01:27" (1/1) ... [2018-11-18 23:01:27,588 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:01:27" (1/1) ... [2018-11-18 23:01:27,599 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:01:27" (1/1) ... [2018-11-18 23:01:27,599 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:01:27" (1/1) ... [2018-11-18 23:01:27,613 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:01:27" (1/1) ... [2018-11-18 23:01:27,622 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:01:27" (1/1) ... [2018-11-18 23:01:27,625 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:01:27" (1/1) ... [2018-11-18 23:01:27,628 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-18 23:01:27,628 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-18 23:01:27,629 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-18 23:01:27,629 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-18 23:01:27,630 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:01:27" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-18 23:01:27,779 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-18 23:01:27,779 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-18 23:01:27,780 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2018-11-18 23:01:27,780 INFO L138 BoogieDeclarations]: Found implementation of procedure insert [2018-11-18 23:01:27,780 INFO L138 BoogieDeclarations]: Found implementation of procedure elem_exists [2018-11-18 23:01:27,780 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-18 23:01:27,780 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2018-11-18 23:01:27,780 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2018-11-18 23:01:27,781 INFO L130 BoogieDeclarations]: Found specification of procedure insert [2018-11-18 23:01:27,781 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-18 23:01:27,781 INFO L130 BoogieDeclarations]: Found specification of procedure elem_exists [2018-11-18 23:01:27,781 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-18 23:01:27,781 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-18 23:01:27,781 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-18 23:01:27,782 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-18 23:01:27,782 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-18 23:01:27,782 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-18 23:01:27,782 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2018-11-18 23:01:28,820 INFO L280 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-18 23:01:28,820 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 11:01:28 BoogieIcfgContainer [2018-11-18 23:01:28,821 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-18 23:01:28,822 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-18 23:01:28,822 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-18 23:01:28,825 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-18 23:01:28,826 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.11 11:01:27" (1/3) ... [2018-11-18 23:01:28,826 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@89f2c7c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 11:01:28, skipping insertion in model container [2018-11-18 23:01:28,827 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:01:27" (2/3) ... [2018-11-18 23:01:28,827 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@89f2c7c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 11:01:28, skipping insertion in model container [2018-11-18 23:01:28,827 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 11:01:28" (3/3) ... [2018-11-18 23:01:28,829 INFO L112 eAbstractionObserver]: Analyzing ICFG check_removal_from_set_after_insertion_false-unreach-call.i [2018-11-18 23:01:28,837 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-18 23:01:28,844 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-18 23:01:28,857 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-18 23:01:28,889 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-18 23:01:28,890 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-18 23:01:28,890 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-18 23:01:28,890 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-18 23:01:28,890 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-18 23:01:28,890 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-18 23:01:28,891 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-18 23:01:28,891 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-18 23:01:28,891 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-18 23:01:28,912 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states. [2018-11-18 23:01:28,919 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-11-18 23:01:28,920 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 23:01:28,921 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 23:01:28,923 INFO L423 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 23:01:28,930 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 23:01:28,930 INFO L82 PathProgramCache]: Analyzing trace with hash -702034144, now seen corresponding path program 1 times [2018-11-18 23:01:28,932 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 23:01:28,933 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 23:01:28,981 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 23:01:28,981 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 23:01:28,982 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 23:01:29,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 23:01:29,079 INFO L256 TraceCheckUtils]: 0: Hoare triple {54#true} call ULTIMATE.init(); {54#true} is VALID [2018-11-18 23:01:29,083 INFO L273 TraceCheckUtils]: 1: Hoare triple {54#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~SIZE~0 := 100000; {54#true} is VALID [2018-11-18 23:01:29,084 INFO L273 TraceCheckUtils]: 2: Hoare triple {54#true} assume true; {54#true} is VALID [2018-11-18 23:01:29,084 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {54#true} {54#true} #128#return; {54#true} is VALID [2018-11-18 23:01:29,084 INFO L256 TraceCheckUtils]: 4: Hoare triple {54#true} call #t~ret13 := main(); {54#true} is VALID [2018-11-18 23:01:29,085 INFO L273 TraceCheckUtils]: 5: Hoare triple {54#true} havoc ~i~1;havoc ~pos~0;~n~0 := 0;~found~0 := 0;call ~#set~0.base, ~#set~0.offset := #Ultimate.alloc(4 * ~SIZE~0);call ~#values~0.base, ~#values~0.offset := #Ultimate.alloc(4 * ~SIZE~0);havoc ~element~0;havoc ~v~0;~v~0 := 0; {54#true} is VALID [2018-11-18 23:01:29,086 INFO L273 TraceCheckUtils]: 6: Hoare triple {54#true} assume !true; {55#false} is VALID [2018-11-18 23:01:29,086 INFO L273 TraceCheckUtils]: 7: Hoare triple {55#false} ~i~1 := 0; {55#false} is VALID [2018-11-18 23:01:29,086 INFO L273 TraceCheckUtils]: 8: Hoare triple {55#false} assume !true; {55#false} is VALID [2018-11-18 23:01:29,087 INFO L273 TraceCheckUtils]: 9: Hoare triple {55#false} assume !(1 == ~found~0); {55#false} is VALID [2018-11-18 23:01:29,087 INFO L273 TraceCheckUtils]: 10: Hoare triple {55#false} assume 1 == ~found~0;~i~1 := 0; {55#false} is VALID [2018-11-18 23:01:29,087 INFO L273 TraceCheckUtils]: 11: Hoare triple {55#false} assume true; {55#false} is VALID [2018-11-18 23:01:29,088 INFO L273 TraceCheckUtils]: 12: Hoare triple {55#false} assume !!(~i~1 < ~SIZE~0 - 1);call #t~mem12 := read~int(~#set~0.base, ~#set~0.offset + 4 * ~i~1, 4); {55#false} is VALID [2018-11-18 23:01:29,088 INFO L256 TraceCheckUtils]: 13: Hoare triple {55#false} call __VERIFIER_assert((if #t~mem12 != ~element~0 then 1 else 0)); {55#false} is VALID [2018-11-18 23:01:29,088 INFO L273 TraceCheckUtils]: 14: Hoare triple {55#false} ~cond := #in~cond; {55#false} is VALID [2018-11-18 23:01:29,089 INFO L273 TraceCheckUtils]: 15: Hoare triple {55#false} assume 0 == ~cond; {55#false} is VALID [2018-11-18 23:01:29,089 INFO L273 TraceCheckUtils]: 16: Hoare triple {55#false} assume !false; {55#false} is VALID [2018-11-18 23:01:29,093 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 23:01:29,096 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 23:01:29,096 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-18 23:01:29,101 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 17 [2018-11-18 23:01:29,108 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-18 23:01:29,112 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states. [2018-11-18 23:01:29,190 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 17 edges. 17 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 23:01:29,190 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-11-18 23:01:29,200 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-18 23:01:29,200 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-18 23:01:29,203 INFO L87 Difference]: Start difference. First operand 51 states. Second operand 2 states. [2018-11-18 23:01:29,413 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 23:01:29,414 INFO L93 Difference]: Finished difference Result 96 states and 128 transitions. [2018-11-18 23:01:29,414 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-18 23:01:29,414 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 17 [2018-11-18 23:01:29,414 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 23:01:29,416 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-18 23:01:29,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 128 transitions. [2018-11-18 23:01:29,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-18 23:01:29,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 128 transitions. [2018-11-18 23:01:29,445 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 128 transitions. [2018-11-18 23:01:30,222 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 128 edges. 128 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 23:01:30,245 INFO L225 Difference]: With dead ends: 96 [2018-11-18 23:01:30,246 INFO L226 Difference]: Without dead ends: 46 [2018-11-18 23:01:30,251 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-18 23:01:30,266 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2018-11-18 23:01:30,307 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 46. [2018-11-18 23:01:30,307 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-18 23:01:30,307 INFO L82 GeneralOperation]: Start isEquivalent. First operand 46 states. Second operand 46 states. [2018-11-18 23:01:30,308 INFO L74 IsIncluded]: Start isIncluded. First operand 46 states. Second operand 46 states. [2018-11-18 23:01:30,308 INFO L87 Difference]: Start difference. First operand 46 states. Second operand 46 states. [2018-11-18 23:01:30,313 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 23:01:30,314 INFO L93 Difference]: Finished difference Result 46 states and 54 transitions. [2018-11-18 23:01:30,314 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 54 transitions. [2018-11-18 23:01:30,315 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 23:01:30,315 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 23:01:30,315 INFO L74 IsIncluded]: Start isIncluded. First operand 46 states. Second operand 46 states. [2018-11-18 23:01:30,316 INFO L87 Difference]: Start difference. First operand 46 states. Second operand 46 states. [2018-11-18 23:01:30,321 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 23:01:30,321 INFO L93 Difference]: Finished difference Result 46 states and 54 transitions. [2018-11-18 23:01:30,321 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 54 transitions. [2018-11-18 23:01:30,322 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 23:01:30,322 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 23:01:30,323 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-18 23:01:30,323 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-18 23:01:30,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2018-11-18 23:01:30,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 54 transitions. [2018-11-18 23:01:30,328 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 54 transitions. Word has length 17 [2018-11-18 23:01:30,329 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 23:01:30,329 INFO L480 AbstractCegarLoop]: Abstraction has 46 states and 54 transitions. [2018-11-18 23:01:30,329 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-11-18 23:01:30,329 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 54 transitions. [2018-11-18 23:01:30,331 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-11-18 23:01:30,331 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 23:01:30,331 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 23:01:30,331 INFO L423 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 23:01:30,332 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 23:01:30,332 INFO L82 PathProgramCache]: Analyzing trace with hash 424187696, now seen corresponding path program 1 times [2018-11-18 23:01:30,332 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 23:01:30,332 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 23:01:30,333 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 23:01:30,334 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 23:01:30,334 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 23:01:30,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 23:01:30,438 INFO L256 TraceCheckUtils]: 0: Hoare triple {333#true} call ULTIMATE.init(); {333#true} is VALID [2018-11-18 23:01:30,438 INFO L273 TraceCheckUtils]: 1: Hoare triple {333#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~SIZE~0 := 100000; {333#true} is VALID [2018-11-18 23:01:30,439 INFO L273 TraceCheckUtils]: 2: Hoare triple {333#true} assume true; {333#true} is VALID [2018-11-18 23:01:30,439 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {333#true} {333#true} #128#return; {333#true} is VALID [2018-11-18 23:01:30,439 INFO L256 TraceCheckUtils]: 4: Hoare triple {333#true} call #t~ret13 := main(); {333#true} is VALID [2018-11-18 23:01:30,440 INFO L273 TraceCheckUtils]: 5: Hoare triple {333#true} havoc ~i~1;havoc ~pos~0;~n~0 := 0;~found~0 := 0;call ~#set~0.base, ~#set~0.offset := #Ultimate.alloc(4 * ~SIZE~0);call ~#values~0.base, ~#values~0.offset := #Ultimate.alloc(4 * ~SIZE~0);havoc ~element~0;havoc ~v~0;~v~0 := 0; {333#true} is VALID [2018-11-18 23:01:30,440 INFO L273 TraceCheckUtils]: 6: Hoare triple {333#true} assume true; {333#true} is VALID [2018-11-18 23:01:30,440 INFO L273 TraceCheckUtils]: 7: Hoare triple {333#true} assume !(~v~0 < ~SIZE~0); {333#true} is VALID [2018-11-18 23:01:30,441 INFO L273 TraceCheckUtils]: 8: Hoare triple {333#true} ~i~1 := 0; {333#true} is VALID [2018-11-18 23:01:30,441 INFO L273 TraceCheckUtils]: 9: Hoare triple {333#true} assume true; {333#true} is VALID [2018-11-18 23:01:30,441 INFO L273 TraceCheckUtils]: 10: Hoare triple {333#true} assume !(~i~1 < ~SIZE~0 && 1 != ~found~0); {333#true} is VALID [2018-11-18 23:01:30,455 INFO L273 TraceCheckUtils]: 11: Hoare triple {333#true} assume !(1 == ~found~0); {335#(not (= 1 main_~found~0))} is VALID [2018-11-18 23:01:30,469 INFO L273 TraceCheckUtils]: 12: Hoare triple {335#(not (= 1 main_~found~0))} assume 1 == ~found~0;~i~1 := 0; {334#false} is VALID [2018-11-18 23:01:30,469 INFO L273 TraceCheckUtils]: 13: Hoare triple {334#false} assume true; {334#false} is VALID [2018-11-18 23:01:30,470 INFO L273 TraceCheckUtils]: 14: Hoare triple {334#false} assume !!(~i~1 < ~SIZE~0 - 1);call #t~mem12 := read~int(~#set~0.base, ~#set~0.offset + 4 * ~i~1, 4); {334#false} is VALID [2018-11-18 23:01:30,470 INFO L256 TraceCheckUtils]: 15: Hoare triple {334#false} call __VERIFIER_assert((if #t~mem12 != ~element~0 then 1 else 0)); {334#false} is VALID [2018-11-18 23:01:30,470 INFO L273 TraceCheckUtils]: 16: Hoare triple {334#false} ~cond := #in~cond; {334#false} is VALID [2018-11-18 23:01:30,471 INFO L273 TraceCheckUtils]: 17: Hoare triple {334#false} assume 0 == ~cond; {334#false} is VALID [2018-11-18 23:01:30,471 INFO L273 TraceCheckUtils]: 18: Hoare triple {334#false} assume !false; {334#false} is VALID [2018-11-18 23:01:30,475 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 23:01:30,476 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 23:01:30,476 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 23:01:30,478 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2018-11-18 23:01:30,478 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-18 23:01:30,478 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-18 23:01:30,534 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 19 edges. 19 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 23:01:30,534 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 23:01:30,535 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 23:01:30,535 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 23:01:30,536 INFO L87 Difference]: Start difference. First operand 46 states and 54 transitions. Second operand 3 states. [2018-11-18 23:01:30,825 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 23:01:30,826 INFO L93 Difference]: Finished difference Result 66 states and 77 transitions. [2018-11-18 23:01:30,826 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 23:01:30,826 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2018-11-18 23:01:30,826 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 23:01:30,827 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-18 23:01:30,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 77 transitions. [2018-11-18 23:01:30,832 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-18 23:01:30,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 77 transitions. [2018-11-18 23:01:30,836 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 77 transitions. [2018-11-18 23:01:31,048 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 77 edges. 77 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 23:01:31,052 INFO L225 Difference]: With dead ends: 66 [2018-11-18 23:01:31,052 INFO L226 Difference]: Without dead ends: 49 [2018-11-18 23:01:31,053 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 23:01:31,054 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2018-11-18 23:01:31,096 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2018-11-18 23:01:31,096 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-18 23:01:31,096 INFO L82 GeneralOperation]: Start isEquivalent. First operand 49 states. Second operand 49 states. [2018-11-18 23:01:31,097 INFO L74 IsIncluded]: Start isIncluded. First operand 49 states. Second operand 49 states. [2018-11-18 23:01:31,097 INFO L87 Difference]: Start difference. First operand 49 states. Second operand 49 states. [2018-11-18 23:01:31,101 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 23:01:31,101 INFO L93 Difference]: Finished difference Result 49 states and 56 transitions. [2018-11-18 23:01:31,101 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 56 transitions. [2018-11-18 23:01:31,102 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 23:01:31,102 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 23:01:31,103 INFO L74 IsIncluded]: Start isIncluded. First operand 49 states. Second operand 49 states. [2018-11-18 23:01:31,103 INFO L87 Difference]: Start difference. First operand 49 states. Second operand 49 states. [2018-11-18 23:01:31,106 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 23:01:31,106 INFO L93 Difference]: Finished difference Result 49 states and 56 transitions. [2018-11-18 23:01:31,106 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 56 transitions. [2018-11-18 23:01:31,107 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 23:01:31,108 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 23:01:31,108 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-18 23:01:31,108 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-18 23:01:31,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2018-11-18 23:01:31,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 56 transitions. [2018-11-18 23:01:31,111 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 56 transitions. Word has length 19 [2018-11-18 23:01:31,111 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 23:01:31,112 INFO L480 AbstractCegarLoop]: Abstraction has 49 states and 56 transitions. [2018-11-18 23:01:31,112 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 23:01:31,112 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 56 transitions. [2018-11-18 23:01:31,113 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-11-18 23:01:31,113 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 23:01:31,113 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] [2018-11-18 23:01:31,114 INFO L423 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 23:01:31,114 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 23:01:31,114 INFO L82 PathProgramCache]: Analyzing trace with hash -526617498, now seen corresponding path program 1 times [2018-11-18 23:01:31,114 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 23:01:31,114 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 23:01:31,116 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 23:01:31,116 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 23:01:31,116 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 23:01:31,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 23:01:31,345 INFO L256 TraceCheckUtils]: 0: Hoare triple {587#true} call ULTIMATE.init(); {587#true} is VALID [2018-11-18 23:01:31,349 INFO L273 TraceCheckUtils]: 1: Hoare triple {587#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~SIZE~0 := 100000; {589#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:01:31,351 INFO L273 TraceCheckUtils]: 2: Hoare triple {589#(<= 100000 ~SIZE~0)} assume true; {589#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:01:31,370 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {589#(<= 100000 ~SIZE~0)} {587#true} #128#return; {589#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:01:31,375 INFO L256 TraceCheckUtils]: 4: Hoare triple {589#(<= 100000 ~SIZE~0)} call #t~ret13 := main(); {589#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:01:31,376 INFO L273 TraceCheckUtils]: 5: Hoare triple {589#(<= 100000 ~SIZE~0)} havoc ~i~1;havoc ~pos~0;~n~0 := 0;~found~0 := 0;call ~#set~0.base, ~#set~0.offset := #Ultimate.alloc(4 * ~SIZE~0);call ~#values~0.base, ~#values~0.offset := #Ultimate.alloc(4 * ~SIZE~0);havoc ~element~0;havoc ~v~0;~v~0 := 0; {589#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:01:31,381 INFO L273 TraceCheckUtils]: 6: Hoare triple {589#(<= 100000 ~SIZE~0)} assume true; {589#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:01:31,381 INFO L273 TraceCheckUtils]: 7: Hoare triple {589#(<= 100000 ~SIZE~0)} assume !(~v~0 < ~SIZE~0); {589#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:01:31,382 INFO L273 TraceCheckUtils]: 8: Hoare triple {589#(<= 100000 ~SIZE~0)} ~i~1 := 0; {590#(and (= 0 main_~i~1) (<= 100000 ~SIZE~0))} is VALID [2018-11-18 23:01:31,383 INFO L273 TraceCheckUtils]: 9: Hoare triple {590#(and (= 0 main_~i~1) (<= 100000 ~SIZE~0))} assume true; {590#(and (= 0 main_~i~1) (<= 100000 ~SIZE~0))} is VALID [2018-11-18 23:01:31,393 INFO L273 TraceCheckUtils]: 10: Hoare triple {590#(and (= 0 main_~i~1) (<= 100000 ~SIZE~0))} assume !!(~i~1 < ~SIZE~0 && 1 != ~found~0);call #t~mem8 := read~int(~#set~0.base, ~#set~0.offset + 4 * ~i~1, 4); {590#(and (= 0 main_~i~1) (<= 100000 ~SIZE~0))} is VALID [2018-11-18 23:01:31,404 INFO L273 TraceCheckUtils]: 11: Hoare triple {590#(and (= 0 main_~i~1) (<= 100000 ~SIZE~0))} assume #t~mem8 == ~element~0;havoc #t~mem8;~found~0 := 1;~pos~0 := ~i~1; {591#(and (= 0 main_~pos~0) (<= 100000 ~SIZE~0))} is VALID [2018-11-18 23:01:31,405 INFO L273 TraceCheckUtils]: 12: Hoare triple {591#(and (= 0 main_~pos~0) (<= 100000 ~SIZE~0))} #t~post7 := ~i~1;~i~1 := 1 + #t~post7;havoc #t~post7; {591#(and (= 0 main_~pos~0) (<= 100000 ~SIZE~0))} is VALID [2018-11-18 23:01:31,406 INFO L273 TraceCheckUtils]: 13: Hoare triple {591#(and (= 0 main_~pos~0) (<= 100000 ~SIZE~0))} assume true; {591#(and (= 0 main_~pos~0) (<= 100000 ~SIZE~0))} is VALID [2018-11-18 23:01:31,408 INFO L273 TraceCheckUtils]: 14: Hoare triple {591#(and (= 0 main_~pos~0) (<= 100000 ~SIZE~0))} assume !(~i~1 < ~SIZE~0 && 1 != ~found~0); {591#(and (= 0 main_~pos~0) (<= 100000 ~SIZE~0))} is VALID [2018-11-18 23:01:31,412 INFO L273 TraceCheckUtils]: 15: Hoare triple {591#(and (= 0 main_~pos~0) (<= 100000 ~SIZE~0))} assume 1 == ~found~0;~i~1 := ~pos~0; {590#(and (= 0 main_~i~1) (<= 100000 ~SIZE~0))} is VALID [2018-11-18 23:01:31,413 INFO L273 TraceCheckUtils]: 16: Hoare triple {590#(and (= 0 main_~i~1) (<= 100000 ~SIZE~0))} assume true; {590#(and (= 0 main_~i~1) (<= 100000 ~SIZE~0))} is VALID [2018-11-18 23:01:31,414 INFO L273 TraceCheckUtils]: 17: Hoare triple {590#(and (= 0 main_~i~1) (<= 100000 ~SIZE~0))} assume !(~i~1 < ~SIZE~0 - 1); {588#false} is VALID [2018-11-18 23:01:31,414 INFO L273 TraceCheckUtils]: 18: Hoare triple {588#false} assume 1 == ~found~0;~i~1 := 0; {588#false} is VALID [2018-11-18 23:01:31,414 INFO L273 TraceCheckUtils]: 19: Hoare triple {588#false} assume true; {588#false} is VALID [2018-11-18 23:01:31,414 INFO L273 TraceCheckUtils]: 20: Hoare triple {588#false} assume !!(~i~1 < ~SIZE~0 - 1);call #t~mem12 := read~int(~#set~0.base, ~#set~0.offset + 4 * ~i~1, 4); {588#false} is VALID [2018-11-18 23:01:31,415 INFO L256 TraceCheckUtils]: 21: Hoare triple {588#false} call __VERIFIER_assert((if #t~mem12 != ~element~0 then 1 else 0)); {588#false} is VALID [2018-11-18 23:01:31,415 INFO L273 TraceCheckUtils]: 22: Hoare triple {588#false} ~cond := #in~cond; {588#false} is VALID [2018-11-18 23:01:31,415 INFO L273 TraceCheckUtils]: 23: Hoare triple {588#false} assume 0 == ~cond; {588#false} is VALID [2018-11-18 23:01:31,415 INFO L273 TraceCheckUtils]: 24: Hoare triple {588#false} assume !false; {588#false} is VALID [2018-11-18 23:01:31,419 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 23:01:31,419 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 23:01:31,419 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-18 23:01:31,437 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 23:01:31,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 23:01:31,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 23:01:31,488 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 23:01:31,618 INFO L256 TraceCheckUtils]: 0: Hoare triple {587#true} call ULTIMATE.init(); {587#true} is VALID [2018-11-18 23:01:31,621 INFO L273 TraceCheckUtils]: 1: Hoare triple {587#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~SIZE~0 := 100000; {589#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:01:31,624 INFO L273 TraceCheckUtils]: 2: Hoare triple {589#(<= 100000 ~SIZE~0)} assume true; {589#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:01:31,624 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {589#(<= 100000 ~SIZE~0)} {587#true} #128#return; {589#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:01:31,625 INFO L256 TraceCheckUtils]: 4: Hoare triple {589#(<= 100000 ~SIZE~0)} call #t~ret13 := main(); {589#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:01:31,626 INFO L273 TraceCheckUtils]: 5: Hoare triple {589#(<= 100000 ~SIZE~0)} havoc ~i~1;havoc ~pos~0;~n~0 := 0;~found~0 := 0;call ~#set~0.base, ~#set~0.offset := #Ultimate.alloc(4 * ~SIZE~0);call ~#values~0.base, ~#values~0.offset := #Ultimate.alloc(4 * ~SIZE~0);havoc ~element~0;havoc ~v~0;~v~0 := 0; {610#(and (<= main_~v~0 0) (<= 100000 ~SIZE~0))} is VALID [2018-11-18 23:01:31,627 INFO L273 TraceCheckUtils]: 6: Hoare triple {610#(and (<= main_~v~0 0) (<= 100000 ~SIZE~0))} assume true; {610#(and (<= main_~v~0 0) (<= 100000 ~SIZE~0))} is VALID [2018-11-18 23:01:31,628 INFO L273 TraceCheckUtils]: 7: Hoare triple {610#(and (<= main_~v~0 0) (<= 100000 ~SIZE~0))} assume !(~v~0 < ~SIZE~0); {588#false} is VALID [2018-11-18 23:01:31,628 INFO L273 TraceCheckUtils]: 8: Hoare triple {588#false} ~i~1 := 0; {588#false} is VALID [2018-11-18 23:01:31,628 INFO L273 TraceCheckUtils]: 9: Hoare triple {588#false} assume true; {588#false} is VALID [2018-11-18 23:01:31,628 INFO L273 TraceCheckUtils]: 10: Hoare triple {588#false} assume !!(~i~1 < ~SIZE~0 && 1 != ~found~0);call #t~mem8 := read~int(~#set~0.base, ~#set~0.offset + 4 * ~i~1, 4); {588#false} is VALID [2018-11-18 23:01:31,629 INFO L273 TraceCheckUtils]: 11: Hoare triple {588#false} assume #t~mem8 == ~element~0;havoc #t~mem8;~found~0 := 1;~pos~0 := ~i~1; {588#false} is VALID [2018-11-18 23:01:31,629 INFO L273 TraceCheckUtils]: 12: Hoare triple {588#false} #t~post7 := ~i~1;~i~1 := 1 + #t~post7;havoc #t~post7; {588#false} is VALID [2018-11-18 23:01:31,629 INFO L273 TraceCheckUtils]: 13: Hoare triple {588#false} assume true; {588#false} is VALID [2018-11-18 23:01:31,629 INFO L273 TraceCheckUtils]: 14: Hoare triple {588#false} assume !(~i~1 < ~SIZE~0 && 1 != ~found~0); {588#false} is VALID [2018-11-18 23:01:31,630 INFO L273 TraceCheckUtils]: 15: Hoare triple {588#false} assume 1 == ~found~0;~i~1 := ~pos~0; {588#false} is VALID [2018-11-18 23:01:31,630 INFO L273 TraceCheckUtils]: 16: Hoare triple {588#false} assume true; {588#false} is VALID [2018-11-18 23:01:31,631 INFO L273 TraceCheckUtils]: 17: Hoare triple {588#false} assume !(~i~1 < ~SIZE~0 - 1); {588#false} is VALID [2018-11-18 23:01:31,631 INFO L273 TraceCheckUtils]: 18: Hoare triple {588#false} assume 1 == ~found~0;~i~1 := 0; {588#false} is VALID [2018-11-18 23:01:31,632 INFO L273 TraceCheckUtils]: 19: Hoare triple {588#false} assume true; {588#false} is VALID [2018-11-18 23:01:31,632 INFO L273 TraceCheckUtils]: 20: Hoare triple {588#false} assume !!(~i~1 < ~SIZE~0 - 1);call #t~mem12 := read~int(~#set~0.base, ~#set~0.offset + 4 * ~i~1, 4); {588#false} is VALID [2018-11-18 23:01:31,632 INFO L256 TraceCheckUtils]: 21: Hoare triple {588#false} call __VERIFIER_assert((if #t~mem12 != ~element~0 then 1 else 0)); {588#false} is VALID [2018-11-18 23:01:31,633 INFO L273 TraceCheckUtils]: 22: Hoare triple {588#false} ~cond := #in~cond; {588#false} is VALID [2018-11-18 23:01:31,633 INFO L273 TraceCheckUtils]: 23: Hoare triple {588#false} assume 0 == ~cond; {588#false} is VALID [2018-11-18 23:01:31,633 INFO L273 TraceCheckUtils]: 24: Hoare triple {588#false} assume !false; {588#false} is VALID [2018-11-18 23:01:31,635 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-11-18 23:01:31,654 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-18 23:01:31,654 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 6 [2018-11-18 23:01:31,655 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 25 [2018-11-18 23:01:31,656 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-18 23:01:31,656 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2018-11-18 23:01:31,811 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 37 edges. 37 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 23:01:31,811 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-18 23:01:31,811 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-18 23:01:31,812 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-11-18 23:01:31,812 INFO L87 Difference]: Start difference. First operand 49 states and 56 transitions. Second operand 6 states. [2018-11-18 23:01:32,835 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 23:01:32,835 INFO L93 Difference]: Finished difference Result 115 states and 137 transitions. [2018-11-18 23:01:32,835 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-18 23:01:32,836 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 25 [2018-11-18 23:01:32,836 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 23:01:32,836 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-18 23:01:32,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 129 transitions. [2018-11-18 23:01:32,841 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-18 23:01:32,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 129 transitions. [2018-11-18 23:01:32,846 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 129 transitions. [2018-11-18 23:01:33,120 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 129 edges. 129 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 23:01:33,126 INFO L225 Difference]: With dead ends: 115 [2018-11-18 23:01:33,126 INFO L226 Difference]: Without dead ends: 91 [2018-11-18 23:01:33,127 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 25 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-11-18 23:01:33,127 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2018-11-18 23:01:33,206 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 60. [2018-11-18 23:01:33,206 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-18 23:01:33,206 INFO L82 GeneralOperation]: Start isEquivalent. First operand 91 states. Second operand 60 states. [2018-11-18 23:01:33,206 INFO L74 IsIncluded]: Start isIncluded. First operand 91 states. Second operand 60 states. [2018-11-18 23:01:33,207 INFO L87 Difference]: Start difference. First operand 91 states. Second operand 60 states. [2018-11-18 23:01:33,213 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 23:01:33,214 INFO L93 Difference]: Finished difference Result 91 states and 108 transitions. [2018-11-18 23:01:33,214 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 108 transitions. [2018-11-18 23:01:33,215 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 23:01:33,215 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 23:01:33,216 INFO L74 IsIncluded]: Start isIncluded. First operand 60 states. Second operand 91 states. [2018-11-18 23:01:33,216 INFO L87 Difference]: Start difference. First operand 60 states. Second operand 91 states. [2018-11-18 23:01:33,222 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 23:01:33,222 INFO L93 Difference]: Finished difference Result 91 states and 108 transitions. [2018-11-18 23:01:33,222 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 108 transitions. [2018-11-18 23:01:33,223 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 23:01:33,224 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 23:01:33,224 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-18 23:01:33,224 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-18 23:01:33,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2018-11-18 23:01:33,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 69 transitions. [2018-11-18 23:01:33,227 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 69 transitions. Word has length 25 [2018-11-18 23:01:33,228 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 23:01:33,228 INFO L480 AbstractCegarLoop]: Abstraction has 60 states and 69 transitions. [2018-11-18 23:01:33,228 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-18 23:01:33,228 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 69 transitions. [2018-11-18 23:01:33,229 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-11-18 23:01:33,230 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 23:01:33,230 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 23:01:33,230 INFO L423 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 23:01:33,230 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 23:01:33,231 INFO L82 PathProgramCache]: Analyzing trace with hash -1730110829, now seen corresponding path program 1 times [2018-11-18 23:01:33,231 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 23:01:33,231 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 23:01:33,232 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 23:01:33,232 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 23:01:33,232 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 23:01:33,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 23:01:33,328 INFO L256 TraceCheckUtils]: 0: Hoare triple {1082#true} call ULTIMATE.init(); {1082#true} is VALID [2018-11-18 23:01:33,328 INFO L273 TraceCheckUtils]: 1: Hoare triple {1082#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~SIZE~0 := 100000; {1082#true} is VALID [2018-11-18 23:01:33,329 INFO L273 TraceCheckUtils]: 2: Hoare triple {1082#true} assume true; {1082#true} is VALID [2018-11-18 23:01:33,329 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1082#true} {1082#true} #128#return; {1082#true} is VALID [2018-11-18 23:01:33,329 INFO L256 TraceCheckUtils]: 4: Hoare triple {1082#true} call #t~ret13 := main(); {1082#true} is VALID [2018-11-18 23:01:33,330 INFO L273 TraceCheckUtils]: 5: Hoare triple {1082#true} havoc ~i~1;havoc ~pos~0;~n~0 := 0;~found~0 := 0;call ~#set~0.base, ~#set~0.offset := #Ultimate.alloc(4 * ~SIZE~0);call ~#values~0.base, ~#values~0.offset := #Ultimate.alloc(4 * ~SIZE~0);havoc ~element~0;havoc ~v~0;~v~0 := 0; {1082#true} is VALID [2018-11-18 23:01:33,330 INFO L273 TraceCheckUtils]: 6: Hoare triple {1082#true} assume true; {1082#true} is VALID [2018-11-18 23:01:33,330 INFO L273 TraceCheckUtils]: 7: Hoare triple {1082#true} assume !!(~v~0 < ~SIZE~0);call #t~mem3 := read~int(~#values~0.base, ~#values~0.offset + 4 * ~v~0, 4); {1082#true} is VALID [2018-11-18 23:01:33,330 INFO L256 TraceCheckUtils]: 8: Hoare triple {1082#true} call #t~ret4 := elem_exists(~#set~0.base, ~#set~0.offset, ~n~0, #t~mem3); {1082#true} is VALID [2018-11-18 23:01:33,331 INFO L273 TraceCheckUtils]: 9: Hoare triple {1082#true} ~set.base, ~set.offset := #in~set.base, #in~set.offset;~size := #in~size;~value := #in~value;havoc ~i~0;~i~0 := 0; {1082#true} is VALID [2018-11-18 23:01:33,331 INFO L273 TraceCheckUtils]: 10: Hoare triple {1082#true} assume true; {1082#true} is VALID [2018-11-18 23:01:33,331 INFO L273 TraceCheckUtils]: 11: Hoare triple {1082#true} assume !(~i~0 < ~size); {1082#true} is VALID [2018-11-18 23:01:33,332 INFO L273 TraceCheckUtils]: 12: Hoare triple {1082#true} #res := 0; {1084#(= 0 |elem_exists_#res|)} is VALID [2018-11-18 23:01:33,335 INFO L273 TraceCheckUtils]: 13: Hoare triple {1084#(= 0 |elem_exists_#res|)} assume true; {1084#(= 0 |elem_exists_#res|)} is VALID [2018-11-18 23:01:33,337 INFO L268 TraceCheckUtils]: 14: Hoare quadruple {1084#(= 0 |elem_exists_#res|)} {1082#true} #132#return; {1085#(= |main_#t~ret4| 0)} is VALID [2018-11-18 23:01:33,337 INFO L273 TraceCheckUtils]: 15: Hoare triple {1085#(= |main_#t~ret4| 0)} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {1085#(= |main_#t~ret4| 0)} is VALID [2018-11-18 23:01:33,343 INFO L273 TraceCheckUtils]: 16: Hoare triple {1085#(= |main_#t~ret4| 0)} assume !(1 != #t~ret4);havoc #t~mem3;havoc #t~ret4; {1083#false} is VALID [2018-11-18 23:01:33,343 INFO L273 TraceCheckUtils]: 17: Hoare triple {1083#false} #t~post2 := ~v~0;~v~0 := 1 + #t~post2;havoc #t~post2; {1083#false} is VALID [2018-11-18 23:01:33,343 INFO L273 TraceCheckUtils]: 18: Hoare triple {1083#false} assume true; {1083#false} is VALID [2018-11-18 23:01:33,343 INFO L273 TraceCheckUtils]: 19: Hoare triple {1083#false} assume !(~v~0 < ~SIZE~0); {1083#false} is VALID [2018-11-18 23:01:33,344 INFO L273 TraceCheckUtils]: 20: Hoare triple {1083#false} ~i~1 := 0; {1083#false} is VALID [2018-11-18 23:01:33,344 INFO L273 TraceCheckUtils]: 21: Hoare triple {1083#false} assume true; {1083#false} is VALID [2018-11-18 23:01:33,344 INFO L273 TraceCheckUtils]: 22: Hoare triple {1083#false} assume !!(~i~1 < ~SIZE~0 && 1 != ~found~0);call #t~mem8 := read~int(~#set~0.base, ~#set~0.offset + 4 * ~i~1, 4); {1083#false} is VALID [2018-11-18 23:01:33,344 INFO L273 TraceCheckUtils]: 23: Hoare triple {1083#false} assume #t~mem8 == ~element~0;havoc #t~mem8;~found~0 := 1;~pos~0 := ~i~1; {1083#false} is VALID [2018-11-18 23:01:33,345 INFO L273 TraceCheckUtils]: 24: Hoare triple {1083#false} #t~post7 := ~i~1;~i~1 := 1 + #t~post7;havoc #t~post7; {1083#false} is VALID [2018-11-18 23:01:33,345 INFO L273 TraceCheckUtils]: 25: Hoare triple {1083#false} assume true; {1083#false} is VALID [2018-11-18 23:01:33,345 INFO L273 TraceCheckUtils]: 26: Hoare triple {1083#false} assume !(~i~1 < ~SIZE~0 && 1 != ~found~0); {1083#false} is VALID [2018-11-18 23:01:33,345 INFO L273 TraceCheckUtils]: 27: Hoare triple {1083#false} assume 1 == ~found~0;~i~1 := ~pos~0; {1083#false} is VALID [2018-11-18 23:01:33,345 INFO L273 TraceCheckUtils]: 28: Hoare triple {1083#false} assume true; {1083#false} is VALID [2018-11-18 23:01:33,346 INFO L273 TraceCheckUtils]: 29: Hoare triple {1083#false} assume !!(~i~1 < ~SIZE~0 - 1);call #t~mem10 := read~int(~#set~0.base, ~#set~0.offset + 4 * (1 + ~i~1), 4);call write~int(#t~mem10, ~#set~0.base, ~#set~0.offset + 4 * ~i~1, 4);havoc #t~mem10; {1083#false} is VALID [2018-11-18 23:01:33,346 INFO L273 TraceCheckUtils]: 30: Hoare triple {1083#false} #t~post9 := ~i~1;~i~1 := 1 + #t~post9;havoc #t~post9; {1083#false} is VALID [2018-11-18 23:01:33,346 INFO L273 TraceCheckUtils]: 31: Hoare triple {1083#false} assume true; {1083#false} is VALID [2018-11-18 23:01:33,346 INFO L273 TraceCheckUtils]: 32: Hoare triple {1083#false} assume !(~i~1 < ~SIZE~0 - 1); {1083#false} is VALID [2018-11-18 23:01:33,348 INFO L273 TraceCheckUtils]: 33: Hoare triple {1083#false} assume 1 == ~found~0;~i~1 := 0; {1083#false} is VALID [2018-11-18 23:01:33,348 INFO L273 TraceCheckUtils]: 34: Hoare triple {1083#false} assume true; {1083#false} is VALID [2018-11-18 23:01:33,348 INFO L273 TraceCheckUtils]: 35: Hoare triple {1083#false} assume !!(~i~1 < ~SIZE~0 - 1);call #t~mem12 := read~int(~#set~0.base, ~#set~0.offset + 4 * ~i~1, 4); {1083#false} is VALID [2018-11-18 23:01:33,349 INFO L256 TraceCheckUtils]: 36: Hoare triple {1083#false} call __VERIFIER_assert((if #t~mem12 != ~element~0 then 1 else 0)); {1083#false} is VALID [2018-11-18 23:01:33,349 INFO L273 TraceCheckUtils]: 37: Hoare triple {1083#false} ~cond := #in~cond; {1083#false} is VALID [2018-11-18 23:01:33,349 INFO L273 TraceCheckUtils]: 38: Hoare triple {1083#false} assume 0 == ~cond; {1083#false} is VALID [2018-11-18 23:01:33,349 INFO L273 TraceCheckUtils]: 39: Hoare triple {1083#false} assume !false; {1083#false} is VALID [2018-11-18 23:01:33,352 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-11-18 23:01:33,353 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 23:01:33,353 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-18 23:01:33,353 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 40 [2018-11-18 23:01:33,362 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-18 23:01:33,362 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2018-11-18 23:01:33,417 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 38 edges. 38 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 23:01:33,417 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-18 23:01:33,417 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-18 23:01:33,418 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-18 23:01:33,418 INFO L87 Difference]: Start difference. First operand 60 states and 69 transitions. Second operand 4 states. [2018-11-18 23:01:33,655 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 23:01:33,656 INFO L93 Difference]: Finished difference Result 116 states and 135 transitions. [2018-11-18 23:01:33,656 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-18 23:01:33,656 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 40 [2018-11-18 23:01:33,656 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 23:01:33,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-18 23:01:33,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 105 transitions. [2018-11-18 23:01:33,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-18 23:01:33,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 105 transitions. [2018-11-18 23:01:33,663 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 105 transitions. [2018-11-18 23:01:33,823 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 105 edges. 105 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 23:01:33,827 INFO L225 Difference]: With dead ends: 116 [2018-11-18 23:01:33,827 INFO L226 Difference]: Without dead ends: 64 [2018-11-18 23:01:33,828 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 23:01:33,828 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2018-11-18 23:01:33,887 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 64. [2018-11-18 23:01:33,887 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-18 23:01:33,888 INFO L82 GeneralOperation]: Start isEquivalent. First operand 64 states. Second operand 64 states. [2018-11-18 23:01:33,888 INFO L74 IsIncluded]: Start isIncluded. First operand 64 states. Second operand 64 states. [2018-11-18 23:01:33,888 INFO L87 Difference]: Start difference. First operand 64 states. Second operand 64 states. [2018-11-18 23:01:33,892 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 23:01:33,892 INFO L93 Difference]: Finished difference Result 64 states and 73 transitions. [2018-11-18 23:01:33,892 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 73 transitions. [2018-11-18 23:01:33,893 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 23:01:33,893 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 23:01:33,893 INFO L74 IsIncluded]: Start isIncluded. First operand 64 states. Second operand 64 states. [2018-11-18 23:01:33,893 INFO L87 Difference]: Start difference. First operand 64 states. Second operand 64 states. [2018-11-18 23:01:33,897 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 23:01:33,897 INFO L93 Difference]: Finished difference Result 64 states and 73 transitions. [2018-11-18 23:01:33,897 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 73 transitions. [2018-11-18 23:01:33,898 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 23:01:33,898 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 23:01:33,898 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-18 23:01:33,899 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-18 23:01:33,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2018-11-18 23:01:33,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 73 transitions. [2018-11-18 23:01:33,902 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 73 transitions. Word has length 40 [2018-11-18 23:01:33,902 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 23:01:33,902 INFO L480 AbstractCegarLoop]: Abstraction has 64 states and 73 transitions. [2018-11-18 23:01:33,902 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-18 23:01:33,903 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 73 transitions. [2018-11-18 23:01:33,904 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-11-18 23:01:33,904 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 23:01:33,904 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 23:01:33,904 INFO L423 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 23:01:33,904 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 23:01:33,905 INFO L82 PathProgramCache]: Analyzing trace with hash 1439248380, now seen corresponding path program 1 times [2018-11-18 23:01:33,905 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 23:01:33,905 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 23:01:33,906 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 23:01:33,906 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 23:01:33,906 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 23:01:33,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 23:01:34,065 INFO L256 TraceCheckUtils]: 0: Hoare triple {1451#true} call ULTIMATE.init(); {1451#true} is VALID [2018-11-18 23:01:34,066 INFO L273 TraceCheckUtils]: 1: Hoare triple {1451#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~SIZE~0 := 100000; {1453#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:01:34,070 INFO L273 TraceCheckUtils]: 2: Hoare triple {1453#(<= 100000 ~SIZE~0)} assume true; {1453#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:01:34,071 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1453#(<= 100000 ~SIZE~0)} {1451#true} #128#return; {1453#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:01:34,072 INFO L256 TraceCheckUtils]: 4: Hoare triple {1453#(<= 100000 ~SIZE~0)} call #t~ret13 := main(); {1453#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:01:34,073 INFO L273 TraceCheckUtils]: 5: Hoare triple {1453#(<= 100000 ~SIZE~0)} havoc ~i~1;havoc ~pos~0;~n~0 := 0;~found~0 := 0;call ~#set~0.base, ~#set~0.offset := #Ultimate.alloc(4 * ~SIZE~0);call ~#values~0.base, ~#values~0.offset := #Ultimate.alloc(4 * ~SIZE~0);havoc ~element~0;havoc ~v~0;~v~0 := 0; {1453#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:01:34,073 INFO L273 TraceCheckUtils]: 6: Hoare triple {1453#(<= 100000 ~SIZE~0)} assume true; {1453#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:01:34,074 INFO L273 TraceCheckUtils]: 7: Hoare triple {1453#(<= 100000 ~SIZE~0)} assume !!(~v~0 < ~SIZE~0);call #t~mem3 := read~int(~#values~0.base, ~#values~0.offset + 4 * ~v~0, 4); {1453#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:01:34,074 INFO L256 TraceCheckUtils]: 8: Hoare triple {1453#(<= 100000 ~SIZE~0)} call #t~ret4 := elem_exists(~#set~0.base, ~#set~0.offset, ~n~0, #t~mem3); {1451#true} is VALID [2018-11-18 23:01:34,074 INFO L273 TraceCheckUtils]: 9: Hoare triple {1451#true} ~set.base, ~set.offset := #in~set.base, #in~set.offset;~size := #in~size;~value := #in~value;havoc ~i~0;~i~0 := 0; {1451#true} is VALID [2018-11-18 23:01:34,074 INFO L273 TraceCheckUtils]: 10: Hoare triple {1451#true} assume true; {1451#true} is VALID [2018-11-18 23:01:34,075 INFO L273 TraceCheckUtils]: 11: Hoare triple {1451#true} assume !!(~i~0 < ~size);call #t~mem1 := read~int(~set.base, ~set.offset + 4 * ~i~0, 4); {1451#true} is VALID [2018-11-18 23:01:34,075 INFO L273 TraceCheckUtils]: 12: Hoare triple {1451#true} assume #t~mem1 == ~value;havoc #t~mem1;#res := 1; {1451#true} is VALID [2018-11-18 23:01:34,075 INFO L273 TraceCheckUtils]: 13: Hoare triple {1451#true} assume true; {1451#true} is VALID [2018-11-18 23:01:34,077 INFO L268 TraceCheckUtils]: 14: Hoare quadruple {1451#true} {1453#(<= 100000 ~SIZE~0)} #132#return; {1453#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:01:34,080 INFO L273 TraceCheckUtils]: 15: Hoare triple {1453#(<= 100000 ~SIZE~0)} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {1453#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:01:34,080 INFO L273 TraceCheckUtils]: 16: Hoare triple {1453#(<= 100000 ~SIZE~0)} assume !(1 != #t~ret4);havoc #t~mem3;havoc #t~ret4; {1453#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:01:34,081 INFO L273 TraceCheckUtils]: 17: Hoare triple {1453#(<= 100000 ~SIZE~0)} #t~post2 := ~v~0;~v~0 := 1 + #t~post2;havoc #t~post2; {1453#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:01:34,082 INFO L273 TraceCheckUtils]: 18: Hoare triple {1453#(<= 100000 ~SIZE~0)} assume true; {1453#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:01:34,082 INFO L273 TraceCheckUtils]: 19: Hoare triple {1453#(<= 100000 ~SIZE~0)} assume !(~v~0 < ~SIZE~0); {1453#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:01:34,083 INFO L273 TraceCheckUtils]: 20: Hoare triple {1453#(<= 100000 ~SIZE~0)} ~i~1 := 0; {1454#(and (= 0 main_~i~1) (<= 100000 ~SIZE~0))} is VALID [2018-11-18 23:01:34,084 INFO L273 TraceCheckUtils]: 21: Hoare triple {1454#(and (= 0 main_~i~1) (<= 100000 ~SIZE~0))} assume true; {1454#(and (= 0 main_~i~1) (<= 100000 ~SIZE~0))} is VALID [2018-11-18 23:01:34,085 INFO L273 TraceCheckUtils]: 22: Hoare triple {1454#(and (= 0 main_~i~1) (<= 100000 ~SIZE~0))} assume !!(~i~1 < ~SIZE~0 && 1 != ~found~0);call #t~mem8 := read~int(~#set~0.base, ~#set~0.offset + 4 * ~i~1, 4); {1454#(and (= 0 main_~i~1) (<= 100000 ~SIZE~0))} is VALID [2018-11-18 23:01:34,086 INFO L273 TraceCheckUtils]: 23: Hoare triple {1454#(and (= 0 main_~i~1) (<= 100000 ~SIZE~0))} assume #t~mem8 == ~element~0;havoc #t~mem8;~found~0 := 1;~pos~0 := ~i~1; {1455#(and (= 0 main_~pos~0) (<= 100000 ~SIZE~0))} is VALID [2018-11-18 23:01:34,087 INFO L273 TraceCheckUtils]: 24: Hoare triple {1455#(and (= 0 main_~pos~0) (<= 100000 ~SIZE~0))} #t~post7 := ~i~1;~i~1 := 1 + #t~post7;havoc #t~post7; {1455#(and (= 0 main_~pos~0) (<= 100000 ~SIZE~0))} is VALID [2018-11-18 23:01:34,088 INFO L273 TraceCheckUtils]: 25: Hoare triple {1455#(and (= 0 main_~pos~0) (<= 100000 ~SIZE~0))} assume true; {1455#(and (= 0 main_~pos~0) (<= 100000 ~SIZE~0))} is VALID [2018-11-18 23:01:34,088 INFO L273 TraceCheckUtils]: 26: Hoare triple {1455#(and (= 0 main_~pos~0) (<= 100000 ~SIZE~0))} assume !(~i~1 < ~SIZE~0 && 1 != ~found~0); {1455#(and (= 0 main_~pos~0) (<= 100000 ~SIZE~0))} is VALID [2018-11-18 23:01:34,089 INFO L273 TraceCheckUtils]: 27: Hoare triple {1455#(and (= 0 main_~pos~0) (<= 100000 ~SIZE~0))} assume 1 == ~found~0;~i~1 := ~pos~0; {1454#(and (= 0 main_~i~1) (<= 100000 ~SIZE~0))} is VALID [2018-11-18 23:01:34,090 INFO L273 TraceCheckUtils]: 28: Hoare triple {1454#(and (= 0 main_~i~1) (<= 100000 ~SIZE~0))} assume true; {1454#(and (= 0 main_~i~1) (<= 100000 ~SIZE~0))} is VALID [2018-11-18 23:01:34,092 INFO L273 TraceCheckUtils]: 29: Hoare triple {1454#(and (= 0 main_~i~1) (<= 100000 ~SIZE~0))} assume !!(~i~1 < ~SIZE~0 - 1);call #t~mem10 := read~int(~#set~0.base, ~#set~0.offset + 4 * (1 + ~i~1), 4);call write~int(#t~mem10, ~#set~0.base, ~#set~0.offset + 4 * ~i~1, 4);havoc #t~mem10; {1454#(and (= 0 main_~i~1) (<= 100000 ~SIZE~0))} is VALID [2018-11-18 23:01:34,093 INFO L273 TraceCheckUtils]: 30: Hoare triple {1454#(and (= 0 main_~i~1) (<= 100000 ~SIZE~0))} #t~post9 := ~i~1;~i~1 := 1 + #t~post9;havoc #t~post9; {1456#(<= (+ main_~i~1 99999) ~SIZE~0)} is VALID [2018-11-18 23:01:34,094 INFO L273 TraceCheckUtils]: 31: Hoare triple {1456#(<= (+ main_~i~1 99999) ~SIZE~0)} assume true; {1456#(<= (+ main_~i~1 99999) ~SIZE~0)} is VALID [2018-11-18 23:01:34,095 INFO L273 TraceCheckUtils]: 32: Hoare triple {1456#(<= (+ main_~i~1 99999) ~SIZE~0)} assume !(~i~1 < ~SIZE~0 - 1); {1452#false} is VALID [2018-11-18 23:01:34,095 INFO L273 TraceCheckUtils]: 33: Hoare triple {1452#false} assume 1 == ~found~0;~i~1 := 0; {1452#false} is VALID [2018-11-18 23:01:34,095 INFO L273 TraceCheckUtils]: 34: Hoare triple {1452#false} assume true; {1452#false} is VALID [2018-11-18 23:01:34,096 INFO L273 TraceCheckUtils]: 35: Hoare triple {1452#false} assume !!(~i~1 < ~SIZE~0 - 1);call #t~mem12 := read~int(~#set~0.base, ~#set~0.offset + 4 * ~i~1, 4); {1452#false} is VALID [2018-11-18 23:01:34,096 INFO L256 TraceCheckUtils]: 36: Hoare triple {1452#false} call __VERIFIER_assert((if #t~mem12 != ~element~0 then 1 else 0)); {1452#false} is VALID [2018-11-18 23:01:34,096 INFO L273 TraceCheckUtils]: 37: Hoare triple {1452#false} ~cond := #in~cond; {1452#false} is VALID [2018-11-18 23:01:34,097 INFO L273 TraceCheckUtils]: 38: Hoare triple {1452#false} assume 0 == ~cond; {1452#false} is VALID [2018-11-18 23:01:34,097 INFO L273 TraceCheckUtils]: 39: Hoare triple {1452#false} assume !false; {1452#false} is VALID [2018-11-18 23:01:34,101 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-11-18 23:01:34,102 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 23:01:34,102 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-18 23:01:34,117 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 23:01:34,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 23:01:34,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 23:01:34,180 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 23:01:34,473 INFO L256 TraceCheckUtils]: 0: Hoare triple {1451#true} call ULTIMATE.init(); {1451#true} is VALID [2018-11-18 23:01:34,473 INFO L273 TraceCheckUtils]: 1: Hoare triple {1451#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~SIZE~0 := 100000; {1451#true} is VALID [2018-11-18 23:01:34,473 INFO L273 TraceCheckUtils]: 2: Hoare triple {1451#true} assume true; {1451#true} is VALID [2018-11-18 23:01:34,474 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1451#true} {1451#true} #128#return; {1451#true} is VALID [2018-11-18 23:01:34,474 INFO L256 TraceCheckUtils]: 4: Hoare triple {1451#true} call #t~ret13 := main(); {1451#true} is VALID [2018-11-18 23:01:34,475 INFO L273 TraceCheckUtils]: 5: Hoare triple {1451#true} havoc ~i~1;havoc ~pos~0;~n~0 := 0;~found~0 := 0;call ~#set~0.base, ~#set~0.offset := #Ultimate.alloc(4 * ~SIZE~0);call ~#values~0.base, ~#values~0.offset := #Ultimate.alloc(4 * ~SIZE~0);havoc ~element~0;havoc ~v~0;~v~0 := 0; {1475#(<= main_~n~0 0)} is VALID [2018-11-18 23:01:34,476 INFO L273 TraceCheckUtils]: 6: Hoare triple {1475#(<= main_~n~0 0)} assume true; {1475#(<= main_~n~0 0)} is VALID [2018-11-18 23:01:34,476 INFO L273 TraceCheckUtils]: 7: Hoare triple {1475#(<= main_~n~0 0)} assume !!(~v~0 < ~SIZE~0);call #t~mem3 := read~int(~#values~0.base, ~#values~0.offset + 4 * ~v~0, 4); {1475#(<= main_~n~0 0)} is VALID [2018-11-18 23:01:34,477 INFO L256 TraceCheckUtils]: 8: Hoare triple {1475#(<= main_~n~0 0)} call #t~ret4 := elem_exists(~#set~0.base, ~#set~0.offset, ~n~0, #t~mem3); {1451#true} is VALID [2018-11-18 23:01:34,477 INFO L273 TraceCheckUtils]: 9: Hoare triple {1451#true} ~set.base, ~set.offset := #in~set.base, #in~set.offset;~size := #in~size;~value := #in~value;havoc ~i~0;~i~0 := 0; {1488#(and (<= elem_exists_~size |elem_exists_#in~size|) (<= 0 elem_exists_~i~0))} is VALID [2018-11-18 23:01:34,478 INFO L273 TraceCheckUtils]: 10: Hoare triple {1488#(and (<= elem_exists_~size |elem_exists_#in~size|) (<= 0 elem_exists_~i~0))} assume true; {1488#(and (<= elem_exists_~size |elem_exists_#in~size|) (<= 0 elem_exists_~i~0))} is VALID [2018-11-18 23:01:34,479 INFO L273 TraceCheckUtils]: 11: Hoare triple {1488#(and (<= elem_exists_~size |elem_exists_#in~size|) (<= 0 elem_exists_~i~0))} assume !!(~i~0 < ~size);call #t~mem1 := read~int(~set.base, ~set.offset + 4 * ~i~0, 4); {1495#(<= 1 |elem_exists_#in~size|)} is VALID [2018-11-18 23:01:34,480 INFO L273 TraceCheckUtils]: 12: Hoare triple {1495#(<= 1 |elem_exists_#in~size|)} assume #t~mem1 == ~value;havoc #t~mem1;#res := 1; {1495#(<= 1 |elem_exists_#in~size|)} is VALID [2018-11-18 23:01:34,480 INFO L273 TraceCheckUtils]: 13: Hoare triple {1495#(<= 1 |elem_exists_#in~size|)} assume true; {1495#(<= 1 |elem_exists_#in~size|)} is VALID [2018-11-18 23:01:34,482 INFO L268 TraceCheckUtils]: 14: Hoare quadruple {1495#(<= 1 |elem_exists_#in~size|)} {1475#(<= main_~n~0 0)} #132#return; {1452#false} is VALID [2018-11-18 23:01:34,483 INFO L273 TraceCheckUtils]: 15: Hoare triple {1452#false} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {1452#false} is VALID [2018-11-18 23:01:34,483 INFO L273 TraceCheckUtils]: 16: Hoare triple {1452#false} assume !(1 != #t~ret4);havoc #t~mem3;havoc #t~ret4; {1452#false} is VALID [2018-11-18 23:01:34,483 INFO L273 TraceCheckUtils]: 17: Hoare triple {1452#false} #t~post2 := ~v~0;~v~0 := 1 + #t~post2;havoc #t~post2; {1452#false} is VALID [2018-11-18 23:01:34,484 INFO L273 TraceCheckUtils]: 18: Hoare triple {1452#false} assume true; {1452#false} is VALID [2018-11-18 23:01:34,484 INFO L273 TraceCheckUtils]: 19: Hoare triple {1452#false} assume !(~v~0 < ~SIZE~0); {1452#false} is VALID [2018-11-18 23:01:34,484 INFO L273 TraceCheckUtils]: 20: Hoare triple {1452#false} ~i~1 := 0; {1452#false} is VALID [2018-11-18 23:01:34,484 INFO L273 TraceCheckUtils]: 21: Hoare triple {1452#false} assume true; {1452#false} is VALID [2018-11-18 23:01:34,485 INFO L273 TraceCheckUtils]: 22: Hoare triple {1452#false} assume !!(~i~1 < ~SIZE~0 && 1 != ~found~0);call #t~mem8 := read~int(~#set~0.base, ~#set~0.offset + 4 * ~i~1, 4); {1452#false} is VALID [2018-11-18 23:01:34,485 INFO L273 TraceCheckUtils]: 23: Hoare triple {1452#false} assume #t~mem8 == ~element~0;havoc #t~mem8;~found~0 := 1;~pos~0 := ~i~1; {1452#false} is VALID [2018-11-18 23:01:34,485 INFO L273 TraceCheckUtils]: 24: Hoare triple {1452#false} #t~post7 := ~i~1;~i~1 := 1 + #t~post7;havoc #t~post7; {1452#false} is VALID [2018-11-18 23:01:34,485 INFO L273 TraceCheckUtils]: 25: Hoare triple {1452#false} assume true; {1452#false} is VALID [2018-11-18 23:01:34,486 INFO L273 TraceCheckUtils]: 26: Hoare triple {1452#false} assume !(~i~1 < ~SIZE~0 && 1 != ~found~0); {1452#false} is VALID [2018-11-18 23:01:34,486 INFO L273 TraceCheckUtils]: 27: Hoare triple {1452#false} assume 1 == ~found~0;~i~1 := ~pos~0; {1452#false} is VALID [2018-11-18 23:01:34,486 INFO L273 TraceCheckUtils]: 28: Hoare triple {1452#false} assume true; {1452#false} is VALID [2018-11-18 23:01:34,486 INFO L273 TraceCheckUtils]: 29: Hoare triple {1452#false} assume !!(~i~1 < ~SIZE~0 - 1);call #t~mem10 := read~int(~#set~0.base, ~#set~0.offset + 4 * (1 + ~i~1), 4);call write~int(#t~mem10, ~#set~0.base, ~#set~0.offset + 4 * ~i~1, 4);havoc #t~mem10; {1452#false} is VALID [2018-11-18 23:01:34,487 INFO L273 TraceCheckUtils]: 30: Hoare triple {1452#false} #t~post9 := ~i~1;~i~1 := 1 + #t~post9;havoc #t~post9; {1452#false} is VALID [2018-11-18 23:01:34,487 INFO L273 TraceCheckUtils]: 31: Hoare triple {1452#false} assume true; {1452#false} is VALID [2018-11-18 23:01:34,487 INFO L273 TraceCheckUtils]: 32: Hoare triple {1452#false} assume !(~i~1 < ~SIZE~0 - 1); {1452#false} is VALID [2018-11-18 23:01:34,487 INFO L273 TraceCheckUtils]: 33: Hoare triple {1452#false} assume 1 == ~found~0;~i~1 := 0; {1452#false} is VALID [2018-11-18 23:01:34,487 INFO L273 TraceCheckUtils]: 34: Hoare triple {1452#false} assume true; {1452#false} is VALID [2018-11-18 23:01:34,488 INFO L273 TraceCheckUtils]: 35: Hoare triple {1452#false} assume !!(~i~1 < ~SIZE~0 - 1);call #t~mem12 := read~int(~#set~0.base, ~#set~0.offset + 4 * ~i~1, 4); {1452#false} is VALID [2018-11-18 23:01:34,488 INFO L256 TraceCheckUtils]: 36: Hoare triple {1452#false} call __VERIFIER_assert((if #t~mem12 != ~element~0 then 1 else 0)); {1452#false} is VALID [2018-11-18 23:01:34,488 INFO L273 TraceCheckUtils]: 37: Hoare triple {1452#false} ~cond := #in~cond; {1452#false} is VALID [2018-11-18 23:01:34,488 INFO L273 TraceCheckUtils]: 38: Hoare triple {1452#false} assume 0 == ~cond; {1452#false} is VALID [2018-11-18 23:01:34,489 INFO L273 TraceCheckUtils]: 39: Hoare triple {1452#false} assume !false; {1452#false} is VALID [2018-11-18 23:01:34,491 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-11-18 23:01:34,518 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-18 23:01:34,519 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 9 [2018-11-18 23:01:34,519 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 40 [2018-11-18 23:01:34,520 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-18 23:01:34,520 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states. [2018-11-18 23:01:34,605 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 23:01:34,605 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-18 23:01:34,605 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-18 23:01:34,605 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2018-11-18 23:01:34,606 INFO L87 Difference]: Start difference. First operand 64 states and 73 transitions. Second operand 9 states. [2018-11-18 23:01:36,487 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 23:01:36,487 INFO L93 Difference]: Finished difference Result 175 states and 208 transitions. [2018-11-18 23:01:36,487 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-18 23:01:36,487 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 40 [2018-11-18 23:01:36,488 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 23:01:36,488 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-11-18 23:01:36,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 181 transitions. [2018-11-18 23:01:36,493 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-11-18 23:01:36,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 181 transitions. [2018-11-18 23:01:36,498 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states and 181 transitions. [2018-11-18 23:01:36,910 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 181 edges. 181 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 23:01:36,915 INFO L225 Difference]: With dead ends: 175 [2018-11-18 23:01:36,916 INFO L226 Difference]: Without dead ends: 119 [2018-11-18 23:01:36,917 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 40 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=51, Invalid=159, Unknown=0, NotChecked=0, Total=210 [2018-11-18 23:01:36,917 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2018-11-18 23:01:37,041 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 73. [2018-11-18 23:01:37,041 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-18 23:01:37,041 INFO L82 GeneralOperation]: Start isEquivalent. First operand 119 states. Second operand 73 states. [2018-11-18 23:01:37,041 INFO L74 IsIncluded]: Start isIncluded. First operand 119 states. Second operand 73 states. [2018-11-18 23:01:37,041 INFO L87 Difference]: Start difference. First operand 119 states. Second operand 73 states. [2018-11-18 23:01:37,047 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 23:01:37,047 INFO L93 Difference]: Finished difference Result 119 states and 140 transitions. [2018-11-18 23:01:37,048 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 140 transitions. [2018-11-18 23:01:37,048 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 23:01:37,049 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 23:01:37,049 INFO L74 IsIncluded]: Start isIncluded. First operand 73 states. Second operand 119 states. [2018-11-18 23:01:37,049 INFO L87 Difference]: Start difference. First operand 73 states. Second operand 119 states. [2018-11-18 23:01:37,054 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 23:01:37,055 INFO L93 Difference]: Finished difference Result 119 states and 140 transitions. [2018-11-18 23:01:37,055 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 140 transitions. [2018-11-18 23:01:37,056 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 23:01:37,056 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 23:01:37,056 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-18 23:01:37,056 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-18 23:01:37,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2018-11-18 23:01:37,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 84 transitions. [2018-11-18 23:01:37,059 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 84 transitions. Word has length 40 [2018-11-18 23:01:37,060 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 23:01:37,060 INFO L480 AbstractCegarLoop]: Abstraction has 73 states and 84 transitions. [2018-11-18 23:01:37,060 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-18 23:01:37,060 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 84 transitions. [2018-11-18 23:01:37,061 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-11-18 23:01:37,061 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 23:01:37,061 INFO L375 BasicCegarLoop]: trace histogram [3, 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, 1, 1, 1, 1, 1] [2018-11-18 23:01:37,062 INFO L423 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 23:01:37,062 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 23:01:37,062 INFO L82 PathProgramCache]: Analyzing trace with hash 467748098, now seen corresponding path program 1 times [2018-11-18 23:01:37,062 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 23:01:37,062 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 23:01:37,063 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 23:01:37,063 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 23:01:37,064 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 23:01:37,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 23:01:37,162 INFO L256 TraceCheckUtils]: 0: Hoare triple {2154#true} call ULTIMATE.init(); {2154#true} is VALID [2018-11-18 23:01:37,162 INFO L273 TraceCheckUtils]: 1: Hoare triple {2154#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~SIZE~0 := 100000; {2154#true} is VALID [2018-11-18 23:01:37,162 INFO L273 TraceCheckUtils]: 2: Hoare triple {2154#true} assume true; {2154#true} is VALID [2018-11-18 23:01:37,163 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {2154#true} {2154#true} #128#return; {2154#true} is VALID [2018-11-18 23:01:37,163 INFO L256 TraceCheckUtils]: 4: Hoare triple {2154#true} call #t~ret13 := main(); {2154#true} is VALID [2018-11-18 23:01:37,163 INFO L273 TraceCheckUtils]: 5: Hoare triple {2154#true} havoc ~i~1;havoc ~pos~0;~n~0 := 0;~found~0 := 0;call ~#set~0.base, ~#set~0.offset := #Ultimate.alloc(4 * ~SIZE~0);call ~#values~0.base, ~#values~0.offset := #Ultimate.alloc(4 * ~SIZE~0);havoc ~element~0;havoc ~v~0;~v~0 := 0; {2154#true} is VALID [2018-11-18 23:01:37,163 INFO L273 TraceCheckUtils]: 6: Hoare triple {2154#true} assume true; {2154#true} is VALID [2018-11-18 23:01:37,164 INFO L273 TraceCheckUtils]: 7: Hoare triple {2154#true} assume !!(~v~0 < ~SIZE~0);call #t~mem3 := read~int(~#values~0.base, ~#values~0.offset + 4 * ~v~0, 4); {2154#true} is VALID [2018-11-18 23:01:37,164 INFO L256 TraceCheckUtils]: 8: Hoare triple {2154#true} call #t~ret4 := elem_exists(~#set~0.base, ~#set~0.offset, ~n~0, #t~mem3); {2154#true} is VALID [2018-11-18 23:01:37,164 INFO L273 TraceCheckUtils]: 9: Hoare triple {2154#true} ~set.base, ~set.offset := #in~set.base, #in~set.offset;~size := #in~size;~value := #in~value;havoc ~i~0;~i~0 := 0; {2154#true} is VALID [2018-11-18 23:01:37,164 INFO L273 TraceCheckUtils]: 10: Hoare triple {2154#true} assume true; {2154#true} is VALID [2018-11-18 23:01:37,165 INFO L273 TraceCheckUtils]: 11: Hoare triple {2154#true} assume !(~i~0 < ~size); {2154#true} is VALID [2018-11-18 23:01:37,165 INFO L273 TraceCheckUtils]: 12: Hoare triple {2154#true} #res := 0; {2154#true} is VALID [2018-11-18 23:01:37,165 INFO L273 TraceCheckUtils]: 13: Hoare triple {2154#true} assume true; {2154#true} is VALID [2018-11-18 23:01:37,165 INFO L268 TraceCheckUtils]: 14: Hoare quadruple {2154#true} {2154#true} #132#return; {2154#true} is VALID [2018-11-18 23:01:37,166 INFO L273 TraceCheckUtils]: 15: Hoare triple {2154#true} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {2154#true} is VALID [2018-11-18 23:01:37,166 INFO L273 TraceCheckUtils]: 16: Hoare triple {2154#true} assume 1 != #t~ret4;havoc #t~mem3;havoc #t~ret4;call #t~mem5 := read~int(~#values~0.base, ~#values~0.offset + 4 * ~v~0, 4); {2154#true} is VALID [2018-11-18 23:01:37,166 INFO L256 TraceCheckUtils]: 17: Hoare triple {2154#true} call #t~ret6 := insert(~#set~0.base, ~#set~0.offset, ~n~0, #t~mem5); {2154#true} is VALID [2018-11-18 23:01:37,166 INFO L273 TraceCheckUtils]: 18: Hoare triple {2154#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; {2154#true} is VALID [2018-11-18 23:01:37,167 INFO L273 TraceCheckUtils]: 19: Hoare triple {2154#true} assume true; {2154#true} is VALID [2018-11-18 23:01:37,167 INFO L268 TraceCheckUtils]: 20: Hoare quadruple {2154#true} {2154#true} #134#return; {2154#true} is VALID [2018-11-18 23:01:37,167 INFO L273 TraceCheckUtils]: 21: Hoare triple {2154#true} assume -2147483648 <= #t~ret6 && #t~ret6 <= 2147483647;~n~0 := #t~ret6;havoc #t~ret6;havoc #t~mem5; {2154#true} is VALID [2018-11-18 23:01:37,167 INFO L273 TraceCheckUtils]: 22: Hoare triple {2154#true} #t~post2 := ~v~0;~v~0 := 1 + #t~post2;havoc #t~post2; {2154#true} is VALID [2018-11-18 23:01:37,168 INFO L273 TraceCheckUtils]: 23: Hoare triple {2154#true} assume true; {2154#true} is VALID [2018-11-18 23:01:37,168 INFO L273 TraceCheckUtils]: 24: Hoare triple {2154#true} assume !(~v~0 < ~SIZE~0); {2154#true} is VALID [2018-11-18 23:01:37,168 INFO L273 TraceCheckUtils]: 25: Hoare triple {2154#true} ~i~1 := 0; {2154#true} is VALID [2018-11-18 23:01:37,168 INFO L273 TraceCheckUtils]: 26: Hoare triple {2154#true} assume true; {2154#true} is VALID [2018-11-18 23:01:37,168 INFO L273 TraceCheckUtils]: 27: Hoare triple {2154#true} assume !!(~i~1 < ~SIZE~0 && 1 != ~found~0);call #t~mem8 := read~int(~#set~0.base, ~#set~0.offset + 4 * ~i~1, 4); {2154#true} is VALID [2018-11-18 23:01:37,181 INFO L273 TraceCheckUtils]: 28: Hoare triple {2154#true} assume #t~mem8 == ~element~0;havoc #t~mem8;~found~0 := 1;~pos~0 := ~i~1; {2156#(= main_~found~0 1)} is VALID [2018-11-18 23:01:37,194 INFO L273 TraceCheckUtils]: 29: Hoare triple {2156#(= main_~found~0 1)} #t~post7 := ~i~1;~i~1 := 1 + #t~post7;havoc #t~post7; {2156#(= main_~found~0 1)} is VALID [2018-11-18 23:01:37,207 INFO L273 TraceCheckUtils]: 30: Hoare triple {2156#(= main_~found~0 1)} assume true; {2156#(= main_~found~0 1)} is VALID [2018-11-18 23:01:37,214 INFO L273 TraceCheckUtils]: 31: Hoare triple {2156#(= main_~found~0 1)} assume !!(~i~1 < ~SIZE~0 && 1 != ~found~0);call #t~mem8 := read~int(~#set~0.base, ~#set~0.offset + 4 * ~i~1, 4); {2155#false} is VALID [2018-11-18 23:01:37,214 INFO L273 TraceCheckUtils]: 32: Hoare triple {2155#false} assume #t~mem8 == ~element~0;havoc #t~mem8;~found~0 := 1;~pos~0 := ~i~1; {2155#false} is VALID [2018-11-18 23:01:37,214 INFO L273 TraceCheckUtils]: 33: Hoare triple {2155#false} #t~post7 := ~i~1;~i~1 := 1 + #t~post7;havoc #t~post7; {2155#false} is VALID [2018-11-18 23:01:37,214 INFO L273 TraceCheckUtils]: 34: Hoare triple {2155#false} assume true; {2155#false} is VALID [2018-11-18 23:01:37,215 INFO L273 TraceCheckUtils]: 35: Hoare triple {2155#false} assume !(~i~1 < ~SIZE~0 && 1 != ~found~0); {2155#false} is VALID [2018-11-18 23:01:37,215 INFO L273 TraceCheckUtils]: 36: Hoare triple {2155#false} assume 1 == ~found~0;~i~1 := ~pos~0; {2155#false} is VALID [2018-11-18 23:01:37,215 INFO L273 TraceCheckUtils]: 37: Hoare triple {2155#false} assume true; {2155#false} is VALID [2018-11-18 23:01:37,215 INFO L273 TraceCheckUtils]: 38: Hoare triple {2155#false} assume !(~i~1 < ~SIZE~0 - 1); {2155#false} is VALID [2018-11-18 23:01:37,215 INFO L273 TraceCheckUtils]: 39: Hoare triple {2155#false} assume 1 == ~found~0;~i~1 := 0; {2155#false} is VALID [2018-11-18 23:01:37,215 INFO L273 TraceCheckUtils]: 40: Hoare triple {2155#false} assume true; {2155#false} is VALID [2018-11-18 23:01:37,216 INFO L273 TraceCheckUtils]: 41: Hoare triple {2155#false} assume !!(~i~1 < ~SIZE~0 - 1);call #t~mem12 := read~int(~#set~0.base, ~#set~0.offset + 4 * ~i~1, 4); {2155#false} is VALID [2018-11-18 23:01:37,216 INFO L256 TraceCheckUtils]: 42: Hoare triple {2155#false} call __VERIFIER_assert((if #t~mem12 != ~element~0 then 1 else 0)); {2155#false} is VALID [2018-11-18 23:01:37,216 INFO L273 TraceCheckUtils]: 43: Hoare triple {2155#false} ~cond := #in~cond; {2155#false} is VALID [2018-11-18 23:01:37,216 INFO L273 TraceCheckUtils]: 44: Hoare triple {2155#false} assume 0 == ~cond; {2155#false} is VALID [2018-11-18 23:01:37,216 INFO L273 TraceCheckUtils]: 45: Hoare triple {2155#false} assume !false; {2155#false} is VALID [2018-11-18 23:01:37,217 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-11-18 23:01:37,218 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 23:01:37,218 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 23:01:37,218 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 46 [2018-11-18 23:01:37,219 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-18 23:01:37,219 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-18 23:01:37,276 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 45 edges. 45 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 23:01:37,276 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 23:01:37,276 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 23:01:37,276 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 23:01:37,277 INFO L87 Difference]: Start difference. First operand 73 states and 84 transitions. Second operand 3 states. [2018-11-18 23:01:37,479 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 23:01:37,479 INFO L93 Difference]: Finished difference Result 96 states and 110 transitions. [2018-11-18 23:01:37,479 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 23:01:37,479 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 46 [2018-11-18 23:01:37,480 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 23:01:37,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-18 23:01:37,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 79 transitions. [2018-11-18 23:01:37,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-18 23:01:37,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 79 transitions. [2018-11-18 23:01:37,484 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 79 transitions. [2018-11-18 23:01:37,708 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 79 edges. 79 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 23:01:37,711 INFO L225 Difference]: With dead ends: 96 [2018-11-18 23:01:37,711 INFO L226 Difference]: Without dead ends: 73 [2018-11-18 23:01:37,711 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 23:01:37,712 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2018-11-18 23:01:37,841 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 73. [2018-11-18 23:01:37,841 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-18 23:01:37,841 INFO L82 GeneralOperation]: Start isEquivalent. First operand 73 states. Second operand 73 states. [2018-11-18 23:01:37,842 INFO L74 IsIncluded]: Start isIncluded. First operand 73 states. Second operand 73 states. [2018-11-18 23:01:37,842 INFO L87 Difference]: Start difference. First operand 73 states. Second operand 73 states. [2018-11-18 23:01:37,845 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 23:01:37,845 INFO L93 Difference]: Finished difference Result 73 states and 82 transitions. [2018-11-18 23:01:37,846 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 82 transitions. [2018-11-18 23:01:37,846 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 23:01:37,846 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 23:01:37,846 INFO L74 IsIncluded]: Start isIncluded. First operand 73 states. Second operand 73 states. [2018-11-18 23:01:37,846 INFO L87 Difference]: Start difference. First operand 73 states. Second operand 73 states. [2018-11-18 23:01:37,849 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 23:01:37,849 INFO L93 Difference]: Finished difference Result 73 states and 82 transitions. [2018-11-18 23:01:37,849 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 82 transitions. [2018-11-18 23:01:37,850 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 23:01:37,850 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 23:01:37,850 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-18 23:01:37,850 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-18 23:01:37,850 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2018-11-18 23:01:37,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 82 transitions. [2018-11-18 23:01:37,853 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 82 transitions. Word has length 46 [2018-11-18 23:01:37,853 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 23:01:37,853 INFO L480 AbstractCegarLoop]: Abstraction has 73 states and 82 transitions. [2018-11-18 23:01:37,854 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 23:01:37,854 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 82 transitions. [2018-11-18 23:01:37,854 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-11-18 23:01:37,854 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 23:01:37,855 INFO L375 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 23:01:37,855 INFO L423 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 23:01:37,855 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 23:01:37,855 INFO L82 PathProgramCache]: Analyzing trace with hash -1526396608, now seen corresponding path program 1 times [2018-11-18 23:01:37,855 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 23:01:37,856 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 23:01:37,857 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 23:01:37,857 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 23:01:37,857 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 23:01:37,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 23:01:37,956 INFO L256 TraceCheckUtils]: 0: Hoare triple {2526#true} call ULTIMATE.init(); {2526#true} is VALID [2018-11-18 23:01:37,959 INFO L273 TraceCheckUtils]: 1: Hoare triple {2526#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~SIZE~0 := 100000; {2528#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:01:37,963 INFO L273 TraceCheckUtils]: 2: Hoare triple {2528#(<= 100000 ~SIZE~0)} assume true; {2528#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:01:37,966 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {2528#(<= 100000 ~SIZE~0)} {2526#true} #128#return; {2528#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:01:37,968 INFO L256 TraceCheckUtils]: 4: Hoare triple {2528#(<= 100000 ~SIZE~0)} call #t~ret13 := main(); {2528#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:01:37,969 INFO L273 TraceCheckUtils]: 5: Hoare triple {2528#(<= 100000 ~SIZE~0)} havoc ~i~1;havoc ~pos~0;~n~0 := 0;~found~0 := 0;call ~#set~0.base, ~#set~0.offset := #Ultimate.alloc(4 * ~SIZE~0);call ~#values~0.base, ~#values~0.offset := #Ultimate.alloc(4 * ~SIZE~0);havoc ~element~0;havoc ~v~0;~v~0 := 0; {2529#(and (= main_~v~0 0) (<= 100000 ~SIZE~0))} is VALID [2018-11-18 23:01:37,969 INFO L273 TraceCheckUtils]: 6: Hoare triple {2529#(and (= main_~v~0 0) (<= 100000 ~SIZE~0))} assume true; {2529#(and (= main_~v~0 0) (<= 100000 ~SIZE~0))} is VALID [2018-11-18 23:01:37,970 INFO L273 TraceCheckUtils]: 7: Hoare triple {2529#(and (= main_~v~0 0) (<= 100000 ~SIZE~0))} assume !!(~v~0 < ~SIZE~0);call #t~mem3 := read~int(~#values~0.base, ~#values~0.offset + 4 * ~v~0, 4); {2529#(and (= main_~v~0 0) (<= 100000 ~SIZE~0))} is VALID [2018-11-18 23:01:37,970 INFO L256 TraceCheckUtils]: 8: Hoare triple {2529#(and (= main_~v~0 0) (<= 100000 ~SIZE~0))} call #t~ret4 := elem_exists(~#set~0.base, ~#set~0.offset, ~n~0, #t~mem3); {2526#true} is VALID [2018-11-18 23:01:37,970 INFO L273 TraceCheckUtils]: 9: Hoare triple {2526#true} ~set.base, ~set.offset := #in~set.base, #in~set.offset;~size := #in~size;~value := #in~value;havoc ~i~0;~i~0 := 0; {2526#true} is VALID [2018-11-18 23:01:37,971 INFO L273 TraceCheckUtils]: 10: Hoare triple {2526#true} assume true; {2526#true} is VALID [2018-11-18 23:01:37,971 INFO L273 TraceCheckUtils]: 11: Hoare triple {2526#true} assume !(~i~0 < ~size); {2526#true} is VALID [2018-11-18 23:01:37,971 INFO L273 TraceCheckUtils]: 12: Hoare triple {2526#true} #res := 0; {2526#true} is VALID [2018-11-18 23:01:37,971 INFO L273 TraceCheckUtils]: 13: Hoare triple {2526#true} assume true; {2526#true} is VALID [2018-11-18 23:01:37,973 INFO L268 TraceCheckUtils]: 14: Hoare quadruple {2526#true} {2529#(and (= main_~v~0 0) (<= 100000 ~SIZE~0))} #132#return; {2529#(and (= main_~v~0 0) (<= 100000 ~SIZE~0))} is VALID [2018-11-18 23:01:37,973 INFO L273 TraceCheckUtils]: 15: Hoare triple {2529#(and (= main_~v~0 0) (<= 100000 ~SIZE~0))} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {2529#(and (= main_~v~0 0) (<= 100000 ~SIZE~0))} is VALID [2018-11-18 23:01:37,974 INFO L273 TraceCheckUtils]: 16: Hoare triple {2529#(and (= main_~v~0 0) (<= 100000 ~SIZE~0))} assume 1 != #t~ret4;havoc #t~mem3;havoc #t~ret4;call #t~mem5 := read~int(~#values~0.base, ~#values~0.offset + 4 * ~v~0, 4); {2529#(and (= main_~v~0 0) (<= 100000 ~SIZE~0))} is VALID [2018-11-18 23:01:37,974 INFO L256 TraceCheckUtils]: 17: Hoare triple {2529#(and (= main_~v~0 0) (<= 100000 ~SIZE~0))} call #t~ret6 := insert(~#set~0.base, ~#set~0.offset, ~n~0, #t~mem5); {2526#true} is VALID [2018-11-18 23:01:37,974 INFO L273 TraceCheckUtils]: 18: Hoare triple {2526#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; {2526#true} is VALID [2018-11-18 23:01:37,975 INFO L273 TraceCheckUtils]: 19: Hoare triple {2526#true} assume true; {2526#true} is VALID [2018-11-18 23:01:37,975 INFO L268 TraceCheckUtils]: 20: Hoare quadruple {2526#true} {2529#(and (= main_~v~0 0) (<= 100000 ~SIZE~0))} #134#return; {2529#(and (= main_~v~0 0) (<= 100000 ~SIZE~0))} is VALID [2018-11-18 23:01:37,976 INFO L273 TraceCheckUtils]: 21: Hoare triple {2529#(and (= main_~v~0 0) (<= 100000 ~SIZE~0))} assume -2147483648 <= #t~ret6 && #t~ret6 <= 2147483647;~n~0 := #t~ret6;havoc #t~ret6;havoc #t~mem5; {2529#(and (= main_~v~0 0) (<= 100000 ~SIZE~0))} is VALID [2018-11-18 23:01:37,977 INFO L273 TraceCheckUtils]: 22: Hoare triple {2529#(and (= main_~v~0 0) (<= 100000 ~SIZE~0))} #t~post2 := ~v~0;~v~0 := 1 + #t~post2;havoc #t~post2; {2530#(<= (+ main_~v~0 99999) ~SIZE~0)} is VALID [2018-11-18 23:01:37,978 INFO L273 TraceCheckUtils]: 23: Hoare triple {2530#(<= (+ main_~v~0 99999) ~SIZE~0)} assume true; {2530#(<= (+ main_~v~0 99999) ~SIZE~0)} is VALID [2018-11-18 23:01:37,978 INFO L273 TraceCheckUtils]: 24: Hoare triple {2530#(<= (+ main_~v~0 99999) ~SIZE~0)} assume !(~v~0 < ~SIZE~0); {2527#false} is VALID [2018-11-18 23:01:37,979 INFO L273 TraceCheckUtils]: 25: Hoare triple {2527#false} ~i~1 := 0; {2527#false} is VALID [2018-11-18 23:01:37,979 INFO L273 TraceCheckUtils]: 26: Hoare triple {2527#false} assume true; {2527#false} is VALID [2018-11-18 23:01:37,979 INFO L273 TraceCheckUtils]: 27: Hoare triple {2527#false} assume !!(~i~1 < ~SIZE~0 && 1 != ~found~0);call #t~mem8 := read~int(~#set~0.base, ~#set~0.offset + 4 * ~i~1, 4); {2527#false} is VALID [2018-11-18 23:01:37,979 INFO L273 TraceCheckUtils]: 28: Hoare triple {2527#false} assume !(#t~mem8 == ~element~0);havoc #t~mem8; {2527#false} is VALID [2018-11-18 23:01:37,980 INFO L273 TraceCheckUtils]: 29: Hoare triple {2527#false} #t~post7 := ~i~1;~i~1 := 1 + #t~post7;havoc #t~post7; {2527#false} is VALID [2018-11-18 23:01:37,980 INFO L273 TraceCheckUtils]: 30: Hoare triple {2527#false} assume true; {2527#false} is VALID [2018-11-18 23:01:37,980 INFO L273 TraceCheckUtils]: 31: Hoare triple {2527#false} assume !!(~i~1 < ~SIZE~0 && 1 != ~found~0);call #t~mem8 := read~int(~#set~0.base, ~#set~0.offset + 4 * ~i~1, 4); {2527#false} is VALID [2018-11-18 23:01:37,981 INFO L273 TraceCheckUtils]: 32: Hoare triple {2527#false} assume #t~mem8 == ~element~0;havoc #t~mem8;~found~0 := 1;~pos~0 := ~i~1; {2527#false} is VALID [2018-11-18 23:01:37,981 INFO L273 TraceCheckUtils]: 33: Hoare triple {2527#false} #t~post7 := ~i~1;~i~1 := 1 + #t~post7;havoc #t~post7; {2527#false} is VALID [2018-11-18 23:01:37,981 INFO L273 TraceCheckUtils]: 34: Hoare triple {2527#false} assume true; {2527#false} is VALID [2018-11-18 23:01:37,981 INFO L273 TraceCheckUtils]: 35: Hoare triple {2527#false} assume !(~i~1 < ~SIZE~0 && 1 != ~found~0); {2527#false} is VALID [2018-11-18 23:01:37,981 INFO L273 TraceCheckUtils]: 36: Hoare triple {2527#false} assume 1 == ~found~0;~i~1 := ~pos~0; {2527#false} is VALID [2018-11-18 23:01:37,982 INFO L273 TraceCheckUtils]: 37: Hoare triple {2527#false} assume true; {2527#false} is VALID [2018-11-18 23:01:37,982 INFO L273 TraceCheckUtils]: 38: Hoare triple {2527#false} assume !(~i~1 < ~SIZE~0 - 1); {2527#false} is VALID [2018-11-18 23:01:37,982 INFO L273 TraceCheckUtils]: 39: Hoare triple {2527#false} assume 1 == ~found~0;~i~1 := 0; {2527#false} is VALID [2018-11-18 23:01:37,982 INFO L273 TraceCheckUtils]: 40: Hoare triple {2527#false} assume true; {2527#false} is VALID [2018-11-18 23:01:37,982 INFO L273 TraceCheckUtils]: 41: Hoare triple {2527#false} assume !!(~i~1 < ~SIZE~0 - 1);call #t~mem12 := read~int(~#set~0.base, ~#set~0.offset + 4 * ~i~1, 4); {2527#false} is VALID [2018-11-18 23:01:37,982 INFO L256 TraceCheckUtils]: 42: Hoare triple {2527#false} call __VERIFIER_assert((if #t~mem12 != ~element~0 then 1 else 0)); {2527#false} is VALID [2018-11-18 23:01:37,983 INFO L273 TraceCheckUtils]: 43: Hoare triple {2527#false} ~cond := #in~cond; {2527#false} is VALID [2018-11-18 23:01:37,983 INFO L273 TraceCheckUtils]: 44: Hoare triple {2527#false} assume 0 == ~cond; {2527#false} is VALID [2018-11-18 23:01:37,983 INFO L273 TraceCheckUtils]: 45: Hoare triple {2527#false} assume !false; {2527#false} is VALID [2018-11-18 23:01:37,985 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-11-18 23:01:37,985 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 23:01:37,985 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-18 23:01:37,994 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 23:01:38,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 23:01:38,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 23:01:38,056 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 23:01:38,172 INFO L256 TraceCheckUtils]: 0: Hoare triple {2526#true} call ULTIMATE.init(); {2526#true} is VALID [2018-11-18 23:01:38,173 INFO L273 TraceCheckUtils]: 1: Hoare triple {2526#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~SIZE~0 := 100000; {2528#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:01:38,174 INFO L273 TraceCheckUtils]: 2: Hoare triple {2528#(<= 100000 ~SIZE~0)} assume true; {2528#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:01:38,175 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {2528#(<= 100000 ~SIZE~0)} {2526#true} #128#return; {2528#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:01:38,175 INFO L256 TraceCheckUtils]: 4: Hoare triple {2528#(<= 100000 ~SIZE~0)} call #t~ret13 := main(); {2528#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:01:38,176 INFO L273 TraceCheckUtils]: 5: Hoare triple {2528#(<= 100000 ~SIZE~0)} havoc ~i~1;havoc ~pos~0;~n~0 := 0;~found~0 := 0;call ~#set~0.base, ~#set~0.offset := #Ultimate.alloc(4 * ~SIZE~0);call ~#values~0.base, ~#values~0.offset := #Ultimate.alloc(4 * ~SIZE~0);havoc ~element~0;havoc ~v~0;~v~0 := 0; {2549#(and (<= main_~v~0 0) (<= 100000 ~SIZE~0))} is VALID [2018-11-18 23:01:38,177 INFO L273 TraceCheckUtils]: 6: Hoare triple {2549#(and (<= main_~v~0 0) (<= 100000 ~SIZE~0))} assume true; {2549#(and (<= main_~v~0 0) (<= 100000 ~SIZE~0))} is VALID [2018-11-18 23:01:38,178 INFO L273 TraceCheckUtils]: 7: Hoare triple {2549#(and (<= main_~v~0 0) (<= 100000 ~SIZE~0))} assume !!(~v~0 < ~SIZE~0);call #t~mem3 := read~int(~#values~0.base, ~#values~0.offset + 4 * ~v~0, 4); {2549#(and (<= main_~v~0 0) (<= 100000 ~SIZE~0))} is VALID [2018-11-18 23:01:38,183 INFO L256 TraceCheckUtils]: 8: Hoare triple {2549#(and (<= main_~v~0 0) (<= 100000 ~SIZE~0))} call #t~ret4 := elem_exists(~#set~0.base, ~#set~0.offset, ~n~0, #t~mem3); {2528#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:01:38,185 INFO L273 TraceCheckUtils]: 9: Hoare triple {2528#(<= 100000 ~SIZE~0)} ~set.base, ~set.offset := #in~set.base, #in~set.offset;~size := #in~size;~value := #in~value;havoc ~i~0;~i~0 := 0; {2528#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:01:38,185 INFO L273 TraceCheckUtils]: 10: Hoare triple {2528#(<= 100000 ~SIZE~0)} assume true; {2528#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:01:38,186 INFO L273 TraceCheckUtils]: 11: Hoare triple {2528#(<= 100000 ~SIZE~0)} assume !(~i~0 < ~size); {2528#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:01:38,187 INFO L273 TraceCheckUtils]: 12: Hoare triple {2528#(<= 100000 ~SIZE~0)} #res := 0; {2528#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:01:38,188 INFO L273 TraceCheckUtils]: 13: Hoare triple {2528#(<= 100000 ~SIZE~0)} assume true; {2528#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:01:38,189 INFO L268 TraceCheckUtils]: 14: Hoare quadruple {2528#(<= 100000 ~SIZE~0)} {2549#(and (<= main_~v~0 0) (<= 100000 ~SIZE~0))} #132#return; {2549#(and (<= main_~v~0 0) (<= 100000 ~SIZE~0))} is VALID [2018-11-18 23:01:38,190 INFO L273 TraceCheckUtils]: 15: Hoare triple {2549#(and (<= main_~v~0 0) (<= 100000 ~SIZE~0))} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {2549#(and (<= main_~v~0 0) (<= 100000 ~SIZE~0))} is VALID [2018-11-18 23:01:38,191 INFO L273 TraceCheckUtils]: 16: Hoare triple {2549#(and (<= main_~v~0 0) (<= 100000 ~SIZE~0))} assume 1 != #t~ret4;havoc #t~mem3;havoc #t~ret4;call #t~mem5 := read~int(~#values~0.base, ~#values~0.offset + 4 * ~v~0, 4); {2549#(and (<= main_~v~0 0) (<= 100000 ~SIZE~0))} is VALID [2018-11-18 23:01:38,192 INFO L256 TraceCheckUtils]: 17: Hoare triple {2549#(and (<= main_~v~0 0) (<= 100000 ~SIZE~0))} call #t~ret6 := insert(~#set~0.base, ~#set~0.offset, ~n~0, #t~mem5); {2528#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:01:38,193 INFO L273 TraceCheckUtils]: 18: Hoare triple {2528#(<= 100000 ~SIZE~0)} ~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; {2528#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:01:38,193 INFO L273 TraceCheckUtils]: 19: Hoare triple {2528#(<= 100000 ~SIZE~0)} assume true; {2528#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:01:38,195 INFO L268 TraceCheckUtils]: 20: Hoare quadruple {2528#(<= 100000 ~SIZE~0)} {2549#(and (<= main_~v~0 0) (<= 100000 ~SIZE~0))} #134#return; {2549#(and (<= main_~v~0 0) (<= 100000 ~SIZE~0))} is VALID [2018-11-18 23:01:38,196 INFO L273 TraceCheckUtils]: 21: Hoare triple {2549#(and (<= main_~v~0 0) (<= 100000 ~SIZE~0))} assume -2147483648 <= #t~ret6 && #t~ret6 <= 2147483647;~n~0 := #t~ret6;havoc #t~ret6;havoc #t~mem5; {2549#(and (<= main_~v~0 0) (<= 100000 ~SIZE~0))} is VALID [2018-11-18 23:01:38,197 INFO L273 TraceCheckUtils]: 22: Hoare triple {2549#(and (<= main_~v~0 0) (<= 100000 ~SIZE~0))} #t~post2 := ~v~0;~v~0 := 1 + #t~post2;havoc #t~post2; {2601#(and (<= main_~v~0 1) (<= 100000 ~SIZE~0))} is VALID [2018-11-18 23:01:38,197 INFO L273 TraceCheckUtils]: 23: Hoare triple {2601#(and (<= main_~v~0 1) (<= 100000 ~SIZE~0))} assume true; {2601#(and (<= main_~v~0 1) (<= 100000 ~SIZE~0))} is VALID [2018-11-18 23:01:38,198 INFO L273 TraceCheckUtils]: 24: Hoare triple {2601#(and (<= main_~v~0 1) (<= 100000 ~SIZE~0))} assume !(~v~0 < ~SIZE~0); {2527#false} is VALID [2018-11-18 23:01:38,199 INFO L273 TraceCheckUtils]: 25: Hoare triple {2527#false} ~i~1 := 0; {2527#false} is VALID [2018-11-18 23:01:38,199 INFO L273 TraceCheckUtils]: 26: Hoare triple {2527#false} assume true; {2527#false} is VALID [2018-11-18 23:01:38,199 INFO L273 TraceCheckUtils]: 27: Hoare triple {2527#false} assume !!(~i~1 < ~SIZE~0 && 1 != ~found~0);call #t~mem8 := read~int(~#set~0.base, ~#set~0.offset + 4 * ~i~1, 4); {2527#false} is VALID [2018-11-18 23:01:38,200 INFO L273 TraceCheckUtils]: 28: Hoare triple {2527#false} assume !(#t~mem8 == ~element~0);havoc #t~mem8; {2527#false} is VALID [2018-11-18 23:01:38,200 INFO L273 TraceCheckUtils]: 29: Hoare triple {2527#false} #t~post7 := ~i~1;~i~1 := 1 + #t~post7;havoc #t~post7; {2527#false} is VALID [2018-11-18 23:01:38,200 INFO L273 TraceCheckUtils]: 30: Hoare triple {2527#false} assume true; {2527#false} is VALID [2018-11-18 23:01:38,201 INFO L273 TraceCheckUtils]: 31: Hoare triple {2527#false} assume !!(~i~1 < ~SIZE~0 && 1 != ~found~0);call #t~mem8 := read~int(~#set~0.base, ~#set~0.offset + 4 * ~i~1, 4); {2527#false} is VALID [2018-11-18 23:01:38,201 INFO L273 TraceCheckUtils]: 32: Hoare triple {2527#false} assume #t~mem8 == ~element~0;havoc #t~mem8;~found~0 := 1;~pos~0 := ~i~1; {2527#false} is VALID [2018-11-18 23:01:38,201 INFO L273 TraceCheckUtils]: 33: Hoare triple {2527#false} #t~post7 := ~i~1;~i~1 := 1 + #t~post7;havoc #t~post7; {2527#false} is VALID [2018-11-18 23:01:38,201 INFO L273 TraceCheckUtils]: 34: Hoare triple {2527#false} assume true; {2527#false} is VALID [2018-11-18 23:01:38,202 INFO L273 TraceCheckUtils]: 35: Hoare triple {2527#false} assume !(~i~1 < ~SIZE~0 && 1 != ~found~0); {2527#false} is VALID [2018-11-18 23:01:38,202 INFO L273 TraceCheckUtils]: 36: Hoare triple {2527#false} assume 1 == ~found~0;~i~1 := ~pos~0; {2527#false} is VALID [2018-11-18 23:01:38,202 INFO L273 TraceCheckUtils]: 37: Hoare triple {2527#false} assume true; {2527#false} is VALID [2018-11-18 23:01:38,202 INFO L273 TraceCheckUtils]: 38: Hoare triple {2527#false} assume !(~i~1 < ~SIZE~0 - 1); {2527#false} is VALID [2018-11-18 23:01:38,202 INFO L273 TraceCheckUtils]: 39: Hoare triple {2527#false} assume 1 == ~found~0;~i~1 := 0; {2527#false} is VALID [2018-11-18 23:01:38,203 INFO L273 TraceCheckUtils]: 40: Hoare triple {2527#false} assume true; {2527#false} is VALID [2018-11-18 23:01:38,203 INFO L273 TraceCheckUtils]: 41: Hoare triple {2527#false} assume !!(~i~1 < ~SIZE~0 - 1);call #t~mem12 := read~int(~#set~0.base, ~#set~0.offset + 4 * ~i~1, 4); {2527#false} is VALID [2018-11-18 23:01:38,203 INFO L256 TraceCheckUtils]: 42: Hoare triple {2527#false} call __VERIFIER_assert((if #t~mem12 != ~element~0 then 1 else 0)); {2527#false} is VALID [2018-11-18 23:01:38,203 INFO L273 TraceCheckUtils]: 43: Hoare triple {2527#false} ~cond := #in~cond; {2527#false} is VALID [2018-11-18 23:01:38,203 INFO L273 TraceCheckUtils]: 44: Hoare triple {2527#false} assume 0 == ~cond; {2527#false} is VALID [2018-11-18 23:01:38,204 INFO L273 TraceCheckUtils]: 45: Hoare triple {2527#false} assume !false; {2527#false} is VALID [2018-11-18 23:01:38,206 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-11-18 23:01:38,225 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-18 23:01:38,225 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 7 [2018-11-18 23:01:38,226 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 46 [2018-11-18 23:01:38,226 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-18 23:01:38,226 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states. [2018-11-18 23:01:38,364 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 62 edges. 62 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 23:01:38,365 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-18 23:01:38,365 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-18 23:01:38,365 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=22, Unknown=0, NotChecked=0, Total=42 [2018-11-18 23:01:38,365 INFO L87 Difference]: Start difference. First operand 73 states and 82 transitions. Second operand 7 states. [2018-11-18 23:01:39,013 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 23:01:39,013 INFO L93 Difference]: Finished difference Result 124 states and 143 transitions. [2018-11-18 23:01:39,013 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-18 23:01:39,014 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 46 [2018-11-18 23:01:39,014 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 23:01:39,015 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-11-18 23:01:39,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 99 transitions. [2018-11-18 23:01:39,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-11-18 23:01:39,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 99 transitions. [2018-11-18 23:01:39,021 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 99 transitions. [2018-11-18 23:01:39,182 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 99 edges. 99 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 23:01:39,185 INFO L225 Difference]: With dead ends: 124 [2018-11-18 23:01:39,185 INFO L226 Difference]: Without dead ends: 88 [2018-11-18 23:01:39,186 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=22, Unknown=0, NotChecked=0, Total=42 [2018-11-18 23:01:39,187 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2018-11-18 23:01:39,255 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 80. [2018-11-18 23:01:39,255 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-18 23:01:39,255 INFO L82 GeneralOperation]: Start isEquivalent. First operand 88 states. Second operand 80 states. [2018-11-18 23:01:39,255 INFO L74 IsIncluded]: Start isIncluded. First operand 88 states. Second operand 80 states. [2018-11-18 23:01:39,255 INFO L87 Difference]: Start difference. First operand 88 states. Second operand 80 states. [2018-11-18 23:01:39,259 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 23:01:39,259 INFO L93 Difference]: Finished difference Result 88 states and 103 transitions. [2018-11-18 23:01:39,259 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 103 transitions. [2018-11-18 23:01:39,259 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 23:01:39,260 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 23:01:39,260 INFO L74 IsIncluded]: Start isIncluded. First operand 80 states. Second operand 88 states. [2018-11-18 23:01:39,260 INFO L87 Difference]: Start difference. First operand 80 states. Second operand 88 states. [2018-11-18 23:01:39,263 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 23:01:39,263 INFO L93 Difference]: Finished difference Result 88 states and 103 transitions. [2018-11-18 23:01:39,263 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 103 transitions. [2018-11-18 23:01:39,263 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 23:01:39,263 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 23:01:39,263 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-18 23:01:39,264 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-18 23:01:39,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80 states. [2018-11-18 23:01:39,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 90 transitions. [2018-11-18 23:01:39,266 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 90 transitions. Word has length 46 [2018-11-18 23:01:39,266 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 23:01:39,266 INFO L480 AbstractCegarLoop]: Abstraction has 80 states and 90 transitions. [2018-11-18 23:01:39,266 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-18 23:01:39,266 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 90 transitions. [2018-11-18 23:01:39,267 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2018-11-18 23:01:39,267 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 23:01:39,267 INFO L375 BasicCegarLoop]: trace histogram [3, 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, 1, 1, 1, 1, 1, 1] [2018-11-18 23:01:39,267 INFO L423 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 23:01:39,268 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 23:01:39,268 INFO L82 PathProgramCache]: Analyzing trace with hash 1744311340, now seen corresponding path program 1 times [2018-11-18 23:01:39,268 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 23:01:39,268 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 23:01:39,269 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 23:01:39,269 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 23:01:39,269 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 23:01:39,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 23:01:39,427 INFO L256 TraceCheckUtils]: 0: Hoare triple {3112#true} call ULTIMATE.init(); {3112#true} is VALID [2018-11-18 23:01:39,427 INFO L273 TraceCheckUtils]: 1: Hoare triple {3112#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~SIZE~0 := 100000; {3114#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:01:39,428 INFO L273 TraceCheckUtils]: 2: Hoare triple {3114#(<= 100000 ~SIZE~0)} assume true; {3114#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:01:39,428 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {3114#(<= 100000 ~SIZE~0)} {3112#true} #128#return; {3114#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:01:39,429 INFO L256 TraceCheckUtils]: 4: Hoare triple {3114#(<= 100000 ~SIZE~0)} call #t~ret13 := main(); {3114#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:01:39,429 INFO L273 TraceCheckUtils]: 5: Hoare triple {3114#(<= 100000 ~SIZE~0)} havoc ~i~1;havoc ~pos~0;~n~0 := 0;~found~0 := 0;call ~#set~0.base, ~#set~0.offset := #Ultimate.alloc(4 * ~SIZE~0);call ~#values~0.base, ~#values~0.offset := #Ultimate.alloc(4 * ~SIZE~0);havoc ~element~0;havoc ~v~0;~v~0 := 0; {3115#(and (= main_~v~0 0) (<= 100000 ~SIZE~0))} is VALID [2018-11-18 23:01:39,430 INFO L273 TraceCheckUtils]: 6: Hoare triple {3115#(and (= main_~v~0 0) (<= 100000 ~SIZE~0))} assume true; {3115#(and (= main_~v~0 0) (<= 100000 ~SIZE~0))} is VALID [2018-11-18 23:01:39,431 INFO L273 TraceCheckUtils]: 7: Hoare triple {3115#(and (= main_~v~0 0) (<= 100000 ~SIZE~0))} assume !!(~v~0 < ~SIZE~0);call #t~mem3 := read~int(~#values~0.base, ~#values~0.offset + 4 * ~v~0, 4); {3115#(and (= main_~v~0 0) (<= 100000 ~SIZE~0))} is VALID [2018-11-18 23:01:39,431 INFO L256 TraceCheckUtils]: 8: Hoare triple {3115#(and (= main_~v~0 0) (<= 100000 ~SIZE~0))} call #t~ret4 := elem_exists(~#set~0.base, ~#set~0.offset, ~n~0, #t~mem3); {3112#true} is VALID [2018-11-18 23:01:39,431 INFO L273 TraceCheckUtils]: 9: Hoare triple {3112#true} ~set.base, ~set.offset := #in~set.base, #in~set.offset;~size := #in~size;~value := #in~value;havoc ~i~0;~i~0 := 0; {3112#true} is VALID [2018-11-18 23:01:39,431 INFO L273 TraceCheckUtils]: 10: Hoare triple {3112#true} assume true; {3112#true} is VALID [2018-11-18 23:01:39,432 INFO L273 TraceCheckUtils]: 11: Hoare triple {3112#true} assume !(~i~0 < ~size); {3112#true} is VALID [2018-11-18 23:01:39,432 INFO L273 TraceCheckUtils]: 12: Hoare triple {3112#true} #res := 0; {3112#true} is VALID [2018-11-18 23:01:39,432 INFO L273 TraceCheckUtils]: 13: Hoare triple {3112#true} assume true; {3112#true} is VALID [2018-11-18 23:01:39,440 INFO L268 TraceCheckUtils]: 14: Hoare quadruple {3112#true} {3115#(and (= main_~v~0 0) (<= 100000 ~SIZE~0))} #132#return; {3115#(and (= main_~v~0 0) (<= 100000 ~SIZE~0))} is VALID [2018-11-18 23:01:39,442 INFO L273 TraceCheckUtils]: 15: Hoare triple {3115#(and (= main_~v~0 0) (<= 100000 ~SIZE~0))} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {3115#(and (= main_~v~0 0) (<= 100000 ~SIZE~0))} is VALID [2018-11-18 23:01:39,444 INFO L273 TraceCheckUtils]: 16: Hoare triple {3115#(and (= main_~v~0 0) (<= 100000 ~SIZE~0))} assume 1 != #t~ret4;havoc #t~mem3;havoc #t~ret4;call #t~mem5 := read~int(~#values~0.base, ~#values~0.offset + 4 * ~v~0, 4); {3115#(and (= main_~v~0 0) (<= 100000 ~SIZE~0))} is VALID [2018-11-18 23:01:39,444 INFO L256 TraceCheckUtils]: 17: Hoare triple {3115#(and (= main_~v~0 0) (<= 100000 ~SIZE~0))} call #t~ret6 := insert(~#set~0.base, ~#set~0.offset, ~n~0, #t~mem5); {3112#true} is VALID [2018-11-18 23:01:39,444 INFO L273 TraceCheckUtils]: 18: Hoare triple {3112#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; {3112#true} is VALID [2018-11-18 23:01:39,445 INFO L273 TraceCheckUtils]: 19: Hoare triple {3112#true} assume true; {3112#true} is VALID [2018-11-18 23:01:39,450 INFO L268 TraceCheckUtils]: 20: Hoare quadruple {3112#true} {3115#(and (= main_~v~0 0) (<= 100000 ~SIZE~0))} #134#return; {3115#(and (= main_~v~0 0) (<= 100000 ~SIZE~0))} is VALID [2018-11-18 23:01:39,450 INFO L273 TraceCheckUtils]: 21: Hoare triple {3115#(and (= main_~v~0 0) (<= 100000 ~SIZE~0))} assume -2147483648 <= #t~ret6 && #t~ret6 <= 2147483647;~n~0 := #t~ret6;havoc #t~ret6;havoc #t~mem5; {3115#(and (= main_~v~0 0) (<= 100000 ~SIZE~0))} is VALID [2018-11-18 23:01:39,451 INFO L273 TraceCheckUtils]: 22: Hoare triple {3115#(and (= main_~v~0 0) (<= 100000 ~SIZE~0))} #t~post2 := ~v~0;~v~0 := 1 + #t~post2;havoc #t~post2; {3116#(<= (+ main_~v~0 99999) ~SIZE~0)} is VALID [2018-11-18 23:01:39,451 INFO L273 TraceCheckUtils]: 23: Hoare triple {3116#(<= (+ main_~v~0 99999) ~SIZE~0)} assume true; {3116#(<= (+ main_~v~0 99999) ~SIZE~0)} is VALID [2018-11-18 23:01:39,452 INFO L273 TraceCheckUtils]: 24: Hoare triple {3116#(<= (+ main_~v~0 99999) ~SIZE~0)} assume !!(~v~0 < ~SIZE~0);call #t~mem3 := read~int(~#values~0.base, ~#values~0.offset + 4 * ~v~0, 4); {3116#(<= (+ main_~v~0 99999) ~SIZE~0)} is VALID [2018-11-18 23:01:39,452 INFO L256 TraceCheckUtils]: 25: Hoare triple {3116#(<= (+ main_~v~0 99999) ~SIZE~0)} call #t~ret4 := elem_exists(~#set~0.base, ~#set~0.offset, ~n~0, #t~mem3); {3112#true} is VALID [2018-11-18 23:01:39,452 INFO L273 TraceCheckUtils]: 26: Hoare triple {3112#true} ~set.base, ~set.offset := #in~set.base, #in~set.offset;~size := #in~size;~value := #in~value;havoc ~i~0;~i~0 := 0; {3112#true} is VALID [2018-11-18 23:01:39,452 INFO L273 TraceCheckUtils]: 27: Hoare triple {3112#true} assume true; {3112#true} is VALID [2018-11-18 23:01:39,452 INFO L273 TraceCheckUtils]: 28: Hoare triple {3112#true} assume !!(~i~0 < ~size);call #t~mem1 := read~int(~set.base, ~set.offset + 4 * ~i~0, 4); {3112#true} is VALID [2018-11-18 23:01:39,452 INFO L273 TraceCheckUtils]: 29: Hoare triple {3112#true} assume #t~mem1 == ~value;havoc #t~mem1;#res := 1; {3112#true} is VALID [2018-11-18 23:01:39,453 INFO L273 TraceCheckUtils]: 30: Hoare triple {3112#true} assume true; {3112#true} is VALID [2018-11-18 23:01:39,453 INFO L268 TraceCheckUtils]: 31: Hoare quadruple {3112#true} {3116#(<= (+ main_~v~0 99999) ~SIZE~0)} #132#return; {3116#(<= (+ main_~v~0 99999) ~SIZE~0)} is VALID [2018-11-18 23:01:39,454 INFO L273 TraceCheckUtils]: 32: Hoare triple {3116#(<= (+ main_~v~0 99999) ~SIZE~0)} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {3116#(<= (+ main_~v~0 99999) ~SIZE~0)} is VALID [2018-11-18 23:01:39,454 INFO L273 TraceCheckUtils]: 33: Hoare triple {3116#(<= (+ main_~v~0 99999) ~SIZE~0)} assume !(1 != #t~ret4);havoc #t~mem3;havoc #t~ret4; {3116#(<= (+ main_~v~0 99999) ~SIZE~0)} is VALID [2018-11-18 23:01:39,455 INFO L273 TraceCheckUtils]: 34: Hoare triple {3116#(<= (+ main_~v~0 99999) ~SIZE~0)} #t~post2 := ~v~0;~v~0 := 1 + #t~post2;havoc #t~post2; {3117#(<= (+ main_~v~0 99998) ~SIZE~0)} is VALID [2018-11-18 23:01:39,455 INFO L273 TraceCheckUtils]: 35: Hoare triple {3117#(<= (+ main_~v~0 99998) ~SIZE~0)} assume true; {3117#(<= (+ main_~v~0 99998) ~SIZE~0)} is VALID [2018-11-18 23:01:39,456 INFO L273 TraceCheckUtils]: 36: Hoare triple {3117#(<= (+ main_~v~0 99998) ~SIZE~0)} assume !(~v~0 < ~SIZE~0); {3113#false} is VALID [2018-11-18 23:01:39,456 INFO L273 TraceCheckUtils]: 37: Hoare triple {3113#false} ~i~1 := 0; {3113#false} is VALID [2018-11-18 23:01:39,456 INFO L273 TraceCheckUtils]: 38: Hoare triple {3113#false} assume true; {3113#false} is VALID [2018-11-18 23:01:39,457 INFO L273 TraceCheckUtils]: 39: Hoare triple {3113#false} assume !!(~i~1 < ~SIZE~0 && 1 != ~found~0);call #t~mem8 := read~int(~#set~0.base, ~#set~0.offset + 4 * ~i~1, 4); {3113#false} is VALID [2018-11-18 23:01:39,457 INFO L273 TraceCheckUtils]: 40: Hoare triple {3113#false} assume !(#t~mem8 == ~element~0);havoc #t~mem8; {3113#false} is VALID [2018-11-18 23:01:39,457 INFO L273 TraceCheckUtils]: 41: Hoare triple {3113#false} #t~post7 := ~i~1;~i~1 := 1 + #t~post7;havoc #t~post7; {3113#false} is VALID [2018-11-18 23:01:39,458 INFO L273 TraceCheckUtils]: 42: Hoare triple {3113#false} assume true; {3113#false} is VALID [2018-11-18 23:01:39,458 INFO L273 TraceCheckUtils]: 43: Hoare triple {3113#false} assume !!(~i~1 < ~SIZE~0 && 1 != ~found~0);call #t~mem8 := read~int(~#set~0.base, ~#set~0.offset + 4 * ~i~1, 4); {3113#false} is VALID [2018-11-18 23:01:39,458 INFO L273 TraceCheckUtils]: 44: Hoare triple {3113#false} assume #t~mem8 == ~element~0;havoc #t~mem8;~found~0 := 1;~pos~0 := ~i~1; {3113#false} is VALID [2018-11-18 23:01:39,458 INFO L273 TraceCheckUtils]: 45: Hoare triple {3113#false} #t~post7 := ~i~1;~i~1 := 1 + #t~post7;havoc #t~post7; {3113#false} is VALID [2018-11-18 23:01:39,459 INFO L273 TraceCheckUtils]: 46: Hoare triple {3113#false} assume true; {3113#false} is VALID [2018-11-18 23:01:39,459 INFO L273 TraceCheckUtils]: 47: Hoare triple {3113#false} assume !(~i~1 < ~SIZE~0 && 1 != ~found~0); {3113#false} is VALID [2018-11-18 23:01:39,459 INFO L273 TraceCheckUtils]: 48: Hoare triple {3113#false} assume 1 == ~found~0;~i~1 := ~pos~0; {3113#false} is VALID [2018-11-18 23:01:39,459 INFO L273 TraceCheckUtils]: 49: Hoare triple {3113#false} assume true; {3113#false} is VALID [2018-11-18 23:01:39,459 INFO L273 TraceCheckUtils]: 50: Hoare triple {3113#false} assume !(~i~1 < ~SIZE~0 - 1); {3113#false} is VALID [2018-11-18 23:01:39,460 INFO L273 TraceCheckUtils]: 51: Hoare triple {3113#false} assume 1 == ~found~0;~i~1 := 0; {3113#false} is VALID [2018-11-18 23:01:39,460 INFO L273 TraceCheckUtils]: 52: Hoare triple {3113#false} assume true; {3113#false} is VALID [2018-11-18 23:01:39,460 INFO L273 TraceCheckUtils]: 53: Hoare triple {3113#false} assume !!(~i~1 < ~SIZE~0 - 1);call #t~mem12 := read~int(~#set~0.base, ~#set~0.offset + 4 * ~i~1, 4); {3113#false} is VALID [2018-11-18 23:01:39,460 INFO L256 TraceCheckUtils]: 54: Hoare triple {3113#false} call __VERIFIER_assert((if #t~mem12 != ~element~0 then 1 else 0)); {3113#false} is VALID [2018-11-18 23:01:39,460 INFO L273 TraceCheckUtils]: 55: Hoare triple {3113#false} ~cond := #in~cond; {3113#false} is VALID [2018-11-18 23:01:39,461 INFO L273 TraceCheckUtils]: 56: Hoare triple {3113#false} assume 0 == ~cond; {3113#false} is VALID [2018-11-18 23:01:39,461 INFO L273 TraceCheckUtils]: 57: Hoare triple {3113#false} assume !false; {3113#false} is VALID [2018-11-18 23:01:39,463 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2018-11-18 23:01:39,463 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 23:01:39,463 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 23:01:39,473 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 23:01:39,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 23:01:39,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 23:01:39,556 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 23:01:39,866 INFO L256 TraceCheckUtils]: 0: Hoare triple {3112#true} call ULTIMATE.init(); {3112#true} is VALID [2018-11-18 23:01:39,867 INFO L273 TraceCheckUtils]: 1: Hoare triple {3112#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~SIZE~0 := 100000; {3114#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:01:39,867 INFO L273 TraceCheckUtils]: 2: Hoare triple {3114#(<= 100000 ~SIZE~0)} assume true; {3114#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:01:39,868 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {3114#(<= 100000 ~SIZE~0)} {3112#true} #128#return; {3114#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:01:39,868 INFO L256 TraceCheckUtils]: 4: Hoare triple {3114#(<= 100000 ~SIZE~0)} call #t~ret13 := main(); {3114#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:01:39,869 INFO L273 TraceCheckUtils]: 5: Hoare triple {3114#(<= 100000 ~SIZE~0)} havoc ~i~1;havoc ~pos~0;~n~0 := 0;~found~0 := 0;call ~#set~0.base, ~#set~0.offset := #Ultimate.alloc(4 * ~SIZE~0);call ~#values~0.base, ~#values~0.offset := #Ultimate.alloc(4 * ~SIZE~0);havoc ~element~0;havoc ~v~0;~v~0 := 0; {3136#(and (<= main_~v~0 0) (<= 100000 ~SIZE~0))} is VALID [2018-11-18 23:01:39,870 INFO L273 TraceCheckUtils]: 6: Hoare triple {3136#(and (<= main_~v~0 0) (<= 100000 ~SIZE~0))} assume true; {3136#(and (<= main_~v~0 0) (<= 100000 ~SIZE~0))} is VALID [2018-11-18 23:01:39,871 INFO L273 TraceCheckUtils]: 7: Hoare triple {3136#(and (<= main_~v~0 0) (<= 100000 ~SIZE~0))} assume !!(~v~0 < ~SIZE~0);call #t~mem3 := read~int(~#values~0.base, ~#values~0.offset + 4 * ~v~0, 4); {3136#(and (<= main_~v~0 0) (<= 100000 ~SIZE~0))} is VALID [2018-11-18 23:01:39,872 INFO L256 TraceCheckUtils]: 8: Hoare triple {3136#(and (<= main_~v~0 0) (<= 100000 ~SIZE~0))} call #t~ret4 := elem_exists(~#set~0.base, ~#set~0.offset, ~n~0, #t~mem3); {3114#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:01:39,873 INFO L273 TraceCheckUtils]: 9: Hoare triple {3114#(<= 100000 ~SIZE~0)} ~set.base, ~set.offset := #in~set.base, #in~set.offset;~size := #in~size;~value := #in~value;havoc ~i~0;~i~0 := 0; {3114#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:01:39,874 INFO L273 TraceCheckUtils]: 10: Hoare triple {3114#(<= 100000 ~SIZE~0)} assume true; {3114#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:01:39,874 INFO L273 TraceCheckUtils]: 11: Hoare triple {3114#(<= 100000 ~SIZE~0)} assume !(~i~0 < ~size); {3114#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:01:39,875 INFO L273 TraceCheckUtils]: 12: Hoare triple {3114#(<= 100000 ~SIZE~0)} #res := 0; {3114#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:01:39,875 INFO L273 TraceCheckUtils]: 13: Hoare triple {3114#(<= 100000 ~SIZE~0)} assume true; {3114#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:01:39,877 INFO L268 TraceCheckUtils]: 14: Hoare quadruple {3114#(<= 100000 ~SIZE~0)} {3136#(and (<= main_~v~0 0) (<= 100000 ~SIZE~0))} #132#return; {3136#(and (<= main_~v~0 0) (<= 100000 ~SIZE~0))} is VALID [2018-11-18 23:01:39,878 INFO L273 TraceCheckUtils]: 15: Hoare triple {3136#(and (<= main_~v~0 0) (<= 100000 ~SIZE~0))} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {3136#(and (<= main_~v~0 0) (<= 100000 ~SIZE~0))} is VALID [2018-11-18 23:01:39,879 INFO L273 TraceCheckUtils]: 16: Hoare triple {3136#(and (<= main_~v~0 0) (<= 100000 ~SIZE~0))} assume 1 != #t~ret4;havoc #t~mem3;havoc #t~ret4;call #t~mem5 := read~int(~#values~0.base, ~#values~0.offset + 4 * ~v~0, 4); {3136#(and (<= main_~v~0 0) (<= 100000 ~SIZE~0))} is VALID [2018-11-18 23:01:39,881 INFO L256 TraceCheckUtils]: 17: Hoare triple {3136#(and (<= main_~v~0 0) (<= 100000 ~SIZE~0))} call #t~ret6 := insert(~#set~0.base, ~#set~0.offset, ~n~0, #t~mem5); {3114#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:01:39,881 INFO L273 TraceCheckUtils]: 18: Hoare triple {3114#(<= 100000 ~SIZE~0)} ~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; {3114#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:01:39,882 INFO L273 TraceCheckUtils]: 19: Hoare triple {3114#(<= 100000 ~SIZE~0)} assume true; {3114#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:01:39,883 INFO L268 TraceCheckUtils]: 20: Hoare quadruple {3114#(<= 100000 ~SIZE~0)} {3136#(and (<= main_~v~0 0) (<= 100000 ~SIZE~0))} #134#return; {3136#(and (<= main_~v~0 0) (<= 100000 ~SIZE~0))} is VALID [2018-11-18 23:01:39,884 INFO L273 TraceCheckUtils]: 21: Hoare triple {3136#(and (<= main_~v~0 0) (<= 100000 ~SIZE~0))} assume -2147483648 <= #t~ret6 && #t~ret6 <= 2147483647;~n~0 := #t~ret6;havoc #t~ret6;havoc #t~mem5; {3136#(and (<= main_~v~0 0) (<= 100000 ~SIZE~0))} is VALID [2018-11-18 23:01:39,889 INFO L273 TraceCheckUtils]: 22: Hoare triple {3136#(and (<= main_~v~0 0) (<= 100000 ~SIZE~0))} #t~post2 := ~v~0;~v~0 := 1 + #t~post2;havoc #t~post2; {3188#(and (<= main_~v~0 1) (<= 100000 ~SIZE~0))} is VALID [2018-11-18 23:01:39,889 INFO L273 TraceCheckUtils]: 23: Hoare triple {3188#(and (<= main_~v~0 1) (<= 100000 ~SIZE~0))} assume true; {3188#(and (<= main_~v~0 1) (<= 100000 ~SIZE~0))} is VALID [2018-11-18 23:01:39,890 INFO L273 TraceCheckUtils]: 24: Hoare triple {3188#(and (<= main_~v~0 1) (<= 100000 ~SIZE~0))} assume !!(~v~0 < ~SIZE~0);call #t~mem3 := read~int(~#values~0.base, ~#values~0.offset + 4 * ~v~0, 4); {3188#(and (<= main_~v~0 1) (<= 100000 ~SIZE~0))} is VALID [2018-11-18 23:01:39,891 INFO L256 TraceCheckUtils]: 25: Hoare triple {3188#(and (<= main_~v~0 1) (<= 100000 ~SIZE~0))} call #t~ret4 := elem_exists(~#set~0.base, ~#set~0.offset, ~n~0, #t~mem3); {3114#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:01:39,891 INFO L273 TraceCheckUtils]: 26: Hoare triple {3114#(<= 100000 ~SIZE~0)} ~set.base, ~set.offset := #in~set.base, #in~set.offset;~size := #in~size;~value := #in~value;havoc ~i~0;~i~0 := 0; {3114#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:01:39,892 INFO L273 TraceCheckUtils]: 27: Hoare triple {3114#(<= 100000 ~SIZE~0)} assume true; {3114#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:01:39,892 INFO L273 TraceCheckUtils]: 28: Hoare triple {3114#(<= 100000 ~SIZE~0)} assume !!(~i~0 < ~size);call #t~mem1 := read~int(~set.base, ~set.offset + 4 * ~i~0, 4); {3114#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:01:39,893 INFO L273 TraceCheckUtils]: 29: Hoare triple {3114#(<= 100000 ~SIZE~0)} assume #t~mem1 == ~value;havoc #t~mem1;#res := 1; {3114#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:01:39,894 INFO L273 TraceCheckUtils]: 30: Hoare triple {3114#(<= 100000 ~SIZE~0)} assume true; {3114#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:01:39,895 INFO L268 TraceCheckUtils]: 31: Hoare quadruple {3114#(<= 100000 ~SIZE~0)} {3188#(and (<= main_~v~0 1) (<= 100000 ~SIZE~0))} #132#return; {3188#(and (<= main_~v~0 1) (<= 100000 ~SIZE~0))} is VALID [2018-11-18 23:01:39,896 INFO L273 TraceCheckUtils]: 32: Hoare triple {3188#(and (<= main_~v~0 1) (<= 100000 ~SIZE~0))} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {3188#(and (<= main_~v~0 1) (<= 100000 ~SIZE~0))} is VALID [2018-11-18 23:01:39,897 INFO L273 TraceCheckUtils]: 33: Hoare triple {3188#(and (<= main_~v~0 1) (<= 100000 ~SIZE~0))} assume !(1 != #t~ret4);havoc #t~mem3;havoc #t~ret4; {3188#(and (<= main_~v~0 1) (<= 100000 ~SIZE~0))} is VALID [2018-11-18 23:01:39,898 INFO L273 TraceCheckUtils]: 34: Hoare triple {3188#(and (<= main_~v~0 1) (<= 100000 ~SIZE~0))} #t~post2 := ~v~0;~v~0 := 1 + #t~post2;havoc #t~post2; {3225#(and (<= main_~v~0 2) (<= 100000 ~SIZE~0))} is VALID [2018-11-18 23:01:39,898 INFO L273 TraceCheckUtils]: 35: Hoare triple {3225#(and (<= main_~v~0 2) (<= 100000 ~SIZE~0))} assume true; {3225#(and (<= main_~v~0 2) (<= 100000 ~SIZE~0))} is VALID [2018-11-18 23:01:39,899 INFO L273 TraceCheckUtils]: 36: Hoare triple {3225#(and (<= main_~v~0 2) (<= 100000 ~SIZE~0))} assume !(~v~0 < ~SIZE~0); {3113#false} is VALID [2018-11-18 23:01:39,899 INFO L273 TraceCheckUtils]: 37: Hoare triple {3113#false} ~i~1 := 0; {3113#false} is VALID [2018-11-18 23:01:39,900 INFO L273 TraceCheckUtils]: 38: Hoare triple {3113#false} assume true; {3113#false} is VALID [2018-11-18 23:01:39,900 INFO L273 TraceCheckUtils]: 39: Hoare triple {3113#false} assume !!(~i~1 < ~SIZE~0 && 1 != ~found~0);call #t~mem8 := read~int(~#set~0.base, ~#set~0.offset + 4 * ~i~1, 4); {3113#false} is VALID [2018-11-18 23:01:39,900 INFO L273 TraceCheckUtils]: 40: Hoare triple {3113#false} assume !(#t~mem8 == ~element~0);havoc #t~mem8; {3113#false} is VALID [2018-11-18 23:01:39,900 INFO L273 TraceCheckUtils]: 41: Hoare triple {3113#false} #t~post7 := ~i~1;~i~1 := 1 + #t~post7;havoc #t~post7; {3113#false} is VALID [2018-11-18 23:01:39,901 INFO L273 TraceCheckUtils]: 42: Hoare triple {3113#false} assume true; {3113#false} is VALID [2018-11-18 23:01:39,901 INFO L273 TraceCheckUtils]: 43: Hoare triple {3113#false} assume !!(~i~1 < ~SIZE~0 && 1 != ~found~0);call #t~mem8 := read~int(~#set~0.base, ~#set~0.offset + 4 * ~i~1, 4); {3113#false} is VALID [2018-11-18 23:01:39,901 INFO L273 TraceCheckUtils]: 44: Hoare triple {3113#false} assume #t~mem8 == ~element~0;havoc #t~mem8;~found~0 := 1;~pos~0 := ~i~1; {3113#false} is VALID [2018-11-18 23:01:39,901 INFO L273 TraceCheckUtils]: 45: Hoare triple {3113#false} #t~post7 := ~i~1;~i~1 := 1 + #t~post7;havoc #t~post7; {3113#false} is VALID [2018-11-18 23:01:39,902 INFO L273 TraceCheckUtils]: 46: Hoare triple {3113#false} assume true; {3113#false} is VALID [2018-11-18 23:01:39,902 INFO L273 TraceCheckUtils]: 47: Hoare triple {3113#false} assume !(~i~1 < ~SIZE~0 && 1 != ~found~0); {3113#false} is VALID [2018-11-18 23:01:39,902 INFO L273 TraceCheckUtils]: 48: Hoare triple {3113#false} assume 1 == ~found~0;~i~1 := ~pos~0; {3113#false} is VALID [2018-11-18 23:01:39,902 INFO L273 TraceCheckUtils]: 49: Hoare triple {3113#false} assume true; {3113#false} is VALID [2018-11-18 23:01:39,902 INFO L273 TraceCheckUtils]: 50: Hoare triple {3113#false} assume !(~i~1 < ~SIZE~0 - 1); {3113#false} is VALID [2018-11-18 23:01:39,902 INFO L273 TraceCheckUtils]: 51: Hoare triple {3113#false} assume 1 == ~found~0;~i~1 := 0; {3113#false} is VALID [2018-11-18 23:01:39,903 INFO L273 TraceCheckUtils]: 52: Hoare triple {3113#false} assume true; {3113#false} is VALID [2018-11-18 23:01:39,903 INFO L273 TraceCheckUtils]: 53: Hoare triple {3113#false} assume !!(~i~1 < ~SIZE~0 - 1);call #t~mem12 := read~int(~#set~0.base, ~#set~0.offset + 4 * ~i~1, 4); {3113#false} is VALID [2018-11-18 23:01:39,903 INFO L256 TraceCheckUtils]: 54: Hoare triple {3113#false} call __VERIFIER_assert((if #t~mem12 != ~element~0 then 1 else 0)); {3113#false} is VALID [2018-11-18 23:01:39,903 INFO L273 TraceCheckUtils]: 55: Hoare triple {3113#false} ~cond := #in~cond; {3113#false} is VALID [2018-11-18 23:01:39,903 INFO L273 TraceCheckUtils]: 56: Hoare triple {3113#false} assume 0 == ~cond; {3113#false} is VALID [2018-11-18 23:01:39,903 INFO L273 TraceCheckUtils]: 57: Hoare triple {3113#false} assume !false; {3113#false} is VALID [2018-11-18 23:01:39,906 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2018-11-18 23:01:39,926 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-18 23:01:39,926 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 9 [2018-11-18 23:01:39,927 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 58 [2018-11-18 23:01:39,927 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-18 23:01:39,927 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states. [2018-11-18 23:01:40,110 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 80 edges. 80 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 23:01:40,110 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-18 23:01:40,110 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-18 23:01:40,110 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=39, Unknown=0, NotChecked=0, Total=72 [2018-11-18 23:01:40,111 INFO L87 Difference]: Start difference. First operand 80 states and 90 transitions. Second operand 9 states. [2018-11-18 23:01:40,811 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 23:01:40,811 INFO L93 Difference]: Finished difference Result 134 states and 158 transitions. [2018-11-18 23:01:40,811 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-18 23:01:40,811 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 58 [2018-11-18 23:01:40,812 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 23:01:40,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-11-18 23:01:40,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 110 transitions. [2018-11-18 23:01:40,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-11-18 23:01:40,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 110 transitions. [2018-11-18 23:01:40,817 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 110 transitions. [2018-11-18 23:01:40,956 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 110 edges. 110 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 23:01:40,959 INFO L225 Difference]: With dead ends: 134 [2018-11-18 23:01:40,959 INFO L226 Difference]: Without dead ends: 98 [2018-11-18 23:01:40,960 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=39, Unknown=0, NotChecked=0, Total=72 [2018-11-18 23:01:40,960 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2018-11-18 23:01:41,063 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 90. [2018-11-18 23:01:41,064 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-18 23:01:41,064 INFO L82 GeneralOperation]: Start isEquivalent. First operand 98 states. Second operand 90 states. [2018-11-18 23:01:41,064 INFO L74 IsIncluded]: Start isIncluded. First operand 98 states. Second operand 90 states. [2018-11-18 23:01:41,064 INFO L87 Difference]: Start difference. First operand 98 states. Second operand 90 states. [2018-11-18 23:01:41,069 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 23:01:41,069 INFO L93 Difference]: Finished difference Result 98 states and 118 transitions. [2018-11-18 23:01:41,069 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 118 transitions. [2018-11-18 23:01:41,070 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 23:01:41,070 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 23:01:41,070 INFO L74 IsIncluded]: Start isIncluded. First operand 90 states. Second operand 98 states. [2018-11-18 23:01:41,070 INFO L87 Difference]: Start difference. First operand 90 states. Second operand 98 states. [2018-11-18 23:01:41,074 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 23:01:41,075 INFO L93 Difference]: Finished difference Result 98 states and 118 transitions. [2018-11-18 23:01:41,075 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 118 transitions. [2018-11-18 23:01:41,075 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 23:01:41,076 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 23:01:41,076 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-18 23:01:41,076 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-18 23:01:41,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 90 states. [2018-11-18 23:01:41,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 105 transitions. [2018-11-18 23:01:41,079 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 105 transitions. Word has length 58 [2018-11-18 23:01:41,079 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 23:01:41,079 INFO L480 AbstractCegarLoop]: Abstraction has 90 states and 105 transitions. [2018-11-18 23:01:41,079 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-18 23:01:41,079 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 105 transitions. [2018-11-18 23:01:41,080 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2018-11-18 23:01:41,080 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 23:01:41,081 INFO L375 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2018-11-18 23:01:41,081 INFO L423 AbstractCegarLoop]: === Iteration 9 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 23:01:41,081 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 23:01:41,081 INFO L82 PathProgramCache]: Analyzing trace with hash 1433804056, now seen corresponding path program 2 times [2018-11-18 23:01:41,081 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 23:01:41,081 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 23:01:41,082 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 23:01:41,082 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 23:01:41,082 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 23:01:41,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 23:01:42,001 INFO L256 TraceCheckUtils]: 0: Hoare triple {3782#true} call ULTIMATE.init(); {3782#true} is VALID [2018-11-18 23:01:42,004 INFO L273 TraceCheckUtils]: 1: Hoare triple {3782#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~SIZE~0 := 100000; {3784#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:01:42,005 INFO L273 TraceCheckUtils]: 2: Hoare triple {3784#(<= 100000 ~SIZE~0)} assume true; {3784#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:01:42,005 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {3784#(<= 100000 ~SIZE~0)} {3782#true} #128#return; {3784#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:01:42,006 INFO L256 TraceCheckUtils]: 4: Hoare triple {3784#(<= 100000 ~SIZE~0)} call #t~ret13 := main(); {3784#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:01:42,006 INFO L273 TraceCheckUtils]: 5: Hoare triple {3784#(<= 100000 ~SIZE~0)} havoc ~i~1;havoc ~pos~0;~n~0 := 0;~found~0 := 0;call ~#set~0.base, ~#set~0.offset := #Ultimate.alloc(4 * ~SIZE~0);call ~#values~0.base, ~#values~0.offset := #Ultimate.alloc(4 * ~SIZE~0);havoc ~element~0;havoc ~v~0;~v~0 := 0; {3785#(and (= main_~v~0 0) (<= 100000 ~SIZE~0))} is VALID [2018-11-18 23:01:42,007 INFO L273 TraceCheckUtils]: 6: Hoare triple {3785#(and (= main_~v~0 0) (<= 100000 ~SIZE~0))} assume true; {3785#(and (= main_~v~0 0) (<= 100000 ~SIZE~0))} is VALID [2018-11-18 23:01:42,008 INFO L273 TraceCheckUtils]: 7: Hoare triple {3785#(and (= main_~v~0 0) (<= 100000 ~SIZE~0))} assume !!(~v~0 < ~SIZE~0);call #t~mem3 := read~int(~#values~0.base, ~#values~0.offset + 4 * ~v~0, 4); {3785#(and (= main_~v~0 0) (<= 100000 ~SIZE~0))} is VALID [2018-11-18 23:01:42,008 INFO L256 TraceCheckUtils]: 8: Hoare triple {3785#(and (= main_~v~0 0) (<= 100000 ~SIZE~0))} call #t~ret4 := elem_exists(~#set~0.base, ~#set~0.offset, ~n~0, #t~mem3); {3782#true} is VALID [2018-11-18 23:01:42,008 INFO L273 TraceCheckUtils]: 9: Hoare triple {3782#true} ~set.base, ~set.offset := #in~set.base, #in~set.offset;~size := #in~size;~value := #in~value;havoc ~i~0;~i~0 := 0; {3782#true} is VALID [2018-11-18 23:01:42,008 INFO L273 TraceCheckUtils]: 10: Hoare triple {3782#true} assume true; {3782#true} is VALID [2018-11-18 23:01:42,009 INFO L273 TraceCheckUtils]: 11: Hoare triple {3782#true} assume !(~i~0 < ~size); {3782#true} is VALID [2018-11-18 23:01:42,009 INFO L273 TraceCheckUtils]: 12: Hoare triple {3782#true} #res := 0; {3782#true} is VALID [2018-11-18 23:01:42,009 INFO L273 TraceCheckUtils]: 13: Hoare triple {3782#true} assume true; {3782#true} is VALID [2018-11-18 23:01:42,010 INFO L268 TraceCheckUtils]: 14: Hoare quadruple {3782#true} {3785#(and (= main_~v~0 0) (<= 100000 ~SIZE~0))} #132#return; {3785#(and (= main_~v~0 0) (<= 100000 ~SIZE~0))} is VALID [2018-11-18 23:01:42,011 INFO L273 TraceCheckUtils]: 15: Hoare triple {3785#(and (= main_~v~0 0) (<= 100000 ~SIZE~0))} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {3785#(and (= main_~v~0 0) (<= 100000 ~SIZE~0))} is VALID [2018-11-18 23:01:42,011 INFO L273 TraceCheckUtils]: 16: Hoare triple {3785#(and (= main_~v~0 0) (<= 100000 ~SIZE~0))} assume 1 != #t~ret4;havoc #t~mem3;havoc #t~ret4;call #t~mem5 := read~int(~#values~0.base, ~#values~0.offset + 4 * ~v~0, 4); {3785#(and (= main_~v~0 0) (<= 100000 ~SIZE~0))} is VALID [2018-11-18 23:01:42,012 INFO L256 TraceCheckUtils]: 17: Hoare triple {3785#(and (= main_~v~0 0) (<= 100000 ~SIZE~0))} call #t~ret6 := insert(~#set~0.base, ~#set~0.offset, ~n~0, #t~mem5); {3782#true} is VALID [2018-11-18 23:01:42,012 INFO L273 TraceCheckUtils]: 18: Hoare triple {3782#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; {3782#true} is VALID [2018-11-18 23:01:42,012 INFO L273 TraceCheckUtils]: 19: Hoare triple {3782#true} assume true; {3782#true} is VALID [2018-11-18 23:01:42,013 INFO L268 TraceCheckUtils]: 20: Hoare quadruple {3782#true} {3785#(and (= main_~v~0 0) (<= 100000 ~SIZE~0))} #134#return; {3785#(and (= main_~v~0 0) (<= 100000 ~SIZE~0))} is VALID [2018-11-18 23:01:42,013 INFO L273 TraceCheckUtils]: 21: Hoare triple {3785#(and (= main_~v~0 0) (<= 100000 ~SIZE~0))} assume -2147483648 <= #t~ret6 && #t~ret6 <= 2147483647;~n~0 := #t~ret6;havoc #t~ret6;havoc #t~mem5; {3785#(and (= main_~v~0 0) (<= 100000 ~SIZE~0))} is VALID [2018-11-18 23:01:42,014 INFO L273 TraceCheckUtils]: 22: Hoare triple {3785#(and (= main_~v~0 0) (<= 100000 ~SIZE~0))} #t~post2 := ~v~0;~v~0 := 1 + #t~post2;havoc #t~post2; {3786#(<= (+ main_~v~0 99999) ~SIZE~0)} is VALID [2018-11-18 23:01:42,014 INFO L273 TraceCheckUtils]: 23: Hoare triple {3786#(<= (+ main_~v~0 99999) ~SIZE~0)} assume true; {3786#(<= (+ main_~v~0 99999) ~SIZE~0)} is VALID [2018-11-18 23:01:42,015 INFO L273 TraceCheckUtils]: 24: Hoare triple {3786#(<= (+ main_~v~0 99999) ~SIZE~0)} assume !!(~v~0 < ~SIZE~0);call #t~mem3 := read~int(~#values~0.base, ~#values~0.offset + 4 * ~v~0, 4); {3786#(<= (+ main_~v~0 99999) ~SIZE~0)} is VALID [2018-11-18 23:01:42,015 INFO L256 TraceCheckUtils]: 25: Hoare triple {3786#(<= (+ main_~v~0 99999) ~SIZE~0)} call #t~ret4 := elem_exists(~#set~0.base, ~#set~0.offset, ~n~0, #t~mem3); {3782#true} is VALID [2018-11-18 23:01:42,015 INFO L273 TraceCheckUtils]: 26: Hoare triple {3782#true} ~set.base, ~set.offset := #in~set.base, #in~set.offset;~size := #in~size;~value := #in~value;havoc ~i~0;~i~0 := 0; {3782#true} is VALID [2018-11-18 23:01:42,016 INFO L273 TraceCheckUtils]: 27: Hoare triple {3782#true} assume true; {3782#true} is VALID [2018-11-18 23:01:42,016 INFO L273 TraceCheckUtils]: 28: Hoare triple {3782#true} assume !!(~i~0 < ~size);call #t~mem1 := read~int(~set.base, ~set.offset + 4 * ~i~0, 4); {3782#true} is VALID [2018-11-18 23:01:42,016 INFO L273 TraceCheckUtils]: 29: Hoare triple {3782#true} assume #t~mem1 == ~value;havoc #t~mem1;#res := 1; {3782#true} is VALID [2018-11-18 23:01:42,017 INFO L273 TraceCheckUtils]: 30: Hoare triple {3782#true} assume true; {3782#true} is VALID [2018-11-18 23:01:42,032 INFO L268 TraceCheckUtils]: 31: Hoare quadruple {3782#true} {3786#(<= (+ main_~v~0 99999) ~SIZE~0)} #132#return; {3786#(<= (+ main_~v~0 99999) ~SIZE~0)} is VALID [2018-11-18 23:01:42,032 INFO L273 TraceCheckUtils]: 32: Hoare triple {3786#(<= (+ main_~v~0 99999) ~SIZE~0)} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {3786#(<= (+ main_~v~0 99999) ~SIZE~0)} is VALID [2018-11-18 23:01:42,034 INFO L273 TraceCheckUtils]: 33: Hoare triple {3786#(<= (+ main_~v~0 99999) ~SIZE~0)} assume !(1 != #t~ret4);havoc #t~mem3;havoc #t~ret4; {3786#(<= (+ main_~v~0 99999) ~SIZE~0)} is VALID [2018-11-18 23:01:42,034 INFO L273 TraceCheckUtils]: 34: Hoare triple {3786#(<= (+ main_~v~0 99999) ~SIZE~0)} #t~post2 := ~v~0;~v~0 := 1 + #t~post2;havoc #t~post2; {3787#(<= (+ main_~v~0 99998) ~SIZE~0)} is VALID [2018-11-18 23:01:42,037 INFO L273 TraceCheckUtils]: 35: Hoare triple {3787#(<= (+ main_~v~0 99998) ~SIZE~0)} assume true; {3787#(<= (+ main_~v~0 99998) ~SIZE~0)} is VALID [2018-11-18 23:01:42,037 INFO L273 TraceCheckUtils]: 36: Hoare triple {3787#(<= (+ main_~v~0 99998) ~SIZE~0)} assume !!(~v~0 < ~SIZE~0);call #t~mem3 := read~int(~#values~0.base, ~#values~0.offset + 4 * ~v~0, 4); {3787#(<= (+ main_~v~0 99998) ~SIZE~0)} is VALID [2018-11-18 23:01:42,037 INFO L256 TraceCheckUtils]: 37: Hoare triple {3787#(<= (+ main_~v~0 99998) ~SIZE~0)} call #t~ret4 := elem_exists(~#set~0.base, ~#set~0.offset, ~n~0, #t~mem3); {3782#true} is VALID [2018-11-18 23:01:42,038 INFO L273 TraceCheckUtils]: 38: Hoare triple {3782#true} ~set.base, ~set.offset := #in~set.base, #in~set.offset;~size := #in~size;~value := #in~value;havoc ~i~0;~i~0 := 0; {3782#true} is VALID [2018-11-18 23:01:42,038 INFO L273 TraceCheckUtils]: 39: Hoare triple {3782#true} assume true; {3782#true} is VALID [2018-11-18 23:01:42,038 INFO L273 TraceCheckUtils]: 40: Hoare triple {3782#true} assume !!(~i~0 < ~size);call #t~mem1 := read~int(~set.base, ~set.offset + 4 * ~i~0, 4); {3782#true} is VALID [2018-11-18 23:01:42,038 INFO L273 TraceCheckUtils]: 41: Hoare triple {3782#true} assume #t~mem1 == ~value;havoc #t~mem1;#res := 1; {3782#true} is VALID [2018-11-18 23:01:42,039 INFO L273 TraceCheckUtils]: 42: Hoare triple {3782#true} assume true; {3782#true} is VALID [2018-11-18 23:01:42,040 INFO L268 TraceCheckUtils]: 43: Hoare quadruple {3782#true} {3787#(<= (+ main_~v~0 99998) ~SIZE~0)} #132#return; {3787#(<= (+ main_~v~0 99998) ~SIZE~0)} is VALID [2018-11-18 23:01:42,041 INFO L273 TraceCheckUtils]: 44: Hoare triple {3787#(<= (+ main_~v~0 99998) ~SIZE~0)} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {3787#(<= (+ main_~v~0 99998) ~SIZE~0)} is VALID [2018-11-18 23:01:42,041 INFO L273 TraceCheckUtils]: 45: Hoare triple {3787#(<= (+ main_~v~0 99998) ~SIZE~0)} assume !(1 != #t~ret4);havoc #t~mem3;havoc #t~ret4; {3787#(<= (+ main_~v~0 99998) ~SIZE~0)} is VALID [2018-11-18 23:01:42,042 INFO L273 TraceCheckUtils]: 46: Hoare triple {3787#(<= (+ main_~v~0 99998) ~SIZE~0)} #t~post2 := ~v~0;~v~0 := 1 + #t~post2;havoc #t~post2; {3788#(<= (+ main_~v~0 99997) ~SIZE~0)} is VALID [2018-11-18 23:01:42,042 INFO L273 TraceCheckUtils]: 47: Hoare triple {3788#(<= (+ main_~v~0 99997) ~SIZE~0)} assume true; {3788#(<= (+ main_~v~0 99997) ~SIZE~0)} is VALID [2018-11-18 23:01:42,042 INFO L273 TraceCheckUtils]: 48: Hoare triple {3788#(<= (+ main_~v~0 99997) ~SIZE~0)} assume !(~v~0 < ~SIZE~0); {3783#false} is VALID [2018-11-18 23:01:42,043 INFO L273 TraceCheckUtils]: 49: Hoare triple {3783#false} ~i~1 := 0; {3783#false} is VALID [2018-11-18 23:01:42,043 INFO L273 TraceCheckUtils]: 50: Hoare triple {3783#false} assume true; {3783#false} is VALID [2018-11-18 23:01:42,043 INFO L273 TraceCheckUtils]: 51: Hoare triple {3783#false} assume !!(~i~1 < ~SIZE~0 && 1 != ~found~0);call #t~mem8 := read~int(~#set~0.base, ~#set~0.offset + 4 * ~i~1, 4); {3783#false} is VALID [2018-11-18 23:01:42,044 INFO L273 TraceCheckUtils]: 52: Hoare triple {3783#false} assume !(#t~mem8 == ~element~0);havoc #t~mem8; {3783#false} is VALID [2018-11-18 23:01:42,044 INFO L273 TraceCheckUtils]: 53: Hoare triple {3783#false} #t~post7 := ~i~1;~i~1 := 1 + #t~post7;havoc #t~post7; {3783#false} is VALID [2018-11-18 23:01:42,044 INFO L273 TraceCheckUtils]: 54: Hoare triple {3783#false} assume true; {3783#false} is VALID [2018-11-18 23:01:42,045 INFO L273 TraceCheckUtils]: 55: Hoare triple {3783#false} assume !!(~i~1 < ~SIZE~0 && 1 != ~found~0);call #t~mem8 := read~int(~#set~0.base, ~#set~0.offset + 4 * ~i~1, 4); {3783#false} is VALID [2018-11-18 23:01:42,045 INFO L273 TraceCheckUtils]: 56: Hoare triple {3783#false} assume #t~mem8 == ~element~0;havoc #t~mem8;~found~0 := 1;~pos~0 := ~i~1; {3783#false} is VALID [2018-11-18 23:01:42,045 INFO L273 TraceCheckUtils]: 57: Hoare triple {3783#false} #t~post7 := ~i~1;~i~1 := 1 + #t~post7;havoc #t~post7; {3783#false} is VALID [2018-11-18 23:01:42,046 INFO L273 TraceCheckUtils]: 58: Hoare triple {3783#false} assume true; {3783#false} is VALID [2018-11-18 23:01:42,046 INFO L273 TraceCheckUtils]: 59: Hoare triple {3783#false} assume !(~i~1 < ~SIZE~0 && 1 != ~found~0); {3783#false} is VALID [2018-11-18 23:01:42,046 INFO L273 TraceCheckUtils]: 60: Hoare triple {3783#false} assume 1 == ~found~0;~i~1 := ~pos~0; {3783#false} is VALID [2018-11-18 23:01:42,047 INFO L273 TraceCheckUtils]: 61: Hoare triple {3783#false} assume true; {3783#false} is VALID [2018-11-18 23:01:42,047 INFO L273 TraceCheckUtils]: 62: Hoare triple {3783#false} assume !(~i~1 < ~SIZE~0 - 1); {3783#false} is VALID [2018-11-18 23:01:42,047 INFO L273 TraceCheckUtils]: 63: Hoare triple {3783#false} assume 1 == ~found~0;~i~1 := 0; {3783#false} is VALID [2018-11-18 23:01:42,047 INFO L273 TraceCheckUtils]: 64: Hoare triple {3783#false} assume true; {3783#false} is VALID [2018-11-18 23:01:42,048 INFO L273 TraceCheckUtils]: 65: Hoare triple {3783#false} assume !!(~i~1 < ~SIZE~0 - 1);call #t~mem12 := read~int(~#set~0.base, ~#set~0.offset + 4 * ~i~1, 4); {3783#false} is VALID [2018-11-18 23:01:42,048 INFO L256 TraceCheckUtils]: 66: Hoare triple {3783#false} call __VERIFIER_assert((if #t~mem12 != ~element~0 then 1 else 0)); {3783#false} is VALID [2018-11-18 23:01:42,048 INFO L273 TraceCheckUtils]: 67: Hoare triple {3783#false} ~cond := #in~cond; {3783#false} is VALID [2018-11-18 23:01:42,048 INFO L273 TraceCheckUtils]: 68: Hoare triple {3783#false} assume 0 == ~cond; {3783#false} is VALID [2018-11-18 23:01:42,048 INFO L273 TraceCheckUtils]: 69: Hoare triple {3783#false} assume !false; {3783#false} is VALID [2018-11-18 23:01:42,052 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2018-11-18 23:01:42,053 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 23:01:42,053 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 23:01:42,062 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-18 23:01:42,125 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-18 23:01:42,125 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-18 23:01:42,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 23:01:42,167 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 23:01:42,688 INFO L256 TraceCheckUtils]: 0: Hoare triple {3782#true} call ULTIMATE.init(); {3782#true} is VALID [2018-11-18 23:01:42,689 INFO L273 TraceCheckUtils]: 1: Hoare triple {3782#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~SIZE~0 := 100000; {3784#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:01:42,689 INFO L273 TraceCheckUtils]: 2: Hoare triple {3784#(<= 100000 ~SIZE~0)} assume true; {3784#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:01:42,690 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {3784#(<= 100000 ~SIZE~0)} {3782#true} #128#return; {3784#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:01:42,691 INFO L256 TraceCheckUtils]: 4: Hoare triple {3784#(<= 100000 ~SIZE~0)} call #t~ret13 := main(); {3784#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:01:42,692 INFO L273 TraceCheckUtils]: 5: Hoare triple {3784#(<= 100000 ~SIZE~0)} havoc ~i~1;havoc ~pos~0;~n~0 := 0;~found~0 := 0;call ~#set~0.base, ~#set~0.offset := #Ultimate.alloc(4 * ~SIZE~0);call ~#values~0.base, ~#values~0.offset := #Ultimate.alloc(4 * ~SIZE~0);havoc ~element~0;havoc ~v~0;~v~0 := 0; {3807#(and (<= main_~v~0 0) (<= 100000 ~SIZE~0))} is VALID [2018-11-18 23:01:42,693 INFO L273 TraceCheckUtils]: 6: Hoare triple {3807#(and (<= main_~v~0 0) (<= 100000 ~SIZE~0))} assume true; {3807#(and (<= main_~v~0 0) (<= 100000 ~SIZE~0))} is VALID [2018-11-18 23:01:42,693 INFO L273 TraceCheckUtils]: 7: Hoare triple {3807#(and (<= main_~v~0 0) (<= 100000 ~SIZE~0))} assume !!(~v~0 < ~SIZE~0);call #t~mem3 := read~int(~#values~0.base, ~#values~0.offset + 4 * ~v~0, 4); {3807#(and (<= main_~v~0 0) (<= 100000 ~SIZE~0))} is VALID [2018-11-18 23:01:42,695 INFO L256 TraceCheckUtils]: 8: Hoare triple {3807#(and (<= main_~v~0 0) (<= 100000 ~SIZE~0))} call #t~ret4 := elem_exists(~#set~0.base, ~#set~0.offset, ~n~0, #t~mem3); {3784#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:01:42,696 INFO L273 TraceCheckUtils]: 9: Hoare triple {3784#(<= 100000 ~SIZE~0)} ~set.base, ~set.offset := #in~set.base, #in~set.offset;~size := #in~size;~value := #in~value;havoc ~i~0;~i~0 := 0; {3784#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:01:42,696 INFO L273 TraceCheckUtils]: 10: Hoare triple {3784#(<= 100000 ~SIZE~0)} assume true; {3784#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:01:42,697 INFO L273 TraceCheckUtils]: 11: Hoare triple {3784#(<= 100000 ~SIZE~0)} assume !(~i~0 < ~size); {3784#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:01:42,697 INFO L273 TraceCheckUtils]: 12: Hoare triple {3784#(<= 100000 ~SIZE~0)} #res := 0; {3784#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:01:42,698 INFO L273 TraceCheckUtils]: 13: Hoare triple {3784#(<= 100000 ~SIZE~0)} assume true; {3784#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:01:42,718 INFO L268 TraceCheckUtils]: 14: Hoare quadruple {3784#(<= 100000 ~SIZE~0)} {3807#(and (<= main_~v~0 0) (<= 100000 ~SIZE~0))} #132#return; {3807#(and (<= main_~v~0 0) (<= 100000 ~SIZE~0))} is VALID [2018-11-18 23:01:42,732 INFO L273 TraceCheckUtils]: 15: Hoare triple {3807#(and (<= main_~v~0 0) (<= 100000 ~SIZE~0))} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {3807#(and (<= main_~v~0 0) (<= 100000 ~SIZE~0))} is VALID [2018-11-18 23:01:42,739 INFO L273 TraceCheckUtils]: 16: Hoare triple {3807#(and (<= main_~v~0 0) (<= 100000 ~SIZE~0))} assume 1 != #t~ret4;havoc #t~mem3;havoc #t~ret4;call #t~mem5 := read~int(~#values~0.base, ~#values~0.offset + 4 * ~v~0, 4); {3807#(and (<= main_~v~0 0) (<= 100000 ~SIZE~0))} is VALID [2018-11-18 23:01:42,741 INFO L256 TraceCheckUtils]: 17: Hoare triple {3807#(and (<= main_~v~0 0) (<= 100000 ~SIZE~0))} call #t~ret6 := insert(~#set~0.base, ~#set~0.offset, ~n~0, #t~mem5); {3784#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:01:42,741 INFO L273 TraceCheckUtils]: 18: Hoare triple {3784#(<= 100000 ~SIZE~0)} ~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; {3784#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:01:42,742 INFO L273 TraceCheckUtils]: 19: Hoare triple {3784#(<= 100000 ~SIZE~0)} assume true; {3784#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:01:42,743 INFO L268 TraceCheckUtils]: 20: Hoare quadruple {3784#(<= 100000 ~SIZE~0)} {3807#(and (<= main_~v~0 0) (<= 100000 ~SIZE~0))} #134#return; {3807#(and (<= main_~v~0 0) (<= 100000 ~SIZE~0))} is VALID [2018-11-18 23:01:42,744 INFO L273 TraceCheckUtils]: 21: Hoare triple {3807#(and (<= main_~v~0 0) (<= 100000 ~SIZE~0))} assume -2147483648 <= #t~ret6 && #t~ret6 <= 2147483647;~n~0 := #t~ret6;havoc #t~ret6;havoc #t~mem5; {3807#(and (<= main_~v~0 0) (<= 100000 ~SIZE~0))} is VALID [2018-11-18 23:01:42,745 INFO L273 TraceCheckUtils]: 22: Hoare triple {3807#(and (<= main_~v~0 0) (<= 100000 ~SIZE~0))} #t~post2 := ~v~0;~v~0 := 1 + #t~post2;havoc #t~post2; {3859#(and (<= main_~v~0 1) (<= 100000 ~SIZE~0))} is VALID [2018-11-18 23:01:42,746 INFO L273 TraceCheckUtils]: 23: Hoare triple {3859#(and (<= main_~v~0 1) (<= 100000 ~SIZE~0))} assume true; {3859#(and (<= main_~v~0 1) (<= 100000 ~SIZE~0))} is VALID [2018-11-18 23:01:42,747 INFO L273 TraceCheckUtils]: 24: Hoare triple {3859#(and (<= main_~v~0 1) (<= 100000 ~SIZE~0))} assume !!(~v~0 < ~SIZE~0);call #t~mem3 := read~int(~#values~0.base, ~#values~0.offset + 4 * ~v~0, 4); {3859#(and (<= main_~v~0 1) (<= 100000 ~SIZE~0))} is VALID [2018-11-18 23:01:42,748 INFO L256 TraceCheckUtils]: 25: Hoare triple {3859#(and (<= main_~v~0 1) (<= 100000 ~SIZE~0))} call #t~ret4 := elem_exists(~#set~0.base, ~#set~0.offset, ~n~0, #t~mem3); {3784#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:01:42,749 INFO L273 TraceCheckUtils]: 26: Hoare triple {3784#(<= 100000 ~SIZE~0)} ~set.base, ~set.offset := #in~set.base, #in~set.offset;~size := #in~size;~value := #in~value;havoc ~i~0;~i~0 := 0; {3784#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:01:42,750 INFO L273 TraceCheckUtils]: 27: Hoare triple {3784#(<= 100000 ~SIZE~0)} assume true; {3784#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:01:42,750 INFO L273 TraceCheckUtils]: 28: Hoare triple {3784#(<= 100000 ~SIZE~0)} assume !!(~i~0 < ~size);call #t~mem1 := read~int(~set.base, ~set.offset + 4 * ~i~0, 4); {3784#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:01:42,751 INFO L273 TraceCheckUtils]: 29: Hoare triple {3784#(<= 100000 ~SIZE~0)} assume #t~mem1 == ~value;havoc #t~mem1;#res := 1; {3784#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:01:42,752 INFO L273 TraceCheckUtils]: 30: Hoare triple {3784#(<= 100000 ~SIZE~0)} assume true; {3784#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:01:42,753 INFO L268 TraceCheckUtils]: 31: Hoare quadruple {3784#(<= 100000 ~SIZE~0)} {3859#(and (<= main_~v~0 1) (<= 100000 ~SIZE~0))} #132#return; {3859#(and (<= main_~v~0 1) (<= 100000 ~SIZE~0))} is VALID [2018-11-18 23:01:42,754 INFO L273 TraceCheckUtils]: 32: Hoare triple {3859#(and (<= main_~v~0 1) (<= 100000 ~SIZE~0))} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {3859#(and (<= main_~v~0 1) (<= 100000 ~SIZE~0))} is VALID [2018-11-18 23:01:42,755 INFO L273 TraceCheckUtils]: 33: Hoare triple {3859#(and (<= main_~v~0 1) (<= 100000 ~SIZE~0))} assume !(1 != #t~ret4);havoc #t~mem3;havoc #t~ret4; {3859#(and (<= main_~v~0 1) (<= 100000 ~SIZE~0))} is VALID [2018-11-18 23:01:42,756 INFO L273 TraceCheckUtils]: 34: Hoare triple {3859#(and (<= main_~v~0 1) (<= 100000 ~SIZE~0))} #t~post2 := ~v~0;~v~0 := 1 + #t~post2;havoc #t~post2; {3896#(and (<= main_~v~0 2) (<= 100000 ~SIZE~0))} is VALID [2018-11-18 23:01:42,757 INFO L273 TraceCheckUtils]: 35: Hoare triple {3896#(and (<= main_~v~0 2) (<= 100000 ~SIZE~0))} assume true; {3896#(and (<= main_~v~0 2) (<= 100000 ~SIZE~0))} is VALID [2018-11-18 23:01:42,758 INFO L273 TraceCheckUtils]: 36: Hoare triple {3896#(and (<= main_~v~0 2) (<= 100000 ~SIZE~0))} assume !!(~v~0 < ~SIZE~0);call #t~mem3 := read~int(~#values~0.base, ~#values~0.offset + 4 * ~v~0, 4); {3896#(and (<= main_~v~0 2) (<= 100000 ~SIZE~0))} is VALID [2018-11-18 23:01:42,760 INFO L256 TraceCheckUtils]: 37: Hoare triple {3896#(and (<= main_~v~0 2) (<= 100000 ~SIZE~0))} call #t~ret4 := elem_exists(~#set~0.base, ~#set~0.offset, ~n~0, #t~mem3); {3784#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:01:42,760 INFO L273 TraceCheckUtils]: 38: Hoare triple {3784#(<= 100000 ~SIZE~0)} ~set.base, ~set.offset := #in~set.base, #in~set.offset;~size := #in~size;~value := #in~value;havoc ~i~0;~i~0 := 0; {3784#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:01:42,761 INFO L273 TraceCheckUtils]: 39: Hoare triple {3784#(<= 100000 ~SIZE~0)} assume true; {3784#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:01:42,762 INFO L273 TraceCheckUtils]: 40: Hoare triple {3784#(<= 100000 ~SIZE~0)} assume !!(~i~0 < ~size);call #t~mem1 := read~int(~set.base, ~set.offset + 4 * ~i~0, 4); {3784#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:01:42,762 INFO L273 TraceCheckUtils]: 41: Hoare triple {3784#(<= 100000 ~SIZE~0)} assume #t~mem1 == ~value;havoc #t~mem1;#res := 1; {3784#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:01:42,763 INFO L273 TraceCheckUtils]: 42: Hoare triple {3784#(<= 100000 ~SIZE~0)} assume true; {3784#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:01:42,765 INFO L268 TraceCheckUtils]: 43: Hoare quadruple {3784#(<= 100000 ~SIZE~0)} {3896#(and (<= main_~v~0 2) (<= 100000 ~SIZE~0))} #132#return; {3896#(and (<= main_~v~0 2) (<= 100000 ~SIZE~0))} is VALID [2018-11-18 23:01:42,766 INFO L273 TraceCheckUtils]: 44: Hoare triple {3896#(and (<= main_~v~0 2) (<= 100000 ~SIZE~0))} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {3896#(and (<= main_~v~0 2) (<= 100000 ~SIZE~0))} is VALID [2018-11-18 23:01:42,766 INFO L273 TraceCheckUtils]: 45: Hoare triple {3896#(and (<= main_~v~0 2) (<= 100000 ~SIZE~0))} assume !(1 != #t~ret4);havoc #t~mem3;havoc #t~ret4; {3896#(and (<= main_~v~0 2) (<= 100000 ~SIZE~0))} is VALID [2018-11-18 23:01:42,767 INFO L273 TraceCheckUtils]: 46: Hoare triple {3896#(and (<= main_~v~0 2) (<= 100000 ~SIZE~0))} #t~post2 := ~v~0;~v~0 := 1 + #t~post2;havoc #t~post2; {3933#(and (<= main_~v~0 3) (<= 100000 ~SIZE~0))} is VALID [2018-11-18 23:01:42,768 INFO L273 TraceCheckUtils]: 47: Hoare triple {3933#(and (<= main_~v~0 3) (<= 100000 ~SIZE~0))} assume true; {3933#(and (<= main_~v~0 3) (<= 100000 ~SIZE~0))} is VALID [2018-11-18 23:01:42,769 INFO L273 TraceCheckUtils]: 48: Hoare triple {3933#(and (<= main_~v~0 3) (<= 100000 ~SIZE~0))} assume !(~v~0 < ~SIZE~0); {3783#false} is VALID [2018-11-18 23:01:42,769 INFO L273 TraceCheckUtils]: 49: Hoare triple {3783#false} ~i~1 := 0; {3783#false} is VALID [2018-11-18 23:01:42,770 INFO L273 TraceCheckUtils]: 50: Hoare triple {3783#false} assume true; {3783#false} is VALID [2018-11-18 23:01:42,770 INFO L273 TraceCheckUtils]: 51: Hoare triple {3783#false} assume !!(~i~1 < ~SIZE~0 && 1 != ~found~0);call #t~mem8 := read~int(~#set~0.base, ~#set~0.offset + 4 * ~i~1, 4); {3783#false} is VALID [2018-11-18 23:01:42,770 INFO L273 TraceCheckUtils]: 52: Hoare triple {3783#false} assume !(#t~mem8 == ~element~0);havoc #t~mem8; {3783#false} is VALID [2018-11-18 23:01:42,771 INFO L273 TraceCheckUtils]: 53: Hoare triple {3783#false} #t~post7 := ~i~1;~i~1 := 1 + #t~post7;havoc #t~post7; {3783#false} is VALID [2018-11-18 23:01:42,771 INFO L273 TraceCheckUtils]: 54: Hoare triple {3783#false} assume true; {3783#false} is VALID [2018-11-18 23:01:42,771 INFO L273 TraceCheckUtils]: 55: Hoare triple {3783#false} assume !!(~i~1 < ~SIZE~0 && 1 != ~found~0);call #t~mem8 := read~int(~#set~0.base, ~#set~0.offset + 4 * ~i~1, 4); {3783#false} is VALID [2018-11-18 23:01:42,771 INFO L273 TraceCheckUtils]: 56: Hoare triple {3783#false} assume #t~mem8 == ~element~0;havoc #t~mem8;~found~0 := 1;~pos~0 := ~i~1; {3783#false} is VALID [2018-11-18 23:01:42,772 INFO L273 TraceCheckUtils]: 57: Hoare triple {3783#false} #t~post7 := ~i~1;~i~1 := 1 + #t~post7;havoc #t~post7; {3783#false} is VALID [2018-11-18 23:01:42,772 INFO L273 TraceCheckUtils]: 58: Hoare triple {3783#false} assume true; {3783#false} is VALID [2018-11-18 23:01:42,772 INFO L273 TraceCheckUtils]: 59: Hoare triple {3783#false} assume !(~i~1 < ~SIZE~0 && 1 != ~found~0); {3783#false} is VALID [2018-11-18 23:01:42,772 INFO L273 TraceCheckUtils]: 60: Hoare triple {3783#false} assume 1 == ~found~0;~i~1 := ~pos~0; {3783#false} is VALID [2018-11-18 23:01:42,772 INFO L273 TraceCheckUtils]: 61: Hoare triple {3783#false} assume true; {3783#false} is VALID [2018-11-18 23:01:42,772 INFO L273 TraceCheckUtils]: 62: Hoare triple {3783#false} assume !(~i~1 < ~SIZE~0 - 1); {3783#false} is VALID [2018-11-18 23:01:42,773 INFO L273 TraceCheckUtils]: 63: Hoare triple {3783#false} assume 1 == ~found~0;~i~1 := 0; {3783#false} is VALID [2018-11-18 23:01:42,773 INFO L273 TraceCheckUtils]: 64: Hoare triple {3783#false} assume true; {3783#false} is VALID [2018-11-18 23:01:42,773 INFO L273 TraceCheckUtils]: 65: Hoare triple {3783#false} assume !!(~i~1 < ~SIZE~0 - 1);call #t~mem12 := read~int(~#set~0.base, ~#set~0.offset + 4 * ~i~1, 4); {3783#false} is VALID [2018-11-18 23:01:42,773 INFO L256 TraceCheckUtils]: 66: Hoare triple {3783#false} call __VERIFIER_assert((if #t~mem12 != ~element~0 then 1 else 0)); {3783#false} is VALID [2018-11-18 23:01:42,773 INFO L273 TraceCheckUtils]: 67: Hoare triple {3783#false} ~cond := #in~cond; {3783#false} is VALID [2018-11-18 23:01:42,773 INFO L273 TraceCheckUtils]: 68: Hoare triple {3783#false} assume 0 == ~cond; {3783#false} is VALID [2018-11-18 23:01:42,773 INFO L273 TraceCheckUtils]: 69: Hoare triple {3783#false} assume !false; {3783#false} is VALID [2018-11-18 23:01:42,781 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2018-11-18 23:01:42,801 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-18 23:01:42,801 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 11 [2018-11-18 23:01:42,801 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 70 [2018-11-18 23:01:42,802 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-18 23:01:42,802 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states. [2018-11-18 23:01:42,910 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 94 edges. 94 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 23:01:42,910 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-11-18 23:01:42,910 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-18 23:01:42,911 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=61, Unknown=0, NotChecked=0, Total=110 [2018-11-18 23:01:42,911 INFO L87 Difference]: Start difference. First operand 90 states and 105 transitions. Second operand 11 states. [2018-11-18 23:01:43,815 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 23:01:43,815 INFO L93 Difference]: Finished difference Result 144 states and 173 transitions. [2018-11-18 23:01:43,815 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-18 23:01:43,815 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 70 [2018-11-18 23:01:43,816 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 23:01:43,816 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2018-11-18 23:01:43,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 121 transitions. [2018-11-18 23:01:43,819 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2018-11-18 23:01:43,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 121 transitions. [2018-11-18 23:01:43,822 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 121 transitions. [2018-11-18 23:01:44,415 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 23:01:44,419 INFO L225 Difference]: With dead ends: 144 [2018-11-18 23:01:44,420 INFO L226 Difference]: Without dead ends: 108 [2018-11-18 23:01:44,420 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 67 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=49, Invalid=61, Unknown=0, NotChecked=0, Total=110 [2018-11-18 23:01:44,420 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2018-11-18 23:01:44,496 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 100. [2018-11-18 23:01:44,496 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-18 23:01:44,496 INFO L82 GeneralOperation]: Start isEquivalent. First operand 108 states. Second operand 100 states. [2018-11-18 23:01:44,496 INFO L74 IsIncluded]: Start isIncluded. First operand 108 states. Second operand 100 states. [2018-11-18 23:01:44,497 INFO L87 Difference]: Start difference. First operand 108 states. Second operand 100 states. [2018-11-18 23:01:44,502 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 23:01:44,503 INFO L93 Difference]: Finished difference Result 108 states and 133 transitions. [2018-11-18 23:01:44,503 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 133 transitions. [2018-11-18 23:01:44,504 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 23:01:44,504 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 23:01:44,504 INFO L74 IsIncluded]: Start isIncluded. First operand 100 states. Second operand 108 states. [2018-11-18 23:01:44,504 INFO L87 Difference]: Start difference. First operand 100 states. Second operand 108 states. [2018-11-18 23:01:44,509 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 23:01:44,509 INFO L93 Difference]: Finished difference Result 108 states and 133 transitions. [2018-11-18 23:01:44,509 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 133 transitions. [2018-11-18 23:01:44,510 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 23:01:44,510 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 23:01:44,510 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-18 23:01:44,510 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-18 23:01:44,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100 states. [2018-11-18 23:01:44,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 120 transitions. [2018-11-18 23:01:44,514 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 120 transitions. Word has length 70 [2018-11-18 23:01:44,515 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 23:01:44,515 INFO L480 AbstractCegarLoop]: Abstraction has 100 states and 120 transitions. [2018-11-18 23:01:44,515 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-11-18 23:01:44,515 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 120 transitions. [2018-11-18 23:01:44,516 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2018-11-18 23:01:44,516 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 23:01:44,516 INFO L375 BasicCegarLoop]: trace histogram [5, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 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] [2018-11-18 23:01:44,517 INFO L423 AbstractCegarLoop]: === Iteration 10 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 23:01:44,517 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 23:01:44,517 INFO L82 PathProgramCache]: Analyzing trace with hash -286120956, now seen corresponding path program 3 times [2018-11-18 23:01:44,517 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 23:01:44,517 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 23:01:44,518 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 23:01:44,518 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 23:01:44,519 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 23:01:44,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 23:01:44,754 INFO L256 TraceCheckUtils]: 0: Hoare triple {4536#true} call ULTIMATE.init(); {4536#true} is VALID [2018-11-18 23:01:44,755 INFO L273 TraceCheckUtils]: 1: Hoare triple {4536#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~SIZE~0 := 100000; {4538#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:01:44,756 INFO L273 TraceCheckUtils]: 2: Hoare triple {4538#(<= 100000 ~SIZE~0)} assume true; {4538#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:01:44,757 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {4538#(<= 100000 ~SIZE~0)} {4536#true} #128#return; {4538#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:01:44,757 INFO L256 TraceCheckUtils]: 4: Hoare triple {4538#(<= 100000 ~SIZE~0)} call #t~ret13 := main(); {4538#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:01:44,758 INFO L273 TraceCheckUtils]: 5: Hoare triple {4538#(<= 100000 ~SIZE~0)} havoc ~i~1;havoc ~pos~0;~n~0 := 0;~found~0 := 0;call ~#set~0.base, ~#set~0.offset := #Ultimate.alloc(4 * ~SIZE~0);call ~#values~0.base, ~#values~0.offset := #Ultimate.alloc(4 * ~SIZE~0);havoc ~element~0;havoc ~v~0;~v~0 := 0; {4539#(and (= main_~v~0 0) (<= 100000 ~SIZE~0))} is VALID [2018-11-18 23:01:44,759 INFO L273 TraceCheckUtils]: 6: Hoare triple {4539#(and (= main_~v~0 0) (<= 100000 ~SIZE~0))} assume true; {4539#(and (= main_~v~0 0) (<= 100000 ~SIZE~0))} is VALID [2018-11-18 23:01:44,760 INFO L273 TraceCheckUtils]: 7: Hoare triple {4539#(and (= main_~v~0 0) (<= 100000 ~SIZE~0))} assume !!(~v~0 < ~SIZE~0);call #t~mem3 := read~int(~#values~0.base, ~#values~0.offset + 4 * ~v~0, 4); {4539#(and (= main_~v~0 0) (<= 100000 ~SIZE~0))} is VALID [2018-11-18 23:01:44,760 INFO L256 TraceCheckUtils]: 8: Hoare triple {4539#(and (= main_~v~0 0) (<= 100000 ~SIZE~0))} call #t~ret4 := elem_exists(~#set~0.base, ~#set~0.offset, ~n~0, #t~mem3); {4536#true} is VALID [2018-11-18 23:01:44,760 INFO L273 TraceCheckUtils]: 9: Hoare triple {4536#true} ~set.base, ~set.offset := #in~set.base, #in~set.offset;~size := #in~size;~value := #in~value;havoc ~i~0;~i~0 := 0; {4536#true} is VALID [2018-11-18 23:01:44,761 INFO L273 TraceCheckUtils]: 10: Hoare triple {4536#true} assume true; {4536#true} is VALID [2018-11-18 23:01:44,761 INFO L273 TraceCheckUtils]: 11: Hoare triple {4536#true} assume !(~i~0 < ~size); {4536#true} is VALID [2018-11-18 23:01:44,761 INFO L273 TraceCheckUtils]: 12: Hoare triple {4536#true} #res := 0; {4536#true} is VALID [2018-11-18 23:01:44,761 INFO L273 TraceCheckUtils]: 13: Hoare triple {4536#true} assume true; {4536#true} is VALID [2018-11-18 23:01:44,762 INFO L268 TraceCheckUtils]: 14: Hoare quadruple {4536#true} {4539#(and (= main_~v~0 0) (<= 100000 ~SIZE~0))} #132#return; {4539#(and (= main_~v~0 0) (<= 100000 ~SIZE~0))} is VALID [2018-11-18 23:01:44,763 INFO L273 TraceCheckUtils]: 15: Hoare triple {4539#(and (= main_~v~0 0) (<= 100000 ~SIZE~0))} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {4539#(and (= main_~v~0 0) (<= 100000 ~SIZE~0))} is VALID [2018-11-18 23:01:44,763 INFO L273 TraceCheckUtils]: 16: Hoare triple {4539#(and (= main_~v~0 0) (<= 100000 ~SIZE~0))} assume 1 != #t~ret4;havoc #t~mem3;havoc #t~ret4;call #t~mem5 := read~int(~#values~0.base, ~#values~0.offset + 4 * ~v~0, 4); {4539#(and (= main_~v~0 0) (<= 100000 ~SIZE~0))} is VALID [2018-11-18 23:01:44,764 INFO L256 TraceCheckUtils]: 17: Hoare triple {4539#(and (= main_~v~0 0) (<= 100000 ~SIZE~0))} call #t~ret6 := insert(~#set~0.base, ~#set~0.offset, ~n~0, #t~mem5); {4536#true} is VALID [2018-11-18 23:01:44,764 INFO L273 TraceCheckUtils]: 18: Hoare triple {4536#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; {4536#true} is VALID [2018-11-18 23:01:44,764 INFO L273 TraceCheckUtils]: 19: Hoare triple {4536#true} assume true; {4536#true} is VALID [2018-11-18 23:01:44,768 INFO L268 TraceCheckUtils]: 20: Hoare quadruple {4536#true} {4539#(and (= main_~v~0 0) (<= 100000 ~SIZE~0))} #134#return; {4539#(and (= main_~v~0 0) (<= 100000 ~SIZE~0))} is VALID [2018-11-18 23:01:44,769 INFO L273 TraceCheckUtils]: 21: Hoare triple {4539#(and (= main_~v~0 0) (<= 100000 ~SIZE~0))} assume -2147483648 <= #t~ret6 && #t~ret6 <= 2147483647;~n~0 := #t~ret6;havoc #t~ret6;havoc #t~mem5; {4539#(and (= main_~v~0 0) (<= 100000 ~SIZE~0))} is VALID [2018-11-18 23:01:44,770 INFO L273 TraceCheckUtils]: 22: Hoare triple {4539#(and (= main_~v~0 0) (<= 100000 ~SIZE~0))} #t~post2 := ~v~0;~v~0 := 1 + #t~post2;havoc #t~post2; {4540#(<= (+ main_~v~0 99999) ~SIZE~0)} is VALID [2018-11-18 23:01:44,770 INFO L273 TraceCheckUtils]: 23: Hoare triple {4540#(<= (+ main_~v~0 99999) ~SIZE~0)} assume true; {4540#(<= (+ main_~v~0 99999) ~SIZE~0)} is VALID [2018-11-18 23:01:44,770 INFO L273 TraceCheckUtils]: 24: Hoare triple {4540#(<= (+ main_~v~0 99999) ~SIZE~0)} assume !!(~v~0 < ~SIZE~0);call #t~mem3 := read~int(~#values~0.base, ~#values~0.offset + 4 * ~v~0, 4); {4540#(<= (+ main_~v~0 99999) ~SIZE~0)} is VALID [2018-11-18 23:01:44,770 INFO L256 TraceCheckUtils]: 25: Hoare triple {4540#(<= (+ main_~v~0 99999) ~SIZE~0)} call #t~ret4 := elem_exists(~#set~0.base, ~#set~0.offset, ~n~0, #t~mem3); {4536#true} is VALID [2018-11-18 23:01:44,771 INFO L273 TraceCheckUtils]: 26: Hoare triple {4536#true} ~set.base, ~set.offset := #in~set.base, #in~set.offset;~size := #in~size;~value := #in~value;havoc ~i~0;~i~0 := 0; {4536#true} is VALID [2018-11-18 23:01:44,771 INFO L273 TraceCheckUtils]: 27: Hoare triple {4536#true} assume true; {4536#true} is VALID [2018-11-18 23:01:44,771 INFO L273 TraceCheckUtils]: 28: Hoare triple {4536#true} assume !!(~i~0 < ~size);call #t~mem1 := read~int(~set.base, ~set.offset + 4 * ~i~0, 4); {4536#true} is VALID [2018-11-18 23:01:44,771 INFO L273 TraceCheckUtils]: 29: Hoare triple {4536#true} assume #t~mem1 == ~value;havoc #t~mem1;#res := 1; {4536#true} is VALID [2018-11-18 23:01:44,771 INFO L273 TraceCheckUtils]: 30: Hoare triple {4536#true} assume true; {4536#true} is VALID [2018-11-18 23:01:44,772 INFO L268 TraceCheckUtils]: 31: Hoare quadruple {4536#true} {4540#(<= (+ main_~v~0 99999) ~SIZE~0)} #132#return; {4540#(<= (+ main_~v~0 99999) ~SIZE~0)} is VALID [2018-11-18 23:01:44,773 INFO L273 TraceCheckUtils]: 32: Hoare triple {4540#(<= (+ main_~v~0 99999) ~SIZE~0)} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {4540#(<= (+ main_~v~0 99999) ~SIZE~0)} is VALID [2018-11-18 23:01:44,773 INFO L273 TraceCheckUtils]: 33: Hoare triple {4540#(<= (+ main_~v~0 99999) ~SIZE~0)} assume !(1 != #t~ret4);havoc #t~mem3;havoc #t~ret4; {4540#(<= (+ main_~v~0 99999) ~SIZE~0)} is VALID [2018-11-18 23:01:44,774 INFO L273 TraceCheckUtils]: 34: Hoare triple {4540#(<= (+ main_~v~0 99999) ~SIZE~0)} #t~post2 := ~v~0;~v~0 := 1 + #t~post2;havoc #t~post2; {4541#(<= (+ main_~v~0 99998) ~SIZE~0)} is VALID [2018-11-18 23:01:44,775 INFO L273 TraceCheckUtils]: 35: Hoare triple {4541#(<= (+ main_~v~0 99998) ~SIZE~0)} assume true; {4541#(<= (+ main_~v~0 99998) ~SIZE~0)} is VALID [2018-11-18 23:01:44,775 INFO L273 TraceCheckUtils]: 36: Hoare triple {4541#(<= (+ main_~v~0 99998) ~SIZE~0)} assume !!(~v~0 < ~SIZE~0);call #t~mem3 := read~int(~#values~0.base, ~#values~0.offset + 4 * ~v~0, 4); {4541#(<= (+ main_~v~0 99998) ~SIZE~0)} is VALID [2018-11-18 23:01:44,775 INFO L256 TraceCheckUtils]: 37: Hoare triple {4541#(<= (+ main_~v~0 99998) ~SIZE~0)} call #t~ret4 := elem_exists(~#set~0.base, ~#set~0.offset, ~n~0, #t~mem3); {4536#true} is VALID [2018-11-18 23:01:44,776 INFO L273 TraceCheckUtils]: 38: Hoare triple {4536#true} ~set.base, ~set.offset := #in~set.base, #in~set.offset;~size := #in~size;~value := #in~value;havoc ~i~0;~i~0 := 0; {4536#true} is VALID [2018-11-18 23:01:44,776 INFO L273 TraceCheckUtils]: 39: Hoare triple {4536#true} assume true; {4536#true} is VALID [2018-11-18 23:01:44,776 INFO L273 TraceCheckUtils]: 40: Hoare triple {4536#true} assume !!(~i~0 < ~size);call #t~mem1 := read~int(~set.base, ~set.offset + 4 * ~i~0, 4); {4536#true} is VALID [2018-11-18 23:01:44,776 INFO L273 TraceCheckUtils]: 41: Hoare triple {4536#true} assume #t~mem1 == ~value;havoc #t~mem1;#res := 1; {4536#true} is VALID [2018-11-18 23:01:44,777 INFO L273 TraceCheckUtils]: 42: Hoare triple {4536#true} assume true; {4536#true} is VALID [2018-11-18 23:01:44,791 INFO L268 TraceCheckUtils]: 43: Hoare quadruple {4536#true} {4541#(<= (+ main_~v~0 99998) ~SIZE~0)} #132#return; {4541#(<= (+ main_~v~0 99998) ~SIZE~0)} is VALID [2018-11-18 23:01:44,791 INFO L273 TraceCheckUtils]: 44: Hoare triple {4541#(<= (+ main_~v~0 99998) ~SIZE~0)} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {4541#(<= (+ main_~v~0 99998) ~SIZE~0)} is VALID [2018-11-18 23:01:44,792 INFO L273 TraceCheckUtils]: 45: Hoare triple {4541#(<= (+ main_~v~0 99998) ~SIZE~0)} assume !(1 != #t~ret4);havoc #t~mem3;havoc #t~ret4; {4541#(<= (+ main_~v~0 99998) ~SIZE~0)} is VALID [2018-11-18 23:01:44,792 INFO L273 TraceCheckUtils]: 46: Hoare triple {4541#(<= (+ main_~v~0 99998) ~SIZE~0)} #t~post2 := ~v~0;~v~0 := 1 + #t~post2;havoc #t~post2; {4542#(<= (+ main_~v~0 99997) ~SIZE~0)} is VALID [2018-11-18 23:01:44,793 INFO L273 TraceCheckUtils]: 47: Hoare triple {4542#(<= (+ main_~v~0 99997) ~SIZE~0)} assume true; {4542#(<= (+ main_~v~0 99997) ~SIZE~0)} is VALID [2018-11-18 23:01:44,793 INFO L273 TraceCheckUtils]: 48: Hoare triple {4542#(<= (+ main_~v~0 99997) ~SIZE~0)} assume !!(~v~0 < ~SIZE~0);call #t~mem3 := read~int(~#values~0.base, ~#values~0.offset + 4 * ~v~0, 4); {4542#(<= (+ main_~v~0 99997) ~SIZE~0)} is VALID [2018-11-18 23:01:44,793 INFO L256 TraceCheckUtils]: 49: Hoare triple {4542#(<= (+ main_~v~0 99997) ~SIZE~0)} call #t~ret4 := elem_exists(~#set~0.base, ~#set~0.offset, ~n~0, #t~mem3); {4536#true} is VALID [2018-11-18 23:01:44,793 INFO L273 TraceCheckUtils]: 50: Hoare triple {4536#true} ~set.base, ~set.offset := #in~set.base, #in~set.offset;~size := #in~size;~value := #in~value;havoc ~i~0;~i~0 := 0; {4536#true} is VALID [2018-11-18 23:01:44,793 INFO L273 TraceCheckUtils]: 51: Hoare triple {4536#true} assume true; {4536#true} is VALID [2018-11-18 23:01:44,794 INFO L273 TraceCheckUtils]: 52: Hoare triple {4536#true} assume !!(~i~0 < ~size);call #t~mem1 := read~int(~set.base, ~set.offset + 4 * ~i~0, 4); {4536#true} is VALID [2018-11-18 23:01:44,794 INFO L273 TraceCheckUtils]: 53: Hoare triple {4536#true} assume #t~mem1 == ~value;havoc #t~mem1;#res := 1; {4536#true} is VALID [2018-11-18 23:01:44,794 INFO L273 TraceCheckUtils]: 54: Hoare triple {4536#true} assume true; {4536#true} is VALID [2018-11-18 23:01:44,795 INFO L268 TraceCheckUtils]: 55: Hoare quadruple {4536#true} {4542#(<= (+ main_~v~0 99997) ~SIZE~0)} #132#return; {4542#(<= (+ main_~v~0 99997) ~SIZE~0)} is VALID [2018-11-18 23:01:44,796 INFO L273 TraceCheckUtils]: 56: Hoare triple {4542#(<= (+ main_~v~0 99997) ~SIZE~0)} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {4542#(<= (+ main_~v~0 99997) ~SIZE~0)} is VALID [2018-11-18 23:01:44,804 INFO L273 TraceCheckUtils]: 57: Hoare triple {4542#(<= (+ main_~v~0 99997) ~SIZE~0)} assume !(1 != #t~ret4);havoc #t~mem3;havoc #t~ret4; {4542#(<= (+ main_~v~0 99997) ~SIZE~0)} is VALID [2018-11-18 23:01:44,817 INFO L273 TraceCheckUtils]: 58: Hoare triple {4542#(<= (+ main_~v~0 99997) ~SIZE~0)} #t~post2 := ~v~0;~v~0 := 1 + #t~post2;havoc #t~post2; {4543#(<= (+ main_~v~0 99996) ~SIZE~0)} is VALID [2018-11-18 23:01:44,831 INFO L273 TraceCheckUtils]: 59: Hoare triple {4543#(<= (+ main_~v~0 99996) ~SIZE~0)} assume true; {4543#(<= (+ main_~v~0 99996) ~SIZE~0)} is VALID [2018-11-18 23:01:44,840 INFO L273 TraceCheckUtils]: 60: Hoare triple {4543#(<= (+ main_~v~0 99996) ~SIZE~0)} assume !(~v~0 < ~SIZE~0); {4537#false} is VALID [2018-11-18 23:01:44,840 INFO L273 TraceCheckUtils]: 61: Hoare triple {4537#false} ~i~1 := 0; {4537#false} is VALID [2018-11-18 23:01:44,840 INFO L273 TraceCheckUtils]: 62: Hoare triple {4537#false} assume true; {4537#false} is VALID [2018-11-18 23:01:44,841 INFO L273 TraceCheckUtils]: 63: Hoare triple {4537#false} assume !!(~i~1 < ~SIZE~0 && 1 != ~found~0);call #t~mem8 := read~int(~#set~0.base, ~#set~0.offset + 4 * ~i~1, 4); {4537#false} is VALID [2018-11-18 23:01:44,841 INFO L273 TraceCheckUtils]: 64: Hoare triple {4537#false} assume !(#t~mem8 == ~element~0);havoc #t~mem8; {4537#false} is VALID [2018-11-18 23:01:44,841 INFO L273 TraceCheckUtils]: 65: Hoare triple {4537#false} #t~post7 := ~i~1;~i~1 := 1 + #t~post7;havoc #t~post7; {4537#false} is VALID [2018-11-18 23:01:44,841 INFO L273 TraceCheckUtils]: 66: Hoare triple {4537#false} assume true; {4537#false} is VALID [2018-11-18 23:01:44,841 INFO L273 TraceCheckUtils]: 67: Hoare triple {4537#false} assume !!(~i~1 < ~SIZE~0 && 1 != ~found~0);call #t~mem8 := read~int(~#set~0.base, ~#set~0.offset + 4 * ~i~1, 4); {4537#false} is VALID [2018-11-18 23:01:44,842 INFO L273 TraceCheckUtils]: 68: Hoare triple {4537#false} assume #t~mem8 == ~element~0;havoc #t~mem8;~found~0 := 1;~pos~0 := ~i~1; {4537#false} is VALID [2018-11-18 23:01:44,842 INFO L273 TraceCheckUtils]: 69: Hoare triple {4537#false} #t~post7 := ~i~1;~i~1 := 1 + #t~post7;havoc #t~post7; {4537#false} is VALID [2018-11-18 23:01:44,842 INFO L273 TraceCheckUtils]: 70: Hoare triple {4537#false} assume true; {4537#false} is VALID [2018-11-18 23:01:44,842 INFO L273 TraceCheckUtils]: 71: Hoare triple {4537#false} assume !(~i~1 < ~SIZE~0 && 1 != ~found~0); {4537#false} is VALID [2018-11-18 23:01:44,842 INFO L273 TraceCheckUtils]: 72: Hoare triple {4537#false} assume 1 == ~found~0;~i~1 := ~pos~0; {4537#false} is VALID [2018-11-18 23:01:44,842 INFO L273 TraceCheckUtils]: 73: Hoare triple {4537#false} assume true; {4537#false} is VALID [2018-11-18 23:01:44,843 INFO L273 TraceCheckUtils]: 74: Hoare triple {4537#false} assume !(~i~1 < ~SIZE~0 - 1); {4537#false} is VALID [2018-11-18 23:01:44,843 INFO L273 TraceCheckUtils]: 75: Hoare triple {4537#false} assume 1 == ~found~0;~i~1 := 0; {4537#false} is VALID [2018-11-18 23:01:44,843 INFO L273 TraceCheckUtils]: 76: Hoare triple {4537#false} assume true; {4537#false} is VALID [2018-11-18 23:01:44,843 INFO L273 TraceCheckUtils]: 77: Hoare triple {4537#false} assume !!(~i~1 < ~SIZE~0 - 1);call #t~mem12 := read~int(~#set~0.base, ~#set~0.offset + 4 * ~i~1, 4); {4537#false} is VALID [2018-11-18 23:01:44,843 INFO L256 TraceCheckUtils]: 78: Hoare triple {4537#false} call __VERIFIER_assert((if #t~mem12 != ~element~0 then 1 else 0)); {4537#false} is VALID [2018-11-18 23:01:44,843 INFO L273 TraceCheckUtils]: 79: Hoare triple {4537#false} ~cond := #in~cond; {4537#false} is VALID [2018-11-18 23:01:44,844 INFO L273 TraceCheckUtils]: 80: Hoare triple {4537#false} assume 0 == ~cond; {4537#false} is VALID [2018-11-18 23:01:44,844 INFO L273 TraceCheckUtils]: 81: Hoare triple {4537#false} assume !false; {4537#false} is VALID [2018-11-18 23:01:44,850 INFO L134 CoverageAnalysis]: Checked inductivity of 85 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2018-11-18 23:01:44,850 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 23:01:44,850 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 23:01:44,866 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-18 23:01:44,897 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-11-18 23:01:44,897 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-18 23:01:44,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 23:01:44,932 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 23:01:45,179 INFO L256 TraceCheckUtils]: 0: Hoare triple {4536#true} call ULTIMATE.init(); {4536#true} is VALID [2018-11-18 23:01:45,180 INFO L273 TraceCheckUtils]: 1: Hoare triple {4536#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~SIZE~0 := 100000; {4538#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:01:45,180 INFO L273 TraceCheckUtils]: 2: Hoare triple {4538#(<= 100000 ~SIZE~0)} assume true; {4538#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:01:45,181 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {4538#(<= 100000 ~SIZE~0)} {4536#true} #128#return; {4538#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:01:45,181 INFO L256 TraceCheckUtils]: 4: Hoare triple {4538#(<= 100000 ~SIZE~0)} call #t~ret13 := main(); {4538#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:01:45,182 INFO L273 TraceCheckUtils]: 5: Hoare triple {4538#(<= 100000 ~SIZE~0)} havoc ~i~1;havoc ~pos~0;~n~0 := 0;~found~0 := 0;call ~#set~0.base, ~#set~0.offset := #Ultimate.alloc(4 * ~SIZE~0);call ~#values~0.base, ~#values~0.offset := #Ultimate.alloc(4 * ~SIZE~0);havoc ~element~0;havoc ~v~0;~v~0 := 0; {4538#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:01:45,182 INFO L273 TraceCheckUtils]: 6: Hoare triple {4538#(<= 100000 ~SIZE~0)} assume true; {4538#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:01:45,182 INFO L273 TraceCheckUtils]: 7: Hoare triple {4538#(<= 100000 ~SIZE~0)} assume !!(~v~0 < ~SIZE~0);call #t~mem3 := read~int(~#values~0.base, ~#values~0.offset + 4 * ~v~0, 4); {4538#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:01:45,183 INFO L256 TraceCheckUtils]: 8: Hoare triple {4538#(<= 100000 ~SIZE~0)} call #t~ret4 := elem_exists(~#set~0.base, ~#set~0.offset, ~n~0, #t~mem3); {4538#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:01:45,184 INFO L273 TraceCheckUtils]: 9: Hoare triple {4538#(<= 100000 ~SIZE~0)} ~set.base, ~set.offset := #in~set.base, #in~set.offset;~size := #in~size;~value := #in~value;havoc ~i~0;~i~0 := 0; {4538#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:01:45,184 INFO L273 TraceCheckUtils]: 10: Hoare triple {4538#(<= 100000 ~SIZE~0)} assume true; {4538#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:01:45,185 INFO L273 TraceCheckUtils]: 11: Hoare triple {4538#(<= 100000 ~SIZE~0)} assume !(~i~0 < ~size); {4538#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:01:45,185 INFO L273 TraceCheckUtils]: 12: Hoare triple {4538#(<= 100000 ~SIZE~0)} #res := 0; {4538#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:01:45,186 INFO L273 TraceCheckUtils]: 13: Hoare triple {4538#(<= 100000 ~SIZE~0)} assume true; {4538#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:01:45,187 INFO L268 TraceCheckUtils]: 14: Hoare quadruple {4538#(<= 100000 ~SIZE~0)} {4538#(<= 100000 ~SIZE~0)} #132#return; {4538#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:01:45,188 INFO L273 TraceCheckUtils]: 15: Hoare triple {4538#(<= 100000 ~SIZE~0)} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {4538#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:01:45,189 INFO L273 TraceCheckUtils]: 16: Hoare triple {4538#(<= 100000 ~SIZE~0)} assume 1 != #t~ret4;havoc #t~mem3;havoc #t~ret4;call #t~mem5 := read~int(~#values~0.base, ~#values~0.offset + 4 * ~v~0, 4); {4538#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:01:45,190 INFO L256 TraceCheckUtils]: 17: Hoare triple {4538#(<= 100000 ~SIZE~0)} call #t~ret6 := insert(~#set~0.base, ~#set~0.offset, ~n~0, #t~mem5); {4538#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:01:45,190 INFO L273 TraceCheckUtils]: 18: Hoare triple {4538#(<= 100000 ~SIZE~0)} ~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; {4538#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:01:45,191 INFO L273 TraceCheckUtils]: 19: Hoare triple {4538#(<= 100000 ~SIZE~0)} assume true; {4538#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:01:45,192 INFO L268 TraceCheckUtils]: 20: Hoare quadruple {4538#(<= 100000 ~SIZE~0)} {4538#(<= 100000 ~SIZE~0)} #134#return; {4538#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:01:45,193 INFO L273 TraceCheckUtils]: 21: Hoare triple {4538#(<= 100000 ~SIZE~0)} assume -2147483648 <= #t~ret6 && #t~ret6 <= 2147483647;~n~0 := #t~ret6;havoc #t~ret6;havoc #t~mem5; {4538#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:01:45,193 INFO L273 TraceCheckUtils]: 22: Hoare triple {4538#(<= 100000 ~SIZE~0)} #t~post2 := ~v~0;~v~0 := 1 + #t~post2;havoc #t~post2; {4538#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:01:45,194 INFO L273 TraceCheckUtils]: 23: Hoare triple {4538#(<= 100000 ~SIZE~0)} assume true; {4538#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:01:45,195 INFO L273 TraceCheckUtils]: 24: Hoare triple {4538#(<= 100000 ~SIZE~0)} assume !!(~v~0 < ~SIZE~0);call #t~mem3 := read~int(~#values~0.base, ~#values~0.offset + 4 * ~v~0, 4); {4538#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:01:45,196 INFO L256 TraceCheckUtils]: 25: Hoare triple {4538#(<= 100000 ~SIZE~0)} call #t~ret4 := elem_exists(~#set~0.base, ~#set~0.offset, ~n~0, #t~mem3); {4538#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:01:45,196 INFO L273 TraceCheckUtils]: 26: Hoare triple {4538#(<= 100000 ~SIZE~0)} ~set.base, ~set.offset := #in~set.base, #in~set.offset;~size := #in~size;~value := #in~value;havoc ~i~0;~i~0 := 0; {4538#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:01:45,197 INFO L273 TraceCheckUtils]: 27: Hoare triple {4538#(<= 100000 ~SIZE~0)} assume true; {4538#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:01:45,198 INFO L273 TraceCheckUtils]: 28: Hoare triple {4538#(<= 100000 ~SIZE~0)} assume !!(~i~0 < ~size);call #t~mem1 := read~int(~set.base, ~set.offset + 4 * ~i~0, 4); {4538#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:01:45,198 INFO L273 TraceCheckUtils]: 29: Hoare triple {4538#(<= 100000 ~SIZE~0)} assume #t~mem1 == ~value;havoc #t~mem1;#res := 1; {4538#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:01:45,199 INFO L273 TraceCheckUtils]: 30: Hoare triple {4538#(<= 100000 ~SIZE~0)} assume true; {4538#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:01:45,200 INFO L268 TraceCheckUtils]: 31: Hoare quadruple {4538#(<= 100000 ~SIZE~0)} {4538#(<= 100000 ~SIZE~0)} #132#return; {4538#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:01:45,201 INFO L273 TraceCheckUtils]: 32: Hoare triple {4538#(<= 100000 ~SIZE~0)} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {4538#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:01:45,201 INFO L273 TraceCheckUtils]: 33: Hoare triple {4538#(<= 100000 ~SIZE~0)} assume !(1 != #t~ret4);havoc #t~mem3;havoc #t~ret4; {4538#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:01:45,202 INFO L273 TraceCheckUtils]: 34: Hoare triple {4538#(<= 100000 ~SIZE~0)} #t~post2 := ~v~0;~v~0 := 1 + #t~post2;havoc #t~post2; {4538#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:01:45,202 INFO L273 TraceCheckUtils]: 35: Hoare triple {4538#(<= 100000 ~SIZE~0)} assume true; {4538#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:01:45,203 INFO L273 TraceCheckUtils]: 36: Hoare triple {4538#(<= 100000 ~SIZE~0)} assume !!(~v~0 < ~SIZE~0);call #t~mem3 := read~int(~#values~0.base, ~#values~0.offset + 4 * ~v~0, 4); {4538#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:01:45,204 INFO L256 TraceCheckUtils]: 37: Hoare triple {4538#(<= 100000 ~SIZE~0)} call #t~ret4 := elem_exists(~#set~0.base, ~#set~0.offset, ~n~0, #t~mem3); {4538#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:01:45,205 INFO L273 TraceCheckUtils]: 38: Hoare triple {4538#(<= 100000 ~SIZE~0)} ~set.base, ~set.offset := #in~set.base, #in~set.offset;~size := #in~size;~value := #in~value;havoc ~i~0;~i~0 := 0; {4538#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:01:45,205 INFO L273 TraceCheckUtils]: 39: Hoare triple {4538#(<= 100000 ~SIZE~0)} assume true; {4538#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:01:45,206 INFO L273 TraceCheckUtils]: 40: Hoare triple {4538#(<= 100000 ~SIZE~0)} assume !!(~i~0 < ~size);call #t~mem1 := read~int(~set.base, ~set.offset + 4 * ~i~0, 4); {4538#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:01:45,207 INFO L273 TraceCheckUtils]: 41: Hoare triple {4538#(<= 100000 ~SIZE~0)} assume #t~mem1 == ~value;havoc #t~mem1;#res := 1; {4538#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:01:45,207 INFO L273 TraceCheckUtils]: 42: Hoare triple {4538#(<= 100000 ~SIZE~0)} assume true; {4538#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:01:45,208 INFO L268 TraceCheckUtils]: 43: Hoare quadruple {4538#(<= 100000 ~SIZE~0)} {4538#(<= 100000 ~SIZE~0)} #132#return; {4538#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:01:45,209 INFO L273 TraceCheckUtils]: 44: Hoare triple {4538#(<= 100000 ~SIZE~0)} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {4538#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:01:45,210 INFO L273 TraceCheckUtils]: 45: Hoare triple {4538#(<= 100000 ~SIZE~0)} assume !(1 != #t~ret4);havoc #t~mem3;havoc #t~ret4; {4538#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:01:45,210 INFO L273 TraceCheckUtils]: 46: Hoare triple {4538#(<= 100000 ~SIZE~0)} #t~post2 := ~v~0;~v~0 := 1 + #t~post2;havoc #t~post2; {4538#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:01:45,211 INFO L273 TraceCheckUtils]: 47: Hoare triple {4538#(<= 100000 ~SIZE~0)} assume true; {4538#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:01:45,211 INFO L273 TraceCheckUtils]: 48: Hoare triple {4538#(<= 100000 ~SIZE~0)} assume !!(~v~0 < ~SIZE~0);call #t~mem3 := read~int(~#values~0.base, ~#values~0.offset + 4 * ~v~0, 4); {4538#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:01:45,213 INFO L256 TraceCheckUtils]: 49: Hoare triple {4538#(<= 100000 ~SIZE~0)} call #t~ret4 := elem_exists(~#set~0.base, ~#set~0.offset, ~n~0, #t~mem3); {4538#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:01:45,213 INFO L273 TraceCheckUtils]: 50: Hoare triple {4538#(<= 100000 ~SIZE~0)} ~set.base, ~set.offset := #in~set.base, #in~set.offset;~size := #in~size;~value := #in~value;havoc ~i~0;~i~0 := 0; {4538#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:01:45,214 INFO L273 TraceCheckUtils]: 51: Hoare triple {4538#(<= 100000 ~SIZE~0)} assume true; {4538#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:01:45,214 INFO L273 TraceCheckUtils]: 52: Hoare triple {4538#(<= 100000 ~SIZE~0)} assume !!(~i~0 < ~size);call #t~mem1 := read~int(~set.base, ~set.offset + 4 * ~i~0, 4); {4538#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:01:45,215 INFO L273 TraceCheckUtils]: 53: Hoare triple {4538#(<= 100000 ~SIZE~0)} assume #t~mem1 == ~value;havoc #t~mem1;#res := 1; {4538#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:01:45,215 INFO L273 TraceCheckUtils]: 54: Hoare triple {4538#(<= 100000 ~SIZE~0)} assume true; {4538#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:01:45,217 INFO L268 TraceCheckUtils]: 55: Hoare quadruple {4538#(<= 100000 ~SIZE~0)} {4538#(<= 100000 ~SIZE~0)} #132#return; {4538#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:01:45,219 INFO L273 TraceCheckUtils]: 56: Hoare triple {4538#(<= 100000 ~SIZE~0)} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {4538#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:01:45,220 INFO L273 TraceCheckUtils]: 57: Hoare triple {4538#(<= 100000 ~SIZE~0)} assume !(1 != #t~ret4);havoc #t~mem3;havoc #t~ret4; {4538#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:01:45,221 INFO L273 TraceCheckUtils]: 58: Hoare triple {4538#(<= 100000 ~SIZE~0)} #t~post2 := ~v~0;~v~0 := 1 + #t~post2;havoc #t~post2; {4538#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:01:45,221 INFO L273 TraceCheckUtils]: 59: Hoare triple {4538#(<= 100000 ~SIZE~0)} assume true; {4538#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:01:45,222 INFO L273 TraceCheckUtils]: 60: Hoare triple {4538#(<= 100000 ~SIZE~0)} assume !(~v~0 < ~SIZE~0); {4538#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:01:45,223 INFO L273 TraceCheckUtils]: 61: Hoare triple {4538#(<= 100000 ~SIZE~0)} ~i~1 := 0; {4730#(and (<= main_~i~1 0) (<= 100000 ~SIZE~0))} is VALID [2018-11-18 23:01:45,223 INFO L273 TraceCheckUtils]: 62: Hoare triple {4730#(and (<= main_~i~1 0) (<= 100000 ~SIZE~0))} assume true; {4730#(and (<= main_~i~1 0) (<= 100000 ~SIZE~0))} is VALID [2018-11-18 23:01:45,224 INFO L273 TraceCheckUtils]: 63: Hoare triple {4730#(and (<= main_~i~1 0) (<= 100000 ~SIZE~0))} assume !!(~i~1 < ~SIZE~0 && 1 != ~found~0);call #t~mem8 := read~int(~#set~0.base, ~#set~0.offset + 4 * ~i~1, 4); {4730#(and (<= main_~i~1 0) (<= 100000 ~SIZE~0))} is VALID [2018-11-18 23:01:45,225 INFO L273 TraceCheckUtils]: 64: Hoare triple {4730#(and (<= main_~i~1 0) (<= 100000 ~SIZE~0))} assume !(#t~mem8 == ~element~0);havoc #t~mem8; {4730#(and (<= main_~i~1 0) (<= 100000 ~SIZE~0))} is VALID [2018-11-18 23:01:45,226 INFO L273 TraceCheckUtils]: 65: Hoare triple {4730#(and (<= main_~i~1 0) (<= 100000 ~SIZE~0))} #t~post7 := ~i~1;~i~1 := 1 + #t~post7;havoc #t~post7; {4743#(and (<= main_~i~1 1) (<= 100000 ~SIZE~0))} is VALID [2018-11-18 23:01:45,227 INFO L273 TraceCheckUtils]: 66: Hoare triple {4743#(and (<= main_~i~1 1) (<= 100000 ~SIZE~0))} assume true; {4743#(and (<= main_~i~1 1) (<= 100000 ~SIZE~0))} is VALID [2018-11-18 23:01:45,234 INFO L273 TraceCheckUtils]: 67: Hoare triple {4743#(and (<= main_~i~1 1) (<= 100000 ~SIZE~0))} assume !!(~i~1 < ~SIZE~0 && 1 != ~found~0);call #t~mem8 := read~int(~#set~0.base, ~#set~0.offset + 4 * ~i~1, 4); {4743#(and (<= main_~i~1 1) (<= 100000 ~SIZE~0))} is VALID [2018-11-18 23:01:45,235 INFO L273 TraceCheckUtils]: 68: Hoare triple {4743#(and (<= main_~i~1 1) (<= 100000 ~SIZE~0))} assume #t~mem8 == ~element~0;havoc #t~mem8;~found~0 := 1;~pos~0 := ~i~1; {4753#(and (<= main_~pos~0 1) (<= 100000 ~SIZE~0))} is VALID [2018-11-18 23:01:45,236 INFO L273 TraceCheckUtils]: 69: Hoare triple {4753#(and (<= main_~pos~0 1) (<= 100000 ~SIZE~0))} #t~post7 := ~i~1;~i~1 := 1 + #t~post7;havoc #t~post7; {4753#(and (<= main_~pos~0 1) (<= 100000 ~SIZE~0))} is VALID [2018-11-18 23:01:45,236 INFO L273 TraceCheckUtils]: 70: Hoare triple {4753#(and (<= main_~pos~0 1) (<= 100000 ~SIZE~0))} assume true; {4753#(and (<= main_~pos~0 1) (<= 100000 ~SIZE~0))} is VALID [2018-11-18 23:01:45,237 INFO L273 TraceCheckUtils]: 71: Hoare triple {4753#(and (<= main_~pos~0 1) (<= 100000 ~SIZE~0))} assume !(~i~1 < ~SIZE~0 && 1 != ~found~0); {4753#(and (<= main_~pos~0 1) (<= 100000 ~SIZE~0))} is VALID [2018-11-18 23:01:45,237 INFO L273 TraceCheckUtils]: 72: Hoare triple {4753#(and (<= main_~pos~0 1) (<= 100000 ~SIZE~0))} assume 1 == ~found~0;~i~1 := ~pos~0; {4743#(and (<= main_~i~1 1) (<= 100000 ~SIZE~0))} is VALID [2018-11-18 23:01:45,237 INFO L273 TraceCheckUtils]: 73: Hoare triple {4743#(and (<= main_~i~1 1) (<= 100000 ~SIZE~0))} assume true; {4743#(and (<= main_~i~1 1) (<= 100000 ~SIZE~0))} is VALID [2018-11-18 23:01:45,238 INFO L273 TraceCheckUtils]: 74: Hoare triple {4743#(and (<= main_~i~1 1) (<= 100000 ~SIZE~0))} assume !(~i~1 < ~SIZE~0 - 1); {4537#false} is VALID [2018-11-18 23:01:45,238 INFO L273 TraceCheckUtils]: 75: Hoare triple {4537#false} assume 1 == ~found~0;~i~1 := 0; {4537#false} is VALID [2018-11-18 23:01:45,239 INFO L273 TraceCheckUtils]: 76: Hoare triple {4537#false} assume true; {4537#false} is VALID [2018-11-18 23:01:45,239 INFO L273 TraceCheckUtils]: 77: Hoare triple {4537#false} assume !!(~i~1 < ~SIZE~0 - 1);call #t~mem12 := read~int(~#set~0.base, ~#set~0.offset + 4 * ~i~1, 4); {4537#false} is VALID [2018-11-18 23:01:45,239 INFO L256 TraceCheckUtils]: 78: Hoare triple {4537#false} call __VERIFIER_assert((if #t~mem12 != ~element~0 then 1 else 0)); {4537#false} is VALID [2018-11-18 23:01:45,239 INFO L273 TraceCheckUtils]: 79: Hoare triple {4537#false} ~cond := #in~cond; {4537#false} is VALID [2018-11-18 23:01:45,239 INFO L273 TraceCheckUtils]: 80: Hoare triple {4537#false} assume 0 == ~cond; {4537#false} is VALID [2018-11-18 23:01:45,240 INFO L273 TraceCheckUtils]: 81: Hoare triple {4537#false} assume !false; {4537#false} is VALID [2018-11-18 23:01:45,246 INFO L134 CoverageAnalysis]: Checked inductivity of 85 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 77 trivial. 0 not checked. [2018-11-18 23:01:45,265 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-18 23:01:45,265 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 6] total 11 [2018-11-18 23:01:45,265 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 82 [2018-11-18 23:01:45,266 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-18 23:01:45,266 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states. [2018-11-18 23:01:45,377 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 101 edges. 101 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 23:01:45,377 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-11-18 23:01:45,377 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-18 23:01:45,378 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=76, Unknown=0, NotChecked=0, Total=110 [2018-11-18 23:01:45,378 INFO L87 Difference]: Start difference. First operand 100 states and 120 transitions. Second operand 11 states. [2018-11-18 23:01:46,782 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 23:01:46,782 INFO L93 Difference]: Finished difference Result 195 states and 237 transitions. [2018-11-18 23:01:46,782 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-11-18 23:01:46,782 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 82 [2018-11-18 23:01:46,783 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 23:01:46,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2018-11-18 23:01:46,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 189 transitions. [2018-11-18 23:01:46,786 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2018-11-18 23:01:46,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 189 transitions. [2018-11-18 23:01:46,789 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 13 states and 189 transitions. [2018-11-18 23:01:47,103 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 189 edges. 189 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 23:01:47,110 INFO L225 Difference]: With dead ends: 195 [2018-11-18 23:01:47,110 INFO L226 Difference]: Without dead ends: 159 [2018-11-18 23:01:47,114 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 80 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=78, Invalid=194, Unknown=0, NotChecked=0, Total=272 [2018-11-18 23:01:47,114 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2018-11-18 23:01:47,264 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 118. [2018-11-18 23:01:47,265 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-18 23:01:47,265 INFO L82 GeneralOperation]: Start isEquivalent. First operand 159 states. Second operand 118 states. [2018-11-18 23:01:47,265 INFO L74 IsIncluded]: Start isIncluded. First operand 159 states. Second operand 118 states. [2018-11-18 23:01:47,265 INFO L87 Difference]: Start difference. First operand 159 states. Second operand 118 states. [2018-11-18 23:01:47,270 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 23:01:47,271 INFO L93 Difference]: Finished difference Result 159 states and 196 transitions. [2018-11-18 23:01:47,271 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 196 transitions. [2018-11-18 23:01:47,272 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 23:01:47,272 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 23:01:47,272 INFO L74 IsIncluded]: Start isIncluded. First operand 118 states. Second operand 159 states. [2018-11-18 23:01:47,272 INFO L87 Difference]: Start difference. First operand 118 states. Second operand 159 states. [2018-11-18 23:01:47,277 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 23:01:47,278 INFO L93 Difference]: Finished difference Result 159 states and 196 transitions. [2018-11-18 23:01:47,278 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 196 transitions. [2018-11-18 23:01:47,279 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 23:01:47,279 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 23:01:47,279 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-18 23:01:47,279 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-18 23:01:47,279 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 118 states. [2018-11-18 23:01:47,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 144 transitions. [2018-11-18 23:01:47,283 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 144 transitions. Word has length 82 [2018-11-18 23:01:47,283 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 23:01:47,284 INFO L480 AbstractCegarLoop]: Abstraction has 118 states and 144 transitions. [2018-11-18 23:01:47,284 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-11-18 23:01:47,284 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 144 transitions. [2018-11-18 23:01:47,285 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2018-11-18 23:01:47,285 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 23:01:47,285 INFO L375 BasicCegarLoop]: trace histogram [6, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 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, 1, 1] [2018-11-18 23:01:47,286 INFO L423 AbstractCegarLoop]: === Iteration 11 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 23:01:47,286 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 23:01:47,286 INFO L82 PathProgramCache]: Analyzing trace with hash -975791255, now seen corresponding path program 1 times [2018-11-18 23:01:47,286 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 23:01:47,286 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 23:01:47,287 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 23:01:47,287 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 23:01:47,287 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 23:01:47,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 23:01:47,618 INFO L256 TraceCheckUtils]: 0: Hoare triple {5531#true} call ULTIMATE.init(); {5531#true} is VALID [2018-11-18 23:01:47,620 INFO L273 TraceCheckUtils]: 1: Hoare triple {5531#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~SIZE~0 := 100000; {5533#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:01:47,620 INFO L273 TraceCheckUtils]: 2: Hoare triple {5533#(<= 100000 ~SIZE~0)} assume true; {5533#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:01:47,620 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {5533#(<= 100000 ~SIZE~0)} {5531#true} #128#return; {5533#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:01:47,621 INFO L256 TraceCheckUtils]: 4: Hoare triple {5533#(<= 100000 ~SIZE~0)} call #t~ret13 := main(); {5533#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:01:47,622 INFO L273 TraceCheckUtils]: 5: Hoare triple {5533#(<= 100000 ~SIZE~0)} havoc ~i~1;havoc ~pos~0;~n~0 := 0;~found~0 := 0;call ~#set~0.base, ~#set~0.offset := #Ultimate.alloc(4 * ~SIZE~0);call ~#values~0.base, ~#values~0.offset := #Ultimate.alloc(4 * ~SIZE~0);havoc ~element~0;havoc ~v~0;~v~0 := 0; {5533#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:01:47,622 INFO L273 TraceCheckUtils]: 6: Hoare triple {5533#(<= 100000 ~SIZE~0)} assume true; {5533#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:01:47,623 INFO L273 TraceCheckUtils]: 7: Hoare triple {5533#(<= 100000 ~SIZE~0)} assume !!(~v~0 < ~SIZE~0);call #t~mem3 := read~int(~#values~0.base, ~#values~0.offset + 4 * ~v~0, 4); {5533#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:01:47,623 INFO L256 TraceCheckUtils]: 8: Hoare triple {5533#(<= 100000 ~SIZE~0)} call #t~ret4 := elem_exists(~#set~0.base, ~#set~0.offset, ~n~0, #t~mem3); {5531#true} is VALID [2018-11-18 23:01:47,623 INFO L273 TraceCheckUtils]: 9: Hoare triple {5531#true} ~set.base, ~set.offset := #in~set.base, #in~set.offset;~size := #in~size;~value := #in~value;havoc ~i~0;~i~0 := 0; {5531#true} is VALID [2018-11-18 23:01:47,623 INFO L273 TraceCheckUtils]: 10: Hoare triple {5531#true} assume true; {5531#true} is VALID [2018-11-18 23:01:47,624 INFO L273 TraceCheckUtils]: 11: Hoare triple {5531#true} assume !(~i~0 < ~size); {5531#true} is VALID [2018-11-18 23:01:47,624 INFO L273 TraceCheckUtils]: 12: Hoare triple {5531#true} #res := 0; {5531#true} is VALID [2018-11-18 23:01:47,624 INFO L273 TraceCheckUtils]: 13: Hoare triple {5531#true} assume true; {5531#true} is VALID [2018-11-18 23:01:47,628 INFO L268 TraceCheckUtils]: 14: Hoare quadruple {5531#true} {5533#(<= 100000 ~SIZE~0)} #132#return; {5533#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:01:47,628 INFO L273 TraceCheckUtils]: 15: Hoare triple {5533#(<= 100000 ~SIZE~0)} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {5533#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:01:47,630 INFO L273 TraceCheckUtils]: 16: Hoare triple {5533#(<= 100000 ~SIZE~0)} assume 1 != #t~ret4;havoc #t~mem3;havoc #t~ret4;call #t~mem5 := read~int(~#values~0.base, ~#values~0.offset + 4 * ~v~0, 4); {5533#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:01:47,630 INFO L256 TraceCheckUtils]: 17: Hoare triple {5533#(<= 100000 ~SIZE~0)} call #t~ret6 := insert(~#set~0.base, ~#set~0.offset, ~n~0, #t~mem5); {5531#true} is VALID [2018-11-18 23:01:47,630 INFO L273 TraceCheckUtils]: 18: Hoare triple {5531#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; {5531#true} is VALID [2018-11-18 23:01:47,630 INFO L273 TraceCheckUtils]: 19: Hoare triple {5531#true} assume true; {5531#true} is VALID [2018-11-18 23:01:47,648 INFO L268 TraceCheckUtils]: 20: Hoare quadruple {5531#true} {5533#(<= 100000 ~SIZE~0)} #134#return; {5533#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:01:47,657 INFO L273 TraceCheckUtils]: 21: Hoare triple {5533#(<= 100000 ~SIZE~0)} assume -2147483648 <= #t~ret6 && #t~ret6 <= 2147483647;~n~0 := #t~ret6;havoc #t~ret6;havoc #t~mem5; {5533#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:01:47,672 INFO L273 TraceCheckUtils]: 22: Hoare triple {5533#(<= 100000 ~SIZE~0)} #t~post2 := ~v~0;~v~0 := 1 + #t~post2;havoc #t~post2; {5533#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:01:47,687 INFO L273 TraceCheckUtils]: 23: Hoare triple {5533#(<= 100000 ~SIZE~0)} assume true; {5533#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:01:47,696 INFO L273 TraceCheckUtils]: 24: Hoare triple {5533#(<= 100000 ~SIZE~0)} assume !!(~v~0 < ~SIZE~0);call #t~mem3 := read~int(~#values~0.base, ~#values~0.offset + 4 * ~v~0, 4); {5533#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:01:47,696 INFO L256 TraceCheckUtils]: 25: Hoare triple {5533#(<= 100000 ~SIZE~0)} call #t~ret4 := elem_exists(~#set~0.base, ~#set~0.offset, ~n~0, #t~mem3); {5531#true} is VALID [2018-11-18 23:01:47,696 INFO L273 TraceCheckUtils]: 26: Hoare triple {5531#true} ~set.base, ~set.offset := #in~set.base, #in~set.offset;~size := #in~size;~value := #in~value;havoc ~i~0;~i~0 := 0; {5531#true} is VALID [2018-11-18 23:01:47,696 INFO L273 TraceCheckUtils]: 27: Hoare triple {5531#true} assume true; {5531#true} is VALID [2018-11-18 23:01:47,697 INFO L273 TraceCheckUtils]: 28: Hoare triple {5531#true} assume !!(~i~0 < ~size);call #t~mem1 := read~int(~set.base, ~set.offset + 4 * ~i~0, 4); {5531#true} is VALID [2018-11-18 23:01:47,697 INFO L273 TraceCheckUtils]: 29: Hoare triple {5531#true} assume #t~mem1 == ~value;havoc #t~mem1;#res := 1; {5531#true} is VALID [2018-11-18 23:01:47,697 INFO L273 TraceCheckUtils]: 30: Hoare triple {5531#true} assume true; {5531#true} is VALID [2018-11-18 23:01:47,715 INFO L268 TraceCheckUtils]: 31: Hoare quadruple {5531#true} {5533#(<= 100000 ~SIZE~0)} #132#return; {5533#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:01:47,724 INFO L273 TraceCheckUtils]: 32: Hoare triple {5533#(<= 100000 ~SIZE~0)} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {5533#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:01:47,737 INFO L273 TraceCheckUtils]: 33: Hoare triple {5533#(<= 100000 ~SIZE~0)} assume !(1 != #t~ret4);havoc #t~mem3;havoc #t~ret4; {5533#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:01:47,741 INFO L273 TraceCheckUtils]: 34: Hoare triple {5533#(<= 100000 ~SIZE~0)} #t~post2 := ~v~0;~v~0 := 1 + #t~post2;havoc #t~post2; {5533#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:01:47,741 INFO L273 TraceCheckUtils]: 35: Hoare triple {5533#(<= 100000 ~SIZE~0)} assume true; {5533#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:01:47,742 INFO L273 TraceCheckUtils]: 36: Hoare triple {5533#(<= 100000 ~SIZE~0)} assume !!(~v~0 < ~SIZE~0);call #t~mem3 := read~int(~#values~0.base, ~#values~0.offset + 4 * ~v~0, 4); {5533#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:01:47,742 INFO L256 TraceCheckUtils]: 37: Hoare triple {5533#(<= 100000 ~SIZE~0)} call #t~ret4 := elem_exists(~#set~0.base, ~#set~0.offset, ~n~0, #t~mem3); {5531#true} is VALID [2018-11-18 23:01:47,742 INFO L273 TraceCheckUtils]: 38: Hoare triple {5531#true} ~set.base, ~set.offset := #in~set.base, #in~set.offset;~size := #in~size;~value := #in~value;havoc ~i~0;~i~0 := 0; {5531#true} is VALID [2018-11-18 23:01:47,742 INFO L273 TraceCheckUtils]: 39: Hoare triple {5531#true} assume true; {5531#true} is VALID [2018-11-18 23:01:47,742 INFO L273 TraceCheckUtils]: 40: Hoare triple {5531#true} assume !!(~i~0 < ~size);call #t~mem1 := read~int(~set.base, ~set.offset + 4 * ~i~0, 4); {5531#true} is VALID [2018-11-18 23:01:47,742 INFO L273 TraceCheckUtils]: 41: Hoare triple {5531#true} assume #t~mem1 == ~value;havoc #t~mem1;#res := 1; {5531#true} is VALID [2018-11-18 23:01:47,742 INFO L273 TraceCheckUtils]: 42: Hoare triple {5531#true} assume true; {5531#true} is VALID [2018-11-18 23:01:47,743 INFO L268 TraceCheckUtils]: 43: Hoare quadruple {5531#true} {5533#(<= 100000 ~SIZE~0)} #132#return; {5533#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:01:47,744 INFO L273 TraceCheckUtils]: 44: Hoare triple {5533#(<= 100000 ~SIZE~0)} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {5533#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:01:47,744 INFO L273 TraceCheckUtils]: 45: Hoare triple {5533#(<= 100000 ~SIZE~0)} assume !(1 != #t~ret4);havoc #t~mem3;havoc #t~ret4; {5533#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:01:47,744 INFO L273 TraceCheckUtils]: 46: Hoare triple {5533#(<= 100000 ~SIZE~0)} #t~post2 := ~v~0;~v~0 := 1 + #t~post2;havoc #t~post2; {5533#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:01:47,745 INFO L273 TraceCheckUtils]: 47: Hoare triple {5533#(<= 100000 ~SIZE~0)} assume true; {5533#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:01:47,745 INFO L273 TraceCheckUtils]: 48: Hoare triple {5533#(<= 100000 ~SIZE~0)} assume !!(~v~0 < ~SIZE~0);call #t~mem3 := read~int(~#values~0.base, ~#values~0.offset + 4 * ~v~0, 4); {5533#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:01:47,745 INFO L256 TraceCheckUtils]: 49: Hoare triple {5533#(<= 100000 ~SIZE~0)} call #t~ret4 := elem_exists(~#set~0.base, ~#set~0.offset, ~n~0, #t~mem3); {5531#true} is VALID [2018-11-18 23:01:47,745 INFO L273 TraceCheckUtils]: 50: Hoare triple {5531#true} ~set.base, ~set.offset := #in~set.base, #in~set.offset;~size := #in~size;~value := #in~value;havoc ~i~0;~i~0 := 0; {5531#true} is VALID [2018-11-18 23:01:47,745 INFO L273 TraceCheckUtils]: 51: Hoare triple {5531#true} assume true; {5531#true} is VALID [2018-11-18 23:01:47,746 INFO L273 TraceCheckUtils]: 52: Hoare triple {5531#true} assume !!(~i~0 < ~size);call #t~mem1 := read~int(~set.base, ~set.offset + 4 * ~i~0, 4); {5531#true} is VALID [2018-11-18 23:01:47,746 INFO L273 TraceCheckUtils]: 53: Hoare triple {5531#true} assume #t~mem1 == ~value;havoc #t~mem1;#res := 1; {5531#true} is VALID [2018-11-18 23:01:47,746 INFO L273 TraceCheckUtils]: 54: Hoare triple {5531#true} assume true; {5531#true} is VALID [2018-11-18 23:01:47,747 INFO L268 TraceCheckUtils]: 55: Hoare quadruple {5531#true} {5533#(<= 100000 ~SIZE~0)} #132#return; {5533#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:01:47,747 INFO L273 TraceCheckUtils]: 56: Hoare triple {5533#(<= 100000 ~SIZE~0)} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {5533#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:01:47,748 INFO L273 TraceCheckUtils]: 57: Hoare triple {5533#(<= 100000 ~SIZE~0)} assume !(1 != #t~ret4);havoc #t~mem3;havoc #t~ret4; {5533#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:01:47,748 INFO L273 TraceCheckUtils]: 58: Hoare triple {5533#(<= 100000 ~SIZE~0)} #t~post2 := ~v~0;~v~0 := 1 + #t~post2;havoc #t~post2; {5533#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:01:47,748 INFO L273 TraceCheckUtils]: 59: Hoare triple {5533#(<= 100000 ~SIZE~0)} assume true; {5533#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:01:47,749 INFO L273 TraceCheckUtils]: 60: Hoare triple {5533#(<= 100000 ~SIZE~0)} assume !!(~v~0 < ~SIZE~0);call #t~mem3 := read~int(~#values~0.base, ~#values~0.offset + 4 * ~v~0, 4); {5533#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:01:47,749 INFO L256 TraceCheckUtils]: 61: Hoare triple {5533#(<= 100000 ~SIZE~0)} call #t~ret4 := elem_exists(~#set~0.base, ~#set~0.offset, ~n~0, #t~mem3); {5531#true} is VALID [2018-11-18 23:01:47,749 INFO L273 TraceCheckUtils]: 62: Hoare triple {5531#true} ~set.base, ~set.offset := #in~set.base, #in~set.offset;~size := #in~size;~value := #in~value;havoc ~i~0;~i~0 := 0; {5531#true} is VALID [2018-11-18 23:01:47,750 INFO L273 TraceCheckUtils]: 63: Hoare triple {5531#true} assume true; {5531#true} is VALID [2018-11-18 23:01:47,750 INFO L273 TraceCheckUtils]: 64: Hoare triple {5531#true} assume !!(~i~0 < ~size);call #t~mem1 := read~int(~set.base, ~set.offset + 4 * ~i~0, 4); {5531#true} is VALID [2018-11-18 23:01:47,750 INFO L273 TraceCheckUtils]: 65: Hoare triple {5531#true} assume #t~mem1 == ~value;havoc #t~mem1;#res := 1; {5531#true} is VALID [2018-11-18 23:01:47,750 INFO L273 TraceCheckUtils]: 66: Hoare triple {5531#true} assume true; {5531#true} is VALID [2018-11-18 23:01:47,752 INFO L268 TraceCheckUtils]: 67: Hoare quadruple {5531#true} {5533#(<= 100000 ~SIZE~0)} #132#return; {5533#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:01:47,752 INFO L273 TraceCheckUtils]: 68: Hoare triple {5533#(<= 100000 ~SIZE~0)} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {5533#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:01:47,752 INFO L273 TraceCheckUtils]: 69: Hoare triple {5533#(<= 100000 ~SIZE~0)} assume !(1 != #t~ret4);havoc #t~mem3;havoc #t~ret4; {5533#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:01:47,753 INFO L273 TraceCheckUtils]: 70: Hoare triple {5533#(<= 100000 ~SIZE~0)} #t~post2 := ~v~0;~v~0 := 1 + #t~post2;havoc #t~post2; {5533#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:01:47,753 INFO L273 TraceCheckUtils]: 71: Hoare triple {5533#(<= 100000 ~SIZE~0)} assume true; {5533#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:01:47,753 INFO L273 TraceCheckUtils]: 72: Hoare triple {5533#(<= 100000 ~SIZE~0)} assume !(~v~0 < ~SIZE~0); {5533#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:01:47,754 INFO L273 TraceCheckUtils]: 73: Hoare triple {5533#(<= 100000 ~SIZE~0)} ~i~1 := 0; {5534#(and (= 0 main_~i~1) (<= 100000 ~SIZE~0))} is VALID [2018-11-18 23:01:47,755 INFO L273 TraceCheckUtils]: 74: Hoare triple {5534#(and (= 0 main_~i~1) (<= 100000 ~SIZE~0))} assume true; {5534#(and (= 0 main_~i~1) (<= 100000 ~SIZE~0))} is VALID [2018-11-18 23:01:47,755 INFO L273 TraceCheckUtils]: 75: Hoare triple {5534#(and (= 0 main_~i~1) (<= 100000 ~SIZE~0))} assume !!(~i~1 < ~SIZE~0 && 1 != ~found~0);call #t~mem8 := read~int(~#set~0.base, ~#set~0.offset + 4 * ~i~1, 4); {5534#(and (= 0 main_~i~1) (<= 100000 ~SIZE~0))} is VALID [2018-11-18 23:01:47,756 INFO L273 TraceCheckUtils]: 76: Hoare triple {5534#(and (= 0 main_~i~1) (<= 100000 ~SIZE~0))} assume #t~mem8 == ~element~0;havoc #t~mem8;~found~0 := 1;~pos~0 := ~i~1; {5535#(and (= 0 main_~pos~0) (<= 100000 ~SIZE~0))} is VALID [2018-11-18 23:01:47,757 INFO L273 TraceCheckUtils]: 77: Hoare triple {5535#(and (= 0 main_~pos~0) (<= 100000 ~SIZE~0))} #t~post7 := ~i~1;~i~1 := 1 + #t~post7;havoc #t~post7; {5535#(and (= 0 main_~pos~0) (<= 100000 ~SIZE~0))} is VALID [2018-11-18 23:01:47,758 INFO L273 TraceCheckUtils]: 78: Hoare triple {5535#(and (= 0 main_~pos~0) (<= 100000 ~SIZE~0))} assume true; {5535#(and (= 0 main_~pos~0) (<= 100000 ~SIZE~0))} is VALID [2018-11-18 23:01:47,758 INFO L273 TraceCheckUtils]: 79: Hoare triple {5535#(and (= 0 main_~pos~0) (<= 100000 ~SIZE~0))} assume !(~i~1 < ~SIZE~0 && 1 != ~found~0); {5535#(and (= 0 main_~pos~0) (<= 100000 ~SIZE~0))} is VALID [2018-11-18 23:01:47,759 INFO L273 TraceCheckUtils]: 80: Hoare triple {5535#(and (= 0 main_~pos~0) (<= 100000 ~SIZE~0))} assume 1 == ~found~0;~i~1 := ~pos~0; {5534#(and (= 0 main_~i~1) (<= 100000 ~SIZE~0))} is VALID [2018-11-18 23:01:47,760 INFO L273 TraceCheckUtils]: 81: Hoare triple {5534#(and (= 0 main_~i~1) (<= 100000 ~SIZE~0))} assume true; {5534#(and (= 0 main_~i~1) (<= 100000 ~SIZE~0))} is VALID [2018-11-18 23:01:47,761 INFO L273 TraceCheckUtils]: 82: Hoare triple {5534#(and (= 0 main_~i~1) (<= 100000 ~SIZE~0))} assume !!(~i~1 < ~SIZE~0 - 1);call #t~mem10 := read~int(~#set~0.base, ~#set~0.offset + 4 * (1 + ~i~1), 4);call write~int(#t~mem10, ~#set~0.base, ~#set~0.offset + 4 * ~i~1, 4);havoc #t~mem10; {5534#(and (= 0 main_~i~1) (<= 100000 ~SIZE~0))} is VALID [2018-11-18 23:01:47,761 INFO L273 TraceCheckUtils]: 83: Hoare triple {5534#(and (= 0 main_~i~1) (<= 100000 ~SIZE~0))} #t~post9 := ~i~1;~i~1 := 1 + #t~post9;havoc #t~post9; {5536#(<= (+ main_~i~1 99999) ~SIZE~0)} is VALID [2018-11-18 23:01:47,762 INFO L273 TraceCheckUtils]: 84: Hoare triple {5536#(<= (+ main_~i~1 99999) ~SIZE~0)} assume true; {5536#(<= (+ main_~i~1 99999) ~SIZE~0)} is VALID [2018-11-18 23:01:47,763 INFO L273 TraceCheckUtils]: 85: Hoare triple {5536#(<= (+ main_~i~1 99999) ~SIZE~0)} assume !!(~i~1 < ~SIZE~0 - 1);call #t~mem10 := read~int(~#set~0.base, ~#set~0.offset + 4 * (1 + ~i~1), 4);call write~int(#t~mem10, ~#set~0.base, ~#set~0.offset + 4 * ~i~1, 4);havoc #t~mem10; {5536#(<= (+ main_~i~1 99999) ~SIZE~0)} is VALID [2018-11-18 23:01:47,763 INFO L273 TraceCheckUtils]: 86: Hoare triple {5536#(<= (+ main_~i~1 99999) ~SIZE~0)} #t~post9 := ~i~1;~i~1 := 1 + #t~post9;havoc #t~post9; {5537#(<= (+ main_~i~1 99998) ~SIZE~0)} is VALID [2018-11-18 23:01:47,764 INFO L273 TraceCheckUtils]: 87: Hoare triple {5537#(<= (+ main_~i~1 99998) ~SIZE~0)} assume true; {5537#(<= (+ main_~i~1 99998) ~SIZE~0)} is VALID [2018-11-18 23:01:47,765 INFO L273 TraceCheckUtils]: 88: Hoare triple {5537#(<= (+ main_~i~1 99998) ~SIZE~0)} assume !(~i~1 < ~SIZE~0 - 1); {5532#false} is VALID [2018-11-18 23:01:47,765 INFO L273 TraceCheckUtils]: 89: Hoare triple {5532#false} assume 1 == ~found~0;~i~1 := 0; {5532#false} is VALID [2018-11-18 23:01:47,765 INFO L273 TraceCheckUtils]: 90: Hoare triple {5532#false} assume true; {5532#false} is VALID [2018-11-18 23:01:47,765 INFO L273 TraceCheckUtils]: 91: Hoare triple {5532#false} assume !!(~i~1 < ~SIZE~0 - 1);call #t~mem12 := read~int(~#set~0.base, ~#set~0.offset + 4 * ~i~1, 4); {5532#false} is VALID [2018-11-18 23:01:47,766 INFO L256 TraceCheckUtils]: 92: Hoare triple {5532#false} call __VERIFIER_assert((if #t~mem12 != ~element~0 then 1 else 0)); {5532#false} is VALID [2018-11-18 23:01:47,766 INFO L273 TraceCheckUtils]: 93: Hoare triple {5532#false} ~cond := #in~cond; {5532#false} is VALID [2018-11-18 23:01:47,766 INFO L273 TraceCheckUtils]: 94: Hoare triple {5532#false} assume 0 == ~cond; {5532#false} is VALID [2018-11-18 23:01:47,766 INFO L273 TraceCheckUtils]: 95: Hoare triple {5532#false} assume !false; {5532#false} is VALID [2018-11-18 23:01:47,775 INFO L134 CoverageAnalysis]: Checked inductivity of 135 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 126 trivial. 0 not checked. [2018-11-18 23:01:47,775 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 23:01:47,775 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 23:01:47,787 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 23:01:47,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 23:01:47,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 23:01:47,857 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 23:01:48,226 INFO L256 TraceCheckUtils]: 0: Hoare triple {5531#true} call ULTIMATE.init(); {5531#true} is VALID [2018-11-18 23:01:48,227 INFO L273 TraceCheckUtils]: 1: Hoare triple {5531#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~SIZE~0 := 100000; {5533#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:01:48,227 INFO L273 TraceCheckUtils]: 2: Hoare triple {5533#(<= 100000 ~SIZE~0)} assume true; {5533#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:01:48,228 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {5533#(<= 100000 ~SIZE~0)} {5531#true} #128#return; {5533#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:01:48,228 INFO L256 TraceCheckUtils]: 4: Hoare triple {5533#(<= 100000 ~SIZE~0)} call #t~ret13 := main(); {5533#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:01:48,229 INFO L273 TraceCheckUtils]: 5: Hoare triple {5533#(<= 100000 ~SIZE~0)} havoc ~i~1;havoc ~pos~0;~n~0 := 0;~found~0 := 0;call ~#set~0.base, ~#set~0.offset := #Ultimate.alloc(4 * ~SIZE~0);call ~#values~0.base, ~#values~0.offset := #Ultimate.alloc(4 * ~SIZE~0);havoc ~element~0;havoc ~v~0;~v~0 := 0; {5556#(and (<= main_~v~0 0) (<= 100000 ~SIZE~0))} is VALID [2018-11-18 23:01:48,229 INFO L273 TraceCheckUtils]: 6: Hoare triple {5556#(and (<= main_~v~0 0) (<= 100000 ~SIZE~0))} assume true; {5556#(and (<= main_~v~0 0) (<= 100000 ~SIZE~0))} is VALID [2018-11-18 23:01:48,230 INFO L273 TraceCheckUtils]: 7: Hoare triple {5556#(and (<= main_~v~0 0) (<= 100000 ~SIZE~0))} assume !!(~v~0 < ~SIZE~0);call #t~mem3 := read~int(~#values~0.base, ~#values~0.offset + 4 * ~v~0, 4); {5556#(and (<= main_~v~0 0) (<= 100000 ~SIZE~0))} is VALID [2018-11-18 23:01:48,232 INFO L256 TraceCheckUtils]: 8: Hoare triple {5556#(and (<= main_~v~0 0) (<= 100000 ~SIZE~0))} call #t~ret4 := elem_exists(~#set~0.base, ~#set~0.offset, ~n~0, #t~mem3); {5533#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:01:48,232 INFO L273 TraceCheckUtils]: 9: Hoare triple {5533#(<= 100000 ~SIZE~0)} ~set.base, ~set.offset := #in~set.base, #in~set.offset;~size := #in~size;~value := #in~value;havoc ~i~0;~i~0 := 0; {5533#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:01:48,233 INFO L273 TraceCheckUtils]: 10: Hoare triple {5533#(<= 100000 ~SIZE~0)} assume true; {5533#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:01:48,233 INFO L273 TraceCheckUtils]: 11: Hoare triple {5533#(<= 100000 ~SIZE~0)} assume !(~i~0 < ~size); {5533#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:01:48,234 INFO L273 TraceCheckUtils]: 12: Hoare triple {5533#(<= 100000 ~SIZE~0)} #res := 0; {5533#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:01:48,235 INFO L273 TraceCheckUtils]: 13: Hoare triple {5533#(<= 100000 ~SIZE~0)} assume true; {5533#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:01:48,236 INFO L268 TraceCheckUtils]: 14: Hoare quadruple {5533#(<= 100000 ~SIZE~0)} {5556#(and (<= main_~v~0 0) (<= 100000 ~SIZE~0))} #132#return; {5556#(and (<= main_~v~0 0) (<= 100000 ~SIZE~0))} is VALID [2018-11-18 23:01:48,237 INFO L273 TraceCheckUtils]: 15: Hoare triple {5556#(and (<= main_~v~0 0) (<= 100000 ~SIZE~0))} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {5556#(and (<= main_~v~0 0) (<= 100000 ~SIZE~0))} is VALID [2018-11-18 23:01:48,238 INFO L273 TraceCheckUtils]: 16: Hoare triple {5556#(and (<= main_~v~0 0) (<= 100000 ~SIZE~0))} assume 1 != #t~ret4;havoc #t~mem3;havoc #t~ret4;call #t~mem5 := read~int(~#values~0.base, ~#values~0.offset + 4 * ~v~0, 4); {5556#(and (<= main_~v~0 0) (<= 100000 ~SIZE~0))} is VALID [2018-11-18 23:01:48,239 INFO L256 TraceCheckUtils]: 17: Hoare triple {5556#(and (<= main_~v~0 0) (<= 100000 ~SIZE~0))} call #t~ret6 := insert(~#set~0.base, ~#set~0.offset, ~n~0, #t~mem5); {5533#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:01:48,240 INFO L273 TraceCheckUtils]: 18: Hoare triple {5533#(<= 100000 ~SIZE~0)} ~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; {5533#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:01:48,240 INFO L273 TraceCheckUtils]: 19: Hoare triple {5533#(<= 100000 ~SIZE~0)} assume true; {5533#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:01:48,242 INFO L268 TraceCheckUtils]: 20: Hoare quadruple {5533#(<= 100000 ~SIZE~0)} {5556#(and (<= main_~v~0 0) (<= 100000 ~SIZE~0))} #134#return; {5556#(and (<= main_~v~0 0) (<= 100000 ~SIZE~0))} is VALID [2018-11-18 23:01:48,243 INFO L273 TraceCheckUtils]: 21: Hoare triple {5556#(and (<= main_~v~0 0) (<= 100000 ~SIZE~0))} assume -2147483648 <= #t~ret6 && #t~ret6 <= 2147483647;~n~0 := #t~ret6;havoc #t~ret6;havoc #t~mem5; {5556#(and (<= main_~v~0 0) (<= 100000 ~SIZE~0))} is VALID [2018-11-18 23:01:48,244 INFO L273 TraceCheckUtils]: 22: Hoare triple {5556#(and (<= main_~v~0 0) (<= 100000 ~SIZE~0))} #t~post2 := ~v~0;~v~0 := 1 + #t~post2;havoc #t~post2; {5608#(and (<= main_~v~0 1) (<= 100000 ~SIZE~0))} is VALID [2018-11-18 23:01:48,244 INFO L273 TraceCheckUtils]: 23: Hoare triple {5608#(and (<= main_~v~0 1) (<= 100000 ~SIZE~0))} assume true; {5608#(and (<= main_~v~0 1) (<= 100000 ~SIZE~0))} is VALID [2018-11-18 23:01:48,245 INFO L273 TraceCheckUtils]: 24: Hoare triple {5608#(and (<= main_~v~0 1) (<= 100000 ~SIZE~0))} assume !!(~v~0 < ~SIZE~0);call #t~mem3 := read~int(~#values~0.base, ~#values~0.offset + 4 * ~v~0, 4); {5608#(and (<= main_~v~0 1) (<= 100000 ~SIZE~0))} is VALID [2018-11-18 23:01:48,247 INFO L256 TraceCheckUtils]: 25: Hoare triple {5608#(and (<= main_~v~0 1) (<= 100000 ~SIZE~0))} call #t~ret4 := elem_exists(~#set~0.base, ~#set~0.offset, ~n~0, #t~mem3); {5533#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:01:48,247 INFO L273 TraceCheckUtils]: 26: Hoare triple {5533#(<= 100000 ~SIZE~0)} ~set.base, ~set.offset := #in~set.base, #in~set.offset;~size := #in~size;~value := #in~value;havoc ~i~0;~i~0 := 0; {5533#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:01:48,259 INFO L273 TraceCheckUtils]: 27: Hoare triple {5533#(<= 100000 ~SIZE~0)} assume true; {5533#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:01:48,260 INFO L273 TraceCheckUtils]: 28: Hoare triple {5533#(<= 100000 ~SIZE~0)} assume !!(~i~0 < ~size);call #t~mem1 := read~int(~set.base, ~set.offset + 4 * ~i~0, 4); {5533#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:01:48,260 INFO L273 TraceCheckUtils]: 29: Hoare triple {5533#(<= 100000 ~SIZE~0)} assume #t~mem1 == ~value;havoc #t~mem1;#res := 1; {5533#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:01:48,260 INFO L273 TraceCheckUtils]: 30: Hoare triple {5533#(<= 100000 ~SIZE~0)} assume true; {5533#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:01:48,262 INFO L268 TraceCheckUtils]: 31: Hoare quadruple {5533#(<= 100000 ~SIZE~0)} {5608#(and (<= main_~v~0 1) (<= 100000 ~SIZE~0))} #132#return; {5608#(and (<= main_~v~0 1) (<= 100000 ~SIZE~0))} is VALID [2018-11-18 23:01:48,262 INFO L273 TraceCheckUtils]: 32: Hoare triple {5608#(and (<= main_~v~0 1) (<= 100000 ~SIZE~0))} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {5608#(and (<= main_~v~0 1) (<= 100000 ~SIZE~0))} is VALID [2018-11-18 23:01:48,262 INFO L273 TraceCheckUtils]: 33: Hoare triple {5608#(and (<= main_~v~0 1) (<= 100000 ~SIZE~0))} assume !(1 != #t~ret4);havoc #t~mem3;havoc #t~ret4; {5608#(and (<= main_~v~0 1) (<= 100000 ~SIZE~0))} is VALID [2018-11-18 23:01:48,263 INFO L273 TraceCheckUtils]: 34: Hoare triple {5608#(and (<= main_~v~0 1) (<= 100000 ~SIZE~0))} #t~post2 := ~v~0;~v~0 := 1 + #t~post2;havoc #t~post2; {5645#(and (<= main_~v~0 2) (<= 100000 ~SIZE~0))} is VALID [2018-11-18 23:01:48,263 INFO L273 TraceCheckUtils]: 35: Hoare triple {5645#(and (<= main_~v~0 2) (<= 100000 ~SIZE~0))} assume true; {5645#(and (<= main_~v~0 2) (<= 100000 ~SIZE~0))} is VALID [2018-11-18 23:01:48,264 INFO L273 TraceCheckUtils]: 36: Hoare triple {5645#(and (<= main_~v~0 2) (<= 100000 ~SIZE~0))} assume !!(~v~0 < ~SIZE~0);call #t~mem3 := read~int(~#values~0.base, ~#values~0.offset + 4 * ~v~0, 4); {5645#(and (<= main_~v~0 2) (<= 100000 ~SIZE~0))} is VALID [2018-11-18 23:01:48,266 INFO L256 TraceCheckUtils]: 37: Hoare triple {5645#(and (<= main_~v~0 2) (<= 100000 ~SIZE~0))} call #t~ret4 := elem_exists(~#set~0.base, ~#set~0.offset, ~n~0, #t~mem3); {5533#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:01:48,266 INFO L273 TraceCheckUtils]: 38: Hoare triple {5533#(<= 100000 ~SIZE~0)} ~set.base, ~set.offset := #in~set.base, #in~set.offset;~size := #in~size;~value := #in~value;havoc ~i~0;~i~0 := 0; {5533#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:01:48,267 INFO L273 TraceCheckUtils]: 39: Hoare triple {5533#(<= 100000 ~SIZE~0)} assume true; {5533#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:01:48,267 INFO L273 TraceCheckUtils]: 40: Hoare triple {5533#(<= 100000 ~SIZE~0)} assume !!(~i~0 < ~size);call #t~mem1 := read~int(~set.base, ~set.offset + 4 * ~i~0, 4); {5533#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:01:48,268 INFO L273 TraceCheckUtils]: 41: Hoare triple {5533#(<= 100000 ~SIZE~0)} assume #t~mem1 == ~value;havoc #t~mem1;#res := 1; {5533#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:01:48,268 INFO L273 TraceCheckUtils]: 42: Hoare triple {5533#(<= 100000 ~SIZE~0)} assume true; {5533#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:01:48,270 INFO L268 TraceCheckUtils]: 43: Hoare quadruple {5533#(<= 100000 ~SIZE~0)} {5645#(and (<= main_~v~0 2) (<= 100000 ~SIZE~0))} #132#return; {5645#(and (<= main_~v~0 2) (<= 100000 ~SIZE~0))} is VALID [2018-11-18 23:01:48,271 INFO L273 TraceCheckUtils]: 44: Hoare triple {5645#(and (<= main_~v~0 2) (<= 100000 ~SIZE~0))} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {5645#(and (<= main_~v~0 2) (<= 100000 ~SIZE~0))} is VALID [2018-11-18 23:01:48,271 INFO L273 TraceCheckUtils]: 45: Hoare triple {5645#(and (<= main_~v~0 2) (<= 100000 ~SIZE~0))} assume !(1 != #t~ret4);havoc #t~mem3;havoc #t~ret4; {5645#(and (<= main_~v~0 2) (<= 100000 ~SIZE~0))} is VALID [2018-11-18 23:01:48,272 INFO L273 TraceCheckUtils]: 46: Hoare triple {5645#(and (<= main_~v~0 2) (<= 100000 ~SIZE~0))} #t~post2 := ~v~0;~v~0 := 1 + #t~post2;havoc #t~post2; {5682#(and (<= main_~v~0 3) (<= 100000 ~SIZE~0))} is VALID [2018-11-18 23:01:48,273 INFO L273 TraceCheckUtils]: 47: Hoare triple {5682#(and (<= main_~v~0 3) (<= 100000 ~SIZE~0))} assume true; {5682#(and (<= main_~v~0 3) (<= 100000 ~SIZE~0))} is VALID [2018-11-18 23:01:48,274 INFO L273 TraceCheckUtils]: 48: Hoare triple {5682#(and (<= main_~v~0 3) (<= 100000 ~SIZE~0))} assume !!(~v~0 < ~SIZE~0);call #t~mem3 := read~int(~#values~0.base, ~#values~0.offset + 4 * ~v~0, 4); {5682#(and (<= main_~v~0 3) (<= 100000 ~SIZE~0))} is VALID [2018-11-18 23:01:48,275 INFO L256 TraceCheckUtils]: 49: Hoare triple {5682#(and (<= main_~v~0 3) (<= 100000 ~SIZE~0))} call #t~ret4 := elem_exists(~#set~0.base, ~#set~0.offset, ~n~0, #t~mem3); {5533#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:01:48,276 INFO L273 TraceCheckUtils]: 50: Hoare triple {5533#(<= 100000 ~SIZE~0)} ~set.base, ~set.offset := #in~set.base, #in~set.offset;~size := #in~size;~value := #in~value;havoc ~i~0;~i~0 := 0; {5533#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:01:48,277 INFO L273 TraceCheckUtils]: 51: Hoare triple {5533#(<= 100000 ~SIZE~0)} assume true; {5533#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:01:48,277 INFO L273 TraceCheckUtils]: 52: Hoare triple {5533#(<= 100000 ~SIZE~0)} assume !!(~i~0 < ~size);call #t~mem1 := read~int(~set.base, ~set.offset + 4 * ~i~0, 4); {5533#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:01:48,278 INFO L273 TraceCheckUtils]: 53: Hoare triple {5533#(<= 100000 ~SIZE~0)} assume #t~mem1 == ~value;havoc #t~mem1;#res := 1; {5533#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:01:48,278 INFO L273 TraceCheckUtils]: 54: Hoare triple {5533#(<= 100000 ~SIZE~0)} assume true; {5533#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:01:48,280 INFO L268 TraceCheckUtils]: 55: Hoare quadruple {5533#(<= 100000 ~SIZE~0)} {5682#(and (<= main_~v~0 3) (<= 100000 ~SIZE~0))} #132#return; {5682#(and (<= main_~v~0 3) (<= 100000 ~SIZE~0))} is VALID [2018-11-18 23:01:48,281 INFO L273 TraceCheckUtils]: 56: Hoare triple {5682#(and (<= main_~v~0 3) (<= 100000 ~SIZE~0))} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {5682#(and (<= main_~v~0 3) (<= 100000 ~SIZE~0))} is VALID [2018-11-18 23:01:48,281 INFO L273 TraceCheckUtils]: 57: Hoare triple {5682#(and (<= main_~v~0 3) (<= 100000 ~SIZE~0))} assume !(1 != #t~ret4);havoc #t~mem3;havoc #t~ret4; {5682#(and (<= main_~v~0 3) (<= 100000 ~SIZE~0))} is VALID [2018-11-18 23:01:48,282 INFO L273 TraceCheckUtils]: 58: Hoare triple {5682#(and (<= main_~v~0 3) (<= 100000 ~SIZE~0))} #t~post2 := ~v~0;~v~0 := 1 + #t~post2;havoc #t~post2; {5719#(and (<= main_~v~0 4) (<= 100000 ~SIZE~0))} is VALID [2018-11-18 23:01:48,283 INFO L273 TraceCheckUtils]: 59: Hoare triple {5719#(and (<= main_~v~0 4) (<= 100000 ~SIZE~0))} assume true; {5719#(and (<= main_~v~0 4) (<= 100000 ~SIZE~0))} is VALID [2018-11-18 23:01:48,284 INFO L273 TraceCheckUtils]: 60: Hoare triple {5719#(and (<= main_~v~0 4) (<= 100000 ~SIZE~0))} assume !!(~v~0 < ~SIZE~0);call #t~mem3 := read~int(~#values~0.base, ~#values~0.offset + 4 * ~v~0, 4); {5719#(and (<= main_~v~0 4) (<= 100000 ~SIZE~0))} is VALID [2018-11-18 23:01:48,285 INFO L256 TraceCheckUtils]: 61: Hoare triple {5719#(and (<= main_~v~0 4) (<= 100000 ~SIZE~0))} call #t~ret4 := elem_exists(~#set~0.base, ~#set~0.offset, ~n~0, #t~mem3); {5533#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:01:48,286 INFO L273 TraceCheckUtils]: 62: Hoare triple {5533#(<= 100000 ~SIZE~0)} ~set.base, ~set.offset := #in~set.base, #in~set.offset;~size := #in~size;~value := #in~value;havoc ~i~0;~i~0 := 0; {5533#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:01:48,286 INFO L273 TraceCheckUtils]: 63: Hoare triple {5533#(<= 100000 ~SIZE~0)} assume true; {5533#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:01:48,287 INFO L273 TraceCheckUtils]: 64: Hoare triple {5533#(<= 100000 ~SIZE~0)} assume !!(~i~0 < ~size);call #t~mem1 := read~int(~set.base, ~set.offset + 4 * ~i~0, 4); {5533#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:01:48,287 INFO L273 TraceCheckUtils]: 65: Hoare triple {5533#(<= 100000 ~SIZE~0)} assume #t~mem1 == ~value;havoc #t~mem1;#res := 1; {5533#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:01:48,288 INFO L273 TraceCheckUtils]: 66: Hoare triple {5533#(<= 100000 ~SIZE~0)} assume true; {5533#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:01:48,290 INFO L268 TraceCheckUtils]: 67: Hoare quadruple {5533#(<= 100000 ~SIZE~0)} {5719#(and (<= main_~v~0 4) (<= 100000 ~SIZE~0))} #132#return; {5719#(and (<= main_~v~0 4) (<= 100000 ~SIZE~0))} is VALID [2018-11-18 23:01:48,290 INFO L273 TraceCheckUtils]: 68: Hoare triple {5719#(and (<= main_~v~0 4) (<= 100000 ~SIZE~0))} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {5719#(and (<= main_~v~0 4) (<= 100000 ~SIZE~0))} is VALID [2018-11-18 23:01:48,291 INFO L273 TraceCheckUtils]: 69: Hoare triple {5719#(and (<= main_~v~0 4) (<= 100000 ~SIZE~0))} assume !(1 != #t~ret4);havoc #t~mem3;havoc #t~ret4; {5719#(and (<= main_~v~0 4) (<= 100000 ~SIZE~0))} is VALID [2018-11-18 23:01:48,292 INFO L273 TraceCheckUtils]: 70: Hoare triple {5719#(and (<= main_~v~0 4) (<= 100000 ~SIZE~0))} #t~post2 := ~v~0;~v~0 := 1 + #t~post2;havoc #t~post2; {5756#(and (<= main_~v~0 5) (<= 100000 ~SIZE~0))} is VALID [2018-11-18 23:01:48,293 INFO L273 TraceCheckUtils]: 71: Hoare triple {5756#(and (<= main_~v~0 5) (<= 100000 ~SIZE~0))} assume true; {5756#(and (<= main_~v~0 5) (<= 100000 ~SIZE~0))} is VALID [2018-11-18 23:01:48,293 INFO L273 TraceCheckUtils]: 72: Hoare triple {5756#(and (<= main_~v~0 5) (<= 100000 ~SIZE~0))} assume !(~v~0 < ~SIZE~0); {5532#false} is VALID [2018-11-18 23:01:48,294 INFO L273 TraceCheckUtils]: 73: Hoare triple {5532#false} ~i~1 := 0; {5532#false} is VALID [2018-11-18 23:01:48,294 INFO L273 TraceCheckUtils]: 74: Hoare triple {5532#false} assume true; {5532#false} is VALID [2018-11-18 23:01:48,294 INFO L273 TraceCheckUtils]: 75: Hoare triple {5532#false} assume !!(~i~1 < ~SIZE~0 && 1 != ~found~0);call #t~mem8 := read~int(~#set~0.base, ~#set~0.offset + 4 * ~i~1, 4); {5532#false} is VALID [2018-11-18 23:01:48,294 INFO L273 TraceCheckUtils]: 76: Hoare triple {5532#false} assume #t~mem8 == ~element~0;havoc #t~mem8;~found~0 := 1;~pos~0 := ~i~1; {5532#false} is VALID [2018-11-18 23:01:48,294 INFO L273 TraceCheckUtils]: 77: Hoare triple {5532#false} #t~post7 := ~i~1;~i~1 := 1 + #t~post7;havoc #t~post7; {5532#false} is VALID [2018-11-18 23:01:48,295 INFO L273 TraceCheckUtils]: 78: Hoare triple {5532#false} assume true; {5532#false} is VALID [2018-11-18 23:01:48,295 INFO L273 TraceCheckUtils]: 79: Hoare triple {5532#false} assume !(~i~1 < ~SIZE~0 && 1 != ~found~0); {5532#false} is VALID [2018-11-18 23:01:48,295 INFO L273 TraceCheckUtils]: 80: Hoare triple {5532#false} assume 1 == ~found~0;~i~1 := ~pos~0; {5532#false} is VALID [2018-11-18 23:01:48,295 INFO L273 TraceCheckUtils]: 81: Hoare triple {5532#false} assume true; {5532#false} is VALID [2018-11-18 23:01:48,295 INFO L273 TraceCheckUtils]: 82: Hoare triple {5532#false} assume !!(~i~1 < ~SIZE~0 - 1);call #t~mem10 := read~int(~#set~0.base, ~#set~0.offset + 4 * (1 + ~i~1), 4);call write~int(#t~mem10, ~#set~0.base, ~#set~0.offset + 4 * ~i~1, 4);havoc #t~mem10; {5532#false} is VALID [2018-11-18 23:01:48,296 INFO L273 TraceCheckUtils]: 83: Hoare triple {5532#false} #t~post9 := ~i~1;~i~1 := 1 + #t~post9;havoc #t~post9; {5532#false} is VALID [2018-11-18 23:01:48,296 INFO L273 TraceCheckUtils]: 84: Hoare triple {5532#false} assume true; {5532#false} is VALID [2018-11-18 23:01:48,296 INFO L273 TraceCheckUtils]: 85: Hoare triple {5532#false} assume !!(~i~1 < ~SIZE~0 - 1);call #t~mem10 := read~int(~#set~0.base, ~#set~0.offset + 4 * (1 + ~i~1), 4);call write~int(#t~mem10, ~#set~0.base, ~#set~0.offset + 4 * ~i~1, 4);havoc #t~mem10; {5532#false} is VALID [2018-11-18 23:01:48,296 INFO L273 TraceCheckUtils]: 86: Hoare triple {5532#false} #t~post9 := ~i~1;~i~1 := 1 + #t~post9;havoc #t~post9; {5532#false} is VALID [2018-11-18 23:01:48,296 INFO L273 TraceCheckUtils]: 87: Hoare triple {5532#false} assume true; {5532#false} is VALID [2018-11-18 23:01:48,296 INFO L273 TraceCheckUtils]: 88: Hoare triple {5532#false} assume !(~i~1 < ~SIZE~0 - 1); {5532#false} is VALID [2018-11-18 23:01:48,296 INFO L273 TraceCheckUtils]: 89: Hoare triple {5532#false} assume 1 == ~found~0;~i~1 := 0; {5532#false} is VALID [2018-11-18 23:01:48,296 INFO L273 TraceCheckUtils]: 90: Hoare triple {5532#false} assume true; {5532#false} is VALID [2018-11-18 23:01:48,297 INFO L273 TraceCheckUtils]: 91: Hoare triple {5532#false} assume !!(~i~1 < ~SIZE~0 - 1);call #t~mem12 := read~int(~#set~0.base, ~#set~0.offset + 4 * ~i~1, 4); {5532#false} is VALID [2018-11-18 23:01:48,297 INFO L256 TraceCheckUtils]: 92: Hoare triple {5532#false} call __VERIFIER_assert((if #t~mem12 != ~element~0 then 1 else 0)); {5532#false} is VALID [2018-11-18 23:01:48,297 INFO L273 TraceCheckUtils]: 93: Hoare triple {5532#false} ~cond := #in~cond; {5532#false} is VALID [2018-11-18 23:01:48,297 INFO L273 TraceCheckUtils]: 94: Hoare triple {5532#false} assume 0 == ~cond; {5532#false} is VALID [2018-11-18 23:01:48,297 INFO L273 TraceCheckUtils]: 95: Hoare triple {5532#false} assume !false; {5532#false} is VALID [2018-11-18 23:01:48,307 INFO L134 CoverageAnalysis]: Checked inductivity of 135 backedges. 0 proven. 70 refuted. 0 times theorem prover too weak. 65 trivial. 0 not checked. [2018-11-18 23:01:48,327 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-18 23:01:48,327 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 9] total 13 [2018-11-18 23:01:48,328 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 96 [2018-11-18 23:01:48,328 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-18 23:01:48,328 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 13 states. [2018-11-18 23:01:48,449 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 111 edges. 111 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 23:01:48,449 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-11-18 23:01:48,450 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-11-18 23:01:48,450 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=107, Unknown=0, NotChecked=0, Total=156 [2018-11-18 23:01:48,450 INFO L87 Difference]: Start difference. First operand 118 states and 144 transitions. Second operand 13 states. [2018-11-18 23:01:50,658 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 23:01:50,659 INFO L93 Difference]: Finished difference Result 231 states and 282 transitions. [2018-11-18 23:01:50,659 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-11-18 23:01:50,659 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 96 [2018-11-18 23:01:50,659 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 23:01:50,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2018-11-18 23:01:50,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 221 transitions. [2018-11-18 23:01:50,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2018-11-18 23:01:50,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 221 transitions. [2018-11-18 23:01:50,666 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 16 states and 221 transitions. [2018-11-18 23:01:51,181 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 221 edges. 221 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 23:01:51,186 INFO L225 Difference]: With dead ends: 231 [2018-11-18 23:01:51,186 INFO L226 Difference]: Without dead ends: 187 [2018-11-18 23:01:51,187 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 91 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=87, Invalid=219, Unknown=0, NotChecked=0, Total=306 [2018-11-18 23:01:51,187 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 187 states. [2018-11-18 23:01:51,388 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 187 to 131. [2018-11-18 23:01:51,388 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-18 23:01:51,388 INFO L82 GeneralOperation]: Start isEquivalent. First operand 187 states. Second operand 131 states. [2018-11-18 23:01:51,389 INFO L74 IsIncluded]: Start isIncluded. First operand 187 states. Second operand 131 states. [2018-11-18 23:01:51,389 INFO L87 Difference]: Start difference. First operand 187 states. Second operand 131 states. [2018-11-18 23:01:51,397 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 23:01:51,397 INFO L93 Difference]: Finished difference Result 187 states and 232 transitions. [2018-11-18 23:01:51,398 INFO L276 IsEmpty]: Start isEmpty. Operand 187 states and 232 transitions. [2018-11-18 23:01:51,398 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 23:01:51,398 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 23:01:51,399 INFO L74 IsIncluded]: Start isIncluded. First operand 131 states. Second operand 187 states. [2018-11-18 23:01:51,400 INFO L87 Difference]: Start difference. First operand 131 states. Second operand 187 states. [2018-11-18 23:01:51,405 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 23:01:51,406 INFO L93 Difference]: Finished difference Result 187 states and 232 transitions. [2018-11-18 23:01:51,406 INFO L276 IsEmpty]: Start isEmpty. Operand 187 states and 232 transitions. [2018-11-18 23:01:51,407 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 23:01:51,407 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 23:01:51,407 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-18 23:01:51,407 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-18 23:01:51,408 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 131 states. [2018-11-18 23:01:51,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 162 transitions. [2018-11-18 23:01:51,412 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 162 transitions. Word has length 96 [2018-11-18 23:01:51,412 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 23:01:51,412 INFO L480 AbstractCegarLoop]: Abstraction has 131 states and 162 transitions. [2018-11-18 23:01:51,412 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-11-18 23:01:51,412 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 162 transitions. [2018-11-18 23:01:51,414 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2018-11-18 23:01:51,414 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 23:01:51,414 INFO L375 BasicCegarLoop]: trace histogram [7, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 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, 1, 1, 1] [2018-11-18 23:01:51,414 INFO L423 AbstractCegarLoop]: === Iteration 12 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 23:01:51,414 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 23:01:51,415 INFO L82 PathProgramCache]: Analyzing trace with hash 953272754, now seen corresponding path program 1 times [2018-11-18 23:01:51,416 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 23:01:51,416 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 23:01:51,417 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 23:01:51,417 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 23:01:51,417 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 23:01:51,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 23:01:51,811 INFO L256 TraceCheckUtils]: 0: Hoare triple {6688#true} call ULTIMATE.init(); {6688#true} is VALID [2018-11-18 23:01:51,813 INFO L273 TraceCheckUtils]: 1: Hoare triple {6688#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~SIZE~0 := 100000; {6690#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:01:51,813 INFO L273 TraceCheckUtils]: 2: Hoare triple {6690#(<= 100000 ~SIZE~0)} assume true; {6690#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:01:51,814 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {6690#(<= 100000 ~SIZE~0)} {6688#true} #128#return; {6690#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:01:51,815 INFO L256 TraceCheckUtils]: 4: Hoare triple {6690#(<= 100000 ~SIZE~0)} call #t~ret13 := main(); {6690#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:01:51,816 INFO L273 TraceCheckUtils]: 5: Hoare triple {6690#(<= 100000 ~SIZE~0)} havoc ~i~1;havoc ~pos~0;~n~0 := 0;~found~0 := 0;call ~#set~0.base, ~#set~0.offset := #Ultimate.alloc(4 * ~SIZE~0);call ~#values~0.base, ~#values~0.offset := #Ultimate.alloc(4 * ~SIZE~0);havoc ~element~0;havoc ~v~0;~v~0 := 0; {6691#(and (= main_~v~0 0) (<= 100000 ~SIZE~0))} is VALID [2018-11-18 23:01:51,816 INFO L273 TraceCheckUtils]: 6: Hoare triple {6691#(and (= main_~v~0 0) (<= 100000 ~SIZE~0))} assume true; {6691#(and (= main_~v~0 0) (<= 100000 ~SIZE~0))} is VALID [2018-11-18 23:01:51,817 INFO L273 TraceCheckUtils]: 7: Hoare triple {6691#(and (= main_~v~0 0) (<= 100000 ~SIZE~0))} assume !!(~v~0 < ~SIZE~0);call #t~mem3 := read~int(~#values~0.base, ~#values~0.offset + 4 * ~v~0, 4); {6691#(and (= main_~v~0 0) (<= 100000 ~SIZE~0))} is VALID [2018-11-18 23:01:51,817 INFO L256 TraceCheckUtils]: 8: Hoare triple {6691#(and (= main_~v~0 0) (<= 100000 ~SIZE~0))} call #t~ret4 := elem_exists(~#set~0.base, ~#set~0.offset, ~n~0, #t~mem3); {6688#true} is VALID [2018-11-18 23:01:51,818 INFO L273 TraceCheckUtils]: 9: Hoare triple {6688#true} ~set.base, ~set.offset := #in~set.base, #in~set.offset;~size := #in~size;~value := #in~value;havoc ~i~0;~i~0 := 0; {6688#true} is VALID [2018-11-18 23:01:51,818 INFO L273 TraceCheckUtils]: 10: Hoare triple {6688#true} assume true; {6688#true} is VALID [2018-11-18 23:01:51,818 INFO L273 TraceCheckUtils]: 11: Hoare triple {6688#true} assume !(~i~0 < ~size); {6688#true} is VALID [2018-11-18 23:01:51,818 INFO L273 TraceCheckUtils]: 12: Hoare triple {6688#true} #res := 0; {6688#true} is VALID [2018-11-18 23:01:51,819 INFO L273 TraceCheckUtils]: 13: Hoare triple {6688#true} assume true; {6688#true} is VALID [2018-11-18 23:01:51,820 INFO L268 TraceCheckUtils]: 14: Hoare quadruple {6688#true} {6691#(and (= main_~v~0 0) (<= 100000 ~SIZE~0))} #132#return; {6691#(and (= main_~v~0 0) (<= 100000 ~SIZE~0))} is VALID [2018-11-18 23:01:51,820 INFO L273 TraceCheckUtils]: 15: Hoare triple {6691#(and (= main_~v~0 0) (<= 100000 ~SIZE~0))} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {6691#(and (= main_~v~0 0) (<= 100000 ~SIZE~0))} is VALID [2018-11-18 23:01:51,821 INFO L273 TraceCheckUtils]: 16: Hoare triple {6691#(and (= main_~v~0 0) (<= 100000 ~SIZE~0))} assume 1 != #t~ret4;havoc #t~mem3;havoc #t~ret4;call #t~mem5 := read~int(~#values~0.base, ~#values~0.offset + 4 * ~v~0, 4); {6691#(and (= main_~v~0 0) (<= 100000 ~SIZE~0))} is VALID [2018-11-18 23:01:51,821 INFO L256 TraceCheckUtils]: 17: Hoare triple {6691#(and (= main_~v~0 0) (<= 100000 ~SIZE~0))} call #t~ret6 := insert(~#set~0.base, ~#set~0.offset, ~n~0, #t~mem5); {6688#true} is VALID [2018-11-18 23:01:51,821 INFO L273 TraceCheckUtils]: 18: Hoare triple {6688#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; {6688#true} is VALID [2018-11-18 23:01:51,821 INFO L273 TraceCheckUtils]: 19: Hoare triple {6688#true} assume true; {6688#true} is VALID [2018-11-18 23:01:51,822 INFO L268 TraceCheckUtils]: 20: Hoare quadruple {6688#true} {6691#(and (= main_~v~0 0) (<= 100000 ~SIZE~0))} #134#return; {6691#(and (= main_~v~0 0) (<= 100000 ~SIZE~0))} is VALID [2018-11-18 23:01:51,822 INFO L273 TraceCheckUtils]: 21: Hoare triple {6691#(and (= main_~v~0 0) (<= 100000 ~SIZE~0))} assume -2147483648 <= #t~ret6 && #t~ret6 <= 2147483647;~n~0 := #t~ret6;havoc #t~ret6;havoc #t~mem5; {6691#(and (= main_~v~0 0) (<= 100000 ~SIZE~0))} is VALID [2018-11-18 23:01:51,823 INFO L273 TraceCheckUtils]: 22: Hoare triple {6691#(and (= main_~v~0 0) (<= 100000 ~SIZE~0))} #t~post2 := ~v~0;~v~0 := 1 + #t~post2;havoc #t~post2; {6692#(<= (+ main_~v~0 99999) ~SIZE~0)} is VALID [2018-11-18 23:01:51,823 INFO L273 TraceCheckUtils]: 23: Hoare triple {6692#(<= (+ main_~v~0 99999) ~SIZE~0)} assume true; {6692#(<= (+ main_~v~0 99999) ~SIZE~0)} is VALID [2018-11-18 23:01:51,824 INFO L273 TraceCheckUtils]: 24: Hoare triple {6692#(<= (+ main_~v~0 99999) ~SIZE~0)} assume !!(~v~0 < ~SIZE~0);call #t~mem3 := read~int(~#values~0.base, ~#values~0.offset + 4 * ~v~0, 4); {6692#(<= (+ main_~v~0 99999) ~SIZE~0)} is VALID [2018-11-18 23:01:51,824 INFO L256 TraceCheckUtils]: 25: Hoare triple {6692#(<= (+ main_~v~0 99999) ~SIZE~0)} call #t~ret4 := elem_exists(~#set~0.base, ~#set~0.offset, ~n~0, #t~mem3); {6688#true} is VALID [2018-11-18 23:01:51,824 INFO L273 TraceCheckUtils]: 26: Hoare triple {6688#true} ~set.base, ~set.offset := #in~set.base, #in~set.offset;~size := #in~size;~value := #in~value;havoc ~i~0;~i~0 := 0; {6688#true} is VALID [2018-11-18 23:01:51,824 INFO L273 TraceCheckUtils]: 27: Hoare triple {6688#true} assume true; {6688#true} is VALID [2018-11-18 23:01:51,825 INFO L273 TraceCheckUtils]: 28: Hoare triple {6688#true} assume !!(~i~0 < ~size);call #t~mem1 := read~int(~set.base, ~set.offset + 4 * ~i~0, 4); {6688#true} is VALID [2018-11-18 23:01:51,825 INFO L273 TraceCheckUtils]: 29: Hoare triple {6688#true} assume #t~mem1 == ~value;havoc #t~mem1;#res := 1; {6688#true} is VALID [2018-11-18 23:01:51,825 INFO L273 TraceCheckUtils]: 30: Hoare triple {6688#true} assume true; {6688#true} is VALID [2018-11-18 23:01:51,826 INFO L268 TraceCheckUtils]: 31: Hoare quadruple {6688#true} {6692#(<= (+ main_~v~0 99999) ~SIZE~0)} #132#return; {6692#(<= (+ main_~v~0 99999) ~SIZE~0)} is VALID [2018-11-18 23:01:51,827 INFO L273 TraceCheckUtils]: 32: Hoare triple {6692#(<= (+ main_~v~0 99999) ~SIZE~0)} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {6692#(<= (+ main_~v~0 99999) ~SIZE~0)} is VALID [2018-11-18 23:01:51,827 INFO L273 TraceCheckUtils]: 33: Hoare triple {6692#(<= (+ main_~v~0 99999) ~SIZE~0)} assume !(1 != #t~ret4);havoc #t~mem3;havoc #t~ret4; {6692#(<= (+ main_~v~0 99999) ~SIZE~0)} is VALID [2018-11-18 23:01:51,828 INFO L273 TraceCheckUtils]: 34: Hoare triple {6692#(<= (+ main_~v~0 99999) ~SIZE~0)} #t~post2 := ~v~0;~v~0 := 1 + #t~post2;havoc #t~post2; {6693#(<= (+ main_~v~0 99998) ~SIZE~0)} is VALID [2018-11-18 23:01:51,828 INFO L273 TraceCheckUtils]: 35: Hoare triple {6693#(<= (+ main_~v~0 99998) ~SIZE~0)} assume true; {6693#(<= (+ main_~v~0 99998) ~SIZE~0)} is VALID [2018-11-18 23:01:51,828 INFO L273 TraceCheckUtils]: 36: Hoare triple {6693#(<= (+ main_~v~0 99998) ~SIZE~0)} assume !!(~v~0 < ~SIZE~0);call #t~mem3 := read~int(~#values~0.base, ~#values~0.offset + 4 * ~v~0, 4); {6693#(<= (+ main_~v~0 99998) ~SIZE~0)} is VALID [2018-11-18 23:01:51,828 INFO L256 TraceCheckUtils]: 37: Hoare triple {6693#(<= (+ main_~v~0 99998) ~SIZE~0)} call #t~ret4 := elem_exists(~#set~0.base, ~#set~0.offset, ~n~0, #t~mem3); {6688#true} is VALID [2018-11-18 23:01:51,829 INFO L273 TraceCheckUtils]: 38: Hoare triple {6688#true} ~set.base, ~set.offset := #in~set.base, #in~set.offset;~size := #in~size;~value := #in~value;havoc ~i~0;~i~0 := 0; {6688#true} is VALID [2018-11-18 23:01:51,829 INFO L273 TraceCheckUtils]: 39: Hoare triple {6688#true} assume true; {6688#true} is VALID [2018-11-18 23:01:51,829 INFO L273 TraceCheckUtils]: 40: Hoare triple {6688#true} assume !!(~i~0 < ~size);call #t~mem1 := read~int(~set.base, ~set.offset + 4 * ~i~0, 4); {6688#true} is VALID [2018-11-18 23:01:51,829 INFO L273 TraceCheckUtils]: 41: Hoare triple {6688#true} assume #t~mem1 == ~value;havoc #t~mem1;#res := 1; {6688#true} is VALID [2018-11-18 23:01:51,830 INFO L273 TraceCheckUtils]: 42: Hoare triple {6688#true} assume true; {6688#true} is VALID [2018-11-18 23:01:51,831 INFO L268 TraceCheckUtils]: 43: Hoare quadruple {6688#true} {6693#(<= (+ main_~v~0 99998) ~SIZE~0)} #132#return; {6693#(<= (+ main_~v~0 99998) ~SIZE~0)} is VALID [2018-11-18 23:01:51,832 INFO L273 TraceCheckUtils]: 44: Hoare triple {6693#(<= (+ main_~v~0 99998) ~SIZE~0)} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {6693#(<= (+ main_~v~0 99998) ~SIZE~0)} is VALID [2018-11-18 23:01:51,832 INFO L273 TraceCheckUtils]: 45: Hoare triple {6693#(<= (+ main_~v~0 99998) ~SIZE~0)} assume !(1 != #t~ret4);havoc #t~mem3;havoc #t~ret4; {6693#(<= (+ main_~v~0 99998) ~SIZE~0)} is VALID [2018-11-18 23:01:51,833 INFO L273 TraceCheckUtils]: 46: Hoare triple {6693#(<= (+ main_~v~0 99998) ~SIZE~0)} #t~post2 := ~v~0;~v~0 := 1 + #t~post2;havoc #t~post2; {6694#(<= (+ main_~v~0 99997) ~SIZE~0)} is VALID [2018-11-18 23:01:51,834 INFO L273 TraceCheckUtils]: 47: Hoare triple {6694#(<= (+ main_~v~0 99997) ~SIZE~0)} assume true; {6694#(<= (+ main_~v~0 99997) ~SIZE~0)} is VALID [2018-11-18 23:01:51,834 INFO L273 TraceCheckUtils]: 48: Hoare triple {6694#(<= (+ main_~v~0 99997) ~SIZE~0)} assume !!(~v~0 < ~SIZE~0);call #t~mem3 := read~int(~#values~0.base, ~#values~0.offset + 4 * ~v~0, 4); {6694#(<= (+ main_~v~0 99997) ~SIZE~0)} is VALID [2018-11-18 23:01:51,834 INFO L256 TraceCheckUtils]: 49: Hoare triple {6694#(<= (+ main_~v~0 99997) ~SIZE~0)} call #t~ret4 := elem_exists(~#set~0.base, ~#set~0.offset, ~n~0, #t~mem3); {6688#true} is VALID [2018-11-18 23:01:51,835 INFO L273 TraceCheckUtils]: 50: Hoare triple {6688#true} ~set.base, ~set.offset := #in~set.base, #in~set.offset;~size := #in~size;~value := #in~value;havoc ~i~0;~i~0 := 0; {6688#true} is VALID [2018-11-18 23:01:51,835 INFO L273 TraceCheckUtils]: 51: Hoare triple {6688#true} assume true; {6688#true} is VALID [2018-11-18 23:01:51,835 INFO L273 TraceCheckUtils]: 52: Hoare triple {6688#true} assume !!(~i~0 < ~size);call #t~mem1 := read~int(~set.base, ~set.offset + 4 * ~i~0, 4); {6688#true} is VALID [2018-11-18 23:01:51,835 INFO L273 TraceCheckUtils]: 53: Hoare triple {6688#true} assume #t~mem1 == ~value;havoc #t~mem1;#res := 1; {6688#true} is VALID [2018-11-18 23:01:51,835 INFO L273 TraceCheckUtils]: 54: Hoare triple {6688#true} assume true; {6688#true} is VALID [2018-11-18 23:01:51,837 INFO L268 TraceCheckUtils]: 55: Hoare quadruple {6688#true} {6694#(<= (+ main_~v~0 99997) ~SIZE~0)} #132#return; {6694#(<= (+ main_~v~0 99997) ~SIZE~0)} is VALID [2018-11-18 23:01:51,837 INFO L273 TraceCheckUtils]: 56: Hoare triple {6694#(<= (+ main_~v~0 99997) ~SIZE~0)} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {6694#(<= (+ main_~v~0 99997) ~SIZE~0)} is VALID [2018-11-18 23:01:51,838 INFO L273 TraceCheckUtils]: 57: Hoare triple {6694#(<= (+ main_~v~0 99997) ~SIZE~0)} assume !(1 != #t~ret4);havoc #t~mem3;havoc #t~ret4; {6694#(<= (+ main_~v~0 99997) ~SIZE~0)} is VALID [2018-11-18 23:01:51,839 INFO L273 TraceCheckUtils]: 58: Hoare triple {6694#(<= (+ main_~v~0 99997) ~SIZE~0)} #t~post2 := ~v~0;~v~0 := 1 + #t~post2;havoc #t~post2; {6695#(<= (+ main_~v~0 99996) ~SIZE~0)} is VALID [2018-11-18 23:01:51,839 INFO L273 TraceCheckUtils]: 59: Hoare triple {6695#(<= (+ main_~v~0 99996) ~SIZE~0)} assume true; {6695#(<= (+ main_~v~0 99996) ~SIZE~0)} is VALID [2018-11-18 23:01:51,839 INFO L273 TraceCheckUtils]: 60: Hoare triple {6695#(<= (+ main_~v~0 99996) ~SIZE~0)} assume !!(~v~0 < ~SIZE~0);call #t~mem3 := read~int(~#values~0.base, ~#values~0.offset + 4 * ~v~0, 4); {6695#(<= (+ main_~v~0 99996) ~SIZE~0)} is VALID [2018-11-18 23:01:51,839 INFO L256 TraceCheckUtils]: 61: Hoare triple {6695#(<= (+ main_~v~0 99996) ~SIZE~0)} call #t~ret4 := elem_exists(~#set~0.base, ~#set~0.offset, ~n~0, #t~mem3); {6688#true} is VALID [2018-11-18 23:01:51,840 INFO L273 TraceCheckUtils]: 62: Hoare triple {6688#true} ~set.base, ~set.offset := #in~set.base, #in~set.offset;~size := #in~size;~value := #in~value;havoc ~i~0;~i~0 := 0; {6688#true} is VALID [2018-11-18 23:01:51,840 INFO L273 TraceCheckUtils]: 63: Hoare triple {6688#true} assume true; {6688#true} is VALID [2018-11-18 23:01:51,840 INFO L273 TraceCheckUtils]: 64: Hoare triple {6688#true} assume !!(~i~0 < ~size);call #t~mem1 := read~int(~set.base, ~set.offset + 4 * ~i~0, 4); {6688#true} is VALID [2018-11-18 23:01:51,840 INFO L273 TraceCheckUtils]: 65: Hoare triple {6688#true} assume #t~mem1 == ~value;havoc #t~mem1;#res := 1; {6688#true} is VALID [2018-11-18 23:01:51,840 INFO L273 TraceCheckUtils]: 66: Hoare triple {6688#true} assume true; {6688#true} is VALID [2018-11-18 23:01:51,841 INFO L268 TraceCheckUtils]: 67: Hoare quadruple {6688#true} {6695#(<= (+ main_~v~0 99996) ~SIZE~0)} #132#return; {6695#(<= (+ main_~v~0 99996) ~SIZE~0)} is VALID [2018-11-18 23:01:51,841 INFO L273 TraceCheckUtils]: 68: Hoare triple {6695#(<= (+ main_~v~0 99996) ~SIZE~0)} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {6695#(<= (+ main_~v~0 99996) ~SIZE~0)} is VALID [2018-11-18 23:01:51,842 INFO L273 TraceCheckUtils]: 69: Hoare triple {6695#(<= (+ main_~v~0 99996) ~SIZE~0)} assume !(1 != #t~ret4);havoc #t~mem3;havoc #t~ret4; {6695#(<= (+ main_~v~0 99996) ~SIZE~0)} is VALID [2018-11-18 23:01:51,843 INFO L273 TraceCheckUtils]: 70: Hoare triple {6695#(<= (+ main_~v~0 99996) ~SIZE~0)} #t~post2 := ~v~0;~v~0 := 1 + #t~post2;havoc #t~post2; {6696#(<= (+ main_~v~0 99995) ~SIZE~0)} is VALID [2018-11-18 23:01:51,843 INFO L273 TraceCheckUtils]: 71: Hoare triple {6696#(<= (+ main_~v~0 99995) ~SIZE~0)} assume true; {6696#(<= (+ main_~v~0 99995) ~SIZE~0)} is VALID [2018-11-18 23:01:51,844 INFO L273 TraceCheckUtils]: 72: Hoare triple {6696#(<= (+ main_~v~0 99995) ~SIZE~0)} assume !!(~v~0 < ~SIZE~0);call #t~mem3 := read~int(~#values~0.base, ~#values~0.offset + 4 * ~v~0, 4); {6696#(<= (+ main_~v~0 99995) ~SIZE~0)} is VALID [2018-11-18 23:01:51,844 INFO L256 TraceCheckUtils]: 73: Hoare triple {6696#(<= (+ main_~v~0 99995) ~SIZE~0)} call #t~ret4 := elem_exists(~#set~0.base, ~#set~0.offset, ~n~0, #t~mem3); {6688#true} is VALID [2018-11-18 23:01:51,844 INFO L273 TraceCheckUtils]: 74: Hoare triple {6688#true} ~set.base, ~set.offset := #in~set.base, #in~set.offset;~size := #in~size;~value := #in~value;havoc ~i~0;~i~0 := 0; {6688#true} is VALID [2018-11-18 23:01:51,845 INFO L273 TraceCheckUtils]: 75: Hoare triple {6688#true} assume true; {6688#true} is VALID [2018-11-18 23:01:51,845 INFO L273 TraceCheckUtils]: 76: Hoare triple {6688#true} assume !!(~i~0 < ~size);call #t~mem1 := read~int(~set.base, ~set.offset + 4 * ~i~0, 4); {6688#true} is VALID [2018-11-18 23:01:51,845 INFO L273 TraceCheckUtils]: 77: Hoare triple {6688#true} assume #t~mem1 == ~value;havoc #t~mem1;#res := 1; {6688#true} is VALID [2018-11-18 23:01:51,845 INFO L273 TraceCheckUtils]: 78: Hoare triple {6688#true} assume true; {6688#true} is VALID [2018-11-18 23:01:51,846 INFO L268 TraceCheckUtils]: 79: Hoare quadruple {6688#true} {6696#(<= (+ main_~v~0 99995) ~SIZE~0)} #132#return; {6696#(<= (+ main_~v~0 99995) ~SIZE~0)} is VALID [2018-11-18 23:01:51,847 INFO L273 TraceCheckUtils]: 80: Hoare triple {6696#(<= (+ main_~v~0 99995) ~SIZE~0)} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {6696#(<= (+ main_~v~0 99995) ~SIZE~0)} is VALID [2018-11-18 23:01:51,847 INFO L273 TraceCheckUtils]: 81: Hoare triple {6696#(<= (+ main_~v~0 99995) ~SIZE~0)} assume !(1 != #t~ret4);havoc #t~mem3;havoc #t~ret4; {6696#(<= (+ main_~v~0 99995) ~SIZE~0)} is VALID [2018-11-18 23:01:51,848 INFO L273 TraceCheckUtils]: 82: Hoare triple {6696#(<= (+ main_~v~0 99995) ~SIZE~0)} #t~post2 := ~v~0;~v~0 := 1 + #t~post2;havoc #t~post2; {6697#(<= (+ main_~v~0 99994) ~SIZE~0)} is VALID [2018-11-18 23:01:51,848 INFO L273 TraceCheckUtils]: 83: Hoare triple {6697#(<= (+ main_~v~0 99994) ~SIZE~0)} assume true; {6697#(<= (+ main_~v~0 99994) ~SIZE~0)} is VALID [2018-11-18 23:01:51,848 INFO L273 TraceCheckUtils]: 84: Hoare triple {6697#(<= (+ main_~v~0 99994) ~SIZE~0)} assume !(~v~0 < ~SIZE~0); {6689#false} is VALID [2018-11-18 23:01:51,849 INFO L273 TraceCheckUtils]: 85: Hoare triple {6689#false} ~i~1 := 0; {6689#false} is VALID [2018-11-18 23:01:51,849 INFO L273 TraceCheckUtils]: 86: Hoare triple {6689#false} assume true; {6689#false} is VALID [2018-11-18 23:01:51,849 INFO L273 TraceCheckUtils]: 87: Hoare triple {6689#false} assume !!(~i~1 < ~SIZE~0 && 1 != ~found~0);call #t~mem8 := read~int(~#set~0.base, ~#set~0.offset + 4 * ~i~1, 4); {6689#false} is VALID [2018-11-18 23:01:51,849 INFO L273 TraceCheckUtils]: 88: Hoare triple {6689#false} assume !(#t~mem8 == ~element~0);havoc #t~mem8; {6689#false} is VALID [2018-11-18 23:01:51,850 INFO L273 TraceCheckUtils]: 89: Hoare triple {6689#false} #t~post7 := ~i~1;~i~1 := 1 + #t~post7;havoc #t~post7; {6689#false} is VALID [2018-11-18 23:01:51,850 INFO L273 TraceCheckUtils]: 90: Hoare triple {6689#false} assume true; {6689#false} is VALID [2018-11-18 23:01:51,850 INFO L273 TraceCheckUtils]: 91: Hoare triple {6689#false} assume !!(~i~1 < ~SIZE~0 && 1 != ~found~0);call #t~mem8 := read~int(~#set~0.base, ~#set~0.offset + 4 * ~i~1, 4); {6689#false} is VALID [2018-11-18 23:01:51,850 INFO L273 TraceCheckUtils]: 92: Hoare triple {6689#false} assume #t~mem8 == ~element~0;havoc #t~mem8;~found~0 := 1;~pos~0 := ~i~1; {6689#false} is VALID [2018-11-18 23:01:51,850 INFO L273 TraceCheckUtils]: 93: Hoare triple {6689#false} #t~post7 := ~i~1;~i~1 := 1 + #t~post7;havoc #t~post7; {6689#false} is VALID [2018-11-18 23:01:51,851 INFO L273 TraceCheckUtils]: 94: Hoare triple {6689#false} assume true; {6689#false} is VALID [2018-11-18 23:01:51,851 INFO L273 TraceCheckUtils]: 95: Hoare triple {6689#false} assume !(~i~1 < ~SIZE~0 && 1 != ~found~0); {6689#false} is VALID [2018-11-18 23:01:51,851 INFO L273 TraceCheckUtils]: 96: Hoare triple {6689#false} assume 1 == ~found~0;~i~1 := ~pos~0; {6689#false} is VALID [2018-11-18 23:01:51,851 INFO L273 TraceCheckUtils]: 97: Hoare triple {6689#false} assume true; {6689#false} is VALID [2018-11-18 23:01:51,851 INFO L273 TraceCheckUtils]: 98: Hoare triple {6689#false} assume !!(~i~1 < ~SIZE~0 - 1);call #t~mem10 := read~int(~#set~0.base, ~#set~0.offset + 4 * (1 + ~i~1), 4);call write~int(#t~mem10, ~#set~0.base, ~#set~0.offset + 4 * ~i~1, 4);havoc #t~mem10; {6689#false} is VALID [2018-11-18 23:01:51,851 INFO L273 TraceCheckUtils]: 99: Hoare triple {6689#false} #t~post9 := ~i~1;~i~1 := 1 + #t~post9;havoc #t~post9; {6689#false} is VALID [2018-11-18 23:01:51,851 INFO L273 TraceCheckUtils]: 100: Hoare triple {6689#false} assume true; {6689#false} is VALID [2018-11-18 23:01:51,851 INFO L273 TraceCheckUtils]: 101: Hoare triple {6689#false} assume !(~i~1 < ~SIZE~0 - 1); {6689#false} is VALID [2018-11-18 23:01:51,852 INFO L273 TraceCheckUtils]: 102: Hoare triple {6689#false} assume 1 == ~found~0;~i~1 := 0; {6689#false} is VALID [2018-11-18 23:01:51,852 INFO L273 TraceCheckUtils]: 103: Hoare triple {6689#false} assume true; {6689#false} is VALID [2018-11-18 23:01:51,852 INFO L273 TraceCheckUtils]: 104: Hoare triple {6689#false} assume !!(~i~1 < ~SIZE~0 - 1);call #t~mem12 := read~int(~#set~0.base, ~#set~0.offset + 4 * ~i~1, 4); {6689#false} is VALID [2018-11-18 23:01:51,852 INFO L256 TraceCheckUtils]: 105: Hoare triple {6689#false} call __VERIFIER_assert((if #t~mem12 != ~element~0 then 1 else 0)); {6689#false} is VALID [2018-11-18 23:01:51,852 INFO L273 TraceCheckUtils]: 106: Hoare triple {6689#false} ~cond := #in~cond; {6689#false} is VALID [2018-11-18 23:01:51,852 INFO L273 TraceCheckUtils]: 107: Hoare triple {6689#false} assume 0 == ~cond; {6689#false} is VALID [2018-11-18 23:01:51,852 INFO L273 TraceCheckUtils]: 108: Hoare triple {6689#false} assume !false; {6689#false} is VALID [2018-11-18 23:01:51,860 INFO L134 CoverageAnalysis]: Checked inductivity of 197 backedges. 0 proven. 102 refuted. 0 times theorem prover too weak. 95 trivial. 0 not checked. [2018-11-18 23:01:51,860 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 23:01:51,860 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 23:01:51,869 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 23:01:51,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 23:01:51,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 23:01:51,949 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 23:01:52,298 INFO L256 TraceCheckUtils]: 0: Hoare triple {6688#true} call ULTIMATE.init(); {6688#true} is VALID [2018-11-18 23:01:52,299 INFO L273 TraceCheckUtils]: 1: Hoare triple {6688#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~SIZE~0 := 100000; {6690#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:01:52,299 INFO L273 TraceCheckUtils]: 2: Hoare triple {6690#(<= 100000 ~SIZE~0)} assume true; {6690#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:01:52,300 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {6690#(<= 100000 ~SIZE~0)} {6688#true} #128#return; {6690#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:01:52,301 INFO L256 TraceCheckUtils]: 4: Hoare triple {6690#(<= 100000 ~SIZE~0)} call #t~ret13 := main(); {6690#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:01:52,302 INFO L273 TraceCheckUtils]: 5: Hoare triple {6690#(<= 100000 ~SIZE~0)} havoc ~i~1;havoc ~pos~0;~n~0 := 0;~found~0 := 0;call ~#set~0.base, ~#set~0.offset := #Ultimate.alloc(4 * ~SIZE~0);call ~#values~0.base, ~#values~0.offset := #Ultimate.alloc(4 * ~SIZE~0);havoc ~element~0;havoc ~v~0;~v~0 := 0; {6716#(and (<= main_~v~0 0) (<= 100000 ~SIZE~0))} is VALID [2018-11-18 23:01:52,303 INFO L273 TraceCheckUtils]: 6: Hoare triple {6716#(and (<= main_~v~0 0) (<= 100000 ~SIZE~0))} assume true; {6716#(and (<= main_~v~0 0) (<= 100000 ~SIZE~0))} is VALID [2018-11-18 23:01:52,303 INFO L273 TraceCheckUtils]: 7: Hoare triple {6716#(and (<= main_~v~0 0) (<= 100000 ~SIZE~0))} assume !!(~v~0 < ~SIZE~0);call #t~mem3 := read~int(~#values~0.base, ~#values~0.offset + 4 * ~v~0, 4); {6716#(and (<= main_~v~0 0) (<= 100000 ~SIZE~0))} is VALID [2018-11-18 23:01:52,305 INFO L256 TraceCheckUtils]: 8: Hoare triple {6716#(and (<= main_~v~0 0) (<= 100000 ~SIZE~0))} call #t~ret4 := elem_exists(~#set~0.base, ~#set~0.offset, ~n~0, #t~mem3); {6690#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:01:52,305 INFO L273 TraceCheckUtils]: 9: Hoare triple {6690#(<= 100000 ~SIZE~0)} ~set.base, ~set.offset := #in~set.base, #in~set.offset;~size := #in~size;~value := #in~value;havoc ~i~0;~i~0 := 0; {6690#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:01:52,306 INFO L273 TraceCheckUtils]: 10: Hoare triple {6690#(<= 100000 ~SIZE~0)} assume true; {6690#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:01:52,306 INFO L273 TraceCheckUtils]: 11: Hoare triple {6690#(<= 100000 ~SIZE~0)} assume !(~i~0 < ~size); {6690#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:01:52,307 INFO L273 TraceCheckUtils]: 12: Hoare triple {6690#(<= 100000 ~SIZE~0)} #res := 0; {6690#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:01:52,307 INFO L273 TraceCheckUtils]: 13: Hoare triple {6690#(<= 100000 ~SIZE~0)} assume true; {6690#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:01:52,309 INFO L268 TraceCheckUtils]: 14: Hoare quadruple {6690#(<= 100000 ~SIZE~0)} {6716#(and (<= main_~v~0 0) (<= 100000 ~SIZE~0))} #132#return; {6716#(and (<= main_~v~0 0) (<= 100000 ~SIZE~0))} is VALID [2018-11-18 23:01:52,309 INFO L273 TraceCheckUtils]: 15: Hoare triple {6716#(and (<= main_~v~0 0) (<= 100000 ~SIZE~0))} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {6716#(and (<= main_~v~0 0) (<= 100000 ~SIZE~0))} is VALID [2018-11-18 23:01:52,310 INFO L273 TraceCheckUtils]: 16: Hoare triple {6716#(and (<= main_~v~0 0) (<= 100000 ~SIZE~0))} assume 1 != #t~ret4;havoc #t~mem3;havoc #t~ret4;call #t~mem5 := read~int(~#values~0.base, ~#values~0.offset + 4 * ~v~0, 4); {6716#(and (<= main_~v~0 0) (<= 100000 ~SIZE~0))} is VALID [2018-11-18 23:01:52,311 INFO L256 TraceCheckUtils]: 17: Hoare triple {6716#(and (<= main_~v~0 0) (<= 100000 ~SIZE~0))} call #t~ret6 := insert(~#set~0.base, ~#set~0.offset, ~n~0, #t~mem5); {6690#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:01:52,312 INFO L273 TraceCheckUtils]: 18: Hoare triple {6690#(<= 100000 ~SIZE~0)} ~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; {6690#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:01:52,312 INFO L273 TraceCheckUtils]: 19: Hoare triple {6690#(<= 100000 ~SIZE~0)} assume true; {6690#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:01:52,314 INFO L268 TraceCheckUtils]: 20: Hoare quadruple {6690#(<= 100000 ~SIZE~0)} {6716#(and (<= main_~v~0 0) (<= 100000 ~SIZE~0))} #134#return; {6716#(and (<= main_~v~0 0) (<= 100000 ~SIZE~0))} is VALID [2018-11-18 23:01:52,314 INFO L273 TraceCheckUtils]: 21: Hoare triple {6716#(and (<= main_~v~0 0) (<= 100000 ~SIZE~0))} assume -2147483648 <= #t~ret6 && #t~ret6 <= 2147483647;~n~0 := #t~ret6;havoc #t~ret6;havoc #t~mem5; {6716#(and (<= main_~v~0 0) (<= 100000 ~SIZE~0))} is VALID [2018-11-18 23:01:52,315 INFO L273 TraceCheckUtils]: 22: Hoare triple {6716#(and (<= main_~v~0 0) (<= 100000 ~SIZE~0))} #t~post2 := ~v~0;~v~0 := 1 + #t~post2;havoc #t~post2; {6768#(and (<= main_~v~0 1) (<= 100000 ~SIZE~0))} is VALID [2018-11-18 23:01:52,316 INFO L273 TraceCheckUtils]: 23: Hoare triple {6768#(and (<= main_~v~0 1) (<= 100000 ~SIZE~0))} assume true; {6768#(and (<= main_~v~0 1) (<= 100000 ~SIZE~0))} is VALID [2018-11-18 23:01:52,317 INFO L273 TraceCheckUtils]: 24: Hoare triple {6768#(and (<= main_~v~0 1) (<= 100000 ~SIZE~0))} assume !!(~v~0 < ~SIZE~0);call #t~mem3 := read~int(~#values~0.base, ~#values~0.offset + 4 * ~v~0, 4); {6768#(and (<= main_~v~0 1) (<= 100000 ~SIZE~0))} is VALID [2018-11-18 23:01:52,318 INFO L256 TraceCheckUtils]: 25: Hoare triple {6768#(and (<= main_~v~0 1) (<= 100000 ~SIZE~0))} call #t~ret4 := elem_exists(~#set~0.base, ~#set~0.offset, ~n~0, #t~mem3); {6690#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:01:52,319 INFO L273 TraceCheckUtils]: 26: Hoare triple {6690#(<= 100000 ~SIZE~0)} ~set.base, ~set.offset := #in~set.base, #in~set.offset;~size := #in~size;~value := #in~value;havoc ~i~0;~i~0 := 0; {6690#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:01:52,319 INFO L273 TraceCheckUtils]: 27: Hoare triple {6690#(<= 100000 ~SIZE~0)} assume true; {6690#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:01:52,320 INFO L273 TraceCheckUtils]: 28: Hoare triple {6690#(<= 100000 ~SIZE~0)} assume !!(~i~0 < ~size);call #t~mem1 := read~int(~set.base, ~set.offset + 4 * ~i~0, 4); {6690#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:01:52,320 INFO L273 TraceCheckUtils]: 29: Hoare triple {6690#(<= 100000 ~SIZE~0)} assume #t~mem1 == ~value;havoc #t~mem1;#res := 1; {6690#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:01:52,321 INFO L273 TraceCheckUtils]: 30: Hoare triple {6690#(<= 100000 ~SIZE~0)} assume true; {6690#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:01:52,322 INFO L268 TraceCheckUtils]: 31: Hoare quadruple {6690#(<= 100000 ~SIZE~0)} {6768#(and (<= main_~v~0 1) (<= 100000 ~SIZE~0))} #132#return; {6768#(and (<= main_~v~0 1) (<= 100000 ~SIZE~0))} is VALID [2018-11-18 23:01:52,323 INFO L273 TraceCheckUtils]: 32: Hoare triple {6768#(and (<= main_~v~0 1) (<= 100000 ~SIZE~0))} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {6768#(and (<= main_~v~0 1) (<= 100000 ~SIZE~0))} is VALID [2018-11-18 23:01:52,324 INFO L273 TraceCheckUtils]: 33: Hoare triple {6768#(and (<= main_~v~0 1) (<= 100000 ~SIZE~0))} assume !(1 != #t~ret4);havoc #t~mem3;havoc #t~ret4; {6768#(and (<= main_~v~0 1) (<= 100000 ~SIZE~0))} is VALID [2018-11-18 23:01:52,324 INFO L273 TraceCheckUtils]: 34: Hoare triple {6768#(and (<= main_~v~0 1) (<= 100000 ~SIZE~0))} #t~post2 := ~v~0;~v~0 := 1 + #t~post2;havoc #t~post2; {6805#(and (<= main_~v~0 2) (<= 100000 ~SIZE~0))} is VALID [2018-11-18 23:01:52,325 INFO L273 TraceCheckUtils]: 35: Hoare triple {6805#(and (<= main_~v~0 2) (<= 100000 ~SIZE~0))} assume true; {6805#(and (<= main_~v~0 2) (<= 100000 ~SIZE~0))} is VALID [2018-11-18 23:01:52,326 INFO L273 TraceCheckUtils]: 36: Hoare triple {6805#(and (<= main_~v~0 2) (<= 100000 ~SIZE~0))} assume !!(~v~0 < ~SIZE~0);call #t~mem3 := read~int(~#values~0.base, ~#values~0.offset + 4 * ~v~0, 4); {6805#(and (<= main_~v~0 2) (<= 100000 ~SIZE~0))} is VALID [2018-11-18 23:01:52,327 INFO L256 TraceCheckUtils]: 37: Hoare triple {6805#(and (<= main_~v~0 2) (<= 100000 ~SIZE~0))} call #t~ret4 := elem_exists(~#set~0.base, ~#set~0.offset, ~n~0, #t~mem3); {6690#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:01:52,328 INFO L273 TraceCheckUtils]: 38: Hoare triple {6690#(<= 100000 ~SIZE~0)} ~set.base, ~set.offset := #in~set.base, #in~set.offset;~size := #in~size;~value := #in~value;havoc ~i~0;~i~0 := 0; {6690#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:01:52,328 INFO L273 TraceCheckUtils]: 39: Hoare triple {6690#(<= 100000 ~SIZE~0)} assume true; {6690#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:01:52,329 INFO L273 TraceCheckUtils]: 40: Hoare triple {6690#(<= 100000 ~SIZE~0)} assume !!(~i~0 < ~size);call #t~mem1 := read~int(~set.base, ~set.offset + 4 * ~i~0, 4); {6690#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:01:52,329 INFO L273 TraceCheckUtils]: 41: Hoare triple {6690#(<= 100000 ~SIZE~0)} assume #t~mem1 == ~value;havoc #t~mem1;#res := 1; {6690#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:01:52,330 INFO L273 TraceCheckUtils]: 42: Hoare triple {6690#(<= 100000 ~SIZE~0)} assume true; {6690#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:01:52,331 INFO L268 TraceCheckUtils]: 43: Hoare quadruple {6690#(<= 100000 ~SIZE~0)} {6805#(and (<= main_~v~0 2) (<= 100000 ~SIZE~0))} #132#return; {6805#(and (<= main_~v~0 2) (<= 100000 ~SIZE~0))} is VALID [2018-11-18 23:01:52,332 INFO L273 TraceCheckUtils]: 44: Hoare triple {6805#(and (<= main_~v~0 2) (<= 100000 ~SIZE~0))} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {6805#(and (<= main_~v~0 2) (<= 100000 ~SIZE~0))} is VALID [2018-11-18 23:01:52,333 INFO L273 TraceCheckUtils]: 45: Hoare triple {6805#(and (<= main_~v~0 2) (<= 100000 ~SIZE~0))} assume !(1 != #t~ret4);havoc #t~mem3;havoc #t~ret4; {6805#(and (<= main_~v~0 2) (<= 100000 ~SIZE~0))} is VALID [2018-11-18 23:01:52,334 INFO L273 TraceCheckUtils]: 46: Hoare triple {6805#(and (<= main_~v~0 2) (<= 100000 ~SIZE~0))} #t~post2 := ~v~0;~v~0 := 1 + #t~post2;havoc #t~post2; {6842#(and (<= main_~v~0 3) (<= 100000 ~SIZE~0))} is VALID [2018-11-18 23:01:52,334 INFO L273 TraceCheckUtils]: 47: Hoare triple {6842#(and (<= main_~v~0 3) (<= 100000 ~SIZE~0))} assume true; {6842#(and (<= main_~v~0 3) (<= 100000 ~SIZE~0))} is VALID [2018-11-18 23:01:52,335 INFO L273 TraceCheckUtils]: 48: Hoare triple {6842#(and (<= main_~v~0 3) (<= 100000 ~SIZE~0))} assume !!(~v~0 < ~SIZE~0);call #t~mem3 := read~int(~#values~0.base, ~#values~0.offset + 4 * ~v~0, 4); {6842#(and (<= main_~v~0 3) (<= 100000 ~SIZE~0))} is VALID [2018-11-18 23:01:52,336 INFO L256 TraceCheckUtils]: 49: Hoare triple {6842#(and (<= main_~v~0 3) (<= 100000 ~SIZE~0))} call #t~ret4 := elem_exists(~#set~0.base, ~#set~0.offset, ~n~0, #t~mem3); {6690#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:01:52,337 INFO L273 TraceCheckUtils]: 50: Hoare triple {6690#(<= 100000 ~SIZE~0)} ~set.base, ~set.offset := #in~set.base, #in~set.offset;~size := #in~size;~value := #in~value;havoc ~i~0;~i~0 := 0; {6690#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:01:52,337 INFO L273 TraceCheckUtils]: 51: Hoare triple {6690#(<= 100000 ~SIZE~0)} assume true; {6690#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:01:52,338 INFO L273 TraceCheckUtils]: 52: Hoare triple {6690#(<= 100000 ~SIZE~0)} assume !!(~i~0 < ~size);call #t~mem1 := read~int(~set.base, ~set.offset + 4 * ~i~0, 4); {6690#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:01:52,339 INFO L273 TraceCheckUtils]: 53: Hoare triple {6690#(<= 100000 ~SIZE~0)} assume #t~mem1 == ~value;havoc #t~mem1;#res := 1; {6690#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:01:52,339 INFO L273 TraceCheckUtils]: 54: Hoare triple {6690#(<= 100000 ~SIZE~0)} assume true; {6690#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:01:52,340 INFO L268 TraceCheckUtils]: 55: Hoare quadruple {6690#(<= 100000 ~SIZE~0)} {6842#(and (<= main_~v~0 3) (<= 100000 ~SIZE~0))} #132#return; {6842#(and (<= main_~v~0 3) (<= 100000 ~SIZE~0))} is VALID [2018-11-18 23:01:52,341 INFO L273 TraceCheckUtils]: 56: Hoare triple {6842#(and (<= main_~v~0 3) (<= 100000 ~SIZE~0))} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {6842#(and (<= main_~v~0 3) (<= 100000 ~SIZE~0))} is VALID [2018-11-18 23:01:52,342 INFO L273 TraceCheckUtils]: 57: Hoare triple {6842#(and (<= main_~v~0 3) (<= 100000 ~SIZE~0))} assume !(1 != #t~ret4);havoc #t~mem3;havoc #t~ret4; {6842#(and (<= main_~v~0 3) (<= 100000 ~SIZE~0))} is VALID [2018-11-18 23:01:52,343 INFO L273 TraceCheckUtils]: 58: Hoare triple {6842#(and (<= main_~v~0 3) (<= 100000 ~SIZE~0))} #t~post2 := ~v~0;~v~0 := 1 + #t~post2;havoc #t~post2; {6879#(and (<= main_~v~0 4) (<= 100000 ~SIZE~0))} is VALID [2018-11-18 23:01:52,343 INFO L273 TraceCheckUtils]: 59: Hoare triple {6879#(and (<= main_~v~0 4) (<= 100000 ~SIZE~0))} assume true; {6879#(and (<= main_~v~0 4) (<= 100000 ~SIZE~0))} is VALID [2018-11-18 23:01:52,344 INFO L273 TraceCheckUtils]: 60: Hoare triple {6879#(and (<= main_~v~0 4) (<= 100000 ~SIZE~0))} assume !!(~v~0 < ~SIZE~0);call #t~mem3 := read~int(~#values~0.base, ~#values~0.offset + 4 * ~v~0, 4); {6879#(and (<= main_~v~0 4) (<= 100000 ~SIZE~0))} is VALID [2018-11-18 23:01:52,345 INFO L256 TraceCheckUtils]: 61: Hoare triple {6879#(and (<= main_~v~0 4) (<= 100000 ~SIZE~0))} call #t~ret4 := elem_exists(~#set~0.base, ~#set~0.offset, ~n~0, #t~mem3); {6690#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:01:52,346 INFO L273 TraceCheckUtils]: 62: Hoare triple {6690#(<= 100000 ~SIZE~0)} ~set.base, ~set.offset := #in~set.base, #in~set.offset;~size := #in~size;~value := #in~value;havoc ~i~0;~i~0 := 0; {6690#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:01:52,353 INFO L273 TraceCheckUtils]: 63: Hoare triple {6690#(<= 100000 ~SIZE~0)} assume true; {6690#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:01:52,353 INFO L273 TraceCheckUtils]: 64: Hoare triple {6690#(<= 100000 ~SIZE~0)} assume !!(~i~0 < ~size);call #t~mem1 := read~int(~set.base, ~set.offset + 4 * ~i~0, 4); {6690#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:01:52,354 INFO L273 TraceCheckUtils]: 65: Hoare triple {6690#(<= 100000 ~SIZE~0)} assume #t~mem1 == ~value;havoc #t~mem1;#res := 1; {6690#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:01:52,354 INFO L273 TraceCheckUtils]: 66: Hoare triple {6690#(<= 100000 ~SIZE~0)} assume true; {6690#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:01:52,359 INFO L268 TraceCheckUtils]: 67: Hoare quadruple {6690#(<= 100000 ~SIZE~0)} {6879#(and (<= main_~v~0 4) (<= 100000 ~SIZE~0))} #132#return; {6879#(and (<= main_~v~0 4) (<= 100000 ~SIZE~0))} is VALID [2018-11-18 23:01:52,361 INFO L273 TraceCheckUtils]: 68: Hoare triple {6879#(and (<= main_~v~0 4) (<= 100000 ~SIZE~0))} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {6879#(and (<= main_~v~0 4) (<= 100000 ~SIZE~0))} is VALID [2018-11-18 23:01:52,361 INFO L273 TraceCheckUtils]: 69: Hoare triple {6879#(and (<= main_~v~0 4) (<= 100000 ~SIZE~0))} assume !(1 != #t~ret4);havoc #t~mem3;havoc #t~ret4; {6879#(and (<= main_~v~0 4) (<= 100000 ~SIZE~0))} is VALID [2018-11-18 23:01:52,363 INFO L273 TraceCheckUtils]: 70: Hoare triple {6879#(and (<= main_~v~0 4) (<= 100000 ~SIZE~0))} #t~post2 := ~v~0;~v~0 := 1 + #t~post2;havoc #t~post2; {6916#(and (<= main_~v~0 5) (<= 100000 ~SIZE~0))} is VALID [2018-11-18 23:01:52,363 INFO L273 TraceCheckUtils]: 71: Hoare triple {6916#(and (<= main_~v~0 5) (<= 100000 ~SIZE~0))} assume true; {6916#(and (<= main_~v~0 5) (<= 100000 ~SIZE~0))} is VALID [2018-11-18 23:01:52,365 INFO L273 TraceCheckUtils]: 72: Hoare triple {6916#(and (<= main_~v~0 5) (<= 100000 ~SIZE~0))} assume !!(~v~0 < ~SIZE~0);call #t~mem3 := read~int(~#values~0.base, ~#values~0.offset + 4 * ~v~0, 4); {6916#(and (<= main_~v~0 5) (<= 100000 ~SIZE~0))} is VALID [2018-11-18 23:01:52,366 INFO L256 TraceCheckUtils]: 73: Hoare triple {6916#(and (<= main_~v~0 5) (<= 100000 ~SIZE~0))} call #t~ret4 := elem_exists(~#set~0.base, ~#set~0.offset, ~n~0, #t~mem3); {6690#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:01:52,367 INFO L273 TraceCheckUtils]: 74: Hoare triple {6690#(<= 100000 ~SIZE~0)} ~set.base, ~set.offset := #in~set.base, #in~set.offset;~size := #in~size;~value := #in~value;havoc ~i~0;~i~0 := 0; {6690#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:01:52,368 INFO L273 TraceCheckUtils]: 75: Hoare triple {6690#(<= 100000 ~SIZE~0)} assume true; {6690#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:01:52,368 INFO L273 TraceCheckUtils]: 76: Hoare triple {6690#(<= 100000 ~SIZE~0)} assume !!(~i~0 < ~size);call #t~mem1 := read~int(~set.base, ~set.offset + 4 * ~i~0, 4); {6690#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:01:52,370 INFO L273 TraceCheckUtils]: 77: Hoare triple {6690#(<= 100000 ~SIZE~0)} assume #t~mem1 == ~value;havoc #t~mem1;#res := 1; {6690#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:01:52,370 INFO L273 TraceCheckUtils]: 78: Hoare triple {6690#(<= 100000 ~SIZE~0)} assume true; {6690#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:01:52,372 INFO L268 TraceCheckUtils]: 79: Hoare quadruple {6690#(<= 100000 ~SIZE~0)} {6916#(and (<= main_~v~0 5) (<= 100000 ~SIZE~0))} #132#return; {6916#(and (<= main_~v~0 5) (<= 100000 ~SIZE~0))} is VALID [2018-11-18 23:01:52,374 INFO L273 TraceCheckUtils]: 80: Hoare triple {6916#(and (<= main_~v~0 5) (<= 100000 ~SIZE~0))} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {6916#(and (<= main_~v~0 5) (<= 100000 ~SIZE~0))} is VALID [2018-11-18 23:01:52,376 INFO L273 TraceCheckUtils]: 81: Hoare triple {6916#(and (<= main_~v~0 5) (<= 100000 ~SIZE~0))} assume !(1 != #t~ret4);havoc #t~mem3;havoc #t~ret4; {6916#(and (<= main_~v~0 5) (<= 100000 ~SIZE~0))} is VALID [2018-11-18 23:01:52,376 INFO L273 TraceCheckUtils]: 82: Hoare triple {6916#(and (<= main_~v~0 5) (<= 100000 ~SIZE~0))} #t~post2 := ~v~0;~v~0 := 1 + #t~post2;havoc #t~post2; {6953#(and (<= main_~v~0 6) (<= 100000 ~SIZE~0))} is VALID [2018-11-18 23:01:52,377 INFO L273 TraceCheckUtils]: 83: Hoare triple {6953#(and (<= main_~v~0 6) (<= 100000 ~SIZE~0))} assume true; {6953#(and (<= main_~v~0 6) (<= 100000 ~SIZE~0))} is VALID [2018-11-18 23:01:52,378 INFO L273 TraceCheckUtils]: 84: Hoare triple {6953#(and (<= main_~v~0 6) (<= 100000 ~SIZE~0))} assume !(~v~0 < ~SIZE~0); {6689#false} is VALID [2018-11-18 23:01:52,378 INFO L273 TraceCheckUtils]: 85: Hoare triple {6689#false} ~i~1 := 0; {6689#false} is VALID [2018-11-18 23:01:52,378 INFO L273 TraceCheckUtils]: 86: Hoare triple {6689#false} assume true; {6689#false} is VALID [2018-11-18 23:01:52,378 INFO L273 TraceCheckUtils]: 87: Hoare triple {6689#false} assume !!(~i~1 < ~SIZE~0 && 1 != ~found~0);call #t~mem8 := read~int(~#set~0.base, ~#set~0.offset + 4 * ~i~1, 4); {6689#false} is VALID [2018-11-18 23:01:52,378 INFO L273 TraceCheckUtils]: 88: Hoare triple {6689#false} assume !(#t~mem8 == ~element~0);havoc #t~mem8; {6689#false} is VALID [2018-11-18 23:01:52,378 INFO L273 TraceCheckUtils]: 89: Hoare triple {6689#false} #t~post7 := ~i~1;~i~1 := 1 + #t~post7;havoc #t~post7; {6689#false} is VALID [2018-11-18 23:01:52,378 INFO L273 TraceCheckUtils]: 90: Hoare triple {6689#false} assume true; {6689#false} is VALID [2018-11-18 23:01:52,379 INFO L273 TraceCheckUtils]: 91: Hoare triple {6689#false} assume !!(~i~1 < ~SIZE~0 && 1 != ~found~0);call #t~mem8 := read~int(~#set~0.base, ~#set~0.offset + 4 * ~i~1, 4); {6689#false} is VALID [2018-11-18 23:01:52,379 INFO L273 TraceCheckUtils]: 92: Hoare triple {6689#false} assume #t~mem8 == ~element~0;havoc #t~mem8;~found~0 := 1;~pos~0 := ~i~1; {6689#false} is VALID [2018-11-18 23:01:52,379 INFO L273 TraceCheckUtils]: 93: Hoare triple {6689#false} #t~post7 := ~i~1;~i~1 := 1 + #t~post7;havoc #t~post7; {6689#false} is VALID [2018-11-18 23:01:52,379 INFO L273 TraceCheckUtils]: 94: Hoare triple {6689#false} assume true; {6689#false} is VALID [2018-11-18 23:01:52,379 INFO L273 TraceCheckUtils]: 95: Hoare triple {6689#false} assume !(~i~1 < ~SIZE~0 && 1 != ~found~0); {6689#false} is VALID [2018-11-18 23:01:52,380 INFO L273 TraceCheckUtils]: 96: Hoare triple {6689#false} assume 1 == ~found~0;~i~1 := ~pos~0; {6689#false} is VALID [2018-11-18 23:01:52,380 INFO L273 TraceCheckUtils]: 97: Hoare triple {6689#false} assume true; {6689#false} is VALID [2018-11-18 23:01:52,380 INFO L273 TraceCheckUtils]: 98: Hoare triple {6689#false} assume !!(~i~1 < ~SIZE~0 - 1);call #t~mem10 := read~int(~#set~0.base, ~#set~0.offset + 4 * (1 + ~i~1), 4);call write~int(#t~mem10, ~#set~0.base, ~#set~0.offset + 4 * ~i~1, 4);havoc #t~mem10; {6689#false} is VALID [2018-11-18 23:01:52,380 INFO L273 TraceCheckUtils]: 99: Hoare triple {6689#false} #t~post9 := ~i~1;~i~1 := 1 + #t~post9;havoc #t~post9; {6689#false} is VALID [2018-11-18 23:01:52,380 INFO L273 TraceCheckUtils]: 100: Hoare triple {6689#false} assume true; {6689#false} is VALID [2018-11-18 23:01:52,380 INFO L273 TraceCheckUtils]: 101: Hoare triple {6689#false} assume !(~i~1 < ~SIZE~0 - 1); {6689#false} is VALID [2018-11-18 23:01:52,380 INFO L273 TraceCheckUtils]: 102: Hoare triple {6689#false} assume 1 == ~found~0;~i~1 := 0; {6689#false} is VALID [2018-11-18 23:01:52,380 INFO L273 TraceCheckUtils]: 103: Hoare triple {6689#false} assume true; {6689#false} is VALID [2018-11-18 23:01:52,381 INFO L273 TraceCheckUtils]: 104: Hoare triple {6689#false} assume !!(~i~1 < ~SIZE~0 - 1);call #t~mem12 := read~int(~#set~0.base, ~#set~0.offset + 4 * ~i~1, 4); {6689#false} is VALID [2018-11-18 23:01:52,381 INFO L256 TraceCheckUtils]: 105: Hoare triple {6689#false} call __VERIFIER_assert((if #t~mem12 != ~element~0 then 1 else 0)); {6689#false} is VALID [2018-11-18 23:01:52,381 INFO L273 TraceCheckUtils]: 106: Hoare triple {6689#false} ~cond := #in~cond; {6689#false} is VALID [2018-11-18 23:01:52,381 INFO L273 TraceCheckUtils]: 107: Hoare triple {6689#false} assume 0 == ~cond; {6689#false} is VALID [2018-11-18 23:01:52,381 INFO L273 TraceCheckUtils]: 108: Hoare triple {6689#false} assume !false; {6689#false} is VALID [2018-11-18 23:01:52,391 INFO L134 CoverageAnalysis]: Checked inductivity of 197 backedges. 0 proven. 102 refuted. 0 times theorem prover too weak. 95 trivial. 0 not checked. [2018-11-18 23:01:52,411 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-18 23:01:52,411 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 17 [2018-11-18 23:01:52,412 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 109 [2018-11-18 23:01:52,412 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-18 23:01:52,412 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 17 states. [2018-11-18 23:01:52,593 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 138 edges. 138 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 23:01:52,593 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-11-18 23:01:52,593 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-11-18 23:01:52,594 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=115, Invalid=157, Unknown=0, NotChecked=0, Total=272 [2018-11-18 23:01:52,594 INFO L87 Difference]: Start difference. First operand 131 states and 162 transitions. Second operand 17 states. [2018-11-18 23:01:54,131 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 23:01:54,132 INFO L93 Difference]: Finished difference Result 196 states and 242 transitions. [2018-11-18 23:01:54,132 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-11-18 23:01:54,132 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 109 [2018-11-18 23:01:54,132 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 23:01:54,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-11-18 23:01:54,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 154 transitions. [2018-11-18 23:01:54,135 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-11-18 23:01:54,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 154 transitions. [2018-11-18 23:01:54,137 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states and 154 transitions. [2018-11-18 23:01:55,424 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 154 edges. 154 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 23:01:55,428 INFO L225 Difference]: With dead ends: 196 [2018-11-18 23:01:55,429 INFO L226 Difference]: Without dead ends: 149 [2018-11-18 23:01:55,429 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 103 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 81 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=115, Invalid=157, Unknown=0, NotChecked=0, Total=272 [2018-11-18 23:01:55,429 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149 states. [2018-11-18 23:01:55,579 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149 to 141. [2018-11-18 23:01:55,580 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-18 23:01:55,580 INFO L82 GeneralOperation]: Start isEquivalent. First operand 149 states. Second operand 141 states. [2018-11-18 23:01:55,580 INFO L74 IsIncluded]: Start isIncluded. First operand 149 states. Second operand 141 states. [2018-11-18 23:01:55,580 INFO L87 Difference]: Start difference. First operand 149 states. Second operand 141 states. [2018-11-18 23:01:55,585 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 23:01:55,586 INFO L93 Difference]: Finished difference Result 149 states and 190 transitions. [2018-11-18 23:01:55,586 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 190 transitions. [2018-11-18 23:01:55,587 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 23:01:55,587 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 23:01:55,587 INFO L74 IsIncluded]: Start isIncluded. First operand 141 states. Second operand 149 states. [2018-11-18 23:01:55,587 INFO L87 Difference]: Start difference. First operand 141 states. Second operand 149 states. [2018-11-18 23:01:55,592 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 23:01:55,593 INFO L93 Difference]: Finished difference Result 149 states and 190 transitions. [2018-11-18 23:01:55,593 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 190 transitions. [2018-11-18 23:01:55,594 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 23:01:55,594 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 23:01:55,594 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-18 23:01:55,594 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-18 23:01:55,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 141 states. [2018-11-18 23:01:55,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 177 transitions. [2018-11-18 23:01:55,599 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 177 transitions. Word has length 109 [2018-11-18 23:01:55,599 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 23:01:55,599 INFO L480 AbstractCegarLoop]: Abstraction has 141 states and 177 transitions. [2018-11-18 23:01:55,599 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-11-18 23:01:55,599 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 177 transitions. [2018-11-18 23:01:55,601 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2018-11-18 23:01:55,601 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 23:01:55,601 INFO L375 BasicCegarLoop]: trace histogram [8, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 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, 1, 1, 1] [2018-11-18 23:01:55,602 INFO L423 AbstractCegarLoop]: === Iteration 13 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 23:01:55,602 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 23:01:55,602 INFO L82 PathProgramCache]: Analyzing trace with hash 789909830, now seen corresponding path program 2 times [2018-11-18 23:01:55,602 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 23:01:55,602 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 23:01:55,603 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 23:01:55,603 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 23:01:55,603 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 23:01:55,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 23:01:56,119 INFO L256 TraceCheckUtils]: 0: Hoare triple {7767#true} call ULTIMATE.init(); {7767#true} is VALID [2018-11-18 23:01:56,120 INFO L273 TraceCheckUtils]: 1: Hoare triple {7767#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~SIZE~0 := 100000; {7769#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:01:56,121 INFO L273 TraceCheckUtils]: 2: Hoare triple {7769#(<= 100000 ~SIZE~0)} assume true; {7769#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:01:56,122 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {7769#(<= 100000 ~SIZE~0)} {7767#true} #128#return; {7769#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:01:56,122 INFO L256 TraceCheckUtils]: 4: Hoare triple {7769#(<= 100000 ~SIZE~0)} call #t~ret13 := main(); {7769#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:01:56,123 INFO L273 TraceCheckUtils]: 5: Hoare triple {7769#(<= 100000 ~SIZE~0)} havoc ~i~1;havoc ~pos~0;~n~0 := 0;~found~0 := 0;call ~#set~0.base, ~#set~0.offset := #Ultimate.alloc(4 * ~SIZE~0);call ~#values~0.base, ~#values~0.offset := #Ultimate.alloc(4 * ~SIZE~0);havoc ~element~0;havoc ~v~0;~v~0 := 0; {7770#(and (= main_~v~0 0) (<= 100000 ~SIZE~0))} is VALID [2018-11-18 23:01:56,124 INFO L273 TraceCheckUtils]: 6: Hoare triple {7770#(and (= main_~v~0 0) (<= 100000 ~SIZE~0))} assume true; {7770#(and (= main_~v~0 0) (<= 100000 ~SIZE~0))} is VALID [2018-11-18 23:01:56,125 INFO L273 TraceCheckUtils]: 7: Hoare triple {7770#(and (= main_~v~0 0) (<= 100000 ~SIZE~0))} assume !!(~v~0 < ~SIZE~0);call #t~mem3 := read~int(~#values~0.base, ~#values~0.offset + 4 * ~v~0, 4); {7770#(and (= main_~v~0 0) (<= 100000 ~SIZE~0))} is VALID [2018-11-18 23:01:56,125 INFO L256 TraceCheckUtils]: 8: Hoare triple {7770#(and (= main_~v~0 0) (<= 100000 ~SIZE~0))} call #t~ret4 := elem_exists(~#set~0.base, ~#set~0.offset, ~n~0, #t~mem3); {7767#true} is VALID [2018-11-18 23:01:56,125 INFO L273 TraceCheckUtils]: 9: Hoare triple {7767#true} ~set.base, ~set.offset := #in~set.base, #in~set.offset;~size := #in~size;~value := #in~value;havoc ~i~0;~i~0 := 0; {7767#true} is VALID [2018-11-18 23:01:56,126 INFO L273 TraceCheckUtils]: 10: Hoare triple {7767#true} assume true; {7767#true} is VALID [2018-11-18 23:01:56,126 INFO L273 TraceCheckUtils]: 11: Hoare triple {7767#true} assume !(~i~0 < ~size); {7767#true} is VALID [2018-11-18 23:01:56,126 INFO L273 TraceCheckUtils]: 12: Hoare triple {7767#true} #res := 0; {7767#true} is VALID [2018-11-18 23:01:56,126 INFO L273 TraceCheckUtils]: 13: Hoare triple {7767#true} assume true; {7767#true} is VALID [2018-11-18 23:01:56,128 INFO L268 TraceCheckUtils]: 14: Hoare quadruple {7767#true} {7770#(and (= main_~v~0 0) (<= 100000 ~SIZE~0))} #132#return; {7770#(and (= main_~v~0 0) (<= 100000 ~SIZE~0))} is VALID [2018-11-18 23:01:56,128 INFO L273 TraceCheckUtils]: 15: Hoare triple {7770#(and (= main_~v~0 0) (<= 100000 ~SIZE~0))} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {7770#(and (= main_~v~0 0) (<= 100000 ~SIZE~0))} is VALID [2018-11-18 23:01:56,129 INFO L273 TraceCheckUtils]: 16: Hoare triple {7770#(and (= main_~v~0 0) (<= 100000 ~SIZE~0))} assume 1 != #t~ret4;havoc #t~mem3;havoc #t~ret4;call #t~mem5 := read~int(~#values~0.base, ~#values~0.offset + 4 * ~v~0, 4); {7770#(and (= main_~v~0 0) (<= 100000 ~SIZE~0))} is VALID [2018-11-18 23:01:56,129 INFO L256 TraceCheckUtils]: 17: Hoare triple {7770#(and (= main_~v~0 0) (<= 100000 ~SIZE~0))} call #t~ret6 := insert(~#set~0.base, ~#set~0.offset, ~n~0, #t~mem5); {7767#true} is VALID [2018-11-18 23:01:56,129 INFO L273 TraceCheckUtils]: 18: Hoare triple {7767#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; {7767#true} is VALID [2018-11-18 23:01:56,129 INFO L273 TraceCheckUtils]: 19: Hoare triple {7767#true} assume true; {7767#true} is VALID [2018-11-18 23:01:56,130 INFO L268 TraceCheckUtils]: 20: Hoare quadruple {7767#true} {7770#(and (= main_~v~0 0) (<= 100000 ~SIZE~0))} #134#return; {7770#(and (= main_~v~0 0) (<= 100000 ~SIZE~0))} is VALID [2018-11-18 23:01:56,131 INFO L273 TraceCheckUtils]: 21: Hoare triple {7770#(and (= main_~v~0 0) (<= 100000 ~SIZE~0))} assume -2147483648 <= #t~ret6 && #t~ret6 <= 2147483647;~n~0 := #t~ret6;havoc #t~ret6;havoc #t~mem5; {7770#(and (= main_~v~0 0) (<= 100000 ~SIZE~0))} is VALID [2018-11-18 23:01:56,131 INFO L273 TraceCheckUtils]: 22: Hoare triple {7770#(and (= main_~v~0 0) (<= 100000 ~SIZE~0))} #t~post2 := ~v~0;~v~0 := 1 + #t~post2;havoc #t~post2; {7771#(<= (+ main_~v~0 99999) ~SIZE~0)} is VALID [2018-11-18 23:01:56,132 INFO L273 TraceCheckUtils]: 23: Hoare triple {7771#(<= (+ main_~v~0 99999) ~SIZE~0)} assume true; {7771#(<= (+ main_~v~0 99999) ~SIZE~0)} is VALID [2018-11-18 23:01:56,133 INFO L273 TraceCheckUtils]: 24: Hoare triple {7771#(<= (+ main_~v~0 99999) ~SIZE~0)} assume !!(~v~0 < ~SIZE~0);call #t~mem3 := read~int(~#values~0.base, ~#values~0.offset + 4 * ~v~0, 4); {7771#(<= (+ main_~v~0 99999) ~SIZE~0)} is VALID [2018-11-18 23:01:56,133 INFO L256 TraceCheckUtils]: 25: Hoare triple {7771#(<= (+ main_~v~0 99999) ~SIZE~0)} call #t~ret4 := elem_exists(~#set~0.base, ~#set~0.offset, ~n~0, #t~mem3); {7767#true} is VALID [2018-11-18 23:01:56,133 INFO L273 TraceCheckUtils]: 26: Hoare triple {7767#true} ~set.base, ~set.offset := #in~set.base, #in~set.offset;~size := #in~size;~value := #in~value;havoc ~i~0;~i~0 := 0; {7767#true} is VALID [2018-11-18 23:01:56,133 INFO L273 TraceCheckUtils]: 27: Hoare triple {7767#true} assume true; {7767#true} is VALID [2018-11-18 23:01:56,134 INFO L273 TraceCheckUtils]: 28: Hoare triple {7767#true} assume !!(~i~0 < ~size);call #t~mem1 := read~int(~set.base, ~set.offset + 4 * ~i~0, 4); {7767#true} is VALID [2018-11-18 23:01:56,134 INFO L273 TraceCheckUtils]: 29: Hoare triple {7767#true} assume #t~mem1 == ~value;havoc #t~mem1;#res := 1; {7767#true} is VALID [2018-11-18 23:01:56,134 INFO L273 TraceCheckUtils]: 30: Hoare triple {7767#true} assume true; {7767#true} is VALID [2018-11-18 23:01:56,136 INFO L268 TraceCheckUtils]: 31: Hoare quadruple {7767#true} {7771#(<= (+ main_~v~0 99999) ~SIZE~0)} #132#return; {7771#(<= (+ main_~v~0 99999) ~SIZE~0)} is VALID [2018-11-18 23:01:56,136 INFO L273 TraceCheckUtils]: 32: Hoare triple {7771#(<= (+ main_~v~0 99999) ~SIZE~0)} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {7771#(<= (+ main_~v~0 99999) ~SIZE~0)} is VALID [2018-11-18 23:01:56,137 INFO L273 TraceCheckUtils]: 33: Hoare triple {7771#(<= (+ main_~v~0 99999) ~SIZE~0)} assume !(1 != #t~ret4);havoc #t~mem3;havoc #t~ret4; {7771#(<= (+ main_~v~0 99999) ~SIZE~0)} is VALID [2018-11-18 23:01:56,138 INFO L273 TraceCheckUtils]: 34: Hoare triple {7771#(<= (+ main_~v~0 99999) ~SIZE~0)} #t~post2 := ~v~0;~v~0 := 1 + #t~post2;havoc #t~post2; {7772#(<= (+ main_~v~0 99998) ~SIZE~0)} is VALID [2018-11-18 23:01:56,138 INFO L273 TraceCheckUtils]: 35: Hoare triple {7772#(<= (+ main_~v~0 99998) ~SIZE~0)} assume true; {7772#(<= (+ main_~v~0 99998) ~SIZE~0)} is VALID [2018-11-18 23:01:56,139 INFO L273 TraceCheckUtils]: 36: Hoare triple {7772#(<= (+ main_~v~0 99998) ~SIZE~0)} assume !!(~v~0 < ~SIZE~0);call #t~mem3 := read~int(~#values~0.base, ~#values~0.offset + 4 * ~v~0, 4); {7772#(<= (+ main_~v~0 99998) ~SIZE~0)} is VALID [2018-11-18 23:01:56,139 INFO L256 TraceCheckUtils]: 37: Hoare triple {7772#(<= (+ main_~v~0 99998) ~SIZE~0)} call #t~ret4 := elem_exists(~#set~0.base, ~#set~0.offset, ~n~0, #t~mem3); {7767#true} is VALID [2018-11-18 23:01:56,139 INFO L273 TraceCheckUtils]: 38: Hoare triple {7767#true} ~set.base, ~set.offset := #in~set.base, #in~set.offset;~size := #in~size;~value := #in~value;havoc ~i~0;~i~0 := 0; {7767#true} is VALID [2018-11-18 23:01:56,139 INFO L273 TraceCheckUtils]: 39: Hoare triple {7767#true} assume true; {7767#true} is VALID [2018-11-18 23:01:56,140 INFO L273 TraceCheckUtils]: 40: Hoare triple {7767#true} assume !!(~i~0 < ~size);call #t~mem1 := read~int(~set.base, ~set.offset + 4 * ~i~0, 4); {7767#true} is VALID [2018-11-18 23:01:56,140 INFO L273 TraceCheckUtils]: 41: Hoare triple {7767#true} assume #t~mem1 == ~value;havoc #t~mem1;#res := 1; {7767#true} is VALID [2018-11-18 23:01:56,140 INFO L273 TraceCheckUtils]: 42: Hoare triple {7767#true} assume true; {7767#true} is VALID [2018-11-18 23:01:56,142 INFO L268 TraceCheckUtils]: 43: Hoare quadruple {7767#true} {7772#(<= (+ main_~v~0 99998) ~SIZE~0)} #132#return; {7772#(<= (+ main_~v~0 99998) ~SIZE~0)} is VALID [2018-11-18 23:01:56,142 INFO L273 TraceCheckUtils]: 44: Hoare triple {7772#(<= (+ main_~v~0 99998) ~SIZE~0)} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {7772#(<= (+ main_~v~0 99998) ~SIZE~0)} is VALID [2018-11-18 23:01:56,143 INFO L273 TraceCheckUtils]: 45: Hoare triple {7772#(<= (+ main_~v~0 99998) ~SIZE~0)} assume !(1 != #t~ret4);havoc #t~mem3;havoc #t~ret4; {7772#(<= (+ main_~v~0 99998) ~SIZE~0)} is VALID [2018-11-18 23:01:56,144 INFO L273 TraceCheckUtils]: 46: Hoare triple {7772#(<= (+ main_~v~0 99998) ~SIZE~0)} #t~post2 := ~v~0;~v~0 := 1 + #t~post2;havoc #t~post2; {7773#(<= (+ main_~v~0 99997) ~SIZE~0)} is VALID [2018-11-18 23:01:56,144 INFO L273 TraceCheckUtils]: 47: Hoare triple {7773#(<= (+ main_~v~0 99997) ~SIZE~0)} assume true; {7773#(<= (+ main_~v~0 99997) ~SIZE~0)} is VALID [2018-11-18 23:01:56,145 INFO L273 TraceCheckUtils]: 48: Hoare triple {7773#(<= (+ main_~v~0 99997) ~SIZE~0)} assume !!(~v~0 < ~SIZE~0);call #t~mem3 := read~int(~#values~0.base, ~#values~0.offset + 4 * ~v~0, 4); {7773#(<= (+ main_~v~0 99997) ~SIZE~0)} is VALID [2018-11-18 23:01:56,145 INFO L256 TraceCheckUtils]: 49: Hoare triple {7773#(<= (+ main_~v~0 99997) ~SIZE~0)} call #t~ret4 := elem_exists(~#set~0.base, ~#set~0.offset, ~n~0, #t~mem3); {7767#true} is VALID [2018-11-18 23:01:56,145 INFO L273 TraceCheckUtils]: 50: Hoare triple {7767#true} ~set.base, ~set.offset := #in~set.base, #in~set.offset;~size := #in~size;~value := #in~value;havoc ~i~0;~i~0 := 0; {7767#true} is VALID [2018-11-18 23:01:56,145 INFO L273 TraceCheckUtils]: 51: Hoare triple {7767#true} assume true; {7767#true} is VALID [2018-11-18 23:01:56,146 INFO L273 TraceCheckUtils]: 52: Hoare triple {7767#true} assume !!(~i~0 < ~size);call #t~mem1 := read~int(~set.base, ~set.offset + 4 * ~i~0, 4); {7767#true} is VALID [2018-11-18 23:01:56,146 INFO L273 TraceCheckUtils]: 53: Hoare triple {7767#true} assume #t~mem1 == ~value;havoc #t~mem1;#res := 1; {7767#true} is VALID [2018-11-18 23:01:56,146 INFO L273 TraceCheckUtils]: 54: Hoare triple {7767#true} assume true; {7767#true} is VALID [2018-11-18 23:01:56,148 INFO L268 TraceCheckUtils]: 55: Hoare quadruple {7767#true} {7773#(<= (+ main_~v~0 99997) ~SIZE~0)} #132#return; {7773#(<= (+ main_~v~0 99997) ~SIZE~0)} is VALID [2018-11-18 23:01:56,148 INFO L273 TraceCheckUtils]: 56: Hoare triple {7773#(<= (+ main_~v~0 99997) ~SIZE~0)} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {7773#(<= (+ main_~v~0 99997) ~SIZE~0)} is VALID [2018-11-18 23:01:56,148 INFO L273 TraceCheckUtils]: 57: Hoare triple {7773#(<= (+ main_~v~0 99997) ~SIZE~0)} assume !(1 != #t~ret4);havoc #t~mem3;havoc #t~ret4; {7773#(<= (+ main_~v~0 99997) ~SIZE~0)} is VALID [2018-11-18 23:01:56,149 INFO L273 TraceCheckUtils]: 58: Hoare triple {7773#(<= (+ main_~v~0 99997) ~SIZE~0)} #t~post2 := ~v~0;~v~0 := 1 + #t~post2;havoc #t~post2; {7774#(<= (+ main_~v~0 99996) ~SIZE~0)} is VALID [2018-11-18 23:01:56,149 INFO L273 TraceCheckUtils]: 59: Hoare triple {7774#(<= (+ main_~v~0 99996) ~SIZE~0)} assume true; {7774#(<= (+ main_~v~0 99996) ~SIZE~0)} is VALID [2018-11-18 23:01:56,150 INFO L273 TraceCheckUtils]: 60: Hoare triple {7774#(<= (+ main_~v~0 99996) ~SIZE~0)} assume !!(~v~0 < ~SIZE~0);call #t~mem3 := read~int(~#values~0.base, ~#values~0.offset + 4 * ~v~0, 4); {7774#(<= (+ main_~v~0 99996) ~SIZE~0)} is VALID [2018-11-18 23:01:56,150 INFO L256 TraceCheckUtils]: 61: Hoare triple {7774#(<= (+ main_~v~0 99996) ~SIZE~0)} call #t~ret4 := elem_exists(~#set~0.base, ~#set~0.offset, ~n~0, #t~mem3); {7767#true} is VALID [2018-11-18 23:01:56,150 INFO L273 TraceCheckUtils]: 62: Hoare triple {7767#true} ~set.base, ~set.offset := #in~set.base, #in~set.offset;~size := #in~size;~value := #in~value;havoc ~i~0;~i~0 := 0; {7767#true} is VALID [2018-11-18 23:01:56,150 INFO L273 TraceCheckUtils]: 63: Hoare triple {7767#true} assume true; {7767#true} is VALID [2018-11-18 23:01:56,150 INFO L273 TraceCheckUtils]: 64: Hoare triple {7767#true} assume !!(~i~0 < ~size);call #t~mem1 := read~int(~set.base, ~set.offset + 4 * ~i~0, 4); {7767#true} is VALID [2018-11-18 23:01:56,151 INFO L273 TraceCheckUtils]: 65: Hoare triple {7767#true} assume #t~mem1 == ~value;havoc #t~mem1;#res := 1; {7767#true} is VALID [2018-11-18 23:01:56,151 INFO L273 TraceCheckUtils]: 66: Hoare triple {7767#true} assume true; {7767#true} is VALID [2018-11-18 23:01:56,152 INFO L268 TraceCheckUtils]: 67: Hoare quadruple {7767#true} {7774#(<= (+ main_~v~0 99996) ~SIZE~0)} #132#return; {7774#(<= (+ main_~v~0 99996) ~SIZE~0)} is VALID [2018-11-18 23:01:56,153 INFO L273 TraceCheckUtils]: 68: Hoare triple {7774#(<= (+ main_~v~0 99996) ~SIZE~0)} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {7774#(<= (+ main_~v~0 99996) ~SIZE~0)} is VALID [2018-11-18 23:01:56,153 INFO L273 TraceCheckUtils]: 69: Hoare triple {7774#(<= (+ main_~v~0 99996) ~SIZE~0)} assume !(1 != #t~ret4);havoc #t~mem3;havoc #t~ret4; {7774#(<= (+ main_~v~0 99996) ~SIZE~0)} is VALID [2018-11-18 23:01:56,154 INFO L273 TraceCheckUtils]: 70: Hoare triple {7774#(<= (+ main_~v~0 99996) ~SIZE~0)} #t~post2 := ~v~0;~v~0 := 1 + #t~post2;havoc #t~post2; {7775#(<= (+ main_~v~0 99995) ~SIZE~0)} is VALID [2018-11-18 23:01:56,154 INFO L273 TraceCheckUtils]: 71: Hoare triple {7775#(<= (+ main_~v~0 99995) ~SIZE~0)} assume true; {7775#(<= (+ main_~v~0 99995) ~SIZE~0)} is VALID [2018-11-18 23:01:56,155 INFO L273 TraceCheckUtils]: 72: Hoare triple {7775#(<= (+ main_~v~0 99995) ~SIZE~0)} assume !!(~v~0 < ~SIZE~0);call #t~mem3 := read~int(~#values~0.base, ~#values~0.offset + 4 * ~v~0, 4); {7775#(<= (+ main_~v~0 99995) ~SIZE~0)} is VALID [2018-11-18 23:01:56,155 INFO L256 TraceCheckUtils]: 73: Hoare triple {7775#(<= (+ main_~v~0 99995) ~SIZE~0)} call #t~ret4 := elem_exists(~#set~0.base, ~#set~0.offset, ~n~0, #t~mem3); {7767#true} is VALID [2018-11-18 23:01:56,155 INFO L273 TraceCheckUtils]: 74: Hoare triple {7767#true} ~set.base, ~set.offset := #in~set.base, #in~set.offset;~size := #in~size;~value := #in~value;havoc ~i~0;~i~0 := 0; {7767#true} is VALID [2018-11-18 23:01:56,155 INFO L273 TraceCheckUtils]: 75: Hoare triple {7767#true} assume true; {7767#true} is VALID [2018-11-18 23:01:56,155 INFO L273 TraceCheckUtils]: 76: Hoare triple {7767#true} assume !!(~i~0 < ~size);call #t~mem1 := read~int(~set.base, ~set.offset + 4 * ~i~0, 4); {7767#true} is VALID [2018-11-18 23:01:56,156 INFO L273 TraceCheckUtils]: 77: Hoare triple {7767#true} assume #t~mem1 == ~value;havoc #t~mem1;#res := 1; {7767#true} is VALID [2018-11-18 23:01:56,156 INFO L273 TraceCheckUtils]: 78: Hoare triple {7767#true} assume true; {7767#true} is VALID [2018-11-18 23:01:56,157 INFO L268 TraceCheckUtils]: 79: Hoare quadruple {7767#true} {7775#(<= (+ main_~v~0 99995) ~SIZE~0)} #132#return; {7775#(<= (+ main_~v~0 99995) ~SIZE~0)} is VALID [2018-11-18 23:01:56,158 INFO L273 TraceCheckUtils]: 80: Hoare triple {7775#(<= (+ main_~v~0 99995) ~SIZE~0)} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {7775#(<= (+ main_~v~0 99995) ~SIZE~0)} is VALID [2018-11-18 23:01:56,158 INFO L273 TraceCheckUtils]: 81: Hoare triple {7775#(<= (+ main_~v~0 99995) ~SIZE~0)} assume !(1 != #t~ret4);havoc #t~mem3;havoc #t~ret4; {7775#(<= (+ main_~v~0 99995) ~SIZE~0)} is VALID [2018-11-18 23:01:56,158 INFO L273 TraceCheckUtils]: 82: Hoare triple {7775#(<= (+ main_~v~0 99995) ~SIZE~0)} #t~post2 := ~v~0;~v~0 := 1 + #t~post2;havoc #t~post2; {7776#(<= (+ main_~v~0 99994) ~SIZE~0)} is VALID [2018-11-18 23:01:56,159 INFO L273 TraceCheckUtils]: 83: Hoare triple {7776#(<= (+ main_~v~0 99994) ~SIZE~0)} assume true; {7776#(<= (+ main_~v~0 99994) ~SIZE~0)} is VALID [2018-11-18 23:01:56,159 INFO L273 TraceCheckUtils]: 84: Hoare triple {7776#(<= (+ main_~v~0 99994) ~SIZE~0)} assume !!(~v~0 < ~SIZE~0);call #t~mem3 := read~int(~#values~0.base, ~#values~0.offset + 4 * ~v~0, 4); {7776#(<= (+ main_~v~0 99994) ~SIZE~0)} is VALID [2018-11-18 23:01:56,159 INFO L256 TraceCheckUtils]: 85: Hoare triple {7776#(<= (+ main_~v~0 99994) ~SIZE~0)} call #t~ret4 := elem_exists(~#set~0.base, ~#set~0.offset, ~n~0, #t~mem3); {7767#true} is VALID [2018-11-18 23:01:56,159 INFO L273 TraceCheckUtils]: 86: Hoare triple {7767#true} ~set.base, ~set.offset := #in~set.base, #in~set.offset;~size := #in~size;~value := #in~value;havoc ~i~0;~i~0 := 0; {7767#true} is VALID [2018-11-18 23:01:56,159 INFO L273 TraceCheckUtils]: 87: Hoare triple {7767#true} assume true; {7767#true} is VALID [2018-11-18 23:01:56,160 INFO L273 TraceCheckUtils]: 88: Hoare triple {7767#true} assume !!(~i~0 < ~size);call #t~mem1 := read~int(~set.base, ~set.offset + 4 * ~i~0, 4); {7767#true} is VALID [2018-11-18 23:01:56,160 INFO L273 TraceCheckUtils]: 89: Hoare triple {7767#true} assume #t~mem1 == ~value;havoc #t~mem1;#res := 1; {7767#true} is VALID [2018-11-18 23:01:56,160 INFO L273 TraceCheckUtils]: 90: Hoare triple {7767#true} assume true; {7767#true} is VALID [2018-11-18 23:01:56,162 INFO L268 TraceCheckUtils]: 91: Hoare quadruple {7767#true} {7776#(<= (+ main_~v~0 99994) ~SIZE~0)} #132#return; {7776#(<= (+ main_~v~0 99994) ~SIZE~0)} is VALID [2018-11-18 23:01:56,163 INFO L273 TraceCheckUtils]: 92: Hoare triple {7776#(<= (+ main_~v~0 99994) ~SIZE~0)} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {7776#(<= (+ main_~v~0 99994) ~SIZE~0)} is VALID [2018-11-18 23:01:56,164 INFO L273 TraceCheckUtils]: 93: Hoare triple {7776#(<= (+ main_~v~0 99994) ~SIZE~0)} assume !(1 != #t~ret4);havoc #t~mem3;havoc #t~ret4; {7776#(<= (+ main_~v~0 99994) ~SIZE~0)} is VALID [2018-11-18 23:01:56,164 INFO L273 TraceCheckUtils]: 94: Hoare triple {7776#(<= (+ main_~v~0 99994) ~SIZE~0)} #t~post2 := ~v~0;~v~0 := 1 + #t~post2;havoc #t~post2; {7777#(<= (+ main_~v~0 99993) ~SIZE~0)} is VALID [2018-11-18 23:01:56,164 INFO L273 TraceCheckUtils]: 95: Hoare triple {7777#(<= (+ main_~v~0 99993) ~SIZE~0)} assume true; {7777#(<= (+ main_~v~0 99993) ~SIZE~0)} is VALID [2018-11-18 23:01:56,165 INFO L273 TraceCheckUtils]: 96: Hoare triple {7777#(<= (+ main_~v~0 99993) ~SIZE~0)} assume !(~v~0 < ~SIZE~0); {7768#false} is VALID [2018-11-18 23:01:56,165 INFO L273 TraceCheckUtils]: 97: Hoare triple {7768#false} ~i~1 := 0; {7768#false} is VALID [2018-11-18 23:01:56,165 INFO L273 TraceCheckUtils]: 98: Hoare triple {7768#false} assume true; {7768#false} is VALID [2018-11-18 23:01:56,165 INFO L273 TraceCheckUtils]: 99: Hoare triple {7768#false} assume !!(~i~1 < ~SIZE~0 && 1 != ~found~0);call #t~mem8 := read~int(~#set~0.base, ~#set~0.offset + 4 * ~i~1, 4); {7768#false} is VALID [2018-11-18 23:01:56,165 INFO L273 TraceCheckUtils]: 100: Hoare triple {7768#false} assume !(#t~mem8 == ~element~0);havoc #t~mem8; {7768#false} is VALID [2018-11-18 23:01:56,165 INFO L273 TraceCheckUtils]: 101: Hoare triple {7768#false} #t~post7 := ~i~1;~i~1 := 1 + #t~post7;havoc #t~post7; {7768#false} is VALID [2018-11-18 23:01:56,166 INFO L273 TraceCheckUtils]: 102: Hoare triple {7768#false} assume true; {7768#false} is VALID [2018-11-18 23:01:56,166 INFO L273 TraceCheckUtils]: 103: Hoare triple {7768#false} assume !!(~i~1 < ~SIZE~0 && 1 != ~found~0);call #t~mem8 := read~int(~#set~0.base, ~#set~0.offset + 4 * ~i~1, 4); {7768#false} is VALID [2018-11-18 23:01:56,166 INFO L273 TraceCheckUtils]: 104: Hoare triple {7768#false} assume #t~mem8 == ~element~0;havoc #t~mem8;~found~0 := 1;~pos~0 := ~i~1; {7768#false} is VALID [2018-11-18 23:01:56,166 INFO L273 TraceCheckUtils]: 105: Hoare triple {7768#false} #t~post7 := ~i~1;~i~1 := 1 + #t~post7;havoc #t~post7; {7768#false} is VALID [2018-11-18 23:01:56,166 INFO L273 TraceCheckUtils]: 106: Hoare triple {7768#false} assume true; {7768#false} is VALID [2018-11-18 23:01:56,166 INFO L273 TraceCheckUtils]: 107: Hoare triple {7768#false} assume !(~i~1 < ~SIZE~0 && 1 != ~found~0); {7768#false} is VALID [2018-11-18 23:01:56,166 INFO L273 TraceCheckUtils]: 108: Hoare triple {7768#false} assume 1 == ~found~0;~i~1 := ~pos~0; {7768#false} is VALID [2018-11-18 23:01:56,166 INFO L273 TraceCheckUtils]: 109: Hoare triple {7768#false} assume true; {7768#false} is VALID [2018-11-18 23:01:56,167 INFO L273 TraceCheckUtils]: 110: Hoare triple {7768#false} assume !!(~i~1 < ~SIZE~0 - 1);call #t~mem10 := read~int(~#set~0.base, ~#set~0.offset + 4 * (1 + ~i~1), 4);call write~int(#t~mem10, ~#set~0.base, ~#set~0.offset + 4 * ~i~1, 4);havoc #t~mem10; {7768#false} is VALID [2018-11-18 23:01:56,167 INFO L273 TraceCheckUtils]: 111: Hoare triple {7768#false} #t~post9 := ~i~1;~i~1 := 1 + #t~post9;havoc #t~post9; {7768#false} is VALID [2018-11-18 23:01:56,167 INFO L273 TraceCheckUtils]: 112: Hoare triple {7768#false} assume true; {7768#false} is VALID [2018-11-18 23:01:56,167 INFO L273 TraceCheckUtils]: 113: Hoare triple {7768#false} assume !(~i~1 < ~SIZE~0 - 1); {7768#false} is VALID [2018-11-18 23:01:56,167 INFO L273 TraceCheckUtils]: 114: Hoare triple {7768#false} assume 1 == ~found~0;~i~1 := 0; {7768#false} is VALID [2018-11-18 23:01:56,167 INFO L273 TraceCheckUtils]: 115: Hoare triple {7768#false} assume true; {7768#false} is VALID [2018-11-18 23:01:56,167 INFO L273 TraceCheckUtils]: 116: Hoare triple {7768#false} assume !!(~i~1 < ~SIZE~0 - 1);call #t~mem12 := read~int(~#set~0.base, ~#set~0.offset + 4 * ~i~1, 4); {7768#false} is VALID [2018-11-18 23:01:56,167 INFO L256 TraceCheckUtils]: 117: Hoare triple {7768#false} call __VERIFIER_assert((if #t~mem12 != ~element~0 then 1 else 0)); {7768#false} is VALID [2018-11-18 23:01:56,167 INFO L273 TraceCheckUtils]: 118: Hoare triple {7768#false} ~cond := #in~cond; {7768#false} is VALID [2018-11-18 23:01:56,168 INFO L273 TraceCheckUtils]: 119: Hoare triple {7768#false} assume 0 == ~cond; {7768#false} is VALID [2018-11-18 23:01:56,168 INFO L273 TraceCheckUtils]: 120: Hoare triple {7768#false} assume !false; {7768#false} is VALID [2018-11-18 23:01:56,177 INFO L134 CoverageAnalysis]: Checked inductivity of 270 backedges. 0 proven. 140 refuted. 0 times theorem prover too weak. 130 trivial. 0 not checked. [2018-11-18 23:01:56,177 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 23:01:56,177 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 23:01:56,186 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-18 23:01:56,246 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-18 23:01:56,246 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-18 23:01:56,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 23:01:56,274 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 23:01:56,603 INFO L256 TraceCheckUtils]: 0: Hoare triple {7767#true} call ULTIMATE.init(); {7767#true} is VALID [2018-11-18 23:01:56,604 INFO L273 TraceCheckUtils]: 1: Hoare triple {7767#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~SIZE~0 := 100000; {7769#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:01:56,604 INFO L273 TraceCheckUtils]: 2: Hoare triple {7769#(<= 100000 ~SIZE~0)} assume true; {7769#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:01:56,605 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {7769#(<= 100000 ~SIZE~0)} {7767#true} #128#return; {7769#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:01:56,606 INFO L256 TraceCheckUtils]: 4: Hoare triple {7769#(<= 100000 ~SIZE~0)} call #t~ret13 := main(); {7769#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:01:56,607 INFO L273 TraceCheckUtils]: 5: Hoare triple {7769#(<= 100000 ~SIZE~0)} havoc ~i~1;havoc ~pos~0;~n~0 := 0;~found~0 := 0;call ~#set~0.base, ~#set~0.offset := #Ultimate.alloc(4 * ~SIZE~0);call ~#values~0.base, ~#values~0.offset := #Ultimate.alloc(4 * ~SIZE~0);havoc ~element~0;havoc ~v~0;~v~0 := 0; {7796#(and (<= main_~v~0 0) (<= 100000 ~SIZE~0))} is VALID [2018-11-18 23:01:56,608 INFO L273 TraceCheckUtils]: 6: Hoare triple {7796#(and (<= main_~v~0 0) (<= 100000 ~SIZE~0))} assume true; {7796#(and (<= main_~v~0 0) (<= 100000 ~SIZE~0))} is VALID [2018-11-18 23:01:56,608 INFO L273 TraceCheckUtils]: 7: Hoare triple {7796#(and (<= main_~v~0 0) (<= 100000 ~SIZE~0))} assume !!(~v~0 < ~SIZE~0);call #t~mem3 := read~int(~#values~0.base, ~#values~0.offset + 4 * ~v~0, 4); {7796#(and (<= main_~v~0 0) (<= 100000 ~SIZE~0))} is VALID [2018-11-18 23:01:56,627 INFO L256 TraceCheckUtils]: 8: Hoare triple {7796#(and (<= main_~v~0 0) (<= 100000 ~SIZE~0))} call #t~ret4 := elem_exists(~#set~0.base, ~#set~0.offset, ~n~0, #t~mem3); {7769#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:01:56,636 INFO L273 TraceCheckUtils]: 9: Hoare triple {7769#(<= 100000 ~SIZE~0)} ~set.base, ~set.offset := #in~set.base, #in~set.offset;~size := #in~size;~value := #in~value;havoc ~i~0;~i~0 := 0; {7769#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:01:56,649 INFO L273 TraceCheckUtils]: 10: Hoare triple {7769#(<= 100000 ~SIZE~0)} assume true; {7769#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:01:56,658 INFO L273 TraceCheckUtils]: 11: Hoare triple {7769#(<= 100000 ~SIZE~0)} assume !(~i~0 < ~size); {7769#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:01:56,671 INFO L273 TraceCheckUtils]: 12: Hoare triple {7769#(<= 100000 ~SIZE~0)} #res := 0; {7769#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:01:56,680 INFO L273 TraceCheckUtils]: 13: Hoare triple {7769#(<= 100000 ~SIZE~0)} assume true; {7769#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:01:56,694 INFO L268 TraceCheckUtils]: 14: Hoare quadruple {7769#(<= 100000 ~SIZE~0)} {7796#(and (<= main_~v~0 0) (<= 100000 ~SIZE~0))} #132#return; {7796#(and (<= main_~v~0 0) (<= 100000 ~SIZE~0))} is VALID [2018-11-18 23:01:56,708 INFO L273 TraceCheckUtils]: 15: Hoare triple {7796#(and (<= main_~v~0 0) (<= 100000 ~SIZE~0))} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {7796#(and (<= main_~v~0 0) (<= 100000 ~SIZE~0))} is VALID [2018-11-18 23:01:56,726 INFO L273 TraceCheckUtils]: 16: Hoare triple {7796#(and (<= main_~v~0 0) (<= 100000 ~SIZE~0))} assume 1 != #t~ret4;havoc #t~mem3;havoc #t~ret4;call #t~mem5 := read~int(~#values~0.base, ~#values~0.offset + 4 * ~v~0, 4); {7796#(and (<= main_~v~0 0) (<= 100000 ~SIZE~0))} is VALID [2018-11-18 23:01:56,741 INFO L256 TraceCheckUtils]: 17: Hoare triple {7796#(and (<= main_~v~0 0) (<= 100000 ~SIZE~0))} call #t~ret6 := insert(~#set~0.base, ~#set~0.offset, ~n~0, #t~mem5); {7769#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:01:56,750 INFO L273 TraceCheckUtils]: 18: Hoare triple {7769#(<= 100000 ~SIZE~0)} ~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; {7769#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:01:56,763 INFO L273 TraceCheckUtils]: 19: Hoare triple {7769#(<= 100000 ~SIZE~0)} assume true; {7769#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:01:56,766 INFO L268 TraceCheckUtils]: 20: Hoare quadruple {7769#(<= 100000 ~SIZE~0)} {7796#(and (<= main_~v~0 0) (<= 100000 ~SIZE~0))} #134#return; {7796#(and (<= main_~v~0 0) (<= 100000 ~SIZE~0))} is VALID [2018-11-18 23:01:56,768 INFO L273 TraceCheckUtils]: 21: Hoare triple {7796#(and (<= main_~v~0 0) (<= 100000 ~SIZE~0))} assume -2147483648 <= #t~ret6 && #t~ret6 <= 2147483647;~n~0 := #t~ret6;havoc #t~ret6;havoc #t~mem5; {7796#(and (<= main_~v~0 0) (<= 100000 ~SIZE~0))} is VALID [2018-11-18 23:01:56,771 INFO L273 TraceCheckUtils]: 22: Hoare triple {7796#(and (<= main_~v~0 0) (<= 100000 ~SIZE~0))} #t~post2 := ~v~0;~v~0 := 1 + #t~post2;havoc #t~post2; {7848#(and (<= main_~v~0 1) (<= 100000 ~SIZE~0))} is VALID [2018-11-18 23:01:56,771 INFO L273 TraceCheckUtils]: 23: Hoare triple {7848#(and (<= main_~v~0 1) (<= 100000 ~SIZE~0))} assume true; {7848#(and (<= main_~v~0 1) (<= 100000 ~SIZE~0))} is VALID [2018-11-18 23:01:56,774 INFO L273 TraceCheckUtils]: 24: Hoare triple {7848#(and (<= main_~v~0 1) (<= 100000 ~SIZE~0))} assume !!(~v~0 < ~SIZE~0);call #t~mem3 := read~int(~#values~0.base, ~#values~0.offset + 4 * ~v~0, 4); {7848#(and (<= main_~v~0 1) (<= 100000 ~SIZE~0))} is VALID [2018-11-18 23:01:56,776 INFO L256 TraceCheckUtils]: 25: Hoare triple {7848#(and (<= main_~v~0 1) (<= 100000 ~SIZE~0))} call #t~ret4 := elem_exists(~#set~0.base, ~#set~0.offset, ~n~0, #t~mem3); {7769#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:01:56,778 INFO L273 TraceCheckUtils]: 26: Hoare triple {7769#(<= 100000 ~SIZE~0)} ~set.base, ~set.offset := #in~set.base, #in~set.offset;~size := #in~size;~value := #in~value;havoc ~i~0;~i~0 := 0; {7769#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:01:56,778 INFO L273 TraceCheckUtils]: 27: Hoare triple {7769#(<= 100000 ~SIZE~0)} assume true; {7769#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:01:56,779 INFO L273 TraceCheckUtils]: 28: Hoare triple {7769#(<= 100000 ~SIZE~0)} assume !!(~i~0 < ~size);call #t~mem1 := read~int(~set.base, ~set.offset + 4 * ~i~0, 4); {7769#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:01:56,779 INFO L273 TraceCheckUtils]: 29: Hoare triple {7769#(<= 100000 ~SIZE~0)} assume #t~mem1 == ~value;havoc #t~mem1;#res := 1; {7769#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:01:56,779 INFO L273 TraceCheckUtils]: 30: Hoare triple {7769#(<= 100000 ~SIZE~0)} assume true; {7769#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:01:56,781 INFO L268 TraceCheckUtils]: 31: Hoare quadruple {7769#(<= 100000 ~SIZE~0)} {7848#(and (<= main_~v~0 1) (<= 100000 ~SIZE~0))} #132#return; {7848#(and (<= main_~v~0 1) (<= 100000 ~SIZE~0))} is VALID [2018-11-18 23:01:56,781 INFO L273 TraceCheckUtils]: 32: Hoare triple {7848#(and (<= main_~v~0 1) (<= 100000 ~SIZE~0))} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {7848#(and (<= main_~v~0 1) (<= 100000 ~SIZE~0))} is VALID [2018-11-18 23:01:56,782 INFO L273 TraceCheckUtils]: 33: Hoare triple {7848#(and (<= main_~v~0 1) (<= 100000 ~SIZE~0))} assume !(1 != #t~ret4);havoc #t~mem3;havoc #t~ret4; {7848#(and (<= main_~v~0 1) (<= 100000 ~SIZE~0))} is VALID [2018-11-18 23:01:56,782 INFO L273 TraceCheckUtils]: 34: Hoare triple {7848#(and (<= main_~v~0 1) (<= 100000 ~SIZE~0))} #t~post2 := ~v~0;~v~0 := 1 + #t~post2;havoc #t~post2; {7885#(and (<= main_~v~0 2) (<= 100000 ~SIZE~0))} is VALID [2018-11-18 23:01:56,783 INFO L273 TraceCheckUtils]: 35: Hoare triple {7885#(and (<= main_~v~0 2) (<= 100000 ~SIZE~0))} assume true; {7885#(and (<= main_~v~0 2) (<= 100000 ~SIZE~0))} is VALID [2018-11-18 23:01:56,784 INFO L273 TraceCheckUtils]: 36: Hoare triple {7885#(and (<= main_~v~0 2) (<= 100000 ~SIZE~0))} assume !!(~v~0 < ~SIZE~0);call #t~mem3 := read~int(~#values~0.base, ~#values~0.offset + 4 * ~v~0, 4); {7885#(and (<= main_~v~0 2) (<= 100000 ~SIZE~0))} is VALID [2018-11-18 23:01:56,786 INFO L256 TraceCheckUtils]: 37: Hoare triple {7885#(and (<= main_~v~0 2) (<= 100000 ~SIZE~0))} call #t~ret4 := elem_exists(~#set~0.base, ~#set~0.offset, ~n~0, #t~mem3); {7769#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:01:56,786 INFO L273 TraceCheckUtils]: 38: Hoare triple {7769#(<= 100000 ~SIZE~0)} ~set.base, ~set.offset := #in~set.base, #in~set.offset;~size := #in~size;~value := #in~value;havoc ~i~0;~i~0 := 0; {7769#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:01:56,787 INFO L273 TraceCheckUtils]: 39: Hoare triple {7769#(<= 100000 ~SIZE~0)} assume true; {7769#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:01:56,787 INFO L273 TraceCheckUtils]: 40: Hoare triple {7769#(<= 100000 ~SIZE~0)} assume !!(~i~0 < ~size);call #t~mem1 := read~int(~set.base, ~set.offset + 4 * ~i~0, 4); {7769#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:01:56,788 INFO L273 TraceCheckUtils]: 41: Hoare triple {7769#(<= 100000 ~SIZE~0)} assume #t~mem1 == ~value;havoc #t~mem1;#res := 1; {7769#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:01:56,788 INFO L273 TraceCheckUtils]: 42: Hoare triple {7769#(<= 100000 ~SIZE~0)} assume true; {7769#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:01:56,790 INFO L268 TraceCheckUtils]: 43: Hoare quadruple {7769#(<= 100000 ~SIZE~0)} {7885#(and (<= main_~v~0 2) (<= 100000 ~SIZE~0))} #132#return; {7885#(and (<= main_~v~0 2) (<= 100000 ~SIZE~0))} is VALID [2018-11-18 23:01:56,791 INFO L273 TraceCheckUtils]: 44: Hoare triple {7885#(and (<= main_~v~0 2) (<= 100000 ~SIZE~0))} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {7885#(and (<= main_~v~0 2) (<= 100000 ~SIZE~0))} is VALID [2018-11-18 23:01:56,792 INFO L273 TraceCheckUtils]: 45: Hoare triple {7885#(and (<= main_~v~0 2) (<= 100000 ~SIZE~0))} assume !(1 != #t~ret4);havoc #t~mem3;havoc #t~ret4; {7885#(and (<= main_~v~0 2) (<= 100000 ~SIZE~0))} is VALID [2018-11-18 23:01:56,793 INFO L273 TraceCheckUtils]: 46: Hoare triple {7885#(and (<= main_~v~0 2) (<= 100000 ~SIZE~0))} #t~post2 := ~v~0;~v~0 := 1 + #t~post2;havoc #t~post2; {7922#(and (<= main_~v~0 3) (<= 100000 ~SIZE~0))} is VALID [2018-11-18 23:01:56,810 INFO L273 TraceCheckUtils]: 47: Hoare triple {7922#(and (<= main_~v~0 3) (<= 100000 ~SIZE~0))} assume true; {7922#(and (<= main_~v~0 3) (<= 100000 ~SIZE~0))} is VALID [2018-11-18 23:01:56,813 INFO L273 TraceCheckUtils]: 48: Hoare triple {7922#(and (<= main_~v~0 3) (<= 100000 ~SIZE~0))} assume !!(~v~0 < ~SIZE~0);call #t~mem3 := read~int(~#values~0.base, ~#values~0.offset + 4 * ~v~0, 4); {7922#(and (<= main_~v~0 3) (<= 100000 ~SIZE~0))} is VALID [2018-11-18 23:01:56,815 INFO L256 TraceCheckUtils]: 49: Hoare triple {7922#(and (<= main_~v~0 3) (<= 100000 ~SIZE~0))} call #t~ret4 := elem_exists(~#set~0.base, ~#set~0.offset, ~n~0, #t~mem3); {7769#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:01:56,815 INFO L273 TraceCheckUtils]: 50: Hoare triple {7769#(<= 100000 ~SIZE~0)} ~set.base, ~set.offset := #in~set.base, #in~set.offset;~size := #in~size;~value := #in~value;havoc ~i~0;~i~0 := 0; {7769#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:01:56,816 INFO L273 TraceCheckUtils]: 51: Hoare triple {7769#(<= 100000 ~SIZE~0)} assume true; {7769#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:01:56,816 INFO L273 TraceCheckUtils]: 52: Hoare triple {7769#(<= 100000 ~SIZE~0)} assume !!(~i~0 < ~size);call #t~mem1 := read~int(~set.base, ~set.offset + 4 * ~i~0, 4); {7769#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:01:56,816 INFO L273 TraceCheckUtils]: 53: Hoare triple {7769#(<= 100000 ~SIZE~0)} assume #t~mem1 == ~value;havoc #t~mem1;#res := 1; {7769#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:01:56,817 INFO L273 TraceCheckUtils]: 54: Hoare triple {7769#(<= 100000 ~SIZE~0)} assume true; {7769#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:01:56,818 INFO L268 TraceCheckUtils]: 55: Hoare quadruple {7769#(<= 100000 ~SIZE~0)} {7922#(and (<= main_~v~0 3) (<= 100000 ~SIZE~0))} #132#return; {7922#(and (<= main_~v~0 3) (<= 100000 ~SIZE~0))} is VALID [2018-11-18 23:01:56,819 INFO L273 TraceCheckUtils]: 56: Hoare triple {7922#(and (<= main_~v~0 3) (<= 100000 ~SIZE~0))} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {7922#(and (<= main_~v~0 3) (<= 100000 ~SIZE~0))} is VALID [2018-11-18 23:01:56,820 INFO L273 TraceCheckUtils]: 57: Hoare triple {7922#(and (<= main_~v~0 3) (<= 100000 ~SIZE~0))} assume !(1 != #t~ret4);havoc #t~mem3;havoc #t~ret4; {7922#(and (<= main_~v~0 3) (<= 100000 ~SIZE~0))} is VALID [2018-11-18 23:01:56,821 INFO L273 TraceCheckUtils]: 58: Hoare triple {7922#(and (<= main_~v~0 3) (<= 100000 ~SIZE~0))} #t~post2 := ~v~0;~v~0 := 1 + #t~post2;havoc #t~post2; {7959#(and (<= main_~v~0 4) (<= 100000 ~SIZE~0))} is VALID [2018-11-18 23:01:56,821 INFO L273 TraceCheckUtils]: 59: Hoare triple {7959#(and (<= main_~v~0 4) (<= 100000 ~SIZE~0))} assume true; {7959#(and (<= main_~v~0 4) (<= 100000 ~SIZE~0))} is VALID [2018-11-18 23:01:56,822 INFO L273 TraceCheckUtils]: 60: Hoare triple {7959#(and (<= main_~v~0 4) (<= 100000 ~SIZE~0))} assume !!(~v~0 < ~SIZE~0);call #t~mem3 := read~int(~#values~0.base, ~#values~0.offset + 4 * ~v~0, 4); {7959#(and (<= main_~v~0 4) (<= 100000 ~SIZE~0))} is VALID [2018-11-18 23:01:56,824 INFO L256 TraceCheckUtils]: 61: Hoare triple {7959#(and (<= main_~v~0 4) (<= 100000 ~SIZE~0))} call #t~ret4 := elem_exists(~#set~0.base, ~#set~0.offset, ~n~0, #t~mem3); {7769#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:01:56,825 INFO L273 TraceCheckUtils]: 62: Hoare triple {7769#(<= 100000 ~SIZE~0)} ~set.base, ~set.offset := #in~set.base, #in~set.offset;~size := #in~size;~value := #in~value;havoc ~i~0;~i~0 := 0; {7769#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:01:56,825 INFO L273 TraceCheckUtils]: 63: Hoare triple {7769#(<= 100000 ~SIZE~0)} assume true; {7769#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:01:56,826 INFO L273 TraceCheckUtils]: 64: Hoare triple {7769#(<= 100000 ~SIZE~0)} assume !!(~i~0 < ~size);call #t~mem1 := read~int(~set.base, ~set.offset + 4 * ~i~0, 4); {7769#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:01:56,826 INFO L273 TraceCheckUtils]: 65: Hoare triple {7769#(<= 100000 ~SIZE~0)} assume #t~mem1 == ~value;havoc #t~mem1;#res := 1; {7769#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:01:56,827 INFO L273 TraceCheckUtils]: 66: Hoare triple {7769#(<= 100000 ~SIZE~0)} assume true; {7769#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:01:56,828 INFO L268 TraceCheckUtils]: 67: Hoare quadruple {7769#(<= 100000 ~SIZE~0)} {7959#(and (<= main_~v~0 4) (<= 100000 ~SIZE~0))} #132#return; {7959#(and (<= main_~v~0 4) (<= 100000 ~SIZE~0))} is VALID [2018-11-18 23:01:56,829 INFO L273 TraceCheckUtils]: 68: Hoare triple {7959#(and (<= main_~v~0 4) (<= 100000 ~SIZE~0))} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {7959#(and (<= main_~v~0 4) (<= 100000 ~SIZE~0))} is VALID [2018-11-18 23:01:56,830 INFO L273 TraceCheckUtils]: 69: Hoare triple {7959#(and (<= main_~v~0 4) (<= 100000 ~SIZE~0))} assume !(1 != #t~ret4);havoc #t~mem3;havoc #t~ret4; {7959#(and (<= main_~v~0 4) (<= 100000 ~SIZE~0))} is VALID [2018-11-18 23:01:56,831 INFO L273 TraceCheckUtils]: 70: Hoare triple {7959#(and (<= main_~v~0 4) (<= 100000 ~SIZE~0))} #t~post2 := ~v~0;~v~0 := 1 + #t~post2;havoc #t~post2; {7996#(and (<= main_~v~0 5) (<= 100000 ~SIZE~0))} is VALID [2018-11-18 23:01:56,831 INFO L273 TraceCheckUtils]: 71: Hoare triple {7996#(and (<= main_~v~0 5) (<= 100000 ~SIZE~0))} assume true; {7996#(and (<= main_~v~0 5) (<= 100000 ~SIZE~0))} is VALID [2018-11-18 23:01:56,832 INFO L273 TraceCheckUtils]: 72: Hoare triple {7996#(and (<= main_~v~0 5) (<= 100000 ~SIZE~0))} assume !!(~v~0 < ~SIZE~0);call #t~mem3 := read~int(~#values~0.base, ~#values~0.offset + 4 * ~v~0, 4); {7996#(and (<= main_~v~0 5) (<= 100000 ~SIZE~0))} is VALID [2018-11-18 23:01:56,834 INFO L256 TraceCheckUtils]: 73: Hoare triple {7996#(and (<= main_~v~0 5) (<= 100000 ~SIZE~0))} call #t~ret4 := elem_exists(~#set~0.base, ~#set~0.offset, ~n~0, #t~mem3); {7769#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:01:56,834 INFO L273 TraceCheckUtils]: 74: Hoare triple {7769#(<= 100000 ~SIZE~0)} ~set.base, ~set.offset := #in~set.base, #in~set.offset;~size := #in~size;~value := #in~value;havoc ~i~0;~i~0 := 0; {7769#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:01:56,835 INFO L273 TraceCheckUtils]: 75: Hoare triple {7769#(<= 100000 ~SIZE~0)} assume true; {7769#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:01:56,836 INFO L273 TraceCheckUtils]: 76: Hoare triple {7769#(<= 100000 ~SIZE~0)} assume !!(~i~0 < ~size);call #t~mem1 := read~int(~set.base, ~set.offset + 4 * ~i~0, 4); {7769#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:01:56,836 INFO L273 TraceCheckUtils]: 77: Hoare triple {7769#(<= 100000 ~SIZE~0)} assume #t~mem1 == ~value;havoc #t~mem1;#res := 1; {7769#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:01:56,837 INFO L273 TraceCheckUtils]: 78: Hoare triple {7769#(<= 100000 ~SIZE~0)} assume true; {7769#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:01:56,838 INFO L268 TraceCheckUtils]: 79: Hoare quadruple {7769#(<= 100000 ~SIZE~0)} {7996#(and (<= main_~v~0 5) (<= 100000 ~SIZE~0))} #132#return; {7996#(and (<= main_~v~0 5) (<= 100000 ~SIZE~0))} is VALID [2018-11-18 23:01:56,839 INFO L273 TraceCheckUtils]: 80: Hoare triple {7996#(and (<= main_~v~0 5) (<= 100000 ~SIZE~0))} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {7996#(and (<= main_~v~0 5) (<= 100000 ~SIZE~0))} is VALID [2018-11-18 23:01:56,840 INFO L273 TraceCheckUtils]: 81: Hoare triple {7996#(and (<= main_~v~0 5) (<= 100000 ~SIZE~0))} assume !(1 != #t~ret4);havoc #t~mem3;havoc #t~ret4; {7996#(and (<= main_~v~0 5) (<= 100000 ~SIZE~0))} is VALID [2018-11-18 23:01:56,840 INFO L273 TraceCheckUtils]: 82: Hoare triple {7996#(and (<= main_~v~0 5) (<= 100000 ~SIZE~0))} #t~post2 := ~v~0;~v~0 := 1 + #t~post2;havoc #t~post2; {8033#(and (<= main_~v~0 6) (<= 100000 ~SIZE~0))} is VALID [2018-11-18 23:01:56,841 INFO L273 TraceCheckUtils]: 83: Hoare triple {8033#(and (<= main_~v~0 6) (<= 100000 ~SIZE~0))} assume true; {8033#(and (<= main_~v~0 6) (<= 100000 ~SIZE~0))} is VALID [2018-11-18 23:01:56,842 INFO L273 TraceCheckUtils]: 84: Hoare triple {8033#(and (<= main_~v~0 6) (<= 100000 ~SIZE~0))} assume !!(~v~0 < ~SIZE~0);call #t~mem3 := read~int(~#values~0.base, ~#values~0.offset + 4 * ~v~0, 4); {8033#(and (<= main_~v~0 6) (<= 100000 ~SIZE~0))} is VALID [2018-11-18 23:01:56,844 INFO L256 TraceCheckUtils]: 85: Hoare triple {8033#(and (<= main_~v~0 6) (<= 100000 ~SIZE~0))} call #t~ret4 := elem_exists(~#set~0.base, ~#set~0.offset, ~n~0, #t~mem3); {7769#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:01:56,844 INFO L273 TraceCheckUtils]: 86: Hoare triple {7769#(<= 100000 ~SIZE~0)} ~set.base, ~set.offset := #in~set.base, #in~set.offset;~size := #in~size;~value := #in~value;havoc ~i~0;~i~0 := 0; {7769#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:01:56,845 INFO L273 TraceCheckUtils]: 87: Hoare triple {7769#(<= 100000 ~SIZE~0)} assume true; {7769#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:01:56,845 INFO L273 TraceCheckUtils]: 88: Hoare triple {7769#(<= 100000 ~SIZE~0)} assume !!(~i~0 < ~size);call #t~mem1 := read~int(~set.base, ~set.offset + 4 * ~i~0, 4); {7769#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:01:56,846 INFO L273 TraceCheckUtils]: 89: Hoare triple {7769#(<= 100000 ~SIZE~0)} assume #t~mem1 == ~value;havoc #t~mem1;#res := 1; {7769#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:01:56,847 INFO L273 TraceCheckUtils]: 90: Hoare triple {7769#(<= 100000 ~SIZE~0)} assume true; {7769#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:01:56,848 INFO L268 TraceCheckUtils]: 91: Hoare quadruple {7769#(<= 100000 ~SIZE~0)} {8033#(and (<= main_~v~0 6) (<= 100000 ~SIZE~0))} #132#return; {8033#(and (<= main_~v~0 6) (<= 100000 ~SIZE~0))} is VALID [2018-11-18 23:01:56,849 INFO L273 TraceCheckUtils]: 92: Hoare triple {8033#(and (<= main_~v~0 6) (<= 100000 ~SIZE~0))} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {8033#(and (<= main_~v~0 6) (<= 100000 ~SIZE~0))} is VALID [2018-11-18 23:01:56,850 INFO L273 TraceCheckUtils]: 93: Hoare triple {8033#(and (<= main_~v~0 6) (<= 100000 ~SIZE~0))} assume !(1 != #t~ret4);havoc #t~mem3;havoc #t~ret4; {8033#(and (<= main_~v~0 6) (<= 100000 ~SIZE~0))} is VALID [2018-11-18 23:01:56,851 INFO L273 TraceCheckUtils]: 94: Hoare triple {8033#(and (<= main_~v~0 6) (<= 100000 ~SIZE~0))} #t~post2 := ~v~0;~v~0 := 1 + #t~post2;havoc #t~post2; {8070#(and (<= main_~v~0 7) (<= 100000 ~SIZE~0))} is VALID [2018-11-18 23:01:56,851 INFO L273 TraceCheckUtils]: 95: Hoare triple {8070#(and (<= main_~v~0 7) (<= 100000 ~SIZE~0))} assume true; {8070#(and (<= main_~v~0 7) (<= 100000 ~SIZE~0))} is VALID [2018-11-18 23:01:56,852 INFO L273 TraceCheckUtils]: 96: Hoare triple {8070#(and (<= main_~v~0 7) (<= 100000 ~SIZE~0))} assume !(~v~0 < ~SIZE~0); {7768#false} is VALID [2018-11-18 23:01:56,852 INFO L273 TraceCheckUtils]: 97: Hoare triple {7768#false} ~i~1 := 0; {7768#false} is VALID [2018-11-18 23:01:56,853 INFO L273 TraceCheckUtils]: 98: Hoare triple {7768#false} assume true; {7768#false} is VALID [2018-11-18 23:01:56,853 INFO L273 TraceCheckUtils]: 99: Hoare triple {7768#false} assume !!(~i~1 < ~SIZE~0 && 1 != ~found~0);call #t~mem8 := read~int(~#set~0.base, ~#set~0.offset + 4 * ~i~1, 4); {7768#false} is VALID [2018-11-18 23:01:56,853 INFO L273 TraceCheckUtils]: 100: Hoare triple {7768#false} assume !(#t~mem8 == ~element~0);havoc #t~mem8; {7768#false} is VALID [2018-11-18 23:01:56,853 INFO L273 TraceCheckUtils]: 101: Hoare triple {7768#false} #t~post7 := ~i~1;~i~1 := 1 + #t~post7;havoc #t~post7; {7768#false} is VALID [2018-11-18 23:01:56,853 INFO L273 TraceCheckUtils]: 102: Hoare triple {7768#false} assume true; {7768#false} is VALID [2018-11-18 23:01:56,854 INFO L273 TraceCheckUtils]: 103: Hoare triple {7768#false} assume !!(~i~1 < ~SIZE~0 && 1 != ~found~0);call #t~mem8 := read~int(~#set~0.base, ~#set~0.offset + 4 * ~i~1, 4); {7768#false} is VALID [2018-11-18 23:01:56,854 INFO L273 TraceCheckUtils]: 104: Hoare triple {7768#false} assume #t~mem8 == ~element~0;havoc #t~mem8;~found~0 := 1;~pos~0 := ~i~1; {7768#false} is VALID [2018-11-18 23:01:56,854 INFO L273 TraceCheckUtils]: 105: Hoare triple {7768#false} #t~post7 := ~i~1;~i~1 := 1 + #t~post7;havoc #t~post7; {7768#false} is VALID [2018-11-18 23:01:56,854 INFO L273 TraceCheckUtils]: 106: Hoare triple {7768#false} assume true; {7768#false} is VALID [2018-11-18 23:01:56,854 INFO L273 TraceCheckUtils]: 107: Hoare triple {7768#false} assume !(~i~1 < ~SIZE~0 && 1 != ~found~0); {7768#false} is VALID [2018-11-18 23:01:56,855 INFO L273 TraceCheckUtils]: 108: Hoare triple {7768#false} assume 1 == ~found~0;~i~1 := ~pos~0; {7768#false} is VALID [2018-11-18 23:01:56,855 INFO L273 TraceCheckUtils]: 109: Hoare triple {7768#false} assume true; {7768#false} is VALID [2018-11-18 23:01:56,855 INFO L273 TraceCheckUtils]: 110: Hoare triple {7768#false} assume !!(~i~1 < ~SIZE~0 - 1);call #t~mem10 := read~int(~#set~0.base, ~#set~0.offset + 4 * (1 + ~i~1), 4);call write~int(#t~mem10, ~#set~0.base, ~#set~0.offset + 4 * ~i~1, 4);havoc #t~mem10; {7768#false} is VALID [2018-11-18 23:01:56,855 INFO L273 TraceCheckUtils]: 111: Hoare triple {7768#false} #t~post9 := ~i~1;~i~1 := 1 + #t~post9;havoc #t~post9; {7768#false} is VALID [2018-11-18 23:01:56,855 INFO L273 TraceCheckUtils]: 112: Hoare triple {7768#false} assume true; {7768#false} is VALID [2018-11-18 23:01:56,855 INFO L273 TraceCheckUtils]: 113: Hoare triple {7768#false} assume !(~i~1 < ~SIZE~0 - 1); {7768#false} is VALID [2018-11-18 23:01:56,855 INFO L273 TraceCheckUtils]: 114: Hoare triple {7768#false} assume 1 == ~found~0;~i~1 := 0; {7768#false} is VALID [2018-11-18 23:01:56,856 INFO L273 TraceCheckUtils]: 115: Hoare triple {7768#false} assume true; {7768#false} is VALID [2018-11-18 23:01:56,856 INFO L273 TraceCheckUtils]: 116: Hoare triple {7768#false} assume !!(~i~1 < ~SIZE~0 - 1);call #t~mem12 := read~int(~#set~0.base, ~#set~0.offset + 4 * ~i~1, 4); {7768#false} is VALID [2018-11-18 23:01:56,856 INFO L256 TraceCheckUtils]: 117: Hoare triple {7768#false} call __VERIFIER_assert((if #t~mem12 != ~element~0 then 1 else 0)); {7768#false} is VALID [2018-11-18 23:01:56,856 INFO L273 TraceCheckUtils]: 118: Hoare triple {7768#false} ~cond := #in~cond; {7768#false} is VALID [2018-11-18 23:01:56,856 INFO L273 TraceCheckUtils]: 119: Hoare triple {7768#false} assume 0 == ~cond; {7768#false} is VALID [2018-11-18 23:01:56,856 INFO L273 TraceCheckUtils]: 120: Hoare triple {7768#false} assume !false; {7768#false} is VALID [2018-11-18 23:01:56,869 INFO L134 CoverageAnalysis]: Checked inductivity of 270 backedges. 0 proven. 140 refuted. 0 times theorem prover too weak. 130 trivial. 0 not checked. [2018-11-18 23:01:56,888 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-18 23:01:56,888 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 19 [2018-11-18 23:01:56,889 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 121 [2018-11-18 23:01:56,889 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-18 23:01:56,889 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 19 states. [2018-11-18 23:01:57,042 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 152 edges. 152 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 23:01:57,042 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-11-18 23:01:57,043 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-11-18 23:01:57,043 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=143, Invalid=199, Unknown=0, NotChecked=0, Total=342 [2018-11-18 23:01:57,044 INFO L87 Difference]: Start difference. First operand 141 states and 177 transitions. Second operand 19 states. [2018-11-18 23:01:59,407 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 23:01:59,408 INFO L93 Difference]: Finished difference Result 206 states and 257 transitions. [2018-11-18 23:01:59,408 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-18 23:01:59,408 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 121 [2018-11-18 23:01:59,408 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 23:01:59,408 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2018-11-18 23:01:59,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 165 transitions. [2018-11-18 23:01:59,411 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2018-11-18 23:01:59,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 165 transitions. [2018-11-18 23:01:59,414 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states and 165 transitions. [2018-11-18 23:02:00,167 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 165 edges. 165 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 23:02:00,173 INFO L225 Difference]: With dead ends: 206 [2018-11-18 23:02:00,173 INFO L226 Difference]: Without dead ends: 159 [2018-11-18 23:02:00,174 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 131 GetRequests, 114 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 109 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=143, Invalid=199, Unknown=0, NotChecked=0, Total=342 [2018-11-18 23:02:00,174 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2018-11-18 23:02:00,382 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 151. [2018-11-18 23:02:00,382 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-18 23:02:00,382 INFO L82 GeneralOperation]: Start isEquivalent. First operand 159 states. Second operand 151 states. [2018-11-18 23:02:00,383 INFO L74 IsIncluded]: Start isIncluded. First operand 159 states. Second operand 151 states. [2018-11-18 23:02:00,383 INFO L87 Difference]: Start difference. First operand 159 states. Second operand 151 states. [2018-11-18 23:02:00,389 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 23:02:00,389 INFO L93 Difference]: Finished difference Result 159 states and 205 transitions. [2018-11-18 23:02:00,389 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 205 transitions. [2018-11-18 23:02:00,390 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 23:02:00,391 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 23:02:00,391 INFO L74 IsIncluded]: Start isIncluded. First operand 151 states. Second operand 159 states. [2018-11-18 23:02:00,391 INFO L87 Difference]: Start difference. First operand 151 states. Second operand 159 states. [2018-11-18 23:02:00,396 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 23:02:00,396 INFO L93 Difference]: Finished difference Result 159 states and 205 transitions. [2018-11-18 23:02:00,397 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 205 transitions. [2018-11-18 23:02:00,397 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 23:02:00,398 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 23:02:00,398 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-18 23:02:00,398 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-18 23:02:00,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 151 states. [2018-11-18 23:02:00,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 192 transitions. [2018-11-18 23:02:00,403 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 192 transitions. Word has length 121 [2018-11-18 23:02:00,403 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 23:02:00,403 INFO L480 AbstractCegarLoop]: Abstraction has 151 states and 192 transitions. [2018-11-18 23:02:00,403 INFO L481 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-11-18 23:02:00,404 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 192 transitions. [2018-11-18 23:02:00,405 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2018-11-18 23:02:00,405 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 23:02:00,406 INFO L375 BasicCegarLoop]: trace histogram [9, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 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, 1, 1, 1] [2018-11-18 23:02:00,406 INFO L423 AbstractCegarLoop]: === Iteration 14 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 23:02:00,406 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 23:02:00,406 INFO L82 PathProgramCache]: Analyzing trace with hash 325425882, now seen corresponding path program 3 times [2018-11-18 23:02:00,406 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 23:02:00,407 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 23:02:00,407 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 23:02:00,407 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 23:02:00,408 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 23:02:00,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 23:02:02,752 INFO L256 TraceCheckUtils]: 0: Hoare triple {8930#true} call ULTIMATE.init(); {8930#true} is VALID [2018-11-18 23:02:02,752 INFO L273 TraceCheckUtils]: 1: Hoare triple {8930#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~SIZE~0 := 100000; {8932#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:02:02,754 INFO L273 TraceCheckUtils]: 2: Hoare triple {8932#(<= 100000 ~SIZE~0)} assume true; {8932#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:02:02,754 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {8932#(<= 100000 ~SIZE~0)} {8930#true} #128#return; {8932#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:02:02,754 INFO L256 TraceCheckUtils]: 4: Hoare triple {8932#(<= 100000 ~SIZE~0)} call #t~ret13 := main(); {8932#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:02:02,755 INFO L273 TraceCheckUtils]: 5: Hoare triple {8932#(<= 100000 ~SIZE~0)} havoc ~i~1;havoc ~pos~0;~n~0 := 0;~found~0 := 0;call ~#set~0.base, ~#set~0.offset := #Ultimate.alloc(4 * ~SIZE~0);call ~#values~0.base, ~#values~0.offset := #Ultimate.alloc(4 * ~SIZE~0);havoc ~element~0;havoc ~v~0;~v~0 := 0; {8933#(and (= main_~v~0 0) (<= 100000 ~SIZE~0))} is VALID [2018-11-18 23:02:02,756 INFO L273 TraceCheckUtils]: 6: Hoare triple {8933#(and (= main_~v~0 0) (<= 100000 ~SIZE~0))} assume true; {8933#(and (= main_~v~0 0) (<= 100000 ~SIZE~0))} is VALID [2018-11-18 23:02:02,756 INFO L273 TraceCheckUtils]: 7: Hoare triple {8933#(and (= main_~v~0 0) (<= 100000 ~SIZE~0))} assume !!(~v~0 < ~SIZE~0);call #t~mem3 := read~int(~#values~0.base, ~#values~0.offset + 4 * ~v~0, 4); {8933#(and (= main_~v~0 0) (<= 100000 ~SIZE~0))} is VALID [2018-11-18 23:02:02,757 INFO L256 TraceCheckUtils]: 8: Hoare triple {8933#(and (= main_~v~0 0) (<= 100000 ~SIZE~0))} call #t~ret4 := elem_exists(~#set~0.base, ~#set~0.offset, ~n~0, #t~mem3); {8930#true} is VALID [2018-11-18 23:02:02,757 INFO L273 TraceCheckUtils]: 9: Hoare triple {8930#true} ~set.base, ~set.offset := #in~set.base, #in~set.offset;~size := #in~size;~value := #in~value;havoc ~i~0;~i~0 := 0; {8930#true} is VALID [2018-11-18 23:02:02,757 INFO L273 TraceCheckUtils]: 10: Hoare triple {8930#true} assume true; {8930#true} is VALID [2018-11-18 23:02:02,757 INFO L273 TraceCheckUtils]: 11: Hoare triple {8930#true} assume !(~i~0 < ~size); {8930#true} is VALID [2018-11-18 23:02:02,758 INFO L273 TraceCheckUtils]: 12: Hoare triple {8930#true} #res := 0; {8930#true} is VALID [2018-11-18 23:02:02,758 INFO L273 TraceCheckUtils]: 13: Hoare triple {8930#true} assume true; {8930#true} is VALID [2018-11-18 23:02:02,759 INFO L268 TraceCheckUtils]: 14: Hoare quadruple {8930#true} {8933#(and (= main_~v~0 0) (<= 100000 ~SIZE~0))} #132#return; {8933#(and (= main_~v~0 0) (<= 100000 ~SIZE~0))} is VALID [2018-11-18 23:02:02,763 INFO L273 TraceCheckUtils]: 15: Hoare triple {8933#(and (= main_~v~0 0) (<= 100000 ~SIZE~0))} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {8933#(and (= main_~v~0 0) (<= 100000 ~SIZE~0))} is VALID [2018-11-18 23:02:02,763 INFO L273 TraceCheckUtils]: 16: Hoare triple {8933#(and (= main_~v~0 0) (<= 100000 ~SIZE~0))} assume 1 != #t~ret4;havoc #t~mem3;havoc #t~ret4;call #t~mem5 := read~int(~#values~0.base, ~#values~0.offset + 4 * ~v~0, 4); {8933#(and (= main_~v~0 0) (<= 100000 ~SIZE~0))} is VALID [2018-11-18 23:02:02,763 INFO L256 TraceCheckUtils]: 17: Hoare triple {8933#(and (= main_~v~0 0) (<= 100000 ~SIZE~0))} call #t~ret6 := insert(~#set~0.base, ~#set~0.offset, ~n~0, #t~mem5); {8930#true} is VALID [2018-11-18 23:02:02,764 INFO L273 TraceCheckUtils]: 18: Hoare triple {8930#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; {8930#true} is VALID [2018-11-18 23:02:02,764 INFO L273 TraceCheckUtils]: 19: Hoare triple {8930#true} assume true; {8930#true} is VALID [2018-11-18 23:02:02,765 INFO L268 TraceCheckUtils]: 20: Hoare quadruple {8930#true} {8933#(and (= main_~v~0 0) (<= 100000 ~SIZE~0))} #134#return; {8933#(and (= main_~v~0 0) (<= 100000 ~SIZE~0))} is VALID [2018-11-18 23:02:02,767 INFO L273 TraceCheckUtils]: 21: Hoare triple {8933#(and (= main_~v~0 0) (<= 100000 ~SIZE~0))} assume -2147483648 <= #t~ret6 && #t~ret6 <= 2147483647;~n~0 := #t~ret6;havoc #t~ret6;havoc #t~mem5; {8933#(and (= main_~v~0 0) (<= 100000 ~SIZE~0))} is VALID [2018-11-18 23:02:02,768 INFO L273 TraceCheckUtils]: 22: Hoare triple {8933#(and (= main_~v~0 0) (<= 100000 ~SIZE~0))} #t~post2 := ~v~0;~v~0 := 1 + #t~post2;havoc #t~post2; {8934#(<= (+ main_~v~0 99999) ~SIZE~0)} is VALID [2018-11-18 23:02:02,769 INFO L273 TraceCheckUtils]: 23: Hoare triple {8934#(<= (+ main_~v~0 99999) ~SIZE~0)} assume true; {8934#(<= (+ main_~v~0 99999) ~SIZE~0)} is VALID [2018-11-18 23:02:02,769 INFO L273 TraceCheckUtils]: 24: Hoare triple {8934#(<= (+ main_~v~0 99999) ~SIZE~0)} assume !!(~v~0 < ~SIZE~0);call #t~mem3 := read~int(~#values~0.base, ~#values~0.offset + 4 * ~v~0, 4); {8934#(<= (+ main_~v~0 99999) ~SIZE~0)} is VALID [2018-11-18 23:02:02,769 INFO L256 TraceCheckUtils]: 25: Hoare triple {8934#(<= (+ main_~v~0 99999) ~SIZE~0)} call #t~ret4 := elem_exists(~#set~0.base, ~#set~0.offset, ~n~0, #t~mem3); {8930#true} is VALID [2018-11-18 23:02:02,770 INFO L273 TraceCheckUtils]: 26: Hoare triple {8930#true} ~set.base, ~set.offset := #in~set.base, #in~set.offset;~size := #in~size;~value := #in~value;havoc ~i~0;~i~0 := 0; {8930#true} is VALID [2018-11-18 23:02:02,770 INFO L273 TraceCheckUtils]: 27: Hoare triple {8930#true} assume true; {8930#true} is VALID [2018-11-18 23:02:02,770 INFO L273 TraceCheckUtils]: 28: Hoare triple {8930#true} assume !!(~i~0 < ~size);call #t~mem1 := read~int(~set.base, ~set.offset + 4 * ~i~0, 4); {8930#true} is VALID [2018-11-18 23:02:02,770 INFO L273 TraceCheckUtils]: 29: Hoare triple {8930#true} assume #t~mem1 == ~value;havoc #t~mem1;#res := 1; {8930#true} is VALID [2018-11-18 23:02:02,770 INFO L273 TraceCheckUtils]: 30: Hoare triple {8930#true} assume true; {8930#true} is VALID [2018-11-18 23:02:02,772 INFO L268 TraceCheckUtils]: 31: Hoare quadruple {8930#true} {8934#(<= (+ main_~v~0 99999) ~SIZE~0)} #132#return; {8934#(<= (+ main_~v~0 99999) ~SIZE~0)} is VALID [2018-11-18 23:02:02,774 INFO L273 TraceCheckUtils]: 32: Hoare triple {8934#(<= (+ main_~v~0 99999) ~SIZE~0)} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {8934#(<= (+ main_~v~0 99999) ~SIZE~0)} is VALID [2018-11-18 23:02:02,774 INFO L273 TraceCheckUtils]: 33: Hoare triple {8934#(<= (+ main_~v~0 99999) ~SIZE~0)} assume !(1 != #t~ret4);havoc #t~mem3;havoc #t~ret4; {8934#(<= (+ main_~v~0 99999) ~SIZE~0)} is VALID [2018-11-18 23:02:02,776 INFO L273 TraceCheckUtils]: 34: Hoare triple {8934#(<= (+ main_~v~0 99999) ~SIZE~0)} #t~post2 := ~v~0;~v~0 := 1 + #t~post2;havoc #t~post2; {8935#(<= (+ main_~v~0 99998) ~SIZE~0)} is VALID [2018-11-18 23:02:02,776 INFO L273 TraceCheckUtils]: 35: Hoare triple {8935#(<= (+ main_~v~0 99998) ~SIZE~0)} assume true; {8935#(<= (+ main_~v~0 99998) ~SIZE~0)} is VALID [2018-11-18 23:02:02,778 INFO L273 TraceCheckUtils]: 36: Hoare triple {8935#(<= (+ main_~v~0 99998) ~SIZE~0)} assume !!(~v~0 < ~SIZE~0);call #t~mem3 := read~int(~#values~0.base, ~#values~0.offset + 4 * ~v~0, 4); {8935#(<= (+ main_~v~0 99998) ~SIZE~0)} is VALID [2018-11-18 23:02:02,778 INFO L256 TraceCheckUtils]: 37: Hoare triple {8935#(<= (+ main_~v~0 99998) ~SIZE~0)} call #t~ret4 := elem_exists(~#set~0.base, ~#set~0.offset, ~n~0, #t~mem3); {8930#true} is VALID [2018-11-18 23:02:02,778 INFO L273 TraceCheckUtils]: 38: Hoare triple {8930#true} ~set.base, ~set.offset := #in~set.base, #in~set.offset;~size := #in~size;~value := #in~value;havoc ~i~0;~i~0 := 0; {8930#true} is VALID [2018-11-18 23:02:02,778 INFO L273 TraceCheckUtils]: 39: Hoare triple {8930#true} assume true; {8930#true} is VALID [2018-11-18 23:02:02,778 INFO L273 TraceCheckUtils]: 40: Hoare triple {8930#true} assume !!(~i~0 < ~size);call #t~mem1 := read~int(~set.base, ~set.offset + 4 * ~i~0, 4); {8930#true} is VALID [2018-11-18 23:02:02,778 INFO L273 TraceCheckUtils]: 41: Hoare triple {8930#true} assume #t~mem1 == ~value;havoc #t~mem1;#res := 1; {8930#true} is VALID [2018-11-18 23:02:02,778 INFO L273 TraceCheckUtils]: 42: Hoare triple {8930#true} assume true; {8930#true} is VALID [2018-11-18 23:02:02,779 INFO L268 TraceCheckUtils]: 43: Hoare quadruple {8930#true} {8935#(<= (+ main_~v~0 99998) ~SIZE~0)} #132#return; {8935#(<= (+ main_~v~0 99998) ~SIZE~0)} is VALID [2018-11-18 23:02:02,781 INFO L273 TraceCheckUtils]: 44: Hoare triple {8935#(<= (+ main_~v~0 99998) ~SIZE~0)} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {8935#(<= (+ main_~v~0 99998) ~SIZE~0)} is VALID [2018-11-18 23:02:02,781 INFO L273 TraceCheckUtils]: 45: Hoare triple {8935#(<= (+ main_~v~0 99998) ~SIZE~0)} assume !(1 != #t~ret4);havoc #t~mem3;havoc #t~ret4; {8935#(<= (+ main_~v~0 99998) ~SIZE~0)} is VALID [2018-11-18 23:02:02,783 INFO L273 TraceCheckUtils]: 46: Hoare triple {8935#(<= (+ main_~v~0 99998) ~SIZE~0)} #t~post2 := ~v~0;~v~0 := 1 + #t~post2;havoc #t~post2; {8936#(<= (+ main_~v~0 99997) ~SIZE~0)} is VALID [2018-11-18 23:02:02,783 INFO L273 TraceCheckUtils]: 47: Hoare triple {8936#(<= (+ main_~v~0 99997) ~SIZE~0)} assume true; {8936#(<= (+ main_~v~0 99997) ~SIZE~0)} is VALID [2018-11-18 23:02:02,786 INFO L273 TraceCheckUtils]: 48: Hoare triple {8936#(<= (+ main_~v~0 99997) ~SIZE~0)} assume !!(~v~0 < ~SIZE~0);call #t~mem3 := read~int(~#values~0.base, ~#values~0.offset + 4 * ~v~0, 4); {8936#(<= (+ main_~v~0 99997) ~SIZE~0)} is VALID [2018-11-18 23:02:02,786 INFO L256 TraceCheckUtils]: 49: Hoare triple {8936#(<= (+ main_~v~0 99997) ~SIZE~0)} call #t~ret4 := elem_exists(~#set~0.base, ~#set~0.offset, ~n~0, #t~mem3); {8930#true} is VALID [2018-11-18 23:02:02,786 INFO L273 TraceCheckUtils]: 50: Hoare triple {8930#true} ~set.base, ~set.offset := #in~set.base, #in~set.offset;~size := #in~size;~value := #in~value;havoc ~i~0;~i~0 := 0; {8930#true} is VALID [2018-11-18 23:02:02,786 INFO L273 TraceCheckUtils]: 51: Hoare triple {8930#true} assume true; {8930#true} is VALID [2018-11-18 23:02:02,786 INFO L273 TraceCheckUtils]: 52: Hoare triple {8930#true} assume !!(~i~0 < ~size);call #t~mem1 := read~int(~set.base, ~set.offset + 4 * ~i~0, 4); {8930#true} is VALID [2018-11-18 23:02:02,786 INFO L273 TraceCheckUtils]: 53: Hoare triple {8930#true} assume #t~mem1 == ~value;havoc #t~mem1;#res := 1; {8930#true} is VALID [2018-11-18 23:02:02,786 INFO L273 TraceCheckUtils]: 54: Hoare triple {8930#true} assume true; {8930#true} is VALID [2018-11-18 23:02:02,787 INFO L268 TraceCheckUtils]: 55: Hoare quadruple {8930#true} {8936#(<= (+ main_~v~0 99997) ~SIZE~0)} #132#return; {8936#(<= (+ main_~v~0 99997) ~SIZE~0)} is VALID [2018-11-18 23:02:02,789 INFO L273 TraceCheckUtils]: 56: Hoare triple {8936#(<= (+ main_~v~0 99997) ~SIZE~0)} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {8936#(<= (+ main_~v~0 99997) ~SIZE~0)} is VALID [2018-11-18 23:02:02,789 INFO L273 TraceCheckUtils]: 57: Hoare triple {8936#(<= (+ main_~v~0 99997) ~SIZE~0)} assume !(1 != #t~ret4);havoc #t~mem3;havoc #t~ret4; {8936#(<= (+ main_~v~0 99997) ~SIZE~0)} is VALID [2018-11-18 23:02:02,791 INFO L273 TraceCheckUtils]: 58: Hoare triple {8936#(<= (+ main_~v~0 99997) ~SIZE~0)} #t~post2 := ~v~0;~v~0 := 1 + #t~post2;havoc #t~post2; {8937#(<= (+ main_~v~0 99996) ~SIZE~0)} is VALID [2018-11-18 23:02:02,791 INFO L273 TraceCheckUtils]: 59: Hoare triple {8937#(<= (+ main_~v~0 99996) ~SIZE~0)} assume true; {8937#(<= (+ main_~v~0 99996) ~SIZE~0)} is VALID [2018-11-18 23:02:02,793 INFO L273 TraceCheckUtils]: 60: Hoare triple {8937#(<= (+ main_~v~0 99996) ~SIZE~0)} assume !!(~v~0 < ~SIZE~0);call #t~mem3 := read~int(~#values~0.base, ~#values~0.offset + 4 * ~v~0, 4); {8937#(<= (+ main_~v~0 99996) ~SIZE~0)} is VALID [2018-11-18 23:02:02,793 INFO L256 TraceCheckUtils]: 61: Hoare triple {8937#(<= (+ main_~v~0 99996) ~SIZE~0)} call #t~ret4 := elem_exists(~#set~0.base, ~#set~0.offset, ~n~0, #t~mem3); {8930#true} is VALID [2018-11-18 23:02:02,793 INFO L273 TraceCheckUtils]: 62: Hoare triple {8930#true} ~set.base, ~set.offset := #in~set.base, #in~set.offset;~size := #in~size;~value := #in~value;havoc ~i~0;~i~0 := 0; {8930#true} is VALID [2018-11-18 23:02:02,793 INFO L273 TraceCheckUtils]: 63: Hoare triple {8930#true} assume true; {8930#true} is VALID [2018-11-18 23:02:02,793 INFO L273 TraceCheckUtils]: 64: Hoare triple {8930#true} assume !!(~i~0 < ~size);call #t~mem1 := read~int(~set.base, ~set.offset + 4 * ~i~0, 4); {8930#true} is VALID [2018-11-18 23:02:02,793 INFO L273 TraceCheckUtils]: 65: Hoare triple {8930#true} assume #t~mem1 == ~value;havoc #t~mem1;#res := 1; {8930#true} is VALID [2018-11-18 23:02:02,793 INFO L273 TraceCheckUtils]: 66: Hoare triple {8930#true} assume true; {8930#true} is VALID [2018-11-18 23:02:02,795 INFO L268 TraceCheckUtils]: 67: Hoare quadruple {8930#true} {8937#(<= (+ main_~v~0 99996) ~SIZE~0)} #132#return; {8937#(<= (+ main_~v~0 99996) ~SIZE~0)} is VALID [2018-11-18 23:02:02,797 INFO L273 TraceCheckUtils]: 68: Hoare triple {8937#(<= (+ main_~v~0 99996) ~SIZE~0)} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {8937#(<= (+ main_~v~0 99996) ~SIZE~0)} is VALID [2018-11-18 23:02:02,797 INFO L273 TraceCheckUtils]: 69: Hoare triple {8937#(<= (+ main_~v~0 99996) ~SIZE~0)} assume !(1 != #t~ret4);havoc #t~mem3;havoc #t~ret4; {8937#(<= (+ main_~v~0 99996) ~SIZE~0)} is VALID [2018-11-18 23:02:02,799 INFO L273 TraceCheckUtils]: 70: Hoare triple {8937#(<= (+ main_~v~0 99996) ~SIZE~0)} #t~post2 := ~v~0;~v~0 := 1 + #t~post2;havoc #t~post2; {8938#(<= (+ main_~v~0 99995) ~SIZE~0)} is VALID [2018-11-18 23:02:02,799 INFO L273 TraceCheckUtils]: 71: Hoare triple {8938#(<= (+ main_~v~0 99995) ~SIZE~0)} assume true; {8938#(<= (+ main_~v~0 99995) ~SIZE~0)} is VALID [2018-11-18 23:02:02,801 INFO L273 TraceCheckUtils]: 72: Hoare triple {8938#(<= (+ main_~v~0 99995) ~SIZE~0)} assume !!(~v~0 < ~SIZE~0);call #t~mem3 := read~int(~#values~0.base, ~#values~0.offset + 4 * ~v~0, 4); {8938#(<= (+ main_~v~0 99995) ~SIZE~0)} is VALID [2018-11-18 23:02:02,801 INFO L256 TraceCheckUtils]: 73: Hoare triple {8938#(<= (+ main_~v~0 99995) ~SIZE~0)} call #t~ret4 := elem_exists(~#set~0.base, ~#set~0.offset, ~n~0, #t~mem3); {8930#true} is VALID [2018-11-18 23:02:02,801 INFO L273 TraceCheckUtils]: 74: Hoare triple {8930#true} ~set.base, ~set.offset := #in~set.base, #in~set.offset;~size := #in~size;~value := #in~value;havoc ~i~0;~i~0 := 0; {8930#true} is VALID [2018-11-18 23:02:02,801 INFO L273 TraceCheckUtils]: 75: Hoare triple {8930#true} assume true; {8930#true} is VALID [2018-11-18 23:02:02,801 INFO L273 TraceCheckUtils]: 76: Hoare triple {8930#true} assume !!(~i~0 < ~size);call #t~mem1 := read~int(~set.base, ~set.offset + 4 * ~i~0, 4); {8930#true} is VALID [2018-11-18 23:02:02,801 INFO L273 TraceCheckUtils]: 77: Hoare triple {8930#true} assume #t~mem1 == ~value;havoc #t~mem1;#res := 1; {8930#true} is VALID [2018-11-18 23:02:02,801 INFO L273 TraceCheckUtils]: 78: Hoare triple {8930#true} assume true; {8930#true} is VALID [2018-11-18 23:02:02,802 INFO L268 TraceCheckUtils]: 79: Hoare quadruple {8930#true} {8938#(<= (+ main_~v~0 99995) ~SIZE~0)} #132#return; {8938#(<= (+ main_~v~0 99995) ~SIZE~0)} is VALID [2018-11-18 23:02:02,804 INFO L273 TraceCheckUtils]: 80: Hoare triple {8938#(<= (+ main_~v~0 99995) ~SIZE~0)} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {8938#(<= (+ main_~v~0 99995) ~SIZE~0)} is VALID [2018-11-18 23:02:02,804 INFO L273 TraceCheckUtils]: 81: Hoare triple {8938#(<= (+ main_~v~0 99995) ~SIZE~0)} assume !(1 != #t~ret4);havoc #t~mem3;havoc #t~ret4; {8938#(<= (+ main_~v~0 99995) ~SIZE~0)} is VALID [2018-11-18 23:02:02,805 INFO L273 TraceCheckUtils]: 82: Hoare triple {8938#(<= (+ main_~v~0 99995) ~SIZE~0)} #t~post2 := ~v~0;~v~0 := 1 + #t~post2;havoc #t~post2; {8939#(<= (+ main_~v~0 99994) ~SIZE~0)} is VALID [2018-11-18 23:02:02,806 INFO L273 TraceCheckUtils]: 83: Hoare triple {8939#(<= (+ main_~v~0 99994) ~SIZE~0)} assume true; {8939#(<= (+ main_~v~0 99994) ~SIZE~0)} is VALID [2018-11-18 23:02:02,806 INFO L273 TraceCheckUtils]: 84: Hoare triple {8939#(<= (+ main_~v~0 99994) ~SIZE~0)} assume !!(~v~0 < ~SIZE~0);call #t~mem3 := read~int(~#values~0.base, ~#values~0.offset + 4 * ~v~0, 4); {8939#(<= (+ main_~v~0 99994) ~SIZE~0)} is VALID [2018-11-18 23:02:02,806 INFO L256 TraceCheckUtils]: 85: Hoare triple {8939#(<= (+ main_~v~0 99994) ~SIZE~0)} call #t~ret4 := elem_exists(~#set~0.base, ~#set~0.offset, ~n~0, #t~mem3); {8930#true} is VALID [2018-11-18 23:02:02,807 INFO L273 TraceCheckUtils]: 86: Hoare triple {8930#true} ~set.base, ~set.offset := #in~set.base, #in~set.offset;~size := #in~size;~value := #in~value;havoc ~i~0;~i~0 := 0; {8930#true} is VALID [2018-11-18 23:02:02,807 INFO L273 TraceCheckUtils]: 87: Hoare triple {8930#true} assume true; {8930#true} is VALID [2018-11-18 23:02:02,807 INFO L273 TraceCheckUtils]: 88: Hoare triple {8930#true} assume !!(~i~0 < ~size);call #t~mem1 := read~int(~set.base, ~set.offset + 4 * ~i~0, 4); {8930#true} is VALID [2018-11-18 23:02:02,807 INFO L273 TraceCheckUtils]: 89: Hoare triple {8930#true} assume #t~mem1 == ~value;havoc #t~mem1;#res := 1; {8930#true} is VALID [2018-11-18 23:02:02,807 INFO L273 TraceCheckUtils]: 90: Hoare triple {8930#true} assume true; {8930#true} is VALID [2018-11-18 23:02:02,813 INFO L268 TraceCheckUtils]: 91: Hoare quadruple {8930#true} {8939#(<= (+ main_~v~0 99994) ~SIZE~0)} #132#return; {8939#(<= (+ main_~v~0 99994) ~SIZE~0)} is VALID [2018-11-18 23:02:02,813 INFO L273 TraceCheckUtils]: 92: Hoare triple {8939#(<= (+ main_~v~0 99994) ~SIZE~0)} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {8939#(<= (+ main_~v~0 99994) ~SIZE~0)} is VALID [2018-11-18 23:02:02,815 INFO L273 TraceCheckUtils]: 93: Hoare triple {8939#(<= (+ main_~v~0 99994) ~SIZE~0)} assume !(1 != #t~ret4);havoc #t~mem3;havoc #t~ret4; {8939#(<= (+ main_~v~0 99994) ~SIZE~0)} is VALID [2018-11-18 23:02:02,817 INFO L273 TraceCheckUtils]: 94: Hoare triple {8939#(<= (+ main_~v~0 99994) ~SIZE~0)} #t~post2 := ~v~0;~v~0 := 1 + #t~post2;havoc #t~post2; {8940#(<= (+ main_~v~0 99993) ~SIZE~0)} is VALID [2018-11-18 23:02:02,817 INFO L273 TraceCheckUtils]: 95: Hoare triple {8940#(<= (+ main_~v~0 99993) ~SIZE~0)} assume true; {8940#(<= (+ main_~v~0 99993) ~SIZE~0)} is VALID [2018-11-18 23:02:02,820 INFO L273 TraceCheckUtils]: 96: Hoare triple {8940#(<= (+ main_~v~0 99993) ~SIZE~0)} assume !!(~v~0 < ~SIZE~0);call #t~mem3 := read~int(~#values~0.base, ~#values~0.offset + 4 * ~v~0, 4); {8940#(<= (+ main_~v~0 99993) ~SIZE~0)} is VALID [2018-11-18 23:02:02,820 INFO L256 TraceCheckUtils]: 97: Hoare triple {8940#(<= (+ main_~v~0 99993) ~SIZE~0)} call #t~ret4 := elem_exists(~#set~0.base, ~#set~0.offset, ~n~0, #t~mem3); {8930#true} is VALID [2018-11-18 23:02:02,820 INFO L273 TraceCheckUtils]: 98: Hoare triple {8930#true} ~set.base, ~set.offset := #in~set.base, #in~set.offset;~size := #in~size;~value := #in~value;havoc ~i~0;~i~0 := 0; {8930#true} is VALID [2018-11-18 23:02:02,820 INFO L273 TraceCheckUtils]: 99: Hoare triple {8930#true} assume true; {8930#true} is VALID [2018-11-18 23:02:02,820 INFO L273 TraceCheckUtils]: 100: Hoare triple {8930#true} assume !!(~i~0 < ~size);call #t~mem1 := read~int(~set.base, ~set.offset + 4 * ~i~0, 4); {8930#true} is VALID [2018-11-18 23:02:02,820 INFO L273 TraceCheckUtils]: 101: Hoare triple {8930#true} assume #t~mem1 == ~value;havoc #t~mem1;#res := 1; {8930#true} is VALID [2018-11-18 23:02:02,820 INFO L273 TraceCheckUtils]: 102: Hoare triple {8930#true} assume true; {8930#true} is VALID [2018-11-18 23:02:02,821 INFO L268 TraceCheckUtils]: 103: Hoare quadruple {8930#true} {8940#(<= (+ main_~v~0 99993) ~SIZE~0)} #132#return; {8940#(<= (+ main_~v~0 99993) ~SIZE~0)} is VALID [2018-11-18 23:02:02,826 INFO L273 TraceCheckUtils]: 104: Hoare triple {8940#(<= (+ main_~v~0 99993) ~SIZE~0)} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {8940#(<= (+ main_~v~0 99993) ~SIZE~0)} is VALID [2018-11-18 23:02:02,826 INFO L273 TraceCheckUtils]: 105: Hoare triple {8940#(<= (+ main_~v~0 99993) ~SIZE~0)} assume !(1 != #t~ret4);havoc #t~mem3;havoc #t~ret4; {8940#(<= (+ main_~v~0 99993) ~SIZE~0)} is VALID [2018-11-18 23:02:02,830 INFO L273 TraceCheckUtils]: 106: Hoare triple {8940#(<= (+ main_~v~0 99993) ~SIZE~0)} #t~post2 := ~v~0;~v~0 := 1 + #t~post2;havoc #t~post2; {8941#(<= (+ main_~v~0 99992) ~SIZE~0)} is VALID [2018-11-18 23:02:02,831 INFO L273 TraceCheckUtils]: 107: Hoare triple {8941#(<= (+ main_~v~0 99992) ~SIZE~0)} assume true; {8941#(<= (+ main_~v~0 99992) ~SIZE~0)} is VALID [2018-11-18 23:02:02,831 INFO L273 TraceCheckUtils]: 108: Hoare triple {8941#(<= (+ main_~v~0 99992) ~SIZE~0)} assume !(~v~0 < ~SIZE~0); {8931#false} is VALID [2018-11-18 23:02:02,831 INFO L273 TraceCheckUtils]: 109: Hoare triple {8931#false} ~i~1 := 0; {8931#false} is VALID [2018-11-18 23:02:02,831 INFO L273 TraceCheckUtils]: 110: Hoare triple {8931#false} assume true; {8931#false} is VALID [2018-11-18 23:02:02,832 INFO L273 TraceCheckUtils]: 111: Hoare triple {8931#false} assume !!(~i~1 < ~SIZE~0 && 1 != ~found~0);call #t~mem8 := read~int(~#set~0.base, ~#set~0.offset + 4 * ~i~1, 4); {8931#false} is VALID [2018-11-18 23:02:02,832 INFO L273 TraceCheckUtils]: 112: Hoare triple {8931#false} assume !(#t~mem8 == ~element~0);havoc #t~mem8; {8931#false} is VALID [2018-11-18 23:02:02,832 INFO L273 TraceCheckUtils]: 113: Hoare triple {8931#false} #t~post7 := ~i~1;~i~1 := 1 + #t~post7;havoc #t~post7; {8931#false} is VALID [2018-11-18 23:02:02,832 INFO L273 TraceCheckUtils]: 114: Hoare triple {8931#false} assume true; {8931#false} is VALID [2018-11-18 23:02:02,832 INFO L273 TraceCheckUtils]: 115: Hoare triple {8931#false} assume !!(~i~1 < ~SIZE~0 && 1 != ~found~0);call #t~mem8 := read~int(~#set~0.base, ~#set~0.offset + 4 * ~i~1, 4); {8931#false} is VALID [2018-11-18 23:02:02,832 INFO L273 TraceCheckUtils]: 116: Hoare triple {8931#false} assume #t~mem8 == ~element~0;havoc #t~mem8;~found~0 := 1;~pos~0 := ~i~1; {8931#false} is VALID [2018-11-18 23:02:02,832 INFO L273 TraceCheckUtils]: 117: Hoare triple {8931#false} #t~post7 := ~i~1;~i~1 := 1 + #t~post7;havoc #t~post7; {8931#false} is VALID [2018-11-18 23:02:02,832 INFO L273 TraceCheckUtils]: 118: Hoare triple {8931#false} assume true; {8931#false} is VALID [2018-11-18 23:02:02,832 INFO L273 TraceCheckUtils]: 119: Hoare triple {8931#false} assume !(~i~1 < ~SIZE~0 && 1 != ~found~0); {8931#false} is VALID [2018-11-18 23:02:02,833 INFO L273 TraceCheckUtils]: 120: Hoare triple {8931#false} assume 1 == ~found~0;~i~1 := ~pos~0; {8931#false} is VALID [2018-11-18 23:02:02,833 INFO L273 TraceCheckUtils]: 121: Hoare triple {8931#false} assume true; {8931#false} is VALID [2018-11-18 23:02:02,833 INFO L273 TraceCheckUtils]: 122: Hoare triple {8931#false} assume !!(~i~1 < ~SIZE~0 - 1);call #t~mem10 := read~int(~#set~0.base, ~#set~0.offset + 4 * (1 + ~i~1), 4);call write~int(#t~mem10, ~#set~0.base, ~#set~0.offset + 4 * ~i~1, 4);havoc #t~mem10; {8931#false} is VALID [2018-11-18 23:02:02,833 INFO L273 TraceCheckUtils]: 123: Hoare triple {8931#false} #t~post9 := ~i~1;~i~1 := 1 + #t~post9;havoc #t~post9; {8931#false} is VALID [2018-11-18 23:02:02,833 INFO L273 TraceCheckUtils]: 124: Hoare triple {8931#false} assume true; {8931#false} is VALID [2018-11-18 23:02:02,833 INFO L273 TraceCheckUtils]: 125: Hoare triple {8931#false} assume !(~i~1 < ~SIZE~0 - 1); {8931#false} is VALID [2018-11-18 23:02:02,833 INFO L273 TraceCheckUtils]: 126: Hoare triple {8931#false} assume 1 == ~found~0;~i~1 := 0; {8931#false} is VALID [2018-11-18 23:02:02,834 INFO L273 TraceCheckUtils]: 127: Hoare triple {8931#false} assume true; {8931#false} is VALID [2018-11-18 23:02:02,834 INFO L273 TraceCheckUtils]: 128: Hoare triple {8931#false} assume !!(~i~1 < ~SIZE~0 - 1);call #t~mem12 := read~int(~#set~0.base, ~#set~0.offset + 4 * ~i~1, 4); {8931#false} is VALID [2018-11-18 23:02:02,834 INFO L256 TraceCheckUtils]: 129: Hoare triple {8931#false} call __VERIFIER_assert((if #t~mem12 != ~element~0 then 1 else 0)); {8931#false} is VALID [2018-11-18 23:02:02,834 INFO L273 TraceCheckUtils]: 130: Hoare triple {8931#false} ~cond := #in~cond; {8931#false} is VALID [2018-11-18 23:02:02,834 INFO L273 TraceCheckUtils]: 131: Hoare triple {8931#false} assume 0 == ~cond; {8931#false} is VALID [2018-11-18 23:02:02,834 INFO L273 TraceCheckUtils]: 132: Hoare triple {8931#false} assume !false; {8931#false} is VALID [2018-11-18 23:02:02,845 INFO L134 CoverageAnalysis]: Checked inductivity of 355 backedges. 0 proven. 184 refuted. 0 times theorem prover too weak. 171 trivial. 0 not checked. [2018-11-18 23:02:02,845 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 23:02:02,846 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 23:02:02,861 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-18 23:02:02,900 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-11-18 23:02:02,900 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-18 23:02:02,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 23:02:02,928 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 23:02:03,273 INFO L256 TraceCheckUtils]: 0: Hoare triple {8930#true} call ULTIMATE.init(); {8930#true} is VALID [2018-11-18 23:02:03,274 INFO L273 TraceCheckUtils]: 1: Hoare triple {8930#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~SIZE~0 := 100000; {8932#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:02:03,275 INFO L273 TraceCheckUtils]: 2: Hoare triple {8932#(<= 100000 ~SIZE~0)} assume true; {8932#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:02:03,275 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {8932#(<= 100000 ~SIZE~0)} {8930#true} #128#return; {8932#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:02:03,276 INFO L256 TraceCheckUtils]: 4: Hoare triple {8932#(<= 100000 ~SIZE~0)} call #t~ret13 := main(); {8932#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:02:03,276 INFO L273 TraceCheckUtils]: 5: Hoare triple {8932#(<= 100000 ~SIZE~0)} havoc ~i~1;havoc ~pos~0;~n~0 := 0;~found~0 := 0;call ~#set~0.base, ~#set~0.offset := #Ultimate.alloc(4 * ~SIZE~0);call ~#values~0.base, ~#values~0.offset := #Ultimate.alloc(4 * ~SIZE~0);havoc ~element~0;havoc ~v~0;~v~0 := 0; {8932#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:02:03,277 INFO L273 TraceCheckUtils]: 6: Hoare triple {8932#(<= 100000 ~SIZE~0)} assume true; {8932#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:02:03,277 INFO L273 TraceCheckUtils]: 7: Hoare triple {8932#(<= 100000 ~SIZE~0)} assume !!(~v~0 < ~SIZE~0);call #t~mem3 := read~int(~#values~0.base, ~#values~0.offset + 4 * ~v~0, 4); {8932#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:02:03,279 INFO L256 TraceCheckUtils]: 8: Hoare triple {8932#(<= 100000 ~SIZE~0)} call #t~ret4 := elem_exists(~#set~0.base, ~#set~0.offset, ~n~0, #t~mem3); {8932#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:02:03,279 INFO L273 TraceCheckUtils]: 9: Hoare triple {8932#(<= 100000 ~SIZE~0)} ~set.base, ~set.offset := #in~set.base, #in~set.offset;~size := #in~size;~value := #in~value;havoc ~i~0;~i~0 := 0; {8932#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:02:03,280 INFO L273 TraceCheckUtils]: 10: Hoare triple {8932#(<= 100000 ~SIZE~0)} assume true; {8932#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:02:03,280 INFO L273 TraceCheckUtils]: 11: Hoare triple {8932#(<= 100000 ~SIZE~0)} assume !(~i~0 < ~size); {8932#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:02:03,281 INFO L273 TraceCheckUtils]: 12: Hoare triple {8932#(<= 100000 ~SIZE~0)} #res := 0; {8932#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:02:03,281 INFO L273 TraceCheckUtils]: 13: Hoare triple {8932#(<= 100000 ~SIZE~0)} assume true; {8932#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:02:03,283 INFO L268 TraceCheckUtils]: 14: Hoare quadruple {8932#(<= 100000 ~SIZE~0)} {8932#(<= 100000 ~SIZE~0)} #132#return; {8932#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:02:03,283 INFO L273 TraceCheckUtils]: 15: Hoare triple {8932#(<= 100000 ~SIZE~0)} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {8932#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:02:03,284 INFO L273 TraceCheckUtils]: 16: Hoare triple {8932#(<= 100000 ~SIZE~0)} assume 1 != #t~ret4;havoc #t~mem3;havoc #t~ret4;call #t~mem5 := read~int(~#values~0.base, ~#values~0.offset + 4 * ~v~0, 4); {8932#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:02:03,285 INFO L256 TraceCheckUtils]: 17: Hoare triple {8932#(<= 100000 ~SIZE~0)} call #t~ret6 := insert(~#set~0.base, ~#set~0.offset, ~n~0, #t~mem5); {8932#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:02:03,285 INFO L273 TraceCheckUtils]: 18: Hoare triple {8932#(<= 100000 ~SIZE~0)} ~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; {8932#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:02:03,286 INFO L273 TraceCheckUtils]: 19: Hoare triple {8932#(<= 100000 ~SIZE~0)} assume true; {8932#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:02:03,287 INFO L268 TraceCheckUtils]: 20: Hoare quadruple {8932#(<= 100000 ~SIZE~0)} {8932#(<= 100000 ~SIZE~0)} #134#return; {8932#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:02:03,288 INFO L273 TraceCheckUtils]: 21: Hoare triple {8932#(<= 100000 ~SIZE~0)} assume -2147483648 <= #t~ret6 && #t~ret6 <= 2147483647;~n~0 := #t~ret6;havoc #t~ret6;havoc #t~mem5; {8932#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:02:03,288 INFO L273 TraceCheckUtils]: 22: Hoare triple {8932#(<= 100000 ~SIZE~0)} #t~post2 := ~v~0;~v~0 := 1 + #t~post2;havoc #t~post2; {8932#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:02:03,289 INFO L273 TraceCheckUtils]: 23: Hoare triple {8932#(<= 100000 ~SIZE~0)} assume true; {8932#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:02:03,289 INFO L273 TraceCheckUtils]: 24: Hoare triple {8932#(<= 100000 ~SIZE~0)} assume !!(~v~0 < ~SIZE~0);call #t~mem3 := read~int(~#values~0.base, ~#values~0.offset + 4 * ~v~0, 4); {8932#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:02:03,291 INFO L256 TraceCheckUtils]: 25: Hoare triple {8932#(<= 100000 ~SIZE~0)} call #t~ret4 := elem_exists(~#set~0.base, ~#set~0.offset, ~n~0, #t~mem3); {8932#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:02:03,291 INFO L273 TraceCheckUtils]: 26: Hoare triple {8932#(<= 100000 ~SIZE~0)} ~set.base, ~set.offset := #in~set.base, #in~set.offset;~size := #in~size;~value := #in~value;havoc ~i~0;~i~0 := 0; {8932#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:02:03,292 INFO L273 TraceCheckUtils]: 27: Hoare triple {8932#(<= 100000 ~SIZE~0)} assume true; {8932#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:02:03,292 INFO L273 TraceCheckUtils]: 28: Hoare triple {8932#(<= 100000 ~SIZE~0)} assume !!(~i~0 < ~size);call #t~mem1 := read~int(~set.base, ~set.offset + 4 * ~i~0, 4); {8932#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:02:03,293 INFO L273 TraceCheckUtils]: 29: Hoare triple {8932#(<= 100000 ~SIZE~0)} assume #t~mem1 == ~value;havoc #t~mem1;#res := 1; {8932#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:02:03,293 INFO L273 TraceCheckUtils]: 30: Hoare triple {8932#(<= 100000 ~SIZE~0)} assume true; {8932#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:02:03,294 INFO L268 TraceCheckUtils]: 31: Hoare quadruple {8932#(<= 100000 ~SIZE~0)} {8932#(<= 100000 ~SIZE~0)} #132#return; {8932#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:02:03,295 INFO L273 TraceCheckUtils]: 32: Hoare triple {8932#(<= 100000 ~SIZE~0)} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {8932#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:02:03,296 INFO L273 TraceCheckUtils]: 33: Hoare triple {8932#(<= 100000 ~SIZE~0)} assume !(1 != #t~ret4);havoc #t~mem3;havoc #t~ret4; {8932#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:02:03,296 INFO L273 TraceCheckUtils]: 34: Hoare triple {8932#(<= 100000 ~SIZE~0)} #t~post2 := ~v~0;~v~0 := 1 + #t~post2;havoc #t~post2; {8932#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:02:03,297 INFO L273 TraceCheckUtils]: 35: Hoare triple {8932#(<= 100000 ~SIZE~0)} assume true; {8932#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:02:03,297 INFO L273 TraceCheckUtils]: 36: Hoare triple {8932#(<= 100000 ~SIZE~0)} assume !!(~v~0 < ~SIZE~0);call #t~mem3 := read~int(~#values~0.base, ~#values~0.offset + 4 * ~v~0, 4); {8932#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:02:03,298 INFO L256 TraceCheckUtils]: 37: Hoare triple {8932#(<= 100000 ~SIZE~0)} call #t~ret4 := elem_exists(~#set~0.base, ~#set~0.offset, ~n~0, #t~mem3); {8932#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:02:03,299 INFO L273 TraceCheckUtils]: 38: Hoare triple {8932#(<= 100000 ~SIZE~0)} ~set.base, ~set.offset := #in~set.base, #in~set.offset;~size := #in~size;~value := #in~value;havoc ~i~0;~i~0 := 0; {8932#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:02:03,299 INFO L273 TraceCheckUtils]: 39: Hoare triple {8932#(<= 100000 ~SIZE~0)} assume true; {8932#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:02:03,300 INFO L273 TraceCheckUtils]: 40: Hoare triple {8932#(<= 100000 ~SIZE~0)} assume !!(~i~0 < ~size);call #t~mem1 := read~int(~set.base, ~set.offset + 4 * ~i~0, 4); {8932#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:02:03,300 INFO L273 TraceCheckUtils]: 41: Hoare triple {8932#(<= 100000 ~SIZE~0)} assume #t~mem1 == ~value;havoc #t~mem1;#res := 1; {8932#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:02:03,301 INFO L273 TraceCheckUtils]: 42: Hoare triple {8932#(<= 100000 ~SIZE~0)} assume true; {8932#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:02:03,302 INFO L268 TraceCheckUtils]: 43: Hoare quadruple {8932#(<= 100000 ~SIZE~0)} {8932#(<= 100000 ~SIZE~0)} #132#return; {8932#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:02:03,303 INFO L273 TraceCheckUtils]: 44: Hoare triple {8932#(<= 100000 ~SIZE~0)} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {8932#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:02:03,303 INFO L273 TraceCheckUtils]: 45: Hoare triple {8932#(<= 100000 ~SIZE~0)} assume !(1 != #t~ret4);havoc #t~mem3;havoc #t~ret4; {8932#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:02:03,304 INFO L273 TraceCheckUtils]: 46: Hoare triple {8932#(<= 100000 ~SIZE~0)} #t~post2 := ~v~0;~v~0 := 1 + #t~post2;havoc #t~post2; {8932#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:02:03,304 INFO L273 TraceCheckUtils]: 47: Hoare triple {8932#(<= 100000 ~SIZE~0)} assume true; {8932#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:02:03,305 INFO L273 TraceCheckUtils]: 48: Hoare triple {8932#(<= 100000 ~SIZE~0)} assume !!(~v~0 < ~SIZE~0);call #t~mem3 := read~int(~#values~0.base, ~#values~0.offset + 4 * ~v~0, 4); {8932#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:02:03,306 INFO L256 TraceCheckUtils]: 49: Hoare triple {8932#(<= 100000 ~SIZE~0)} call #t~ret4 := elem_exists(~#set~0.base, ~#set~0.offset, ~n~0, #t~mem3); {8932#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:02:03,307 INFO L273 TraceCheckUtils]: 50: Hoare triple {8932#(<= 100000 ~SIZE~0)} ~set.base, ~set.offset := #in~set.base, #in~set.offset;~size := #in~size;~value := #in~value;havoc ~i~0;~i~0 := 0; {8932#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:02:03,307 INFO L273 TraceCheckUtils]: 51: Hoare triple {8932#(<= 100000 ~SIZE~0)} assume true; {8932#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:02:03,308 INFO L273 TraceCheckUtils]: 52: Hoare triple {8932#(<= 100000 ~SIZE~0)} assume !!(~i~0 < ~size);call #t~mem1 := read~int(~set.base, ~set.offset + 4 * ~i~0, 4); {8932#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:02:03,308 INFO L273 TraceCheckUtils]: 53: Hoare triple {8932#(<= 100000 ~SIZE~0)} assume #t~mem1 == ~value;havoc #t~mem1;#res := 1; {8932#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:02:03,309 INFO L273 TraceCheckUtils]: 54: Hoare triple {8932#(<= 100000 ~SIZE~0)} assume true; {8932#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:02:03,310 INFO L268 TraceCheckUtils]: 55: Hoare quadruple {8932#(<= 100000 ~SIZE~0)} {8932#(<= 100000 ~SIZE~0)} #132#return; {8932#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:02:03,311 INFO L273 TraceCheckUtils]: 56: Hoare triple {8932#(<= 100000 ~SIZE~0)} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {8932#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:02:03,311 INFO L273 TraceCheckUtils]: 57: Hoare triple {8932#(<= 100000 ~SIZE~0)} assume !(1 != #t~ret4);havoc #t~mem3;havoc #t~ret4; {8932#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:02:03,312 INFO L273 TraceCheckUtils]: 58: Hoare triple {8932#(<= 100000 ~SIZE~0)} #t~post2 := ~v~0;~v~0 := 1 + #t~post2;havoc #t~post2; {8932#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:02:03,312 INFO L273 TraceCheckUtils]: 59: Hoare triple {8932#(<= 100000 ~SIZE~0)} assume true; {8932#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:02:03,313 INFO L273 TraceCheckUtils]: 60: Hoare triple {8932#(<= 100000 ~SIZE~0)} assume !!(~v~0 < ~SIZE~0);call #t~mem3 := read~int(~#values~0.base, ~#values~0.offset + 4 * ~v~0, 4); {8932#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:02:03,314 INFO L256 TraceCheckUtils]: 61: Hoare triple {8932#(<= 100000 ~SIZE~0)} call #t~ret4 := elem_exists(~#set~0.base, ~#set~0.offset, ~n~0, #t~mem3); {8932#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:02:03,314 INFO L273 TraceCheckUtils]: 62: Hoare triple {8932#(<= 100000 ~SIZE~0)} ~set.base, ~set.offset := #in~set.base, #in~set.offset;~size := #in~size;~value := #in~value;havoc ~i~0;~i~0 := 0; {8932#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:02:03,315 INFO L273 TraceCheckUtils]: 63: Hoare triple {8932#(<= 100000 ~SIZE~0)} assume true; {8932#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:02:03,316 INFO L273 TraceCheckUtils]: 64: Hoare triple {8932#(<= 100000 ~SIZE~0)} assume !!(~i~0 < ~size);call #t~mem1 := read~int(~set.base, ~set.offset + 4 * ~i~0, 4); {8932#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:02:03,316 INFO L273 TraceCheckUtils]: 65: Hoare triple {8932#(<= 100000 ~SIZE~0)} assume #t~mem1 == ~value;havoc #t~mem1;#res := 1; {8932#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:02:03,317 INFO L273 TraceCheckUtils]: 66: Hoare triple {8932#(<= 100000 ~SIZE~0)} assume true; {8932#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:02:03,318 INFO L268 TraceCheckUtils]: 67: Hoare quadruple {8932#(<= 100000 ~SIZE~0)} {8932#(<= 100000 ~SIZE~0)} #132#return; {8932#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:02:03,318 INFO L273 TraceCheckUtils]: 68: Hoare triple {8932#(<= 100000 ~SIZE~0)} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {8932#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:02:03,319 INFO L273 TraceCheckUtils]: 69: Hoare triple {8932#(<= 100000 ~SIZE~0)} assume !(1 != #t~ret4);havoc #t~mem3;havoc #t~ret4; {8932#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:02:03,320 INFO L273 TraceCheckUtils]: 70: Hoare triple {8932#(<= 100000 ~SIZE~0)} #t~post2 := ~v~0;~v~0 := 1 + #t~post2;havoc #t~post2; {8932#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:02:03,320 INFO L273 TraceCheckUtils]: 71: Hoare triple {8932#(<= 100000 ~SIZE~0)} assume true; {8932#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:02:03,321 INFO L273 TraceCheckUtils]: 72: Hoare triple {8932#(<= 100000 ~SIZE~0)} assume !!(~v~0 < ~SIZE~0);call #t~mem3 := read~int(~#values~0.base, ~#values~0.offset + 4 * ~v~0, 4); {8932#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:02:03,322 INFO L256 TraceCheckUtils]: 73: Hoare triple {8932#(<= 100000 ~SIZE~0)} call #t~ret4 := elem_exists(~#set~0.base, ~#set~0.offset, ~n~0, #t~mem3); {8932#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:02:03,322 INFO L273 TraceCheckUtils]: 74: Hoare triple {8932#(<= 100000 ~SIZE~0)} ~set.base, ~set.offset := #in~set.base, #in~set.offset;~size := #in~size;~value := #in~value;havoc ~i~0;~i~0 := 0; {8932#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:02:03,323 INFO L273 TraceCheckUtils]: 75: Hoare triple {8932#(<= 100000 ~SIZE~0)} assume true; {8932#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:02:03,323 INFO L273 TraceCheckUtils]: 76: Hoare triple {8932#(<= 100000 ~SIZE~0)} assume !!(~i~0 < ~size);call #t~mem1 := read~int(~set.base, ~set.offset + 4 * ~i~0, 4); {8932#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:02:03,324 INFO L273 TraceCheckUtils]: 77: Hoare triple {8932#(<= 100000 ~SIZE~0)} assume #t~mem1 == ~value;havoc #t~mem1;#res := 1; {8932#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:02:03,324 INFO L273 TraceCheckUtils]: 78: Hoare triple {8932#(<= 100000 ~SIZE~0)} assume true; {8932#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:02:03,326 INFO L268 TraceCheckUtils]: 79: Hoare quadruple {8932#(<= 100000 ~SIZE~0)} {8932#(<= 100000 ~SIZE~0)} #132#return; {8932#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:02:03,326 INFO L273 TraceCheckUtils]: 80: Hoare triple {8932#(<= 100000 ~SIZE~0)} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {8932#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:02:03,327 INFO L273 TraceCheckUtils]: 81: Hoare triple {8932#(<= 100000 ~SIZE~0)} assume !(1 != #t~ret4);havoc #t~mem3;havoc #t~ret4; {8932#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:02:03,327 INFO L273 TraceCheckUtils]: 82: Hoare triple {8932#(<= 100000 ~SIZE~0)} #t~post2 := ~v~0;~v~0 := 1 + #t~post2;havoc #t~post2; {8932#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:02:03,328 INFO L273 TraceCheckUtils]: 83: Hoare triple {8932#(<= 100000 ~SIZE~0)} assume true; {8932#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:02:03,328 INFO L273 TraceCheckUtils]: 84: Hoare triple {8932#(<= 100000 ~SIZE~0)} assume !!(~v~0 < ~SIZE~0);call #t~mem3 := read~int(~#values~0.base, ~#values~0.offset + 4 * ~v~0, 4); {8932#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:02:03,330 INFO L256 TraceCheckUtils]: 85: Hoare triple {8932#(<= 100000 ~SIZE~0)} call #t~ret4 := elem_exists(~#set~0.base, ~#set~0.offset, ~n~0, #t~mem3); {8932#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:02:03,330 INFO L273 TraceCheckUtils]: 86: Hoare triple {8932#(<= 100000 ~SIZE~0)} ~set.base, ~set.offset := #in~set.base, #in~set.offset;~size := #in~size;~value := #in~value;havoc ~i~0;~i~0 := 0; {8932#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:02:03,331 INFO L273 TraceCheckUtils]: 87: Hoare triple {8932#(<= 100000 ~SIZE~0)} assume true; {8932#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:02:03,331 INFO L273 TraceCheckUtils]: 88: Hoare triple {8932#(<= 100000 ~SIZE~0)} assume !!(~i~0 < ~size);call #t~mem1 := read~int(~set.base, ~set.offset + 4 * ~i~0, 4); {8932#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:02:03,332 INFO L273 TraceCheckUtils]: 89: Hoare triple {8932#(<= 100000 ~SIZE~0)} assume #t~mem1 == ~value;havoc #t~mem1;#res := 1; {8932#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:02:03,332 INFO L273 TraceCheckUtils]: 90: Hoare triple {8932#(<= 100000 ~SIZE~0)} assume true; {8932#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:02:03,334 INFO L268 TraceCheckUtils]: 91: Hoare quadruple {8932#(<= 100000 ~SIZE~0)} {8932#(<= 100000 ~SIZE~0)} #132#return; {8932#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:02:03,334 INFO L273 TraceCheckUtils]: 92: Hoare triple {8932#(<= 100000 ~SIZE~0)} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {8932#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:02:03,335 INFO L273 TraceCheckUtils]: 93: Hoare triple {8932#(<= 100000 ~SIZE~0)} assume !(1 != #t~ret4);havoc #t~mem3;havoc #t~ret4; {8932#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:02:03,335 INFO L273 TraceCheckUtils]: 94: Hoare triple {8932#(<= 100000 ~SIZE~0)} #t~post2 := ~v~0;~v~0 := 1 + #t~post2;havoc #t~post2; {8932#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:02:03,336 INFO L273 TraceCheckUtils]: 95: Hoare triple {8932#(<= 100000 ~SIZE~0)} assume true; {8932#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:02:03,336 INFO L273 TraceCheckUtils]: 96: Hoare triple {8932#(<= 100000 ~SIZE~0)} assume !!(~v~0 < ~SIZE~0);call #t~mem3 := read~int(~#values~0.base, ~#values~0.offset + 4 * ~v~0, 4); {8932#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:02:03,337 INFO L256 TraceCheckUtils]: 97: Hoare triple {8932#(<= 100000 ~SIZE~0)} call #t~ret4 := elem_exists(~#set~0.base, ~#set~0.offset, ~n~0, #t~mem3); {8932#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:02:03,338 INFO L273 TraceCheckUtils]: 98: Hoare triple {8932#(<= 100000 ~SIZE~0)} ~set.base, ~set.offset := #in~set.base, #in~set.offset;~size := #in~size;~value := #in~value;havoc ~i~0;~i~0 := 0; {8932#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:02:03,339 INFO L273 TraceCheckUtils]: 99: Hoare triple {8932#(<= 100000 ~SIZE~0)} assume true; {8932#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:02:03,339 INFO L273 TraceCheckUtils]: 100: Hoare triple {8932#(<= 100000 ~SIZE~0)} assume !!(~i~0 < ~size);call #t~mem1 := read~int(~set.base, ~set.offset + 4 * ~i~0, 4); {8932#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:02:03,340 INFO L273 TraceCheckUtils]: 101: Hoare triple {8932#(<= 100000 ~SIZE~0)} assume #t~mem1 == ~value;havoc #t~mem1;#res := 1; {8932#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:02:03,340 INFO L273 TraceCheckUtils]: 102: Hoare triple {8932#(<= 100000 ~SIZE~0)} assume true; {8932#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:02:03,342 INFO L268 TraceCheckUtils]: 103: Hoare quadruple {8932#(<= 100000 ~SIZE~0)} {8932#(<= 100000 ~SIZE~0)} #132#return; {8932#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:02:03,342 INFO L273 TraceCheckUtils]: 104: Hoare triple {8932#(<= 100000 ~SIZE~0)} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {8932#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:02:03,343 INFO L273 TraceCheckUtils]: 105: Hoare triple {8932#(<= 100000 ~SIZE~0)} assume !(1 != #t~ret4);havoc #t~mem3;havoc #t~ret4; {8932#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:02:03,343 INFO L273 TraceCheckUtils]: 106: Hoare triple {8932#(<= 100000 ~SIZE~0)} #t~post2 := ~v~0;~v~0 := 1 + #t~post2;havoc #t~post2; {8932#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:02:03,344 INFO L273 TraceCheckUtils]: 107: Hoare triple {8932#(<= 100000 ~SIZE~0)} assume true; {8932#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:02:03,344 INFO L273 TraceCheckUtils]: 108: Hoare triple {8932#(<= 100000 ~SIZE~0)} assume !(~v~0 < ~SIZE~0); {8932#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:02:03,345 INFO L273 TraceCheckUtils]: 109: Hoare triple {8932#(<= 100000 ~SIZE~0)} ~i~1 := 0; {9272#(and (<= main_~i~1 0) (<= 100000 ~SIZE~0))} is VALID [2018-11-18 23:02:03,345 INFO L273 TraceCheckUtils]: 110: Hoare triple {9272#(and (<= main_~i~1 0) (<= 100000 ~SIZE~0))} assume true; {9272#(and (<= main_~i~1 0) (<= 100000 ~SIZE~0))} is VALID [2018-11-18 23:02:03,346 INFO L273 TraceCheckUtils]: 111: Hoare triple {9272#(and (<= main_~i~1 0) (<= 100000 ~SIZE~0))} assume !!(~i~1 < ~SIZE~0 && 1 != ~found~0);call #t~mem8 := read~int(~#set~0.base, ~#set~0.offset + 4 * ~i~1, 4); {9272#(and (<= main_~i~1 0) (<= 100000 ~SIZE~0))} is VALID [2018-11-18 23:02:03,347 INFO L273 TraceCheckUtils]: 112: Hoare triple {9272#(and (<= main_~i~1 0) (<= 100000 ~SIZE~0))} assume !(#t~mem8 == ~element~0);havoc #t~mem8; {9272#(and (<= main_~i~1 0) (<= 100000 ~SIZE~0))} is VALID [2018-11-18 23:02:03,348 INFO L273 TraceCheckUtils]: 113: Hoare triple {9272#(and (<= main_~i~1 0) (<= 100000 ~SIZE~0))} #t~post7 := ~i~1;~i~1 := 1 + #t~post7;havoc #t~post7; {9285#(and (<= main_~i~1 1) (<= 100000 ~SIZE~0))} is VALID [2018-11-18 23:02:03,349 INFO L273 TraceCheckUtils]: 114: Hoare triple {9285#(and (<= main_~i~1 1) (<= 100000 ~SIZE~0))} assume true; {9285#(and (<= main_~i~1 1) (<= 100000 ~SIZE~0))} is VALID [2018-11-18 23:02:03,349 INFO L273 TraceCheckUtils]: 115: Hoare triple {9285#(and (<= main_~i~1 1) (<= 100000 ~SIZE~0))} assume !!(~i~1 < ~SIZE~0 && 1 != ~found~0);call #t~mem8 := read~int(~#set~0.base, ~#set~0.offset + 4 * ~i~1, 4); {9285#(and (<= main_~i~1 1) (<= 100000 ~SIZE~0))} is VALID [2018-11-18 23:02:03,368 INFO L273 TraceCheckUtils]: 116: Hoare triple {9285#(and (<= main_~i~1 1) (<= 100000 ~SIZE~0))} assume #t~mem8 == ~element~0;havoc #t~mem8;~found~0 := 1;~pos~0 := ~i~1; {9295#(and (<= main_~pos~0 1) (<= 100000 ~SIZE~0))} is VALID [2018-11-18 23:02:03,383 INFO L273 TraceCheckUtils]: 117: Hoare triple {9295#(and (<= main_~pos~0 1) (<= 100000 ~SIZE~0))} #t~post7 := ~i~1;~i~1 := 1 + #t~post7;havoc #t~post7; {9295#(and (<= main_~pos~0 1) (<= 100000 ~SIZE~0))} is VALID [2018-11-18 23:02:03,398 INFO L273 TraceCheckUtils]: 118: Hoare triple {9295#(and (<= main_~pos~0 1) (<= 100000 ~SIZE~0))} assume true; {9295#(and (<= main_~pos~0 1) (<= 100000 ~SIZE~0))} is VALID [2018-11-18 23:02:03,404 INFO L273 TraceCheckUtils]: 119: Hoare triple {9295#(and (<= main_~pos~0 1) (<= 100000 ~SIZE~0))} assume !(~i~1 < ~SIZE~0 && 1 != ~found~0); {9295#(and (<= main_~pos~0 1) (<= 100000 ~SIZE~0))} is VALID [2018-11-18 23:02:03,404 INFO L273 TraceCheckUtils]: 120: Hoare triple {9295#(and (<= main_~pos~0 1) (<= 100000 ~SIZE~0))} assume 1 == ~found~0;~i~1 := ~pos~0; {9285#(and (<= main_~i~1 1) (<= 100000 ~SIZE~0))} is VALID [2018-11-18 23:02:03,405 INFO L273 TraceCheckUtils]: 121: Hoare triple {9285#(and (<= main_~i~1 1) (<= 100000 ~SIZE~0))} assume true; {9285#(and (<= main_~i~1 1) (<= 100000 ~SIZE~0))} is VALID [2018-11-18 23:02:03,405 INFO L273 TraceCheckUtils]: 122: Hoare triple {9285#(and (<= main_~i~1 1) (<= 100000 ~SIZE~0))} assume !!(~i~1 < ~SIZE~0 - 1);call #t~mem10 := read~int(~#set~0.base, ~#set~0.offset + 4 * (1 + ~i~1), 4);call write~int(#t~mem10, ~#set~0.base, ~#set~0.offset + 4 * ~i~1, 4);havoc #t~mem10; {9285#(and (<= main_~i~1 1) (<= 100000 ~SIZE~0))} is VALID [2018-11-18 23:02:03,406 INFO L273 TraceCheckUtils]: 123: Hoare triple {9285#(and (<= main_~i~1 1) (<= 100000 ~SIZE~0))} #t~post9 := ~i~1;~i~1 := 1 + #t~post9;havoc #t~post9; {9317#(and (<= main_~i~1 2) (<= 100000 ~SIZE~0))} is VALID [2018-11-18 23:02:03,406 INFO L273 TraceCheckUtils]: 124: Hoare triple {9317#(and (<= main_~i~1 2) (<= 100000 ~SIZE~0))} assume true; {9317#(and (<= main_~i~1 2) (<= 100000 ~SIZE~0))} is VALID [2018-11-18 23:02:03,407 INFO L273 TraceCheckUtils]: 125: Hoare triple {9317#(and (<= main_~i~1 2) (<= 100000 ~SIZE~0))} assume !(~i~1 < ~SIZE~0 - 1); {8931#false} is VALID [2018-11-18 23:02:03,407 INFO L273 TraceCheckUtils]: 126: Hoare triple {8931#false} assume 1 == ~found~0;~i~1 := 0; {8931#false} is VALID [2018-11-18 23:02:03,407 INFO L273 TraceCheckUtils]: 127: Hoare triple {8931#false} assume true; {8931#false} is VALID [2018-11-18 23:02:03,407 INFO L273 TraceCheckUtils]: 128: Hoare triple {8931#false} assume !!(~i~1 < ~SIZE~0 - 1);call #t~mem12 := read~int(~#set~0.base, ~#set~0.offset + 4 * ~i~1, 4); {8931#false} is VALID [2018-11-18 23:02:03,407 INFO L256 TraceCheckUtils]: 129: Hoare triple {8931#false} call __VERIFIER_assert((if #t~mem12 != ~element~0 then 1 else 0)); {8931#false} is VALID [2018-11-18 23:02:03,407 INFO L273 TraceCheckUtils]: 130: Hoare triple {8931#false} ~cond := #in~cond; {8931#false} is VALID [2018-11-18 23:02:03,407 INFO L273 TraceCheckUtils]: 131: Hoare triple {8931#false} assume 0 == ~cond; {8931#false} is VALID [2018-11-18 23:02:03,408 INFO L273 TraceCheckUtils]: 132: Hoare triple {8931#false} assume !false; {8931#false} is VALID [2018-11-18 23:02:03,422 INFO L134 CoverageAnalysis]: Checked inductivity of 355 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 345 trivial. 0 not checked. [2018-11-18 23:02:03,446 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-18 23:02:03,447 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 7] total 16 [2018-11-18 23:02:03,447 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 133 [2018-11-18 23:02:03,448 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-18 23:02:03,448 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 16 states. [2018-11-18 23:02:03,583 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 134 edges. 134 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 23:02:03,584 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-11-18 23:02:03,584 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-11-18 23:02:03,584 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=167, Unknown=0, NotChecked=0, Total=240 [2018-11-18 23:02:03,585 INFO L87 Difference]: Start difference. First operand 151 states and 192 transitions. Second operand 16 states. [2018-11-18 23:02:06,770 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 23:02:06,771 INFO L93 Difference]: Finished difference Result 267 states and 333 transitions. [2018-11-18 23:02:06,771 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-11-18 23:02:06,771 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 133 [2018-11-18 23:02:06,771 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 23:02:06,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2018-11-18 23:02:06,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 253 transitions. [2018-11-18 23:02:06,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2018-11-18 23:02:06,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 253 transitions. [2018-11-18 23:02:06,779 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 19 states and 253 transitions. [2018-11-18 23:02:09,329 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 253 edges. 253 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 23:02:09,337 INFO L225 Difference]: With dead ends: 267 [2018-11-18 23:02:09,338 INFO L226 Difference]: Without dead ends: 220 [2018-11-18 23:02:09,339 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 155 GetRequests, 130 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 96 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=190, Invalid=512, Unknown=0, NotChecked=0, Total=702 [2018-11-18 23:02:09,339 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 220 states. [2018-11-18 23:02:12,671 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 220 to 161. [2018-11-18 23:02:12,671 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-18 23:02:12,671 INFO L82 GeneralOperation]: Start isEquivalent. First operand 220 states. Second operand 161 states. [2018-11-18 23:02:12,671 INFO L74 IsIncluded]: Start isIncluded. First operand 220 states. Second operand 161 states. [2018-11-18 23:02:12,672 INFO L87 Difference]: Start difference. First operand 220 states. Second operand 161 states. [2018-11-18 23:02:12,680 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 23:02:12,681 INFO L93 Difference]: Finished difference Result 220 states and 280 transitions. [2018-11-18 23:02:12,681 INFO L276 IsEmpty]: Start isEmpty. Operand 220 states and 280 transitions. [2018-11-18 23:02:12,682 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 23:02:12,683 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 23:02:12,683 INFO L74 IsIncluded]: Start isIncluded. First operand 161 states. Second operand 220 states. [2018-11-18 23:02:12,683 INFO L87 Difference]: Start difference. First operand 161 states. Second operand 220 states. [2018-11-18 23:02:12,690 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 23:02:12,691 INFO L93 Difference]: Finished difference Result 220 states and 280 transitions. [2018-11-18 23:02:12,691 INFO L276 IsEmpty]: Start isEmpty. Operand 220 states and 280 transitions. [2018-11-18 23:02:12,692 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 23:02:12,692 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 23:02:12,692 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-18 23:02:12,692 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-18 23:02:12,693 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 161 states. [2018-11-18 23:02:12,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161 states to 161 states and 207 transitions. [2018-11-18 23:02:12,698 INFO L78 Accepts]: Start accepts. Automaton has 161 states and 207 transitions. Word has length 133 [2018-11-18 23:02:12,698 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 23:02:12,699 INFO L480 AbstractCegarLoop]: Abstraction has 161 states and 207 transitions. [2018-11-18 23:02:12,699 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-11-18 23:02:12,699 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 207 transitions. [2018-11-18 23:02:12,701 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2018-11-18 23:02:12,701 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 23:02:12,701 INFO L375 BasicCegarLoop]: trace histogram [10, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 4, 3, 3, 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] [2018-11-18 23:02:12,702 INFO L423 AbstractCegarLoop]: === Iteration 15 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 23:02:12,702 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 23:02:12,702 INFO L82 PathProgramCache]: Analyzing trace with hash -1275433689, now seen corresponding path program 4 times [2018-11-18 23:02:12,702 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 23:02:12,702 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 23:02:12,703 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 23:02:12,703 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 23:02:12,704 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 23:02:12,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 23:02:13,699 INFO L256 TraceCheckUtils]: 0: Hoare triple {10365#true} call ULTIMATE.init(); {10365#true} is VALID [2018-11-18 23:02:13,700 INFO L273 TraceCheckUtils]: 1: Hoare triple {10365#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~SIZE~0 := 100000; {10367#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:02:13,700 INFO L273 TraceCheckUtils]: 2: Hoare triple {10367#(<= 100000 ~SIZE~0)} assume true; {10367#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:02:13,700 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {10367#(<= 100000 ~SIZE~0)} {10365#true} #128#return; {10367#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:02:13,701 INFO L256 TraceCheckUtils]: 4: Hoare triple {10367#(<= 100000 ~SIZE~0)} call #t~ret13 := main(); {10367#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:02:13,701 INFO L273 TraceCheckUtils]: 5: Hoare triple {10367#(<= 100000 ~SIZE~0)} havoc ~i~1;havoc ~pos~0;~n~0 := 0;~found~0 := 0;call ~#set~0.base, ~#set~0.offset := #Ultimate.alloc(4 * ~SIZE~0);call ~#values~0.base, ~#values~0.offset := #Ultimate.alloc(4 * ~SIZE~0);havoc ~element~0;havoc ~v~0;~v~0 := 0; {10368#(and (= main_~v~0 0) (<= 100000 ~SIZE~0))} is VALID [2018-11-18 23:02:13,702 INFO L273 TraceCheckUtils]: 6: Hoare triple {10368#(and (= main_~v~0 0) (<= 100000 ~SIZE~0))} assume true; {10368#(and (= main_~v~0 0) (<= 100000 ~SIZE~0))} is VALID [2018-11-18 23:02:13,702 INFO L273 TraceCheckUtils]: 7: Hoare triple {10368#(and (= main_~v~0 0) (<= 100000 ~SIZE~0))} assume !!(~v~0 < ~SIZE~0);call #t~mem3 := read~int(~#values~0.base, ~#values~0.offset + 4 * ~v~0, 4); {10368#(and (= main_~v~0 0) (<= 100000 ~SIZE~0))} is VALID [2018-11-18 23:02:13,703 INFO L256 TraceCheckUtils]: 8: Hoare triple {10368#(and (= main_~v~0 0) (<= 100000 ~SIZE~0))} call #t~ret4 := elem_exists(~#set~0.base, ~#set~0.offset, ~n~0, #t~mem3); {10365#true} is VALID [2018-11-18 23:02:13,703 INFO L273 TraceCheckUtils]: 9: Hoare triple {10365#true} ~set.base, ~set.offset := #in~set.base, #in~set.offset;~size := #in~size;~value := #in~value;havoc ~i~0;~i~0 := 0; {10365#true} is VALID [2018-11-18 23:02:13,703 INFO L273 TraceCheckUtils]: 10: Hoare triple {10365#true} assume true; {10365#true} is VALID [2018-11-18 23:02:13,703 INFO L273 TraceCheckUtils]: 11: Hoare triple {10365#true} assume !(~i~0 < ~size); {10365#true} is VALID [2018-11-18 23:02:13,703 INFO L273 TraceCheckUtils]: 12: Hoare triple {10365#true} #res := 0; {10365#true} is VALID [2018-11-18 23:02:13,704 INFO L273 TraceCheckUtils]: 13: Hoare triple {10365#true} assume true; {10365#true} is VALID [2018-11-18 23:02:13,705 INFO L268 TraceCheckUtils]: 14: Hoare quadruple {10365#true} {10368#(and (= main_~v~0 0) (<= 100000 ~SIZE~0))} #132#return; {10368#(and (= main_~v~0 0) (<= 100000 ~SIZE~0))} is VALID [2018-11-18 23:02:13,705 INFO L273 TraceCheckUtils]: 15: Hoare triple {10368#(and (= main_~v~0 0) (<= 100000 ~SIZE~0))} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {10368#(and (= main_~v~0 0) (<= 100000 ~SIZE~0))} is VALID [2018-11-18 23:02:13,706 INFO L273 TraceCheckUtils]: 16: Hoare triple {10368#(and (= main_~v~0 0) (<= 100000 ~SIZE~0))} assume 1 != #t~ret4;havoc #t~mem3;havoc #t~ret4;call #t~mem5 := read~int(~#values~0.base, ~#values~0.offset + 4 * ~v~0, 4); {10368#(and (= main_~v~0 0) (<= 100000 ~SIZE~0))} is VALID [2018-11-18 23:02:13,706 INFO L256 TraceCheckUtils]: 17: Hoare triple {10368#(and (= main_~v~0 0) (<= 100000 ~SIZE~0))} call #t~ret6 := insert(~#set~0.base, ~#set~0.offset, ~n~0, #t~mem5); {10365#true} is VALID [2018-11-18 23:02:13,706 INFO L273 TraceCheckUtils]: 18: Hoare triple {10365#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; {10365#true} is VALID [2018-11-18 23:02:13,706 INFO L273 TraceCheckUtils]: 19: Hoare triple {10365#true} assume true; {10365#true} is VALID [2018-11-18 23:02:13,707 INFO L268 TraceCheckUtils]: 20: Hoare quadruple {10365#true} {10368#(and (= main_~v~0 0) (<= 100000 ~SIZE~0))} #134#return; {10368#(and (= main_~v~0 0) (<= 100000 ~SIZE~0))} is VALID [2018-11-18 23:02:13,707 INFO L273 TraceCheckUtils]: 21: Hoare triple {10368#(and (= main_~v~0 0) (<= 100000 ~SIZE~0))} assume -2147483648 <= #t~ret6 && #t~ret6 <= 2147483647;~n~0 := #t~ret6;havoc #t~ret6;havoc #t~mem5; {10368#(and (= main_~v~0 0) (<= 100000 ~SIZE~0))} is VALID [2018-11-18 23:02:13,708 INFO L273 TraceCheckUtils]: 22: Hoare triple {10368#(and (= main_~v~0 0) (<= 100000 ~SIZE~0))} #t~post2 := ~v~0;~v~0 := 1 + #t~post2;havoc #t~post2; {10369#(<= (+ main_~v~0 99999) ~SIZE~0)} is VALID [2018-11-18 23:02:13,709 INFO L273 TraceCheckUtils]: 23: Hoare triple {10369#(<= (+ main_~v~0 99999) ~SIZE~0)} assume true; {10369#(<= (+ main_~v~0 99999) ~SIZE~0)} is VALID [2018-11-18 23:02:13,719 INFO L273 TraceCheckUtils]: 24: Hoare triple {10369#(<= (+ main_~v~0 99999) ~SIZE~0)} assume !!(~v~0 < ~SIZE~0);call #t~mem3 := read~int(~#values~0.base, ~#values~0.offset + 4 * ~v~0, 4); {10369#(<= (+ main_~v~0 99999) ~SIZE~0)} is VALID [2018-11-18 23:02:13,720 INFO L256 TraceCheckUtils]: 25: Hoare triple {10369#(<= (+ main_~v~0 99999) ~SIZE~0)} call #t~ret4 := elem_exists(~#set~0.base, ~#set~0.offset, ~n~0, #t~mem3); {10365#true} is VALID [2018-11-18 23:02:13,720 INFO L273 TraceCheckUtils]: 26: Hoare triple {10365#true} ~set.base, ~set.offset := #in~set.base, #in~set.offset;~size := #in~size;~value := #in~value;havoc ~i~0;~i~0 := 0; {10365#true} is VALID [2018-11-18 23:02:13,720 INFO L273 TraceCheckUtils]: 27: Hoare triple {10365#true} assume true; {10365#true} is VALID [2018-11-18 23:02:13,720 INFO L273 TraceCheckUtils]: 28: Hoare triple {10365#true} assume !!(~i~0 < ~size);call #t~mem1 := read~int(~set.base, ~set.offset + 4 * ~i~0, 4); {10365#true} is VALID [2018-11-18 23:02:13,720 INFO L273 TraceCheckUtils]: 29: Hoare triple {10365#true} assume #t~mem1 == ~value;havoc #t~mem1;#res := 1; {10365#true} is VALID [2018-11-18 23:02:13,720 INFO L273 TraceCheckUtils]: 30: Hoare triple {10365#true} assume true; {10365#true} is VALID [2018-11-18 23:02:13,721 INFO L268 TraceCheckUtils]: 31: Hoare quadruple {10365#true} {10369#(<= (+ main_~v~0 99999) ~SIZE~0)} #132#return; {10369#(<= (+ main_~v~0 99999) ~SIZE~0)} is VALID [2018-11-18 23:02:13,722 INFO L273 TraceCheckUtils]: 32: Hoare triple {10369#(<= (+ main_~v~0 99999) ~SIZE~0)} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {10369#(<= (+ main_~v~0 99999) ~SIZE~0)} is VALID [2018-11-18 23:02:13,722 INFO L273 TraceCheckUtils]: 33: Hoare triple {10369#(<= (+ main_~v~0 99999) ~SIZE~0)} assume !(1 != #t~ret4);havoc #t~mem3;havoc #t~ret4; {10369#(<= (+ main_~v~0 99999) ~SIZE~0)} is VALID [2018-11-18 23:02:13,722 INFO L273 TraceCheckUtils]: 34: Hoare triple {10369#(<= (+ main_~v~0 99999) ~SIZE~0)} #t~post2 := ~v~0;~v~0 := 1 + #t~post2;havoc #t~post2; {10370#(<= (+ main_~v~0 99998) ~SIZE~0)} is VALID [2018-11-18 23:02:13,723 INFO L273 TraceCheckUtils]: 35: Hoare triple {10370#(<= (+ main_~v~0 99998) ~SIZE~0)} assume true; {10370#(<= (+ main_~v~0 99998) ~SIZE~0)} is VALID [2018-11-18 23:02:13,723 INFO L273 TraceCheckUtils]: 36: Hoare triple {10370#(<= (+ main_~v~0 99998) ~SIZE~0)} assume !!(~v~0 < ~SIZE~0);call #t~mem3 := read~int(~#values~0.base, ~#values~0.offset + 4 * ~v~0, 4); {10370#(<= (+ main_~v~0 99998) ~SIZE~0)} is VALID [2018-11-18 23:02:13,723 INFO L256 TraceCheckUtils]: 37: Hoare triple {10370#(<= (+ main_~v~0 99998) ~SIZE~0)} call #t~ret4 := elem_exists(~#set~0.base, ~#set~0.offset, ~n~0, #t~mem3); {10365#true} is VALID [2018-11-18 23:02:13,723 INFO L273 TraceCheckUtils]: 38: Hoare triple {10365#true} ~set.base, ~set.offset := #in~set.base, #in~set.offset;~size := #in~size;~value := #in~value;havoc ~i~0;~i~0 := 0; {10365#true} is VALID [2018-11-18 23:02:13,723 INFO L273 TraceCheckUtils]: 39: Hoare triple {10365#true} assume true; {10365#true} is VALID [2018-11-18 23:02:13,724 INFO L273 TraceCheckUtils]: 40: Hoare triple {10365#true} assume !!(~i~0 < ~size);call #t~mem1 := read~int(~set.base, ~set.offset + 4 * ~i~0, 4); {10365#true} is VALID [2018-11-18 23:02:13,724 INFO L273 TraceCheckUtils]: 41: Hoare triple {10365#true} assume #t~mem1 == ~value;havoc #t~mem1;#res := 1; {10365#true} is VALID [2018-11-18 23:02:13,724 INFO L273 TraceCheckUtils]: 42: Hoare triple {10365#true} assume true; {10365#true} is VALID [2018-11-18 23:02:13,725 INFO L268 TraceCheckUtils]: 43: Hoare quadruple {10365#true} {10370#(<= (+ main_~v~0 99998) ~SIZE~0)} #132#return; {10370#(<= (+ main_~v~0 99998) ~SIZE~0)} is VALID [2018-11-18 23:02:13,725 INFO L273 TraceCheckUtils]: 44: Hoare triple {10370#(<= (+ main_~v~0 99998) ~SIZE~0)} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {10370#(<= (+ main_~v~0 99998) ~SIZE~0)} is VALID [2018-11-18 23:02:13,725 INFO L273 TraceCheckUtils]: 45: Hoare triple {10370#(<= (+ main_~v~0 99998) ~SIZE~0)} assume !(1 != #t~ret4);havoc #t~mem3;havoc #t~ret4; {10370#(<= (+ main_~v~0 99998) ~SIZE~0)} is VALID [2018-11-18 23:02:13,726 INFO L273 TraceCheckUtils]: 46: Hoare triple {10370#(<= (+ main_~v~0 99998) ~SIZE~0)} #t~post2 := ~v~0;~v~0 := 1 + #t~post2;havoc #t~post2; {10371#(<= (+ main_~v~0 99997) ~SIZE~0)} is VALID [2018-11-18 23:02:13,726 INFO L273 TraceCheckUtils]: 47: Hoare triple {10371#(<= (+ main_~v~0 99997) ~SIZE~0)} assume true; {10371#(<= (+ main_~v~0 99997) ~SIZE~0)} is VALID [2018-11-18 23:02:13,727 INFO L273 TraceCheckUtils]: 48: Hoare triple {10371#(<= (+ main_~v~0 99997) ~SIZE~0)} assume !!(~v~0 < ~SIZE~0);call #t~mem3 := read~int(~#values~0.base, ~#values~0.offset + 4 * ~v~0, 4); {10371#(<= (+ main_~v~0 99997) ~SIZE~0)} is VALID [2018-11-18 23:02:13,727 INFO L256 TraceCheckUtils]: 49: Hoare triple {10371#(<= (+ main_~v~0 99997) ~SIZE~0)} call #t~ret4 := elem_exists(~#set~0.base, ~#set~0.offset, ~n~0, #t~mem3); {10365#true} is VALID [2018-11-18 23:02:13,727 INFO L273 TraceCheckUtils]: 50: Hoare triple {10365#true} ~set.base, ~set.offset := #in~set.base, #in~set.offset;~size := #in~size;~value := #in~value;havoc ~i~0;~i~0 := 0; {10365#true} is VALID [2018-11-18 23:02:13,727 INFO L273 TraceCheckUtils]: 51: Hoare triple {10365#true} assume true; {10365#true} is VALID [2018-11-18 23:02:13,727 INFO L273 TraceCheckUtils]: 52: Hoare triple {10365#true} assume !!(~i~0 < ~size);call #t~mem1 := read~int(~set.base, ~set.offset + 4 * ~i~0, 4); {10365#true} is VALID [2018-11-18 23:02:13,728 INFO L273 TraceCheckUtils]: 53: Hoare triple {10365#true} assume #t~mem1 == ~value;havoc #t~mem1;#res := 1; {10365#true} is VALID [2018-11-18 23:02:13,728 INFO L273 TraceCheckUtils]: 54: Hoare triple {10365#true} assume true; {10365#true} is VALID [2018-11-18 23:02:13,729 INFO L268 TraceCheckUtils]: 55: Hoare quadruple {10365#true} {10371#(<= (+ main_~v~0 99997) ~SIZE~0)} #132#return; {10371#(<= (+ main_~v~0 99997) ~SIZE~0)} is VALID [2018-11-18 23:02:13,730 INFO L273 TraceCheckUtils]: 56: Hoare triple {10371#(<= (+ main_~v~0 99997) ~SIZE~0)} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {10371#(<= (+ main_~v~0 99997) ~SIZE~0)} is VALID [2018-11-18 23:02:13,730 INFO L273 TraceCheckUtils]: 57: Hoare triple {10371#(<= (+ main_~v~0 99997) ~SIZE~0)} assume !(1 != #t~ret4);havoc #t~mem3;havoc #t~ret4; {10371#(<= (+ main_~v~0 99997) ~SIZE~0)} is VALID [2018-11-18 23:02:13,731 INFO L273 TraceCheckUtils]: 58: Hoare triple {10371#(<= (+ main_~v~0 99997) ~SIZE~0)} #t~post2 := ~v~0;~v~0 := 1 + #t~post2;havoc #t~post2; {10372#(<= (+ main_~v~0 99996) ~SIZE~0)} is VALID [2018-11-18 23:02:13,731 INFO L273 TraceCheckUtils]: 59: Hoare triple {10372#(<= (+ main_~v~0 99996) ~SIZE~0)} assume true; {10372#(<= (+ main_~v~0 99996) ~SIZE~0)} is VALID [2018-11-18 23:02:13,732 INFO L273 TraceCheckUtils]: 60: Hoare triple {10372#(<= (+ main_~v~0 99996) ~SIZE~0)} assume !!(~v~0 < ~SIZE~0);call #t~mem3 := read~int(~#values~0.base, ~#values~0.offset + 4 * ~v~0, 4); {10372#(<= (+ main_~v~0 99996) ~SIZE~0)} is VALID [2018-11-18 23:02:13,732 INFO L256 TraceCheckUtils]: 61: Hoare triple {10372#(<= (+ main_~v~0 99996) ~SIZE~0)} call #t~ret4 := elem_exists(~#set~0.base, ~#set~0.offset, ~n~0, #t~mem3); {10365#true} is VALID [2018-11-18 23:02:13,732 INFO L273 TraceCheckUtils]: 62: Hoare triple {10365#true} ~set.base, ~set.offset := #in~set.base, #in~set.offset;~size := #in~size;~value := #in~value;havoc ~i~0;~i~0 := 0; {10365#true} is VALID [2018-11-18 23:02:13,733 INFO L273 TraceCheckUtils]: 63: Hoare triple {10365#true} assume true; {10365#true} is VALID [2018-11-18 23:02:13,733 INFO L273 TraceCheckUtils]: 64: Hoare triple {10365#true} assume !!(~i~0 < ~size);call #t~mem1 := read~int(~set.base, ~set.offset + 4 * ~i~0, 4); {10365#true} is VALID [2018-11-18 23:02:13,733 INFO L273 TraceCheckUtils]: 65: Hoare triple {10365#true} assume #t~mem1 == ~value;havoc #t~mem1;#res := 1; {10365#true} is VALID [2018-11-18 23:02:13,733 INFO L273 TraceCheckUtils]: 66: Hoare triple {10365#true} assume true; {10365#true} is VALID [2018-11-18 23:02:13,734 INFO L268 TraceCheckUtils]: 67: Hoare quadruple {10365#true} {10372#(<= (+ main_~v~0 99996) ~SIZE~0)} #132#return; {10372#(<= (+ main_~v~0 99996) ~SIZE~0)} is VALID [2018-11-18 23:02:13,735 INFO L273 TraceCheckUtils]: 68: Hoare triple {10372#(<= (+ main_~v~0 99996) ~SIZE~0)} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {10372#(<= (+ main_~v~0 99996) ~SIZE~0)} is VALID [2018-11-18 23:02:13,735 INFO L273 TraceCheckUtils]: 69: Hoare triple {10372#(<= (+ main_~v~0 99996) ~SIZE~0)} assume !(1 != #t~ret4);havoc #t~mem3;havoc #t~ret4; {10372#(<= (+ main_~v~0 99996) ~SIZE~0)} is VALID [2018-11-18 23:02:13,735 INFO L273 TraceCheckUtils]: 70: Hoare triple {10372#(<= (+ main_~v~0 99996) ~SIZE~0)} #t~post2 := ~v~0;~v~0 := 1 + #t~post2;havoc #t~post2; {10373#(<= (+ main_~v~0 99995) ~SIZE~0)} is VALID [2018-11-18 23:02:13,736 INFO L273 TraceCheckUtils]: 71: Hoare triple {10373#(<= (+ main_~v~0 99995) ~SIZE~0)} assume true; {10373#(<= (+ main_~v~0 99995) ~SIZE~0)} is VALID [2018-11-18 23:02:13,736 INFO L273 TraceCheckUtils]: 72: Hoare triple {10373#(<= (+ main_~v~0 99995) ~SIZE~0)} assume !!(~v~0 < ~SIZE~0);call #t~mem3 := read~int(~#values~0.base, ~#values~0.offset + 4 * ~v~0, 4); {10373#(<= (+ main_~v~0 99995) ~SIZE~0)} is VALID [2018-11-18 23:02:13,736 INFO L256 TraceCheckUtils]: 73: Hoare triple {10373#(<= (+ main_~v~0 99995) ~SIZE~0)} call #t~ret4 := elem_exists(~#set~0.base, ~#set~0.offset, ~n~0, #t~mem3); {10365#true} is VALID [2018-11-18 23:02:13,736 INFO L273 TraceCheckUtils]: 74: Hoare triple {10365#true} ~set.base, ~set.offset := #in~set.base, #in~set.offset;~size := #in~size;~value := #in~value;havoc ~i~0;~i~0 := 0; {10365#true} is VALID [2018-11-18 23:02:13,737 INFO L273 TraceCheckUtils]: 75: Hoare triple {10365#true} assume true; {10365#true} is VALID [2018-11-18 23:02:13,737 INFO L273 TraceCheckUtils]: 76: Hoare triple {10365#true} assume !!(~i~0 < ~size);call #t~mem1 := read~int(~set.base, ~set.offset + 4 * ~i~0, 4); {10365#true} is VALID [2018-11-18 23:02:13,737 INFO L273 TraceCheckUtils]: 77: Hoare triple {10365#true} assume #t~mem1 == ~value;havoc #t~mem1;#res := 1; {10365#true} is VALID [2018-11-18 23:02:13,737 INFO L273 TraceCheckUtils]: 78: Hoare triple {10365#true} assume true; {10365#true} is VALID [2018-11-18 23:02:13,738 INFO L268 TraceCheckUtils]: 79: Hoare quadruple {10365#true} {10373#(<= (+ main_~v~0 99995) ~SIZE~0)} #132#return; {10373#(<= (+ main_~v~0 99995) ~SIZE~0)} is VALID [2018-11-18 23:02:13,738 INFO L273 TraceCheckUtils]: 80: Hoare triple {10373#(<= (+ main_~v~0 99995) ~SIZE~0)} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {10373#(<= (+ main_~v~0 99995) ~SIZE~0)} is VALID [2018-11-18 23:02:13,738 INFO L273 TraceCheckUtils]: 81: Hoare triple {10373#(<= (+ main_~v~0 99995) ~SIZE~0)} assume !(1 != #t~ret4);havoc #t~mem3;havoc #t~ret4; {10373#(<= (+ main_~v~0 99995) ~SIZE~0)} is VALID [2018-11-18 23:02:13,739 INFO L273 TraceCheckUtils]: 82: Hoare triple {10373#(<= (+ main_~v~0 99995) ~SIZE~0)} #t~post2 := ~v~0;~v~0 := 1 + #t~post2;havoc #t~post2; {10374#(<= (+ main_~v~0 99994) ~SIZE~0)} is VALID [2018-11-18 23:02:13,740 INFO L273 TraceCheckUtils]: 83: Hoare triple {10374#(<= (+ main_~v~0 99994) ~SIZE~0)} assume true; {10374#(<= (+ main_~v~0 99994) ~SIZE~0)} is VALID [2018-11-18 23:02:13,740 INFO L273 TraceCheckUtils]: 84: Hoare triple {10374#(<= (+ main_~v~0 99994) ~SIZE~0)} assume !!(~v~0 < ~SIZE~0);call #t~mem3 := read~int(~#values~0.base, ~#values~0.offset + 4 * ~v~0, 4); {10374#(<= (+ main_~v~0 99994) ~SIZE~0)} is VALID [2018-11-18 23:02:13,740 INFO L256 TraceCheckUtils]: 85: Hoare triple {10374#(<= (+ main_~v~0 99994) ~SIZE~0)} call #t~ret4 := elem_exists(~#set~0.base, ~#set~0.offset, ~n~0, #t~mem3); {10365#true} is VALID [2018-11-18 23:02:13,741 INFO L273 TraceCheckUtils]: 86: Hoare triple {10365#true} ~set.base, ~set.offset := #in~set.base, #in~set.offset;~size := #in~size;~value := #in~value;havoc ~i~0;~i~0 := 0; {10365#true} is VALID [2018-11-18 23:02:13,741 INFO L273 TraceCheckUtils]: 87: Hoare triple {10365#true} assume true; {10365#true} is VALID [2018-11-18 23:02:13,741 INFO L273 TraceCheckUtils]: 88: Hoare triple {10365#true} assume !!(~i~0 < ~size);call #t~mem1 := read~int(~set.base, ~set.offset + 4 * ~i~0, 4); {10365#true} is VALID [2018-11-18 23:02:13,741 INFO L273 TraceCheckUtils]: 89: Hoare triple {10365#true} assume #t~mem1 == ~value;havoc #t~mem1;#res := 1; {10365#true} is VALID [2018-11-18 23:02:13,741 INFO L273 TraceCheckUtils]: 90: Hoare triple {10365#true} assume true; {10365#true} is VALID [2018-11-18 23:02:13,743 INFO L268 TraceCheckUtils]: 91: Hoare quadruple {10365#true} {10374#(<= (+ main_~v~0 99994) ~SIZE~0)} #132#return; {10374#(<= (+ main_~v~0 99994) ~SIZE~0)} is VALID [2018-11-18 23:02:13,743 INFO L273 TraceCheckUtils]: 92: Hoare triple {10374#(<= (+ main_~v~0 99994) ~SIZE~0)} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {10374#(<= (+ main_~v~0 99994) ~SIZE~0)} is VALID [2018-11-18 23:02:13,743 INFO L273 TraceCheckUtils]: 93: Hoare triple {10374#(<= (+ main_~v~0 99994) ~SIZE~0)} assume !(1 != #t~ret4);havoc #t~mem3;havoc #t~ret4; {10374#(<= (+ main_~v~0 99994) ~SIZE~0)} is VALID [2018-11-18 23:02:13,744 INFO L273 TraceCheckUtils]: 94: Hoare triple {10374#(<= (+ main_~v~0 99994) ~SIZE~0)} #t~post2 := ~v~0;~v~0 := 1 + #t~post2;havoc #t~post2; {10375#(<= (+ main_~v~0 99993) ~SIZE~0)} is VALID [2018-11-18 23:02:13,744 INFO L273 TraceCheckUtils]: 95: Hoare triple {10375#(<= (+ main_~v~0 99993) ~SIZE~0)} assume true; {10375#(<= (+ main_~v~0 99993) ~SIZE~0)} is VALID [2018-11-18 23:02:13,745 INFO L273 TraceCheckUtils]: 96: Hoare triple {10375#(<= (+ main_~v~0 99993) ~SIZE~0)} assume !!(~v~0 < ~SIZE~0);call #t~mem3 := read~int(~#values~0.base, ~#values~0.offset + 4 * ~v~0, 4); {10375#(<= (+ main_~v~0 99993) ~SIZE~0)} is VALID [2018-11-18 23:02:13,745 INFO L256 TraceCheckUtils]: 97: Hoare triple {10375#(<= (+ main_~v~0 99993) ~SIZE~0)} call #t~ret4 := elem_exists(~#set~0.base, ~#set~0.offset, ~n~0, #t~mem3); {10365#true} is VALID [2018-11-18 23:02:13,745 INFO L273 TraceCheckUtils]: 98: Hoare triple {10365#true} ~set.base, ~set.offset := #in~set.base, #in~set.offset;~size := #in~size;~value := #in~value;havoc ~i~0;~i~0 := 0; {10365#true} is VALID [2018-11-18 23:02:13,745 INFO L273 TraceCheckUtils]: 99: Hoare triple {10365#true} assume true; {10365#true} is VALID [2018-11-18 23:02:13,745 INFO L273 TraceCheckUtils]: 100: Hoare triple {10365#true} assume !!(~i~0 < ~size);call #t~mem1 := read~int(~set.base, ~set.offset + 4 * ~i~0, 4); {10365#true} is VALID [2018-11-18 23:02:13,745 INFO L273 TraceCheckUtils]: 101: Hoare triple {10365#true} assume #t~mem1 == ~value;havoc #t~mem1;#res := 1; {10365#true} is VALID [2018-11-18 23:02:13,745 INFO L273 TraceCheckUtils]: 102: Hoare triple {10365#true} assume true; {10365#true} is VALID [2018-11-18 23:02:13,747 INFO L268 TraceCheckUtils]: 103: Hoare quadruple {10365#true} {10375#(<= (+ main_~v~0 99993) ~SIZE~0)} #132#return; {10375#(<= (+ main_~v~0 99993) ~SIZE~0)} is VALID [2018-11-18 23:02:13,747 INFO L273 TraceCheckUtils]: 104: Hoare triple {10375#(<= (+ main_~v~0 99993) ~SIZE~0)} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {10375#(<= (+ main_~v~0 99993) ~SIZE~0)} is VALID [2018-11-18 23:02:13,748 INFO L273 TraceCheckUtils]: 105: Hoare triple {10375#(<= (+ main_~v~0 99993) ~SIZE~0)} assume !(1 != #t~ret4);havoc #t~mem3;havoc #t~ret4; {10375#(<= (+ main_~v~0 99993) ~SIZE~0)} is VALID [2018-11-18 23:02:13,748 INFO L273 TraceCheckUtils]: 106: Hoare triple {10375#(<= (+ main_~v~0 99993) ~SIZE~0)} #t~post2 := ~v~0;~v~0 := 1 + #t~post2;havoc #t~post2; {10376#(<= (+ main_~v~0 99992) ~SIZE~0)} is VALID [2018-11-18 23:02:13,749 INFO L273 TraceCheckUtils]: 107: Hoare triple {10376#(<= (+ main_~v~0 99992) ~SIZE~0)} assume true; {10376#(<= (+ main_~v~0 99992) ~SIZE~0)} is VALID [2018-11-18 23:02:13,750 INFO L273 TraceCheckUtils]: 108: Hoare triple {10376#(<= (+ main_~v~0 99992) ~SIZE~0)} assume !!(~v~0 < ~SIZE~0);call #t~mem3 := read~int(~#values~0.base, ~#values~0.offset + 4 * ~v~0, 4); {10376#(<= (+ main_~v~0 99992) ~SIZE~0)} is VALID [2018-11-18 23:02:13,750 INFO L256 TraceCheckUtils]: 109: Hoare triple {10376#(<= (+ main_~v~0 99992) ~SIZE~0)} call #t~ret4 := elem_exists(~#set~0.base, ~#set~0.offset, ~n~0, #t~mem3); {10365#true} is VALID [2018-11-18 23:02:13,750 INFO L273 TraceCheckUtils]: 110: Hoare triple {10365#true} ~set.base, ~set.offset := #in~set.base, #in~set.offset;~size := #in~size;~value := #in~value;havoc ~i~0;~i~0 := 0; {10365#true} is VALID [2018-11-18 23:02:13,750 INFO L273 TraceCheckUtils]: 111: Hoare triple {10365#true} assume true; {10365#true} is VALID [2018-11-18 23:02:13,750 INFO L273 TraceCheckUtils]: 112: Hoare triple {10365#true} assume !!(~i~0 < ~size);call #t~mem1 := read~int(~set.base, ~set.offset + 4 * ~i~0, 4); {10365#true} is VALID [2018-11-18 23:02:13,751 INFO L273 TraceCheckUtils]: 113: Hoare triple {10365#true} assume #t~mem1 == ~value;havoc #t~mem1;#res := 1; {10365#true} is VALID [2018-11-18 23:02:13,751 INFO L273 TraceCheckUtils]: 114: Hoare triple {10365#true} assume true; {10365#true} is VALID [2018-11-18 23:02:13,752 INFO L268 TraceCheckUtils]: 115: Hoare quadruple {10365#true} {10376#(<= (+ main_~v~0 99992) ~SIZE~0)} #132#return; {10376#(<= (+ main_~v~0 99992) ~SIZE~0)} is VALID [2018-11-18 23:02:13,752 INFO L273 TraceCheckUtils]: 116: Hoare triple {10376#(<= (+ main_~v~0 99992) ~SIZE~0)} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {10376#(<= (+ main_~v~0 99992) ~SIZE~0)} is VALID [2018-11-18 23:02:13,753 INFO L273 TraceCheckUtils]: 117: Hoare triple {10376#(<= (+ main_~v~0 99992) ~SIZE~0)} assume !(1 != #t~ret4);havoc #t~mem3;havoc #t~ret4; {10376#(<= (+ main_~v~0 99992) ~SIZE~0)} is VALID [2018-11-18 23:02:13,753 INFO L273 TraceCheckUtils]: 118: Hoare triple {10376#(<= (+ main_~v~0 99992) ~SIZE~0)} #t~post2 := ~v~0;~v~0 := 1 + #t~post2;havoc #t~post2; {10377#(<= (+ main_~v~0 99991) ~SIZE~0)} is VALID [2018-11-18 23:02:13,754 INFO L273 TraceCheckUtils]: 119: Hoare triple {10377#(<= (+ main_~v~0 99991) ~SIZE~0)} assume true; {10377#(<= (+ main_~v~0 99991) ~SIZE~0)} is VALID [2018-11-18 23:02:13,754 INFO L273 TraceCheckUtils]: 120: Hoare triple {10377#(<= (+ main_~v~0 99991) ~SIZE~0)} assume !(~v~0 < ~SIZE~0); {10366#false} is VALID [2018-11-18 23:02:13,754 INFO L273 TraceCheckUtils]: 121: Hoare triple {10366#false} ~i~1 := 0; {10366#false} is VALID [2018-11-18 23:02:13,754 INFO L273 TraceCheckUtils]: 122: Hoare triple {10366#false} assume true; {10366#false} is VALID [2018-11-18 23:02:13,754 INFO L273 TraceCheckUtils]: 123: Hoare triple {10366#false} assume !!(~i~1 < ~SIZE~0 && 1 != ~found~0);call #t~mem8 := read~int(~#set~0.base, ~#set~0.offset + 4 * ~i~1, 4); {10366#false} is VALID [2018-11-18 23:02:13,755 INFO L273 TraceCheckUtils]: 124: Hoare triple {10366#false} assume !(#t~mem8 == ~element~0);havoc #t~mem8; {10366#false} is VALID [2018-11-18 23:02:13,755 INFO L273 TraceCheckUtils]: 125: Hoare triple {10366#false} #t~post7 := ~i~1;~i~1 := 1 + #t~post7;havoc #t~post7; {10366#false} is VALID [2018-11-18 23:02:13,755 INFO L273 TraceCheckUtils]: 126: Hoare triple {10366#false} assume true; {10366#false} is VALID [2018-11-18 23:02:13,755 INFO L273 TraceCheckUtils]: 127: Hoare triple {10366#false} assume !!(~i~1 < ~SIZE~0 && 1 != ~found~0);call #t~mem8 := read~int(~#set~0.base, ~#set~0.offset + 4 * ~i~1, 4); {10366#false} is VALID [2018-11-18 23:02:13,755 INFO L273 TraceCheckUtils]: 128: Hoare triple {10366#false} assume !(#t~mem8 == ~element~0);havoc #t~mem8; {10366#false} is VALID [2018-11-18 23:02:13,755 INFO L273 TraceCheckUtils]: 129: Hoare triple {10366#false} #t~post7 := ~i~1;~i~1 := 1 + #t~post7;havoc #t~post7; {10366#false} is VALID [2018-11-18 23:02:13,755 INFO L273 TraceCheckUtils]: 130: Hoare triple {10366#false} assume true; {10366#false} is VALID [2018-11-18 23:02:13,756 INFO L273 TraceCheckUtils]: 131: Hoare triple {10366#false} assume !!(~i~1 < ~SIZE~0 && 1 != ~found~0);call #t~mem8 := read~int(~#set~0.base, ~#set~0.offset + 4 * ~i~1, 4); {10366#false} is VALID [2018-11-18 23:02:13,756 INFO L273 TraceCheckUtils]: 132: Hoare triple {10366#false} assume #t~mem8 == ~element~0;havoc #t~mem8;~found~0 := 1;~pos~0 := ~i~1; {10366#false} is VALID [2018-11-18 23:02:13,756 INFO L273 TraceCheckUtils]: 133: Hoare triple {10366#false} #t~post7 := ~i~1;~i~1 := 1 + #t~post7;havoc #t~post7; {10366#false} is VALID [2018-11-18 23:02:13,756 INFO L273 TraceCheckUtils]: 134: Hoare triple {10366#false} assume true; {10366#false} is VALID [2018-11-18 23:02:13,756 INFO L273 TraceCheckUtils]: 135: Hoare triple {10366#false} assume !(~i~1 < ~SIZE~0 && 1 != ~found~0); {10366#false} is VALID [2018-11-18 23:02:13,757 INFO L273 TraceCheckUtils]: 136: Hoare triple {10366#false} assume 1 == ~found~0;~i~1 := ~pos~0; {10366#false} is VALID [2018-11-18 23:02:13,757 INFO L273 TraceCheckUtils]: 137: Hoare triple {10366#false} assume true; {10366#false} is VALID [2018-11-18 23:02:13,757 INFO L273 TraceCheckUtils]: 138: Hoare triple {10366#false} assume !(~i~1 < ~SIZE~0 - 1); {10366#false} is VALID [2018-11-18 23:02:13,757 INFO L273 TraceCheckUtils]: 139: Hoare triple {10366#false} assume 1 == ~found~0;~i~1 := 0; {10366#false} is VALID [2018-11-18 23:02:13,757 INFO L273 TraceCheckUtils]: 140: Hoare triple {10366#false} assume true; {10366#false} is VALID [2018-11-18 23:02:13,757 INFO L273 TraceCheckUtils]: 141: Hoare triple {10366#false} assume !!(~i~1 < ~SIZE~0 - 1);call #t~mem12 := read~int(~#set~0.base, ~#set~0.offset + 4 * ~i~1, 4); {10366#false} is VALID [2018-11-18 23:02:13,757 INFO L256 TraceCheckUtils]: 142: Hoare triple {10366#false} call __VERIFIER_assert((if #t~mem12 != ~element~0 then 1 else 0)); {10366#false} is VALID [2018-11-18 23:02:13,758 INFO L273 TraceCheckUtils]: 143: Hoare triple {10366#false} ~cond := #in~cond; {10366#false} is VALID [2018-11-18 23:02:13,758 INFO L273 TraceCheckUtils]: 144: Hoare triple {10366#false} assume 0 == ~cond; {10366#false} is VALID [2018-11-18 23:02:13,758 INFO L273 TraceCheckUtils]: 145: Hoare triple {10366#false} assume !false; {10366#false} is VALID [2018-11-18 23:02:13,771 INFO L134 CoverageAnalysis]: Checked inductivity of 460 backedges. 0 proven. 234 refuted. 0 times theorem prover too weak. 226 trivial. 0 not checked. [2018-11-18 23:02:13,771 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 23:02:13,771 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-18 23:02:13,781 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-18 23:02:13,849 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-18 23:02:13,849 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-18 23:02:13,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 23:02:13,881 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 23:02:14,348 INFO L256 TraceCheckUtils]: 0: Hoare triple {10365#true} call ULTIMATE.init(); {10365#true} is VALID [2018-11-18 23:02:14,348 INFO L273 TraceCheckUtils]: 1: Hoare triple {10365#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~SIZE~0 := 100000; {10365#true} is VALID [2018-11-18 23:02:14,348 INFO L273 TraceCheckUtils]: 2: Hoare triple {10365#true} assume true; {10365#true} is VALID [2018-11-18 23:02:14,348 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {10365#true} {10365#true} #128#return; {10365#true} is VALID [2018-11-18 23:02:14,349 INFO L256 TraceCheckUtils]: 4: Hoare triple {10365#true} call #t~ret13 := main(); {10365#true} is VALID [2018-11-18 23:02:14,350 INFO L273 TraceCheckUtils]: 5: Hoare triple {10365#true} havoc ~i~1;havoc ~pos~0;~n~0 := 0;~found~0 := 0;call ~#set~0.base, ~#set~0.offset := #Ultimate.alloc(4 * ~SIZE~0);call ~#values~0.base, ~#values~0.offset := #Ultimate.alloc(4 * ~SIZE~0);havoc ~element~0;havoc ~v~0;~v~0 := 0; {10396#(<= 0 main_~v~0)} is VALID [2018-11-18 23:02:14,350 INFO L273 TraceCheckUtils]: 6: Hoare triple {10396#(<= 0 main_~v~0)} assume true; {10396#(<= 0 main_~v~0)} is VALID [2018-11-18 23:02:14,350 INFO L273 TraceCheckUtils]: 7: Hoare triple {10396#(<= 0 main_~v~0)} assume !!(~v~0 < ~SIZE~0);call #t~mem3 := read~int(~#values~0.base, ~#values~0.offset + 4 * ~v~0, 4); {10396#(<= 0 main_~v~0)} is VALID [2018-11-18 23:02:14,351 INFO L256 TraceCheckUtils]: 8: Hoare triple {10396#(<= 0 main_~v~0)} call #t~ret4 := elem_exists(~#set~0.base, ~#set~0.offset, ~n~0, #t~mem3); {10365#true} is VALID [2018-11-18 23:02:14,351 INFO L273 TraceCheckUtils]: 9: Hoare triple {10365#true} ~set.base, ~set.offset := #in~set.base, #in~set.offset;~size := #in~size;~value := #in~value;havoc ~i~0;~i~0 := 0; {10365#true} is VALID [2018-11-18 23:02:14,351 INFO L273 TraceCheckUtils]: 10: Hoare triple {10365#true} assume true; {10365#true} is VALID [2018-11-18 23:02:14,351 INFO L273 TraceCheckUtils]: 11: Hoare triple {10365#true} assume !(~i~0 < ~size); {10365#true} is VALID [2018-11-18 23:02:14,351 INFO L273 TraceCheckUtils]: 12: Hoare triple {10365#true} #res := 0; {10365#true} is VALID [2018-11-18 23:02:14,351 INFO L273 TraceCheckUtils]: 13: Hoare triple {10365#true} assume true; {10365#true} is VALID [2018-11-18 23:02:14,352 INFO L268 TraceCheckUtils]: 14: Hoare quadruple {10365#true} {10396#(<= 0 main_~v~0)} #132#return; {10396#(<= 0 main_~v~0)} is VALID [2018-11-18 23:02:14,352 INFO L273 TraceCheckUtils]: 15: Hoare triple {10396#(<= 0 main_~v~0)} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {10396#(<= 0 main_~v~0)} is VALID [2018-11-18 23:02:14,353 INFO L273 TraceCheckUtils]: 16: Hoare triple {10396#(<= 0 main_~v~0)} assume 1 != #t~ret4;havoc #t~mem3;havoc #t~ret4;call #t~mem5 := read~int(~#values~0.base, ~#values~0.offset + 4 * ~v~0, 4); {10396#(<= 0 main_~v~0)} is VALID [2018-11-18 23:02:14,353 INFO L256 TraceCheckUtils]: 17: Hoare triple {10396#(<= 0 main_~v~0)} call #t~ret6 := insert(~#set~0.base, ~#set~0.offset, ~n~0, #t~mem5); {10365#true} is VALID [2018-11-18 23:02:14,353 INFO L273 TraceCheckUtils]: 18: Hoare triple {10365#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; {10365#true} is VALID [2018-11-18 23:02:14,353 INFO L273 TraceCheckUtils]: 19: Hoare triple {10365#true} assume true; {10365#true} is VALID [2018-11-18 23:02:14,354 INFO L268 TraceCheckUtils]: 20: Hoare quadruple {10365#true} {10396#(<= 0 main_~v~0)} #134#return; {10396#(<= 0 main_~v~0)} is VALID [2018-11-18 23:02:14,354 INFO L273 TraceCheckUtils]: 21: Hoare triple {10396#(<= 0 main_~v~0)} assume -2147483648 <= #t~ret6 && #t~ret6 <= 2147483647;~n~0 := #t~ret6;havoc #t~ret6;havoc #t~mem5; {10396#(<= 0 main_~v~0)} is VALID [2018-11-18 23:02:14,355 INFO L273 TraceCheckUtils]: 22: Hoare triple {10396#(<= 0 main_~v~0)} #t~post2 := ~v~0;~v~0 := 1 + #t~post2;havoc #t~post2; {10448#(<= 1 main_~v~0)} is VALID [2018-11-18 23:02:14,355 INFO L273 TraceCheckUtils]: 23: Hoare triple {10448#(<= 1 main_~v~0)} assume true; {10448#(<= 1 main_~v~0)} is VALID [2018-11-18 23:02:14,355 INFO L273 TraceCheckUtils]: 24: Hoare triple {10448#(<= 1 main_~v~0)} assume !!(~v~0 < ~SIZE~0);call #t~mem3 := read~int(~#values~0.base, ~#values~0.offset + 4 * ~v~0, 4); {10448#(<= 1 main_~v~0)} is VALID [2018-11-18 23:02:14,356 INFO L256 TraceCheckUtils]: 25: Hoare triple {10448#(<= 1 main_~v~0)} call #t~ret4 := elem_exists(~#set~0.base, ~#set~0.offset, ~n~0, #t~mem3); {10365#true} is VALID [2018-11-18 23:02:14,356 INFO L273 TraceCheckUtils]: 26: Hoare triple {10365#true} ~set.base, ~set.offset := #in~set.base, #in~set.offset;~size := #in~size;~value := #in~value;havoc ~i~0;~i~0 := 0; {10365#true} is VALID [2018-11-18 23:02:14,356 INFO L273 TraceCheckUtils]: 27: Hoare triple {10365#true} assume true; {10365#true} is VALID [2018-11-18 23:02:14,356 INFO L273 TraceCheckUtils]: 28: Hoare triple {10365#true} assume !!(~i~0 < ~size);call #t~mem1 := read~int(~set.base, ~set.offset + 4 * ~i~0, 4); {10365#true} is VALID [2018-11-18 23:02:14,356 INFO L273 TraceCheckUtils]: 29: Hoare triple {10365#true} assume #t~mem1 == ~value;havoc #t~mem1;#res := 1; {10365#true} is VALID [2018-11-18 23:02:14,356 INFO L273 TraceCheckUtils]: 30: Hoare triple {10365#true} assume true; {10365#true} is VALID [2018-11-18 23:02:14,357 INFO L268 TraceCheckUtils]: 31: Hoare quadruple {10365#true} {10448#(<= 1 main_~v~0)} #132#return; {10448#(<= 1 main_~v~0)} is VALID [2018-11-18 23:02:14,357 INFO L273 TraceCheckUtils]: 32: Hoare triple {10448#(<= 1 main_~v~0)} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {10448#(<= 1 main_~v~0)} is VALID [2018-11-18 23:02:14,358 INFO L273 TraceCheckUtils]: 33: Hoare triple {10448#(<= 1 main_~v~0)} assume !(1 != #t~ret4);havoc #t~mem3;havoc #t~ret4; {10448#(<= 1 main_~v~0)} is VALID [2018-11-18 23:02:14,359 INFO L273 TraceCheckUtils]: 34: Hoare triple {10448#(<= 1 main_~v~0)} #t~post2 := ~v~0;~v~0 := 1 + #t~post2;havoc #t~post2; {10485#(<= 2 main_~v~0)} is VALID [2018-11-18 23:02:14,359 INFO L273 TraceCheckUtils]: 35: Hoare triple {10485#(<= 2 main_~v~0)} assume true; {10485#(<= 2 main_~v~0)} is VALID [2018-11-18 23:02:14,360 INFO L273 TraceCheckUtils]: 36: Hoare triple {10485#(<= 2 main_~v~0)} assume !!(~v~0 < ~SIZE~0);call #t~mem3 := read~int(~#values~0.base, ~#values~0.offset + 4 * ~v~0, 4); {10485#(<= 2 main_~v~0)} is VALID [2018-11-18 23:02:14,360 INFO L256 TraceCheckUtils]: 37: Hoare triple {10485#(<= 2 main_~v~0)} call #t~ret4 := elem_exists(~#set~0.base, ~#set~0.offset, ~n~0, #t~mem3); {10365#true} is VALID [2018-11-18 23:02:14,360 INFO L273 TraceCheckUtils]: 38: Hoare triple {10365#true} ~set.base, ~set.offset := #in~set.base, #in~set.offset;~size := #in~size;~value := #in~value;havoc ~i~0;~i~0 := 0; {10365#true} is VALID [2018-11-18 23:02:14,360 INFO L273 TraceCheckUtils]: 39: Hoare triple {10365#true} assume true; {10365#true} is VALID [2018-11-18 23:02:14,360 INFO L273 TraceCheckUtils]: 40: Hoare triple {10365#true} assume !!(~i~0 < ~size);call #t~mem1 := read~int(~set.base, ~set.offset + 4 * ~i~0, 4); {10365#true} is VALID [2018-11-18 23:02:14,361 INFO L273 TraceCheckUtils]: 41: Hoare triple {10365#true} assume #t~mem1 == ~value;havoc #t~mem1;#res := 1; {10365#true} is VALID [2018-11-18 23:02:14,361 INFO L273 TraceCheckUtils]: 42: Hoare triple {10365#true} assume true; {10365#true} is VALID [2018-11-18 23:02:14,362 INFO L268 TraceCheckUtils]: 43: Hoare quadruple {10365#true} {10485#(<= 2 main_~v~0)} #132#return; {10485#(<= 2 main_~v~0)} is VALID [2018-11-18 23:02:14,362 INFO L273 TraceCheckUtils]: 44: Hoare triple {10485#(<= 2 main_~v~0)} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {10485#(<= 2 main_~v~0)} is VALID [2018-11-18 23:02:14,362 INFO L273 TraceCheckUtils]: 45: Hoare triple {10485#(<= 2 main_~v~0)} assume !(1 != #t~ret4);havoc #t~mem3;havoc #t~ret4; {10485#(<= 2 main_~v~0)} is VALID [2018-11-18 23:02:14,363 INFO L273 TraceCheckUtils]: 46: Hoare triple {10485#(<= 2 main_~v~0)} #t~post2 := ~v~0;~v~0 := 1 + #t~post2;havoc #t~post2; {10522#(<= 3 main_~v~0)} is VALID [2018-11-18 23:02:14,363 INFO L273 TraceCheckUtils]: 47: Hoare triple {10522#(<= 3 main_~v~0)} assume true; {10522#(<= 3 main_~v~0)} is VALID [2018-11-18 23:02:14,363 INFO L273 TraceCheckUtils]: 48: Hoare triple {10522#(<= 3 main_~v~0)} assume !!(~v~0 < ~SIZE~0);call #t~mem3 := read~int(~#values~0.base, ~#values~0.offset + 4 * ~v~0, 4); {10522#(<= 3 main_~v~0)} is VALID [2018-11-18 23:02:14,363 INFO L256 TraceCheckUtils]: 49: Hoare triple {10522#(<= 3 main_~v~0)} call #t~ret4 := elem_exists(~#set~0.base, ~#set~0.offset, ~n~0, #t~mem3); {10365#true} is VALID [2018-11-18 23:02:14,364 INFO L273 TraceCheckUtils]: 50: Hoare triple {10365#true} ~set.base, ~set.offset := #in~set.base, #in~set.offset;~size := #in~size;~value := #in~value;havoc ~i~0;~i~0 := 0; {10365#true} is VALID [2018-11-18 23:02:14,364 INFO L273 TraceCheckUtils]: 51: Hoare triple {10365#true} assume true; {10365#true} is VALID [2018-11-18 23:02:14,364 INFO L273 TraceCheckUtils]: 52: Hoare triple {10365#true} assume !!(~i~0 < ~size);call #t~mem1 := read~int(~set.base, ~set.offset + 4 * ~i~0, 4); {10365#true} is VALID [2018-11-18 23:02:14,364 INFO L273 TraceCheckUtils]: 53: Hoare triple {10365#true} assume #t~mem1 == ~value;havoc #t~mem1;#res := 1; {10365#true} is VALID [2018-11-18 23:02:14,364 INFO L273 TraceCheckUtils]: 54: Hoare triple {10365#true} assume true; {10365#true} is VALID [2018-11-18 23:02:14,365 INFO L268 TraceCheckUtils]: 55: Hoare quadruple {10365#true} {10522#(<= 3 main_~v~0)} #132#return; {10522#(<= 3 main_~v~0)} is VALID [2018-11-18 23:02:14,366 INFO L273 TraceCheckUtils]: 56: Hoare triple {10522#(<= 3 main_~v~0)} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {10522#(<= 3 main_~v~0)} is VALID [2018-11-18 23:02:14,366 INFO L273 TraceCheckUtils]: 57: Hoare triple {10522#(<= 3 main_~v~0)} assume !(1 != #t~ret4);havoc #t~mem3;havoc #t~ret4; {10522#(<= 3 main_~v~0)} is VALID [2018-11-18 23:02:14,367 INFO L273 TraceCheckUtils]: 58: Hoare triple {10522#(<= 3 main_~v~0)} #t~post2 := ~v~0;~v~0 := 1 + #t~post2;havoc #t~post2; {10559#(<= 4 main_~v~0)} is VALID [2018-11-18 23:02:14,367 INFO L273 TraceCheckUtils]: 59: Hoare triple {10559#(<= 4 main_~v~0)} assume true; {10559#(<= 4 main_~v~0)} is VALID [2018-11-18 23:02:14,367 INFO L273 TraceCheckUtils]: 60: Hoare triple {10559#(<= 4 main_~v~0)} assume !!(~v~0 < ~SIZE~0);call #t~mem3 := read~int(~#values~0.base, ~#values~0.offset + 4 * ~v~0, 4); {10559#(<= 4 main_~v~0)} is VALID [2018-11-18 23:02:14,367 INFO L256 TraceCheckUtils]: 61: Hoare triple {10559#(<= 4 main_~v~0)} call #t~ret4 := elem_exists(~#set~0.base, ~#set~0.offset, ~n~0, #t~mem3); {10365#true} is VALID [2018-11-18 23:02:14,368 INFO L273 TraceCheckUtils]: 62: Hoare triple {10365#true} ~set.base, ~set.offset := #in~set.base, #in~set.offset;~size := #in~size;~value := #in~value;havoc ~i~0;~i~0 := 0; {10365#true} is VALID [2018-11-18 23:02:14,368 INFO L273 TraceCheckUtils]: 63: Hoare triple {10365#true} assume true; {10365#true} is VALID [2018-11-18 23:02:14,368 INFO L273 TraceCheckUtils]: 64: Hoare triple {10365#true} assume !!(~i~0 < ~size);call #t~mem1 := read~int(~set.base, ~set.offset + 4 * ~i~0, 4); {10365#true} is VALID [2018-11-18 23:02:14,368 INFO L273 TraceCheckUtils]: 65: Hoare triple {10365#true} assume #t~mem1 == ~value;havoc #t~mem1;#res := 1; {10365#true} is VALID [2018-11-18 23:02:14,368 INFO L273 TraceCheckUtils]: 66: Hoare triple {10365#true} assume true; {10365#true} is VALID [2018-11-18 23:02:14,369 INFO L268 TraceCheckUtils]: 67: Hoare quadruple {10365#true} {10559#(<= 4 main_~v~0)} #132#return; {10559#(<= 4 main_~v~0)} is VALID [2018-11-18 23:02:14,369 INFO L273 TraceCheckUtils]: 68: Hoare triple {10559#(<= 4 main_~v~0)} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {10559#(<= 4 main_~v~0)} is VALID [2018-11-18 23:02:14,370 INFO L273 TraceCheckUtils]: 69: Hoare triple {10559#(<= 4 main_~v~0)} assume !(1 != #t~ret4);havoc #t~mem3;havoc #t~ret4; {10559#(<= 4 main_~v~0)} is VALID [2018-11-18 23:02:14,370 INFO L273 TraceCheckUtils]: 70: Hoare triple {10559#(<= 4 main_~v~0)} #t~post2 := ~v~0;~v~0 := 1 + #t~post2;havoc #t~post2; {10596#(<= 5 main_~v~0)} is VALID [2018-11-18 23:02:14,371 INFO L273 TraceCheckUtils]: 71: Hoare triple {10596#(<= 5 main_~v~0)} assume true; {10596#(<= 5 main_~v~0)} is VALID [2018-11-18 23:02:14,371 INFO L273 TraceCheckUtils]: 72: Hoare triple {10596#(<= 5 main_~v~0)} assume !!(~v~0 < ~SIZE~0);call #t~mem3 := read~int(~#values~0.base, ~#values~0.offset + 4 * ~v~0, 4); {10596#(<= 5 main_~v~0)} is VALID [2018-11-18 23:02:14,371 INFO L256 TraceCheckUtils]: 73: Hoare triple {10596#(<= 5 main_~v~0)} call #t~ret4 := elem_exists(~#set~0.base, ~#set~0.offset, ~n~0, #t~mem3); {10365#true} is VALID [2018-11-18 23:02:14,371 INFO L273 TraceCheckUtils]: 74: Hoare triple {10365#true} ~set.base, ~set.offset := #in~set.base, #in~set.offset;~size := #in~size;~value := #in~value;havoc ~i~0;~i~0 := 0; {10365#true} is VALID [2018-11-18 23:02:14,371 INFO L273 TraceCheckUtils]: 75: Hoare triple {10365#true} assume true; {10365#true} is VALID [2018-11-18 23:02:14,372 INFO L273 TraceCheckUtils]: 76: Hoare triple {10365#true} assume !!(~i~0 < ~size);call #t~mem1 := read~int(~set.base, ~set.offset + 4 * ~i~0, 4); {10365#true} is VALID [2018-11-18 23:02:14,372 INFO L273 TraceCheckUtils]: 77: Hoare triple {10365#true} assume #t~mem1 == ~value;havoc #t~mem1;#res := 1; {10365#true} is VALID [2018-11-18 23:02:14,372 INFO L273 TraceCheckUtils]: 78: Hoare triple {10365#true} assume true; {10365#true} is VALID [2018-11-18 23:02:14,373 INFO L268 TraceCheckUtils]: 79: Hoare quadruple {10365#true} {10596#(<= 5 main_~v~0)} #132#return; {10596#(<= 5 main_~v~0)} is VALID [2018-11-18 23:02:14,373 INFO L273 TraceCheckUtils]: 80: Hoare triple {10596#(<= 5 main_~v~0)} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {10596#(<= 5 main_~v~0)} is VALID [2018-11-18 23:02:14,374 INFO L273 TraceCheckUtils]: 81: Hoare triple {10596#(<= 5 main_~v~0)} assume !(1 != #t~ret4);havoc #t~mem3;havoc #t~ret4; {10596#(<= 5 main_~v~0)} is VALID [2018-11-18 23:02:14,374 INFO L273 TraceCheckUtils]: 82: Hoare triple {10596#(<= 5 main_~v~0)} #t~post2 := ~v~0;~v~0 := 1 + #t~post2;havoc #t~post2; {10633#(<= 6 main_~v~0)} is VALID [2018-11-18 23:02:14,375 INFO L273 TraceCheckUtils]: 83: Hoare triple {10633#(<= 6 main_~v~0)} assume true; {10633#(<= 6 main_~v~0)} is VALID [2018-11-18 23:02:14,375 INFO L273 TraceCheckUtils]: 84: Hoare triple {10633#(<= 6 main_~v~0)} assume !!(~v~0 < ~SIZE~0);call #t~mem3 := read~int(~#values~0.base, ~#values~0.offset + 4 * ~v~0, 4); {10633#(<= 6 main_~v~0)} is VALID [2018-11-18 23:02:14,375 INFO L256 TraceCheckUtils]: 85: Hoare triple {10633#(<= 6 main_~v~0)} call #t~ret4 := elem_exists(~#set~0.base, ~#set~0.offset, ~n~0, #t~mem3); {10365#true} is VALID [2018-11-18 23:02:14,375 INFO L273 TraceCheckUtils]: 86: Hoare triple {10365#true} ~set.base, ~set.offset := #in~set.base, #in~set.offset;~size := #in~size;~value := #in~value;havoc ~i~0;~i~0 := 0; {10365#true} is VALID [2018-11-18 23:02:14,375 INFO L273 TraceCheckUtils]: 87: Hoare triple {10365#true} assume true; {10365#true} is VALID [2018-11-18 23:02:14,376 INFO L273 TraceCheckUtils]: 88: Hoare triple {10365#true} assume !!(~i~0 < ~size);call #t~mem1 := read~int(~set.base, ~set.offset + 4 * ~i~0, 4); {10365#true} is VALID [2018-11-18 23:02:14,376 INFO L273 TraceCheckUtils]: 89: Hoare triple {10365#true} assume #t~mem1 == ~value;havoc #t~mem1;#res := 1; {10365#true} is VALID [2018-11-18 23:02:14,376 INFO L273 TraceCheckUtils]: 90: Hoare triple {10365#true} assume true; {10365#true} is VALID [2018-11-18 23:02:14,377 INFO L268 TraceCheckUtils]: 91: Hoare quadruple {10365#true} {10633#(<= 6 main_~v~0)} #132#return; {10633#(<= 6 main_~v~0)} is VALID [2018-11-18 23:02:14,378 INFO L273 TraceCheckUtils]: 92: Hoare triple {10633#(<= 6 main_~v~0)} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {10633#(<= 6 main_~v~0)} is VALID [2018-11-18 23:02:14,378 INFO L273 TraceCheckUtils]: 93: Hoare triple {10633#(<= 6 main_~v~0)} assume !(1 != #t~ret4);havoc #t~mem3;havoc #t~ret4; {10633#(<= 6 main_~v~0)} is VALID [2018-11-18 23:02:14,379 INFO L273 TraceCheckUtils]: 94: Hoare triple {10633#(<= 6 main_~v~0)} #t~post2 := ~v~0;~v~0 := 1 + #t~post2;havoc #t~post2; {10670#(<= 7 main_~v~0)} is VALID [2018-11-18 23:02:14,379 INFO L273 TraceCheckUtils]: 95: Hoare triple {10670#(<= 7 main_~v~0)} assume true; {10670#(<= 7 main_~v~0)} is VALID [2018-11-18 23:02:14,379 INFO L273 TraceCheckUtils]: 96: Hoare triple {10670#(<= 7 main_~v~0)} assume !!(~v~0 < ~SIZE~0);call #t~mem3 := read~int(~#values~0.base, ~#values~0.offset + 4 * ~v~0, 4); {10670#(<= 7 main_~v~0)} is VALID [2018-11-18 23:02:14,379 INFO L256 TraceCheckUtils]: 97: Hoare triple {10670#(<= 7 main_~v~0)} call #t~ret4 := elem_exists(~#set~0.base, ~#set~0.offset, ~n~0, #t~mem3); {10365#true} is VALID [2018-11-18 23:02:14,379 INFO L273 TraceCheckUtils]: 98: Hoare triple {10365#true} ~set.base, ~set.offset := #in~set.base, #in~set.offset;~size := #in~size;~value := #in~value;havoc ~i~0;~i~0 := 0; {10365#true} is VALID [2018-11-18 23:02:14,380 INFO L273 TraceCheckUtils]: 99: Hoare triple {10365#true} assume true; {10365#true} is VALID [2018-11-18 23:02:14,380 INFO L273 TraceCheckUtils]: 100: Hoare triple {10365#true} assume !!(~i~0 < ~size);call #t~mem1 := read~int(~set.base, ~set.offset + 4 * ~i~0, 4); {10365#true} is VALID [2018-11-18 23:02:14,380 INFO L273 TraceCheckUtils]: 101: Hoare triple {10365#true} assume #t~mem1 == ~value;havoc #t~mem1;#res := 1; {10365#true} is VALID [2018-11-18 23:02:14,380 INFO L273 TraceCheckUtils]: 102: Hoare triple {10365#true} assume true; {10365#true} is VALID [2018-11-18 23:02:14,381 INFO L268 TraceCheckUtils]: 103: Hoare quadruple {10365#true} {10670#(<= 7 main_~v~0)} #132#return; {10670#(<= 7 main_~v~0)} is VALID [2018-11-18 23:02:14,381 INFO L273 TraceCheckUtils]: 104: Hoare triple {10670#(<= 7 main_~v~0)} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {10670#(<= 7 main_~v~0)} is VALID [2018-11-18 23:02:14,382 INFO L273 TraceCheckUtils]: 105: Hoare triple {10670#(<= 7 main_~v~0)} assume !(1 != #t~ret4);havoc #t~mem3;havoc #t~ret4; {10670#(<= 7 main_~v~0)} is VALID [2018-11-18 23:02:14,383 INFO L273 TraceCheckUtils]: 106: Hoare triple {10670#(<= 7 main_~v~0)} #t~post2 := ~v~0;~v~0 := 1 + #t~post2;havoc #t~post2; {10707#(<= 8 main_~v~0)} is VALID [2018-11-18 23:02:14,383 INFO L273 TraceCheckUtils]: 107: Hoare triple {10707#(<= 8 main_~v~0)} assume true; {10707#(<= 8 main_~v~0)} is VALID [2018-11-18 23:02:14,384 INFO L273 TraceCheckUtils]: 108: Hoare triple {10707#(<= 8 main_~v~0)} assume !!(~v~0 < ~SIZE~0);call #t~mem3 := read~int(~#values~0.base, ~#values~0.offset + 4 * ~v~0, 4); {10714#(<= 9 ~SIZE~0)} is VALID [2018-11-18 23:02:14,385 INFO L256 TraceCheckUtils]: 109: Hoare triple {10714#(<= 9 ~SIZE~0)} call #t~ret4 := elem_exists(~#set~0.base, ~#set~0.offset, ~n~0, #t~mem3); {10714#(<= 9 ~SIZE~0)} is VALID [2018-11-18 23:02:14,386 INFO L273 TraceCheckUtils]: 110: Hoare triple {10714#(<= 9 ~SIZE~0)} ~set.base, ~set.offset := #in~set.base, #in~set.offset;~size := #in~size;~value := #in~value;havoc ~i~0;~i~0 := 0; {10714#(<= 9 ~SIZE~0)} is VALID [2018-11-18 23:02:14,386 INFO L273 TraceCheckUtils]: 111: Hoare triple {10714#(<= 9 ~SIZE~0)} assume true; {10714#(<= 9 ~SIZE~0)} is VALID [2018-11-18 23:02:14,387 INFO L273 TraceCheckUtils]: 112: Hoare triple {10714#(<= 9 ~SIZE~0)} assume !!(~i~0 < ~size);call #t~mem1 := read~int(~set.base, ~set.offset + 4 * ~i~0, 4); {10714#(<= 9 ~SIZE~0)} is VALID [2018-11-18 23:02:14,387 INFO L273 TraceCheckUtils]: 113: Hoare triple {10714#(<= 9 ~SIZE~0)} assume #t~mem1 == ~value;havoc #t~mem1;#res := 1; {10714#(<= 9 ~SIZE~0)} is VALID [2018-11-18 23:02:14,388 INFO L273 TraceCheckUtils]: 114: Hoare triple {10714#(<= 9 ~SIZE~0)} assume true; {10714#(<= 9 ~SIZE~0)} is VALID [2018-11-18 23:02:14,389 INFO L268 TraceCheckUtils]: 115: Hoare quadruple {10714#(<= 9 ~SIZE~0)} {10714#(<= 9 ~SIZE~0)} #132#return; {10714#(<= 9 ~SIZE~0)} is VALID [2018-11-18 23:02:14,389 INFO L273 TraceCheckUtils]: 116: Hoare triple {10714#(<= 9 ~SIZE~0)} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {10714#(<= 9 ~SIZE~0)} is VALID [2018-11-18 23:02:14,390 INFO L273 TraceCheckUtils]: 117: Hoare triple {10714#(<= 9 ~SIZE~0)} assume !(1 != #t~ret4);havoc #t~mem3;havoc #t~ret4; {10714#(<= 9 ~SIZE~0)} is VALID [2018-11-18 23:02:14,390 INFO L273 TraceCheckUtils]: 118: Hoare triple {10714#(<= 9 ~SIZE~0)} #t~post2 := ~v~0;~v~0 := 1 + #t~post2;havoc #t~post2; {10714#(<= 9 ~SIZE~0)} is VALID [2018-11-18 23:02:14,391 INFO L273 TraceCheckUtils]: 119: Hoare triple {10714#(<= 9 ~SIZE~0)} assume true; {10714#(<= 9 ~SIZE~0)} is VALID [2018-11-18 23:02:14,391 INFO L273 TraceCheckUtils]: 120: Hoare triple {10714#(<= 9 ~SIZE~0)} assume !(~v~0 < ~SIZE~0); {10714#(<= 9 ~SIZE~0)} is VALID [2018-11-18 23:02:14,392 INFO L273 TraceCheckUtils]: 121: Hoare triple {10714#(<= 9 ~SIZE~0)} ~i~1 := 0; {10754#(and (<= main_~i~1 0) (<= 9 ~SIZE~0))} is VALID [2018-11-18 23:02:14,393 INFO L273 TraceCheckUtils]: 122: Hoare triple {10754#(and (<= main_~i~1 0) (<= 9 ~SIZE~0))} assume true; {10754#(and (<= main_~i~1 0) (<= 9 ~SIZE~0))} is VALID [2018-11-18 23:02:14,394 INFO L273 TraceCheckUtils]: 123: Hoare triple {10754#(and (<= main_~i~1 0) (<= 9 ~SIZE~0))} assume !!(~i~1 < ~SIZE~0 && 1 != ~found~0);call #t~mem8 := read~int(~#set~0.base, ~#set~0.offset + 4 * ~i~1, 4); {10754#(and (<= main_~i~1 0) (<= 9 ~SIZE~0))} is VALID [2018-11-18 23:02:14,394 INFO L273 TraceCheckUtils]: 124: Hoare triple {10754#(and (<= main_~i~1 0) (<= 9 ~SIZE~0))} assume !(#t~mem8 == ~element~0);havoc #t~mem8; {10754#(and (<= main_~i~1 0) (<= 9 ~SIZE~0))} is VALID [2018-11-18 23:02:14,395 INFO L273 TraceCheckUtils]: 125: Hoare triple {10754#(and (<= main_~i~1 0) (<= 9 ~SIZE~0))} #t~post7 := ~i~1;~i~1 := 1 + #t~post7;havoc #t~post7; {10767#(and (<= main_~i~1 1) (<= 9 ~SIZE~0))} is VALID [2018-11-18 23:02:14,396 INFO L273 TraceCheckUtils]: 126: Hoare triple {10767#(and (<= main_~i~1 1) (<= 9 ~SIZE~0))} assume true; {10767#(and (<= main_~i~1 1) (<= 9 ~SIZE~0))} is VALID [2018-11-18 23:02:14,397 INFO L273 TraceCheckUtils]: 127: Hoare triple {10767#(and (<= main_~i~1 1) (<= 9 ~SIZE~0))} assume !!(~i~1 < ~SIZE~0 && 1 != ~found~0);call #t~mem8 := read~int(~#set~0.base, ~#set~0.offset + 4 * ~i~1, 4); {10767#(and (<= main_~i~1 1) (<= 9 ~SIZE~0))} is VALID [2018-11-18 23:02:14,397 INFO L273 TraceCheckUtils]: 128: Hoare triple {10767#(and (<= main_~i~1 1) (<= 9 ~SIZE~0))} assume !(#t~mem8 == ~element~0);havoc #t~mem8; {10767#(and (<= main_~i~1 1) (<= 9 ~SIZE~0))} is VALID [2018-11-18 23:02:14,398 INFO L273 TraceCheckUtils]: 129: Hoare triple {10767#(and (<= main_~i~1 1) (<= 9 ~SIZE~0))} #t~post7 := ~i~1;~i~1 := 1 + #t~post7;havoc #t~post7; {10780#(and (<= main_~i~1 2) (<= 9 ~SIZE~0))} is VALID [2018-11-18 23:02:14,399 INFO L273 TraceCheckUtils]: 130: Hoare triple {10780#(and (<= main_~i~1 2) (<= 9 ~SIZE~0))} assume true; {10780#(and (<= main_~i~1 2) (<= 9 ~SIZE~0))} is VALID [2018-11-18 23:02:14,400 INFO L273 TraceCheckUtils]: 131: Hoare triple {10780#(and (<= main_~i~1 2) (<= 9 ~SIZE~0))} assume !!(~i~1 < ~SIZE~0 && 1 != ~found~0);call #t~mem8 := read~int(~#set~0.base, ~#set~0.offset + 4 * ~i~1, 4); {10780#(and (<= main_~i~1 2) (<= 9 ~SIZE~0))} is VALID [2018-11-18 23:02:14,400 INFO L273 TraceCheckUtils]: 132: Hoare triple {10780#(and (<= main_~i~1 2) (<= 9 ~SIZE~0))} assume #t~mem8 == ~element~0;havoc #t~mem8;~found~0 := 1;~pos~0 := ~i~1; {10790#(and (<= main_~pos~0 2) (<= 9 ~SIZE~0))} is VALID [2018-11-18 23:02:14,401 INFO L273 TraceCheckUtils]: 133: Hoare triple {10790#(and (<= main_~pos~0 2) (<= 9 ~SIZE~0))} #t~post7 := ~i~1;~i~1 := 1 + #t~post7;havoc #t~post7; {10790#(and (<= main_~pos~0 2) (<= 9 ~SIZE~0))} is VALID [2018-11-18 23:02:14,402 INFO L273 TraceCheckUtils]: 134: Hoare triple {10790#(and (<= main_~pos~0 2) (<= 9 ~SIZE~0))} assume true; {10790#(and (<= main_~pos~0 2) (<= 9 ~SIZE~0))} is VALID [2018-11-18 23:02:14,402 INFO L273 TraceCheckUtils]: 135: Hoare triple {10790#(and (<= main_~pos~0 2) (<= 9 ~SIZE~0))} assume !(~i~1 < ~SIZE~0 && 1 != ~found~0); {10790#(and (<= main_~pos~0 2) (<= 9 ~SIZE~0))} is VALID [2018-11-18 23:02:14,403 INFO L273 TraceCheckUtils]: 136: Hoare triple {10790#(and (<= main_~pos~0 2) (<= 9 ~SIZE~0))} assume 1 == ~found~0;~i~1 := ~pos~0; {10780#(and (<= main_~i~1 2) (<= 9 ~SIZE~0))} is VALID [2018-11-18 23:02:14,404 INFO L273 TraceCheckUtils]: 137: Hoare triple {10780#(and (<= main_~i~1 2) (<= 9 ~SIZE~0))} assume true; {10780#(and (<= main_~i~1 2) (<= 9 ~SIZE~0))} is VALID [2018-11-18 23:02:14,404 INFO L273 TraceCheckUtils]: 138: Hoare triple {10780#(and (<= main_~i~1 2) (<= 9 ~SIZE~0))} assume !(~i~1 < ~SIZE~0 - 1); {10366#false} is VALID [2018-11-18 23:02:14,405 INFO L273 TraceCheckUtils]: 139: Hoare triple {10366#false} assume 1 == ~found~0;~i~1 := 0; {10366#false} is VALID [2018-11-18 23:02:14,405 INFO L273 TraceCheckUtils]: 140: Hoare triple {10366#false} assume true; {10366#false} is VALID [2018-11-18 23:02:14,405 INFO L273 TraceCheckUtils]: 141: Hoare triple {10366#false} assume !!(~i~1 < ~SIZE~0 - 1);call #t~mem12 := read~int(~#set~0.base, ~#set~0.offset + 4 * ~i~1, 4); {10366#false} is VALID [2018-11-18 23:02:14,405 INFO L256 TraceCheckUtils]: 142: Hoare triple {10366#false} call __VERIFIER_assert((if #t~mem12 != ~element~0 then 1 else 0)); {10366#false} is VALID [2018-11-18 23:02:14,406 INFO L273 TraceCheckUtils]: 143: Hoare triple {10366#false} ~cond := #in~cond; {10366#false} is VALID [2018-11-18 23:02:14,406 INFO L273 TraceCheckUtils]: 144: Hoare triple {10366#false} assume 0 == ~cond; {10366#false} is VALID [2018-11-18 23:02:14,406 INFO L273 TraceCheckUtils]: 145: Hoare triple {10366#false} assume !false; {10366#false} is VALID [2018-11-18 23:02:14,419 INFO L134 CoverageAnalysis]: Checked inductivity of 460 backedges. 231 proven. 68 refuted. 0 times theorem prover too weak. 161 trivial. 0 not checked. [2018-11-18 23:02:14,438 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-18 23:02:14,439 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 16] total 27 [2018-11-18 23:02:14,439 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 146 [2018-11-18 23:02:14,440 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-18 23:02:14,440 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 27 states. [2018-11-18 23:02:14,630 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 196 edges. 196 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 23:02:14,630 INFO L459 AbstractCegarLoop]: Interpolant automaton has 27 states [2018-11-18 23:02:14,630 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2018-11-18 23:02:14,631 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=143, Invalid=559, Unknown=0, NotChecked=0, Total=702 [2018-11-18 23:02:14,631 INFO L87 Difference]: Start difference. First operand 161 states and 207 transitions. Second operand 27 states. [2018-11-18 23:02:22,433 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 23:02:22,433 INFO L93 Difference]: Finished difference Result 280 states and 351 transitions. [2018-11-18 23:02:22,433 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-11-18 23:02:22,433 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 146 [2018-11-18 23:02:22,434 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 23:02:22,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2018-11-18 23:02:22,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 265 transitions. [2018-11-18 23:02:22,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2018-11-18 23:02:22,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 265 transitions. [2018-11-18 23:02:22,441 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 21 states and 265 transitions. [2018-11-18 23:02:22,775 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 265 edges. 265 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 23:02:22,781 INFO L225 Difference]: With dead ends: 280 [2018-11-18 23:02:22,781 INFO L226 Difference]: Without dead ends: 233 [2018-11-18 23:02:22,782 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 175 GetRequests, 133 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 357 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=422, Invalid=1470, Unknown=0, NotChecked=0, Total=1892 [2018-11-18 23:02:22,782 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 233 states. [2018-11-18 23:02:23,557 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 233 to 179. [2018-11-18 23:02:23,557 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-18 23:02:23,558 INFO L82 GeneralOperation]: Start isEquivalent. First operand 233 states. Second operand 179 states. [2018-11-18 23:02:23,558 INFO L74 IsIncluded]: Start isIncluded. First operand 233 states. Second operand 179 states. [2018-11-18 23:02:23,558 INFO L87 Difference]: Start difference. First operand 233 states. Second operand 179 states. [2018-11-18 23:02:23,565 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 23:02:23,566 INFO L93 Difference]: Finished difference Result 233 states and 298 transitions. [2018-11-18 23:02:23,566 INFO L276 IsEmpty]: Start isEmpty. Operand 233 states and 298 transitions. [2018-11-18 23:02:23,567 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 23:02:23,567 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 23:02:23,568 INFO L74 IsIncluded]: Start isIncluded. First operand 179 states. Second operand 233 states. [2018-11-18 23:02:23,568 INFO L87 Difference]: Start difference. First operand 179 states. Second operand 233 states. [2018-11-18 23:02:23,575 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 23:02:23,575 INFO L93 Difference]: Finished difference Result 233 states and 298 transitions. [2018-11-18 23:02:23,575 INFO L276 IsEmpty]: Start isEmpty. Operand 233 states and 298 transitions. [2018-11-18 23:02:23,576 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 23:02:23,576 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 23:02:23,576 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-18 23:02:23,577 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-18 23:02:23,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 179 states. [2018-11-18 23:02:23,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 179 states to 179 states and 231 transitions. [2018-11-18 23:02:23,582 INFO L78 Accepts]: Start accepts. Automaton has 179 states and 231 transitions. Word has length 146 [2018-11-18 23:02:23,582 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 23:02:23,582 INFO L480 AbstractCegarLoop]: Abstraction has 179 states and 231 transitions. [2018-11-18 23:02:23,582 INFO L481 AbstractCegarLoop]: Interpolant automaton has 27 states. [2018-11-18 23:02:23,582 INFO L276 IsEmpty]: Start isEmpty. Operand 179 states and 231 transitions. [2018-11-18 23:02:23,584 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2018-11-18 23:02:23,585 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 23:02:23,585 INFO L375 BasicCegarLoop]: trace histogram [11, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 4, 3, 3, 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] [2018-11-18 23:02:23,585 INFO L423 AbstractCegarLoop]: === Iteration 16 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 23:02:23,585 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 23:02:23,585 INFO L82 PathProgramCache]: Analyzing trace with hash -1788323351, now seen corresponding path program 2 times [2018-11-18 23:02:23,586 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 23:02:23,586 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 23:02:23,586 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 23:02:23,587 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 23:02:23,587 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 23:02:23,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 23:02:23,810 INFO L256 TraceCheckUtils]: 0: Hoare triple {11928#true} call ULTIMATE.init(); {11928#true} is VALID [2018-11-18 23:02:23,811 INFO L273 TraceCheckUtils]: 1: Hoare triple {11928#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~SIZE~0 := 100000; {11930#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:02:23,812 INFO L273 TraceCheckUtils]: 2: Hoare triple {11930#(<= 100000 ~SIZE~0)} assume true; {11930#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:02:23,812 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {11930#(<= 100000 ~SIZE~0)} {11928#true} #128#return; {11930#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:02:23,813 INFO L256 TraceCheckUtils]: 4: Hoare triple {11930#(<= 100000 ~SIZE~0)} call #t~ret13 := main(); {11930#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:02:23,814 INFO L273 TraceCheckUtils]: 5: Hoare triple {11930#(<= 100000 ~SIZE~0)} havoc ~i~1;havoc ~pos~0;~n~0 := 0;~found~0 := 0;call ~#set~0.base, ~#set~0.offset := #Ultimate.alloc(4 * ~SIZE~0);call ~#values~0.base, ~#values~0.offset := #Ultimate.alloc(4 * ~SIZE~0);havoc ~element~0;havoc ~v~0;~v~0 := 0; {11930#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:02:23,814 INFO L273 TraceCheckUtils]: 6: Hoare triple {11930#(<= 100000 ~SIZE~0)} assume true; {11930#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:02:23,815 INFO L273 TraceCheckUtils]: 7: Hoare triple {11930#(<= 100000 ~SIZE~0)} assume !!(~v~0 < ~SIZE~0);call #t~mem3 := read~int(~#values~0.base, ~#values~0.offset + 4 * ~v~0, 4); {11930#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:02:23,815 INFO L256 TraceCheckUtils]: 8: Hoare triple {11930#(<= 100000 ~SIZE~0)} call #t~ret4 := elem_exists(~#set~0.base, ~#set~0.offset, ~n~0, #t~mem3); {11928#true} is VALID [2018-11-18 23:02:23,815 INFO L273 TraceCheckUtils]: 9: Hoare triple {11928#true} ~set.base, ~set.offset := #in~set.base, #in~set.offset;~size := #in~size;~value := #in~value;havoc ~i~0;~i~0 := 0; {11928#true} is VALID [2018-11-18 23:02:23,815 INFO L273 TraceCheckUtils]: 10: Hoare triple {11928#true} assume true; {11928#true} is VALID [2018-11-18 23:02:23,816 INFO L273 TraceCheckUtils]: 11: Hoare triple {11928#true} assume !(~i~0 < ~size); {11928#true} is VALID [2018-11-18 23:02:23,816 INFO L273 TraceCheckUtils]: 12: Hoare triple {11928#true} #res := 0; {11928#true} is VALID [2018-11-18 23:02:23,816 INFO L273 TraceCheckUtils]: 13: Hoare triple {11928#true} assume true; {11928#true} is VALID [2018-11-18 23:02:23,817 INFO L268 TraceCheckUtils]: 14: Hoare quadruple {11928#true} {11930#(<= 100000 ~SIZE~0)} #132#return; {11930#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:02:23,817 INFO L273 TraceCheckUtils]: 15: Hoare triple {11930#(<= 100000 ~SIZE~0)} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {11930#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:02:23,818 INFO L273 TraceCheckUtils]: 16: Hoare triple {11930#(<= 100000 ~SIZE~0)} assume 1 != #t~ret4;havoc #t~mem3;havoc #t~ret4;call #t~mem5 := read~int(~#values~0.base, ~#values~0.offset + 4 * ~v~0, 4); {11930#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:02:23,818 INFO L256 TraceCheckUtils]: 17: Hoare triple {11930#(<= 100000 ~SIZE~0)} call #t~ret6 := insert(~#set~0.base, ~#set~0.offset, ~n~0, #t~mem5); {11928#true} is VALID [2018-11-18 23:02:23,818 INFO L273 TraceCheckUtils]: 18: Hoare triple {11928#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; {11928#true} is VALID [2018-11-18 23:02:23,818 INFO L273 TraceCheckUtils]: 19: Hoare triple {11928#true} assume true; {11928#true} is VALID [2018-11-18 23:02:23,819 INFO L268 TraceCheckUtils]: 20: Hoare quadruple {11928#true} {11930#(<= 100000 ~SIZE~0)} #134#return; {11930#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:02:23,819 INFO L273 TraceCheckUtils]: 21: Hoare triple {11930#(<= 100000 ~SIZE~0)} assume -2147483648 <= #t~ret6 && #t~ret6 <= 2147483647;~n~0 := #t~ret6;havoc #t~ret6;havoc #t~mem5; {11930#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:02:23,820 INFO L273 TraceCheckUtils]: 22: Hoare triple {11930#(<= 100000 ~SIZE~0)} #t~post2 := ~v~0;~v~0 := 1 + #t~post2;havoc #t~post2; {11930#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:02:23,820 INFO L273 TraceCheckUtils]: 23: Hoare triple {11930#(<= 100000 ~SIZE~0)} assume true; {11930#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:02:23,821 INFO L273 TraceCheckUtils]: 24: Hoare triple {11930#(<= 100000 ~SIZE~0)} assume !!(~v~0 < ~SIZE~0);call #t~mem3 := read~int(~#values~0.base, ~#values~0.offset + 4 * ~v~0, 4); {11930#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:02:23,821 INFO L256 TraceCheckUtils]: 25: Hoare triple {11930#(<= 100000 ~SIZE~0)} call #t~ret4 := elem_exists(~#set~0.base, ~#set~0.offset, ~n~0, #t~mem3); {11928#true} is VALID [2018-11-18 23:02:23,821 INFO L273 TraceCheckUtils]: 26: Hoare triple {11928#true} ~set.base, ~set.offset := #in~set.base, #in~set.offset;~size := #in~size;~value := #in~value;havoc ~i~0;~i~0 := 0; {11928#true} is VALID [2018-11-18 23:02:23,822 INFO L273 TraceCheckUtils]: 27: Hoare triple {11928#true} assume true; {11928#true} is VALID [2018-11-18 23:02:23,822 INFO L273 TraceCheckUtils]: 28: Hoare triple {11928#true} assume !!(~i~0 < ~size);call #t~mem1 := read~int(~set.base, ~set.offset + 4 * ~i~0, 4); {11928#true} is VALID [2018-11-18 23:02:23,822 INFO L273 TraceCheckUtils]: 29: Hoare triple {11928#true} assume #t~mem1 == ~value;havoc #t~mem1;#res := 1; {11928#true} is VALID [2018-11-18 23:02:23,822 INFO L273 TraceCheckUtils]: 30: Hoare triple {11928#true} assume true; {11928#true} is VALID [2018-11-18 23:02:23,823 INFO L268 TraceCheckUtils]: 31: Hoare quadruple {11928#true} {11930#(<= 100000 ~SIZE~0)} #132#return; {11930#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:02:23,824 INFO L273 TraceCheckUtils]: 32: Hoare triple {11930#(<= 100000 ~SIZE~0)} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {11930#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:02:23,824 INFO L273 TraceCheckUtils]: 33: Hoare triple {11930#(<= 100000 ~SIZE~0)} assume !(1 != #t~ret4);havoc #t~mem3;havoc #t~ret4; {11930#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:02:23,824 INFO L273 TraceCheckUtils]: 34: Hoare triple {11930#(<= 100000 ~SIZE~0)} #t~post2 := ~v~0;~v~0 := 1 + #t~post2;havoc #t~post2; {11930#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:02:23,824 INFO L273 TraceCheckUtils]: 35: Hoare triple {11930#(<= 100000 ~SIZE~0)} assume true; {11930#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:02:23,825 INFO L273 TraceCheckUtils]: 36: Hoare triple {11930#(<= 100000 ~SIZE~0)} assume !!(~v~0 < ~SIZE~0);call #t~mem3 := read~int(~#values~0.base, ~#values~0.offset + 4 * ~v~0, 4); {11930#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:02:23,825 INFO L256 TraceCheckUtils]: 37: Hoare triple {11930#(<= 100000 ~SIZE~0)} call #t~ret4 := elem_exists(~#set~0.base, ~#set~0.offset, ~n~0, #t~mem3); {11928#true} is VALID [2018-11-18 23:02:23,825 INFO L273 TraceCheckUtils]: 38: Hoare triple {11928#true} ~set.base, ~set.offset := #in~set.base, #in~set.offset;~size := #in~size;~value := #in~value;havoc ~i~0;~i~0 := 0; {11928#true} is VALID [2018-11-18 23:02:23,825 INFO L273 TraceCheckUtils]: 39: Hoare triple {11928#true} assume true; {11928#true} is VALID [2018-11-18 23:02:23,825 INFO L273 TraceCheckUtils]: 40: Hoare triple {11928#true} assume !!(~i~0 < ~size);call #t~mem1 := read~int(~set.base, ~set.offset + 4 * ~i~0, 4); {11928#true} is VALID [2018-11-18 23:02:23,825 INFO L273 TraceCheckUtils]: 41: Hoare triple {11928#true} assume #t~mem1 == ~value;havoc #t~mem1;#res := 1; {11928#true} is VALID [2018-11-18 23:02:23,825 INFO L273 TraceCheckUtils]: 42: Hoare triple {11928#true} assume true; {11928#true} is VALID [2018-11-18 23:02:23,826 INFO L268 TraceCheckUtils]: 43: Hoare quadruple {11928#true} {11930#(<= 100000 ~SIZE~0)} #132#return; {11930#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:02:23,827 INFO L273 TraceCheckUtils]: 44: Hoare triple {11930#(<= 100000 ~SIZE~0)} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {11930#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:02:23,827 INFO L273 TraceCheckUtils]: 45: Hoare triple {11930#(<= 100000 ~SIZE~0)} assume !(1 != #t~ret4);havoc #t~mem3;havoc #t~ret4; {11930#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:02:23,828 INFO L273 TraceCheckUtils]: 46: Hoare triple {11930#(<= 100000 ~SIZE~0)} #t~post2 := ~v~0;~v~0 := 1 + #t~post2;havoc #t~post2; {11930#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:02:23,828 INFO L273 TraceCheckUtils]: 47: Hoare triple {11930#(<= 100000 ~SIZE~0)} assume true; {11930#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:02:23,829 INFO L273 TraceCheckUtils]: 48: Hoare triple {11930#(<= 100000 ~SIZE~0)} assume !!(~v~0 < ~SIZE~0);call #t~mem3 := read~int(~#values~0.base, ~#values~0.offset + 4 * ~v~0, 4); {11930#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:02:23,829 INFO L256 TraceCheckUtils]: 49: Hoare triple {11930#(<= 100000 ~SIZE~0)} call #t~ret4 := elem_exists(~#set~0.base, ~#set~0.offset, ~n~0, #t~mem3); {11928#true} is VALID [2018-11-18 23:02:23,829 INFO L273 TraceCheckUtils]: 50: Hoare triple {11928#true} ~set.base, ~set.offset := #in~set.base, #in~set.offset;~size := #in~size;~value := #in~value;havoc ~i~0;~i~0 := 0; {11928#true} is VALID [2018-11-18 23:02:23,830 INFO L273 TraceCheckUtils]: 51: Hoare triple {11928#true} assume true; {11928#true} is VALID [2018-11-18 23:02:23,830 INFO L273 TraceCheckUtils]: 52: Hoare triple {11928#true} assume !!(~i~0 < ~size);call #t~mem1 := read~int(~set.base, ~set.offset + 4 * ~i~0, 4); {11928#true} is VALID [2018-11-18 23:02:23,830 INFO L273 TraceCheckUtils]: 53: Hoare triple {11928#true} assume #t~mem1 == ~value;havoc #t~mem1;#res := 1; {11928#true} is VALID [2018-11-18 23:02:23,830 INFO L273 TraceCheckUtils]: 54: Hoare triple {11928#true} assume true; {11928#true} is VALID [2018-11-18 23:02:23,831 INFO L268 TraceCheckUtils]: 55: Hoare quadruple {11928#true} {11930#(<= 100000 ~SIZE~0)} #132#return; {11930#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:02:23,832 INFO L273 TraceCheckUtils]: 56: Hoare triple {11930#(<= 100000 ~SIZE~0)} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {11930#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:02:23,833 INFO L273 TraceCheckUtils]: 57: Hoare triple {11930#(<= 100000 ~SIZE~0)} assume !(1 != #t~ret4);havoc #t~mem3;havoc #t~ret4; {11930#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:02:23,833 INFO L273 TraceCheckUtils]: 58: Hoare triple {11930#(<= 100000 ~SIZE~0)} #t~post2 := ~v~0;~v~0 := 1 + #t~post2;havoc #t~post2; {11930#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:02:23,833 INFO L273 TraceCheckUtils]: 59: Hoare triple {11930#(<= 100000 ~SIZE~0)} assume true; {11930#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:02:23,834 INFO L273 TraceCheckUtils]: 60: Hoare triple {11930#(<= 100000 ~SIZE~0)} assume !!(~v~0 < ~SIZE~0);call #t~mem3 := read~int(~#values~0.base, ~#values~0.offset + 4 * ~v~0, 4); {11930#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:02:23,834 INFO L256 TraceCheckUtils]: 61: Hoare triple {11930#(<= 100000 ~SIZE~0)} call #t~ret4 := elem_exists(~#set~0.base, ~#set~0.offset, ~n~0, #t~mem3); {11928#true} is VALID [2018-11-18 23:02:23,834 INFO L273 TraceCheckUtils]: 62: Hoare triple {11928#true} ~set.base, ~set.offset := #in~set.base, #in~set.offset;~size := #in~size;~value := #in~value;havoc ~i~0;~i~0 := 0; {11928#true} is VALID [2018-11-18 23:02:23,834 INFO L273 TraceCheckUtils]: 63: Hoare triple {11928#true} assume true; {11928#true} is VALID [2018-11-18 23:02:23,834 INFO L273 TraceCheckUtils]: 64: Hoare triple {11928#true} assume !!(~i~0 < ~size);call #t~mem1 := read~int(~set.base, ~set.offset + 4 * ~i~0, 4); {11928#true} is VALID [2018-11-18 23:02:23,834 INFO L273 TraceCheckUtils]: 65: Hoare triple {11928#true} assume #t~mem1 == ~value;havoc #t~mem1;#res := 1; {11928#true} is VALID [2018-11-18 23:02:23,834 INFO L273 TraceCheckUtils]: 66: Hoare triple {11928#true} assume true; {11928#true} is VALID [2018-11-18 23:02:23,835 INFO L268 TraceCheckUtils]: 67: Hoare quadruple {11928#true} {11930#(<= 100000 ~SIZE~0)} #132#return; {11930#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:02:23,836 INFO L273 TraceCheckUtils]: 68: Hoare triple {11930#(<= 100000 ~SIZE~0)} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {11930#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:02:23,836 INFO L273 TraceCheckUtils]: 69: Hoare triple {11930#(<= 100000 ~SIZE~0)} assume !(1 != #t~ret4);havoc #t~mem3;havoc #t~ret4; {11930#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:02:23,837 INFO L273 TraceCheckUtils]: 70: Hoare triple {11930#(<= 100000 ~SIZE~0)} #t~post2 := ~v~0;~v~0 := 1 + #t~post2;havoc #t~post2; {11930#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:02:23,837 INFO L273 TraceCheckUtils]: 71: Hoare triple {11930#(<= 100000 ~SIZE~0)} assume true; {11930#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:02:23,838 INFO L273 TraceCheckUtils]: 72: Hoare triple {11930#(<= 100000 ~SIZE~0)} assume !!(~v~0 < ~SIZE~0);call #t~mem3 := read~int(~#values~0.base, ~#values~0.offset + 4 * ~v~0, 4); {11930#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:02:23,838 INFO L256 TraceCheckUtils]: 73: Hoare triple {11930#(<= 100000 ~SIZE~0)} call #t~ret4 := elem_exists(~#set~0.base, ~#set~0.offset, ~n~0, #t~mem3); {11928#true} is VALID [2018-11-18 23:02:23,838 INFO L273 TraceCheckUtils]: 74: Hoare triple {11928#true} ~set.base, ~set.offset := #in~set.base, #in~set.offset;~size := #in~size;~value := #in~value;havoc ~i~0;~i~0 := 0; {11928#true} is VALID [2018-11-18 23:02:23,838 INFO L273 TraceCheckUtils]: 75: Hoare triple {11928#true} assume true; {11928#true} is VALID [2018-11-18 23:02:23,839 INFO L273 TraceCheckUtils]: 76: Hoare triple {11928#true} assume !!(~i~0 < ~size);call #t~mem1 := read~int(~set.base, ~set.offset + 4 * ~i~0, 4); {11928#true} is VALID [2018-11-18 23:02:23,839 INFO L273 TraceCheckUtils]: 77: Hoare triple {11928#true} assume #t~mem1 == ~value;havoc #t~mem1;#res := 1; {11928#true} is VALID [2018-11-18 23:02:23,839 INFO L273 TraceCheckUtils]: 78: Hoare triple {11928#true} assume true; {11928#true} is VALID [2018-11-18 23:02:23,840 INFO L268 TraceCheckUtils]: 79: Hoare quadruple {11928#true} {11930#(<= 100000 ~SIZE~0)} #132#return; {11930#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:02:23,841 INFO L273 TraceCheckUtils]: 80: Hoare triple {11930#(<= 100000 ~SIZE~0)} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {11930#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:02:23,841 INFO L273 TraceCheckUtils]: 81: Hoare triple {11930#(<= 100000 ~SIZE~0)} assume !(1 != #t~ret4);havoc #t~mem3;havoc #t~ret4; {11930#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:02:23,841 INFO L273 TraceCheckUtils]: 82: Hoare triple {11930#(<= 100000 ~SIZE~0)} #t~post2 := ~v~0;~v~0 := 1 + #t~post2;havoc #t~post2; {11930#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:02:23,841 INFO L273 TraceCheckUtils]: 83: Hoare triple {11930#(<= 100000 ~SIZE~0)} assume true; {11930#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:02:23,842 INFO L273 TraceCheckUtils]: 84: Hoare triple {11930#(<= 100000 ~SIZE~0)} assume !!(~v~0 < ~SIZE~0);call #t~mem3 := read~int(~#values~0.base, ~#values~0.offset + 4 * ~v~0, 4); {11930#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:02:23,842 INFO L256 TraceCheckUtils]: 85: Hoare triple {11930#(<= 100000 ~SIZE~0)} call #t~ret4 := elem_exists(~#set~0.base, ~#set~0.offset, ~n~0, #t~mem3); {11928#true} is VALID [2018-11-18 23:02:23,842 INFO L273 TraceCheckUtils]: 86: Hoare triple {11928#true} ~set.base, ~set.offset := #in~set.base, #in~set.offset;~size := #in~size;~value := #in~value;havoc ~i~0;~i~0 := 0; {11928#true} is VALID [2018-11-18 23:02:23,842 INFO L273 TraceCheckUtils]: 87: Hoare triple {11928#true} assume true; {11928#true} is VALID [2018-11-18 23:02:23,842 INFO L273 TraceCheckUtils]: 88: Hoare triple {11928#true} assume !!(~i~0 < ~size);call #t~mem1 := read~int(~set.base, ~set.offset + 4 * ~i~0, 4); {11928#true} is VALID [2018-11-18 23:02:23,843 INFO L273 TraceCheckUtils]: 89: Hoare triple {11928#true} assume #t~mem1 == ~value;havoc #t~mem1;#res := 1; {11928#true} is VALID [2018-11-18 23:02:23,843 INFO L273 TraceCheckUtils]: 90: Hoare triple {11928#true} assume true; {11928#true} is VALID [2018-11-18 23:02:23,844 INFO L268 TraceCheckUtils]: 91: Hoare quadruple {11928#true} {11930#(<= 100000 ~SIZE~0)} #132#return; {11930#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:02:23,845 INFO L273 TraceCheckUtils]: 92: Hoare triple {11930#(<= 100000 ~SIZE~0)} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {11930#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:02:23,845 INFO L273 TraceCheckUtils]: 93: Hoare triple {11930#(<= 100000 ~SIZE~0)} assume !(1 != #t~ret4);havoc #t~mem3;havoc #t~ret4; {11930#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:02:23,846 INFO L273 TraceCheckUtils]: 94: Hoare triple {11930#(<= 100000 ~SIZE~0)} #t~post2 := ~v~0;~v~0 := 1 + #t~post2;havoc #t~post2; {11930#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:02:23,846 INFO L273 TraceCheckUtils]: 95: Hoare triple {11930#(<= 100000 ~SIZE~0)} assume true; {11930#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:02:23,847 INFO L273 TraceCheckUtils]: 96: Hoare triple {11930#(<= 100000 ~SIZE~0)} assume !!(~v~0 < ~SIZE~0);call #t~mem3 := read~int(~#values~0.base, ~#values~0.offset + 4 * ~v~0, 4); {11930#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:02:23,847 INFO L256 TraceCheckUtils]: 97: Hoare triple {11930#(<= 100000 ~SIZE~0)} call #t~ret4 := elem_exists(~#set~0.base, ~#set~0.offset, ~n~0, #t~mem3); {11928#true} is VALID [2018-11-18 23:02:23,847 INFO L273 TraceCheckUtils]: 98: Hoare triple {11928#true} ~set.base, ~set.offset := #in~set.base, #in~set.offset;~size := #in~size;~value := #in~value;havoc ~i~0;~i~0 := 0; {11928#true} is VALID [2018-11-18 23:02:23,847 INFO L273 TraceCheckUtils]: 99: Hoare triple {11928#true} assume true; {11928#true} is VALID [2018-11-18 23:02:23,848 INFO L273 TraceCheckUtils]: 100: Hoare triple {11928#true} assume !!(~i~0 < ~size);call #t~mem1 := read~int(~set.base, ~set.offset + 4 * ~i~0, 4); {11928#true} is VALID [2018-11-18 23:02:23,848 INFO L273 TraceCheckUtils]: 101: Hoare triple {11928#true} assume #t~mem1 == ~value;havoc #t~mem1;#res := 1; {11928#true} is VALID [2018-11-18 23:02:23,848 INFO L273 TraceCheckUtils]: 102: Hoare triple {11928#true} assume true; {11928#true} is VALID [2018-11-18 23:02:23,849 INFO L268 TraceCheckUtils]: 103: Hoare quadruple {11928#true} {11930#(<= 100000 ~SIZE~0)} #132#return; {11930#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:02:23,849 INFO L273 TraceCheckUtils]: 104: Hoare triple {11930#(<= 100000 ~SIZE~0)} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {11930#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:02:23,849 INFO L273 TraceCheckUtils]: 105: Hoare triple {11930#(<= 100000 ~SIZE~0)} assume !(1 != #t~ret4);havoc #t~mem3;havoc #t~ret4; {11930#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:02:23,850 INFO L273 TraceCheckUtils]: 106: Hoare triple {11930#(<= 100000 ~SIZE~0)} #t~post2 := ~v~0;~v~0 := 1 + #t~post2;havoc #t~post2; {11930#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:02:23,850 INFO L273 TraceCheckUtils]: 107: Hoare triple {11930#(<= 100000 ~SIZE~0)} assume true; {11930#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:02:23,850 INFO L273 TraceCheckUtils]: 108: Hoare triple {11930#(<= 100000 ~SIZE~0)} assume !!(~v~0 < ~SIZE~0);call #t~mem3 := read~int(~#values~0.base, ~#values~0.offset + 4 * ~v~0, 4); {11930#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:02:23,850 INFO L256 TraceCheckUtils]: 109: Hoare triple {11930#(<= 100000 ~SIZE~0)} call #t~ret4 := elem_exists(~#set~0.base, ~#set~0.offset, ~n~0, #t~mem3); {11928#true} is VALID [2018-11-18 23:02:23,851 INFO L273 TraceCheckUtils]: 110: Hoare triple {11928#true} ~set.base, ~set.offset := #in~set.base, #in~set.offset;~size := #in~size;~value := #in~value;havoc ~i~0;~i~0 := 0; {11928#true} is VALID [2018-11-18 23:02:23,851 INFO L273 TraceCheckUtils]: 111: Hoare triple {11928#true} assume true; {11928#true} is VALID [2018-11-18 23:02:23,851 INFO L273 TraceCheckUtils]: 112: Hoare triple {11928#true} assume !!(~i~0 < ~size);call #t~mem1 := read~int(~set.base, ~set.offset + 4 * ~i~0, 4); {11928#true} is VALID [2018-11-18 23:02:23,851 INFO L273 TraceCheckUtils]: 113: Hoare triple {11928#true} assume #t~mem1 == ~value;havoc #t~mem1;#res := 1; {11928#true} is VALID [2018-11-18 23:02:23,851 INFO L273 TraceCheckUtils]: 114: Hoare triple {11928#true} assume true; {11928#true} is VALID [2018-11-18 23:02:23,852 INFO L268 TraceCheckUtils]: 115: Hoare quadruple {11928#true} {11930#(<= 100000 ~SIZE~0)} #132#return; {11930#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:02:23,852 INFO L273 TraceCheckUtils]: 116: Hoare triple {11930#(<= 100000 ~SIZE~0)} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {11930#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:02:23,852 INFO L273 TraceCheckUtils]: 117: Hoare triple {11930#(<= 100000 ~SIZE~0)} assume !(1 != #t~ret4);havoc #t~mem3;havoc #t~ret4; {11930#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:02:23,853 INFO L273 TraceCheckUtils]: 118: Hoare triple {11930#(<= 100000 ~SIZE~0)} #t~post2 := ~v~0;~v~0 := 1 + #t~post2;havoc #t~post2; {11930#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:02:23,853 INFO L273 TraceCheckUtils]: 119: Hoare triple {11930#(<= 100000 ~SIZE~0)} assume true; {11930#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:02:23,853 INFO L273 TraceCheckUtils]: 120: Hoare triple {11930#(<= 100000 ~SIZE~0)} assume !!(~v~0 < ~SIZE~0);call #t~mem3 := read~int(~#values~0.base, ~#values~0.offset + 4 * ~v~0, 4); {11930#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:02:23,854 INFO L256 TraceCheckUtils]: 121: Hoare triple {11930#(<= 100000 ~SIZE~0)} call #t~ret4 := elem_exists(~#set~0.base, ~#set~0.offset, ~n~0, #t~mem3); {11928#true} is VALID [2018-11-18 23:02:23,854 INFO L273 TraceCheckUtils]: 122: Hoare triple {11928#true} ~set.base, ~set.offset := #in~set.base, #in~set.offset;~size := #in~size;~value := #in~value;havoc ~i~0;~i~0 := 0; {11928#true} is VALID [2018-11-18 23:02:23,854 INFO L273 TraceCheckUtils]: 123: Hoare triple {11928#true} assume true; {11928#true} is VALID [2018-11-18 23:02:23,854 INFO L273 TraceCheckUtils]: 124: Hoare triple {11928#true} assume !!(~i~0 < ~size);call #t~mem1 := read~int(~set.base, ~set.offset + 4 * ~i~0, 4); {11928#true} is VALID [2018-11-18 23:02:23,854 INFO L273 TraceCheckUtils]: 125: Hoare triple {11928#true} assume #t~mem1 == ~value;havoc #t~mem1;#res := 1; {11928#true} is VALID [2018-11-18 23:02:23,854 INFO L273 TraceCheckUtils]: 126: Hoare triple {11928#true} assume true; {11928#true} is VALID [2018-11-18 23:02:23,855 INFO L268 TraceCheckUtils]: 127: Hoare quadruple {11928#true} {11930#(<= 100000 ~SIZE~0)} #132#return; {11930#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:02:23,856 INFO L273 TraceCheckUtils]: 128: Hoare triple {11930#(<= 100000 ~SIZE~0)} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {11930#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:02:23,856 INFO L273 TraceCheckUtils]: 129: Hoare triple {11930#(<= 100000 ~SIZE~0)} assume !(1 != #t~ret4);havoc #t~mem3;havoc #t~ret4; {11930#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:02:23,856 INFO L273 TraceCheckUtils]: 130: Hoare triple {11930#(<= 100000 ~SIZE~0)} #t~post2 := ~v~0;~v~0 := 1 + #t~post2;havoc #t~post2; {11930#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:02:23,857 INFO L273 TraceCheckUtils]: 131: Hoare triple {11930#(<= 100000 ~SIZE~0)} assume true; {11930#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:02:23,857 INFO L273 TraceCheckUtils]: 132: Hoare triple {11930#(<= 100000 ~SIZE~0)} assume !(~v~0 < ~SIZE~0); {11930#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:02:23,858 INFO L273 TraceCheckUtils]: 133: Hoare triple {11930#(<= 100000 ~SIZE~0)} ~i~1 := 0; {11931#(and (= 0 main_~i~1) (<= 100000 ~SIZE~0))} is VALID [2018-11-18 23:02:23,859 INFO L273 TraceCheckUtils]: 134: Hoare triple {11931#(and (= 0 main_~i~1) (<= 100000 ~SIZE~0))} assume true; {11931#(and (= 0 main_~i~1) (<= 100000 ~SIZE~0))} is VALID [2018-11-18 23:02:23,859 INFO L273 TraceCheckUtils]: 135: Hoare triple {11931#(and (= 0 main_~i~1) (<= 100000 ~SIZE~0))} assume !!(~i~1 < ~SIZE~0 && 1 != ~found~0);call #t~mem8 := read~int(~#set~0.base, ~#set~0.offset + 4 * ~i~1, 4); {11931#(and (= 0 main_~i~1) (<= 100000 ~SIZE~0))} is VALID [2018-11-18 23:02:23,860 INFO L273 TraceCheckUtils]: 136: Hoare triple {11931#(and (= 0 main_~i~1) (<= 100000 ~SIZE~0))} assume #t~mem8 == ~element~0;havoc #t~mem8;~found~0 := 1;~pos~0 := ~i~1; {11932#(and (= 0 main_~pos~0) (<= 100000 ~SIZE~0))} is VALID [2018-11-18 23:02:23,861 INFO L273 TraceCheckUtils]: 137: Hoare triple {11932#(and (= 0 main_~pos~0) (<= 100000 ~SIZE~0))} #t~post7 := ~i~1;~i~1 := 1 + #t~post7;havoc #t~post7; {11932#(and (= 0 main_~pos~0) (<= 100000 ~SIZE~0))} is VALID [2018-11-18 23:02:23,861 INFO L273 TraceCheckUtils]: 138: Hoare triple {11932#(and (= 0 main_~pos~0) (<= 100000 ~SIZE~0))} assume true; {11932#(and (= 0 main_~pos~0) (<= 100000 ~SIZE~0))} is VALID [2018-11-18 23:02:23,862 INFO L273 TraceCheckUtils]: 139: Hoare triple {11932#(and (= 0 main_~pos~0) (<= 100000 ~SIZE~0))} assume !(~i~1 < ~SIZE~0 && 1 != ~found~0); {11932#(and (= 0 main_~pos~0) (<= 100000 ~SIZE~0))} is VALID [2018-11-18 23:02:23,863 INFO L273 TraceCheckUtils]: 140: Hoare triple {11932#(and (= 0 main_~pos~0) (<= 100000 ~SIZE~0))} assume 1 == ~found~0;~i~1 := ~pos~0; {11931#(and (= 0 main_~i~1) (<= 100000 ~SIZE~0))} is VALID [2018-11-18 23:02:23,864 INFO L273 TraceCheckUtils]: 141: Hoare triple {11931#(and (= 0 main_~i~1) (<= 100000 ~SIZE~0))} assume true; {11931#(and (= 0 main_~i~1) (<= 100000 ~SIZE~0))} is VALID [2018-11-18 23:02:23,864 INFO L273 TraceCheckUtils]: 142: Hoare triple {11931#(and (= 0 main_~i~1) (<= 100000 ~SIZE~0))} assume !!(~i~1 < ~SIZE~0 - 1);call #t~mem10 := read~int(~#set~0.base, ~#set~0.offset + 4 * (1 + ~i~1), 4);call write~int(#t~mem10, ~#set~0.base, ~#set~0.offset + 4 * ~i~1, 4);havoc #t~mem10; {11931#(and (= 0 main_~i~1) (<= 100000 ~SIZE~0))} is VALID [2018-11-18 23:02:23,865 INFO L273 TraceCheckUtils]: 143: Hoare triple {11931#(and (= 0 main_~i~1) (<= 100000 ~SIZE~0))} #t~post9 := ~i~1;~i~1 := 1 + #t~post9;havoc #t~post9; {11933#(<= (+ main_~i~1 99999) ~SIZE~0)} is VALID [2018-11-18 23:02:23,866 INFO L273 TraceCheckUtils]: 144: Hoare triple {11933#(<= (+ main_~i~1 99999) ~SIZE~0)} assume true; {11933#(<= (+ main_~i~1 99999) ~SIZE~0)} is VALID [2018-11-18 23:02:23,866 INFO L273 TraceCheckUtils]: 145: Hoare triple {11933#(<= (+ main_~i~1 99999) ~SIZE~0)} assume !!(~i~1 < ~SIZE~0 - 1);call #t~mem10 := read~int(~#set~0.base, ~#set~0.offset + 4 * (1 + ~i~1), 4);call write~int(#t~mem10, ~#set~0.base, ~#set~0.offset + 4 * ~i~1, 4);havoc #t~mem10; {11933#(<= (+ main_~i~1 99999) ~SIZE~0)} is VALID [2018-11-18 23:02:23,867 INFO L273 TraceCheckUtils]: 146: Hoare triple {11933#(<= (+ main_~i~1 99999) ~SIZE~0)} #t~post9 := ~i~1;~i~1 := 1 + #t~post9;havoc #t~post9; {11934#(<= (+ main_~i~1 99998) ~SIZE~0)} is VALID [2018-11-18 23:02:23,868 INFO L273 TraceCheckUtils]: 147: Hoare triple {11934#(<= (+ main_~i~1 99998) ~SIZE~0)} assume true; {11934#(<= (+ main_~i~1 99998) ~SIZE~0)} is VALID [2018-11-18 23:02:23,868 INFO L273 TraceCheckUtils]: 148: Hoare triple {11934#(<= (+ main_~i~1 99998) ~SIZE~0)} assume !!(~i~1 < ~SIZE~0 - 1);call #t~mem10 := read~int(~#set~0.base, ~#set~0.offset + 4 * (1 + ~i~1), 4);call write~int(#t~mem10, ~#set~0.base, ~#set~0.offset + 4 * ~i~1, 4);havoc #t~mem10; {11934#(<= (+ main_~i~1 99998) ~SIZE~0)} is VALID [2018-11-18 23:02:23,869 INFO L273 TraceCheckUtils]: 149: Hoare triple {11934#(<= (+ main_~i~1 99998) ~SIZE~0)} #t~post9 := ~i~1;~i~1 := 1 + #t~post9;havoc #t~post9; {11935#(<= (+ main_~i~1 99997) ~SIZE~0)} is VALID [2018-11-18 23:02:23,870 INFO L273 TraceCheckUtils]: 150: Hoare triple {11935#(<= (+ main_~i~1 99997) ~SIZE~0)} assume true; {11935#(<= (+ main_~i~1 99997) ~SIZE~0)} is VALID [2018-11-18 23:02:23,870 INFO L273 TraceCheckUtils]: 151: Hoare triple {11935#(<= (+ main_~i~1 99997) ~SIZE~0)} assume !(~i~1 < ~SIZE~0 - 1); {11929#false} is VALID [2018-11-18 23:02:23,871 INFO L273 TraceCheckUtils]: 152: Hoare triple {11929#false} assume 1 == ~found~0;~i~1 := 0; {11929#false} is VALID [2018-11-18 23:02:23,871 INFO L273 TraceCheckUtils]: 153: Hoare triple {11929#false} assume true; {11929#false} is VALID [2018-11-18 23:02:23,871 INFO L273 TraceCheckUtils]: 154: Hoare triple {11929#false} assume !!(~i~1 < ~SIZE~0 - 1);call #t~mem12 := read~int(~#set~0.base, ~#set~0.offset + 4 * ~i~1, 4); {11929#false} is VALID [2018-11-18 23:02:23,871 INFO L256 TraceCheckUtils]: 155: Hoare triple {11929#false} call __VERIFIER_assert((if #t~mem12 != ~element~0 then 1 else 0)); {11929#false} is VALID [2018-11-18 23:02:23,871 INFO L273 TraceCheckUtils]: 156: Hoare triple {11929#false} ~cond := #in~cond; {11929#false} is VALID [2018-11-18 23:02:23,872 INFO L273 TraceCheckUtils]: 157: Hoare triple {11929#false} assume 0 == ~cond; {11929#false} is VALID [2018-11-18 23:02:23,872 INFO L273 TraceCheckUtils]: 158: Hoare triple {11929#false} assume !false; {11929#false} is VALID [2018-11-18 23:02:23,886 INFO L134 CoverageAnalysis]: Checked inductivity of 568 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 551 trivial. 0 not checked. [2018-11-18 23:02:23,886 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 23:02:23,886 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-18 23:02:23,896 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-18 23:02:23,989 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-18 23:02:23,989 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-18 23:02:24,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 23:02:24,022 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 23:02:24,494 INFO L256 TraceCheckUtils]: 0: Hoare triple {11928#true} call ULTIMATE.init(); {11928#true} is VALID [2018-11-18 23:02:24,495 INFO L273 TraceCheckUtils]: 1: Hoare triple {11928#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~SIZE~0 := 100000; {11930#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:02:24,496 INFO L273 TraceCheckUtils]: 2: Hoare triple {11930#(<= 100000 ~SIZE~0)} assume true; {11930#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:02:24,496 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {11930#(<= 100000 ~SIZE~0)} {11928#true} #128#return; {11930#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:02:24,497 INFO L256 TraceCheckUtils]: 4: Hoare triple {11930#(<= 100000 ~SIZE~0)} call #t~ret13 := main(); {11930#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:02:24,498 INFO L273 TraceCheckUtils]: 5: Hoare triple {11930#(<= 100000 ~SIZE~0)} havoc ~i~1;havoc ~pos~0;~n~0 := 0;~found~0 := 0;call ~#set~0.base, ~#set~0.offset := #Ultimate.alloc(4 * ~SIZE~0);call ~#values~0.base, ~#values~0.offset := #Ultimate.alloc(4 * ~SIZE~0);havoc ~element~0;havoc ~v~0;~v~0 := 0; {11954#(and (<= main_~v~0 0) (<= 100000 ~SIZE~0))} is VALID [2018-11-18 23:02:24,499 INFO L273 TraceCheckUtils]: 6: Hoare triple {11954#(and (<= main_~v~0 0) (<= 100000 ~SIZE~0))} assume true; {11954#(and (<= main_~v~0 0) (<= 100000 ~SIZE~0))} is VALID [2018-11-18 23:02:24,500 INFO L273 TraceCheckUtils]: 7: Hoare triple {11954#(and (<= main_~v~0 0) (<= 100000 ~SIZE~0))} assume !!(~v~0 < ~SIZE~0);call #t~mem3 := read~int(~#values~0.base, ~#values~0.offset + 4 * ~v~0, 4); {11954#(and (<= main_~v~0 0) (<= 100000 ~SIZE~0))} is VALID [2018-11-18 23:02:24,501 INFO L256 TraceCheckUtils]: 8: Hoare triple {11954#(and (<= main_~v~0 0) (<= 100000 ~SIZE~0))} call #t~ret4 := elem_exists(~#set~0.base, ~#set~0.offset, ~n~0, #t~mem3); {11930#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:02:24,502 INFO L273 TraceCheckUtils]: 9: Hoare triple {11930#(<= 100000 ~SIZE~0)} ~set.base, ~set.offset := #in~set.base, #in~set.offset;~size := #in~size;~value := #in~value;havoc ~i~0;~i~0 := 0; {11930#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:02:24,502 INFO L273 TraceCheckUtils]: 10: Hoare triple {11930#(<= 100000 ~SIZE~0)} assume true; {11930#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:02:24,503 INFO L273 TraceCheckUtils]: 11: Hoare triple {11930#(<= 100000 ~SIZE~0)} assume !(~i~0 < ~size); {11930#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:02:24,503 INFO L273 TraceCheckUtils]: 12: Hoare triple {11930#(<= 100000 ~SIZE~0)} #res := 0; {11930#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:02:24,504 INFO L273 TraceCheckUtils]: 13: Hoare triple {11930#(<= 100000 ~SIZE~0)} assume true; {11930#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:02:24,505 INFO L268 TraceCheckUtils]: 14: Hoare quadruple {11930#(<= 100000 ~SIZE~0)} {11954#(and (<= main_~v~0 0) (<= 100000 ~SIZE~0))} #132#return; {11954#(and (<= main_~v~0 0) (<= 100000 ~SIZE~0))} is VALID [2018-11-18 23:02:24,506 INFO L273 TraceCheckUtils]: 15: Hoare triple {11954#(and (<= main_~v~0 0) (<= 100000 ~SIZE~0))} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {11954#(and (<= main_~v~0 0) (<= 100000 ~SIZE~0))} is VALID [2018-11-18 23:02:24,507 INFO L273 TraceCheckUtils]: 16: Hoare triple {11954#(and (<= main_~v~0 0) (<= 100000 ~SIZE~0))} assume 1 != #t~ret4;havoc #t~mem3;havoc #t~ret4;call #t~mem5 := read~int(~#values~0.base, ~#values~0.offset + 4 * ~v~0, 4); {11954#(and (<= main_~v~0 0) (<= 100000 ~SIZE~0))} is VALID [2018-11-18 23:02:24,508 INFO L256 TraceCheckUtils]: 17: Hoare triple {11954#(and (<= main_~v~0 0) (<= 100000 ~SIZE~0))} call #t~ret6 := insert(~#set~0.base, ~#set~0.offset, ~n~0, #t~mem5); {11930#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:02:24,509 INFO L273 TraceCheckUtils]: 18: Hoare triple {11930#(<= 100000 ~SIZE~0)} ~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; {11930#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:02:24,509 INFO L273 TraceCheckUtils]: 19: Hoare triple {11930#(<= 100000 ~SIZE~0)} assume true; {11930#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:02:24,510 INFO L268 TraceCheckUtils]: 20: Hoare quadruple {11930#(<= 100000 ~SIZE~0)} {11954#(and (<= main_~v~0 0) (<= 100000 ~SIZE~0))} #134#return; {11954#(and (<= main_~v~0 0) (<= 100000 ~SIZE~0))} is VALID [2018-11-18 23:02:24,511 INFO L273 TraceCheckUtils]: 21: Hoare triple {11954#(and (<= main_~v~0 0) (<= 100000 ~SIZE~0))} assume -2147483648 <= #t~ret6 && #t~ret6 <= 2147483647;~n~0 := #t~ret6;havoc #t~ret6;havoc #t~mem5; {11954#(and (<= main_~v~0 0) (<= 100000 ~SIZE~0))} is VALID [2018-11-18 23:02:24,512 INFO L273 TraceCheckUtils]: 22: Hoare triple {11954#(and (<= main_~v~0 0) (<= 100000 ~SIZE~0))} #t~post2 := ~v~0;~v~0 := 1 + #t~post2;havoc #t~post2; {12006#(and (<= main_~v~0 1) (<= 100000 ~SIZE~0))} is VALID [2018-11-18 23:02:24,513 INFO L273 TraceCheckUtils]: 23: Hoare triple {12006#(and (<= main_~v~0 1) (<= 100000 ~SIZE~0))} assume true; {12006#(and (<= main_~v~0 1) (<= 100000 ~SIZE~0))} is VALID [2018-11-18 23:02:24,513 INFO L273 TraceCheckUtils]: 24: Hoare triple {12006#(and (<= main_~v~0 1) (<= 100000 ~SIZE~0))} assume !!(~v~0 < ~SIZE~0);call #t~mem3 := read~int(~#values~0.base, ~#values~0.offset + 4 * ~v~0, 4); {12006#(and (<= main_~v~0 1) (<= 100000 ~SIZE~0))} is VALID [2018-11-18 23:02:24,515 INFO L256 TraceCheckUtils]: 25: Hoare triple {12006#(and (<= main_~v~0 1) (<= 100000 ~SIZE~0))} call #t~ret4 := elem_exists(~#set~0.base, ~#set~0.offset, ~n~0, #t~mem3); {11930#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:02:24,515 INFO L273 TraceCheckUtils]: 26: Hoare triple {11930#(<= 100000 ~SIZE~0)} ~set.base, ~set.offset := #in~set.base, #in~set.offset;~size := #in~size;~value := #in~value;havoc ~i~0;~i~0 := 0; {11930#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:02:24,516 INFO L273 TraceCheckUtils]: 27: Hoare triple {11930#(<= 100000 ~SIZE~0)} assume true; {11930#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:02:24,516 INFO L273 TraceCheckUtils]: 28: Hoare triple {11930#(<= 100000 ~SIZE~0)} assume !!(~i~0 < ~size);call #t~mem1 := read~int(~set.base, ~set.offset + 4 * ~i~0, 4); {11930#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:02:24,517 INFO L273 TraceCheckUtils]: 29: Hoare triple {11930#(<= 100000 ~SIZE~0)} assume #t~mem1 == ~value;havoc #t~mem1;#res := 1; {11930#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:02:24,518 INFO L273 TraceCheckUtils]: 30: Hoare triple {11930#(<= 100000 ~SIZE~0)} assume true; {11930#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:02:24,519 INFO L268 TraceCheckUtils]: 31: Hoare quadruple {11930#(<= 100000 ~SIZE~0)} {12006#(and (<= main_~v~0 1) (<= 100000 ~SIZE~0))} #132#return; {12006#(and (<= main_~v~0 1) (<= 100000 ~SIZE~0))} is VALID [2018-11-18 23:02:24,520 INFO L273 TraceCheckUtils]: 32: Hoare triple {12006#(and (<= main_~v~0 1) (<= 100000 ~SIZE~0))} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {12006#(and (<= main_~v~0 1) (<= 100000 ~SIZE~0))} is VALID [2018-11-18 23:02:24,520 INFO L273 TraceCheckUtils]: 33: Hoare triple {12006#(and (<= main_~v~0 1) (<= 100000 ~SIZE~0))} assume !(1 != #t~ret4);havoc #t~mem3;havoc #t~ret4; {12006#(and (<= main_~v~0 1) (<= 100000 ~SIZE~0))} is VALID [2018-11-18 23:02:24,521 INFO L273 TraceCheckUtils]: 34: Hoare triple {12006#(and (<= main_~v~0 1) (<= 100000 ~SIZE~0))} #t~post2 := ~v~0;~v~0 := 1 + #t~post2;havoc #t~post2; {12043#(and (<= main_~v~0 2) (<= 100000 ~SIZE~0))} is VALID [2018-11-18 23:02:24,522 INFO L273 TraceCheckUtils]: 35: Hoare triple {12043#(and (<= main_~v~0 2) (<= 100000 ~SIZE~0))} assume true; {12043#(and (<= main_~v~0 2) (<= 100000 ~SIZE~0))} is VALID [2018-11-18 23:02:24,522 INFO L273 TraceCheckUtils]: 36: Hoare triple {12043#(and (<= main_~v~0 2) (<= 100000 ~SIZE~0))} assume !!(~v~0 < ~SIZE~0);call #t~mem3 := read~int(~#values~0.base, ~#values~0.offset + 4 * ~v~0, 4); {12043#(and (<= main_~v~0 2) (<= 100000 ~SIZE~0))} is VALID [2018-11-18 23:02:24,524 INFO L256 TraceCheckUtils]: 37: Hoare triple {12043#(and (<= main_~v~0 2) (<= 100000 ~SIZE~0))} call #t~ret4 := elem_exists(~#set~0.base, ~#set~0.offset, ~n~0, #t~mem3); {11930#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:02:24,524 INFO L273 TraceCheckUtils]: 38: Hoare triple {11930#(<= 100000 ~SIZE~0)} ~set.base, ~set.offset := #in~set.base, #in~set.offset;~size := #in~size;~value := #in~value;havoc ~i~0;~i~0 := 0; {11930#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:02:24,525 INFO L273 TraceCheckUtils]: 39: Hoare triple {11930#(<= 100000 ~SIZE~0)} assume true; {11930#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:02:24,525 INFO L273 TraceCheckUtils]: 40: Hoare triple {11930#(<= 100000 ~SIZE~0)} assume !!(~i~0 < ~size);call #t~mem1 := read~int(~set.base, ~set.offset + 4 * ~i~0, 4); {11930#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:02:24,526 INFO L273 TraceCheckUtils]: 41: Hoare triple {11930#(<= 100000 ~SIZE~0)} assume #t~mem1 == ~value;havoc #t~mem1;#res := 1; {11930#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:02:24,527 INFO L273 TraceCheckUtils]: 42: Hoare triple {11930#(<= 100000 ~SIZE~0)} assume true; {11930#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:02:24,528 INFO L268 TraceCheckUtils]: 43: Hoare quadruple {11930#(<= 100000 ~SIZE~0)} {12043#(and (<= main_~v~0 2) (<= 100000 ~SIZE~0))} #132#return; {12043#(and (<= main_~v~0 2) (<= 100000 ~SIZE~0))} is VALID [2018-11-18 23:02:24,529 INFO L273 TraceCheckUtils]: 44: Hoare triple {12043#(and (<= main_~v~0 2) (<= 100000 ~SIZE~0))} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {12043#(and (<= main_~v~0 2) (<= 100000 ~SIZE~0))} is VALID [2018-11-18 23:02:24,529 INFO L273 TraceCheckUtils]: 45: Hoare triple {12043#(and (<= main_~v~0 2) (<= 100000 ~SIZE~0))} assume !(1 != #t~ret4);havoc #t~mem3;havoc #t~ret4; {12043#(and (<= main_~v~0 2) (<= 100000 ~SIZE~0))} is VALID [2018-11-18 23:02:24,530 INFO L273 TraceCheckUtils]: 46: Hoare triple {12043#(and (<= main_~v~0 2) (<= 100000 ~SIZE~0))} #t~post2 := ~v~0;~v~0 := 1 + #t~post2;havoc #t~post2; {12080#(and (<= main_~v~0 3) (<= 100000 ~SIZE~0))} is VALID [2018-11-18 23:02:24,531 INFO L273 TraceCheckUtils]: 47: Hoare triple {12080#(and (<= main_~v~0 3) (<= 100000 ~SIZE~0))} assume true; {12080#(and (<= main_~v~0 3) (<= 100000 ~SIZE~0))} is VALID [2018-11-18 23:02:24,532 INFO L273 TraceCheckUtils]: 48: Hoare triple {12080#(and (<= main_~v~0 3) (<= 100000 ~SIZE~0))} assume !!(~v~0 < ~SIZE~0);call #t~mem3 := read~int(~#values~0.base, ~#values~0.offset + 4 * ~v~0, 4); {12080#(and (<= main_~v~0 3) (<= 100000 ~SIZE~0))} is VALID [2018-11-18 23:02:24,533 INFO L256 TraceCheckUtils]: 49: Hoare triple {12080#(and (<= main_~v~0 3) (<= 100000 ~SIZE~0))} call #t~ret4 := elem_exists(~#set~0.base, ~#set~0.offset, ~n~0, #t~mem3); {11930#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:02:24,534 INFO L273 TraceCheckUtils]: 50: Hoare triple {11930#(<= 100000 ~SIZE~0)} ~set.base, ~set.offset := #in~set.base, #in~set.offset;~size := #in~size;~value := #in~value;havoc ~i~0;~i~0 := 0; {11930#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:02:24,534 INFO L273 TraceCheckUtils]: 51: Hoare triple {11930#(<= 100000 ~SIZE~0)} assume true; {11930#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:02:24,535 INFO L273 TraceCheckUtils]: 52: Hoare triple {11930#(<= 100000 ~SIZE~0)} assume !!(~i~0 < ~size);call #t~mem1 := read~int(~set.base, ~set.offset + 4 * ~i~0, 4); {11930#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:02:24,535 INFO L273 TraceCheckUtils]: 53: Hoare triple {11930#(<= 100000 ~SIZE~0)} assume #t~mem1 == ~value;havoc #t~mem1;#res := 1; {11930#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:02:24,536 INFO L273 TraceCheckUtils]: 54: Hoare triple {11930#(<= 100000 ~SIZE~0)} assume true; {11930#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:02:24,537 INFO L268 TraceCheckUtils]: 55: Hoare quadruple {11930#(<= 100000 ~SIZE~0)} {12080#(and (<= main_~v~0 3) (<= 100000 ~SIZE~0))} #132#return; {12080#(and (<= main_~v~0 3) (<= 100000 ~SIZE~0))} is VALID [2018-11-18 23:02:24,538 INFO L273 TraceCheckUtils]: 56: Hoare triple {12080#(and (<= main_~v~0 3) (<= 100000 ~SIZE~0))} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {12080#(and (<= main_~v~0 3) (<= 100000 ~SIZE~0))} is VALID [2018-11-18 23:02:24,538 INFO L273 TraceCheckUtils]: 57: Hoare triple {12080#(and (<= main_~v~0 3) (<= 100000 ~SIZE~0))} assume !(1 != #t~ret4);havoc #t~mem3;havoc #t~ret4; {12080#(and (<= main_~v~0 3) (<= 100000 ~SIZE~0))} is VALID [2018-11-18 23:02:24,539 INFO L273 TraceCheckUtils]: 58: Hoare triple {12080#(and (<= main_~v~0 3) (<= 100000 ~SIZE~0))} #t~post2 := ~v~0;~v~0 := 1 + #t~post2;havoc #t~post2; {12117#(and (<= main_~v~0 4) (<= 100000 ~SIZE~0))} is VALID [2018-11-18 23:02:24,540 INFO L273 TraceCheckUtils]: 59: Hoare triple {12117#(and (<= main_~v~0 4) (<= 100000 ~SIZE~0))} assume true; {12117#(and (<= main_~v~0 4) (<= 100000 ~SIZE~0))} is VALID [2018-11-18 23:02:24,541 INFO L273 TraceCheckUtils]: 60: Hoare triple {12117#(and (<= main_~v~0 4) (<= 100000 ~SIZE~0))} assume !!(~v~0 < ~SIZE~0);call #t~mem3 := read~int(~#values~0.base, ~#values~0.offset + 4 * ~v~0, 4); {12117#(and (<= main_~v~0 4) (<= 100000 ~SIZE~0))} is VALID [2018-11-18 23:02:24,542 INFO L256 TraceCheckUtils]: 61: Hoare triple {12117#(and (<= main_~v~0 4) (<= 100000 ~SIZE~0))} call #t~ret4 := elem_exists(~#set~0.base, ~#set~0.offset, ~n~0, #t~mem3); {11930#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:02:24,543 INFO L273 TraceCheckUtils]: 62: Hoare triple {11930#(<= 100000 ~SIZE~0)} ~set.base, ~set.offset := #in~set.base, #in~set.offset;~size := #in~size;~value := #in~value;havoc ~i~0;~i~0 := 0; {11930#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:02:24,543 INFO L273 TraceCheckUtils]: 63: Hoare triple {11930#(<= 100000 ~SIZE~0)} assume true; {11930#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:02:24,544 INFO L273 TraceCheckUtils]: 64: Hoare triple {11930#(<= 100000 ~SIZE~0)} assume !!(~i~0 < ~size);call #t~mem1 := read~int(~set.base, ~set.offset + 4 * ~i~0, 4); {11930#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:02:24,544 INFO L273 TraceCheckUtils]: 65: Hoare triple {11930#(<= 100000 ~SIZE~0)} assume #t~mem1 == ~value;havoc #t~mem1;#res := 1; {11930#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:02:24,545 INFO L273 TraceCheckUtils]: 66: Hoare triple {11930#(<= 100000 ~SIZE~0)} assume true; {11930#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:02:24,546 INFO L268 TraceCheckUtils]: 67: Hoare quadruple {11930#(<= 100000 ~SIZE~0)} {12117#(and (<= main_~v~0 4) (<= 100000 ~SIZE~0))} #132#return; {12117#(and (<= main_~v~0 4) (<= 100000 ~SIZE~0))} is VALID [2018-11-18 23:02:24,547 INFO L273 TraceCheckUtils]: 68: Hoare triple {12117#(and (<= main_~v~0 4) (<= 100000 ~SIZE~0))} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {12117#(and (<= main_~v~0 4) (<= 100000 ~SIZE~0))} is VALID [2018-11-18 23:02:24,548 INFO L273 TraceCheckUtils]: 69: Hoare triple {12117#(and (<= main_~v~0 4) (<= 100000 ~SIZE~0))} assume !(1 != #t~ret4);havoc #t~mem3;havoc #t~ret4; {12117#(and (<= main_~v~0 4) (<= 100000 ~SIZE~0))} is VALID [2018-11-18 23:02:24,548 INFO L273 TraceCheckUtils]: 70: Hoare triple {12117#(and (<= main_~v~0 4) (<= 100000 ~SIZE~0))} #t~post2 := ~v~0;~v~0 := 1 + #t~post2;havoc #t~post2; {12154#(and (<= main_~v~0 5) (<= 100000 ~SIZE~0))} is VALID [2018-11-18 23:02:24,549 INFO L273 TraceCheckUtils]: 71: Hoare triple {12154#(and (<= main_~v~0 5) (<= 100000 ~SIZE~0))} assume true; {12154#(and (<= main_~v~0 5) (<= 100000 ~SIZE~0))} is VALID [2018-11-18 23:02:24,550 INFO L273 TraceCheckUtils]: 72: Hoare triple {12154#(and (<= main_~v~0 5) (<= 100000 ~SIZE~0))} assume !!(~v~0 < ~SIZE~0);call #t~mem3 := read~int(~#values~0.base, ~#values~0.offset + 4 * ~v~0, 4); {12154#(and (<= main_~v~0 5) (<= 100000 ~SIZE~0))} is VALID [2018-11-18 23:02:24,551 INFO L256 TraceCheckUtils]: 73: Hoare triple {12154#(and (<= main_~v~0 5) (<= 100000 ~SIZE~0))} call #t~ret4 := elem_exists(~#set~0.base, ~#set~0.offset, ~n~0, #t~mem3); {11930#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:02:24,552 INFO L273 TraceCheckUtils]: 74: Hoare triple {11930#(<= 100000 ~SIZE~0)} ~set.base, ~set.offset := #in~set.base, #in~set.offset;~size := #in~size;~value := #in~value;havoc ~i~0;~i~0 := 0; {11930#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:02:24,553 INFO L273 TraceCheckUtils]: 75: Hoare triple {11930#(<= 100000 ~SIZE~0)} assume true; {11930#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:02:24,553 INFO L273 TraceCheckUtils]: 76: Hoare triple {11930#(<= 100000 ~SIZE~0)} assume !!(~i~0 < ~size);call #t~mem1 := read~int(~set.base, ~set.offset + 4 * ~i~0, 4); {11930#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:02:24,554 INFO L273 TraceCheckUtils]: 77: Hoare triple {11930#(<= 100000 ~SIZE~0)} assume #t~mem1 == ~value;havoc #t~mem1;#res := 1; {11930#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:02:24,554 INFO L273 TraceCheckUtils]: 78: Hoare triple {11930#(<= 100000 ~SIZE~0)} assume true; {11930#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:02:24,555 INFO L268 TraceCheckUtils]: 79: Hoare quadruple {11930#(<= 100000 ~SIZE~0)} {12154#(and (<= main_~v~0 5) (<= 100000 ~SIZE~0))} #132#return; {12154#(and (<= main_~v~0 5) (<= 100000 ~SIZE~0))} is VALID [2018-11-18 23:02:24,556 INFO L273 TraceCheckUtils]: 80: Hoare triple {12154#(and (<= main_~v~0 5) (<= 100000 ~SIZE~0))} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {12154#(and (<= main_~v~0 5) (<= 100000 ~SIZE~0))} is VALID [2018-11-18 23:02:24,557 INFO L273 TraceCheckUtils]: 81: Hoare triple {12154#(and (<= main_~v~0 5) (<= 100000 ~SIZE~0))} assume !(1 != #t~ret4);havoc #t~mem3;havoc #t~ret4; {12154#(and (<= main_~v~0 5) (<= 100000 ~SIZE~0))} is VALID [2018-11-18 23:02:24,558 INFO L273 TraceCheckUtils]: 82: Hoare triple {12154#(and (<= main_~v~0 5) (<= 100000 ~SIZE~0))} #t~post2 := ~v~0;~v~0 := 1 + #t~post2;havoc #t~post2; {12191#(and (<= main_~v~0 6) (<= 100000 ~SIZE~0))} is VALID [2018-11-18 23:02:24,558 INFO L273 TraceCheckUtils]: 83: Hoare triple {12191#(and (<= main_~v~0 6) (<= 100000 ~SIZE~0))} assume true; {12191#(and (<= main_~v~0 6) (<= 100000 ~SIZE~0))} is VALID [2018-11-18 23:02:24,559 INFO L273 TraceCheckUtils]: 84: Hoare triple {12191#(and (<= main_~v~0 6) (<= 100000 ~SIZE~0))} assume !!(~v~0 < ~SIZE~0);call #t~mem3 := read~int(~#values~0.base, ~#values~0.offset + 4 * ~v~0, 4); {12191#(and (<= main_~v~0 6) (<= 100000 ~SIZE~0))} is VALID [2018-11-18 23:02:24,561 INFO L256 TraceCheckUtils]: 85: Hoare triple {12191#(and (<= main_~v~0 6) (<= 100000 ~SIZE~0))} call #t~ret4 := elem_exists(~#set~0.base, ~#set~0.offset, ~n~0, #t~mem3); {11930#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:02:24,561 INFO L273 TraceCheckUtils]: 86: Hoare triple {11930#(<= 100000 ~SIZE~0)} ~set.base, ~set.offset := #in~set.base, #in~set.offset;~size := #in~size;~value := #in~value;havoc ~i~0;~i~0 := 0; {11930#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:02:24,562 INFO L273 TraceCheckUtils]: 87: Hoare triple {11930#(<= 100000 ~SIZE~0)} assume true; {11930#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:02:24,562 INFO L273 TraceCheckUtils]: 88: Hoare triple {11930#(<= 100000 ~SIZE~0)} assume !!(~i~0 < ~size);call #t~mem1 := read~int(~set.base, ~set.offset + 4 * ~i~0, 4); {11930#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:02:24,563 INFO L273 TraceCheckUtils]: 89: Hoare triple {11930#(<= 100000 ~SIZE~0)} assume #t~mem1 == ~value;havoc #t~mem1;#res := 1; {11930#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:02:24,563 INFO L273 TraceCheckUtils]: 90: Hoare triple {11930#(<= 100000 ~SIZE~0)} assume true; {11930#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:02:24,565 INFO L268 TraceCheckUtils]: 91: Hoare quadruple {11930#(<= 100000 ~SIZE~0)} {12191#(and (<= main_~v~0 6) (<= 100000 ~SIZE~0))} #132#return; {12191#(and (<= main_~v~0 6) (<= 100000 ~SIZE~0))} is VALID [2018-11-18 23:02:24,565 INFO L273 TraceCheckUtils]: 92: Hoare triple {12191#(and (<= main_~v~0 6) (<= 100000 ~SIZE~0))} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {12191#(and (<= main_~v~0 6) (<= 100000 ~SIZE~0))} is VALID [2018-11-18 23:02:24,566 INFO L273 TraceCheckUtils]: 93: Hoare triple {12191#(and (<= main_~v~0 6) (<= 100000 ~SIZE~0))} assume !(1 != #t~ret4);havoc #t~mem3;havoc #t~ret4; {12191#(and (<= main_~v~0 6) (<= 100000 ~SIZE~0))} is VALID [2018-11-18 23:02:24,567 INFO L273 TraceCheckUtils]: 94: Hoare triple {12191#(and (<= main_~v~0 6) (<= 100000 ~SIZE~0))} #t~post2 := ~v~0;~v~0 := 1 + #t~post2;havoc #t~post2; {12228#(and (<= main_~v~0 7) (<= 100000 ~SIZE~0))} is VALID [2018-11-18 23:02:24,567 INFO L273 TraceCheckUtils]: 95: Hoare triple {12228#(and (<= main_~v~0 7) (<= 100000 ~SIZE~0))} assume true; {12228#(and (<= main_~v~0 7) (<= 100000 ~SIZE~0))} is VALID [2018-11-18 23:02:24,568 INFO L273 TraceCheckUtils]: 96: Hoare triple {12228#(and (<= main_~v~0 7) (<= 100000 ~SIZE~0))} assume !!(~v~0 < ~SIZE~0);call #t~mem3 := read~int(~#values~0.base, ~#values~0.offset + 4 * ~v~0, 4); {12228#(and (<= main_~v~0 7) (<= 100000 ~SIZE~0))} is VALID [2018-11-18 23:02:24,570 INFO L256 TraceCheckUtils]: 97: Hoare triple {12228#(and (<= main_~v~0 7) (<= 100000 ~SIZE~0))} call #t~ret4 := elem_exists(~#set~0.base, ~#set~0.offset, ~n~0, #t~mem3); {11930#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:02:24,570 INFO L273 TraceCheckUtils]: 98: Hoare triple {11930#(<= 100000 ~SIZE~0)} ~set.base, ~set.offset := #in~set.base, #in~set.offset;~size := #in~size;~value := #in~value;havoc ~i~0;~i~0 := 0; {11930#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:02:24,571 INFO L273 TraceCheckUtils]: 99: Hoare triple {11930#(<= 100000 ~SIZE~0)} assume true; {11930#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:02:24,571 INFO L273 TraceCheckUtils]: 100: Hoare triple {11930#(<= 100000 ~SIZE~0)} assume !!(~i~0 < ~size);call #t~mem1 := read~int(~set.base, ~set.offset + 4 * ~i~0, 4); {11930#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:02:24,572 INFO L273 TraceCheckUtils]: 101: Hoare triple {11930#(<= 100000 ~SIZE~0)} assume #t~mem1 == ~value;havoc #t~mem1;#res := 1; {11930#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:02:24,572 INFO L273 TraceCheckUtils]: 102: Hoare triple {11930#(<= 100000 ~SIZE~0)} assume true; {11930#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:02:24,574 INFO L268 TraceCheckUtils]: 103: Hoare quadruple {11930#(<= 100000 ~SIZE~0)} {12228#(and (<= main_~v~0 7) (<= 100000 ~SIZE~0))} #132#return; {12228#(and (<= main_~v~0 7) (<= 100000 ~SIZE~0))} is VALID [2018-11-18 23:02:24,574 INFO L273 TraceCheckUtils]: 104: Hoare triple {12228#(and (<= main_~v~0 7) (<= 100000 ~SIZE~0))} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {12228#(and (<= main_~v~0 7) (<= 100000 ~SIZE~0))} is VALID [2018-11-18 23:02:24,575 INFO L273 TraceCheckUtils]: 105: Hoare triple {12228#(and (<= main_~v~0 7) (<= 100000 ~SIZE~0))} assume !(1 != #t~ret4);havoc #t~mem3;havoc #t~ret4; {12228#(and (<= main_~v~0 7) (<= 100000 ~SIZE~0))} is VALID [2018-11-18 23:02:24,576 INFO L273 TraceCheckUtils]: 106: Hoare triple {12228#(and (<= main_~v~0 7) (<= 100000 ~SIZE~0))} #t~post2 := ~v~0;~v~0 := 1 + #t~post2;havoc #t~post2; {12265#(and (<= main_~v~0 8) (<= 100000 ~SIZE~0))} is VALID [2018-11-18 23:02:24,577 INFO L273 TraceCheckUtils]: 107: Hoare triple {12265#(and (<= main_~v~0 8) (<= 100000 ~SIZE~0))} assume true; {12265#(and (<= main_~v~0 8) (<= 100000 ~SIZE~0))} is VALID [2018-11-18 23:02:24,577 INFO L273 TraceCheckUtils]: 108: Hoare triple {12265#(and (<= main_~v~0 8) (<= 100000 ~SIZE~0))} assume !!(~v~0 < ~SIZE~0);call #t~mem3 := read~int(~#values~0.base, ~#values~0.offset + 4 * ~v~0, 4); {12265#(and (<= main_~v~0 8) (<= 100000 ~SIZE~0))} is VALID [2018-11-18 23:02:24,579 INFO L256 TraceCheckUtils]: 109: Hoare triple {12265#(and (<= main_~v~0 8) (<= 100000 ~SIZE~0))} call #t~ret4 := elem_exists(~#set~0.base, ~#set~0.offset, ~n~0, #t~mem3); {11930#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:02:24,580 INFO L273 TraceCheckUtils]: 110: Hoare triple {11930#(<= 100000 ~SIZE~0)} ~set.base, ~set.offset := #in~set.base, #in~set.offset;~size := #in~size;~value := #in~value;havoc ~i~0;~i~0 := 0; {11930#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:02:24,580 INFO L273 TraceCheckUtils]: 111: Hoare triple {11930#(<= 100000 ~SIZE~0)} assume true; {11930#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:02:24,581 INFO L273 TraceCheckUtils]: 112: Hoare triple {11930#(<= 100000 ~SIZE~0)} assume !!(~i~0 < ~size);call #t~mem1 := read~int(~set.base, ~set.offset + 4 * ~i~0, 4); {11930#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:02:24,581 INFO L273 TraceCheckUtils]: 113: Hoare triple {11930#(<= 100000 ~SIZE~0)} assume #t~mem1 == ~value;havoc #t~mem1;#res := 1; {11930#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:02:24,582 INFO L273 TraceCheckUtils]: 114: Hoare triple {11930#(<= 100000 ~SIZE~0)} assume true; {11930#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:02:24,583 INFO L268 TraceCheckUtils]: 115: Hoare quadruple {11930#(<= 100000 ~SIZE~0)} {12265#(and (<= main_~v~0 8) (<= 100000 ~SIZE~0))} #132#return; {12265#(and (<= main_~v~0 8) (<= 100000 ~SIZE~0))} is VALID [2018-11-18 23:02:24,584 INFO L273 TraceCheckUtils]: 116: Hoare triple {12265#(and (<= main_~v~0 8) (<= 100000 ~SIZE~0))} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {12265#(and (<= main_~v~0 8) (<= 100000 ~SIZE~0))} is VALID [2018-11-18 23:02:24,584 INFO L273 TraceCheckUtils]: 117: Hoare triple {12265#(and (<= main_~v~0 8) (<= 100000 ~SIZE~0))} assume !(1 != #t~ret4);havoc #t~mem3;havoc #t~ret4; {12265#(and (<= main_~v~0 8) (<= 100000 ~SIZE~0))} is VALID [2018-11-18 23:02:24,585 INFO L273 TraceCheckUtils]: 118: Hoare triple {12265#(and (<= main_~v~0 8) (<= 100000 ~SIZE~0))} #t~post2 := ~v~0;~v~0 := 1 + #t~post2;havoc #t~post2; {12302#(and (<= main_~v~0 9) (<= 100000 ~SIZE~0))} is VALID [2018-11-18 23:02:24,586 INFO L273 TraceCheckUtils]: 119: Hoare triple {12302#(and (<= main_~v~0 9) (<= 100000 ~SIZE~0))} assume true; {12302#(and (<= main_~v~0 9) (<= 100000 ~SIZE~0))} is VALID [2018-11-18 23:02:24,587 INFO L273 TraceCheckUtils]: 120: Hoare triple {12302#(and (<= main_~v~0 9) (<= 100000 ~SIZE~0))} assume !!(~v~0 < ~SIZE~0);call #t~mem3 := read~int(~#values~0.base, ~#values~0.offset + 4 * ~v~0, 4); {12302#(and (<= main_~v~0 9) (<= 100000 ~SIZE~0))} is VALID [2018-11-18 23:02:24,588 INFO L256 TraceCheckUtils]: 121: Hoare triple {12302#(and (<= main_~v~0 9) (<= 100000 ~SIZE~0))} call #t~ret4 := elem_exists(~#set~0.base, ~#set~0.offset, ~n~0, #t~mem3); {11930#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:02:24,589 INFO L273 TraceCheckUtils]: 122: Hoare triple {11930#(<= 100000 ~SIZE~0)} ~set.base, ~set.offset := #in~set.base, #in~set.offset;~size := #in~size;~value := #in~value;havoc ~i~0;~i~0 := 0; {11930#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:02:24,589 INFO L273 TraceCheckUtils]: 123: Hoare triple {11930#(<= 100000 ~SIZE~0)} assume true; {11930#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:02:24,590 INFO L273 TraceCheckUtils]: 124: Hoare triple {11930#(<= 100000 ~SIZE~0)} assume !!(~i~0 < ~size);call #t~mem1 := read~int(~set.base, ~set.offset + 4 * ~i~0, 4); {11930#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:02:24,590 INFO L273 TraceCheckUtils]: 125: Hoare triple {11930#(<= 100000 ~SIZE~0)} assume #t~mem1 == ~value;havoc #t~mem1;#res := 1; {11930#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:02:24,591 INFO L273 TraceCheckUtils]: 126: Hoare triple {11930#(<= 100000 ~SIZE~0)} assume true; {11930#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:02:24,592 INFO L268 TraceCheckUtils]: 127: Hoare quadruple {11930#(<= 100000 ~SIZE~0)} {12302#(and (<= main_~v~0 9) (<= 100000 ~SIZE~0))} #132#return; {12302#(and (<= main_~v~0 9) (<= 100000 ~SIZE~0))} is VALID [2018-11-18 23:02:24,593 INFO L273 TraceCheckUtils]: 128: Hoare triple {12302#(and (<= main_~v~0 9) (<= 100000 ~SIZE~0))} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {12302#(and (<= main_~v~0 9) (<= 100000 ~SIZE~0))} is VALID [2018-11-18 23:02:24,594 INFO L273 TraceCheckUtils]: 129: Hoare triple {12302#(and (<= main_~v~0 9) (<= 100000 ~SIZE~0))} assume !(1 != #t~ret4);havoc #t~mem3;havoc #t~ret4; {12302#(and (<= main_~v~0 9) (<= 100000 ~SIZE~0))} is VALID [2018-11-18 23:02:24,595 INFO L273 TraceCheckUtils]: 130: Hoare triple {12302#(and (<= main_~v~0 9) (<= 100000 ~SIZE~0))} #t~post2 := ~v~0;~v~0 := 1 + #t~post2;havoc #t~post2; {12339#(and (<= main_~v~0 10) (<= 100000 ~SIZE~0))} is VALID [2018-11-18 23:02:24,595 INFO L273 TraceCheckUtils]: 131: Hoare triple {12339#(and (<= main_~v~0 10) (<= 100000 ~SIZE~0))} assume true; {12339#(and (<= main_~v~0 10) (<= 100000 ~SIZE~0))} is VALID [2018-11-18 23:02:24,596 INFO L273 TraceCheckUtils]: 132: Hoare triple {12339#(and (<= main_~v~0 10) (<= 100000 ~SIZE~0))} assume !(~v~0 < ~SIZE~0); {11929#false} is VALID [2018-11-18 23:02:24,596 INFO L273 TraceCheckUtils]: 133: Hoare triple {11929#false} ~i~1 := 0; {11929#false} is VALID [2018-11-18 23:02:24,596 INFO L273 TraceCheckUtils]: 134: Hoare triple {11929#false} assume true; {11929#false} is VALID [2018-11-18 23:02:24,597 INFO L273 TraceCheckUtils]: 135: Hoare triple {11929#false} assume !!(~i~1 < ~SIZE~0 && 1 != ~found~0);call #t~mem8 := read~int(~#set~0.base, ~#set~0.offset + 4 * ~i~1, 4); {11929#false} is VALID [2018-11-18 23:02:24,597 INFO L273 TraceCheckUtils]: 136: Hoare triple {11929#false} assume #t~mem8 == ~element~0;havoc #t~mem8;~found~0 := 1;~pos~0 := ~i~1; {11929#false} is VALID [2018-11-18 23:02:24,597 INFO L273 TraceCheckUtils]: 137: Hoare triple {11929#false} #t~post7 := ~i~1;~i~1 := 1 + #t~post7;havoc #t~post7; {11929#false} is VALID [2018-11-18 23:02:24,597 INFO L273 TraceCheckUtils]: 138: Hoare triple {11929#false} assume true; {11929#false} is VALID [2018-11-18 23:02:24,597 INFO L273 TraceCheckUtils]: 139: Hoare triple {11929#false} assume !(~i~1 < ~SIZE~0 && 1 != ~found~0); {11929#false} is VALID [2018-11-18 23:02:24,598 INFO L273 TraceCheckUtils]: 140: Hoare triple {11929#false} assume 1 == ~found~0;~i~1 := ~pos~0; {11929#false} is VALID [2018-11-18 23:02:24,598 INFO L273 TraceCheckUtils]: 141: Hoare triple {11929#false} assume true; {11929#false} is VALID [2018-11-18 23:02:24,598 INFO L273 TraceCheckUtils]: 142: Hoare triple {11929#false} assume !!(~i~1 < ~SIZE~0 - 1);call #t~mem10 := read~int(~#set~0.base, ~#set~0.offset + 4 * (1 + ~i~1), 4);call write~int(#t~mem10, ~#set~0.base, ~#set~0.offset + 4 * ~i~1, 4);havoc #t~mem10; {11929#false} is VALID [2018-11-18 23:02:24,598 INFO L273 TraceCheckUtils]: 143: Hoare triple {11929#false} #t~post9 := ~i~1;~i~1 := 1 + #t~post9;havoc #t~post9; {11929#false} is VALID [2018-11-18 23:02:24,598 INFO L273 TraceCheckUtils]: 144: Hoare triple {11929#false} assume true; {11929#false} is VALID [2018-11-18 23:02:24,599 INFO L273 TraceCheckUtils]: 145: Hoare triple {11929#false} assume !!(~i~1 < ~SIZE~0 - 1);call #t~mem10 := read~int(~#set~0.base, ~#set~0.offset + 4 * (1 + ~i~1), 4);call write~int(#t~mem10, ~#set~0.base, ~#set~0.offset + 4 * ~i~1, 4);havoc #t~mem10; {11929#false} is VALID [2018-11-18 23:02:24,599 INFO L273 TraceCheckUtils]: 146: Hoare triple {11929#false} #t~post9 := ~i~1;~i~1 := 1 + #t~post9;havoc #t~post9; {11929#false} is VALID [2018-11-18 23:02:24,599 INFO L273 TraceCheckUtils]: 147: Hoare triple {11929#false} assume true; {11929#false} is VALID [2018-11-18 23:02:24,599 INFO L273 TraceCheckUtils]: 148: Hoare triple {11929#false} assume !!(~i~1 < ~SIZE~0 - 1);call #t~mem10 := read~int(~#set~0.base, ~#set~0.offset + 4 * (1 + ~i~1), 4);call write~int(#t~mem10, ~#set~0.base, ~#set~0.offset + 4 * ~i~1, 4);havoc #t~mem10; {11929#false} is VALID [2018-11-18 23:02:24,599 INFO L273 TraceCheckUtils]: 149: Hoare triple {11929#false} #t~post9 := ~i~1;~i~1 := 1 + #t~post9;havoc #t~post9; {11929#false} is VALID [2018-11-18 23:02:24,599 INFO L273 TraceCheckUtils]: 150: Hoare triple {11929#false} assume true; {11929#false} is VALID [2018-11-18 23:02:24,599 INFO L273 TraceCheckUtils]: 151: Hoare triple {11929#false} assume !(~i~1 < ~SIZE~0 - 1); {11929#false} is VALID [2018-11-18 23:02:24,599 INFO L273 TraceCheckUtils]: 152: Hoare triple {11929#false} assume 1 == ~found~0;~i~1 := 0; {11929#false} is VALID [2018-11-18 23:02:24,599 INFO L273 TraceCheckUtils]: 153: Hoare triple {11929#false} assume true; {11929#false} is VALID [2018-11-18 23:02:24,600 INFO L273 TraceCheckUtils]: 154: Hoare triple {11929#false} assume !!(~i~1 < ~SIZE~0 - 1);call #t~mem12 := read~int(~#set~0.base, ~#set~0.offset + 4 * ~i~1, 4); {11929#false} is VALID [2018-11-18 23:02:24,600 INFO L256 TraceCheckUtils]: 155: Hoare triple {11929#false} call __VERIFIER_assert((if #t~mem12 != ~element~0 then 1 else 0)); {11929#false} is VALID [2018-11-18 23:02:24,600 INFO L273 TraceCheckUtils]: 156: Hoare triple {11929#false} ~cond := #in~cond; {11929#false} is VALID [2018-11-18 23:02:24,600 INFO L273 TraceCheckUtils]: 157: Hoare triple {11929#false} assume 0 == ~cond; {11929#false} is VALID [2018-11-18 23:02:24,600 INFO L273 TraceCheckUtils]: 158: Hoare triple {11929#false} assume !false; {11929#false} is VALID [2018-11-18 23:02:24,622 INFO L134 CoverageAnalysis]: Checked inductivity of 568 backedges. 0 proven. 290 refuted. 0 times theorem prover too weak. 278 trivial. 0 not checked. [2018-11-18 23:02:24,641 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-18 23:02:24,641 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 14] total 19 [2018-11-18 23:02:24,642 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 159 [2018-11-18 23:02:24,642 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-18 23:02:24,643 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 19 states. [2018-11-18 23:02:24,810 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 149 edges. 149 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 23:02:24,811 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-11-18 23:02:24,811 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-11-18 23:02:24,811 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=109, Invalid=233, Unknown=0, NotChecked=0, Total=342 [2018-11-18 23:02:24,812 INFO L87 Difference]: Start difference. First operand 179 states and 231 transitions. Second operand 19 states. [2018-11-18 23:02:27,989 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 23:02:27,989 INFO L93 Difference]: Finished difference Result 316 states and 396 transitions. [2018-11-18 23:02:27,990 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-11-18 23:02:27,990 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 159 [2018-11-18 23:02:27,990 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 23:02:27,990 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2018-11-18 23:02:27,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 298 transitions. [2018-11-18 23:02:27,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2018-11-18 23:02:28,000 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 298 transitions. [2018-11-18 23:02:28,000 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 23 states and 298 transitions. [2018-11-18 23:02:28,632 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 298 edges. 298 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 23:02:28,638 INFO L225 Difference]: With dead ends: 316 [2018-11-18 23:02:28,638 INFO L226 Difference]: Without dead ends: 261 [2018-11-18 23:02:28,639 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 174 GetRequests, 149 SyntacticMatches, 1 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=171, Invalid=479, Unknown=0, NotChecked=0, Total=650 [2018-11-18 23:02:28,640 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 261 states. [2018-11-18 23:02:29,101 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 261 to 192. [2018-11-18 23:02:29,102 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-18 23:02:29,102 INFO L82 GeneralOperation]: Start isEquivalent. First operand 261 states. Second operand 192 states. [2018-11-18 23:02:29,102 INFO L74 IsIncluded]: Start isIncluded. First operand 261 states. Second operand 192 states. [2018-11-18 23:02:29,102 INFO L87 Difference]: Start difference. First operand 261 states. Second operand 192 states. [2018-11-18 23:02:29,110 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 23:02:29,111 INFO L93 Difference]: Finished difference Result 261 states and 334 transitions. [2018-11-18 23:02:29,111 INFO L276 IsEmpty]: Start isEmpty. Operand 261 states and 334 transitions. [2018-11-18 23:02:29,112 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 23:02:29,112 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 23:02:29,113 INFO L74 IsIncluded]: Start isIncluded. First operand 192 states. Second operand 261 states. [2018-11-18 23:02:29,113 INFO L87 Difference]: Start difference. First operand 192 states. Second operand 261 states. [2018-11-18 23:02:29,121 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 23:02:29,121 INFO L93 Difference]: Finished difference Result 261 states and 334 transitions. [2018-11-18 23:02:29,121 INFO L276 IsEmpty]: Start isEmpty. Operand 261 states and 334 transitions. [2018-11-18 23:02:29,122 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 23:02:29,122 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 23:02:29,123 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-18 23:02:29,123 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-18 23:02:29,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 192 states. [2018-11-18 23:02:29,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 192 states to 192 states and 249 transitions. [2018-11-18 23:02:29,128 INFO L78 Accepts]: Start accepts. Automaton has 192 states and 249 transitions. Word has length 159 [2018-11-18 23:02:29,128 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 23:02:29,129 INFO L480 AbstractCegarLoop]: Abstraction has 192 states and 249 transitions. [2018-11-18 23:02:29,129 INFO L481 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-11-18 23:02:29,129 INFO L276 IsEmpty]: Start isEmpty. Operand 192 states and 249 transitions. [2018-11-18 23:02:29,131 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2018-11-18 23:02:29,131 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 23:02:29,131 INFO L375 BasicCegarLoop]: trace histogram [12, 11, 11, 11, 11, 11, 11, 11, 11, 10, 10, 10, 3, 3, 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] [2018-11-18 23:02:29,132 INFO L423 AbstractCegarLoop]: === Iteration 17 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 23:02:29,132 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 23:02:29,132 INFO L82 PathProgramCache]: Analyzing trace with hash 1662148536, now seen corresponding path program 4 times [2018-11-18 23:02:29,132 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 23:02:29,132 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 23:02:29,133 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 23:02:29,133 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 23:02:29,133 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 23:02:29,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 23:02:29,673 INFO L256 TraceCheckUtils]: 0: Hoare triple {13622#true} call ULTIMATE.init(); {13622#true} is VALID [2018-11-18 23:02:29,674 INFO L273 TraceCheckUtils]: 1: Hoare triple {13622#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~SIZE~0 := 100000; {13624#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:02:29,675 INFO L273 TraceCheckUtils]: 2: Hoare triple {13624#(<= 100000 ~SIZE~0)} assume true; {13624#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:02:29,675 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {13624#(<= 100000 ~SIZE~0)} {13622#true} #128#return; {13624#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:02:29,676 INFO L256 TraceCheckUtils]: 4: Hoare triple {13624#(<= 100000 ~SIZE~0)} call #t~ret13 := main(); {13624#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:02:29,677 INFO L273 TraceCheckUtils]: 5: Hoare triple {13624#(<= 100000 ~SIZE~0)} havoc ~i~1;havoc ~pos~0;~n~0 := 0;~found~0 := 0;call ~#set~0.base, ~#set~0.offset := #Ultimate.alloc(4 * ~SIZE~0);call ~#values~0.base, ~#values~0.offset := #Ultimate.alloc(4 * ~SIZE~0);havoc ~element~0;havoc ~v~0;~v~0 := 0; {13625#(and (= main_~v~0 0) (<= 100000 ~SIZE~0))} is VALID [2018-11-18 23:02:29,677 INFO L273 TraceCheckUtils]: 6: Hoare triple {13625#(and (= main_~v~0 0) (<= 100000 ~SIZE~0))} assume true; {13625#(and (= main_~v~0 0) (<= 100000 ~SIZE~0))} is VALID [2018-11-18 23:02:29,678 INFO L273 TraceCheckUtils]: 7: Hoare triple {13625#(and (= main_~v~0 0) (<= 100000 ~SIZE~0))} assume !!(~v~0 < ~SIZE~0);call #t~mem3 := read~int(~#values~0.base, ~#values~0.offset + 4 * ~v~0, 4); {13625#(and (= main_~v~0 0) (<= 100000 ~SIZE~0))} is VALID [2018-11-18 23:02:29,678 INFO L256 TraceCheckUtils]: 8: Hoare triple {13625#(and (= main_~v~0 0) (<= 100000 ~SIZE~0))} call #t~ret4 := elem_exists(~#set~0.base, ~#set~0.offset, ~n~0, #t~mem3); {13622#true} is VALID [2018-11-18 23:02:29,679 INFO L273 TraceCheckUtils]: 9: Hoare triple {13622#true} ~set.base, ~set.offset := #in~set.base, #in~set.offset;~size := #in~size;~value := #in~value;havoc ~i~0;~i~0 := 0; {13622#true} is VALID [2018-11-18 23:02:29,679 INFO L273 TraceCheckUtils]: 10: Hoare triple {13622#true} assume true; {13622#true} is VALID [2018-11-18 23:02:29,679 INFO L273 TraceCheckUtils]: 11: Hoare triple {13622#true} assume !(~i~0 < ~size); {13622#true} is VALID [2018-11-18 23:02:29,679 INFO L273 TraceCheckUtils]: 12: Hoare triple {13622#true} #res := 0; {13622#true} is VALID [2018-11-18 23:02:29,679 INFO L273 TraceCheckUtils]: 13: Hoare triple {13622#true} assume true; {13622#true} is VALID [2018-11-18 23:02:29,680 INFO L268 TraceCheckUtils]: 14: Hoare quadruple {13622#true} {13625#(and (= main_~v~0 0) (<= 100000 ~SIZE~0))} #132#return; {13625#(and (= main_~v~0 0) (<= 100000 ~SIZE~0))} is VALID [2018-11-18 23:02:29,681 INFO L273 TraceCheckUtils]: 15: Hoare triple {13625#(and (= main_~v~0 0) (<= 100000 ~SIZE~0))} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {13625#(and (= main_~v~0 0) (<= 100000 ~SIZE~0))} is VALID [2018-11-18 23:02:29,681 INFO L273 TraceCheckUtils]: 16: Hoare triple {13625#(and (= main_~v~0 0) (<= 100000 ~SIZE~0))} assume 1 != #t~ret4;havoc #t~mem3;havoc #t~ret4;call #t~mem5 := read~int(~#values~0.base, ~#values~0.offset + 4 * ~v~0, 4); {13625#(and (= main_~v~0 0) (<= 100000 ~SIZE~0))} is VALID [2018-11-18 23:02:29,682 INFO L256 TraceCheckUtils]: 17: Hoare triple {13625#(and (= main_~v~0 0) (<= 100000 ~SIZE~0))} call #t~ret6 := insert(~#set~0.base, ~#set~0.offset, ~n~0, #t~mem5); {13622#true} is VALID [2018-11-18 23:02:29,682 INFO L273 TraceCheckUtils]: 18: Hoare triple {13622#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; {13622#true} is VALID [2018-11-18 23:02:29,682 INFO L273 TraceCheckUtils]: 19: Hoare triple {13622#true} assume true; {13622#true} is VALID [2018-11-18 23:02:29,683 INFO L268 TraceCheckUtils]: 20: Hoare quadruple {13622#true} {13625#(and (= main_~v~0 0) (<= 100000 ~SIZE~0))} #134#return; {13625#(and (= main_~v~0 0) (<= 100000 ~SIZE~0))} is VALID [2018-11-18 23:02:29,683 INFO L273 TraceCheckUtils]: 21: Hoare triple {13625#(and (= main_~v~0 0) (<= 100000 ~SIZE~0))} assume -2147483648 <= #t~ret6 && #t~ret6 <= 2147483647;~n~0 := #t~ret6;havoc #t~ret6;havoc #t~mem5; {13625#(and (= main_~v~0 0) (<= 100000 ~SIZE~0))} is VALID [2018-11-18 23:02:29,684 INFO L273 TraceCheckUtils]: 22: Hoare triple {13625#(and (= main_~v~0 0) (<= 100000 ~SIZE~0))} #t~post2 := ~v~0;~v~0 := 1 + #t~post2;havoc #t~post2; {13626#(<= (+ main_~v~0 99999) ~SIZE~0)} is VALID [2018-11-18 23:02:29,685 INFO L273 TraceCheckUtils]: 23: Hoare triple {13626#(<= (+ main_~v~0 99999) ~SIZE~0)} assume true; {13626#(<= (+ main_~v~0 99999) ~SIZE~0)} is VALID [2018-11-18 23:02:29,685 INFO L273 TraceCheckUtils]: 24: Hoare triple {13626#(<= (+ main_~v~0 99999) ~SIZE~0)} assume !!(~v~0 < ~SIZE~0);call #t~mem3 := read~int(~#values~0.base, ~#values~0.offset + 4 * ~v~0, 4); {13626#(<= (+ main_~v~0 99999) ~SIZE~0)} is VALID [2018-11-18 23:02:29,685 INFO L256 TraceCheckUtils]: 25: Hoare triple {13626#(<= (+ main_~v~0 99999) ~SIZE~0)} call #t~ret4 := elem_exists(~#set~0.base, ~#set~0.offset, ~n~0, #t~mem3); {13622#true} is VALID [2018-11-18 23:02:29,686 INFO L273 TraceCheckUtils]: 26: Hoare triple {13622#true} ~set.base, ~set.offset := #in~set.base, #in~set.offset;~size := #in~size;~value := #in~value;havoc ~i~0;~i~0 := 0; {13622#true} is VALID [2018-11-18 23:02:29,686 INFO L273 TraceCheckUtils]: 27: Hoare triple {13622#true} assume true; {13622#true} is VALID [2018-11-18 23:02:29,686 INFO L273 TraceCheckUtils]: 28: Hoare triple {13622#true} assume !!(~i~0 < ~size);call #t~mem1 := read~int(~set.base, ~set.offset + 4 * ~i~0, 4); {13622#true} is VALID [2018-11-18 23:02:29,686 INFO L273 TraceCheckUtils]: 29: Hoare triple {13622#true} assume #t~mem1 == ~value;havoc #t~mem1;#res := 1; {13622#true} is VALID [2018-11-18 23:02:29,686 INFO L273 TraceCheckUtils]: 30: Hoare triple {13622#true} assume true; {13622#true} is VALID [2018-11-18 23:02:29,687 INFO L268 TraceCheckUtils]: 31: Hoare quadruple {13622#true} {13626#(<= (+ main_~v~0 99999) ~SIZE~0)} #132#return; {13626#(<= (+ main_~v~0 99999) ~SIZE~0)} is VALID [2018-11-18 23:02:29,688 INFO L273 TraceCheckUtils]: 32: Hoare triple {13626#(<= (+ main_~v~0 99999) ~SIZE~0)} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {13626#(<= (+ main_~v~0 99999) ~SIZE~0)} is VALID [2018-11-18 23:02:29,688 INFO L273 TraceCheckUtils]: 33: Hoare triple {13626#(<= (+ main_~v~0 99999) ~SIZE~0)} assume !(1 != #t~ret4);havoc #t~mem3;havoc #t~ret4; {13626#(<= (+ main_~v~0 99999) ~SIZE~0)} is VALID [2018-11-18 23:02:29,689 INFO L273 TraceCheckUtils]: 34: Hoare triple {13626#(<= (+ main_~v~0 99999) ~SIZE~0)} #t~post2 := ~v~0;~v~0 := 1 + #t~post2;havoc #t~post2; {13627#(<= (+ main_~v~0 99998) ~SIZE~0)} is VALID [2018-11-18 23:02:29,689 INFO L273 TraceCheckUtils]: 35: Hoare triple {13627#(<= (+ main_~v~0 99998) ~SIZE~0)} assume true; {13627#(<= (+ main_~v~0 99998) ~SIZE~0)} is VALID [2018-11-18 23:02:29,689 INFO L273 TraceCheckUtils]: 36: Hoare triple {13627#(<= (+ main_~v~0 99998) ~SIZE~0)} assume !!(~v~0 < ~SIZE~0);call #t~mem3 := read~int(~#values~0.base, ~#values~0.offset + 4 * ~v~0, 4); {13627#(<= (+ main_~v~0 99998) ~SIZE~0)} is VALID [2018-11-18 23:02:29,689 INFO L256 TraceCheckUtils]: 37: Hoare triple {13627#(<= (+ main_~v~0 99998) ~SIZE~0)} call #t~ret4 := elem_exists(~#set~0.base, ~#set~0.offset, ~n~0, #t~mem3); {13622#true} is VALID [2018-11-18 23:02:29,689 INFO L273 TraceCheckUtils]: 38: Hoare triple {13622#true} ~set.base, ~set.offset := #in~set.base, #in~set.offset;~size := #in~size;~value := #in~value;havoc ~i~0;~i~0 := 0; {13622#true} is VALID [2018-11-18 23:02:29,690 INFO L273 TraceCheckUtils]: 39: Hoare triple {13622#true} assume true; {13622#true} is VALID [2018-11-18 23:02:29,690 INFO L273 TraceCheckUtils]: 40: Hoare triple {13622#true} assume !!(~i~0 < ~size);call #t~mem1 := read~int(~set.base, ~set.offset + 4 * ~i~0, 4); {13622#true} is VALID [2018-11-18 23:02:29,690 INFO L273 TraceCheckUtils]: 41: Hoare triple {13622#true} assume #t~mem1 == ~value;havoc #t~mem1;#res := 1; {13622#true} is VALID [2018-11-18 23:02:29,690 INFO L273 TraceCheckUtils]: 42: Hoare triple {13622#true} assume true; {13622#true} is VALID [2018-11-18 23:02:29,691 INFO L268 TraceCheckUtils]: 43: Hoare quadruple {13622#true} {13627#(<= (+ main_~v~0 99998) ~SIZE~0)} #132#return; {13627#(<= (+ main_~v~0 99998) ~SIZE~0)} is VALID [2018-11-18 23:02:29,691 INFO L273 TraceCheckUtils]: 44: Hoare triple {13627#(<= (+ main_~v~0 99998) ~SIZE~0)} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {13627#(<= (+ main_~v~0 99998) ~SIZE~0)} is VALID [2018-11-18 23:02:29,692 INFO L273 TraceCheckUtils]: 45: Hoare triple {13627#(<= (+ main_~v~0 99998) ~SIZE~0)} assume !(1 != #t~ret4);havoc #t~mem3;havoc #t~ret4; {13627#(<= (+ main_~v~0 99998) ~SIZE~0)} is VALID [2018-11-18 23:02:29,693 INFO L273 TraceCheckUtils]: 46: Hoare triple {13627#(<= (+ main_~v~0 99998) ~SIZE~0)} #t~post2 := ~v~0;~v~0 := 1 + #t~post2;havoc #t~post2; {13628#(<= (+ main_~v~0 99997) ~SIZE~0)} is VALID [2018-11-18 23:02:29,693 INFO L273 TraceCheckUtils]: 47: Hoare triple {13628#(<= (+ main_~v~0 99997) ~SIZE~0)} assume true; {13628#(<= (+ main_~v~0 99997) ~SIZE~0)} is VALID [2018-11-18 23:02:29,693 INFO L273 TraceCheckUtils]: 48: Hoare triple {13628#(<= (+ main_~v~0 99997) ~SIZE~0)} assume !!(~v~0 < ~SIZE~0);call #t~mem3 := read~int(~#values~0.base, ~#values~0.offset + 4 * ~v~0, 4); {13628#(<= (+ main_~v~0 99997) ~SIZE~0)} is VALID [2018-11-18 23:02:29,693 INFO L256 TraceCheckUtils]: 49: Hoare triple {13628#(<= (+ main_~v~0 99997) ~SIZE~0)} call #t~ret4 := elem_exists(~#set~0.base, ~#set~0.offset, ~n~0, #t~mem3); {13622#true} is VALID [2018-11-18 23:02:29,693 INFO L273 TraceCheckUtils]: 50: Hoare triple {13622#true} ~set.base, ~set.offset := #in~set.base, #in~set.offset;~size := #in~size;~value := #in~value;havoc ~i~0;~i~0 := 0; {13622#true} is VALID [2018-11-18 23:02:29,694 INFO L273 TraceCheckUtils]: 51: Hoare triple {13622#true} assume true; {13622#true} is VALID [2018-11-18 23:02:29,694 INFO L273 TraceCheckUtils]: 52: Hoare triple {13622#true} assume !!(~i~0 < ~size);call #t~mem1 := read~int(~set.base, ~set.offset + 4 * ~i~0, 4); {13622#true} is VALID [2018-11-18 23:02:29,694 INFO L273 TraceCheckUtils]: 53: Hoare triple {13622#true} assume #t~mem1 == ~value;havoc #t~mem1;#res := 1; {13622#true} is VALID [2018-11-18 23:02:29,694 INFO L273 TraceCheckUtils]: 54: Hoare triple {13622#true} assume true; {13622#true} is VALID [2018-11-18 23:02:29,695 INFO L268 TraceCheckUtils]: 55: Hoare quadruple {13622#true} {13628#(<= (+ main_~v~0 99997) ~SIZE~0)} #132#return; {13628#(<= (+ main_~v~0 99997) ~SIZE~0)} is VALID [2018-11-18 23:02:29,695 INFO L273 TraceCheckUtils]: 56: Hoare triple {13628#(<= (+ main_~v~0 99997) ~SIZE~0)} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {13628#(<= (+ main_~v~0 99997) ~SIZE~0)} is VALID [2018-11-18 23:02:29,695 INFO L273 TraceCheckUtils]: 57: Hoare triple {13628#(<= (+ main_~v~0 99997) ~SIZE~0)} assume !(1 != #t~ret4);havoc #t~mem3;havoc #t~ret4; {13628#(<= (+ main_~v~0 99997) ~SIZE~0)} is VALID [2018-11-18 23:02:29,696 INFO L273 TraceCheckUtils]: 58: Hoare triple {13628#(<= (+ main_~v~0 99997) ~SIZE~0)} #t~post2 := ~v~0;~v~0 := 1 + #t~post2;havoc #t~post2; {13629#(<= (+ main_~v~0 99996) ~SIZE~0)} is VALID [2018-11-18 23:02:29,696 INFO L273 TraceCheckUtils]: 59: Hoare triple {13629#(<= (+ main_~v~0 99996) ~SIZE~0)} assume true; {13629#(<= (+ main_~v~0 99996) ~SIZE~0)} is VALID [2018-11-18 23:02:29,697 INFO L273 TraceCheckUtils]: 60: Hoare triple {13629#(<= (+ main_~v~0 99996) ~SIZE~0)} assume !!(~v~0 < ~SIZE~0);call #t~mem3 := read~int(~#values~0.base, ~#values~0.offset + 4 * ~v~0, 4); {13629#(<= (+ main_~v~0 99996) ~SIZE~0)} is VALID [2018-11-18 23:02:29,697 INFO L256 TraceCheckUtils]: 61: Hoare triple {13629#(<= (+ main_~v~0 99996) ~SIZE~0)} call #t~ret4 := elem_exists(~#set~0.base, ~#set~0.offset, ~n~0, #t~mem3); {13622#true} is VALID [2018-11-18 23:02:29,697 INFO L273 TraceCheckUtils]: 62: Hoare triple {13622#true} ~set.base, ~set.offset := #in~set.base, #in~set.offset;~size := #in~size;~value := #in~value;havoc ~i~0;~i~0 := 0; {13622#true} is VALID [2018-11-18 23:02:29,697 INFO L273 TraceCheckUtils]: 63: Hoare triple {13622#true} assume true; {13622#true} is VALID [2018-11-18 23:02:29,697 INFO L273 TraceCheckUtils]: 64: Hoare triple {13622#true} assume !!(~i~0 < ~size);call #t~mem1 := read~int(~set.base, ~set.offset + 4 * ~i~0, 4); {13622#true} is VALID [2018-11-18 23:02:29,698 INFO L273 TraceCheckUtils]: 65: Hoare triple {13622#true} assume #t~mem1 == ~value;havoc #t~mem1;#res := 1; {13622#true} is VALID [2018-11-18 23:02:29,698 INFO L273 TraceCheckUtils]: 66: Hoare triple {13622#true} assume true; {13622#true} is VALID [2018-11-18 23:02:29,699 INFO L268 TraceCheckUtils]: 67: Hoare quadruple {13622#true} {13629#(<= (+ main_~v~0 99996) ~SIZE~0)} #132#return; {13629#(<= (+ main_~v~0 99996) ~SIZE~0)} is VALID [2018-11-18 23:02:29,699 INFO L273 TraceCheckUtils]: 68: Hoare triple {13629#(<= (+ main_~v~0 99996) ~SIZE~0)} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {13629#(<= (+ main_~v~0 99996) ~SIZE~0)} is VALID [2018-11-18 23:02:29,700 INFO L273 TraceCheckUtils]: 69: Hoare triple {13629#(<= (+ main_~v~0 99996) ~SIZE~0)} assume !(1 != #t~ret4);havoc #t~mem3;havoc #t~ret4; {13629#(<= (+ main_~v~0 99996) ~SIZE~0)} is VALID [2018-11-18 23:02:29,701 INFO L273 TraceCheckUtils]: 70: Hoare triple {13629#(<= (+ main_~v~0 99996) ~SIZE~0)} #t~post2 := ~v~0;~v~0 := 1 + #t~post2;havoc #t~post2; {13630#(<= (+ main_~v~0 99995) ~SIZE~0)} is VALID [2018-11-18 23:02:29,701 INFO L273 TraceCheckUtils]: 71: Hoare triple {13630#(<= (+ main_~v~0 99995) ~SIZE~0)} assume true; {13630#(<= (+ main_~v~0 99995) ~SIZE~0)} is VALID [2018-11-18 23:02:29,702 INFO L273 TraceCheckUtils]: 72: Hoare triple {13630#(<= (+ main_~v~0 99995) ~SIZE~0)} assume !!(~v~0 < ~SIZE~0);call #t~mem3 := read~int(~#values~0.base, ~#values~0.offset + 4 * ~v~0, 4); {13630#(<= (+ main_~v~0 99995) ~SIZE~0)} is VALID [2018-11-18 23:02:29,702 INFO L256 TraceCheckUtils]: 73: Hoare triple {13630#(<= (+ main_~v~0 99995) ~SIZE~0)} call #t~ret4 := elem_exists(~#set~0.base, ~#set~0.offset, ~n~0, #t~mem3); {13622#true} is VALID [2018-11-18 23:02:29,702 INFO L273 TraceCheckUtils]: 74: Hoare triple {13622#true} ~set.base, ~set.offset := #in~set.base, #in~set.offset;~size := #in~size;~value := #in~value;havoc ~i~0;~i~0 := 0; {13622#true} is VALID [2018-11-18 23:02:29,703 INFO L273 TraceCheckUtils]: 75: Hoare triple {13622#true} assume true; {13622#true} is VALID [2018-11-18 23:02:29,703 INFO L273 TraceCheckUtils]: 76: Hoare triple {13622#true} assume !!(~i~0 < ~size);call #t~mem1 := read~int(~set.base, ~set.offset + 4 * ~i~0, 4); {13622#true} is VALID [2018-11-18 23:02:29,703 INFO L273 TraceCheckUtils]: 77: Hoare triple {13622#true} assume #t~mem1 == ~value;havoc #t~mem1;#res := 1; {13622#true} is VALID [2018-11-18 23:02:29,703 INFO L273 TraceCheckUtils]: 78: Hoare triple {13622#true} assume true; {13622#true} is VALID [2018-11-18 23:02:29,704 INFO L268 TraceCheckUtils]: 79: Hoare quadruple {13622#true} {13630#(<= (+ main_~v~0 99995) ~SIZE~0)} #132#return; {13630#(<= (+ main_~v~0 99995) ~SIZE~0)} is VALID [2018-11-18 23:02:29,705 INFO L273 TraceCheckUtils]: 80: Hoare triple {13630#(<= (+ main_~v~0 99995) ~SIZE~0)} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {13630#(<= (+ main_~v~0 99995) ~SIZE~0)} is VALID [2018-11-18 23:02:29,705 INFO L273 TraceCheckUtils]: 81: Hoare triple {13630#(<= (+ main_~v~0 99995) ~SIZE~0)} assume !(1 != #t~ret4);havoc #t~mem3;havoc #t~ret4; {13630#(<= (+ main_~v~0 99995) ~SIZE~0)} is VALID [2018-11-18 23:02:29,706 INFO L273 TraceCheckUtils]: 82: Hoare triple {13630#(<= (+ main_~v~0 99995) ~SIZE~0)} #t~post2 := ~v~0;~v~0 := 1 + #t~post2;havoc #t~post2; {13631#(<= (+ main_~v~0 99994) ~SIZE~0)} is VALID [2018-11-18 23:02:29,706 INFO L273 TraceCheckUtils]: 83: Hoare triple {13631#(<= (+ main_~v~0 99994) ~SIZE~0)} assume true; {13631#(<= (+ main_~v~0 99994) ~SIZE~0)} is VALID [2018-11-18 23:02:29,706 INFO L273 TraceCheckUtils]: 84: Hoare triple {13631#(<= (+ main_~v~0 99994) ~SIZE~0)} assume !!(~v~0 < ~SIZE~0);call #t~mem3 := read~int(~#values~0.base, ~#values~0.offset + 4 * ~v~0, 4); {13631#(<= (+ main_~v~0 99994) ~SIZE~0)} is VALID [2018-11-18 23:02:29,707 INFO L256 TraceCheckUtils]: 85: Hoare triple {13631#(<= (+ main_~v~0 99994) ~SIZE~0)} call #t~ret4 := elem_exists(~#set~0.base, ~#set~0.offset, ~n~0, #t~mem3); {13622#true} is VALID [2018-11-18 23:02:29,707 INFO L273 TraceCheckUtils]: 86: Hoare triple {13622#true} ~set.base, ~set.offset := #in~set.base, #in~set.offset;~size := #in~size;~value := #in~value;havoc ~i~0;~i~0 := 0; {13622#true} is VALID [2018-11-18 23:02:29,707 INFO L273 TraceCheckUtils]: 87: Hoare triple {13622#true} assume true; {13622#true} is VALID [2018-11-18 23:02:29,707 INFO L273 TraceCheckUtils]: 88: Hoare triple {13622#true} assume !!(~i~0 < ~size);call #t~mem1 := read~int(~set.base, ~set.offset + 4 * ~i~0, 4); {13622#true} is VALID [2018-11-18 23:02:29,707 INFO L273 TraceCheckUtils]: 89: Hoare triple {13622#true} assume #t~mem1 == ~value;havoc #t~mem1;#res := 1; {13622#true} is VALID [2018-11-18 23:02:29,707 INFO L273 TraceCheckUtils]: 90: Hoare triple {13622#true} assume true; {13622#true} is VALID [2018-11-18 23:02:29,708 INFO L268 TraceCheckUtils]: 91: Hoare quadruple {13622#true} {13631#(<= (+ main_~v~0 99994) ~SIZE~0)} #132#return; {13631#(<= (+ main_~v~0 99994) ~SIZE~0)} is VALID [2018-11-18 23:02:29,709 INFO L273 TraceCheckUtils]: 92: Hoare triple {13631#(<= (+ main_~v~0 99994) ~SIZE~0)} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {13631#(<= (+ main_~v~0 99994) ~SIZE~0)} is VALID [2018-11-18 23:02:29,710 INFO L273 TraceCheckUtils]: 93: Hoare triple {13631#(<= (+ main_~v~0 99994) ~SIZE~0)} assume !(1 != #t~ret4);havoc #t~mem3;havoc #t~ret4; {13631#(<= (+ main_~v~0 99994) ~SIZE~0)} is VALID [2018-11-18 23:02:29,710 INFO L273 TraceCheckUtils]: 94: Hoare triple {13631#(<= (+ main_~v~0 99994) ~SIZE~0)} #t~post2 := ~v~0;~v~0 := 1 + #t~post2;havoc #t~post2; {13632#(<= (+ main_~v~0 99993) ~SIZE~0)} is VALID [2018-11-18 23:02:29,711 INFO L273 TraceCheckUtils]: 95: Hoare triple {13632#(<= (+ main_~v~0 99993) ~SIZE~0)} assume true; {13632#(<= (+ main_~v~0 99993) ~SIZE~0)} is VALID [2018-11-18 23:02:29,711 INFO L273 TraceCheckUtils]: 96: Hoare triple {13632#(<= (+ main_~v~0 99993) ~SIZE~0)} assume !!(~v~0 < ~SIZE~0);call #t~mem3 := read~int(~#values~0.base, ~#values~0.offset + 4 * ~v~0, 4); {13632#(<= (+ main_~v~0 99993) ~SIZE~0)} is VALID [2018-11-18 23:02:29,712 INFO L256 TraceCheckUtils]: 97: Hoare triple {13632#(<= (+ main_~v~0 99993) ~SIZE~0)} call #t~ret4 := elem_exists(~#set~0.base, ~#set~0.offset, ~n~0, #t~mem3); {13622#true} is VALID [2018-11-18 23:02:29,712 INFO L273 TraceCheckUtils]: 98: Hoare triple {13622#true} ~set.base, ~set.offset := #in~set.base, #in~set.offset;~size := #in~size;~value := #in~value;havoc ~i~0;~i~0 := 0; {13622#true} is VALID [2018-11-18 23:02:29,712 INFO L273 TraceCheckUtils]: 99: Hoare triple {13622#true} assume true; {13622#true} is VALID [2018-11-18 23:02:29,712 INFO L273 TraceCheckUtils]: 100: Hoare triple {13622#true} assume !!(~i~0 < ~size);call #t~mem1 := read~int(~set.base, ~set.offset + 4 * ~i~0, 4); {13622#true} is VALID [2018-11-18 23:02:29,713 INFO L273 TraceCheckUtils]: 101: Hoare triple {13622#true} assume #t~mem1 == ~value;havoc #t~mem1;#res := 1; {13622#true} is VALID [2018-11-18 23:02:29,713 INFO L273 TraceCheckUtils]: 102: Hoare triple {13622#true} assume true; {13622#true} is VALID [2018-11-18 23:02:29,714 INFO L268 TraceCheckUtils]: 103: Hoare quadruple {13622#true} {13632#(<= (+ main_~v~0 99993) ~SIZE~0)} #132#return; {13632#(<= (+ main_~v~0 99993) ~SIZE~0)} is VALID [2018-11-18 23:02:29,714 INFO L273 TraceCheckUtils]: 104: Hoare triple {13632#(<= (+ main_~v~0 99993) ~SIZE~0)} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {13632#(<= (+ main_~v~0 99993) ~SIZE~0)} is VALID [2018-11-18 23:02:29,715 INFO L273 TraceCheckUtils]: 105: Hoare triple {13632#(<= (+ main_~v~0 99993) ~SIZE~0)} assume !(1 != #t~ret4);havoc #t~mem3;havoc #t~ret4; {13632#(<= (+ main_~v~0 99993) ~SIZE~0)} is VALID [2018-11-18 23:02:29,716 INFO L273 TraceCheckUtils]: 106: Hoare triple {13632#(<= (+ main_~v~0 99993) ~SIZE~0)} #t~post2 := ~v~0;~v~0 := 1 + #t~post2;havoc #t~post2; {13633#(<= (+ main_~v~0 99992) ~SIZE~0)} is VALID [2018-11-18 23:02:29,716 INFO L273 TraceCheckUtils]: 107: Hoare triple {13633#(<= (+ main_~v~0 99992) ~SIZE~0)} assume true; {13633#(<= (+ main_~v~0 99992) ~SIZE~0)} is VALID [2018-11-18 23:02:29,717 INFO L273 TraceCheckUtils]: 108: Hoare triple {13633#(<= (+ main_~v~0 99992) ~SIZE~0)} assume !!(~v~0 < ~SIZE~0);call #t~mem3 := read~int(~#values~0.base, ~#values~0.offset + 4 * ~v~0, 4); {13633#(<= (+ main_~v~0 99992) ~SIZE~0)} is VALID [2018-11-18 23:02:29,717 INFO L256 TraceCheckUtils]: 109: Hoare triple {13633#(<= (+ main_~v~0 99992) ~SIZE~0)} call #t~ret4 := elem_exists(~#set~0.base, ~#set~0.offset, ~n~0, #t~mem3); {13622#true} is VALID [2018-11-18 23:02:29,717 INFO L273 TraceCheckUtils]: 110: Hoare triple {13622#true} ~set.base, ~set.offset := #in~set.base, #in~set.offset;~size := #in~size;~value := #in~value;havoc ~i~0;~i~0 := 0; {13622#true} is VALID [2018-11-18 23:02:29,718 INFO L273 TraceCheckUtils]: 111: Hoare triple {13622#true} assume true; {13622#true} is VALID [2018-11-18 23:02:29,718 INFO L273 TraceCheckUtils]: 112: Hoare triple {13622#true} assume !!(~i~0 < ~size);call #t~mem1 := read~int(~set.base, ~set.offset + 4 * ~i~0, 4); {13622#true} is VALID [2018-11-18 23:02:29,718 INFO L273 TraceCheckUtils]: 113: Hoare triple {13622#true} assume #t~mem1 == ~value;havoc #t~mem1;#res := 1; {13622#true} is VALID [2018-11-18 23:02:29,718 INFO L273 TraceCheckUtils]: 114: Hoare triple {13622#true} assume true; {13622#true} is VALID [2018-11-18 23:02:29,719 INFO L268 TraceCheckUtils]: 115: Hoare quadruple {13622#true} {13633#(<= (+ main_~v~0 99992) ~SIZE~0)} #132#return; {13633#(<= (+ main_~v~0 99992) ~SIZE~0)} is VALID [2018-11-18 23:02:29,720 INFO L273 TraceCheckUtils]: 116: Hoare triple {13633#(<= (+ main_~v~0 99992) ~SIZE~0)} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {13633#(<= (+ main_~v~0 99992) ~SIZE~0)} is VALID [2018-11-18 23:02:29,720 INFO L273 TraceCheckUtils]: 117: Hoare triple {13633#(<= (+ main_~v~0 99992) ~SIZE~0)} assume !(1 != #t~ret4);havoc #t~mem3;havoc #t~ret4; {13633#(<= (+ main_~v~0 99992) ~SIZE~0)} is VALID [2018-11-18 23:02:29,721 INFO L273 TraceCheckUtils]: 118: Hoare triple {13633#(<= (+ main_~v~0 99992) ~SIZE~0)} #t~post2 := ~v~0;~v~0 := 1 + #t~post2;havoc #t~post2; {13634#(<= (+ main_~v~0 99991) ~SIZE~0)} is VALID [2018-11-18 23:02:29,722 INFO L273 TraceCheckUtils]: 119: Hoare triple {13634#(<= (+ main_~v~0 99991) ~SIZE~0)} assume true; {13634#(<= (+ main_~v~0 99991) ~SIZE~0)} is VALID [2018-11-18 23:02:29,722 INFO L273 TraceCheckUtils]: 120: Hoare triple {13634#(<= (+ main_~v~0 99991) ~SIZE~0)} assume !!(~v~0 < ~SIZE~0);call #t~mem3 := read~int(~#values~0.base, ~#values~0.offset + 4 * ~v~0, 4); {13634#(<= (+ main_~v~0 99991) ~SIZE~0)} is VALID [2018-11-18 23:02:29,722 INFO L256 TraceCheckUtils]: 121: Hoare triple {13634#(<= (+ main_~v~0 99991) ~SIZE~0)} call #t~ret4 := elem_exists(~#set~0.base, ~#set~0.offset, ~n~0, #t~mem3); {13622#true} is VALID [2018-11-18 23:02:29,723 INFO L273 TraceCheckUtils]: 122: Hoare triple {13622#true} ~set.base, ~set.offset := #in~set.base, #in~set.offset;~size := #in~size;~value := #in~value;havoc ~i~0;~i~0 := 0; {13622#true} is VALID [2018-11-18 23:02:29,723 INFO L273 TraceCheckUtils]: 123: Hoare triple {13622#true} assume true; {13622#true} is VALID [2018-11-18 23:02:29,723 INFO L273 TraceCheckUtils]: 124: Hoare triple {13622#true} assume !!(~i~0 < ~size);call #t~mem1 := read~int(~set.base, ~set.offset + 4 * ~i~0, 4); {13622#true} is VALID [2018-11-18 23:02:29,723 INFO L273 TraceCheckUtils]: 125: Hoare triple {13622#true} assume #t~mem1 == ~value;havoc #t~mem1;#res := 1; {13622#true} is VALID [2018-11-18 23:02:29,723 INFO L273 TraceCheckUtils]: 126: Hoare triple {13622#true} assume true; {13622#true} is VALID [2018-11-18 23:02:29,725 INFO L268 TraceCheckUtils]: 127: Hoare quadruple {13622#true} {13634#(<= (+ main_~v~0 99991) ~SIZE~0)} #132#return; {13634#(<= (+ main_~v~0 99991) ~SIZE~0)} is VALID [2018-11-18 23:02:29,725 INFO L273 TraceCheckUtils]: 128: Hoare triple {13634#(<= (+ main_~v~0 99991) ~SIZE~0)} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {13634#(<= (+ main_~v~0 99991) ~SIZE~0)} is VALID [2018-11-18 23:02:29,726 INFO L273 TraceCheckUtils]: 129: Hoare triple {13634#(<= (+ main_~v~0 99991) ~SIZE~0)} assume !(1 != #t~ret4);havoc #t~mem3;havoc #t~ret4; {13634#(<= (+ main_~v~0 99991) ~SIZE~0)} is VALID [2018-11-18 23:02:29,726 INFO L273 TraceCheckUtils]: 130: Hoare triple {13634#(<= (+ main_~v~0 99991) ~SIZE~0)} #t~post2 := ~v~0;~v~0 := 1 + #t~post2;havoc #t~post2; {13635#(<= (+ main_~v~0 99990) ~SIZE~0)} is VALID [2018-11-18 23:02:29,727 INFO L273 TraceCheckUtils]: 131: Hoare triple {13635#(<= (+ main_~v~0 99990) ~SIZE~0)} assume true; {13635#(<= (+ main_~v~0 99990) ~SIZE~0)} is VALID [2018-11-18 23:02:29,728 INFO L273 TraceCheckUtils]: 132: Hoare triple {13635#(<= (+ main_~v~0 99990) ~SIZE~0)} assume !!(~v~0 < ~SIZE~0);call #t~mem3 := read~int(~#values~0.base, ~#values~0.offset + 4 * ~v~0, 4); {13635#(<= (+ main_~v~0 99990) ~SIZE~0)} is VALID [2018-11-18 23:02:29,728 INFO L256 TraceCheckUtils]: 133: Hoare triple {13635#(<= (+ main_~v~0 99990) ~SIZE~0)} call #t~ret4 := elem_exists(~#set~0.base, ~#set~0.offset, ~n~0, #t~mem3); {13622#true} is VALID [2018-11-18 23:02:29,728 INFO L273 TraceCheckUtils]: 134: Hoare triple {13622#true} ~set.base, ~set.offset := #in~set.base, #in~set.offset;~size := #in~size;~value := #in~value;havoc ~i~0;~i~0 := 0; {13622#true} is VALID [2018-11-18 23:02:29,728 INFO L273 TraceCheckUtils]: 135: Hoare triple {13622#true} assume true; {13622#true} is VALID [2018-11-18 23:02:29,728 INFO L273 TraceCheckUtils]: 136: Hoare triple {13622#true} assume !!(~i~0 < ~size);call #t~mem1 := read~int(~set.base, ~set.offset + 4 * ~i~0, 4); {13622#true} is VALID [2018-11-18 23:02:29,729 INFO L273 TraceCheckUtils]: 137: Hoare triple {13622#true} assume #t~mem1 == ~value;havoc #t~mem1;#res := 1; {13622#true} is VALID [2018-11-18 23:02:29,729 INFO L273 TraceCheckUtils]: 138: Hoare triple {13622#true} assume true; {13622#true} is VALID [2018-11-18 23:02:29,730 INFO L268 TraceCheckUtils]: 139: Hoare quadruple {13622#true} {13635#(<= (+ main_~v~0 99990) ~SIZE~0)} #132#return; {13635#(<= (+ main_~v~0 99990) ~SIZE~0)} is VALID [2018-11-18 23:02:29,730 INFO L273 TraceCheckUtils]: 140: Hoare triple {13635#(<= (+ main_~v~0 99990) ~SIZE~0)} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {13635#(<= (+ main_~v~0 99990) ~SIZE~0)} is VALID [2018-11-18 23:02:29,731 INFO L273 TraceCheckUtils]: 141: Hoare triple {13635#(<= (+ main_~v~0 99990) ~SIZE~0)} assume !(1 != #t~ret4);havoc #t~mem3;havoc #t~ret4; {13635#(<= (+ main_~v~0 99990) ~SIZE~0)} is VALID [2018-11-18 23:02:29,732 INFO L273 TraceCheckUtils]: 142: Hoare triple {13635#(<= (+ main_~v~0 99990) ~SIZE~0)} #t~post2 := ~v~0;~v~0 := 1 + #t~post2;havoc #t~post2; {13636#(<= (+ main_~v~0 99989) ~SIZE~0)} is VALID [2018-11-18 23:02:29,732 INFO L273 TraceCheckUtils]: 143: Hoare triple {13636#(<= (+ main_~v~0 99989) ~SIZE~0)} assume true; {13636#(<= (+ main_~v~0 99989) ~SIZE~0)} is VALID [2018-11-18 23:02:29,732 INFO L273 TraceCheckUtils]: 144: Hoare triple {13636#(<= (+ main_~v~0 99989) ~SIZE~0)} assume !(~v~0 < ~SIZE~0); {13623#false} is VALID [2018-11-18 23:02:29,732 INFO L273 TraceCheckUtils]: 145: Hoare triple {13623#false} ~i~1 := 0; {13623#false} is VALID [2018-11-18 23:02:29,733 INFO L273 TraceCheckUtils]: 146: Hoare triple {13623#false} assume true; {13623#false} is VALID [2018-11-18 23:02:29,733 INFO L273 TraceCheckUtils]: 147: Hoare triple {13623#false} assume !!(~i~1 < ~SIZE~0 && 1 != ~found~0);call #t~mem8 := read~int(~#set~0.base, ~#set~0.offset + 4 * ~i~1, 4); {13623#false} is VALID [2018-11-18 23:02:29,733 INFO L273 TraceCheckUtils]: 148: Hoare triple {13623#false} assume !(#t~mem8 == ~element~0);havoc #t~mem8; {13623#false} is VALID [2018-11-18 23:02:29,733 INFO L273 TraceCheckUtils]: 149: Hoare triple {13623#false} #t~post7 := ~i~1;~i~1 := 1 + #t~post7;havoc #t~post7; {13623#false} is VALID [2018-11-18 23:02:29,733 INFO L273 TraceCheckUtils]: 150: Hoare triple {13623#false} assume true; {13623#false} is VALID [2018-11-18 23:02:29,733 INFO L273 TraceCheckUtils]: 151: Hoare triple {13623#false} assume !!(~i~1 < ~SIZE~0 && 1 != ~found~0);call #t~mem8 := read~int(~#set~0.base, ~#set~0.offset + 4 * ~i~1, 4); {13623#false} is VALID [2018-11-18 23:02:29,733 INFO L273 TraceCheckUtils]: 152: Hoare triple {13623#false} assume #t~mem8 == ~element~0;havoc #t~mem8;~found~0 := 1;~pos~0 := ~i~1; {13623#false} is VALID [2018-11-18 23:02:29,733 INFO L273 TraceCheckUtils]: 153: Hoare triple {13623#false} #t~post7 := ~i~1;~i~1 := 1 + #t~post7;havoc #t~post7; {13623#false} is VALID [2018-11-18 23:02:29,734 INFO L273 TraceCheckUtils]: 154: Hoare triple {13623#false} assume true; {13623#false} is VALID [2018-11-18 23:02:29,734 INFO L273 TraceCheckUtils]: 155: Hoare triple {13623#false} assume !(~i~1 < ~SIZE~0 && 1 != ~found~0); {13623#false} is VALID [2018-11-18 23:02:29,734 INFO L273 TraceCheckUtils]: 156: Hoare triple {13623#false} assume 1 == ~found~0;~i~1 := ~pos~0; {13623#false} is VALID [2018-11-18 23:02:29,734 INFO L273 TraceCheckUtils]: 157: Hoare triple {13623#false} assume true; {13623#false} is VALID [2018-11-18 23:02:29,734 INFO L273 TraceCheckUtils]: 158: Hoare triple {13623#false} assume !!(~i~1 < ~SIZE~0 - 1);call #t~mem10 := read~int(~#set~0.base, ~#set~0.offset + 4 * (1 + ~i~1), 4);call write~int(#t~mem10, ~#set~0.base, ~#set~0.offset + 4 * ~i~1, 4);havoc #t~mem10; {13623#false} is VALID [2018-11-18 23:02:29,734 INFO L273 TraceCheckUtils]: 159: Hoare triple {13623#false} #t~post9 := ~i~1;~i~1 := 1 + #t~post9;havoc #t~post9; {13623#false} is VALID [2018-11-18 23:02:29,734 INFO L273 TraceCheckUtils]: 160: Hoare triple {13623#false} assume true; {13623#false} is VALID [2018-11-18 23:02:29,734 INFO L273 TraceCheckUtils]: 161: Hoare triple {13623#false} assume !!(~i~1 < ~SIZE~0 - 1);call #t~mem10 := read~int(~#set~0.base, ~#set~0.offset + 4 * (1 + ~i~1), 4);call write~int(#t~mem10, ~#set~0.base, ~#set~0.offset + 4 * ~i~1, 4);havoc #t~mem10; {13623#false} is VALID [2018-11-18 23:02:29,735 INFO L273 TraceCheckUtils]: 162: Hoare triple {13623#false} #t~post9 := ~i~1;~i~1 := 1 + #t~post9;havoc #t~post9; {13623#false} is VALID [2018-11-18 23:02:29,735 INFO L273 TraceCheckUtils]: 163: Hoare triple {13623#false} assume true; {13623#false} is VALID [2018-11-18 23:02:29,735 INFO L273 TraceCheckUtils]: 164: Hoare triple {13623#false} assume !(~i~1 < ~SIZE~0 - 1); {13623#false} is VALID [2018-11-18 23:02:29,735 INFO L273 TraceCheckUtils]: 165: Hoare triple {13623#false} assume 1 == ~found~0;~i~1 := 0; {13623#false} is VALID [2018-11-18 23:02:29,735 INFO L273 TraceCheckUtils]: 166: Hoare triple {13623#false} assume true; {13623#false} is VALID [2018-11-18 23:02:29,735 INFO L273 TraceCheckUtils]: 167: Hoare triple {13623#false} assume !!(~i~1 < ~SIZE~0 - 1);call #t~mem12 := read~int(~#set~0.base, ~#set~0.offset + 4 * ~i~1, 4); {13623#false} is VALID [2018-11-18 23:02:29,736 INFO L256 TraceCheckUtils]: 168: Hoare triple {13623#false} call __VERIFIER_assert((if #t~mem12 != ~element~0 then 1 else 0)); {13623#false} is VALID [2018-11-18 23:02:29,736 INFO L273 TraceCheckUtils]: 169: Hoare triple {13623#false} ~cond := #in~cond; {13623#false} is VALID [2018-11-18 23:02:29,736 INFO L273 TraceCheckUtils]: 170: Hoare triple {13623#false} assume 0 == ~cond; {13623#false} is VALID [2018-11-18 23:02:29,736 INFO L273 TraceCheckUtils]: 171: Hoare triple {13623#false} assume !false; {13623#false} is VALID [2018-11-18 23:02:29,754 INFO L134 CoverageAnalysis]: Checked inductivity of 687 backedges. 0 proven. 352 refuted. 0 times theorem prover too weak. 335 trivial. 0 not checked. [2018-11-18 23:02:29,755 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 23:02:29,755 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-18 23:02:29,766 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-18 23:02:29,848 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-18 23:02:29,848 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-18 23:02:29,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 23:02:29,883 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 23:02:30,440 INFO L256 TraceCheckUtils]: 0: Hoare triple {13622#true} call ULTIMATE.init(); {13622#true} is VALID [2018-11-18 23:02:30,440 INFO L273 TraceCheckUtils]: 1: Hoare triple {13622#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~SIZE~0 := 100000; {13622#true} is VALID [2018-11-18 23:02:30,440 INFO L273 TraceCheckUtils]: 2: Hoare triple {13622#true} assume true; {13622#true} is VALID [2018-11-18 23:02:30,441 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {13622#true} {13622#true} #128#return; {13622#true} is VALID [2018-11-18 23:02:30,441 INFO L256 TraceCheckUtils]: 4: Hoare triple {13622#true} call #t~ret13 := main(); {13622#true} is VALID [2018-11-18 23:02:30,442 INFO L273 TraceCheckUtils]: 5: Hoare triple {13622#true} havoc ~i~1;havoc ~pos~0;~n~0 := 0;~found~0 := 0;call ~#set~0.base, ~#set~0.offset := #Ultimate.alloc(4 * ~SIZE~0);call ~#values~0.base, ~#values~0.offset := #Ultimate.alloc(4 * ~SIZE~0);havoc ~element~0;havoc ~v~0;~v~0 := 0; {13655#(<= 0 main_~v~0)} is VALID [2018-11-18 23:02:30,442 INFO L273 TraceCheckUtils]: 6: Hoare triple {13655#(<= 0 main_~v~0)} assume true; {13655#(<= 0 main_~v~0)} is VALID [2018-11-18 23:02:30,443 INFO L273 TraceCheckUtils]: 7: Hoare triple {13655#(<= 0 main_~v~0)} assume !!(~v~0 < ~SIZE~0);call #t~mem3 := read~int(~#values~0.base, ~#values~0.offset + 4 * ~v~0, 4); {13655#(<= 0 main_~v~0)} is VALID [2018-11-18 23:02:30,443 INFO L256 TraceCheckUtils]: 8: Hoare triple {13655#(<= 0 main_~v~0)} call #t~ret4 := elem_exists(~#set~0.base, ~#set~0.offset, ~n~0, #t~mem3); {13622#true} is VALID [2018-11-18 23:02:30,443 INFO L273 TraceCheckUtils]: 9: Hoare triple {13622#true} ~set.base, ~set.offset := #in~set.base, #in~set.offset;~size := #in~size;~value := #in~value;havoc ~i~0;~i~0 := 0; {13622#true} is VALID [2018-11-18 23:02:30,443 INFO L273 TraceCheckUtils]: 10: Hoare triple {13622#true} assume true; {13622#true} is VALID [2018-11-18 23:02:30,443 INFO L273 TraceCheckUtils]: 11: Hoare triple {13622#true} assume !(~i~0 < ~size); {13622#true} is VALID [2018-11-18 23:02:30,443 INFO L273 TraceCheckUtils]: 12: Hoare triple {13622#true} #res := 0; {13622#true} is VALID [2018-11-18 23:02:30,443 INFO L273 TraceCheckUtils]: 13: Hoare triple {13622#true} assume true; {13622#true} is VALID [2018-11-18 23:02:30,444 INFO L268 TraceCheckUtils]: 14: Hoare quadruple {13622#true} {13655#(<= 0 main_~v~0)} #132#return; {13655#(<= 0 main_~v~0)} is VALID [2018-11-18 23:02:30,444 INFO L273 TraceCheckUtils]: 15: Hoare triple {13655#(<= 0 main_~v~0)} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {13655#(<= 0 main_~v~0)} is VALID [2018-11-18 23:02:30,445 INFO L273 TraceCheckUtils]: 16: Hoare triple {13655#(<= 0 main_~v~0)} assume 1 != #t~ret4;havoc #t~mem3;havoc #t~ret4;call #t~mem5 := read~int(~#values~0.base, ~#values~0.offset + 4 * ~v~0, 4); {13655#(<= 0 main_~v~0)} is VALID [2018-11-18 23:02:30,445 INFO L256 TraceCheckUtils]: 17: Hoare triple {13655#(<= 0 main_~v~0)} call #t~ret6 := insert(~#set~0.base, ~#set~0.offset, ~n~0, #t~mem5); {13622#true} is VALID [2018-11-18 23:02:30,445 INFO L273 TraceCheckUtils]: 18: Hoare triple {13622#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; {13622#true} is VALID [2018-11-18 23:02:30,445 INFO L273 TraceCheckUtils]: 19: Hoare triple {13622#true} assume true; {13622#true} is VALID [2018-11-18 23:02:30,446 INFO L268 TraceCheckUtils]: 20: Hoare quadruple {13622#true} {13655#(<= 0 main_~v~0)} #134#return; {13655#(<= 0 main_~v~0)} is VALID [2018-11-18 23:02:30,446 INFO L273 TraceCheckUtils]: 21: Hoare triple {13655#(<= 0 main_~v~0)} assume -2147483648 <= #t~ret6 && #t~ret6 <= 2147483647;~n~0 := #t~ret6;havoc #t~ret6;havoc #t~mem5; {13655#(<= 0 main_~v~0)} is VALID [2018-11-18 23:02:30,446 INFO L273 TraceCheckUtils]: 22: Hoare triple {13655#(<= 0 main_~v~0)} #t~post2 := ~v~0;~v~0 := 1 + #t~post2;havoc #t~post2; {13707#(<= 1 main_~v~0)} is VALID [2018-11-18 23:02:30,447 INFO L273 TraceCheckUtils]: 23: Hoare triple {13707#(<= 1 main_~v~0)} assume true; {13707#(<= 1 main_~v~0)} is VALID [2018-11-18 23:02:30,447 INFO L273 TraceCheckUtils]: 24: Hoare triple {13707#(<= 1 main_~v~0)} assume !!(~v~0 < ~SIZE~0);call #t~mem3 := read~int(~#values~0.base, ~#values~0.offset + 4 * ~v~0, 4); {13707#(<= 1 main_~v~0)} is VALID [2018-11-18 23:02:30,447 INFO L256 TraceCheckUtils]: 25: Hoare triple {13707#(<= 1 main_~v~0)} call #t~ret4 := elem_exists(~#set~0.base, ~#set~0.offset, ~n~0, #t~mem3); {13622#true} is VALID [2018-11-18 23:02:30,447 INFO L273 TraceCheckUtils]: 26: Hoare triple {13622#true} ~set.base, ~set.offset := #in~set.base, #in~set.offset;~size := #in~size;~value := #in~value;havoc ~i~0;~i~0 := 0; {13622#true} is VALID [2018-11-18 23:02:30,447 INFO L273 TraceCheckUtils]: 27: Hoare triple {13622#true} assume true; {13622#true} is VALID [2018-11-18 23:02:30,448 INFO L273 TraceCheckUtils]: 28: Hoare triple {13622#true} assume !!(~i~0 < ~size);call #t~mem1 := read~int(~set.base, ~set.offset + 4 * ~i~0, 4); {13622#true} is VALID [2018-11-18 23:02:30,448 INFO L273 TraceCheckUtils]: 29: Hoare triple {13622#true} assume #t~mem1 == ~value;havoc #t~mem1;#res := 1; {13622#true} is VALID [2018-11-18 23:02:30,448 INFO L273 TraceCheckUtils]: 30: Hoare triple {13622#true} assume true; {13622#true} is VALID [2018-11-18 23:02:30,449 INFO L268 TraceCheckUtils]: 31: Hoare quadruple {13622#true} {13707#(<= 1 main_~v~0)} #132#return; {13707#(<= 1 main_~v~0)} is VALID [2018-11-18 23:02:30,450 INFO L273 TraceCheckUtils]: 32: Hoare triple {13707#(<= 1 main_~v~0)} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {13707#(<= 1 main_~v~0)} is VALID [2018-11-18 23:02:30,450 INFO L273 TraceCheckUtils]: 33: Hoare triple {13707#(<= 1 main_~v~0)} assume !(1 != #t~ret4);havoc #t~mem3;havoc #t~ret4; {13707#(<= 1 main_~v~0)} is VALID [2018-11-18 23:02:30,450 INFO L273 TraceCheckUtils]: 34: Hoare triple {13707#(<= 1 main_~v~0)} #t~post2 := ~v~0;~v~0 := 1 + #t~post2;havoc #t~post2; {13744#(<= 2 main_~v~0)} is VALID [2018-11-18 23:02:30,451 INFO L273 TraceCheckUtils]: 35: Hoare triple {13744#(<= 2 main_~v~0)} assume true; {13744#(<= 2 main_~v~0)} is VALID [2018-11-18 23:02:30,451 INFO L273 TraceCheckUtils]: 36: Hoare triple {13744#(<= 2 main_~v~0)} assume !!(~v~0 < ~SIZE~0);call #t~mem3 := read~int(~#values~0.base, ~#values~0.offset + 4 * ~v~0, 4); {13744#(<= 2 main_~v~0)} is VALID [2018-11-18 23:02:30,451 INFO L256 TraceCheckUtils]: 37: Hoare triple {13744#(<= 2 main_~v~0)} call #t~ret4 := elem_exists(~#set~0.base, ~#set~0.offset, ~n~0, #t~mem3); {13622#true} is VALID [2018-11-18 23:02:30,451 INFO L273 TraceCheckUtils]: 38: Hoare triple {13622#true} ~set.base, ~set.offset := #in~set.base, #in~set.offset;~size := #in~size;~value := #in~value;havoc ~i~0;~i~0 := 0; {13622#true} is VALID [2018-11-18 23:02:30,451 INFO L273 TraceCheckUtils]: 39: Hoare triple {13622#true} assume true; {13622#true} is VALID [2018-11-18 23:02:30,452 INFO L273 TraceCheckUtils]: 40: Hoare triple {13622#true} assume !!(~i~0 < ~size);call #t~mem1 := read~int(~set.base, ~set.offset + 4 * ~i~0, 4); {13622#true} is VALID [2018-11-18 23:02:30,452 INFO L273 TraceCheckUtils]: 41: Hoare triple {13622#true} assume #t~mem1 == ~value;havoc #t~mem1;#res := 1; {13622#true} is VALID [2018-11-18 23:02:30,452 INFO L273 TraceCheckUtils]: 42: Hoare triple {13622#true} assume true; {13622#true} is VALID [2018-11-18 23:02:30,453 INFO L268 TraceCheckUtils]: 43: Hoare quadruple {13622#true} {13744#(<= 2 main_~v~0)} #132#return; {13744#(<= 2 main_~v~0)} is VALID [2018-11-18 23:02:30,454 INFO L273 TraceCheckUtils]: 44: Hoare triple {13744#(<= 2 main_~v~0)} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {13744#(<= 2 main_~v~0)} is VALID [2018-11-18 23:02:30,454 INFO L273 TraceCheckUtils]: 45: Hoare triple {13744#(<= 2 main_~v~0)} assume !(1 != #t~ret4);havoc #t~mem3;havoc #t~ret4; {13744#(<= 2 main_~v~0)} is VALID [2018-11-18 23:02:30,455 INFO L273 TraceCheckUtils]: 46: Hoare triple {13744#(<= 2 main_~v~0)} #t~post2 := ~v~0;~v~0 := 1 + #t~post2;havoc #t~post2; {13781#(<= 3 main_~v~0)} is VALID [2018-11-18 23:02:30,456 INFO L273 TraceCheckUtils]: 47: Hoare triple {13781#(<= 3 main_~v~0)} assume true; {13781#(<= 3 main_~v~0)} is VALID [2018-11-18 23:02:30,456 INFO L273 TraceCheckUtils]: 48: Hoare triple {13781#(<= 3 main_~v~0)} assume !!(~v~0 < ~SIZE~0);call #t~mem3 := read~int(~#values~0.base, ~#values~0.offset + 4 * ~v~0, 4); {13781#(<= 3 main_~v~0)} is VALID [2018-11-18 23:02:30,456 INFO L256 TraceCheckUtils]: 49: Hoare triple {13781#(<= 3 main_~v~0)} call #t~ret4 := elem_exists(~#set~0.base, ~#set~0.offset, ~n~0, #t~mem3); {13622#true} is VALID [2018-11-18 23:02:30,457 INFO L273 TraceCheckUtils]: 50: Hoare triple {13622#true} ~set.base, ~set.offset := #in~set.base, #in~set.offset;~size := #in~size;~value := #in~value;havoc ~i~0;~i~0 := 0; {13622#true} is VALID [2018-11-18 23:02:30,457 INFO L273 TraceCheckUtils]: 51: Hoare triple {13622#true} assume true; {13622#true} is VALID [2018-11-18 23:02:30,457 INFO L273 TraceCheckUtils]: 52: Hoare triple {13622#true} assume !!(~i~0 < ~size);call #t~mem1 := read~int(~set.base, ~set.offset + 4 * ~i~0, 4); {13622#true} is VALID [2018-11-18 23:02:30,457 INFO L273 TraceCheckUtils]: 53: Hoare triple {13622#true} assume #t~mem1 == ~value;havoc #t~mem1;#res := 1; {13622#true} is VALID [2018-11-18 23:02:30,457 INFO L273 TraceCheckUtils]: 54: Hoare triple {13622#true} assume true; {13622#true} is VALID [2018-11-18 23:02:30,458 INFO L268 TraceCheckUtils]: 55: Hoare quadruple {13622#true} {13781#(<= 3 main_~v~0)} #132#return; {13781#(<= 3 main_~v~0)} is VALID [2018-11-18 23:02:30,459 INFO L273 TraceCheckUtils]: 56: Hoare triple {13781#(<= 3 main_~v~0)} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {13781#(<= 3 main_~v~0)} is VALID [2018-11-18 23:02:30,459 INFO L273 TraceCheckUtils]: 57: Hoare triple {13781#(<= 3 main_~v~0)} assume !(1 != #t~ret4);havoc #t~mem3;havoc #t~ret4; {13781#(<= 3 main_~v~0)} is VALID [2018-11-18 23:02:30,460 INFO L273 TraceCheckUtils]: 58: Hoare triple {13781#(<= 3 main_~v~0)} #t~post2 := ~v~0;~v~0 := 1 + #t~post2;havoc #t~post2; {13818#(<= 4 main_~v~0)} is VALID [2018-11-18 23:02:30,460 INFO L273 TraceCheckUtils]: 59: Hoare triple {13818#(<= 4 main_~v~0)} assume true; {13818#(<= 4 main_~v~0)} is VALID [2018-11-18 23:02:30,460 INFO L273 TraceCheckUtils]: 60: Hoare triple {13818#(<= 4 main_~v~0)} assume !!(~v~0 < ~SIZE~0);call #t~mem3 := read~int(~#values~0.base, ~#values~0.offset + 4 * ~v~0, 4); {13818#(<= 4 main_~v~0)} is VALID [2018-11-18 23:02:30,460 INFO L256 TraceCheckUtils]: 61: Hoare triple {13818#(<= 4 main_~v~0)} call #t~ret4 := elem_exists(~#set~0.base, ~#set~0.offset, ~n~0, #t~mem3); {13622#true} is VALID [2018-11-18 23:02:30,460 INFO L273 TraceCheckUtils]: 62: Hoare triple {13622#true} ~set.base, ~set.offset := #in~set.base, #in~set.offset;~size := #in~size;~value := #in~value;havoc ~i~0;~i~0 := 0; {13622#true} is VALID [2018-11-18 23:02:30,461 INFO L273 TraceCheckUtils]: 63: Hoare triple {13622#true} assume true; {13622#true} is VALID [2018-11-18 23:02:30,461 INFO L273 TraceCheckUtils]: 64: Hoare triple {13622#true} assume !!(~i~0 < ~size);call #t~mem1 := read~int(~set.base, ~set.offset + 4 * ~i~0, 4); {13622#true} is VALID [2018-11-18 23:02:30,461 INFO L273 TraceCheckUtils]: 65: Hoare triple {13622#true} assume #t~mem1 == ~value;havoc #t~mem1;#res := 1; {13622#true} is VALID [2018-11-18 23:02:30,461 INFO L273 TraceCheckUtils]: 66: Hoare triple {13622#true} assume true; {13622#true} is VALID [2018-11-18 23:02:30,462 INFO L268 TraceCheckUtils]: 67: Hoare quadruple {13622#true} {13818#(<= 4 main_~v~0)} #132#return; {13818#(<= 4 main_~v~0)} is VALID [2018-11-18 23:02:30,463 INFO L273 TraceCheckUtils]: 68: Hoare triple {13818#(<= 4 main_~v~0)} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {13818#(<= 4 main_~v~0)} is VALID [2018-11-18 23:02:30,463 INFO L273 TraceCheckUtils]: 69: Hoare triple {13818#(<= 4 main_~v~0)} assume !(1 != #t~ret4);havoc #t~mem3;havoc #t~ret4; {13818#(<= 4 main_~v~0)} is VALID [2018-11-18 23:02:30,463 INFO L273 TraceCheckUtils]: 70: Hoare triple {13818#(<= 4 main_~v~0)} #t~post2 := ~v~0;~v~0 := 1 + #t~post2;havoc #t~post2; {13855#(<= 5 main_~v~0)} is VALID [2018-11-18 23:02:30,464 INFO L273 TraceCheckUtils]: 71: Hoare triple {13855#(<= 5 main_~v~0)} assume true; {13855#(<= 5 main_~v~0)} is VALID [2018-11-18 23:02:30,464 INFO L273 TraceCheckUtils]: 72: Hoare triple {13855#(<= 5 main_~v~0)} assume !!(~v~0 < ~SIZE~0);call #t~mem3 := read~int(~#values~0.base, ~#values~0.offset + 4 * ~v~0, 4); {13855#(<= 5 main_~v~0)} is VALID [2018-11-18 23:02:30,464 INFO L256 TraceCheckUtils]: 73: Hoare triple {13855#(<= 5 main_~v~0)} call #t~ret4 := elem_exists(~#set~0.base, ~#set~0.offset, ~n~0, #t~mem3); {13622#true} is VALID [2018-11-18 23:02:30,464 INFO L273 TraceCheckUtils]: 74: Hoare triple {13622#true} ~set.base, ~set.offset := #in~set.base, #in~set.offset;~size := #in~size;~value := #in~value;havoc ~i~0;~i~0 := 0; {13622#true} is VALID [2018-11-18 23:02:30,464 INFO L273 TraceCheckUtils]: 75: Hoare triple {13622#true} assume true; {13622#true} is VALID [2018-11-18 23:02:30,465 INFO L273 TraceCheckUtils]: 76: Hoare triple {13622#true} assume !!(~i~0 < ~size);call #t~mem1 := read~int(~set.base, ~set.offset + 4 * ~i~0, 4); {13622#true} is VALID [2018-11-18 23:02:30,465 INFO L273 TraceCheckUtils]: 77: Hoare triple {13622#true} assume #t~mem1 == ~value;havoc #t~mem1;#res := 1; {13622#true} is VALID [2018-11-18 23:02:30,465 INFO L273 TraceCheckUtils]: 78: Hoare triple {13622#true} assume true; {13622#true} is VALID [2018-11-18 23:02:30,466 INFO L268 TraceCheckUtils]: 79: Hoare quadruple {13622#true} {13855#(<= 5 main_~v~0)} #132#return; {13855#(<= 5 main_~v~0)} is VALID [2018-11-18 23:02:30,467 INFO L273 TraceCheckUtils]: 80: Hoare triple {13855#(<= 5 main_~v~0)} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {13855#(<= 5 main_~v~0)} is VALID [2018-11-18 23:02:30,467 INFO L273 TraceCheckUtils]: 81: Hoare triple {13855#(<= 5 main_~v~0)} assume !(1 != #t~ret4);havoc #t~mem3;havoc #t~ret4; {13855#(<= 5 main_~v~0)} is VALID [2018-11-18 23:02:30,468 INFO L273 TraceCheckUtils]: 82: Hoare triple {13855#(<= 5 main_~v~0)} #t~post2 := ~v~0;~v~0 := 1 + #t~post2;havoc #t~post2; {13892#(<= 6 main_~v~0)} is VALID [2018-11-18 23:02:30,468 INFO L273 TraceCheckUtils]: 83: Hoare triple {13892#(<= 6 main_~v~0)} assume true; {13892#(<= 6 main_~v~0)} is VALID [2018-11-18 23:02:30,469 INFO L273 TraceCheckUtils]: 84: Hoare triple {13892#(<= 6 main_~v~0)} assume !!(~v~0 < ~SIZE~0);call #t~mem3 := read~int(~#values~0.base, ~#values~0.offset + 4 * ~v~0, 4); {13892#(<= 6 main_~v~0)} is VALID [2018-11-18 23:02:30,469 INFO L256 TraceCheckUtils]: 85: Hoare triple {13892#(<= 6 main_~v~0)} call #t~ret4 := elem_exists(~#set~0.base, ~#set~0.offset, ~n~0, #t~mem3); {13622#true} is VALID [2018-11-18 23:02:30,469 INFO L273 TraceCheckUtils]: 86: Hoare triple {13622#true} ~set.base, ~set.offset := #in~set.base, #in~set.offset;~size := #in~size;~value := #in~value;havoc ~i~0;~i~0 := 0; {13622#true} is VALID [2018-11-18 23:02:30,470 INFO L273 TraceCheckUtils]: 87: Hoare triple {13622#true} assume true; {13622#true} is VALID [2018-11-18 23:02:30,470 INFO L273 TraceCheckUtils]: 88: Hoare triple {13622#true} assume !!(~i~0 < ~size);call #t~mem1 := read~int(~set.base, ~set.offset + 4 * ~i~0, 4); {13622#true} is VALID [2018-11-18 23:02:30,470 INFO L273 TraceCheckUtils]: 89: Hoare triple {13622#true} assume #t~mem1 == ~value;havoc #t~mem1;#res := 1; {13622#true} is VALID [2018-11-18 23:02:30,470 INFO L273 TraceCheckUtils]: 90: Hoare triple {13622#true} assume true; {13622#true} is VALID [2018-11-18 23:02:30,471 INFO L268 TraceCheckUtils]: 91: Hoare quadruple {13622#true} {13892#(<= 6 main_~v~0)} #132#return; {13892#(<= 6 main_~v~0)} is VALID [2018-11-18 23:02:30,472 INFO L273 TraceCheckUtils]: 92: Hoare triple {13892#(<= 6 main_~v~0)} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {13892#(<= 6 main_~v~0)} is VALID [2018-11-18 23:02:30,472 INFO L273 TraceCheckUtils]: 93: Hoare triple {13892#(<= 6 main_~v~0)} assume !(1 != #t~ret4);havoc #t~mem3;havoc #t~ret4; {13892#(<= 6 main_~v~0)} is VALID [2018-11-18 23:02:30,472 INFO L273 TraceCheckUtils]: 94: Hoare triple {13892#(<= 6 main_~v~0)} #t~post2 := ~v~0;~v~0 := 1 + #t~post2;havoc #t~post2; {13929#(<= 7 main_~v~0)} is VALID [2018-11-18 23:02:30,473 INFO L273 TraceCheckUtils]: 95: Hoare triple {13929#(<= 7 main_~v~0)} assume true; {13929#(<= 7 main_~v~0)} is VALID [2018-11-18 23:02:30,473 INFO L273 TraceCheckUtils]: 96: Hoare triple {13929#(<= 7 main_~v~0)} assume !!(~v~0 < ~SIZE~0);call #t~mem3 := read~int(~#values~0.base, ~#values~0.offset + 4 * ~v~0, 4); {13929#(<= 7 main_~v~0)} is VALID [2018-11-18 23:02:30,473 INFO L256 TraceCheckUtils]: 97: Hoare triple {13929#(<= 7 main_~v~0)} call #t~ret4 := elem_exists(~#set~0.base, ~#set~0.offset, ~n~0, #t~mem3); {13622#true} is VALID [2018-11-18 23:02:30,473 INFO L273 TraceCheckUtils]: 98: Hoare triple {13622#true} ~set.base, ~set.offset := #in~set.base, #in~set.offset;~size := #in~size;~value := #in~value;havoc ~i~0;~i~0 := 0; {13622#true} is VALID [2018-11-18 23:02:30,473 INFO L273 TraceCheckUtils]: 99: Hoare triple {13622#true} assume true; {13622#true} is VALID [2018-11-18 23:02:30,474 INFO L273 TraceCheckUtils]: 100: Hoare triple {13622#true} assume !!(~i~0 < ~size);call #t~mem1 := read~int(~set.base, ~set.offset + 4 * ~i~0, 4); {13622#true} is VALID [2018-11-18 23:02:30,474 INFO L273 TraceCheckUtils]: 101: Hoare triple {13622#true} assume #t~mem1 == ~value;havoc #t~mem1;#res := 1; {13622#true} is VALID [2018-11-18 23:02:30,474 INFO L273 TraceCheckUtils]: 102: Hoare triple {13622#true} assume true; {13622#true} is VALID [2018-11-18 23:02:30,475 INFO L268 TraceCheckUtils]: 103: Hoare quadruple {13622#true} {13929#(<= 7 main_~v~0)} #132#return; {13929#(<= 7 main_~v~0)} is VALID [2018-11-18 23:02:30,476 INFO L273 TraceCheckUtils]: 104: Hoare triple {13929#(<= 7 main_~v~0)} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {13929#(<= 7 main_~v~0)} is VALID [2018-11-18 23:02:30,476 INFO L273 TraceCheckUtils]: 105: Hoare triple {13929#(<= 7 main_~v~0)} assume !(1 != #t~ret4);havoc #t~mem3;havoc #t~ret4; {13929#(<= 7 main_~v~0)} is VALID [2018-11-18 23:02:30,477 INFO L273 TraceCheckUtils]: 106: Hoare triple {13929#(<= 7 main_~v~0)} #t~post2 := ~v~0;~v~0 := 1 + #t~post2;havoc #t~post2; {13966#(<= 8 main_~v~0)} is VALID [2018-11-18 23:02:30,477 INFO L273 TraceCheckUtils]: 107: Hoare triple {13966#(<= 8 main_~v~0)} assume true; {13966#(<= 8 main_~v~0)} is VALID [2018-11-18 23:02:30,477 INFO L273 TraceCheckUtils]: 108: Hoare triple {13966#(<= 8 main_~v~0)} assume !!(~v~0 < ~SIZE~0);call #t~mem3 := read~int(~#values~0.base, ~#values~0.offset + 4 * ~v~0, 4); {13966#(<= 8 main_~v~0)} is VALID [2018-11-18 23:02:30,478 INFO L256 TraceCheckUtils]: 109: Hoare triple {13966#(<= 8 main_~v~0)} call #t~ret4 := elem_exists(~#set~0.base, ~#set~0.offset, ~n~0, #t~mem3); {13622#true} is VALID [2018-11-18 23:02:30,478 INFO L273 TraceCheckUtils]: 110: Hoare triple {13622#true} ~set.base, ~set.offset := #in~set.base, #in~set.offset;~size := #in~size;~value := #in~value;havoc ~i~0;~i~0 := 0; {13622#true} is VALID [2018-11-18 23:02:30,478 INFO L273 TraceCheckUtils]: 111: Hoare triple {13622#true} assume true; {13622#true} is VALID [2018-11-18 23:02:30,478 INFO L273 TraceCheckUtils]: 112: Hoare triple {13622#true} assume !!(~i~0 < ~size);call #t~mem1 := read~int(~set.base, ~set.offset + 4 * ~i~0, 4); {13622#true} is VALID [2018-11-18 23:02:30,478 INFO L273 TraceCheckUtils]: 113: Hoare triple {13622#true} assume #t~mem1 == ~value;havoc #t~mem1;#res := 1; {13622#true} is VALID [2018-11-18 23:02:30,478 INFO L273 TraceCheckUtils]: 114: Hoare triple {13622#true} assume true; {13622#true} is VALID [2018-11-18 23:02:30,479 INFO L268 TraceCheckUtils]: 115: Hoare quadruple {13622#true} {13966#(<= 8 main_~v~0)} #132#return; {13966#(<= 8 main_~v~0)} is VALID [2018-11-18 23:02:30,480 INFO L273 TraceCheckUtils]: 116: Hoare triple {13966#(<= 8 main_~v~0)} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {13966#(<= 8 main_~v~0)} is VALID [2018-11-18 23:02:30,480 INFO L273 TraceCheckUtils]: 117: Hoare triple {13966#(<= 8 main_~v~0)} assume !(1 != #t~ret4);havoc #t~mem3;havoc #t~ret4; {13966#(<= 8 main_~v~0)} is VALID [2018-11-18 23:02:30,481 INFO L273 TraceCheckUtils]: 118: Hoare triple {13966#(<= 8 main_~v~0)} #t~post2 := ~v~0;~v~0 := 1 + #t~post2;havoc #t~post2; {14003#(<= 9 main_~v~0)} is VALID [2018-11-18 23:02:30,481 INFO L273 TraceCheckUtils]: 119: Hoare triple {14003#(<= 9 main_~v~0)} assume true; {14003#(<= 9 main_~v~0)} is VALID [2018-11-18 23:02:30,482 INFO L273 TraceCheckUtils]: 120: Hoare triple {14003#(<= 9 main_~v~0)} assume !!(~v~0 < ~SIZE~0);call #t~mem3 := read~int(~#values~0.base, ~#values~0.offset + 4 * ~v~0, 4); {14003#(<= 9 main_~v~0)} is VALID [2018-11-18 23:02:30,482 INFO L256 TraceCheckUtils]: 121: Hoare triple {14003#(<= 9 main_~v~0)} call #t~ret4 := elem_exists(~#set~0.base, ~#set~0.offset, ~n~0, #t~mem3); {13622#true} is VALID [2018-11-18 23:02:30,482 INFO L273 TraceCheckUtils]: 122: Hoare triple {13622#true} ~set.base, ~set.offset := #in~set.base, #in~set.offset;~size := #in~size;~value := #in~value;havoc ~i~0;~i~0 := 0; {13622#true} is VALID [2018-11-18 23:02:30,483 INFO L273 TraceCheckUtils]: 123: Hoare triple {13622#true} assume true; {13622#true} is VALID [2018-11-18 23:02:30,483 INFO L273 TraceCheckUtils]: 124: Hoare triple {13622#true} assume !!(~i~0 < ~size);call #t~mem1 := read~int(~set.base, ~set.offset + 4 * ~i~0, 4); {13622#true} is VALID [2018-11-18 23:02:30,483 INFO L273 TraceCheckUtils]: 125: Hoare triple {13622#true} assume #t~mem1 == ~value;havoc #t~mem1;#res := 1; {13622#true} is VALID [2018-11-18 23:02:30,483 INFO L273 TraceCheckUtils]: 126: Hoare triple {13622#true} assume true; {13622#true} is VALID [2018-11-18 23:02:30,484 INFO L268 TraceCheckUtils]: 127: Hoare quadruple {13622#true} {14003#(<= 9 main_~v~0)} #132#return; {14003#(<= 9 main_~v~0)} is VALID [2018-11-18 23:02:30,485 INFO L273 TraceCheckUtils]: 128: Hoare triple {14003#(<= 9 main_~v~0)} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {14003#(<= 9 main_~v~0)} is VALID [2018-11-18 23:02:30,485 INFO L273 TraceCheckUtils]: 129: Hoare triple {14003#(<= 9 main_~v~0)} assume !(1 != #t~ret4);havoc #t~mem3;havoc #t~ret4; {14003#(<= 9 main_~v~0)} is VALID [2018-11-18 23:02:30,486 INFO L273 TraceCheckUtils]: 130: Hoare triple {14003#(<= 9 main_~v~0)} #t~post2 := ~v~0;~v~0 := 1 + #t~post2;havoc #t~post2; {14040#(<= 10 main_~v~0)} is VALID [2018-11-18 23:02:30,486 INFO L273 TraceCheckUtils]: 131: Hoare triple {14040#(<= 10 main_~v~0)} assume true; {14040#(<= 10 main_~v~0)} is VALID [2018-11-18 23:02:30,487 INFO L273 TraceCheckUtils]: 132: Hoare triple {14040#(<= 10 main_~v~0)} assume !!(~v~0 < ~SIZE~0);call #t~mem3 := read~int(~#values~0.base, ~#values~0.offset + 4 * ~v~0, 4); {14047#(<= 11 ~SIZE~0)} is VALID [2018-11-18 23:02:30,487 INFO L256 TraceCheckUtils]: 133: Hoare triple {14047#(<= 11 ~SIZE~0)} call #t~ret4 := elem_exists(~#set~0.base, ~#set~0.offset, ~n~0, #t~mem3); {14047#(<= 11 ~SIZE~0)} is VALID [2018-11-18 23:02:30,488 INFO L273 TraceCheckUtils]: 134: Hoare triple {14047#(<= 11 ~SIZE~0)} ~set.base, ~set.offset := #in~set.base, #in~set.offset;~size := #in~size;~value := #in~value;havoc ~i~0;~i~0 := 0; {14047#(<= 11 ~SIZE~0)} is VALID [2018-11-18 23:02:30,488 INFO L273 TraceCheckUtils]: 135: Hoare triple {14047#(<= 11 ~SIZE~0)} assume true; {14047#(<= 11 ~SIZE~0)} is VALID [2018-11-18 23:02:30,489 INFO L273 TraceCheckUtils]: 136: Hoare triple {14047#(<= 11 ~SIZE~0)} assume !!(~i~0 < ~size);call #t~mem1 := read~int(~set.base, ~set.offset + 4 * ~i~0, 4); {14047#(<= 11 ~SIZE~0)} is VALID [2018-11-18 23:02:30,489 INFO L273 TraceCheckUtils]: 137: Hoare triple {14047#(<= 11 ~SIZE~0)} assume #t~mem1 == ~value;havoc #t~mem1;#res := 1; {14047#(<= 11 ~SIZE~0)} is VALID [2018-11-18 23:02:30,490 INFO L273 TraceCheckUtils]: 138: Hoare triple {14047#(<= 11 ~SIZE~0)} assume true; {14047#(<= 11 ~SIZE~0)} is VALID [2018-11-18 23:02:30,491 INFO L268 TraceCheckUtils]: 139: Hoare quadruple {14047#(<= 11 ~SIZE~0)} {14047#(<= 11 ~SIZE~0)} #132#return; {14047#(<= 11 ~SIZE~0)} is VALID [2018-11-18 23:02:30,492 INFO L273 TraceCheckUtils]: 140: Hoare triple {14047#(<= 11 ~SIZE~0)} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {14047#(<= 11 ~SIZE~0)} is VALID [2018-11-18 23:02:30,492 INFO L273 TraceCheckUtils]: 141: Hoare triple {14047#(<= 11 ~SIZE~0)} assume !(1 != #t~ret4);havoc #t~mem3;havoc #t~ret4; {14047#(<= 11 ~SIZE~0)} is VALID [2018-11-18 23:02:30,493 INFO L273 TraceCheckUtils]: 142: Hoare triple {14047#(<= 11 ~SIZE~0)} #t~post2 := ~v~0;~v~0 := 1 + #t~post2;havoc #t~post2; {14047#(<= 11 ~SIZE~0)} is VALID [2018-11-18 23:02:30,493 INFO L273 TraceCheckUtils]: 143: Hoare triple {14047#(<= 11 ~SIZE~0)} assume true; {14047#(<= 11 ~SIZE~0)} is VALID [2018-11-18 23:02:30,494 INFO L273 TraceCheckUtils]: 144: Hoare triple {14047#(<= 11 ~SIZE~0)} assume !(~v~0 < ~SIZE~0); {14047#(<= 11 ~SIZE~0)} is VALID [2018-11-18 23:02:30,494 INFO L273 TraceCheckUtils]: 145: Hoare triple {14047#(<= 11 ~SIZE~0)} ~i~1 := 0; {14087#(and (<= main_~i~1 0) (<= 11 ~SIZE~0))} is VALID [2018-11-18 23:02:30,495 INFO L273 TraceCheckUtils]: 146: Hoare triple {14087#(and (<= main_~i~1 0) (<= 11 ~SIZE~0))} assume true; {14087#(and (<= main_~i~1 0) (<= 11 ~SIZE~0))} is VALID [2018-11-18 23:02:30,496 INFO L273 TraceCheckUtils]: 147: Hoare triple {14087#(and (<= main_~i~1 0) (<= 11 ~SIZE~0))} assume !!(~i~1 < ~SIZE~0 && 1 != ~found~0);call #t~mem8 := read~int(~#set~0.base, ~#set~0.offset + 4 * ~i~1, 4); {14087#(and (<= main_~i~1 0) (<= 11 ~SIZE~0))} is VALID [2018-11-18 23:02:30,496 INFO L273 TraceCheckUtils]: 148: Hoare triple {14087#(and (<= main_~i~1 0) (<= 11 ~SIZE~0))} assume !(#t~mem8 == ~element~0);havoc #t~mem8; {14087#(and (<= main_~i~1 0) (<= 11 ~SIZE~0))} is VALID [2018-11-18 23:02:30,497 INFO L273 TraceCheckUtils]: 149: Hoare triple {14087#(and (<= main_~i~1 0) (<= 11 ~SIZE~0))} #t~post7 := ~i~1;~i~1 := 1 + #t~post7;havoc #t~post7; {14100#(and (<= main_~i~1 1) (<= 11 ~SIZE~0))} is VALID [2018-11-18 23:02:30,498 INFO L273 TraceCheckUtils]: 150: Hoare triple {14100#(and (<= main_~i~1 1) (<= 11 ~SIZE~0))} assume true; {14100#(and (<= main_~i~1 1) (<= 11 ~SIZE~0))} is VALID [2018-11-18 23:02:30,499 INFO L273 TraceCheckUtils]: 151: Hoare triple {14100#(and (<= main_~i~1 1) (<= 11 ~SIZE~0))} assume !!(~i~1 < ~SIZE~0 && 1 != ~found~0);call #t~mem8 := read~int(~#set~0.base, ~#set~0.offset + 4 * ~i~1, 4); {14100#(and (<= main_~i~1 1) (<= 11 ~SIZE~0))} is VALID [2018-11-18 23:02:30,499 INFO L273 TraceCheckUtils]: 152: Hoare triple {14100#(and (<= main_~i~1 1) (<= 11 ~SIZE~0))} assume #t~mem8 == ~element~0;havoc #t~mem8;~found~0 := 1;~pos~0 := ~i~1; {14110#(and (<= main_~pos~0 1) (<= 11 ~SIZE~0))} is VALID [2018-11-18 23:02:30,500 INFO L273 TraceCheckUtils]: 153: Hoare triple {14110#(and (<= main_~pos~0 1) (<= 11 ~SIZE~0))} #t~post7 := ~i~1;~i~1 := 1 + #t~post7;havoc #t~post7; {14110#(and (<= main_~pos~0 1) (<= 11 ~SIZE~0))} is VALID [2018-11-18 23:02:30,501 INFO L273 TraceCheckUtils]: 154: Hoare triple {14110#(and (<= main_~pos~0 1) (<= 11 ~SIZE~0))} assume true; {14110#(and (<= main_~pos~0 1) (<= 11 ~SIZE~0))} is VALID [2018-11-18 23:02:30,501 INFO L273 TraceCheckUtils]: 155: Hoare triple {14110#(and (<= main_~pos~0 1) (<= 11 ~SIZE~0))} assume !(~i~1 < ~SIZE~0 && 1 != ~found~0); {14110#(and (<= main_~pos~0 1) (<= 11 ~SIZE~0))} is VALID [2018-11-18 23:02:30,502 INFO L273 TraceCheckUtils]: 156: Hoare triple {14110#(and (<= main_~pos~0 1) (<= 11 ~SIZE~0))} assume 1 == ~found~0;~i~1 := ~pos~0; {14100#(and (<= main_~i~1 1) (<= 11 ~SIZE~0))} is VALID [2018-11-18 23:02:30,503 INFO L273 TraceCheckUtils]: 157: Hoare triple {14100#(and (<= main_~i~1 1) (<= 11 ~SIZE~0))} assume true; {14100#(and (<= main_~i~1 1) (<= 11 ~SIZE~0))} is VALID [2018-11-18 23:02:30,503 INFO L273 TraceCheckUtils]: 158: Hoare triple {14100#(and (<= main_~i~1 1) (<= 11 ~SIZE~0))} assume !!(~i~1 < ~SIZE~0 - 1);call #t~mem10 := read~int(~#set~0.base, ~#set~0.offset + 4 * (1 + ~i~1), 4);call write~int(#t~mem10, ~#set~0.base, ~#set~0.offset + 4 * ~i~1, 4);havoc #t~mem10; {14100#(and (<= main_~i~1 1) (<= 11 ~SIZE~0))} is VALID [2018-11-18 23:02:30,504 INFO L273 TraceCheckUtils]: 159: Hoare triple {14100#(and (<= main_~i~1 1) (<= 11 ~SIZE~0))} #t~post9 := ~i~1;~i~1 := 1 + #t~post9;havoc #t~post9; {14132#(and (<= main_~i~1 2) (<= 11 ~SIZE~0))} is VALID [2018-11-18 23:02:30,505 INFO L273 TraceCheckUtils]: 160: Hoare triple {14132#(and (<= main_~i~1 2) (<= 11 ~SIZE~0))} assume true; {14132#(and (<= main_~i~1 2) (<= 11 ~SIZE~0))} is VALID [2018-11-18 23:02:30,506 INFO L273 TraceCheckUtils]: 161: Hoare triple {14132#(and (<= main_~i~1 2) (<= 11 ~SIZE~0))} assume !!(~i~1 < ~SIZE~0 - 1);call #t~mem10 := read~int(~#set~0.base, ~#set~0.offset + 4 * (1 + ~i~1), 4);call write~int(#t~mem10, ~#set~0.base, ~#set~0.offset + 4 * ~i~1, 4);havoc #t~mem10; {14132#(and (<= main_~i~1 2) (<= 11 ~SIZE~0))} is VALID [2018-11-18 23:02:30,507 INFO L273 TraceCheckUtils]: 162: Hoare triple {14132#(and (<= main_~i~1 2) (<= 11 ~SIZE~0))} #t~post9 := ~i~1;~i~1 := 1 + #t~post9;havoc #t~post9; {14142#(and (<= main_~i~1 3) (<= 11 ~SIZE~0))} is VALID [2018-11-18 23:02:30,507 INFO L273 TraceCheckUtils]: 163: Hoare triple {14142#(and (<= main_~i~1 3) (<= 11 ~SIZE~0))} assume true; {14142#(and (<= main_~i~1 3) (<= 11 ~SIZE~0))} is VALID [2018-11-18 23:02:30,508 INFO L273 TraceCheckUtils]: 164: Hoare triple {14142#(and (<= main_~i~1 3) (<= 11 ~SIZE~0))} assume !(~i~1 < ~SIZE~0 - 1); {13623#false} is VALID [2018-11-18 23:02:30,508 INFO L273 TraceCheckUtils]: 165: Hoare triple {13623#false} assume 1 == ~found~0;~i~1 := 0; {13623#false} is VALID [2018-11-18 23:02:30,508 INFO L273 TraceCheckUtils]: 166: Hoare triple {13623#false} assume true; {13623#false} is VALID [2018-11-18 23:02:30,509 INFO L273 TraceCheckUtils]: 167: Hoare triple {13623#false} assume !!(~i~1 < ~SIZE~0 - 1);call #t~mem12 := read~int(~#set~0.base, ~#set~0.offset + 4 * ~i~1, 4); {13623#false} is VALID [2018-11-18 23:02:30,509 INFO L256 TraceCheckUtils]: 168: Hoare triple {13623#false} call __VERIFIER_assert((if #t~mem12 != ~element~0 then 1 else 0)); {13623#false} is VALID [2018-11-18 23:02:30,509 INFO L273 TraceCheckUtils]: 169: Hoare triple {13623#false} ~cond := #in~cond; {13623#false} is VALID [2018-11-18 23:02:30,509 INFO L273 TraceCheckUtils]: 170: Hoare triple {13623#false} assume 0 == ~cond; {13623#false} is VALID [2018-11-18 23:02:30,509 INFO L273 TraceCheckUtils]: 171: Hoare triple {13623#false} assume !false; {13623#false} is VALID [2018-11-18 23:02:30,527 INFO L134 CoverageAnalysis]: Checked inductivity of 687 backedges. 349 proven. 77 refuted. 0 times theorem prover too weak. 261 trivial. 0 not checked. [2018-11-18 23:02:30,546 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-18 23:02:30,547 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 19] total 32 [2018-11-18 23:02:30,547 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 172 [2018-11-18 23:02:30,548 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-18 23:02:30,548 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 32 states. [2018-11-18 23:02:30,765 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 228 edges. 228 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 23:02:30,766 INFO L459 AbstractCegarLoop]: Interpolant automaton has 32 states [2018-11-18 23:02:30,766 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2018-11-18 23:02:30,767 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=197, Invalid=795, Unknown=0, NotChecked=0, Total=992 [2018-11-18 23:02:30,768 INFO L87 Difference]: Start difference. First operand 192 states and 249 transitions. Second operand 32 states. [2018-11-18 23:02:37,583 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 23:02:37,584 INFO L93 Difference]: Finished difference Result 334 states and 419 transitions. [2018-11-18 23:02:37,584 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-11-18 23:02:37,584 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 172 [2018-11-18 23:02:37,584 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 23:02:37,584 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2018-11-18 23:02:37,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 308 transitions. [2018-11-18 23:02:37,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2018-11-18 23:02:37,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 308 transitions. [2018-11-18 23:02:37,592 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 25 states and 308 transitions. [2018-11-18 23:02:37,985 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 308 edges. 308 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 23:02:37,991 INFO L225 Difference]: With dead ends: 334 [2018-11-18 23:02:37,991 INFO L226 Difference]: Without dead ends: 276 [2018-11-18 23:02:37,992 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 207 GetRequests, 156 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 533 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=596, Invalid=2160, Unknown=0, NotChecked=0, Total=2756 [2018-11-18 23:02:37,993 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 276 states. [2018-11-18 23:02:38,301 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 276 to 202. [2018-11-18 23:02:38,301 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-18 23:02:38,301 INFO L82 GeneralOperation]: Start isEquivalent. First operand 276 states. Second operand 202 states. [2018-11-18 23:02:38,301 INFO L74 IsIncluded]: Start isIncluded. First operand 276 states. Second operand 202 states. [2018-11-18 23:02:38,301 INFO L87 Difference]: Start difference. First operand 276 states. Second operand 202 states. [2018-11-18 23:02:38,309 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 23:02:38,310 INFO L93 Difference]: Finished difference Result 276 states and 354 transitions. [2018-11-18 23:02:38,310 INFO L276 IsEmpty]: Start isEmpty. Operand 276 states and 354 transitions. [2018-11-18 23:02:38,311 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 23:02:38,311 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 23:02:38,311 INFO L74 IsIncluded]: Start isIncluded. First operand 202 states. Second operand 276 states. [2018-11-18 23:02:38,312 INFO L87 Difference]: Start difference. First operand 202 states. Second operand 276 states. [2018-11-18 23:02:38,320 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 23:02:38,320 INFO L93 Difference]: Finished difference Result 276 states and 354 transitions. [2018-11-18 23:02:38,321 INFO L276 IsEmpty]: Start isEmpty. Operand 276 states and 354 transitions. [2018-11-18 23:02:38,322 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 23:02:38,322 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 23:02:38,322 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-18 23:02:38,322 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-18 23:02:38,322 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 202 states. [2018-11-18 23:02:38,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 202 states to 202 states and 264 transitions. [2018-11-18 23:02:38,328 INFO L78 Accepts]: Start accepts. Automaton has 202 states and 264 transitions. Word has length 172 [2018-11-18 23:02:38,329 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 23:02:38,329 INFO L480 AbstractCegarLoop]: Abstraction has 202 states and 264 transitions. [2018-11-18 23:02:38,329 INFO L481 AbstractCegarLoop]: Interpolant automaton has 32 states. [2018-11-18 23:02:38,329 INFO L276 IsEmpty]: Start isEmpty. Operand 202 states and 264 transitions. [2018-11-18 23:02:38,331 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 186 [2018-11-18 23:02:38,332 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 23:02:38,332 INFO L375 BasicCegarLoop]: trace histogram [13, 12, 12, 12, 12, 12, 12, 12, 12, 11, 11, 11, 4, 3, 3, 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] [2018-11-18 23:02:38,332 INFO L423 AbstractCegarLoop]: === Iteration 18 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 23:02:38,332 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 23:02:38,333 INFO L82 PathProgramCache]: Analyzing trace with hash 1852322115, now seen corresponding path program 5 times [2018-11-18 23:02:38,333 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 23:02:38,333 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 23:02:38,334 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 23:02:38,334 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 23:02:38,334 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 23:02:38,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 23:02:39,199 INFO L256 TraceCheckUtils]: 0: Hoare triple {15463#true} call ULTIMATE.init(); {15463#true} is VALID [2018-11-18 23:02:39,200 INFO L273 TraceCheckUtils]: 1: Hoare triple {15463#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~SIZE~0 := 100000; {15465#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:02:39,200 INFO L273 TraceCheckUtils]: 2: Hoare triple {15465#(<= 100000 ~SIZE~0)} assume true; {15465#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:02:39,201 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {15465#(<= 100000 ~SIZE~0)} {15463#true} #128#return; {15465#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:02:39,201 INFO L256 TraceCheckUtils]: 4: Hoare triple {15465#(<= 100000 ~SIZE~0)} call #t~ret13 := main(); {15465#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:02:39,202 INFO L273 TraceCheckUtils]: 5: Hoare triple {15465#(<= 100000 ~SIZE~0)} havoc ~i~1;havoc ~pos~0;~n~0 := 0;~found~0 := 0;call ~#set~0.base, ~#set~0.offset := #Ultimate.alloc(4 * ~SIZE~0);call ~#values~0.base, ~#values~0.offset := #Ultimate.alloc(4 * ~SIZE~0);havoc ~element~0;havoc ~v~0;~v~0 := 0; {15466#(and (= main_~v~0 0) (<= 100000 ~SIZE~0))} is VALID [2018-11-18 23:02:39,203 INFO L273 TraceCheckUtils]: 6: Hoare triple {15466#(and (= main_~v~0 0) (<= 100000 ~SIZE~0))} assume true; {15466#(and (= main_~v~0 0) (<= 100000 ~SIZE~0))} is VALID [2018-11-18 23:02:39,203 INFO L273 TraceCheckUtils]: 7: Hoare triple {15466#(and (= main_~v~0 0) (<= 100000 ~SIZE~0))} assume !!(~v~0 < ~SIZE~0);call #t~mem3 := read~int(~#values~0.base, ~#values~0.offset + 4 * ~v~0, 4); {15466#(and (= main_~v~0 0) (<= 100000 ~SIZE~0))} is VALID [2018-11-18 23:02:39,203 INFO L256 TraceCheckUtils]: 8: Hoare triple {15466#(and (= main_~v~0 0) (<= 100000 ~SIZE~0))} call #t~ret4 := elem_exists(~#set~0.base, ~#set~0.offset, ~n~0, #t~mem3); {15463#true} is VALID [2018-11-18 23:02:39,203 INFO L273 TraceCheckUtils]: 9: Hoare triple {15463#true} ~set.base, ~set.offset := #in~set.base, #in~set.offset;~size := #in~size;~value := #in~value;havoc ~i~0;~i~0 := 0; {15463#true} is VALID [2018-11-18 23:02:39,204 INFO L273 TraceCheckUtils]: 10: Hoare triple {15463#true} assume true; {15463#true} is VALID [2018-11-18 23:02:39,204 INFO L273 TraceCheckUtils]: 11: Hoare triple {15463#true} assume !(~i~0 < ~size); {15463#true} is VALID [2018-11-18 23:02:39,204 INFO L273 TraceCheckUtils]: 12: Hoare triple {15463#true} #res := 0; {15463#true} is VALID [2018-11-18 23:02:39,204 INFO L273 TraceCheckUtils]: 13: Hoare triple {15463#true} assume true; {15463#true} is VALID [2018-11-18 23:02:39,205 INFO L268 TraceCheckUtils]: 14: Hoare quadruple {15463#true} {15466#(and (= main_~v~0 0) (<= 100000 ~SIZE~0))} #132#return; {15466#(and (= main_~v~0 0) (<= 100000 ~SIZE~0))} is VALID [2018-11-18 23:02:39,206 INFO L273 TraceCheckUtils]: 15: Hoare triple {15466#(and (= main_~v~0 0) (<= 100000 ~SIZE~0))} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {15466#(and (= main_~v~0 0) (<= 100000 ~SIZE~0))} is VALID [2018-11-18 23:02:39,206 INFO L273 TraceCheckUtils]: 16: Hoare triple {15466#(and (= main_~v~0 0) (<= 100000 ~SIZE~0))} assume 1 != #t~ret4;havoc #t~mem3;havoc #t~ret4;call #t~mem5 := read~int(~#values~0.base, ~#values~0.offset + 4 * ~v~0, 4); {15466#(and (= main_~v~0 0) (<= 100000 ~SIZE~0))} is VALID [2018-11-18 23:02:39,207 INFO L256 TraceCheckUtils]: 17: Hoare triple {15466#(and (= main_~v~0 0) (<= 100000 ~SIZE~0))} call #t~ret6 := insert(~#set~0.base, ~#set~0.offset, ~n~0, #t~mem5); {15463#true} is VALID [2018-11-18 23:02:39,207 INFO L273 TraceCheckUtils]: 18: Hoare triple {15463#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; {15463#true} is VALID [2018-11-18 23:02:39,207 INFO L273 TraceCheckUtils]: 19: Hoare triple {15463#true} assume true; {15463#true} is VALID [2018-11-18 23:02:39,208 INFO L268 TraceCheckUtils]: 20: Hoare quadruple {15463#true} {15466#(and (= main_~v~0 0) (<= 100000 ~SIZE~0))} #134#return; {15466#(and (= main_~v~0 0) (<= 100000 ~SIZE~0))} is VALID [2018-11-18 23:02:39,230 INFO L273 TraceCheckUtils]: 21: Hoare triple {15466#(and (= main_~v~0 0) (<= 100000 ~SIZE~0))} assume -2147483648 <= #t~ret6 && #t~ret6 <= 2147483647;~n~0 := #t~ret6;havoc #t~ret6;havoc #t~mem5; {15466#(and (= main_~v~0 0) (<= 100000 ~SIZE~0))} is VALID [2018-11-18 23:02:39,236 INFO L273 TraceCheckUtils]: 22: Hoare triple {15466#(and (= main_~v~0 0) (<= 100000 ~SIZE~0))} #t~post2 := ~v~0;~v~0 := 1 + #t~post2;havoc #t~post2; {15467#(<= (+ main_~v~0 99999) ~SIZE~0)} is VALID [2018-11-18 23:02:39,236 INFO L273 TraceCheckUtils]: 23: Hoare triple {15467#(<= (+ main_~v~0 99999) ~SIZE~0)} assume true; {15467#(<= (+ main_~v~0 99999) ~SIZE~0)} is VALID [2018-11-18 23:02:39,237 INFO L273 TraceCheckUtils]: 24: Hoare triple {15467#(<= (+ main_~v~0 99999) ~SIZE~0)} assume !!(~v~0 < ~SIZE~0);call #t~mem3 := read~int(~#values~0.base, ~#values~0.offset + 4 * ~v~0, 4); {15467#(<= (+ main_~v~0 99999) ~SIZE~0)} is VALID [2018-11-18 23:02:39,237 INFO L256 TraceCheckUtils]: 25: Hoare triple {15467#(<= (+ main_~v~0 99999) ~SIZE~0)} call #t~ret4 := elem_exists(~#set~0.base, ~#set~0.offset, ~n~0, #t~mem3); {15463#true} is VALID [2018-11-18 23:02:39,237 INFO L273 TraceCheckUtils]: 26: Hoare triple {15463#true} ~set.base, ~set.offset := #in~set.base, #in~set.offset;~size := #in~size;~value := #in~value;havoc ~i~0;~i~0 := 0; {15463#true} is VALID [2018-11-18 23:02:39,237 INFO L273 TraceCheckUtils]: 27: Hoare triple {15463#true} assume true; {15463#true} is VALID [2018-11-18 23:02:39,237 INFO L273 TraceCheckUtils]: 28: Hoare triple {15463#true} assume !!(~i~0 < ~size);call #t~mem1 := read~int(~set.base, ~set.offset + 4 * ~i~0, 4); {15463#true} is VALID [2018-11-18 23:02:39,237 INFO L273 TraceCheckUtils]: 29: Hoare triple {15463#true} assume #t~mem1 == ~value;havoc #t~mem1;#res := 1; {15463#true} is VALID [2018-11-18 23:02:39,237 INFO L273 TraceCheckUtils]: 30: Hoare triple {15463#true} assume true; {15463#true} is VALID [2018-11-18 23:02:39,238 INFO L268 TraceCheckUtils]: 31: Hoare quadruple {15463#true} {15467#(<= (+ main_~v~0 99999) ~SIZE~0)} #132#return; {15467#(<= (+ main_~v~0 99999) ~SIZE~0)} is VALID [2018-11-18 23:02:39,239 INFO L273 TraceCheckUtils]: 32: Hoare triple {15467#(<= (+ main_~v~0 99999) ~SIZE~0)} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {15467#(<= (+ main_~v~0 99999) ~SIZE~0)} is VALID [2018-11-18 23:02:39,239 INFO L273 TraceCheckUtils]: 33: Hoare triple {15467#(<= (+ main_~v~0 99999) ~SIZE~0)} assume !(1 != #t~ret4);havoc #t~mem3;havoc #t~ret4; {15467#(<= (+ main_~v~0 99999) ~SIZE~0)} is VALID [2018-11-18 23:02:39,239 INFO L273 TraceCheckUtils]: 34: Hoare triple {15467#(<= (+ main_~v~0 99999) ~SIZE~0)} #t~post2 := ~v~0;~v~0 := 1 + #t~post2;havoc #t~post2; {15468#(<= (+ main_~v~0 99998) ~SIZE~0)} is VALID [2018-11-18 23:02:39,240 INFO L273 TraceCheckUtils]: 35: Hoare triple {15468#(<= (+ main_~v~0 99998) ~SIZE~0)} assume true; {15468#(<= (+ main_~v~0 99998) ~SIZE~0)} is VALID [2018-11-18 23:02:39,240 INFO L273 TraceCheckUtils]: 36: Hoare triple {15468#(<= (+ main_~v~0 99998) ~SIZE~0)} assume !!(~v~0 < ~SIZE~0);call #t~mem3 := read~int(~#values~0.base, ~#values~0.offset + 4 * ~v~0, 4); {15468#(<= (+ main_~v~0 99998) ~SIZE~0)} is VALID [2018-11-18 23:02:39,240 INFO L256 TraceCheckUtils]: 37: Hoare triple {15468#(<= (+ main_~v~0 99998) ~SIZE~0)} call #t~ret4 := elem_exists(~#set~0.base, ~#set~0.offset, ~n~0, #t~mem3); {15463#true} is VALID [2018-11-18 23:02:39,240 INFO L273 TraceCheckUtils]: 38: Hoare triple {15463#true} ~set.base, ~set.offset := #in~set.base, #in~set.offset;~size := #in~size;~value := #in~value;havoc ~i~0;~i~0 := 0; {15463#true} is VALID [2018-11-18 23:02:39,240 INFO L273 TraceCheckUtils]: 39: Hoare triple {15463#true} assume true; {15463#true} is VALID [2018-11-18 23:02:39,241 INFO L273 TraceCheckUtils]: 40: Hoare triple {15463#true} assume !!(~i~0 < ~size);call #t~mem1 := read~int(~set.base, ~set.offset + 4 * ~i~0, 4); {15463#true} is VALID [2018-11-18 23:02:39,241 INFO L273 TraceCheckUtils]: 41: Hoare triple {15463#true} assume #t~mem1 == ~value;havoc #t~mem1;#res := 1; {15463#true} is VALID [2018-11-18 23:02:39,241 INFO L273 TraceCheckUtils]: 42: Hoare triple {15463#true} assume true; {15463#true} is VALID [2018-11-18 23:02:39,242 INFO L268 TraceCheckUtils]: 43: Hoare quadruple {15463#true} {15468#(<= (+ main_~v~0 99998) ~SIZE~0)} #132#return; {15468#(<= (+ main_~v~0 99998) ~SIZE~0)} is VALID [2018-11-18 23:02:39,242 INFO L273 TraceCheckUtils]: 44: Hoare triple {15468#(<= (+ main_~v~0 99998) ~SIZE~0)} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {15468#(<= (+ main_~v~0 99998) ~SIZE~0)} is VALID [2018-11-18 23:02:39,243 INFO L273 TraceCheckUtils]: 45: Hoare triple {15468#(<= (+ main_~v~0 99998) ~SIZE~0)} assume !(1 != #t~ret4);havoc #t~mem3;havoc #t~ret4; {15468#(<= (+ main_~v~0 99998) ~SIZE~0)} is VALID [2018-11-18 23:02:39,244 INFO L273 TraceCheckUtils]: 46: Hoare triple {15468#(<= (+ main_~v~0 99998) ~SIZE~0)} #t~post2 := ~v~0;~v~0 := 1 + #t~post2;havoc #t~post2; {15469#(<= (+ main_~v~0 99997) ~SIZE~0)} is VALID [2018-11-18 23:02:39,244 INFO L273 TraceCheckUtils]: 47: Hoare triple {15469#(<= (+ main_~v~0 99997) ~SIZE~0)} assume true; {15469#(<= (+ main_~v~0 99997) ~SIZE~0)} is VALID [2018-11-18 23:02:39,245 INFO L273 TraceCheckUtils]: 48: Hoare triple {15469#(<= (+ main_~v~0 99997) ~SIZE~0)} assume !!(~v~0 < ~SIZE~0);call #t~mem3 := read~int(~#values~0.base, ~#values~0.offset + 4 * ~v~0, 4); {15469#(<= (+ main_~v~0 99997) ~SIZE~0)} is VALID [2018-11-18 23:02:39,245 INFO L256 TraceCheckUtils]: 49: Hoare triple {15469#(<= (+ main_~v~0 99997) ~SIZE~0)} call #t~ret4 := elem_exists(~#set~0.base, ~#set~0.offset, ~n~0, #t~mem3); {15463#true} is VALID [2018-11-18 23:02:39,245 INFO L273 TraceCheckUtils]: 50: Hoare triple {15463#true} ~set.base, ~set.offset := #in~set.base, #in~set.offset;~size := #in~size;~value := #in~value;havoc ~i~0;~i~0 := 0; {15463#true} is VALID [2018-11-18 23:02:39,246 INFO L273 TraceCheckUtils]: 51: Hoare triple {15463#true} assume true; {15463#true} is VALID [2018-11-18 23:02:39,247 INFO L273 TraceCheckUtils]: 52: Hoare triple {15463#true} assume !!(~i~0 < ~size);call #t~mem1 := read~int(~set.base, ~set.offset + 4 * ~i~0, 4); {15463#true} is VALID [2018-11-18 23:02:39,247 INFO L273 TraceCheckUtils]: 53: Hoare triple {15463#true} assume #t~mem1 == ~value;havoc #t~mem1;#res := 1; {15463#true} is VALID [2018-11-18 23:02:39,247 INFO L273 TraceCheckUtils]: 54: Hoare triple {15463#true} assume true; {15463#true} is VALID [2018-11-18 23:02:39,251 INFO L268 TraceCheckUtils]: 55: Hoare quadruple {15463#true} {15469#(<= (+ main_~v~0 99997) ~SIZE~0)} #132#return; {15469#(<= (+ main_~v~0 99997) ~SIZE~0)} is VALID [2018-11-18 23:02:39,251 INFO L273 TraceCheckUtils]: 56: Hoare triple {15469#(<= (+ main_~v~0 99997) ~SIZE~0)} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {15469#(<= (+ main_~v~0 99997) ~SIZE~0)} is VALID [2018-11-18 23:02:39,252 INFO L273 TraceCheckUtils]: 57: Hoare triple {15469#(<= (+ main_~v~0 99997) ~SIZE~0)} assume !(1 != #t~ret4);havoc #t~mem3;havoc #t~ret4; {15469#(<= (+ main_~v~0 99997) ~SIZE~0)} is VALID [2018-11-18 23:02:39,252 INFO L273 TraceCheckUtils]: 58: Hoare triple {15469#(<= (+ main_~v~0 99997) ~SIZE~0)} #t~post2 := ~v~0;~v~0 := 1 + #t~post2;havoc #t~post2; {15470#(<= (+ main_~v~0 99996) ~SIZE~0)} is VALID [2018-11-18 23:02:39,252 INFO L273 TraceCheckUtils]: 59: Hoare triple {15470#(<= (+ main_~v~0 99996) ~SIZE~0)} assume true; {15470#(<= (+ main_~v~0 99996) ~SIZE~0)} is VALID [2018-11-18 23:02:39,253 INFO L273 TraceCheckUtils]: 60: Hoare triple {15470#(<= (+ main_~v~0 99996) ~SIZE~0)} assume !!(~v~0 < ~SIZE~0);call #t~mem3 := read~int(~#values~0.base, ~#values~0.offset + 4 * ~v~0, 4); {15470#(<= (+ main_~v~0 99996) ~SIZE~0)} is VALID [2018-11-18 23:02:39,253 INFO L256 TraceCheckUtils]: 61: Hoare triple {15470#(<= (+ main_~v~0 99996) ~SIZE~0)} call #t~ret4 := elem_exists(~#set~0.base, ~#set~0.offset, ~n~0, #t~mem3); {15463#true} is VALID [2018-11-18 23:02:39,253 INFO L273 TraceCheckUtils]: 62: Hoare triple {15463#true} ~set.base, ~set.offset := #in~set.base, #in~set.offset;~size := #in~size;~value := #in~value;havoc ~i~0;~i~0 := 0; {15463#true} is VALID [2018-11-18 23:02:39,253 INFO L273 TraceCheckUtils]: 63: Hoare triple {15463#true} assume true; {15463#true} is VALID [2018-11-18 23:02:39,253 INFO L273 TraceCheckUtils]: 64: Hoare triple {15463#true} assume !!(~i~0 < ~size);call #t~mem1 := read~int(~set.base, ~set.offset + 4 * ~i~0, 4); {15463#true} is VALID [2018-11-18 23:02:39,253 INFO L273 TraceCheckUtils]: 65: Hoare triple {15463#true} assume #t~mem1 == ~value;havoc #t~mem1;#res := 1; {15463#true} is VALID [2018-11-18 23:02:39,253 INFO L273 TraceCheckUtils]: 66: Hoare triple {15463#true} assume true; {15463#true} is VALID [2018-11-18 23:02:39,254 INFO L268 TraceCheckUtils]: 67: Hoare quadruple {15463#true} {15470#(<= (+ main_~v~0 99996) ~SIZE~0)} #132#return; {15470#(<= (+ main_~v~0 99996) ~SIZE~0)} is VALID [2018-11-18 23:02:39,255 INFO L273 TraceCheckUtils]: 68: Hoare triple {15470#(<= (+ main_~v~0 99996) ~SIZE~0)} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {15470#(<= (+ main_~v~0 99996) ~SIZE~0)} is VALID [2018-11-18 23:02:39,255 INFO L273 TraceCheckUtils]: 69: Hoare triple {15470#(<= (+ main_~v~0 99996) ~SIZE~0)} assume !(1 != #t~ret4);havoc #t~mem3;havoc #t~ret4; {15470#(<= (+ main_~v~0 99996) ~SIZE~0)} is VALID [2018-11-18 23:02:39,255 INFO L273 TraceCheckUtils]: 70: Hoare triple {15470#(<= (+ main_~v~0 99996) ~SIZE~0)} #t~post2 := ~v~0;~v~0 := 1 + #t~post2;havoc #t~post2; {15471#(<= (+ main_~v~0 99995) ~SIZE~0)} is VALID [2018-11-18 23:02:39,256 INFO L273 TraceCheckUtils]: 71: Hoare triple {15471#(<= (+ main_~v~0 99995) ~SIZE~0)} assume true; {15471#(<= (+ main_~v~0 99995) ~SIZE~0)} is VALID [2018-11-18 23:02:39,256 INFO L273 TraceCheckUtils]: 72: Hoare triple {15471#(<= (+ main_~v~0 99995) ~SIZE~0)} assume !!(~v~0 < ~SIZE~0);call #t~mem3 := read~int(~#values~0.base, ~#values~0.offset + 4 * ~v~0, 4); {15471#(<= (+ main_~v~0 99995) ~SIZE~0)} is VALID [2018-11-18 23:02:39,256 INFO L256 TraceCheckUtils]: 73: Hoare triple {15471#(<= (+ main_~v~0 99995) ~SIZE~0)} call #t~ret4 := elem_exists(~#set~0.base, ~#set~0.offset, ~n~0, #t~mem3); {15463#true} is VALID [2018-11-18 23:02:39,256 INFO L273 TraceCheckUtils]: 74: Hoare triple {15463#true} ~set.base, ~set.offset := #in~set.base, #in~set.offset;~size := #in~size;~value := #in~value;havoc ~i~0;~i~0 := 0; {15463#true} is VALID [2018-11-18 23:02:39,257 INFO L273 TraceCheckUtils]: 75: Hoare triple {15463#true} assume true; {15463#true} is VALID [2018-11-18 23:02:39,257 INFO L273 TraceCheckUtils]: 76: Hoare triple {15463#true} assume !!(~i~0 < ~size);call #t~mem1 := read~int(~set.base, ~set.offset + 4 * ~i~0, 4); {15463#true} is VALID [2018-11-18 23:02:39,257 INFO L273 TraceCheckUtils]: 77: Hoare triple {15463#true} assume #t~mem1 == ~value;havoc #t~mem1;#res := 1; {15463#true} is VALID [2018-11-18 23:02:39,257 INFO L273 TraceCheckUtils]: 78: Hoare triple {15463#true} assume true; {15463#true} is VALID [2018-11-18 23:02:39,263 INFO L268 TraceCheckUtils]: 79: Hoare quadruple {15463#true} {15471#(<= (+ main_~v~0 99995) ~SIZE~0)} #132#return; {15471#(<= (+ main_~v~0 99995) ~SIZE~0)} is VALID [2018-11-18 23:02:39,264 INFO L273 TraceCheckUtils]: 80: Hoare triple {15471#(<= (+ main_~v~0 99995) ~SIZE~0)} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {15471#(<= (+ main_~v~0 99995) ~SIZE~0)} is VALID [2018-11-18 23:02:39,264 INFO L273 TraceCheckUtils]: 81: Hoare triple {15471#(<= (+ main_~v~0 99995) ~SIZE~0)} assume !(1 != #t~ret4);havoc #t~mem3;havoc #t~ret4; {15471#(<= (+ main_~v~0 99995) ~SIZE~0)} is VALID [2018-11-18 23:02:39,265 INFO L273 TraceCheckUtils]: 82: Hoare triple {15471#(<= (+ main_~v~0 99995) ~SIZE~0)} #t~post2 := ~v~0;~v~0 := 1 + #t~post2;havoc #t~post2; {15472#(<= (+ main_~v~0 99994) ~SIZE~0)} is VALID [2018-11-18 23:02:39,265 INFO L273 TraceCheckUtils]: 83: Hoare triple {15472#(<= (+ main_~v~0 99994) ~SIZE~0)} assume true; {15472#(<= (+ main_~v~0 99994) ~SIZE~0)} is VALID [2018-11-18 23:02:39,265 INFO L273 TraceCheckUtils]: 84: Hoare triple {15472#(<= (+ main_~v~0 99994) ~SIZE~0)} assume !!(~v~0 < ~SIZE~0);call #t~mem3 := read~int(~#values~0.base, ~#values~0.offset + 4 * ~v~0, 4); {15472#(<= (+ main_~v~0 99994) ~SIZE~0)} is VALID [2018-11-18 23:02:39,266 INFO L256 TraceCheckUtils]: 85: Hoare triple {15472#(<= (+ main_~v~0 99994) ~SIZE~0)} call #t~ret4 := elem_exists(~#set~0.base, ~#set~0.offset, ~n~0, #t~mem3); {15463#true} is VALID [2018-11-18 23:02:39,266 INFO L273 TraceCheckUtils]: 86: Hoare triple {15463#true} ~set.base, ~set.offset := #in~set.base, #in~set.offset;~size := #in~size;~value := #in~value;havoc ~i~0;~i~0 := 0; {15463#true} is VALID [2018-11-18 23:02:39,266 INFO L273 TraceCheckUtils]: 87: Hoare triple {15463#true} assume true; {15463#true} is VALID [2018-11-18 23:02:39,266 INFO L273 TraceCheckUtils]: 88: Hoare triple {15463#true} assume !!(~i~0 < ~size);call #t~mem1 := read~int(~set.base, ~set.offset + 4 * ~i~0, 4); {15463#true} is VALID [2018-11-18 23:02:39,266 INFO L273 TraceCheckUtils]: 89: Hoare triple {15463#true} assume #t~mem1 == ~value;havoc #t~mem1;#res := 1; {15463#true} is VALID [2018-11-18 23:02:39,266 INFO L273 TraceCheckUtils]: 90: Hoare triple {15463#true} assume true; {15463#true} is VALID [2018-11-18 23:02:39,267 INFO L268 TraceCheckUtils]: 91: Hoare quadruple {15463#true} {15472#(<= (+ main_~v~0 99994) ~SIZE~0)} #132#return; {15472#(<= (+ main_~v~0 99994) ~SIZE~0)} is VALID [2018-11-18 23:02:39,267 INFO L273 TraceCheckUtils]: 92: Hoare triple {15472#(<= (+ main_~v~0 99994) ~SIZE~0)} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {15472#(<= (+ main_~v~0 99994) ~SIZE~0)} is VALID [2018-11-18 23:02:39,268 INFO L273 TraceCheckUtils]: 93: Hoare triple {15472#(<= (+ main_~v~0 99994) ~SIZE~0)} assume !(1 != #t~ret4);havoc #t~mem3;havoc #t~ret4; {15472#(<= (+ main_~v~0 99994) ~SIZE~0)} is VALID [2018-11-18 23:02:39,269 INFO L273 TraceCheckUtils]: 94: Hoare triple {15472#(<= (+ main_~v~0 99994) ~SIZE~0)} #t~post2 := ~v~0;~v~0 := 1 + #t~post2;havoc #t~post2; {15473#(<= (+ main_~v~0 99993) ~SIZE~0)} is VALID [2018-11-18 23:02:39,269 INFO L273 TraceCheckUtils]: 95: Hoare triple {15473#(<= (+ main_~v~0 99993) ~SIZE~0)} assume true; {15473#(<= (+ main_~v~0 99993) ~SIZE~0)} is VALID [2018-11-18 23:02:39,270 INFO L273 TraceCheckUtils]: 96: Hoare triple {15473#(<= (+ main_~v~0 99993) ~SIZE~0)} assume !!(~v~0 < ~SIZE~0);call #t~mem3 := read~int(~#values~0.base, ~#values~0.offset + 4 * ~v~0, 4); {15473#(<= (+ main_~v~0 99993) ~SIZE~0)} is VALID [2018-11-18 23:02:39,270 INFO L256 TraceCheckUtils]: 97: Hoare triple {15473#(<= (+ main_~v~0 99993) ~SIZE~0)} call #t~ret4 := elem_exists(~#set~0.base, ~#set~0.offset, ~n~0, #t~mem3); {15463#true} is VALID [2018-11-18 23:02:39,270 INFO L273 TraceCheckUtils]: 98: Hoare triple {15463#true} ~set.base, ~set.offset := #in~set.base, #in~set.offset;~size := #in~size;~value := #in~value;havoc ~i~0;~i~0 := 0; {15463#true} is VALID [2018-11-18 23:02:39,271 INFO L273 TraceCheckUtils]: 99: Hoare triple {15463#true} assume true; {15463#true} is VALID [2018-11-18 23:02:39,271 INFO L273 TraceCheckUtils]: 100: Hoare triple {15463#true} assume !!(~i~0 < ~size);call #t~mem1 := read~int(~set.base, ~set.offset + 4 * ~i~0, 4); {15463#true} is VALID [2018-11-18 23:02:39,271 INFO L273 TraceCheckUtils]: 101: Hoare triple {15463#true} assume #t~mem1 == ~value;havoc #t~mem1;#res := 1; {15463#true} is VALID [2018-11-18 23:02:39,271 INFO L273 TraceCheckUtils]: 102: Hoare triple {15463#true} assume true; {15463#true} is VALID [2018-11-18 23:02:39,272 INFO L268 TraceCheckUtils]: 103: Hoare quadruple {15463#true} {15473#(<= (+ main_~v~0 99993) ~SIZE~0)} #132#return; {15473#(<= (+ main_~v~0 99993) ~SIZE~0)} is VALID [2018-11-18 23:02:39,273 INFO L273 TraceCheckUtils]: 104: Hoare triple {15473#(<= (+ main_~v~0 99993) ~SIZE~0)} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {15473#(<= (+ main_~v~0 99993) ~SIZE~0)} is VALID [2018-11-18 23:02:39,273 INFO L273 TraceCheckUtils]: 105: Hoare triple {15473#(<= (+ main_~v~0 99993) ~SIZE~0)} assume !(1 != #t~ret4);havoc #t~mem3;havoc #t~ret4; {15473#(<= (+ main_~v~0 99993) ~SIZE~0)} is VALID [2018-11-18 23:02:39,274 INFO L273 TraceCheckUtils]: 106: Hoare triple {15473#(<= (+ main_~v~0 99993) ~SIZE~0)} #t~post2 := ~v~0;~v~0 := 1 + #t~post2;havoc #t~post2; {15474#(<= (+ main_~v~0 99992) ~SIZE~0)} is VALID [2018-11-18 23:02:39,275 INFO L273 TraceCheckUtils]: 107: Hoare triple {15474#(<= (+ main_~v~0 99992) ~SIZE~0)} assume true; {15474#(<= (+ main_~v~0 99992) ~SIZE~0)} is VALID [2018-11-18 23:02:39,275 INFO L273 TraceCheckUtils]: 108: Hoare triple {15474#(<= (+ main_~v~0 99992) ~SIZE~0)} assume !!(~v~0 < ~SIZE~0);call #t~mem3 := read~int(~#values~0.base, ~#values~0.offset + 4 * ~v~0, 4); {15474#(<= (+ main_~v~0 99992) ~SIZE~0)} is VALID [2018-11-18 23:02:39,275 INFO L256 TraceCheckUtils]: 109: Hoare triple {15474#(<= (+ main_~v~0 99992) ~SIZE~0)} call #t~ret4 := elem_exists(~#set~0.base, ~#set~0.offset, ~n~0, #t~mem3); {15463#true} is VALID [2018-11-18 23:02:39,275 INFO L273 TraceCheckUtils]: 110: Hoare triple {15463#true} ~set.base, ~set.offset := #in~set.base, #in~set.offset;~size := #in~size;~value := #in~value;havoc ~i~0;~i~0 := 0; {15463#true} is VALID [2018-11-18 23:02:39,275 INFO L273 TraceCheckUtils]: 111: Hoare triple {15463#true} assume true; {15463#true} is VALID [2018-11-18 23:02:39,275 INFO L273 TraceCheckUtils]: 112: Hoare triple {15463#true} assume !!(~i~0 < ~size);call #t~mem1 := read~int(~set.base, ~set.offset + 4 * ~i~0, 4); {15463#true} is VALID [2018-11-18 23:02:39,275 INFO L273 TraceCheckUtils]: 113: Hoare triple {15463#true} assume #t~mem1 == ~value;havoc #t~mem1;#res := 1; {15463#true} is VALID [2018-11-18 23:02:39,276 INFO L273 TraceCheckUtils]: 114: Hoare triple {15463#true} assume true; {15463#true} is VALID [2018-11-18 23:02:39,276 INFO L268 TraceCheckUtils]: 115: Hoare quadruple {15463#true} {15474#(<= (+ main_~v~0 99992) ~SIZE~0)} #132#return; {15474#(<= (+ main_~v~0 99992) ~SIZE~0)} is VALID [2018-11-18 23:02:39,277 INFO L273 TraceCheckUtils]: 116: Hoare triple {15474#(<= (+ main_~v~0 99992) ~SIZE~0)} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {15474#(<= (+ main_~v~0 99992) ~SIZE~0)} is VALID [2018-11-18 23:02:39,277 INFO L273 TraceCheckUtils]: 117: Hoare triple {15474#(<= (+ main_~v~0 99992) ~SIZE~0)} assume !(1 != #t~ret4);havoc #t~mem3;havoc #t~ret4; {15474#(<= (+ main_~v~0 99992) ~SIZE~0)} is VALID [2018-11-18 23:02:39,278 INFO L273 TraceCheckUtils]: 118: Hoare triple {15474#(<= (+ main_~v~0 99992) ~SIZE~0)} #t~post2 := ~v~0;~v~0 := 1 + #t~post2;havoc #t~post2; {15475#(<= (+ main_~v~0 99991) ~SIZE~0)} is VALID [2018-11-18 23:02:39,278 INFO L273 TraceCheckUtils]: 119: Hoare triple {15475#(<= (+ main_~v~0 99991) ~SIZE~0)} assume true; {15475#(<= (+ main_~v~0 99991) ~SIZE~0)} is VALID [2018-11-18 23:02:39,278 INFO L273 TraceCheckUtils]: 120: Hoare triple {15475#(<= (+ main_~v~0 99991) ~SIZE~0)} assume !!(~v~0 < ~SIZE~0);call #t~mem3 := read~int(~#values~0.base, ~#values~0.offset + 4 * ~v~0, 4); {15475#(<= (+ main_~v~0 99991) ~SIZE~0)} is VALID [2018-11-18 23:02:39,278 INFO L256 TraceCheckUtils]: 121: Hoare triple {15475#(<= (+ main_~v~0 99991) ~SIZE~0)} call #t~ret4 := elem_exists(~#set~0.base, ~#set~0.offset, ~n~0, #t~mem3); {15463#true} is VALID [2018-11-18 23:02:39,278 INFO L273 TraceCheckUtils]: 122: Hoare triple {15463#true} ~set.base, ~set.offset := #in~set.base, #in~set.offset;~size := #in~size;~value := #in~value;havoc ~i~0;~i~0 := 0; {15463#true} is VALID [2018-11-18 23:02:39,279 INFO L273 TraceCheckUtils]: 123: Hoare triple {15463#true} assume true; {15463#true} is VALID [2018-11-18 23:02:39,279 INFO L273 TraceCheckUtils]: 124: Hoare triple {15463#true} assume !!(~i~0 < ~size);call #t~mem1 := read~int(~set.base, ~set.offset + 4 * ~i~0, 4); {15463#true} is VALID [2018-11-18 23:02:39,279 INFO L273 TraceCheckUtils]: 125: Hoare triple {15463#true} assume #t~mem1 == ~value;havoc #t~mem1;#res := 1; {15463#true} is VALID [2018-11-18 23:02:39,279 INFO L273 TraceCheckUtils]: 126: Hoare triple {15463#true} assume true; {15463#true} is VALID [2018-11-18 23:02:39,280 INFO L268 TraceCheckUtils]: 127: Hoare quadruple {15463#true} {15475#(<= (+ main_~v~0 99991) ~SIZE~0)} #132#return; {15475#(<= (+ main_~v~0 99991) ~SIZE~0)} is VALID [2018-11-18 23:02:39,280 INFO L273 TraceCheckUtils]: 128: Hoare triple {15475#(<= (+ main_~v~0 99991) ~SIZE~0)} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {15475#(<= (+ main_~v~0 99991) ~SIZE~0)} is VALID [2018-11-18 23:02:39,280 INFO L273 TraceCheckUtils]: 129: Hoare triple {15475#(<= (+ main_~v~0 99991) ~SIZE~0)} assume !(1 != #t~ret4);havoc #t~mem3;havoc #t~ret4; {15475#(<= (+ main_~v~0 99991) ~SIZE~0)} is VALID [2018-11-18 23:02:39,281 INFO L273 TraceCheckUtils]: 130: Hoare triple {15475#(<= (+ main_~v~0 99991) ~SIZE~0)} #t~post2 := ~v~0;~v~0 := 1 + #t~post2;havoc #t~post2; {15476#(<= (+ main_~v~0 99990) ~SIZE~0)} is VALID [2018-11-18 23:02:39,281 INFO L273 TraceCheckUtils]: 131: Hoare triple {15476#(<= (+ main_~v~0 99990) ~SIZE~0)} assume true; {15476#(<= (+ main_~v~0 99990) ~SIZE~0)} is VALID [2018-11-18 23:02:39,282 INFO L273 TraceCheckUtils]: 132: Hoare triple {15476#(<= (+ main_~v~0 99990) ~SIZE~0)} assume !!(~v~0 < ~SIZE~0);call #t~mem3 := read~int(~#values~0.base, ~#values~0.offset + 4 * ~v~0, 4); {15476#(<= (+ main_~v~0 99990) ~SIZE~0)} is VALID [2018-11-18 23:02:39,282 INFO L256 TraceCheckUtils]: 133: Hoare triple {15476#(<= (+ main_~v~0 99990) ~SIZE~0)} call #t~ret4 := elem_exists(~#set~0.base, ~#set~0.offset, ~n~0, #t~mem3); {15463#true} is VALID [2018-11-18 23:02:39,282 INFO L273 TraceCheckUtils]: 134: Hoare triple {15463#true} ~set.base, ~set.offset := #in~set.base, #in~set.offset;~size := #in~size;~value := #in~value;havoc ~i~0;~i~0 := 0; {15463#true} is VALID [2018-11-18 23:02:39,282 INFO L273 TraceCheckUtils]: 135: Hoare triple {15463#true} assume true; {15463#true} is VALID [2018-11-18 23:02:39,282 INFO L273 TraceCheckUtils]: 136: Hoare triple {15463#true} assume !!(~i~0 < ~size);call #t~mem1 := read~int(~set.base, ~set.offset + 4 * ~i~0, 4); {15463#true} is VALID [2018-11-18 23:02:39,283 INFO L273 TraceCheckUtils]: 137: Hoare triple {15463#true} assume #t~mem1 == ~value;havoc #t~mem1;#res := 1; {15463#true} is VALID [2018-11-18 23:02:39,283 INFO L273 TraceCheckUtils]: 138: Hoare triple {15463#true} assume true; {15463#true} is VALID [2018-11-18 23:02:39,284 INFO L268 TraceCheckUtils]: 139: Hoare quadruple {15463#true} {15476#(<= (+ main_~v~0 99990) ~SIZE~0)} #132#return; {15476#(<= (+ main_~v~0 99990) ~SIZE~0)} is VALID [2018-11-18 23:02:39,285 INFO L273 TraceCheckUtils]: 140: Hoare triple {15476#(<= (+ main_~v~0 99990) ~SIZE~0)} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {15476#(<= (+ main_~v~0 99990) ~SIZE~0)} is VALID [2018-11-18 23:02:39,285 INFO L273 TraceCheckUtils]: 141: Hoare triple {15476#(<= (+ main_~v~0 99990) ~SIZE~0)} assume !(1 != #t~ret4);havoc #t~mem3;havoc #t~ret4; {15476#(<= (+ main_~v~0 99990) ~SIZE~0)} is VALID [2018-11-18 23:02:39,286 INFO L273 TraceCheckUtils]: 142: Hoare triple {15476#(<= (+ main_~v~0 99990) ~SIZE~0)} #t~post2 := ~v~0;~v~0 := 1 + #t~post2;havoc #t~post2; {15477#(<= (+ main_~v~0 99989) ~SIZE~0)} is VALID [2018-11-18 23:02:39,287 INFO L273 TraceCheckUtils]: 143: Hoare triple {15477#(<= (+ main_~v~0 99989) ~SIZE~0)} assume true; {15477#(<= (+ main_~v~0 99989) ~SIZE~0)} is VALID [2018-11-18 23:02:39,287 INFO L273 TraceCheckUtils]: 144: Hoare triple {15477#(<= (+ main_~v~0 99989) ~SIZE~0)} assume !!(~v~0 < ~SIZE~0);call #t~mem3 := read~int(~#values~0.base, ~#values~0.offset + 4 * ~v~0, 4); {15477#(<= (+ main_~v~0 99989) ~SIZE~0)} is VALID [2018-11-18 23:02:39,287 INFO L256 TraceCheckUtils]: 145: Hoare triple {15477#(<= (+ main_~v~0 99989) ~SIZE~0)} call #t~ret4 := elem_exists(~#set~0.base, ~#set~0.offset, ~n~0, #t~mem3); {15463#true} is VALID [2018-11-18 23:02:39,288 INFO L273 TraceCheckUtils]: 146: Hoare triple {15463#true} ~set.base, ~set.offset := #in~set.base, #in~set.offset;~size := #in~size;~value := #in~value;havoc ~i~0;~i~0 := 0; {15463#true} is VALID [2018-11-18 23:02:39,288 INFO L273 TraceCheckUtils]: 147: Hoare triple {15463#true} assume true; {15463#true} is VALID [2018-11-18 23:02:39,288 INFO L273 TraceCheckUtils]: 148: Hoare triple {15463#true} assume !!(~i~0 < ~size);call #t~mem1 := read~int(~set.base, ~set.offset + 4 * ~i~0, 4); {15463#true} is VALID [2018-11-18 23:02:39,288 INFO L273 TraceCheckUtils]: 149: Hoare triple {15463#true} assume #t~mem1 == ~value;havoc #t~mem1;#res := 1; {15463#true} is VALID [2018-11-18 23:02:39,288 INFO L273 TraceCheckUtils]: 150: Hoare triple {15463#true} assume true; {15463#true} is VALID [2018-11-18 23:02:39,290 INFO L268 TraceCheckUtils]: 151: Hoare quadruple {15463#true} {15477#(<= (+ main_~v~0 99989) ~SIZE~0)} #132#return; {15477#(<= (+ main_~v~0 99989) ~SIZE~0)} is VALID [2018-11-18 23:02:39,290 INFO L273 TraceCheckUtils]: 152: Hoare triple {15477#(<= (+ main_~v~0 99989) ~SIZE~0)} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {15477#(<= (+ main_~v~0 99989) ~SIZE~0)} is VALID [2018-11-18 23:02:39,291 INFO L273 TraceCheckUtils]: 153: Hoare triple {15477#(<= (+ main_~v~0 99989) ~SIZE~0)} assume !(1 != #t~ret4);havoc #t~mem3;havoc #t~ret4; {15477#(<= (+ main_~v~0 99989) ~SIZE~0)} is VALID [2018-11-18 23:02:39,292 INFO L273 TraceCheckUtils]: 154: Hoare triple {15477#(<= (+ main_~v~0 99989) ~SIZE~0)} #t~post2 := ~v~0;~v~0 := 1 + #t~post2;havoc #t~post2; {15478#(<= (+ main_~v~0 99988) ~SIZE~0)} is VALID [2018-11-18 23:02:39,292 INFO L273 TraceCheckUtils]: 155: Hoare triple {15478#(<= (+ main_~v~0 99988) ~SIZE~0)} assume true; {15478#(<= (+ main_~v~0 99988) ~SIZE~0)} is VALID [2018-11-18 23:02:39,293 INFO L273 TraceCheckUtils]: 156: Hoare triple {15478#(<= (+ main_~v~0 99988) ~SIZE~0)} assume !(~v~0 < ~SIZE~0); {15464#false} is VALID [2018-11-18 23:02:39,293 INFO L273 TraceCheckUtils]: 157: Hoare triple {15464#false} ~i~1 := 0; {15464#false} is VALID [2018-11-18 23:02:39,293 INFO L273 TraceCheckUtils]: 158: Hoare triple {15464#false} assume true; {15464#false} is VALID [2018-11-18 23:02:39,293 INFO L273 TraceCheckUtils]: 159: Hoare triple {15464#false} assume !!(~i~1 < ~SIZE~0 && 1 != ~found~0);call #t~mem8 := read~int(~#set~0.base, ~#set~0.offset + 4 * ~i~1, 4); {15464#false} is VALID [2018-11-18 23:02:39,294 INFO L273 TraceCheckUtils]: 160: Hoare triple {15464#false} assume !(#t~mem8 == ~element~0);havoc #t~mem8; {15464#false} is VALID [2018-11-18 23:02:39,294 INFO L273 TraceCheckUtils]: 161: Hoare triple {15464#false} #t~post7 := ~i~1;~i~1 := 1 + #t~post7;havoc #t~post7; {15464#false} is VALID [2018-11-18 23:02:39,294 INFO L273 TraceCheckUtils]: 162: Hoare triple {15464#false} assume true; {15464#false} is VALID [2018-11-18 23:02:39,294 INFO L273 TraceCheckUtils]: 163: Hoare triple {15464#false} assume !!(~i~1 < ~SIZE~0 && 1 != ~found~0);call #t~mem8 := read~int(~#set~0.base, ~#set~0.offset + 4 * ~i~1, 4); {15464#false} is VALID [2018-11-18 23:02:39,294 INFO L273 TraceCheckUtils]: 164: Hoare triple {15464#false} assume !(#t~mem8 == ~element~0);havoc #t~mem8; {15464#false} is VALID [2018-11-18 23:02:39,295 INFO L273 TraceCheckUtils]: 165: Hoare triple {15464#false} #t~post7 := ~i~1;~i~1 := 1 + #t~post7;havoc #t~post7; {15464#false} is VALID [2018-11-18 23:02:39,295 INFO L273 TraceCheckUtils]: 166: Hoare triple {15464#false} assume true; {15464#false} is VALID [2018-11-18 23:02:39,295 INFO L273 TraceCheckUtils]: 167: Hoare triple {15464#false} assume !!(~i~1 < ~SIZE~0 && 1 != ~found~0);call #t~mem8 := read~int(~#set~0.base, ~#set~0.offset + 4 * ~i~1, 4); {15464#false} is VALID [2018-11-18 23:02:39,295 INFO L273 TraceCheckUtils]: 168: Hoare triple {15464#false} assume #t~mem8 == ~element~0;havoc #t~mem8;~found~0 := 1;~pos~0 := ~i~1; {15464#false} is VALID [2018-11-18 23:02:39,295 INFO L273 TraceCheckUtils]: 169: Hoare triple {15464#false} #t~post7 := ~i~1;~i~1 := 1 + #t~post7;havoc #t~post7; {15464#false} is VALID [2018-11-18 23:02:39,296 INFO L273 TraceCheckUtils]: 170: Hoare triple {15464#false} assume true; {15464#false} is VALID [2018-11-18 23:02:39,296 INFO L273 TraceCheckUtils]: 171: Hoare triple {15464#false} assume !(~i~1 < ~SIZE~0 && 1 != ~found~0); {15464#false} is VALID [2018-11-18 23:02:39,296 INFO L273 TraceCheckUtils]: 172: Hoare triple {15464#false} assume 1 == ~found~0;~i~1 := ~pos~0; {15464#false} is VALID [2018-11-18 23:02:39,296 INFO L273 TraceCheckUtils]: 173: Hoare triple {15464#false} assume true; {15464#false} is VALID [2018-11-18 23:02:39,296 INFO L273 TraceCheckUtils]: 174: Hoare triple {15464#false} assume !!(~i~1 < ~SIZE~0 - 1);call #t~mem10 := read~int(~#set~0.base, ~#set~0.offset + 4 * (1 + ~i~1), 4);call write~int(#t~mem10, ~#set~0.base, ~#set~0.offset + 4 * ~i~1, 4);havoc #t~mem10; {15464#false} is VALID [2018-11-18 23:02:39,296 INFO L273 TraceCheckUtils]: 175: Hoare triple {15464#false} #t~post9 := ~i~1;~i~1 := 1 + #t~post9;havoc #t~post9; {15464#false} is VALID [2018-11-18 23:02:39,297 INFO L273 TraceCheckUtils]: 176: Hoare triple {15464#false} assume true; {15464#false} is VALID [2018-11-18 23:02:39,297 INFO L273 TraceCheckUtils]: 177: Hoare triple {15464#false} assume !(~i~1 < ~SIZE~0 - 1); {15464#false} is VALID [2018-11-18 23:02:39,297 INFO L273 TraceCheckUtils]: 178: Hoare triple {15464#false} assume 1 == ~found~0;~i~1 := 0; {15464#false} is VALID [2018-11-18 23:02:39,297 INFO L273 TraceCheckUtils]: 179: Hoare triple {15464#false} assume true; {15464#false} is VALID [2018-11-18 23:02:39,297 INFO L273 TraceCheckUtils]: 180: Hoare triple {15464#false} assume !!(~i~1 < ~SIZE~0 - 1);call #t~mem12 := read~int(~#set~0.base, ~#set~0.offset + 4 * ~i~1, 4); {15464#false} is VALID [2018-11-18 23:02:39,297 INFO L256 TraceCheckUtils]: 181: Hoare triple {15464#false} call __VERIFIER_assert((if #t~mem12 != ~element~0 then 1 else 0)); {15464#false} is VALID [2018-11-18 23:02:39,297 INFO L273 TraceCheckUtils]: 182: Hoare triple {15464#false} ~cond := #in~cond; {15464#false} is VALID [2018-11-18 23:02:39,297 INFO L273 TraceCheckUtils]: 183: Hoare triple {15464#false} assume 0 == ~cond; {15464#false} is VALID [2018-11-18 23:02:39,297 INFO L273 TraceCheckUtils]: 184: Hoare triple {15464#false} assume !false; {15464#false} is VALID [2018-11-18 23:02:39,319 INFO L134 CoverageAnalysis]: Checked inductivity of 825 backedges. 0 proven. 420 refuted. 0 times theorem prover too weak. 405 trivial. 0 not checked. [2018-11-18 23:02:39,319 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 23:02:39,319 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-18 23:02:39,328 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-11-18 23:02:39,445 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 13 check-sat command(s) [2018-11-18 23:02:39,446 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-18 23:02:39,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 23:02:39,483 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 23:02:39,780 INFO L256 TraceCheckUtils]: 0: Hoare triple {15463#true} call ULTIMATE.init(); {15463#true} is VALID [2018-11-18 23:02:39,780 INFO L273 TraceCheckUtils]: 1: Hoare triple {15463#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~SIZE~0 := 100000; {15465#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:02:39,781 INFO L273 TraceCheckUtils]: 2: Hoare triple {15465#(<= 100000 ~SIZE~0)} assume true; {15465#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:02:39,781 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {15465#(<= 100000 ~SIZE~0)} {15463#true} #128#return; {15465#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:02:39,782 INFO L256 TraceCheckUtils]: 4: Hoare triple {15465#(<= 100000 ~SIZE~0)} call #t~ret13 := main(); {15465#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:02:39,783 INFO L273 TraceCheckUtils]: 5: Hoare triple {15465#(<= 100000 ~SIZE~0)} havoc ~i~1;havoc ~pos~0;~n~0 := 0;~found~0 := 0;call ~#set~0.base, ~#set~0.offset := #Ultimate.alloc(4 * ~SIZE~0);call ~#values~0.base, ~#values~0.offset := #Ultimate.alloc(4 * ~SIZE~0);havoc ~element~0;havoc ~v~0;~v~0 := 0; {15465#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:02:39,783 INFO L273 TraceCheckUtils]: 6: Hoare triple {15465#(<= 100000 ~SIZE~0)} assume true; {15465#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:02:39,784 INFO L273 TraceCheckUtils]: 7: Hoare triple {15465#(<= 100000 ~SIZE~0)} assume !!(~v~0 < ~SIZE~0);call #t~mem3 := read~int(~#values~0.base, ~#values~0.offset + 4 * ~v~0, 4); {15465#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:02:39,785 INFO L256 TraceCheckUtils]: 8: Hoare triple {15465#(<= 100000 ~SIZE~0)} call #t~ret4 := elem_exists(~#set~0.base, ~#set~0.offset, ~n~0, #t~mem3); {15465#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:02:39,785 INFO L273 TraceCheckUtils]: 9: Hoare triple {15465#(<= 100000 ~SIZE~0)} ~set.base, ~set.offset := #in~set.base, #in~set.offset;~size := #in~size;~value := #in~value;havoc ~i~0;~i~0 := 0; {15465#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:02:39,786 INFO L273 TraceCheckUtils]: 10: Hoare triple {15465#(<= 100000 ~SIZE~0)} assume true; {15465#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:02:39,786 INFO L273 TraceCheckUtils]: 11: Hoare triple {15465#(<= 100000 ~SIZE~0)} assume !(~i~0 < ~size); {15465#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:02:39,787 INFO L273 TraceCheckUtils]: 12: Hoare triple {15465#(<= 100000 ~SIZE~0)} #res := 0; {15465#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:02:39,787 INFO L273 TraceCheckUtils]: 13: Hoare triple {15465#(<= 100000 ~SIZE~0)} assume true; {15465#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:02:39,789 INFO L268 TraceCheckUtils]: 14: Hoare quadruple {15465#(<= 100000 ~SIZE~0)} {15465#(<= 100000 ~SIZE~0)} #132#return; {15465#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:02:39,789 INFO L273 TraceCheckUtils]: 15: Hoare triple {15465#(<= 100000 ~SIZE~0)} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {15465#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:02:39,790 INFO L273 TraceCheckUtils]: 16: Hoare triple {15465#(<= 100000 ~SIZE~0)} assume 1 != #t~ret4;havoc #t~mem3;havoc #t~ret4;call #t~mem5 := read~int(~#values~0.base, ~#values~0.offset + 4 * ~v~0, 4); {15465#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:02:39,791 INFO L256 TraceCheckUtils]: 17: Hoare triple {15465#(<= 100000 ~SIZE~0)} call #t~ret6 := insert(~#set~0.base, ~#set~0.offset, ~n~0, #t~mem5); {15465#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:02:39,791 INFO L273 TraceCheckUtils]: 18: Hoare triple {15465#(<= 100000 ~SIZE~0)} ~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; {15465#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:02:39,792 INFO L273 TraceCheckUtils]: 19: Hoare triple {15465#(<= 100000 ~SIZE~0)} assume true; {15465#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:02:39,793 INFO L268 TraceCheckUtils]: 20: Hoare quadruple {15465#(<= 100000 ~SIZE~0)} {15465#(<= 100000 ~SIZE~0)} #134#return; {15465#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:02:39,793 INFO L273 TraceCheckUtils]: 21: Hoare triple {15465#(<= 100000 ~SIZE~0)} assume -2147483648 <= #t~ret6 && #t~ret6 <= 2147483647;~n~0 := #t~ret6;havoc #t~ret6;havoc #t~mem5; {15465#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:02:39,794 INFO L273 TraceCheckUtils]: 22: Hoare triple {15465#(<= 100000 ~SIZE~0)} #t~post2 := ~v~0;~v~0 := 1 + #t~post2;havoc #t~post2; {15465#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:02:39,795 INFO L273 TraceCheckUtils]: 23: Hoare triple {15465#(<= 100000 ~SIZE~0)} assume true; {15465#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:02:39,795 INFO L273 TraceCheckUtils]: 24: Hoare triple {15465#(<= 100000 ~SIZE~0)} assume !!(~v~0 < ~SIZE~0);call #t~mem3 := read~int(~#values~0.base, ~#values~0.offset + 4 * ~v~0, 4); {15465#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:02:39,796 INFO L256 TraceCheckUtils]: 25: Hoare triple {15465#(<= 100000 ~SIZE~0)} call #t~ret4 := elem_exists(~#set~0.base, ~#set~0.offset, ~n~0, #t~mem3); {15465#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:02:39,797 INFO L273 TraceCheckUtils]: 26: Hoare triple {15465#(<= 100000 ~SIZE~0)} ~set.base, ~set.offset := #in~set.base, #in~set.offset;~size := #in~size;~value := #in~value;havoc ~i~0;~i~0 := 0; {15465#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:02:39,797 INFO L273 TraceCheckUtils]: 27: Hoare triple {15465#(<= 100000 ~SIZE~0)} assume true; {15465#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:02:39,798 INFO L273 TraceCheckUtils]: 28: Hoare triple {15465#(<= 100000 ~SIZE~0)} assume !!(~i~0 < ~size);call #t~mem1 := read~int(~set.base, ~set.offset + 4 * ~i~0, 4); {15465#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:02:39,798 INFO L273 TraceCheckUtils]: 29: Hoare triple {15465#(<= 100000 ~SIZE~0)} assume #t~mem1 == ~value;havoc #t~mem1;#res := 1; {15465#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:02:39,799 INFO L273 TraceCheckUtils]: 30: Hoare triple {15465#(<= 100000 ~SIZE~0)} assume true; {15465#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:02:39,800 INFO L268 TraceCheckUtils]: 31: Hoare quadruple {15465#(<= 100000 ~SIZE~0)} {15465#(<= 100000 ~SIZE~0)} #132#return; {15465#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:02:39,801 INFO L273 TraceCheckUtils]: 32: Hoare triple {15465#(<= 100000 ~SIZE~0)} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {15465#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:02:39,801 INFO L273 TraceCheckUtils]: 33: Hoare triple {15465#(<= 100000 ~SIZE~0)} assume !(1 != #t~ret4);havoc #t~mem3;havoc #t~ret4; {15465#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:02:39,802 INFO L273 TraceCheckUtils]: 34: Hoare triple {15465#(<= 100000 ~SIZE~0)} #t~post2 := ~v~0;~v~0 := 1 + #t~post2;havoc #t~post2; {15465#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:02:39,802 INFO L273 TraceCheckUtils]: 35: Hoare triple {15465#(<= 100000 ~SIZE~0)} assume true; {15465#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:02:39,803 INFO L273 TraceCheckUtils]: 36: Hoare triple {15465#(<= 100000 ~SIZE~0)} assume !!(~v~0 < ~SIZE~0);call #t~mem3 := read~int(~#values~0.base, ~#values~0.offset + 4 * ~v~0, 4); {15465#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:02:39,804 INFO L256 TraceCheckUtils]: 37: Hoare triple {15465#(<= 100000 ~SIZE~0)} call #t~ret4 := elem_exists(~#set~0.base, ~#set~0.offset, ~n~0, #t~mem3); {15465#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:02:39,804 INFO L273 TraceCheckUtils]: 38: Hoare triple {15465#(<= 100000 ~SIZE~0)} ~set.base, ~set.offset := #in~set.base, #in~set.offset;~size := #in~size;~value := #in~value;havoc ~i~0;~i~0 := 0; {15465#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:02:39,805 INFO L273 TraceCheckUtils]: 39: Hoare triple {15465#(<= 100000 ~SIZE~0)} assume true; {15465#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:02:39,805 INFO L273 TraceCheckUtils]: 40: Hoare triple {15465#(<= 100000 ~SIZE~0)} assume !!(~i~0 < ~size);call #t~mem1 := read~int(~set.base, ~set.offset + 4 * ~i~0, 4); {15465#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:02:39,806 INFO L273 TraceCheckUtils]: 41: Hoare triple {15465#(<= 100000 ~SIZE~0)} assume #t~mem1 == ~value;havoc #t~mem1;#res := 1; {15465#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:02:39,806 INFO L273 TraceCheckUtils]: 42: Hoare triple {15465#(<= 100000 ~SIZE~0)} assume true; {15465#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:02:39,808 INFO L268 TraceCheckUtils]: 43: Hoare quadruple {15465#(<= 100000 ~SIZE~0)} {15465#(<= 100000 ~SIZE~0)} #132#return; {15465#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:02:39,808 INFO L273 TraceCheckUtils]: 44: Hoare triple {15465#(<= 100000 ~SIZE~0)} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {15465#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:02:39,809 INFO L273 TraceCheckUtils]: 45: Hoare triple {15465#(<= 100000 ~SIZE~0)} assume !(1 != #t~ret4);havoc #t~mem3;havoc #t~ret4; {15465#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:02:39,809 INFO L273 TraceCheckUtils]: 46: Hoare triple {15465#(<= 100000 ~SIZE~0)} #t~post2 := ~v~0;~v~0 := 1 + #t~post2;havoc #t~post2; {15465#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:02:39,810 INFO L273 TraceCheckUtils]: 47: Hoare triple {15465#(<= 100000 ~SIZE~0)} assume true; {15465#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:02:39,810 INFO L273 TraceCheckUtils]: 48: Hoare triple {15465#(<= 100000 ~SIZE~0)} assume !!(~v~0 < ~SIZE~0);call #t~mem3 := read~int(~#values~0.base, ~#values~0.offset + 4 * ~v~0, 4); {15465#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:02:39,811 INFO L256 TraceCheckUtils]: 49: Hoare triple {15465#(<= 100000 ~SIZE~0)} call #t~ret4 := elem_exists(~#set~0.base, ~#set~0.offset, ~n~0, #t~mem3); {15465#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:02:39,812 INFO L273 TraceCheckUtils]: 50: Hoare triple {15465#(<= 100000 ~SIZE~0)} ~set.base, ~set.offset := #in~set.base, #in~set.offset;~size := #in~size;~value := #in~value;havoc ~i~0;~i~0 := 0; {15465#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:02:39,812 INFO L273 TraceCheckUtils]: 51: Hoare triple {15465#(<= 100000 ~SIZE~0)} assume true; {15465#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:02:39,813 INFO L273 TraceCheckUtils]: 52: Hoare triple {15465#(<= 100000 ~SIZE~0)} assume !!(~i~0 < ~size);call #t~mem1 := read~int(~set.base, ~set.offset + 4 * ~i~0, 4); {15465#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:02:39,813 INFO L273 TraceCheckUtils]: 53: Hoare triple {15465#(<= 100000 ~SIZE~0)} assume #t~mem1 == ~value;havoc #t~mem1;#res := 1; {15465#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:02:39,814 INFO L273 TraceCheckUtils]: 54: Hoare triple {15465#(<= 100000 ~SIZE~0)} assume true; {15465#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:02:39,815 INFO L268 TraceCheckUtils]: 55: Hoare quadruple {15465#(<= 100000 ~SIZE~0)} {15465#(<= 100000 ~SIZE~0)} #132#return; {15465#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:02:39,816 INFO L273 TraceCheckUtils]: 56: Hoare triple {15465#(<= 100000 ~SIZE~0)} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {15465#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:02:39,816 INFO L273 TraceCheckUtils]: 57: Hoare triple {15465#(<= 100000 ~SIZE~0)} assume !(1 != #t~ret4);havoc #t~mem3;havoc #t~ret4; {15465#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:02:39,834 INFO L273 TraceCheckUtils]: 58: Hoare triple {15465#(<= 100000 ~SIZE~0)} #t~post2 := ~v~0;~v~0 := 1 + #t~post2;havoc #t~post2; {15465#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:02:39,848 INFO L273 TraceCheckUtils]: 59: Hoare triple {15465#(<= 100000 ~SIZE~0)} assume true; {15465#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:02:39,862 INFO L273 TraceCheckUtils]: 60: Hoare triple {15465#(<= 100000 ~SIZE~0)} assume !!(~v~0 < ~SIZE~0);call #t~mem3 := read~int(~#values~0.base, ~#values~0.offset + 4 * ~v~0, 4); {15465#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:02:39,864 INFO L256 TraceCheckUtils]: 61: Hoare triple {15465#(<= 100000 ~SIZE~0)} call #t~ret4 := elem_exists(~#set~0.base, ~#set~0.offset, ~n~0, #t~mem3); {15465#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:02:39,864 INFO L273 TraceCheckUtils]: 62: Hoare triple {15465#(<= 100000 ~SIZE~0)} ~set.base, ~set.offset := #in~set.base, #in~set.offset;~size := #in~size;~value := #in~value;havoc ~i~0;~i~0 := 0; {15465#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:02:39,864 INFO L273 TraceCheckUtils]: 63: Hoare triple {15465#(<= 100000 ~SIZE~0)} assume true; {15465#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:02:39,866 INFO L273 TraceCheckUtils]: 64: Hoare triple {15465#(<= 100000 ~SIZE~0)} assume !!(~i~0 < ~size);call #t~mem1 := read~int(~set.base, ~set.offset + 4 * ~i~0, 4); {15465#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:02:39,866 INFO L273 TraceCheckUtils]: 65: Hoare triple {15465#(<= 100000 ~SIZE~0)} assume #t~mem1 == ~value;havoc #t~mem1;#res := 1; {15465#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:02:39,866 INFO L273 TraceCheckUtils]: 66: Hoare triple {15465#(<= 100000 ~SIZE~0)} assume true; {15465#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:02:39,867 INFO L268 TraceCheckUtils]: 67: Hoare quadruple {15465#(<= 100000 ~SIZE~0)} {15465#(<= 100000 ~SIZE~0)} #132#return; {15465#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:02:39,867 INFO L273 TraceCheckUtils]: 68: Hoare triple {15465#(<= 100000 ~SIZE~0)} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {15465#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:02:39,868 INFO L273 TraceCheckUtils]: 69: Hoare triple {15465#(<= 100000 ~SIZE~0)} assume !(1 != #t~ret4);havoc #t~mem3;havoc #t~ret4; {15465#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:02:39,868 INFO L273 TraceCheckUtils]: 70: Hoare triple {15465#(<= 100000 ~SIZE~0)} #t~post2 := ~v~0;~v~0 := 1 + #t~post2;havoc #t~post2; {15465#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:02:39,868 INFO L273 TraceCheckUtils]: 71: Hoare triple {15465#(<= 100000 ~SIZE~0)} assume true; {15465#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:02:39,869 INFO L273 TraceCheckUtils]: 72: Hoare triple {15465#(<= 100000 ~SIZE~0)} assume !!(~v~0 < ~SIZE~0);call #t~mem3 := read~int(~#values~0.base, ~#values~0.offset + 4 * ~v~0, 4); {15465#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:02:39,869 INFO L256 TraceCheckUtils]: 73: Hoare triple {15465#(<= 100000 ~SIZE~0)} call #t~ret4 := elem_exists(~#set~0.base, ~#set~0.offset, ~n~0, #t~mem3); {15465#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:02:39,870 INFO L273 TraceCheckUtils]: 74: Hoare triple {15465#(<= 100000 ~SIZE~0)} ~set.base, ~set.offset := #in~set.base, #in~set.offset;~size := #in~size;~value := #in~value;havoc ~i~0;~i~0 := 0; {15465#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:02:39,870 INFO L273 TraceCheckUtils]: 75: Hoare triple {15465#(<= 100000 ~SIZE~0)} assume true; {15465#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:02:39,870 INFO L273 TraceCheckUtils]: 76: Hoare triple {15465#(<= 100000 ~SIZE~0)} assume !!(~i~0 < ~size);call #t~mem1 := read~int(~set.base, ~set.offset + 4 * ~i~0, 4); {15465#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:02:39,871 INFO L273 TraceCheckUtils]: 77: Hoare triple {15465#(<= 100000 ~SIZE~0)} assume #t~mem1 == ~value;havoc #t~mem1;#res := 1; {15465#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:02:39,871 INFO L273 TraceCheckUtils]: 78: Hoare triple {15465#(<= 100000 ~SIZE~0)} assume true; {15465#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:02:39,872 INFO L268 TraceCheckUtils]: 79: Hoare quadruple {15465#(<= 100000 ~SIZE~0)} {15465#(<= 100000 ~SIZE~0)} #132#return; {15465#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:02:39,872 INFO L273 TraceCheckUtils]: 80: Hoare triple {15465#(<= 100000 ~SIZE~0)} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {15465#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:02:39,873 INFO L273 TraceCheckUtils]: 81: Hoare triple {15465#(<= 100000 ~SIZE~0)} assume !(1 != #t~ret4);havoc #t~mem3;havoc #t~ret4; {15465#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:02:39,873 INFO L273 TraceCheckUtils]: 82: Hoare triple {15465#(<= 100000 ~SIZE~0)} #t~post2 := ~v~0;~v~0 := 1 + #t~post2;havoc #t~post2; {15465#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:02:39,874 INFO L273 TraceCheckUtils]: 83: Hoare triple {15465#(<= 100000 ~SIZE~0)} assume true; {15465#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:02:39,874 INFO L273 TraceCheckUtils]: 84: Hoare triple {15465#(<= 100000 ~SIZE~0)} assume !!(~v~0 < ~SIZE~0);call #t~mem3 := read~int(~#values~0.base, ~#values~0.offset + 4 * ~v~0, 4); {15465#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:02:39,876 INFO L256 TraceCheckUtils]: 85: Hoare triple {15465#(<= 100000 ~SIZE~0)} call #t~ret4 := elem_exists(~#set~0.base, ~#set~0.offset, ~n~0, #t~mem3); {15465#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:02:39,876 INFO L273 TraceCheckUtils]: 86: Hoare triple {15465#(<= 100000 ~SIZE~0)} ~set.base, ~set.offset := #in~set.base, #in~set.offset;~size := #in~size;~value := #in~value;havoc ~i~0;~i~0 := 0; {15465#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:02:39,877 INFO L273 TraceCheckUtils]: 87: Hoare triple {15465#(<= 100000 ~SIZE~0)} assume true; {15465#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:02:39,877 INFO L273 TraceCheckUtils]: 88: Hoare triple {15465#(<= 100000 ~SIZE~0)} assume !!(~i~0 < ~size);call #t~mem1 := read~int(~set.base, ~set.offset + 4 * ~i~0, 4); {15465#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:02:39,878 INFO L273 TraceCheckUtils]: 89: Hoare triple {15465#(<= 100000 ~SIZE~0)} assume #t~mem1 == ~value;havoc #t~mem1;#res := 1; {15465#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:02:39,878 INFO L273 TraceCheckUtils]: 90: Hoare triple {15465#(<= 100000 ~SIZE~0)} assume true; {15465#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:02:39,879 INFO L268 TraceCheckUtils]: 91: Hoare quadruple {15465#(<= 100000 ~SIZE~0)} {15465#(<= 100000 ~SIZE~0)} #132#return; {15465#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:02:39,880 INFO L273 TraceCheckUtils]: 92: Hoare triple {15465#(<= 100000 ~SIZE~0)} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {15465#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:02:39,880 INFO L273 TraceCheckUtils]: 93: Hoare triple {15465#(<= 100000 ~SIZE~0)} assume !(1 != #t~ret4);havoc #t~mem3;havoc #t~ret4; {15465#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:02:39,881 INFO L273 TraceCheckUtils]: 94: Hoare triple {15465#(<= 100000 ~SIZE~0)} #t~post2 := ~v~0;~v~0 := 1 + #t~post2;havoc #t~post2; {15465#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:02:39,881 INFO L273 TraceCheckUtils]: 95: Hoare triple {15465#(<= 100000 ~SIZE~0)} assume true; {15465#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:02:39,882 INFO L273 TraceCheckUtils]: 96: Hoare triple {15465#(<= 100000 ~SIZE~0)} assume !!(~v~0 < ~SIZE~0);call #t~mem3 := read~int(~#values~0.base, ~#values~0.offset + 4 * ~v~0, 4); {15465#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:02:39,883 INFO L256 TraceCheckUtils]: 97: Hoare triple {15465#(<= 100000 ~SIZE~0)} call #t~ret4 := elem_exists(~#set~0.base, ~#set~0.offset, ~n~0, #t~mem3); {15465#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:02:39,884 INFO L273 TraceCheckUtils]: 98: Hoare triple {15465#(<= 100000 ~SIZE~0)} ~set.base, ~set.offset := #in~set.base, #in~set.offset;~size := #in~size;~value := #in~value;havoc ~i~0;~i~0 := 0; {15465#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:02:39,884 INFO L273 TraceCheckUtils]: 99: Hoare triple {15465#(<= 100000 ~SIZE~0)} assume true; {15465#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:02:39,885 INFO L273 TraceCheckUtils]: 100: Hoare triple {15465#(<= 100000 ~SIZE~0)} assume !!(~i~0 < ~size);call #t~mem1 := read~int(~set.base, ~set.offset + 4 * ~i~0, 4); {15465#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:02:39,885 INFO L273 TraceCheckUtils]: 101: Hoare triple {15465#(<= 100000 ~SIZE~0)} assume #t~mem1 == ~value;havoc #t~mem1;#res := 1; {15465#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:02:39,886 INFO L273 TraceCheckUtils]: 102: Hoare triple {15465#(<= 100000 ~SIZE~0)} assume true; {15465#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:02:39,887 INFO L268 TraceCheckUtils]: 103: Hoare quadruple {15465#(<= 100000 ~SIZE~0)} {15465#(<= 100000 ~SIZE~0)} #132#return; {15465#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:02:39,887 INFO L273 TraceCheckUtils]: 104: Hoare triple {15465#(<= 100000 ~SIZE~0)} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {15465#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:02:39,888 INFO L273 TraceCheckUtils]: 105: Hoare triple {15465#(<= 100000 ~SIZE~0)} assume !(1 != #t~ret4);havoc #t~mem3;havoc #t~ret4; {15465#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:02:39,889 INFO L273 TraceCheckUtils]: 106: Hoare triple {15465#(<= 100000 ~SIZE~0)} #t~post2 := ~v~0;~v~0 := 1 + #t~post2;havoc #t~post2; {15465#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:02:39,889 INFO L273 TraceCheckUtils]: 107: Hoare triple {15465#(<= 100000 ~SIZE~0)} assume true; {15465#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:02:39,890 INFO L273 TraceCheckUtils]: 108: Hoare triple {15465#(<= 100000 ~SIZE~0)} assume !!(~v~0 < ~SIZE~0);call #t~mem3 := read~int(~#values~0.base, ~#values~0.offset + 4 * ~v~0, 4); {15465#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:02:39,891 INFO L256 TraceCheckUtils]: 109: Hoare triple {15465#(<= 100000 ~SIZE~0)} call #t~ret4 := elem_exists(~#set~0.base, ~#set~0.offset, ~n~0, #t~mem3); {15465#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:02:39,891 INFO L273 TraceCheckUtils]: 110: Hoare triple {15465#(<= 100000 ~SIZE~0)} ~set.base, ~set.offset := #in~set.base, #in~set.offset;~size := #in~size;~value := #in~value;havoc ~i~0;~i~0 := 0; {15465#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:02:39,892 INFO L273 TraceCheckUtils]: 111: Hoare triple {15465#(<= 100000 ~SIZE~0)} assume true; {15465#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:02:39,892 INFO L273 TraceCheckUtils]: 112: Hoare triple {15465#(<= 100000 ~SIZE~0)} assume !!(~i~0 < ~size);call #t~mem1 := read~int(~set.base, ~set.offset + 4 * ~i~0, 4); {15465#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:02:39,893 INFO L273 TraceCheckUtils]: 113: Hoare triple {15465#(<= 100000 ~SIZE~0)} assume #t~mem1 == ~value;havoc #t~mem1;#res := 1; {15465#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:02:39,893 INFO L273 TraceCheckUtils]: 114: Hoare triple {15465#(<= 100000 ~SIZE~0)} assume true; {15465#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:02:39,895 INFO L268 TraceCheckUtils]: 115: Hoare quadruple {15465#(<= 100000 ~SIZE~0)} {15465#(<= 100000 ~SIZE~0)} #132#return; {15465#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:02:39,895 INFO L273 TraceCheckUtils]: 116: Hoare triple {15465#(<= 100000 ~SIZE~0)} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {15465#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:02:39,896 INFO L273 TraceCheckUtils]: 117: Hoare triple {15465#(<= 100000 ~SIZE~0)} assume !(1 != #t~ret4);havoc #t~mem3;havoc #t~ret4; {15465#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:02:39,896 INFO L273 TraceCheckUtils]: 118: Hoare triple {15465#(<= 100000 ~SIZE~0)} #t~post2 := ~v~0;~v~0 := 1 + #t~post2;havoc #t~post2; {15465#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:02:39,897 INFO L273 TraceCheckUtils]: 119: Hoare triple {15465#(<= 100000 ~SIZE~0)} assume true; {15465#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:02:39,897 INFO L273 TraceCheckUtils]: 120: Hoare triple {15465#(<= 100000 ~SIZE~0)} assume !!(~v~0 < ~SIZE~0);call #t~mem3 := read~int(~#values~0.base, ~#values~0.offset + 4 * ~v~0, 4); {15465#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:02:39,898 INFO L256 TraceCheckUtils]: 121: Hoare triple {15465#(<= 100000 ~SIZE~0)} call #t~ret4 := elem_exists(~#set~0.base, ~#set~0.offset, ~n~0, #t~mem3); {15465#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:02:39,899 INFO L273 TraceCheckUtils]: 122: Hoare triple {15465#(<= 100000 ~SIZE~0)} ~set.base, ~set.offset := #in~set.base, #in~set.offset;~size := #in~size;~value := #in~value;havoc ~i~0;~i~0 := 0; {15465#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:02:39,899 INFO L273 TraceCheckUtils]: 123: Hoare triple {15465#(<= 100000 ~SIZE~0)} assume true; {15465#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:02:39,900 INFO L273 TraceCheckUtils]: 124: Hoare triple {15465#(<= 100000 ~SIZE~0)} assume !!(~i~0 < ~size);call #t~mem1 := read~int(~set.base, ~set.offset + 4 * ~i~0, 4); {15465#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:02:39,900 INFO L273 TraceCheckUtils]: 125: Hoare triple {15465#(<= 100000 ~SIZE~0)} assume #t~mem1 == ~value;havoc #t~mem1;#res := 1; {15465#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:02:39,901 INFO L273 TraceCheckUtils]: 126: Hoare triple {15465#(<= 100000 ~SIZE~0)} assume true; {15465#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:02:39,902 INFO L268 TraceCheckUtils]: 127: Hoare quadruple {15465#(<= 100000 ~SIZE~0)} {15465#(<= 100000 ~SIZE~0)} #132#return; {15465#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:02:39,903 INFO L273 TraceCheckUtils]: 128: Hoare triple {15465#(<= 100000 ~SIZE~0)} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {15465#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:02:39,903 INFO L273 TraceCheckUtils]: 129: Hoare triple {15465#(<= 100000 ~SIZE~0)} assume !(1 != #t~ret4);havoc #t~mem3;havoc #t~ret4; {15465#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:02:39,904 INFO L273 TraceCheckUtils]: 130: Hoare triple {15465#(<= 100000 ~SIZE~0)} #t~post2 := ~v~0;~v~0 := 1 + #t~post2;havoc #t~post2; {15465#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:02:39,904 INFO L273 TraceCheckUtils]: 131: Hoare triple {15465#(<= 100000 ~SIZE~0)} assume true; {15465#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:02:39,905 INFO L273 TraceCheckUtils]: 132: Hoare triple {15465#(<= 100000 ~SIZE~0)} assume !!(~v~0 < ~SIZE~0);call #t~mem3 := read~int(~#values~0.base, ~#values~0.offset + 4 * ~v~0, 4); {15465#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:02:39,906 INFO L256 TraceCheckUtils]: 133: Hoare triple {15465#(<= 100000 ~SIZE~0)} call #t~ret4 := elem_exists(~#set~0.base, ~#set~0.offset, ~n~0, #t~mem3); {15465#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:02:39,906 INFO L273 TraceCheckUtils]: 134: Hoare triple {15465#(<= 100000 ~SIZE~0)} ~set.base, ~set.offset := #in~set.base, #in~set.offset;~size := #in~size;~value := #in~value;havoc ~i~0;~i~0 := 0; {15465#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:02:39,907 INFO L273 TraceCheckUtils]: 135: Hoare triple {15465#(<= 100000 ~SIZE~0)} assume true; {15465#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:02:39,907 INFO L273 TraceCheckUtils]: 136: Hoare triple {15465#(<= 100000 ~SIZE~0)} assume !!(~i~0 < ~size);call #t~mem1 := read~int(~set.base, ~set.offset + 4 * ~i~0, 4); {15465#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:02:39,908 INFO L273 TraceCheckUtils]: 137: Hoare triple {15465#(<= 100000 ~SIZE~0)} assume #t~mem1 == ~value;havoc #t~mem1;#res := 1; {15465#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:02:39,908 INFO L273 TraceCheckUtils]: 138: Hoare triple {15465#(<= 100000 ~SIZE~0)} assume true; {15465#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:02:39,910 INFO L268 TraceCheckUtils]: 139: Hoare quadruple {15465#(<= 100000 ~SIZE~0)} {15465#(<= 100000 ~SIZE~0)} #132#return; {15465#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:02:39,910 INFO L273 TraceCheckUtils]: 140: Hoare triple {15465#(<= 100000 ~SIZE~0)} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {15465#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:02:39,911 INFO L273 TraceCheckUtils]: 141: Hoare triple {15465#(<= 100000 ~SIZE~0)} assume !(1 != #t~ret4);havoc #t~mem3;havoc #t~ret4; {15465#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:02:39,911 INFO L273 TraceCheckUtils]: 142: Hoare triple {15465#(<= 100000 ~SIZE~0)} #t~post2 := ~v~0;~v~0 := 1 + #t~post2;havoc #t~post2; {15465#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:02:39,912 INFO L273 TraceCheckUtils]: 143: Hoare triple {15465#(<= 100000 ~SIZE~0)} assume true; {15465#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:02:39,912 INFO L273 TraceCheckUtils]: 144: Hoare triple {15465#(<= 100000 ~SIZE~0)} assume !!(~v~0 < ~SIZE~0);call #t~mem3 := read~int(~#values~0.base, ~#values~0.offset + 4 * ~v~0, 4); {15465#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:02:39,913 INFO L256 TraceCheckUtils]: 145: Hoare triple {15465#(<= 100000 ~SIZE~0)} call #t~ret4 := elem_exists(~#set~0.base, ~#set~0.offset, ~n~0, #t~mem3); {15465#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:02:39,914 INFO L273 TraceCheckUtils]: 146: Hoare triple {15465#(<= 100000 ~SIZE~0)} ~set.base, ~set.offset := #in~set.base, #in~set.offset;~size := #in~size;~value := #in~value;havoc ~i~0;~i~0 := 0; {15465#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:02:39,914 INFO L273 TraceCheckUtils]: 147: Hoare triple {15465#(<= 100000 ~SIZE~0)} assume true; {15465#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:02:39,915 INFO L273 TraceCheckUtils]: 148: Hoare triple {15465#(<= 100000 ~SIZE~0)} assume !!(~i~0 < ~size);call #t~mem1 := read~int(~set.base, ~set.offset + 4 * ~i~0, 4); {15465#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:02:39,915 INFO L273 TraceCheckUtils]: 149: Hoare triple {15465#(<= 100000 ~SIZE~0)} assume #t~mem1 == ~value;havoc #t~mem1;#res := 1; {15465#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:02:39,916 INFO L273 TraceCheckUtils]: 150: Hoare triple {15465#(<= 100000 ~SIZE~0)} assume true; {15465#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:02:39,917 INFO L268 TraceCheckUtils]: 151: Hoare quadruple {15465#(<= 100000 ~SIZE~0)} {15465#(<= 100000 ~SIZE~0)} #132#return; {15465#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:02:39,918 INFO L273 TraceCheckUtils]: 152: Hoare triple {15465#(<= 100000 ~SIZE~0)} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {15465#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:02:39,918 INFO L273 TraceCheckUtils]: 153: Hoare triple {15465#(<= 100000 ~SIZE~0)} assume !(1 != #t~ret4);havoc #t~mem3;havoc #t~ret4; {15465#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:02:39,919 INFO L273 TraceCheckUtils]: 154: Hoare triple {15465#(<= 100000 ~SIZE~0)} #t~post2 := ~v~0;~v~0 := 1 + #t~post2;havoc #t~post2; {15465#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:02:39,919 INFO L273 TraceCheckUtils]: 155: Hoare triple {15465#(<= 100000 ~SIZE~0)} assume true; {15465#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:02:39,920 INFO L273 TraceCheckUtils]: 156: Hoare triple {15465#(<= 100000 ~SIZE~0)} assume !(~v~0 < ~SIZE~0); {15465#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:02:39,920 INFO L273 TraceCheckUtils]: 157: Hoare triple {15465#(<= 100000 ~SIZE~0)} ~i~1 := 0; {15953#(and (<= main_~i~1 0) (<= 100000 ~SIZE~0))} is VALID [2018-11-18 23:02:39,921 INFO L273 TraceCheckUtils]: 158: Hoare triple {15953#(and (<= main_~i~1 0) (<= 100000 ~SIZE~0))} assume true; {15953#(and (<= main_~i~1 0) (<= 100000 ~SIZE~0))} is VALID [2018-11-18 23:02:39,922 INFO L273 TraceCheckUtils]: 159: Hoare triple {15953#(and (<= main_~i~1 0) (<= 100000 ~SIZE~0))} assume !!(~i~1 < ~SIZE~0 && 1 != ~found~0);call #t~mem8 := read~int(~#set~0.base, ~#set~0.offset + 4 * ~i~1, 4); {15953#(and (<= main_~i~1 0) (<= 100000 ~SIZE~0))} is VALID [2018-11-18 23:02:39,923 INFO L273 TraceCheckUtils]: 160: Hoare triple {15953#(and (<= main_~i~1 0) (<= 100000 ~SIZE~0))} assume !(#t~mem8 == ~element~0);havoc #t~mem8; {15953#(and (<= main_~i~1 0) (<= 100000 ~SIZE~0))} is VALID [2018-11-18 23:02:39,923 INFO L273 TraceCheckUtils]: 161: Hoare triple {15953#(and (<= main_~i~1 0) (<= 100000 ~SIZE~0))} #t~post7 := ~i~1;~i~1 := 1 + #t~post7;havoc #t~post7; {15966#(and (<= main_~i~1 1) (<= 100000 ~SIZE~0))} is VALID [2018-11-18 23:02:39,924 INFO L273 TraceCheckUtils]: 162: Hoare triple {15966#(and (<= main_~i~1 1) (<= 100000 ~SIZE~0))} assume true; {15966#(and (<= main_~i~1 1) (<= 100000 ~SIZE~0))} is VALID [2018-11-18 23:02:39,925 INFO L273 TraceCheckUtils]: 163: Hoare triple {15966#(and (<= main_~i~1 1) (<= 100000 ~SIZE~0))} assume !!(~i~1 < ~SIZE~0 && 1 != ~found~0);call #t~mem8 := read~int(~#set~0.base, ~#set~0.offset + 4 * ~i~1, 4); {15966#(and (<= main_~i~1 1) (<= 100000 ~SIZE~0))} is VALID [2018-11-18 23:02:39,925 INFO L273 TraceCheckUtils]: 164: Hoare triple {15966#(and (<= main_~i~1 1) (<= 100000 ~SIZE~0))} assume !(#t~mem8 == ~element~0);havoc #t~mem8; {15966#(and (<= main_~i~1 1) (<= 100000 ~SIZE~0))} is VALID [2018-11-18 23:02:39,926 INFO L273 TraceCheckUtils]: 165: Hoare triple {15966#(and (<= main_~i~1 1) (<= 100000 ~SIZE~0))} #t~post7 := ~i~1;~i~1 := 1 + #t~post7;havoc #t~post7; {15979#(and (<= main_~i~1 2) (<= 100000 ~SIZE~0))} is VALID [2018-11-18 23:02:39,927 INFO L273 TraceCheckUtils]: 166: Hoare triple {15979#(and (<= main_~i~1 2) (<= 100000 ~SIZE~0))} assume true; {15979#(and (<= main_~i~1 2) (<= 100000 ~SIZE~0))} is VALID [2018-11-18 23:02:39,928 INFO L273 TraceCheckUtils]: 167: Hoare triple {15979#(and (<= main_~i~1 2) (<= 100000 ~SIZE~0))} assume !!(~i~1 < ~SIZE~0 && 1 != ~found~0);call #t~mem8 := read~int(~#set~0.base, ~#set~0.offset + 4 * ~i~1, 4); {15979#(and (<= main_~i~1 2) (<= 100000 ~SIZE~0))} is VALID [2018-11-18 23:02:39,928 INFO L273 TraceCheckUtils]: 168: Hoare triple {15979#(and (<= main_~i~1 2) (<= 100000 ~SIZE~0))} assume #t~mem8 == ~element~0;havoc #t~mem8;~found~0 := 1;~pos~0 := ~i~1; {15989#(and (<= main_~pos~0 2) (<= 100000 ~SIZE~0))} is VALID [2018-11-18 23:02:39,929 INFO L273 TraceCheckUtils]: 169: Hoare triple {15989#(and (<= main_~pos~0 2) (<= 100000 ~SIZE~0))} #t~post7 := ~i~1;~i~1 := 1 + #t~post7;havoc #t~post7; {15989#(and (<= main_~pos~0 2) (<= 100000 ~SIZE~0))} is VALID [2018-11-18 23:02:39,930 INFO L273 TraceCheckUtils]: 170: Hoare triple {15989#(and (<= main_~pos~0 2) (<= 100000 ~SIZE~0))} assume true; {15989#(and (<= main_~pos~0 2) (<= 100000 ~SIZE~0))} is VALID [2018-11-18 23:02:39,930 INFO L273 TraceCheckUtils]: 171: Hoare triple {15989#(and (<= main_~pos~0 2) (<= 100000 ~SIZE~0))} assume !(~i~1 < ~SIZE~0 && 1 != ~found~0); {15989#(and (<= main_~pos~0 2) (<= 100000 ~SIZE~0))} is VALID [2018-11-18 23:02:39,931 INFO L273 TraceCheckUtils]: 172: Hoare triple {15989#(and (<= main_~pos~0 2) (<= 100000 ~SIZE~0))} assume 1 == ~found~0;~i~1 := ~pos~0; {15979#(and (<= main_~i~1 2) (<= 100000 ~SIZE~0))} is VALID [2018-11-18 23:02:39,932 INFO L273 TraceCheckUtils]: 173: Hoare triple {15979#(and (<= main_~i~1 2) (<= 100000 ~SIZE~0))} assume true; {15979#(and (<= main_~i~1 2) (<= 100000 ~SIZE~0))} is VALID [2018-11-18 23:02:39,933 INFO L273 TraceCheckUtils]: 174: Hoare triple {15979#(and (<= main_~i~1 2) (<= 100000 ~SIZE~0))} assume !!(~i~1 < ~SIZE~0 - 1);call #t~mem10 := read~int(~#set~0.base, ~#set~0.offset + 4 * (1 + ~i~1), 4);call write~int(#t~mem10, ~#set~0.base, ~#set~0.offset + 4 * ~i~1, 4);havoc #t~mem10; {15979#(and (<= main_~i~1 2) (<= 100000 ~SIZE~0))} is VALID [2018-11-18 23:02:39,933 INFO L273 TraceCheckUtils]: 175: Hoare triple {15979#(and (<= main_~i~1 2) (<= 100000 ~SIZE~0))} #t~post9 := ~i~1;~i~1 := 1 + #t~post9;havoc #t~post9; {16011#(and (<= main_~i~1 3) (<= 100000 ~SIZE~0))} is VALID [2018-11-18 23:02:39,934 INFO L273 TraceCheckUtils]: 176: Hoare triple {16011#(and (<= main_~i~1 3) (<= 100000 ~SIZE~0))} assume true; {16011#(and (<= main_~i~1 3) (<= 100000 ~SIZE~0))} is VALID [2018-11-18 23:02:39,935 INFO L273 TraceCheckUtils]: 177: Hoare triple {16011#(and (<= main_~i~1 3) (<= 100000 ~SIZE~0))} assume !(~i~1 < ~SIZE~0 - 1); {15464#false} is VALID [2018-11-18 23:02:39,935 INFO L273 TraceCheckUtils]: 178: Hoare triple {15464#false} assume 1 == ~found~0;~i~1 := 0; {15464#false} is VALID [2018-11-18 23:02:39,935 INFO L273 TraceCheckUtils]: 179: Hoare triple {15464#false} assume true; {15464#false} is VALID [2018-11-18 23:02:39,935 INFO L273 TraceCheckUtils]: 180: Hoare triple {15464#false} assume !!(~i~1 < ~SIZE~0 - 1);call #t~mem12 := read~int(~#set~0.base, ~#set~0.offset + 4 * ~i~1, 4); {15464#false} is VALID [2018-11-18 23:02:39,936 INFO L256 TraceCheckUtils]: 181: Hoare triple {15464#false} call __VERIFIER_assert((if #t~mem12 != ~element~0 then 1 else 0)); {15464#false} is VALID [2018-11-18 23:02:39,936 INFO L273 TraceCheckUtils]: 182: Hoare triple {15464#false} ~cond := #in~cond; {15464#false} is VALID [2018-11-18 23:02:39,936 INFO L273 TraceCheckUtils]: 183: Hoare triple {15464#false} assume 0 == ~cond; {15464#false} is VALID [2018-11-18 23:02:39,936 INFO L273 TraceCheckUtils]: 184: Hoare triple {15464#false} assume !false; {15464#false} is VALID [2018-11-18 23:02:39,961 INFO L134 CoverageAnalysis]: Checked inductivity of 825 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 805 trivial. 0 not checked. [2018-11-18 23:02:39,980 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-18 23:02:39,981 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 8] total 21 [2018-11-18 23:02:39,981 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 185 [2018-11-18 23:02:39,982 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-18 23:02:39,982 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 21 states. [2018-11-18 23:02:40,142 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 166 edges. 166 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 23:02:40,142 INFO L459 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-11-18 23:02:40,142 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-11-18 23:02:40,143 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=129, Invalid=291, Unknown=0, NotChecked=0, Total=420 [2018-11-18 23:02:40,143 INFO L87 Difference]: Start difference. First operand 202 states and 264 transitions. Second operand 21 states. [2018-11-18 23:02:44,819 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 23:02:44,820 INFO L93 Difference]: Finished difference Result 345 states and 435 transitions. [2018-11-18 23:02:44,820 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-11-18 23:02:44,820 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 185 [2018-11-18 23:02:44,820 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 23:02:44,820 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2018-11-18 23:02:44,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 318 transitions. [2018-11-18 23:02:44,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2018-11-18 23:02:44,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 318 transitions. [2018-11-18 23:02:44,833 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 25 states and 318 transitions. [2018-11-18 23:02:45,167 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 318 edges. 318 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 23:02:45,175 INFO L225 Difference]: With dead ends: 345 [2018-11-18 23:02:45,175 INFO L226 Difference]: Without dead ends: 287 [2018-11-18 23:02:45,176 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 216 GetRequests, 181 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 194 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=353, Invalid=979, Unknown=0, NotChecked=0, Total=1332 [2018-11-18 23:02:45,176 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 287 states. [2018-11-18 23:02:45,555 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 287 to 212. [2018-11-18 23:02:45,555 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-18 23:02:45,555 INFO L82 GeneralOperation]: Start isEquivalent. First operand 287 states. Second operand 212 states. [2018-11-18 23:02:45,555 INFO L74 IsIncluded]: Start isIncluded. First operand 287 states. Second operand 212 states. [2018-11-18 23:02:45,555 INFO L87 Difference]: Start difference. First operand 287 states. Second operand 212 states. [2018-11-18 23:02:45,562 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 23:02:45,562 INFO L93 Difference]: Finished difference Result 287 states and 370 transitions. [2018-11-18 23:02:45,563 INFO L276 IsEmpty]: Start isEmpty. Operand 287 states and 370 transitions. [2018-11-18 23:02:45,564 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 23:02:45,564 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 23:02:45,564 INFO L74 IsIncluded]: Start isIncluded. First operand 212 states. Second operand 287 states. [2018-11-18 23:02:45,564 INFO L87 Difference]: Start difference. First operand 212 states. Second operand 287 states. [2018-11-18 23:02:45,572 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 23:02:45,572 INFO L93 Difference]: Finished difference Result 287 states and 370 transitions. [2018-11-18 23:02:45,573 INFO L276 IsEmpty]: Start isEmpty. Operand 287 states and 370 transitions. [2018-11-18 23:02:45,574 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 23:02:45,574 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 23:02:45,574 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-18 23:02:45,574 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-18 23:02:45,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 212 states. [2018-11-18 23:02:45,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 212 states to 212 states and 279 transitions. [2018-11-18 23:02:45,580 INFO L78 Accepts]: Start accepts. Automaton has 212 states and 279 transitions. Word has length 185 [2018-11-18 23:02:45,580 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 23:02:45,580 INFO L480 AbstractCegarLoop]: Abstraction has 212 states and 279 transitions. [2018-11-18 23:02:45,580 INFO L481 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-11-18 23:02:45,581 INFO L276 IsEmpty]: Start isEmpty. Operand 212 states and 279 transitions. [2018-11-18 23:02:45,584 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 199 [2018-11-18 23:02:45,584 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 23:02:45,584 INFO L375 BasicCegarLoop]: trace histogram [14, 13, 13, 13, 13, 13, 13, 13, 13, 12, 12, 12, 5, 4, 4, 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] [2018-11-18 23:02:45,584 INFO L423 AbstractCegarLoop]: === Iteration 19 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 23:02:45,585 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 23:02:45,585 INFO L82 PathProgramCache]: Analyzing trace with hash -846944951, now seen corresponding path program 3 times [2018-11-18 23:02:45,585 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 23:02:45,585 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 23:02:45,592 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 23:02:45,592 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 23:02:45,592 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 23:02:45,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 23:02:45,944 INFO L256 TraceCheckUtils]: 0: Hoare triple {17371#true} call ULTIMATE.init(); {17371#true} is VALID [2018-11-18 23:02:45,945 INFO L273 TraceCheckUtils]: 1: Hoare triple {17371#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~SIZE~0 := 100000; {17373#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:02:45,945 INFO L273 TraceCheckUtils]: 2: Hoare triple {17373#(<= 100000 ~SIZE~0)} assume true; {17373#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:02:45,946 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {17373#(<= 100000 ~SIZE~0)} {17371#true} #128#return; {17373#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:02:45,946 INFO L256 TraceCheckUtils]: 4: Hoare triple {17373#(<= 100000 ~SIZE~0)} call #t~ret13 := main(); {17373#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:02:45,947 INFO L273 TraceCheckUtils]: 5: Hoare triple {17373#(<= 100000 ~SIZE~0)} havoc ~i~1;havoc ~pos~0;~n~0 := 0;~found~0 := 0;call ~#set~0.base, ~#set~0.offset := #Ultimate.alloc(4 * ~SIZE~0);call ~#values~0.base, ~#values~0.offset := #Ultimate.alloc(4 * ~SIZE~0);havoc ~element~0;havoc ~v~0;~v~0 := 0; {17373#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:02:45,947 INFO L273 TraceCheckUtils]: 6: Hoare triple {17373#(<= 100000 ~SIZE~0)} assume true; {17373#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:02:45,948 INFO L273 TraceCheckUtils]: 7: Hoare triple {17373#(<= 100000 ~SIZE~0)} assume !!(~v~0 < ~SIZE~0);call #t~mem3 := read~int(~#values~0.base, ~#values~0.offset + 4 * ~v~0, 4); {17373#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:02:45,948 INFO L256 TraceCheckUtils]: 8: Hoare triple {17373#(<= 100000 ~SIZE~0)} call #t~ret4 := elem_exists(~#set~0.base, ~#set~0.offset, ~n~0, #t~mem3); {17371#true} is VALID [2018-11-18 23:02:45,948 INFO L273 TraceCheckUtils]: 9: Hoare triple {17371#true} ~set.base, ~set.offset := #in~set.base, #in~set.offset;~size := #in~size;~value := #in~value;havoc ~i~0;~i~0 := 0; {17371#true} is VALID [2018-11-18 23:02:45,948 INFO L273 TraceCheckUtils]: 10: Hoare triple {17371#true} assume true; {17371#true} is VALID [2018-11-18 23:02:45,949 INFO L273 TraceCheckUtils]: 11: Hoare triple {17371#true} assume !(~i~0 < ~size); {17371#true} is VALID [2018-11-18 23:02:45,949 INFO L273 TraceCheckUtils]: 12: Hoare triple {17371#true} #res := 0; {17371#true} is VALID [2018-11-18 23:02:45,949 INFO L273 TraceCheckUtils]: 13: Hoare triple {17371#true} assume true; {17371#true} is VALID [2018-11-18 23:02:45,950 INFO L268 TraceCheckUtils]: 14: Hoare quadruple {17371#true} {17373#(<= 100000 ~SIZE~0)} #132#return; {17373#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:02:45,950 INFO L273 TraceCheckUtils]: 15: Hoare triple {17373#(<= 100000 ~SIZE~0)} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {17373#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:02:45,951 INFO L273 TraceCheckUtils]: 16: Hoare triple {17373#(<= 100000 ~SIZE~0)} assume 1 != #t~ret4;havoc #t~mem3;havoc #t~ret4;call #t~mem5 := read~int(~#values~0.base, ~#values~0.offset + 4 * ~v~0, 4); {17373#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:02:45,951 INFO L256 TraceCheckUtils]: 17: Hoare triple {17373#(<= 100000 ~SIZE~0)} call #t~ret6 := insert(~#set~0.base, ~#set~0.offset, ~n~0, #t~mem5); {17371#true} is VALID [2018-11-18 23:02:45,951 INFO L273 TraceCheckUtils]: 18: Hoare triple {17371#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; {17371#true} is VALID [2018-11-18 23:02:45,951 INFO L273 TraceCheckUtils]: 19: Hoare triple {17371#true} assume true; {17371#true} is VALID [2018-11-18 23:02:45,952 INFO L268 TraceCheckUtils]: 20: Hoare quadruple {17371#true} {17373#(<= 100000 ~SIZE~0)} #134#return; {17373#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:02:45,952 INFO L273 TraceCheckUtils]: 21: Hoare triple {17373#(<= 100000 ~SIZE~0)} assume -2147483648 <= #t~ret6 && #t~ret6 <= 2147483647;~n~0 := #t~ret6;havoc #t~ret6;havoc #t~mem5; {17373#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:02:45,952 INFO L273 TraceCheckUtils]: 22: Hoare triple {17373#(<= 100000 ~SIZE~0)} #t~post2 := ~v~0;~v~0 := 1 + #t~post2;havoc #t~post2; {17373#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:02:45,953 INFO L273 TraceCheckUtils]: 23: Hoare triple {17373#(<= 100000 ~SIZE~0)} assume true; {17373#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:02:45,953 INFO L273 TraceCheckUtils]: 24: Hoare triple {17373#(<= 100000 ~SIZE~0)} assume !!(~v~0 < ~SIZE~0);call #t~mem3 := read~int(~#values~0.base, ~#values~0.offset + 4 * ~v~0, 4); {17373#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:02:45,953 INFO L256 TraceCheckUtils]: 25: Hoare triple {17373#(<= 100000 ~SIZE~0)} call #t~ret4 := elem_exists(~#set~0.base, ~#set~0.offset, ~n~0, #t~mem3); {17371#true} is VALID [2018-11-18 23:02:45,953 INFO L273 TraceCheckUtils]: 26: Hoare triple {17371#true} ~set.base, ~set.offset := #in~set.base, #in~set.offset;~size := #in~size;~value := #in~value;havoc ~i~0;~i~0 := 0; {17371#true} is VALID [2018-11-18 23:02:45,954 INFO L273 TraceCheckUtils]: 27: Hoare triple {17371#true} assume true; {17371#true} is VALID [2018-11-18 23:02:45,954 INFO L273 TraceCheckUtils]: 28: Hoare triple {17371#true} assume !!(~i~0 < ~size);call #t~mem1 := read~int(~set.base, ~set.offset + 4 * ~i~0, 4); {17371#true} is VALID [2018-11-18 23:02:45,954 INFO L273 TraceCheckUtils]: 29: Hoare triple {17371#true} assume #t~mem1 == ~value;havoc #t~mem1;#res := 1; {17371#true} is VALID [2018-11-18 23:02:45,954 INFO L273 TraceCheckUtils]: 30: Hoare triple {17371#true} assume true; {17371#true} is VALID [2018-11-18 23:02:45,955 INFO L268 TraceCheckUtils]: 31: Hoare quadruple {17371#true} {17373#(<= 100000 ~SIZE~0)} #132#return; {17373#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:02:45,955 INFO L273 TraceCheckUtils]: 32: Hoare triple {17373#(<= 100000 ~SIZE~0)} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {17373#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:02:45,956 INFO L273 TraceCheckUtils]: 33: Hoare triple {17373#(<= 100000 ~SIZE~0)} assume !(1 != #t~ret4);havoc #t~mem3;havoc #t~ret4; {17373#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:02:45,956 INFO L273 TraceCheckUtils]: 34: Hoare triple {17373#(<= 100000 ~SIZE~0)} #t~post2 := ~v~0;~v~0 := 1 + #t~post2;havoc #t~post2; {17373#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:02:45,956 INFO L273 TraceCheckUtils]: 35: Hoare triple {17373#(<= 100000 ~SIZE~0)} assume true; {17373#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:02:45,957 INFO L273 TraceCheckUtils]: 36: Hoare triple {17373#(<= 100000 ~SIZE~0)} assume !!(~v~0 < ~SIZE~0);call #t~mem3 := read~int(~#values~0.base, ~#values~0.offset + 4 * ~v~0, 4); {17373#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:02:45,957 INFO L256 TraceCheckUtils]: 37: Hoare triple {17373#(<= 100000 ~SIZE~0)} call #t~ret4 := elem_exists(~#set~0.base, ~#set~0.offset, ~n~0, #t~mem3); {17371#true} is VALID [2018-11-18 23:02:45,957 INFO L273 TraceCheckUtils]: 38: Hoare triple {17371#true} ~set.base, ~set.offset := #in~set.base, #in~set.offset;~size := #in~size;~value := #in~value;havoc ~i~0;~i~0 := 0; {17371#true} is VALID [2018-11-18 23:02:45,957 INFO L273 TraceCheckUtils]: 39: Hoare triple {17371#true} assume true; {17371#true} is VALID [2018-11-18 23:02:45,957 INFO L273 TraceCheckUtils]: 40: Hoare triple {17371#true} assume !!(~i~0 < ~size);call #t~mem1 := read~int(~set.base, ~set.offset + 4 * ~i~0, 4); {17371#true} is VALID [2018-11-18 23:02:45,957 INFO L273 TraceCheckUtils]: 41: Hoare triple {17371#true} assume #t~mem1 == ~value;havoc #t~mem1;#res := 1; {17371#true} is VALID [2018-11-18 23:02:45,957 INFO L273 TraceCheckUtils]: 42: Hoare triple {17371#true} assume true; {17371#true} is VALID [2018-11-18 23:02:45,959 INFO L268 TraceCheckUtils]: 43: Hoare quadruple {17371#true} {17373#(<= 100000 ~SIZE~0)} #132#return; {17373#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:02:45,959 INFO L273 TraceCheckUtils]: 44: Hoare triple {17373#(<= 100000 ~SIZE~0)} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {17373#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:02:45,959 INFO L273 TraceCheckUtils]: 45: Hoare triple {17373#(<= 100000 ~SIZE~0)} assume !(1 != #t~ret4);havoc #t~mem3;havoc #t~ret4; {17373#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:02:45,960 INFO L273 TraceCheckUtils]: 46: Hoare triple {17373#(<= 100000 ~SIZE~0)} #t~post2 := ~v~0;~v~0 := 1 + #t~post2;havoc #t~post2; {17373#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:02:45,960 INFO L273 TraceCheckUtils]: 47: Hoare triple {17373#(<= 100000 ~SIZE~0)} assume true; {17373#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:02:45,961 INFO L273 TraceCheckUtils]: 48: Hoare triple {17373#(<= 100000 ~SIZE~0)} assume !!(~v~0 < ~SIZE~0);call #t~mem3 := read~int(~#values~0.base, ~#values~0.offset + 4 * ~v~0, 4); {17373#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:02:45,961 INFO L256 TraceCheckUtils]: 49: Hoare triple {17373#(<= 100000 ~SIZE~0)} call #t~ret4 := elem_exists(~#set~0.base, ~#set~0.offset, ~n~0, #t~mem3); {17371#true} is VALID [2018-11-18 23:02:45,961 INFO L273 TraceCheckUtils]: 50: Hoare triple {17371#true} ~set.base, ~set.offset := #in~set.base, #in~set.offset;~size := #in~size;~value := #in~value;havoc ~i~0;~i~0 := 0; {17371#true} is VALID [2018-11-18 23:02:45,961 INFO L273 TraceCheckUtils]: 51: Hoare triple {17371#true} assume true; {17371#true} is VALID [2018-11-18 23:02:45,962 INFO L273 TraceCheckUtils]: 52: Hoare triple {17371#true} assume !!(~i~0 < ~size);call #t~mem1 := read~int(~set.base, ~set.offset + 4 * ~i~0, 4); {17371#true} is VALID [2018-11-18 23:02:45,962 INFO L273 TraceCheckUtils]: 53: Hoare triple {17371#true} assume #t~mem1 == ~value;havoc #t~mem1;#res := 1; {17371#true} is VALID [2018-11-18 23:02:45,962 INFO L273 TraceCheckUtils]: 54: Hoare triple {17371#true} assume true; {17371#true} is VALID [2018-11-18 23:02:45,963 INFO L268 TraceCheckUtils]: 55: Hoare quadruple {17371#true} {17373#(<= 100000 ~SIZE~0)} #132#return; {17373#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:02:45,964 INFO L273 TraceCheckUtils]: 56: Hoare triple {17373#(<= 100000 ~SIZE~0)} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {17373#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:02:45,964 INFO L273 TraceCheckUtils]: 57: Hoare triple {17373#(<= 100000 ~SIZE~0)} assume !(1 != #t~ret4);havoc #t~mem3;havoc #t~ret4; {17373#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:02:45,964 INFO L273 TraceCheckUtils]: 58: Hoare triple {17373#(<= 100000 ~SIZE~0)} #t~post2 := ~v~0;~v~0 := 1 + #t~post2;havoc #t~post2; {17373#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:02:45,965 INFO L273 TraceCheckUtils]: 59: Hoare triple {17373#(<= 100000 ~SIZE~0)} assume true; {17373#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:02:45,965 INFO L273 TraceCheckUtils]: 60: Hoare triple {17373#(<= 100000 ~SIZE~0)} assume !!(~v~0 < ~SIZE~0);call #t~mem3 := read~int(~#values~0.base, ~#values~0.offset + 4 * ~v~0, 4); {17373#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:02:45,965 INFO L256 TraceCheckUtils]: 61: Hoare triple {17373#(<= 100000 ~SIZE~0)} call #t~ret4 := elem_exists(~#set~0.base, ~#set~0.offset, ~n~0, #t~mem3); {17371#true} is VALID [2018-11-18 23:02:45,965 INFO L273 TraceCheckUtils]: 62: Hoare triple {17371#true} ~set.base, ~set.offset := #in~set.base, #in~set.offset;~size := #in~size;~value := #in~value;havoc ~i~0;~i~0 := 0; {17371#true} is VALID [2018-11-18 23:02:45,965 INFO L273 TraceCheckUtils]: 63: Hoare triple {17371#true} assume true; {17371#true} is VALID [2018-11-18 23:02:45,965 INFO L273 TraceCheckUtils]: 64: Hoare triple {17371#true} assume !!(~i~0 < ~size);call #t~mem1 := read~int(~set.base, ~set.offset + 4 * ~i~0, 4); {17371#true} is VALID [2018-11-18 23:02:45,965 INFO L273 TraceCheckUtils]: 65: Hoare triple {17371#true} assume #t~mem1 == ~value;havoc #t~mem1;#res := 1; {17371#true} is VALID [2018-11-18 23:02:45,966 INFO L273 TraceCheckUtils]: 66: Hoare triple {17371#true} assume true; {17371#true} is VALID [2018-11-18 23:02:45,966 INFO L268 TraceCheckUtils]: 67: Hoare quadruple {17371#true} {17373#(<= 100000 ~SIZE~0)} #132#return; {17373#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:02:45,967 INFO L273 TraceCheckUtils]: 68: Hoare triple {17373#(<= 100000 ~SIZE~0)} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {17373#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:02:45,967 INFO L273 TraceCheckUtils]: 69: Hoare triple {17373#(<= 100000 ~SIZE~0)} assume !(1 != #t~ret4);havoc #t~mem3;havoc #t~ret4; {17373#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:02:45,967 INFO L273 TraceCheckUtils]: 70: Hoare triple {17373#(<= 100000 ~SIZE~0)} #t~post2 := ~v~0;~v~0 := 1 + #t~post2;havoc #t~post2; {17373#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:02:45,968 INFO L273 TraceCheckUtils]: 71: Hoare triple {17373#(<= 100000 ~SIZE~0)} assume true; {17373#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:02:45,968 INFO L273 TraceCheckUtils]: 72: Hoare triple {17373#(<= 100000 ~SIZE~0)} assume !!(~v~0 < ~SIZE~0);call #t~mem3 := read~int(~#values~0.base, ~#values~0.offset + 4 * ~v~0, 4); {17373#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:02:45,968 INFO L256 TraceCheckUtils]: 73: Hoare triple {17373#(<= 100000 ~SIZE~0)} call #t~ret4 := elem_exists(~#set~0.base, ~#set~0.offset, ~n~0, #t~mem3); {17371#true} is VALID [2018-11-18 23:02:45,969 INFO L273 TraceCheckUtils]: 74: Hoare triple {17371#true} ~set.base, ~set.offset := #in~set.base, #in~set.offset;~size := #in~size;~value := #in~value;havoc ~i~0;~i~0 := 0; {17371#true} is VALID [2018-11-18 23:02:45,969 INFO L273 TraceCheckUtils]: 75: Hoare triple {17371#true} assume true; {17371#true} is VALID [2018-11-18 23:02:45,969 INFO L273 TraceCheckUtils]: 76: Hoare triple {17371#true} assume !!(~i~0 < ~size);call #t~mem1 := read~int(~set.base, ~set.offset + 4 * ~i~0, 4); {17371#true} is VALID [2018-11-18 23:02:45,969 INFO L273 TraceCheckUtils]: 77: Hoare triple {17371#true} assume #t~mem1 == ~value;havoc #t~mem1;#res := 1; {17371#true} is VALID [2018-11-18 23:02:45,969 INFO L273 TraceCheckUtils]: 78: Hoare triple {17371#true} assume true; {17371#true} is VALID [2018-11-18 23:02:45,971 INFO L268 TraceCheckUtils]: 79: Hoare quadruple {17371#true} {17373#(<= 100000 ~SIZE~0)} #132#return; {17373#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:02:45,971 INFO L273 TraceCheckUtils]: 80: Hoare triple {17373#(<= 100000 ~SIZE~0)} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {17373#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:02:45,971 INFO L273 TraceCheckUtils]: 81: Hoare triple {17373#(<= 100000 ~SIZE~0)} assume !(1 != #t~ret4);havoc #t~mem3;havoc #t~ret4; {17373#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:02:45,972 INFO L273 TraceCheckUtils]: 82: Hoare triple {17373#(<= 100000 ~SIZE~0)} #t~post2 := ~v~0;~v~0 := 1 + #t~post2;havoc #t~post2; {17373#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:02:45,972 INFO L273 TraceCheckUtils]: 83: Hoare triple {17373#(<= 100000 ~SIZE~0)} assume true; {17373#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:02:45,973 INFO L273 TraceCheckUtils]: 84: Hoare triple {17373#(<= 100000 ~SIZE~0)} assume !!(~v~0 < ~SIZE~0);call #t~mem3 := read~int(~#values~0.base, ~#values~0.offset + 4 * ~v~0, 4); {17373#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:02:45,973 INFO L256 TraceCheckUtils]: 85: Hoare triple {17373#(<= 100000 ~SIZE~0)} call #t~ret4 := elem_exists(~#set~0.base, ~#set~0.offset, ~n~0, #t~mem3); {17371#true} is VALID [2018-11-18 23:02:45,973 INFO L273 TraceCheckUtils]: 86: Hoare triple {17371#true} ~set.base, ~set.offset := #in~set.base, #in~set.offset;~size := #in~size;~value := #in~value;havoc ~i~0;~i~0 := 0; {17371#true} is VALID [2018-11-18 23:02:45,973 INFO L273 TraceCheckUtils]: 87: Hoare triple {17371#true} assume true; {17371#true} is VALID [2018-11-18 23:02:45,974 INFO L273 TraceCheckUtils]: 88: Hoare triple {17371#true} assume !!(~i~0 < ~size);call #t~mem1 := read~int(~set.base, ~set.offset + 4 * ~i~0, 4); {17371#true} is VALID [2018-11-18 23:02:45,974 INFO L273 TraceCheckUtils]: 89: Hoare triple {17371#true} assume #t~mem1 == ~value;havoc #t~mem1;#res := 1; {17371#true} is VALID [2018-11-18 23:02:45,974 INFO L273 TraceCheckUtils]: 90: Hoare triple {17371#true} assume true; {17371#true} is VALID [2018-11-18 23:02:45,975 INFO L268 TraceCheckUtils]: 91: Hoare quadruple {17371#true} {17373#(<= 100000 ~SIZE~0)} #132#return; {17373#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:02:45,975 INFO L273 TraceCheckUtils]: 92: Hoare triple {17373#(<= 100000 ~SIZE~0)} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {17373#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:02:45,976 INFO L273 TraceCheckUtils]: 93: Hoare triple {17373#(<= 100000 ~SIZE~0)} assume !(1 != #t~ret4);havoc #t~mem3;havoc #t~ret4; {17373#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:02:45,976 INFO L273 TraceCheckUtils]: 94: Hoare triple {17373#(<= 100000 ~SIZE~0)} #t~post2 := ~v~0;~v~0 := 1 + #t~post2;havoc #t~post2; {17373#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:02:45,976 INFO L273 TraceCheckUtils]: 95: Hoare triple {17373#(<= 100000 ~SIZE~0)} assume true; {17373#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:02:45,977 INFO L273 TraceCheckUtils]: 96: Hoare triple {17373#(<= 100000 ~SIZE~0)} assume !!(~v~0 < ~SIZE~0);call #t~mem3 := read~int(~#values~0.base, ~#values~0.offset + 4 * ~v~0, 4); {17373#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:02:45,977 INFO L256 TraceCheckUtils]: 97: Hoare triple {17373#(<= 100000 ~SIZE~0)} call #t~ret4 := elem_exists(~#set~0.base, ~#set~0.offset, ~n~0, #t~mem3); {17371#true} is VALID [2018-11-18 23:02:45,977 INFO L273 TraceCheckUtils]: 98: Hoare triple {17371#true} ~set.base, ~set.offset := #in~set.base, #in~set.offset;~size := #in~size;~value := #in~value;havoc ~i~0;~i~0 := 0; {17371#true} is VALID [2018-11-18 23:02:45,977 INFO L273 TraceCheckUtils]: 99: Hoare triple {17371#true} assume true; {17371#true} is VALID [2018-11-18 23:02:45,977 INFO L273 TraceCheckUtils]: 100: Hoare triple {17371#true} assume !!(~i~0 < ~size);call #t~mem1 := read~int(~set.base, ~set.offset + 4 * ~i~0, 4); {17371#true} is VALID [2018-11-18 23:02:45,977 INFO L273 TraceCheckUtils]: 101: Hoare triple {17371#true} assume #t~mem1 == ~value;havoc #t~mem1;#res := 1; {17371#true} is VALID [2018-11-18 23:02:45,977 INFO L273 TraceCheckUtils]: 102: Hoare triple {17371#true} assume true; {17371#true} is VALID [2018-11-18 23:02:45,979 INFO L268 TraceCheckUtils]: 103: Hoare quadruple {17371#true} {17373#(<= 100000 ~SIZE~0)} #132#return; {17373#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:02:45,979 INFO L273 TraceCheckUtils]: 104: Hoare triple {17373#(<= 100000 ~SIZE~0)} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {17373#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:02:45,980 INFO L273 TraceCheckUtils]: 105: Hoare triple {17373#(<= 100000 ~SIZE~0)} assume !(1 != #t~ret4);havoc #t~mem3;havoc #t~ret4; {17373#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:02:45,980 INFO L273 TraceCheckUtils]: 106: Hoare triple {17373#(<= 100000 ~SIZE~0)} #t~post2 := ~v~0;~v~0 := 1 + #t~post2;havoc #t~post2; {17373#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:02:45,980 INFO L273 TraceCheckUtils]: 107: Hoare triple {17373#(<= 100000 ~SIZE~0)} assume true; {17373#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:02:45,981 INFO L273 TraceCheckUtils]: 108: Hoare triple {17373#(<= 100000 ~SIZE~0)} assume !!(~v~0 < ~SIZE~0);call #t~mem3 := read~int(~#values~0.base, ~#values~0.offset + 4 * ~v~0, 4); {17373#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:02:45,981 INFO L256 TraceCheckUtils]: 109: Hoare triple {17373#(<= 100000 ~SIZE~0)} call #t~ret4 := elem_exists(~#set~0.base, ~#set~0.offset, ~n~0, #t~mem3); {17371#true} is VALID [2018-11-18 23:02:45,981 INFO L273 TraceCheckUtils]: 110: Hoare triple {17371#true} ~set.base, ~set.offset := #in~set.base, #in~set.offset;~size := #in~size;~value := #in~value;havoc ~i~0;~i~0 := 0; {17371#true} is VALID [2018-11-18 23:02:45,982 INFO L273 TraceCheckUtils]: 111: Hoare triple {17371#true} assume true; {17371#true} is VALID [2018-11-18 23:02:45,982 INFO L273 TraceCheckUtils]: 112: Hoare triple {17371#true} assume !!(~i~0 < ~size);call #t~mem1 := read~int(~set.base, ~set.offset + 4 * ~i~0, 4); {17371#true} is VALID [2018-11-18 23:02:45,982 INFO L273 TraceCheckUtils]: 113: Hoare triple {17371#true} assume #t~mem1 == ~value;havoc #t~mem1;#res := 1; {17371#true} is VALID [2018-11-18 23:02:45,982 INFO L273 TraceCheckUtils]: 114: Hoare triple {17371#true} assume true; {17371#true} is VALID [2018-11-18 23:02:45,983 INFO L268 TraceCheckUtils]: 115: Hoare quadruple {17371#true} {17373#(<= 100000 ~SIZE~0)} #132#return; {17373#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:02:45,984 INFO L273 TraceCheckUtils]: 116: Hoare triple {17373#(<= 100000 ~SIZE~0)} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {17373#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:02:45,984 INFO L273 TraceCheckUtils]: 117: Hoare triple {17373#(<= 100000 ~SIZE~0)} assume !(1 != #t~ret4);havoc #t~mem3;havoc #t~ret4; {17373#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:02:45,985 INFO L273 TraceCheckUtils]: 118: Hoare triple {17373#(<= 100000 ~SIZE~0)} #t~post2 := ~v~0;~v~0 := 1 + #t~post2;havoc #t~post2; {17373#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:02:45,985 INFO L273 TraceCheckUtils]: 119: Hoare triple {17373#(<= 100000 ~SIZE~0)} assume true; {17373#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:02:45,985 INFO L273 TraceCheckUtils]: 120: Hoare triple {17373#(<= 100000 ~SIZE~0)} assume !!(~v~0 < ~SIZE~0);call #t~mem3 := read~int(~#values~0.base, ~#values~0.offset + 4 * ~v~0, 4); {17373#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:02:45,985 INFO L256 TraceCheckUtils]: 121: Hoare triple {17373#(<= 100000 ~SIZE~0)} call #t~ret4 := elem_exists(~#set~0.base, ~#set~0.offset, ~n~0, #t~mem3); {17371#true} is VALID [2018-11-18 23:02:45,986 INFO L273 TraceCheckUtils]: 122: Hoare triple {17371#true} ~set.base, ~set.offset := #in~set.base, #in~set.offset;~size := #in~size;~value := #in~value;havoc ~i~0;~i~0 := 0; {17371#true} is VALID [2018-11-18 23:02:45,986 INFO L273 TraceCheckUtils]: 123: Hoare triple {17371#true} assume true; {17371#true} is VALID [2018-11-18 23:02:45,986 INFO L273 TraceCheckUtils]: 124: Hoare triple {17371#true} assume !!(~i~0 < ~size);call #t~mem1 := read~int(~set.base, ~set.offset + 4 * ~i~0, 4); {17371#true} is VALID [2018-11-18 23:02:45,986 INFO L273 TraceCheckUtils]: 125: Hoare triple {17371#true} assume #t~mem1 == ~value;havoc #t~mem1;#res := 1; {17371#true} is VALID [2018-11-18 23:02:45,986 INFO L273 TraceCheckUtils]: 126: Hoare triple {17371#true} assume true; {17371#true} is VALID [2018-11-18 23:02:45,987 INFO L268 TraceCheckUtils]: 127: Hoare quadruple {17371#true} {17373#(<= 100000 ~SIZE~0)} #132#return; {17373#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:02:45,987 INFO L273 TraceCheckUtils]: 128: Hoare triple {17373#(<= 100000 ~SIZE~0)} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {17373#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:02:45,988 INFO L273 TraceCheckUtils]: 129: Hoare triple {17373#(<= 100000 ~SIZE~0)} assume !(1 != #t~ret4);havoc #t~mem3;havoc #t~ret4; {17373#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:02:45,988 INFO L273 TraceCheckUtils]: 130: Hoare triple {17373#(<= 100000 ~SIZE~0)} #t~post2 := ~v~0;~v~0 := 1 + #t~post2;havoc #t~post2; {17373#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:02:45,989 INFO L273 TraceCheckUtils]: 131: Hoare triple {17373#(<= 100000 ~SIZE~0)} assume true; {17373#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:02:45,989 INFO L273 TraceCheckUtils]: 132: Hoare triple {17373#(<= 100000 ~SIZE~0)} assume !!(~v~0 < ~SIZE~0);call #t~mem3 := read~int(~#values~0.base, ~#values~0.offset + 4 * ~v~0, 4); {17373#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:02:45,989 INFO L256 TraceCheckUtils]: 133: Hoare triple {17373#(<= 100000 ~SIZE~0)} call #t~ret4 := elem_exists(~#set~0.base, ~#set~0.offset, ~n~0, #t~mem3); {17371#true} is VALID [2018-11-18 23:02:45,989 INFO L273 TraceCheckUtils]: 134: Hoare triple {17371#true} ~set.base, ~set.offset := #in~set.base, #in~set.offset;~size := #in~size;~value := #in~value;havoc ~i~0;~i~0 := 0; {17371#true} is VALID [2018-11-18 23:02:45,990 INFO L273 TraceCheckUtils]: 135: Hoare triple {17371#true} assume true; {17371#true} is VALID [2018-11-18 23:02:45,990 INFO L273 TraceCheckUtils]: 136: Hoare triple {17371#true} assume !!(~i~0 < ~size);call #t~mem1 := read~int(~set.base, ~set.offset + 4 * ~i~0, 4); {17371#true} is VALID [2018-11-18 23:02:45,990 INFO L273 TraceCheckUtils]: 137: Hoare triple {17371#true} assume #t~mem1 == ~value;havoc #t~mem1;#res := 1; {17371#true} is VALID [2018-11-18 23:02:45,990 INFO L273 TraceCheckUtils]: 138: Hoare triple {17371#true} assume true; {17371#true} is VALID [2018-11-18 23:02:45,991 INFO L268 TraceCheckUtils]: 139: Hoare quadruple {17371#true} {17373#(<= 100000 ~SIZE~0)} #132#return; {17373#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:02:45,992 INFO L273 TraceCheckUtils]: 140: Hoare triple {17373#(<= 100000 ~SIZE~0)} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {17373#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:02:45,992 INFO L273 TraceCheckUtils]: 141: Hoare triple {17373#(<= 100000 ~SIZE~0)} assume !(1 != #t~ret4);havoc #t~mem3;havoc #t~ret4; {17373#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:02:45,992 INFO L273 TraceCheckUtils]: 142: Hoare triple {17373#(<= 100000 ~SIZE~0)} #t~post2 := ~v~0;~v~0 := 1 + #t~post2;havoc #t~post2; {17373#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:02:45,993 INFO L273 TraceCheckUtils]: 143: Hoare triple {17373#(<= 100000 ~SIZE~0)} assume true; {17373#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:02:45,993 INFO L273 TraceCheckUtils]: 144: Hoare triple {17373#(<= 100000 ~SIZE~0)} assume !!(~v~0 < ~SIZE~0);call #t~mem3 := read~int(~#values~0.base, ~#values~0.offset + 4 * ~v~0, 4); {17373#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:02:45,993 INFO L256 TraceCheckUtils]: 145: Hoare triple {17373#(<= 100000 ~SIZE~0)} call #t~ret4 := elem_exists(~#set~0.base, ~#set~0.offset, ~n~0, #t~mem3); {17371#true} is VALID [2018-11-18 23:02:45,993 INFO L273 TraceCheckUtils]: 146: Hoare triple {17371#true} ~set.base, ~set.offset := #in~set.base, #in~set.offset;~size := #in~size;~value := #in~value;havoc ~i~0;~i~0 := 0; {17371#true} is VALID [2018-11-18 23:02:45,993 INFO L273 TraceCheckUtils]: 147: Hoare triple {17371#true} assume true; {17371#true} is VALID [2018-11-18 23:02:45,993 INFO L273 TraceCheckUtils]: 148: Hoare triple {17371#true} assume !!(~i~0 < ~size);call #t~mem1 := read~int(~set.base, ~set.offset + 4 * ~i~0, 4); {17371#true} is VALID [2018-11-18 23:02:45,994 INFO L273 TraceCheckUtils]: 149: Hoare triple {17371#true} assume #t~mem1 == ~value;havoc #t~mem1;#res := 1; {17371#true} is VALID [2018-11-18 23:02:45,994 INFO L273 TraceCheckUtils]: 150: Hoare triple {17371#true} assume true; {17371#true} is VALID [2018-11-18 23:02:45,994 INFO L268 TraceCheckUtils]: 151: Hoare quadruple {17371#true} {17373#(<= 100000 ~SIZE~0)} #132#return; {17373#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:02:45,995 INFO L273 TraceCheckUtils]: 152: Hoare triple {17373#(<= 100000 ~SIZE~0)} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {17373#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:02:45,995 INFO L273 TraceCheckUtils]: 153: Hoare triple {17373#(<= 100000 ~SIZE~0)} assume !(1 != #t~ret4);havoc #t~mem3;havoc #t~ret4; {17373#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:02:45,995 INFO L273 TraceCheckUtils]: 154: Hoare triple {17373#(<= 100000 ~SIZE~0)} #t~post2 := ~v~0;~v~0 := 1 + #t~post2;havoc #t~post2; {17373#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:02:45,996 INFO L273 TraceCheckUtils]: 155: Hoare triple {17373#(<= 100000 ~SIZE~0)} assume true; {17373#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:02:45,996 INFO L273 TraceCheckUtils]: 156: Hoare triple {17373#(<= 100000 ~SIZE~0)} assume !!(~v~0 < ~SIZE~0);call #t~mem3 := read~int(~#values~0.base, ~#values~0.offset + 4 * ~v~0, 4); {17373#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:02:45,997 INFO L256 TraceCheckUtils]: 157: Hoare triple {17373#(<= 100000 ~SIZE~0)} call #t~ret4 := elem_exists(~#set~0.base, ~#set~0.offset, ~n~0, #t~mem3); {17371#true} is VALID [2018-11-18 23:02:45,997 INFO L273 TraceCheckUtils]: 158: Hoare triple {17371#true} ~set.base, ~set.offset := #in~set.base, #in~set.offset;~size := #in~size;~value := #in~value;havoc ~i~0;~i~0 := 0; {17371#true} is VALID [2018-11-18 23:02:45,997 INFO L273 TraceCheckUtils]: 159: Hoare triple {17371#true} assume true; {17371#true} is VALID [2018-11-18 23:02:45,997 INFO L273 TraceCheckUtils]: 160: Hoare triple {17371#true} assume !!(~i~0 < ~size);call #t~mem1 := read~int(~set.base, ~set.offset + 4 * ~i~0, 4); {17371#true} is VALID [2018-11-18 23:02:45,997 INFO L273 TraceCheckUtils]: 161: Hoare triple {17371#true} assume #t~mem1 == ~value;havoc #t~mem1;#res := 1; {17371#true} is VALID [2018-11-18 23:02:45,998 INFO L273 TraceCheckUtils]: 162: Hoare triple {17371#true} assume true; {17371#true} is VALID [2018-11-18 23:02:45,999 INFO L268 TraceCheckUtils]: 163: Hoare quadruple {17371#true} {17373#(<= 100000 ~SIZE~0)} #132#return; {17373#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:02:45,999 INFO L273 TraceCheckUtils]: 164: Hoare triple {17373#(<= 100000 ~SIZE~0)} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {17373#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:02:46,000 INFO L273 TraceCheckUtils]: 165: Hoare triple {17373#(<= 100000 ~SIZE~0)} assume !(1 != #t~ret4);havoc #t~mem3;havoc #t~ret4; {17373#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:02:46,000 INFO L273 TraceCheckUtils]: 166: Hoare triple {17373#(<= 100000 ~SIZE~0)} #t~post2 := ~v~0;~v~0 := 1 + #t~post2;havoc #t~post2; {17373#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:02:46,000 INFO L273 TraceCheckUtils]: 167: Hoare triple {17373#(<= 100000 ~SIZE~0)} assume true; {17373#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:02:46,001 INFO L273 TraceCheckUtils]: 168: Hoare triple {17373#(<= 100000 ~SIZE~0)} assume !(~v~0 < ~SIZE~0); {17373#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:02:46,001 INFO L273 TraceCheckUtils]: 169: Hoare triple {17373#(<= 100000 ~SIZE~0)} ~i~1 := 0; {17374#(and (= 0 main_~i~1) (<= 100000 ~SIZE~0))} is VALID [2018-11-18 23:02:46,001 INFO L273 TraceCheckUtils]: 170: Hoare triple {17374#(and (= 0 main_~i~1) (<= 100000 ~SIZE~0))} assume true; {17374#(and (= 0 main_~i~1) (<= 100000 ~SIZE~0))} is VALID [2018-11-18 23:02:46,002 INFO L273 TraceCheckUtils]: 171: Hoare triple {17374#(and (= 0 main_~i~1) (<= 100000 ~SIZE~0))} assume !!(~i~1 < ~SIZE~0 && 1 != ~found~0);call #t~mem8 := read~int(~#set~0.base, ~#set~0.offset + 4 * ~i~1, 4); {17374#(and (= 0 main_~i~1) (<= 100000 ~SIZE~0))} is VALID [2018-11-18 23:02:46,003 INFO L273 TraceCheckUtils]: 172: Hoare triple {17374#(and (= 0 main_~i~1) (<= 100000 ~SIZE~0))} assume #t~mem8 == ~element~0;havoc #t~mem8;~found~0 := 1;~pos~0 := ~i~1; {17375#(and (= 0 main_~pos~0) (<= 100000 ~SIZE~0))} is VALID [2018-11-18 23:02:46,003 INFO L273 TraceCheckUtils]: 173: Hoare triple {17375#(and (= 0 main_~pos~0) (<= 100000 ~SIZE~0))} #t~post7 := ~i~1;~i~1 := 1 + #t~post7;havoc #t~post7; {17375#(and (= 0 main_~pos~0) (<= 100000 ~SIZE~0))} is VALID [2018-11-18 23:02:46,004 INFO L273 TraceCheckUtils]: 174: Hoare triple {17375#(and (= 0 main_~pos~0) (<= 100000 ~SIZE~0))} assume true; {17375#(and (= 0 main_~pos~0) (<= 100000 ~SIZE~0))} is VALID [2018-11-18 23:02:46,004 INFO L273 TraceCheckUtils]: 175: Hoare triple {17375#(and (= 0 main_~pos~0) (<= 100000 ~SIZE~0))} assume !(~i~1 < ~SIZE~0 && 1 != ~found~0); {17375#(and (= 0 main_~pos~0) (<= 100000 ~SIZE~0))} is VALID [2018-11-18 23:02:46,005 INFO L273 TraceCheckUtils]: 176: Hoare triple {17375#(and (= 0 main_~pos~0) (<= 100000 ~SIZE~0))} assume 1 == ~found~0;~i~1 := ~pos~0; {17374#(and (= 0 main_~i~1) (<= 100000 ~SIZE~0))} is VALID [2018-11-18 23:02:46,006 INFO L273 TraceCheckUtils]: 177: Hoare triple {17374#(and (= 0 main_~i~1) (<= 100000 ~SIZE~0))} assume true; {17374#(and (= 0 main_~i~1) (<= 100000 ~SIZE~0))} is VALID [2018-11-18 23:02:46,006 INFO L273 TraceCheckUtils]: 178: Hoare triple {17374#(and (= 0 main_~i~1) (<= 100000 ~SIZE~0))} assume !!(~i~1 < ~SIZE~0 - 1);call #t~mem10 := read~int(~#set~0.base, ~#set~0.offset + 4 * (1 + ~i~1), 4);call write~int(#t~mem10, ~#set~0.base, ~#set~0.offset + 4 * ~i~1, 4);havoc #t~mem10; {17374#(and (= 0 main_~i~1) (<= 100000 ~SIZE~0))} is VALID [2018-11-18 23:02:46,007 INFO L273 TraceCheckUtils]: 179: Hoare triple {17374#(and (= 0 main_~i~1) (<= 100000 ~SIZE~0))} #t~post9 := ~i~1;~i~1 := 1 + #t~post9;havoc #t~post9; {17376#(<= (+ main_~i~1 99999) ~SIZE~0)} is VALID [2018-11-18 23:02:46,008 INFO L273 TraceCheckUtils]: 180: Hoare triple {17376#(<= (+ main_~i~1 99999) ~SIZE~0)} assume true; {17376#(<= (+ main_~i~1 99999) ~SIZE~0)} is VALID [2018-11-18 23:02:46,008 INFO L273 TraceCheckUtils]: 181: Hoare triple {17376#(<= (+ main_~i~1 99999) ~SIZE~0)} assume !!(~i~1 < ~SIZE~0 - 1);call #t~mem10 := read~int(~#set~0.base, ~#set~0.offset + 4 * (1 + ~i~1), 4);call write~int(#t~mem10, ~#set~0.base, ~#set~0.offset + 4 * ~i~1, 4);havoc #t~mem10; {17376#(<= (+ main_~i~1 99999) ~SIZE~0)} is VALID [2018-11-18 23:02:46,009 INFO L273 TraceCheckUtils]: 182: Hoare triple {17376#(<= (+ main_~i~1 99999) ~SIZE~0)} #t~post9 := ~i~1;~i~1 := 1 + #t~post9;havoc #t~post9; {17377#(<= (+ main_~i~1 99998) ~SIZE~0)} is VALID [2018-11-18 23:02:46,009 INFO L273 TraceCheckUtils]: 183: Hoare triple {17377#(<= (+ main_~i~1 99998) ~SIZE~0)} assume true; {17377#(<= (+ main_~i~1 99998) ~SIZE~0)} is VALID [2018-11-18 23:02:46,010 INFO L273 TraceCheckUtils]: 184: Hoare triple {17377#(<= (+ main_~i~1 99998) ~SIZE~0)} assume !!(~i~1 < ~SIZE~0 - 1);call #t~mem10 := read~int(~#set~0.base, ~#set~0.offset + 4 * (1 + ~i~1), 4);call write~int(#t~mem10, ~#set~0.base, ~#set~0.offset + 4 * ~i~1, 4);havoc #t~mem10; {17377#(<= (+ main_~i~1 99998) ~SIZE~0)} is VALID [2018-11-18 23:02:46,011 INFO L273 TraceCheckUtils]: 185: Hoare triple {17377#(<= (+ main_~i~1 99998) ~SIZE~0)} #t~post9 := ~i~1;~i~1 := 1 + #t~post9;havoc #t~post9; {17378#(<= (+ main_~i~1 99997) ~SIZE~0)} is VALID [2018-11-18 23:02:46,011 INFO L273 TraceCheckUtils]: 186: Hoare triple {17378#(<= (+ main_~i~1 99997) ~SIZE~0)} assume true; {17378#(<= (+ main_~i~1 99997) ~SIZE~0)} is VALID [2018-11-18 23:02:46,012 INFO L273 TraceCheckUtils]: 187: Hoare triple {17378#(<= (+ main_~i~1 99997) ~SIZE~0)} assume !!(~i~1 < ~SIZE~0 - 1);call #t~mem10 := read~int(~#set~0.base, ~#set~0.offset + 4 * (1 + ~i~1), 4);call write~int(#t~mem10, ~#set~0.base, ~#set~0.offset + 4 * ~i~1, 4);havoc #t~mem10; {17378#(<= (+ main_~i~1 99997) ~SIZE~0)} is VALID [2018-11-18 23:02:46,012 INFO L273 TraceCheckUtils]: 188: Hoare triple {17378#(<= (+ main_~i~1 99997) ~SIZE~0)} #t~post9 := ~i~1;~i~1 := 1 + #t~post9;havoc #t~post9; {17379#(<= (+ main_~i~1 99996) ~SIZE~0)} is VALID [2018-11-18 23:02:46,013 INFO L273 TraceCheckUtils]: 189: Hoare triple {17379#(<= (+ main_~i~1 99996) ~SIZE~0)} assume true; {17379#(<= (+ main_~i~1 99996) ~SIZE~0)} is VALID [2018-11-18 23:02:46,014 INFO L273 TraceCheckUtils]: 190: Hoare triple {17379#(<= (+ main_~i~1 99996) ~SIZE~0)} assume !(~i~1 < ~SIZE~0 - 1); {17372#false} is VALID [2018-11-18 23:02:46,014 INFO L273 TraceCheckUtils]: 191: Hoare triple {17372#false} assume 1 == ~found~0;~i~1 := 0; {17372#false} is VALID [2018-11-18 23:02:46,014 INFO L273 TraceCheckUtils]: 192: Hoare triple {17372#false} assume true; {17372#false} is VALID [2018-11-18 23:02:46,014 INFO L273 TraceCheckUtils]: 193: Hoare triple {17372#false} assume !!(~i~1 < ~SIZE~0 - 1);call #t~mem12 := read~int(~#set~0.base, ~#set~0.offset + 4 * ~i~1, 4); {17372#false} is VALID [2018-11-18 23:02:46,014 INFO L256 TraceCheckUtils]: 194: Hoare triple {17372#false} call __VERIFIER_assert((if #t~mem12 != ~element~0 then 1 else 0)); {17372#false} is VALID [2018-11-18 23:02:46,015 INFO L273 TraceCheckUtils]: 195: Hoare triple {17372#false} ~cond := #in~cond; {17372#false} is VALID [2018-11-18 23:02:46,015 INFO L273 TraceCheckUtils]: 196: Hoare triple {17372#false} assume 0 == ~cond; {17372#false} is VALID [2018-11-18 23:02:46,015 INFO L273 TraceCheckUtils]: 197: Hoare triple {17372#false} assume !false; {17372#false} is VALID [2018-11-18 23:02:46,037 INFO L134 CoverageAnalysis]: Checked inductivity of 978 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 950 trivial. 0 not checked. [2018-11-18 23:02:46,037 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 23:02:46,037 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-18 23:02:46,046 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-18 23:02:46,133 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2018-11-18 23:02:46,133 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-18 23:02:46,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 23:02:46,170 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 23:02:46,474 INFO L256 TraceCheckUtils]: 0: Hoare triple {17371#true} call ULTIMATE.init(); {17371#true} is VALID [2018-11-18 23:02:46,475 INFO L273 TraceCheckUtils]: 1: Hoare triple {17371#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~SIZE~0 := 100000; {17373#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:02:46,475 INFO L273 TraceCheckUtils]: 2: Hoare triple {17373#(<= 100000 ~SIZE~0)} assume true; {17373#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:02:46,476 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {17373#(<= 100000 ~SIZE~0)} {17371#true} #128#return; {17373#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:02:46,476 INFO L256 TraceCheckUtils]: 4: Hoare triple {17373#(<= 100000 ~SIZE~0)} call #t~ret13 := main(); {17373#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:02:46,477 INFO L273 TraceCheckUtils]: 5: Hoare triple {17373#(<= 100000 ~SIZE~0)} havoc ~i~1;havoc ~pos~0;~n~0 := 0;~found~0 := 0;call ~#set~0.base, ~#set~0.offset := #Ultimate.alloc(4 * ~SIZE~0);call ~#values~0.base, ~#values~0.offset := #Ultimate.alloc(4 * ~SIZE~0);havoc ~element~0;havoc ~v~0;~v~0 := 0; {17373#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:02:46,477 INFO L273 TraceCheckUtils]: 6: Hoare triple {17373#(<= 100000 ~SIZE~0)} assume true; {17373#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:02:46,478 INFO L273 TraceCheckUtils]: 7: Hoare triple {17373#(<= 100000 ~SIZE~0)} assume !!(~v~0 < ~SIZE~0);call #t~mem3 := read~int(~#values~0.base, ~#values~0.offset + 4 * ~v~0, 4); {17373#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:02:46,479 INFO L256 TraceCheckUtils]: 8: Hoare triple {17373#(<= 100000 ~SIZE~0)} call #t~ret4 := elem_exists(~#set~0.base, ~#set~0.offset, ~n~0, #t~mem3); {17373#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:02:46,480 INFO L273 TraceCheckUtils]: 9: Hoare triple {17373#(<= 100000 ~SIZE~0)} ~set.base, ~set.offset := #in~set.base, #in~set.offset;~size := #in~size;~value := #in~value;havoc ~i~0;~i~0 := 0; {17373#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:02:46,480 INFO L273 TraceCheckUtils]: 10: Hoare triple {17373#(<= 100000 ~SIZE~0)} assume true; {17373#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:02:46,480 INFO L273 TraceCheckUtils]: 11: Hoare triple {17373#(<= 100000 ~SIZE~0)} assume !(~i~0 < ~size); {17373#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:02:46,481 INFO L273 TraceCheckUtils]: 12: Hoare triple {17373#(<= 100000 ~SIZE~0)} #res := 0; {17373#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:02:46,481 INFO L273 TraceCheckUtils]: 13: Hoare triple {17373#(<= 100000 ~SIZE~0)} assume true; {17373#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:02:46,483 INFO L268 TraceCheckUtils]: 14: Hoare quadruple {17373#(<= 100000 ~SIZE~0)} {17373#(<= 100000 ~SIZE~0)} #132#return; {17373#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:02:46,483 INFO L273 TraceCheckUtils]: 15: Hoare triple {17373#(<= 100000 ~SIZE~0)} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {17373#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:02:46,484 INFO L273 TraceCheckUtils]: 16: Hoare triple {17373#(<= 100000 ~SIZE~0)} assume 1 != #t~ret4;havoc #t~mem3;havoc #t~ret4;call #t~mem5 := read~int(~#values~0.base, ~#values~0.offset + 4 * ~v~0, 4); {17373#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:02:46,485 INFO L256 TraceCheckUtils]: 17: Hoare triple {17373#(<= 100000 ~SIZE~0)} call #t~ret6 := insert(~#set~0.base, ~#set~0.offset, ~n~0, #t~mem5); {17373#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:02:46,485 INFO L273 TraceCheckUtils]: 18: Hoare triple {17373#(<= 100000 ~SIZE~0)} ~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; {17373#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:02:46,486 INFO L273 TraceCheckUtils]: 19: Hoare triple {17373#(<= 100000 ~SIZE~0)} assume true; {17373#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:02:46,487 INFO L268 TraceCheckUtils]: 20: Hoare quadruple {17373#(<= 100000 ~SIZE~0)} {17373#(<= 100000 ~SIZE~0)} #134#return; {17373#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:02:46,487 INFO L273 TraceCheckUtils]: 21: Hoare triple {17373#(<= 100000 ~SIZE~0)} assume -2147483648 <= #t~ret6 && #t~ret6 <= 2147483647;~n~0 := #t~ret6;havoc #t~ret6;havoc #t~mem5; {17373#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:02:46,488 INFO L273 TraceCheckUtils]: 22: Hoare triple {17373#(<= 100000 ~SIZE~0)} #t~post2 := ~v~0;~v~0 := 1 + #t~post2;havoc #t~post2; {17373#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:02:46,488 INFO L273 TraceCheckUtils]: 23: Hoare triple {17373#(<= 100000 ~SIZE~0)} assume true; {17373#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:02:46,489 INFO L273 TraceCheckUtils]: 24: Hoare triple {17373#(<= 100000 ~SIZE~0)} assume !!(~v~0 < ~SIZE~0);call #t~mem3 := read~int(~#values~0.base, ~#values~0.offset + 4 * ~v~0, 4); {17373#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:02:46,490 INFO L256 TraceCheckUtils]: 25: Hoare triple {17373#(<= 100000 ~SIZE~0)} call #t~ret4 := elem_exists(~#set~0.base, ~#set~0.offset, ~n~0, #t~mem3); {17373#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:02:46,490 INFO L273 TraceCheckUtils]: 26: Hoare triple {17373#(<= 100000 ~SIZE~0)} ~set.base, ~set.offset := #in~set.base, #in~set.offset;~size := #in~size;~value := #in~value;havoc ~i~0;~i~0 := 0; {17373#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:02:46,491 INFO L273 TraceCheckUtils]: 27: Hoare triple {17373#(<= 100000 ~SIZE~0)} assume true; {17373#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:02:46,491 INFO L273 TraceCheckUtils]: 28: Hoare triple {17373#(<= 100000 ~SIZE~0)} assume !!(~i~0 < ~size);call #t~mem1 := read~int(~set.base, ~set.offset + 4 * ~i~0, 4); {17373#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:02:46,492 INFO L273 TraceCheckUtils]: 29: Hoare triple {17373#(<= 100000 ~SIZE~0)} assume #t~mem1 == ~value;havoc #t~mem1;#res := 1; {17373#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:02:46,492 INFO L273 TraceCheckUtils]: 30: Hoare triple {17373#(<= 100000 ~SIZE~0)} assume true; {17373#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:02:46,493 INFO L268 TraceCheckUtils]: 31: Hoare quadruple {17373#(<= 100000 ~SIZE~0)} {17373#(<= 100000 ~SIZE~0)} #132#return; {17373#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:02:46,494 INFO L273 TraceCheckUtils]: 32: Hoare triple {17373#(<= 100000 ~SIZE~0)} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {17373#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:02:46,494 INFO L273 TraceCheckUtils]: 33: Hoare triple {17373#(<= 100000 ~SIZE~0)} assume !(1 != #t~ret4);havoc #t~mem3;havoc #t~ret4; {17373#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:02:46,495 INFO L273 TraceCheckUtils]: 34: Hoare triple {17373#(<= 100000 ~SIZE~0)} #t~post2 := ~v~0;~v~0 := 1 + #t~post2;havoc #t~post2; {17373#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:02:46,495 INFO L273 TraceCheckUtils]: 35: Hoare triple {17373#(<= 100000 ~SIZE~0)} assume true; {17373#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:02:46,496 INFO L273 TraceCheckUtils]: 36: Hoare triple {17373#(<= 100000 ~SIZE~0)} assume !!(~v~0 < ~SIZE~0);call #t~mem3 := read~int(~#values~0.base, ~#values~0.offset + 4 * ~v~0, 4); {17373#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:02:46,497 INFO L256 TraceCheckUtils]: 37: Hoare triple {17373#(<= 100000 ~SIZE~0)} call #t~ret4 := elem_exists(~#set~0.base, ~#set~0.offset, ~n~0, #t~mem3); {17373#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:02:46,497 INFO L273 TraceCheckUtils]: 38: Hoare triple {17373#(<= 100000 ~SIZE~0)} ~set.base, ~set.offset := #in~set.base, #in~set.offset;~size := #in~size;~value := #in~value;havoc ~i~0;~i~0 := 0; {17373#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:02:46,498 INFO L273 TraceCheckUtils]: 39: Hoare triple {17373#(<= 100000 ~SIZE~0)} assume true; {17373#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:02:46,498 INFO L273 TraceCheckUtils]: 40: Hoare triple {17373#(<= 100000 ~SIZE~0)} assume !!(~i~0 < ~size);call #t~mem1 := read~int(~set.base, ~set.offset + 4 * ~i~0, 4); {17373#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:02:46,499 INFO L273 TraceCheckUtils]: 41: Hoare triple {17373#(<= 100000 ~SIZE~0)} assume #t~mem1 == ~value;havoc #t~mem1;#res := 1; {17373#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:02:46,499 INFO L273 TraceCheckUtils]: 42: Hoare triple {17373#(<= 100000 ~SIZE~0)} assume true; {17373#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:02:46,500 INFO L268 TraceCheckUtils]: 43: Hoare quadruple {17373#(<= 100000 ~SIZE~0)} {17373#(<= 100000 ~SIZE~0)} #132#return; {17373#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:02:46,501 INFO L273 TraceCheckUtils]: 44: Hoare triple {17373#(<= 100000 ~SIZE~0)} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {17373#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:02:46,501 INFO L273 TraceCheckUtils]: 45: Hoare triple {17373#(<= 100000 ~SIZE~0)} assume !(1 != #t~ret4);havoc #t~mem3;havoc #t~ret4; {17373#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:02:46,502 INFO L273 TraceCheckUtils]: 46: Hoare triple {17373#(<= 100000 ~SIZE~0)} #t~post2 := ~v~0;~v~0 := 1 + #t~post2;havoc #t~post2; {17373#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:02:46,502 INFO L273 TraceCheckUtils]: 47: Hoare triple {17373#(<= 100000 ~SIZE~0)} assume true; {17373#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:02:46,503 INFO L273 TraceCheckUtils]: 48: Hoare triple {17373#(<= 100000 ~SIZE~0)} assume !!(~v~0 < ~SIZE~0);call #t~mem3 := read~int(~#values~0.base, ~#values~0.offset + 4 * ~v~0, 4); {17373#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:02:46,504 INFO L256 TraceCheckUtils]: 49: Hoare triple {17373#(<= 100000 ~SIZE~0)} call #t~ret4 := elem_exists(~#set~0.base, ~#set~0.offset, ~n~0, #t~mem3); {17373#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:02:46,504 INFO L273 TraceCheckUtils]: 50: Hoare triple {17373#(<= 100000 ~SIZE~0)} ~set.base, ~set.offset := #in~set.base, #in~set.offset;~size := #in~size;~value := #in~value;havoc ~i~0;~i~0 := 0; {17373#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:02:46,505 INFO L273 TraceCheckUtils]: 51: Hoare triple {17373#(<= 100000 ~SIZE~0)} assume true; {17373#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:02:46,505 INFO L273 TraceCheckUtils]: 52: Hoare triple {17373#(<= 100000 ~SIZE~0)} assume !!(~i~0 < ~size);call #t~mem1 := read~int(~set.base, ~set.offset + 4 * ~i~0, 4); {17373#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:02:46,506 INFO L273 TraceCheckUtils]: 53: Hoare triple {17373#(<= 100000 ~SIZE~0)} assume #t~mem1 == ~value;havoc #t~mem1;#res := 1; {17373#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:02:46,506 INFO L273 TraceCheckUtils]: 54: Hoare triple {17373#(<= 100000 ~SIZE~0)} assume true; {17373#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:02:46,507 INFO L268 TraceCheckUtils]: 55: Hoare quadruple {17373#(<= 100000 ~SIZE~0)} {17373#(<= 100000 ~SIZE~0)} #132#return; {17373#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:02:46,508 INFO L273 TraceCheckUtils]: 56: Hoare triple {17373#(<= 100000 ~SIZE~0)} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {17373#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:02:46,508 INFO L273 TraceCheckUtils]: 57: Hoare triple {17373#(<= 100000 ~SIZE~0)} assume !(1 != #t~ret4);havoc #t~mem3;havoc #t~ret4; {17373#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:02:46,509 INFO L273 TraceCheckUtils]: 58: Hoare triple {17373#(<= 100000 ~SIZE~0)} #t~post2 := ~v~0;~v~0 := 1 + #t~post2;havoc #t~post2; {17373#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:02:46,509 INFO L273 TraceCheckUtils]: 59: Hoare triple {17373#(<= 100000 ~SIZE~0)} assume true; {17373#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:02:46,510 INFO L273 TraceCheckUtils]: 60: Hoare triple {17373#(<= 100000 ~SIZE~0)} assume !!(~v~0 < ~SIZE~0);call #t~mem3 := read~int(~#values~0.base, ~#values~0.offset + 4 * ~v~0, 4); {17373#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:02:46,511 INFO L256 TraceCheckUtils]: 61: Hoare triple {17373#(<= 100000 ~SIZE~0)} call #t~ret4 := elem_exists(~#set~0.base, ~#set~0.offset, ~n~0, #t~mem3); {17373#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:02:46,511 INFO L273 TraceCheckUtils]: 62: Hoare triple {17373#(<= 100000 ~SIZE~0)} ~set.base, ~set.offset := #in~set.base, #in~set.offset;~size := #in~size;~value := #in~value;havoc ~i~0;~i~0 := 0; {17373#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:02:46,512 INFO L273 TraceCheckUtils]: 63: Hoare triple {17373#(<= 100000 ~SIZE~0)} assume true; {17373#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:02:46,512 INFO L273 TraceCheckUtils]: 64: Hoare triple {17373#(<= 100000 ~SIZE~0)} assume !!(~i~0 < ~size);call #t~mem1 := read~int(~set.base, ~set.offset + 4 * ~i~0, 4); {17373#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:02:46,513 INFO L273 TraceCheckUtils]: 65: Hoare triple {17373#(<= 100000 ~SIZE~0)} assume #t~mem1 == ~value;havoc #t~mem1;#res := 1; {17373#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:02:46,513 INFO L273 TraceCheckUtils]: 66: Hoare triple {17373#(<= 100000 ~SIZE~0)} assume true; {17373#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:02:46,514 INFO L268 TraceCheckUtils]: 67: Hoare quadruple {17373#(<= 100000 ~SIZE~0)} {17373#(<= 100000 ~SIZE~0)} #132#return; {17373#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:02:46,515 INFO L273 TraceCheckUtils]: 68: Hoare triple {17373#(<= 100000 ~SIZE~0)} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {17373#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:02:46,515 INFO L273 TraceCheckUtils]: 69: Hoare triple {17373#(<= 100000 ~SIZE~0)} assume !(1 != #t~ret4);havoc #t~mem3;havoc #t~ret4; {17373#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:02:46,516 INFO L273 TraceCheckUtils]: 70: Hoare triple {17373#(<= 100000 ~SIZE~0)} #t~post2 := ~v~0;~v~0 := 1 + #t~post2;havoc #t~post2; {17373#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:02:46,537 INFO L273 TraceCheckUtils]: 71: Hoare triple {17373#(<= 100000 ~SIZE~0)} assume true; {17373#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:02:46,546 INFO L273 TraceCheckUtils]: 72: Hoare triple {17373#(<= 100000 ~SIZE~0)} assume !!(~v~0 < ~SIZE~0);call #t~mem3 := read~int(~#values~0.base, ~#values~0.offset + 4 * ~v~0, 4); {17373#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:02:46,560 INFO L256 TraceCheckUtils]: 73: Hoare triple {17373#(<= 100000 ~SIZE~0)} call #t~ret4 := elem_exists(~#set~0.base, ~#set~0.offset, ~n~0, #t~mem3); {17373#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:02:46,569 INFO L273 TraceCheckUtils]: 74: Hoare triple {17373#(<= 100000 ~SIZE~0)} ~set.base, ~set.offset := #in~set.base, #in~set.offset;~size := #in~size;~value := #in~value;havoc ~i~0;~i~0 := 0; {17373#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:02:46,582 INFO L273 TraceCheckUtils]: 75: Hoare triple {17373#(<= 100000 ~SIZE~0)} assume true; {17373#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:02:46,591 INFO L273 TraceCheckUtils]: 76: Hoare triple {17373#(<= 100000 ~SIZE~0)} assume !!(~i~0 < ~size);call #t~mem1 := read~int(~set.base, ~set.offset + 4 * ~i~0, 4); {17373#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:02:46,604 INFO L273 TraceCheckUtils]: 77: Hoare triple {17373#(<= 100000 ~SIZE~0)} assume #t~mem1 == ~value;havoc #t~mem1;#res := 1; {17373#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:02:46,612 INFO L273 TraceCheckUtils]: 78: Hoare triple {17373#(<= 100000 ~SIZE~0)} assume true; {17373#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:02:46,629 INFO L268 TraceCheckUtils]: 79: Hoare quadruple {17373#(<= 100000 ~SIZE~0)} {17373#(<= 100000 ~SIZE~0)} #132#return; {17373#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:02:46,638 INFO L273 TraceCheckUtils]: 80: Hoare triple {17373#(<= 100000 ~SIZE~0)} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {17373#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:02:46,651 INFO L273 TraceCheckUtils]: 81: Hoare triple {17373#(<= 100000 ~SIZE~0)} assume !(1 != #t~ret4);havoc #t~mem3;havoc #t~ret4; {17373#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:02:46,660 INFO L273 TraceCheckUtils]: 82: Hoare triple {17373#(<= 100000 ~SIZE~0)} #t~post2 := ~v~0;~v~0 := 1 + #t~post2;havoc #t~post2; {17373#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:02:46,672 INFO L273 TraceCheckUtils]: 83: Hoare triple {17373#(<= 100000 ~SIZE~0)} assume true; {17373#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:02:46,685 INFO L273 TraceCheckUtils]: 84: Hoare triple {17373#(<= 100000 ~SIZE~0)} assume !!(~v~0 < ~SIZE~0);call #t~mem3 := read~int(~#values~0.base, ~#values~0.offset + 4 * ~v~0, 4); {17373#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:02:46,698 INFO L256 TraceCheckUtils]: 85: Hoare triple {17373#(<= 100000 ~SIZE~0)} call #t~ret4 := elem_exists(~#set~0.base, ~#set~0.offset, ~n~0, #t~mem3); {17373#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:02:46,711 INFO L273 TraceCheckUtils]: 86: Hoare triple {17373#(<= 100000 ~SIZE~0)} ~set.base, ~set.offset := #in~set.base, #in~set.offset;~size := #in~size;~value := #in~value;havoc ~i~0;~i~0 := 0; {17373#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:02:46,723 INFO L273 TraceCheckUtils]: 87: Hoare triple {17373#(<= 100000 ~SIZE~0)} assume true; {17373#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:02:46,736 INFO L273 TraceCheckUtils]: 88: Hoare triple {17373#(<= 100000 ~SIZE~0)} assume !!(~i~0 < ~size);call #t~mem1 := read~int(~set.base, ~set.offset + 4 * ~i~0, 4); {17373#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:02:46,748 INFO L273 TraceCheckUtils]: 89: Hoare triple {17373#(<= 100000 ~SIZE~0)} assume #t~mem1 == ~value;havoc #t~mem1;#res := 1; {17373#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:02:46,761 INFO L273 TraceCheckUtils]: 90: Hoare triple {17373#(<= 100000 ~SIZE~0)} assume true; {17373#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:02:46,781 INFO L268 TraceCheckUtils]: 91: Hoare quadruple {17373#(<= 100000 ~SIZE~0)} {17373#(<= 100000 ~SIZE~0)} #132#return; {17373#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:02:46,789 INFO L273 TraceCheckUtils]: 92: Hoare triple {17373#(<= 100000 ~SIZE~0)} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {17373#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:02:46,802 INFO L273 TraceCheckUtils]: 93: Hoare triple {17373#(<= 100000 ~SIZE~0)} assume !(1 != #t~ret4);havoc #t~mem3;havoc #t~ret4; {17373#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:02:46,803 INFO L273 TraceCheckUtils]: 94: Hoare triple {17373#(<= 100000 ~SIZE~0)} #t~post2 := ~v~0;~v~0 := 1 + #t~post2;havoc #t~post2; {17373#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:02:46,804 INFO L273 TraceCheckUtils]: 95: Hoare triple {17373#(<= 100000 ~SIZE~0)} assume true; {17373#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:02:46,804 INFO L273 TraceCheckUtils]: 96: Hoare triple {17373#(<= 100000 ~SIZE~0)} assume !!(~v~0 < ~SIZE~0);call #t~mem3 := read~int(~#values~0.base, ~#values~0.offset + 4 * ~v~0, 4); {17373#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:02:46,805 INFO L256 TraceCheckUtils]: 97: Hoare triple {17373#(<= 100000 ~SIZE~0)} call #t~ret4 := elem_exists(~#set~0.base, ~#set~0.offset, ~n~0, #t~mem3); {17373#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:02:46,806 INFO L273 TraceCheckUtils]: 98: Hoare triple {17373#(<= 100000 ~SIZE~0)} ~set.base, ~set.offset := #in~set.base, #in~set.offset;~size := #in~size;~value := #in~value;havoc ~i~0;~i~0 := 0; {17373#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:02:46,806 INFO L273 TraceCheckUtils]: 99: Hoare triple {17373#(<= 100000 ~SIZE~0)} assume true; {17373#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:02:46,809 INFO L273 TraceCheckUtils]: 100: Hoare triple {17373#(<= 100000 ~SIZE~0)} assume !!(~i~0 < ~size);call #t~mem1 := read~int(~set.base, ~set.offset + 4 * ~i~0, 4); {17373#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:02:46,809 INFO L273 TraceCheckUtils]: 101: Hoare triple {17373#(<= 100000 ~SIZE~0)} assume #t~mem1 == ~value;havoc #t~mem1;#res := 1; {17373#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:02:46,811 INFO L273 TraceCheckUtils]: 102: Hoare triple {17373#(<= 100000 ~SIZE~0)} assume true; {17373#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:02:46,813 INFO L268 TraceCheckUtils]: 103: Hoare quadruple {17373#(<= 100000 ~SIZE~0)} {17373#(<= 100000 ~SIZE~0)} #132#return; {17373#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:02:46,813 INFO L273 TraceCheckUtils]: 104: Hoare triple {17373#(<= 100000 ~SIZE~0)} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {17373#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:02:46,813 INFO L273 TraceCheckUtils]: 105: Hoare triple {17373#(<= 100000 ~SIZE~0)} assume !(1 != #t~ret4);havoc #t~mem3;havoc #t~ret4; {17373#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:02:46,814 INFO L273 TraceCheckUtils]: 106: Hoare triple {17373#(<= 100000 ~SIZE~0)} #t~post2 := ~v~0;~v~0 := 1 + #t~post2;havoc #t~post2; {17373#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:02:46,814 INFO L273 TraceCheckUtils]: 107: Hoare triple {17373#(<= 100000 ~SIZE~0)} assume true; {17373#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:02:46,814 INFO L273 TraceCheckUtils]: 108: Hoare triple {17373#(<= 100000 ~SIZE~0)} assume !!(~v~0 < ~SIZE~0);call #t~mem3 := read~int(~#values~0.base, ~#values~0.offset + 4 * ~v~0, 4); {17373#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:02:46,815 INFO L256 TraceCheckUtils]: 109: Hoare triple {17373#(<= 100000 ~SIZE~0)} call #t~ret4 := elem_exists(~#set~0.base, ~#set~0.offset, ~n~0, #t~mem3); {17373#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:02:46,815 INFO L273 TraceCheckUtils]: 110: Hoare triple {17373#(<= 100000 ~SIZE~0)} ~set.base, ~set.offset := #in~set.base, #in~set.offset;~size := #in~size;~value := #in~value;havoc ~i~0;~i~0 := 0; {17373#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:02:46,815 INFO L273 TraceCheckUtils]: 111: Hoare triple {17373#(<= 100000 ~SIZE~0)} assume true; {17373#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:02:46,816 INFO L273 TraceCheckUtils]: 112: Hoare triple {17373#(<= 100000 ~SIZE~0)} assume !!(~i~0 < ~size);call #t~mem1 := read~int(~set.base, ~set.offset + 4 * ~i~0, 4); {17373#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:02:46,816 INFO L273 TraceCheckUtils]: 113: Hoare triple {17373#(<= 100000 ~SIZE~0)} assume #t~mem1 == ~value;havoc #t~mem1;#res := 1; {17373#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:02:46,817 INFO L273 TraceCheckUtils]: 114: Hoare triple {17373#(<= 100000 ~SIZE~0)} assume true; {17373#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:02:46,818 INFO L268 TraceCheckUtils]: 115: Hoare quadruple {17373#(<= 100000 ~SIZE~0)} {17373#(<= 100000 ~SIZE~0)} #132#return; {17373#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:02:46,818 INFO L273 TraceCheckUtils]: 116: Hoare triple {17373#(<= 100000 ~SIZE~0)} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {17373#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:02:46,819 INFO L273 TraceCheckUtils]: 117: Hoare triple {17373#(<= 100000 ~SIZE~0)} assume !(1 != #t~ret4);havoc #t~mem3;havoc #t~ret4; {17373#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:02:46,819 INFO L273 TraceCheckUtils]: 118: Hoare triple {17373#(<= 100000 ~SIZE~0)} #t~post2 := ~v~0;~v~0 := 1 + #t~post2;havoc #t~post2; {17373#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:02:46,820 INFO L273 TraceCheckUtils]: 119: Hoare triple {17373#(<= 100000 ~SIZE~0)} assume true; {17373#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:02:46,820 INFO L273 TraceCheckUtils]: 120: Hoare triple {17373#(<= 100000 ~SIZE~0)} assume !!(~v~0 < ~SIZE~0);call #t~mem3 := read~int(~#values~0.base, ~#values~0.offset + 4 * ~v~0, 4); {17373#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:02:46,821 INFO L256 TraceCheckUtils]: 121: Hoare triple {17373#(<= 100000 ~SIZE~0)} call #t~ret4 := elem_exists(~#set~0.base, ~#set~0.offset, ~n~0, #t~mem3); {17373#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:02:46,822 INFO L273 TraceCheckUtils]: 122: Hoare triple {17373#(<= 100000 ~SIZE~0)} ~set.base, ~set.offset := #in~set.base, #in~set.offset;~size := #in~size;~value := #in~value;havoc ~i~0;~i~0 := 0; {17373#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:02:46,822 INFO L273 TraceCheckUtils]: 123: Hoare triple {17373#(<= 100000 ~SIZE~0)} assume true; {17373#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:02:46,823 INFO L273 TraceCheckUtils]: 124: Hoare triple {17373#(<= 100000 ~SIZE~0)} assume !!(~i~0 < ~size);call #t~mem1 := read~int(~set.base, ~set.offset + 4 * ~i~0, 4); {17373#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:02:46,823 INFO L273 TraceCheckUtils]: 125: Hoare triple {17373#(<= 100000 ~SIZE~0)} assume #t~mem1 == ~value;havoc #t~mem1;#res := 1; {17373#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:02:46,824 INFO L273 TraceCheckUtils]: 126: Hoare triple {17373#(<= 100000 ~SIZE~0)} assume true; {17373#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:02:46,825 INFO L268 TraceCheckUtils]: 127: Hoare quadruple {17373#(<= 100000 ~SIZE~0)} {17373#(<= 100000 ~SIZE~0)} #132#return; {17373#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:02:46,825 INFO L273 TraceCheckUtils]: 128: Hoare triple {17373#(<= 100000 ~SIZE~0)} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {17373#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:02:46,826 INFO L273 TraceCheckUtils]: 129: Hoare triple {17373#(<= 100000 ~SIZE~0)} assume !(1 != #t~ret4);havoc #t~mem3;havoc #t~ret4; {17373#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:02:46,826 INFO L273 TraceCheckUtils]: 130: Hoare triple {17373#(<= 100000 ~SIZE~0)} #t~post2 := ~v~0;~v~0 := 1 + #t~post2;havoc #t~post2; {17373#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:02:46,827 INFO L273 TraceCheckUtils]: 131: Hoare triple {17373#(<= 100000 ~SIZE~0)} assume true; {17373#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:02:46,827 INFO L273 TraceCheckUtils]: 132: Hoare triple {17373#(<= 100000 ~SIZE~0)} assume !!(~v~0 < ~SIZE~0);call #t~mem3 := read~int(~#values~0.base, ~#values~0.offset + 4 * ~v~0, 4); {17373#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:02:46,828 INFO L256 TraceCheckUtils]: 133: Hoare triple {17373#(<= 100000 ~SIZE~0)} call #t~ret4 := elem_exists(~#set~0.base, ~#set~0.offset, ~n~0, #t~mem3); {17373#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:02:46,829 INFO L273 TraceCheckUtils]: 134: Hoare triple {17373#(<= 100000 ~SIZE~0)} ~set.base, ~set.offset := #in~set.base, #in~set.offset;~size := #in~size;~value := #in~value;havoc ~i~0;~i~0 := 0; {17373#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:02:46,829 INFO L273 TraceCheckUtils]: 135: Hoare triple {17373#(<= 100000 ~SIZE~0)} assume true; {17373#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:02:46,829 INFO L273 TraceCheckUtils]: 136: Hoare triple {17373#(<= 100000 ~SIZE~0)} assume !!(~i~0 < ~size);call #t~mem1 := read~int(~set.base, ~set.offset + 4 * ~i~0, 4); {17373#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:02:46,830 INFO L273 TraceCheckUtils]: 137: Hoare triple {17373#(<= 100000 ~SIZE~0)} assume #t~mem1 == ~value;havoc #t~mem1;#res := 1; {17373#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:02:46,830 INFO L273 TraceCheckUtils]: 138: Hoare triple {17373#(<= 100000 ~SIZE~0)} assume true; {17373#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:02:46,832 INFO L268 TraceCheckUtils]: 139: Hoare quadruple {17373#(<= 100000 ~SIZE~0)} {17373#(<= 100000 ~SIZE~0)} #132#return; {17373#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:02:46,832 INFO L273 TraceCheckUtils]: 140: Hoare triple {17373#(<= 100000 ~SIZE~0)} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {17373#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:02:46,832 INFO L273 TraceCheckUtils]: 141: Hoare triple {17373#(<= 100000 ~SIZE~0)} assume !(1 != #t~ret4);havoc #t~mem3;havoc #t~ret4; {17373#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:02:46,833 INFO L273 TraceCheckUtils]: 142: Hoare triple {17373#(<= 100000 ~SIZE~0)} #t~post2 := ~v~0;~v~0 := 1 + #t~post2;havoc #t~post2; {17373#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:02:46,833 INFO L273 TraceCheckUtils]: 143: Hoare triple {17373#(<= 100000 ~SIZE~0)} assume true; {17373#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:02:46,834 INFO L273 TraceCheckUtils]: 144: Hoare triple {17373#(<= 100000 ~SIZE~0)} assume !!(~v~0 < ~SIZE~0);call #t~mem3 := read~int(~#values~0.base, ~#values~0.offset + 4 * ~v~0, 4); {17373#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:02:46,835 INFO L256 TraceCheckUtils]: 145: Hoare triple {17373#(<= 100000 ~SIZE~0)} call #t~ret4 := elem_exists(~#set~0.base, ~#set~0.offset, ~n~0, #t~mem3); {17373#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:02:46,835 INFO L273 TraceCheckUtils]: 146: Hoare triple {17373#(<= 100000 ~SIZE~0)} ~set.base, ~set.offset := #in~set.base, #in~set.offset;~size := #in~size;~value := #in~value;havoc ~i~0;~i~0 := 0; {17373#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:02:46,836 INFO L273 TraceCheckUtils]: 147: Hoare triple {17373#(<= 100000 ~SIZE~0)} assume true; {17373#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:02:46,836 INFO L273 TraceCheckUtils]: 148: Hoare triple {17373#(<= 100000 ~SIZE~0)} assume !!(~i~0 < ~size);call #t~mem1 := read~int(~set.base, ~set.offset + 4 * ~i~0, 4); {17373#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:02:46,837 INFO L273 TraceCheckUtils]: 149: Hoare triple {17373#(<= 100000 ~SIZE~0)} assume #t~mem1 == ~value;havoc #t~mem1;#res := 1; {17373#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:02:46,837 INFO L273 TraceCheckUtils]: 150: Hoare triple {17373#(<= 100000 ~SIZE~0)} assume true; {17373#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:02:46,838 INFO L268 TraceCheckUtils]: 151: Hoare quadruple {17373#(<= 100000 ~SIZE~0)} {17373#(<= 100000 ~SIZE~0)} #132#return; {17373#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:02:46,839 INFO L273 TraceCheckUtils]: 152: Hoare triple {17373#(<= 100000 ~SIZE~0)} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {17373#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:02:46,839 INFO L273 TraceCheckUtils]: 153: Hoare triple {17373#(<= 100000 ~SIZE~0)} assume !(1 != #t~ret4);havoc #t~mem3;havoc #t~ret4; {17373#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:02:46,840 INFO L273 TraceCheckUtils]: 154: Hoare triple {17373#(<= 100000 ~SIZE~0)} #t~post2 := ~v~0;~v~0 := 1 + #t~post2;havoc #t~post2; {17373#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:02:46,840 INFO L273 TraceCheckUtils]: 155: Hoare triple {17373#(<= 100000 ~SIZE~0)} assume true; {17373#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:02:46,841 INFO L273 TraceCheckUtils]: 156: Hoare triple {17373#(<= 100000 ~SIZE~0)} assume !!(~v~0 < ~SIZE~0);call #t~mem3 := read~int(~#values~0.base, ~#values~0.offset + 4 * ~v~0, 4); {17373#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:02:46,842 INFO L256 TraceCheckUtils]: 157: Hoare triple {17373#(<= 100000 ~SIZE~0)} call #t~ret4 := elem_exists(~#set~0.base, ~#set~0.offset, ~n~0, #t~mem3); {17373#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:02:46,842 INFO L273 TraceCheckUtils]: 158: Hoare triple {17373#(<= 100000 ~SIZE~0)} ~set.base, ~set.offset := #in~set.base, #in~set.offset;~size := #in~size;~value := #in~value;havoc ~i~0;~i~0 := 0; {17373#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:02:46,843 INFO L273 TraceCheckUtils]: 159: Hoare triple {17373#(<= 100000 ~SIZE~0)} assume true; {17373#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:02:46,843 INFO L273 TraceCheckUtils]: 160: Hoare triple {17373#(<= 100000 ~SIZE~0)} assume !!(~i~0 < ~size);call #t~mem1 := read~int(~set.base, ~set.offset + 4 * ~i~0, 4); {17373#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:02:46,844 INFO L273 TraceCheckUtils]: 161: Hoare triple {17373#(<= 100000 ~SIZE~0)} assume #t~mem1 == ~value;havoc #t~mem1;#res := 1; {17373#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:02:46,844 INFO L273 TraceCheckUtils]: 162: Hoare triple {17373#(<= 100000 ~SIZE~0)} assume true; {17373#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:02:46,845 INFO L268 TraceCheckUtils]: 163: Hoare quadruple {17373#(<= 100000 ~SIZE~0)} {17373#(<= 100000 ~SIZE~0)} #132#return; {17373#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:02:46,846 INFO L273 TraceCheckUtils]: 164: Hoare triple {17373#(<= 100000 ~SIZE~0)} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {17373#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:02:46,846 INFO L273 TraceCheckUtils]: 165: Hoare triple {17373#(<= 100000 ~SIZE~0)} assume !(1 != #t~ret4);havoc #t~mem3;havoc #t~ret4; {17373#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:02:46,847 INFO L273 TraceCheckUtils]: 166: Hoare triple {17373#(<= 100000 ~SIZE~0)} #t~post2 := ~v~0;~v~0 := 1 + #t~post2;havoc #t~post2; {17373#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:02:46,847 INFO L273 TraceCheckUtils]: 167: Hoare triple {17373#(<= 100000 ~SIZE~0)} assume true; {17373#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:02:46,848 INFO L273 TraceCheckUtils]: 168: Hoare triple {17373#(<= 100000 ~SIZE~0)} assume !(~v~0 < ~SIZE~0); {17373#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:02:46,848 INFO L273 TraceCheckUtils]: 169: Hoare triple {17373#(<= 100000 ~SIZE~0)} ~i~1 := 0; {17890#(and (<= main_~i~1 0) (<= 100000 ~SIZE~0))} is VALID [2018-11-18 23:02:46,849 INFO L273 TraceCheckUtils]: 170: Hoare triple {17890#(and (<= main_~i~1 0) (<= 100000 ~SIZE~0))} assume true; {17890#(and (<= main_~i~1 0) (<= 100000 ~SIZE~0))} is VALID [2018-11-18 23:02:46,849 INFO L273 TraceCheckUtils]: 171: Hoare triple {17890#(and (<= main_~i~1 0) (<= 100000 ~SIZE~0))} assume !!(~i~1 < ~SIZE~0 && 1 != ~found~0);call #t~mem8 := read~int(~#set~0.base, ~#set~0.offset + 4 * ~i~1, 4); {17890#(and (<= main_~i~1 0) (<= 100000 ~SIZE~0))} is VALID [2018-11-18 23:02:46,850 INFO L273 TraceCheckUtils]: 172: Hoare triple {17890#(and (<= main_~i~1 0) (<= 100000 ~SIZE~0))} assume #t~mem8 == ~element~0;havoc #t~mem8;~found~0 := 1;~pos~0 := ~i~1; {17900#(and (<= main_~pos~0 0) (<= 100000 ~SIZE~0))} is VALID [2018-11-18 23:02:46,851 INFO L273 TraceCheckUtils]: 173: Hoare triple {17900#(and (<= main_~pos~0 0) (<= 100000 ~SIZE~0))} #t~post7 := ~i~1;~i~1 := 1 + #t~post7;havoc #t~post7; {17900#(and (<= main_~pos~0 0) (<= 100000 ~SIZE~0))} is VALID [2018-11-18 23:02:46,851 INFO L273 TraceCheckUtils]: 174: Hoare triple {17900#(and (<= main_~pos~0 0) (<= 100000 ~SIZE~0))} assume true; {17900#(and (<= main_~pos~0 0) (<= 100000 ~SIZE~0))} is VALID [2018-11-18 23:02:46,852 INFO L273 TraceCheckUtils]: 175: Hoare triple {17900#(and (<= main_~pos~0 0) (<= 100000 ~SIZE~0))} assume !(~i~1 < ~SIZE~0 && 1 != ~found~0); {17900#(and (<= main_~pos~0 0) (<= 100000 ~SIZE~0))} is VALID [2018-11-18 23:02:46,853 INFO L273 TraceCheckUtils]: 176: Hoare triple {17900#(and (<= main_~pos~0 0) (<= 100000 ~SIZE~0))} assume 1 == ~found~0;~i~1 := ~pos~0; {17890#(and (<= main_~i~1 0) (<= 100000 ~SIZE~0))} is VALID [2018-11-18 23:02:46,853 INFO L273 TraceCheckUtils]: 177: Hoare triple {17890#(and (<= main_~i~1 0) (<= 100000 ~SIZE~0))} assume true; {17890#(and (<= main_~i~1 0) (<= 100000 ~SIZE~0))} is VALID [2018-11-18 23:02:46,854 INFO L273 TraceCheckUtils]: 178: Hoare triple {17890#(and (<= main_~i~1 0) (<= 100000 ~SIZE~0))} assume !!(~i~1 < ~SIZE~0 - 1);call #t~mem10 := read~int(~#set~0.base, ~#set~0.offset + 4 * (1 + ~i~1), 4);call write~int(#t~mem10, ~#set~0.base, ~#set~0.offset + 4 * ~i~1, 4);havoc #t~mem10; {17890#(and (<= main_~i~1 0) (<= 100000 ~SIZE~0))} is VALID [2018-11-18 23:02:46,855 INFO L273 TraceCheckUtils]: 179: Hoare triple {17890#(and (<= main_~i~1 0) (<= 100000 ~SIZE~0))} #t~post9 := ~i~1;~i~1 := 1 + #t~post9;havoc #t~post9; {17922#(and (<= main_~i~1 1) (<= 100000 ~SIZE~0))} is VALID [2018-11-18 23:02:46,855 INFO L273 TraceCheckUtils]: 180: Hoare triple {17922#(and (<= main_~i~1 1) (<= 100000 ~SIZE~0))} assume true; {17922#(and (<= main_~i~1 1) (<= 100000 ~SIZE~0))} is VALID [2018-11-18 23:02:46,856 INFO L273 TraceCheckUtils]: 181: Hoare triple {17922#(and (<= main_~i~1 1) (<= 100000 ~SIZE~0))} assume !!(~i~1 < ~SIZE~0 - 1);call #t~mem10 := read~int(~#set~0.base, ~#set~0.offset + 4 * (1 + ~i~1), 4);call write~int(#t~mem10, ~#set~0.base, ~#set~0.offset + 4 * ~i~1, 4);havoc #t~mem10; {17922#(and (<= main_~i~1 1) (<= 100000 ~SIZE~0))} is VALID [2018-11-18 23:02:46,857 INFO L273 TraceCheckUtils]: 182: Hoare triple {17922#(and (<= main_~i~1 1) (<= 100000 ~SIZE~0))} #t~post9 := ~i~1;~i~1 := 1 + #t~post9;havoc #t~post9; {17932#(and (<= main_~i~1 2) (<= 100000 ~SIZE~0))} is VALID [2018-11-18 23:02:46,857 INFO L273 TraceCheckUtils]: 183: Hoare triple {17932#(and (<= main_~i~1 2) (<= 100000 ~SIZE~0))} assume true; {17932#(and (<= main_~i~1 2) (<= 100000 ~SIZE~0))} is VALID [2018-11-18 23:02:46,858 INFO L273 TraceCheckUtils]: 184: Hoare triple {17932#(and (<= main_~i~1 2) (<= 100000 ~SIZE~0))} assume !!(~i~1 < ~SIZE~0 - 1);call #t~mem10 := read~int(~#set~0.base, ~#set~0.offset + 4 * (1 + ~i~1), 4);call write~int(#t~mem10, ~#set~0.base, ~#set~0.offset + 4 * ~i~1, 4);havoc #t~mem10; {17932#(and (<= main_~i~1 2) (<= 100000 ~SIZE~0))} is VALID [2018-11-18 23:02:46,859 INFO L273 TraceCheckUtils]: 185: Hoare triple {17932#(and (<= main_~i~1 2) (<= 100000 ~SIZE~0))} #t~post9 := ~i~1;~i~1 := 1 + #t~post9;havoc #t~post9; {17942#(and (<= main_~i~1 3) (<= 100000 ~SIZE~0))} is VALID [2018-11-18 23:02:46,860 INFO L273 TraceCheckUtils]: 186: Hoare triple {17942#(and (<= main_~i~1 3) (<= 100000 ~SIZE~0))} assume true; {17942#(and (<= main_~i~1 3) (<= 100000 ~SIZE~0))} is VALID [2018-11-18 23:02:46,860 INFO L273 TraceCheckUtils]: 187: Hoare triple {17942#(and (<= main_~i~1 3) (<= 100000 ~SIZE~0))} assume !!(~i~1 < ~SIZE~0 - 1);call #t~mem10 := read~int(~#set~0.base, ~#set~0.offset + 4 * (1 + ~i~1), 4);call write~int(#t~mem10, ~#set~0.base, ~#set~0.offset + 4 * ~i~1, 4);havoc #t~mem10; {17942#(and (<= main_~i~1 3) (<= 100000 ~SIZE~0))} is VALID [2018-11-18 23:02:46,861 INFO L273 TraceCheckUtils]: 188: Hoare triple {17942#(and (<= main_~i~1 3) (<= 100000 ~SIZE~0))} #t~post9 := ~i~1;~i~1 := 1 + #t~post9;havoc #t~post9; {17952#(and (<= main_~i~1 4) (<= 100000 ~SIZE~0))} is VALID [2018-11-18 23:02:46,862 INFO L273 TraceCheckUtils]: 189: Hoare triple {17952#(and (<= main_~i~1 4) (<= 100000 ~SIZE~0))} assume true; {17952#(and (<= main_~i~1 4) (<= 100000 ~SIZE~0))} is VALID [2018-11-18 23:02:46,862 INFO L273 TraceCheckUtils]: 190: Hoare triple {17952#(and (<= main_~i~1 4) (<= 100000 ~SIZE~0))} assume !(~i~1 < ~SIZE~0 - 1); {17372#false} is VALID [2018-11-18 23:02:46,863 INFO L273 TraceCheckUtils]: 191: Hoare triple {17372#false} assume 1 == ~found~0;~i~1 := 0; {17372#false} is VALID [2018-11-18 23:02:46,863 INFO L273 TraceCheckUtils]: 192: Hoare triple {17372#false} assume true; {17372#false} is VALID [2018-11-18 23:02:46,863 INFO L273 TraceCheckUtils]: 193: Hoare triple {17372#false} assume !!(~i~1 < ~SIZE~0 - 1);call #t~mem12 := read~int(~#set~0.base, ~#set~0.offset + 4 * ~i~1, 4); {17372#false} is VALID [2018-11-18 23:02:46,863 INFO L256 TraceCheckUtils]: 194: Hoare triple {17372#false} call __VERIFIER_assert((if #t~mem12 != ~element~0 then 1 else 0)); {17372#false} is VALID [2018-11-18 23:02:46,863 INFO L273 TraceCheckUtils]: 195: Hoare triple {17372#false} ~cond := #in~cond; {17372#false} is VALID [2018-11-18 23:02:46,863 INFO L273 TraceCheckUtils]: 196: Hoare triple {17372#false} assume 0 == ~cond; {17372#false} is VALID [2018-11-18 23:02:46,864 INFO L273 TraceCheckUtils]: 197: Hoare triple {17372#false} assume !false; {17372#false} is VALID [2018-11-18 23:02:46,891 INFO L134 CoverageAnalysis]: Checked inductivity of 978 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 950 trivial. 0 not checked. [2018-11-18 23:02:46,909 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-18 23:02:46,910 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 15 [2018-11-18 23:02:46,910 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 198 [2018-11-18 23:02:47,728 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-18 23:02:47,728 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 15 states. [2018-11-18 23:02:47,859 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 23:02:47,860 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-11-18 23:02:47,860 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-11-18 23:02:47,860 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=135, Unknown=0, NotChecked=0, Total=210 [2018-11-18 23:02:47,860 INFO L87 Difference]: Start difference. First operand 212 states and 279 transitions. Second operand 15 states. [2018-11-18 23:02:49,596 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 23:02:49,596 INFO L93 Difference]: Finished difference Result 309 states and 391 transitions. [2018-11-18 23:02:49,596 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-11-18 23:02:49,597 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 198 [2018-11-18 23:02:49,597 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 23:02:49,597 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2018-11-18 23:02:49,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 187 transitions. [2018-11-18 23:02:49,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2018-11-18 23:02:49,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 187 transitions. [2018-11-18 23:02:49,601 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 14 states and 187 transitions. [2018-11-18 23:02:49,776 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 187 edges. 187 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 23:02:49,783 INFO L225 Difference]: With dead ends: 309 [2018-11-18 23:02:49,784 INFO L226 Difference]: Without dead ends: 297 [2018-11-18 23:02:49,784 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 212 GetRequests, 193 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 70 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=140, Invalid=240, Unknown=0, NotChecked=0, Total=380 [2018-11-18 23:02:49,785 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 297 states. [2018-11-18 23:02:50,131 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 297 to 215. [2018-11-18 23:02:50,131 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-18 23:02:50,131 INFO L82 GeneralOperation]: Start isEquivalent. First operand 297 states. Second operand 215 states. [2018-11-18 23:02:50,131 INFO L74 IsIncluded]: Start isIncluded. First operand 297 states. Second operand 215 states. [2018-11-18 23:02:50,131 INFO L87 Difference]: Start difference. First operand 297 states. Second operand 215 states. [2018-11-18 23:02:50,140 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 23:02:50,140 INFO L93 Difference]: Finished difference Result 297 states and 378 transitions. [2018-11-18 23:02:50,140 INFO L276 IsEmpty]: Start isEmpty. Operand 297 states and 378 transitions. [2018-11-18 23:02:50,141 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 23:02:50,141 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 23:02:50,142 INFO L74 IsIncluded]: Start isIncluded. First operand 215 states. Second operand 297 states. [2018-11-18 23:02:50,142 INFO L87 Difference]: Start difference. First operand 215 states. Second operand 297 states. [2018-11-18 23:02:50,150 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 23:02:50,150 INFO L93 Difference]: Finished difference Result 297 states and 378 transitions. [2018-11-18 23:02:50,150 INFO L276 IsEmpty]: Start isEmpty. Operand 297 states and 378 transitions. [2018-11-18 23:02:50,151 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 23:02:50,152 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 23:02:50,152 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-18 23:02:50,152 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-18 23:02:50,152 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 215 states. [2018-11-18 23:02:50,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 215 states to 215 states and 282 transitions. [2018-11-18 23:02:50,158 INFO L78 Accepts]: Start accepts. Automaton has 215 states and 282 transitions. Word has length 198 [2018-11-18 23:02:50,158 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 23:02:50,158 INFO L480 AbstractCegarLoop]: Abstraction has 215 states and 282 transitions. [2018-11-18 23:02:50,158 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-11-18 23:02:50,158 INFO L276 IsEmpty]: Start isEmpty. Operand 215 states and 282 transitions. [2018-11-18 23:02:50,161 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 199 [2018-11-18 23:02:50,161 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 23:02:50,161 INFO L375 BasicCegarLoop]: trace histogram [14, 13, 13, 13, 13, 13, 13, 13, 13, 12, 12, 12, 5, 4, 4, 3, 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 23:02:50,161 INFO L423 AbstractCegarLoop]: === Iteration 20 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 23:02:50,162 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 23:02:50,162 INFO L82 PathProgramCache]: Analyzing trace with hash -813742626, now seen corresponding path program 5 times [2018-11-18 23:02:50,162 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 23:02:50,162 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 23:02:50,163 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 23:02:50,163 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 23:02:50,163 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 23:02:50,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 23:02:50,573 INFO L256 TraceCheckUtils]: 0: Hoare triple {19269#true} call ULTIMATE.init(); {19269#true} is VALID [2018-11-18 23:02:50,575 INFO L273 TraceCheckUtils]: 1: Hoare triple {19269#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~SIZE~0 := 100000; {19271#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:02:50,576 INFO L273 TraceCheckUtils]: 2: Hoare triple {19271#(<= 100000 ~SIZE~0)} assume true; {19271#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:02:50,576 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {19271#(<= 100000 ~SIZE~0)} {19269#true} #128#return; {19271#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:02:50,576 INFO L256 TraceCheckUtils]: 4: Hoare triple {19271#(<= 100000 ~SIZE~0)} call #t~ret13 := main(); {19271#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:02:50,577 INFO L273 TraceCheckUtils]: 5: Hoare triple {19271#(<= 100000 ~SIZE~0)} havoc ~i~1;havoc ~pos~0;~n~0 := 0;~found~0 := 0;call ~#set~0.base, ~#set~0.offset := #Ultimate.alloc(4 * ~SIZE~0);call ~#values~0.base, ~#values~0.offset := #Ultimate.alloc(4 * ~SIZE~0);havoc ~element~0;havoc ~v~0;~v~0 := 0; {19272#(and (= main_~v~0 0) (<= 100000 ~SIZE~0))} is VALID [2018-11-18 23:02:50,577 INFO L273 TraceCheckUtils]: 6: Hoare triple {19272#(and (= main_~v~0 0) (<= 100000 ~SIZE~0))} assume true; {19272#(and (= main_~v~0 0) (<= 100000 ~SIZE~0))} is VALID [2018-11-18 23:02:50,578 INFO L273 TraceCheckUtils]: 7: Hoare triple {19272#(and (= main_~v~0 0) (<= 100000 ~SIZE~0))} assume !!(~v~0 < ~SIZE~0);call #t~mem3 := read~int(~#values~0.base, ~#values~0.offset + 4 * ~v~0, 4); {19272#(and (= main_~v~0 0) (<= 100000 ~SIZE~0))} is VALID [2018-11-18 23:02:50,578 INFO L256 TraceCheckUtils]: 8: Hoare triple {19272#(and (= main_~v~0 0) (<= 100000 ~SIZE~0))} call #t~ret4 := elem_exists(~#set~0.base, ~#set~0.offset, ~n~0, #t~mem3); {19269#true} is VALID [2018-11-18 23:02:50,578 INFO L273 TraceCheckUtils]: 9: Hoare triple {19269#true} ~set.base, ~set.offset := #in~set.base, #in~set.offset;~size := #in~size;~value := #in~value;havoc ~i~0;~i~0 := 0; {19269#true} is VALID [2018-11-18 23:02:50,579 INFO L273 TraceCheckUtils]: 10: Hoare triple {19269#true} assume true; {19269#true} is VALID [2018-11-18 23:02:50,579 INFO L273 TraceCheckUtils]: 11: Hoare triple {19269#true} assume !(~i~0 < ~size); {19269#true} is VALID [2018-11-18 23:02:50,579 INFO L273 TraceCheckUtils]: 12: Hoare triple {19269#true} #res := 0; {19269#true} is VALID [2018-11-18 23:02:50,579 INFO L273 TraceCheckUtils]: 13: Hoare triple {19269#true} assume true; {19269#true} is VALID [2018-11-18 23:02:50,580 INFO L268 TraceCheckUtils]: 14: Hoare quadruple {19269#true} {19272#(and (= main_~v~0 0) (<= 100000 ~SIZE~0))} #132#return; {19272#(and (= main_~v~0 0) (<= 100000 ~SIZE~0))} is VALID [2018-11-18 23:02:50,581 INFO L273 TraceCheckUtils]: 15: Hoare triple {19272#(and (= main_~v~0 0) (<= 100000 ~SIZE~0))} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {19272#(and (= main_~v~0 0) (<= 100000 ~SIZE~0))} is VALID [2018-11-18 23:02:50,582 INFO L273 TraceCheckUtils]: 16: Hoare triple {19272#(and (= main_~v~0 0) (<= 100000 ~SIZE~0))} assume 1 != #t~ret4;havoc #t~mem3;havoc #t~ret4;call #t~mem5 := read~int(~#values~0.base, ~#values~0.offset + 4 * ~v~0, 4); {19272#(and (= main_~v~0 0) (<= 100000 ~SIZE~0))} is VALID [2018-11-18 23:02:50,582 INFO L256 TraceCheckUtils]: 17: Hoare triple {19272#(and (= main_~v~0 0) (<= 100000 ~SIZE~0))} call #t~ret6 := insert(~#set~0.base, ~#set~0.offset, ~n~0, #t~mem5); {19269#true} is VALID [2018-11-18 23:02:50,582 INFO L273 TraceCheckUtils]: 18: Hoare triple {19269#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; {19269#true} is VALID [2018-11-18 23:02:50,582 INFO L273 TraceCheckUtils]: 19: Hoare triple {19269#true} assume true; {19269#true} is VALID [2018-11-18 23:02:50,583 INFO L268 TraceCheckUtils]: 20: Hoare quadruple {19269#true} {19272#(and (= main_~v~0 0) (<= 100000 ~SIZE~0))} #134#return; {19272#(and (= main_~v~0 0) (<= 100000 ~SIZE~0))} is VALID [2018-11-18 23:02:50,584 INFO L273 TraceCheckUtils]: 21: Hoare triple {19272#(and (= main_~v~0 0) (<= 100000 ~SIZE~0))} assume -2147483648 <= #t~ret6 && #t~ret6 <= 2147483647;~n~0 := #t~ret6;havoc #t~ret6;havoc #t~mem5; {19272#(and (= main_~v~0 0) (<= 100000 ~SIZE~0))} is VALID [2018-11-18 23:02:50,585 INFO L273 TraceCheckUtils]: 22: Hoare triple {19272#(and (= main_~v~0 0) (<= 100000 ~SIZE~0))} #t~post2 := ~v~0;~v~0 := 1 + #t~post2;havoc #t~post2; {19273#(<= (+ main_~v~0 99999) ~SIZE~0)} is VALID [2018-11-18 23:02:50,585 INFO L273 TraceCheckUtils]: 23: Hoare triple {19273#(<= (+ main_~v~0 99999) ~SIZE~0)} assume true; {19273#(<= (+ main_~v~0 99999) ~SIZE~0)} is VALID [2018-11-18 23:02:50,586 INFO L273 TraceCheckUtils]: 24: Hoare triple {19273#(<= (+ main_~v~0 99999) ~SIZE~0)} assume !!(~v~0 < ~SIZE~0);call #t~mem3 := read~int(~#values~0.base, ~#values~0.offset + 4 * ~v~0, 4); {19273#(<= (+ main_~v~0 99999) ~SIZE~0)} is VALID [2018-11-18 23:02:50,586 INFO L256 TraceCheckUtils]: 25: Hoare triple {19273#(<= (+ main_~v~0 99999) ~SIZE~0)} call #t~ret4 := elem_exists(~#set~0.base, ~#set~0.offset, ~n~0, #t~mem3); {19269#true} is VALID [2018-11-18 23:02:50,586 INFO L273 TraceCheckUtils]: 26: Hoare triple {19269#true} ~set.base, ~set.offset := #in~set.base, #in~set.offset;~size := #in~size;~value := #in~value;havoc ~i~0;~i~0 := 0; {19269#true} is VALID [2018-11-18 23:02:50,587 INFO L273 TraceCheckUtils]: 27: Hoare triple {19269#true} assume true; {19269#true} is VALID [2018-11-18 23:02:50,587 INFO L273 TraceCheckUtils]: 28: Hoare triple {19269#true} assume !!(~i~0 < ~size);call #t~mem1 := read~int(~set.base, ~set.offset + 4 * ~i~0, 4); {19269#true} is VALID [2018-11-18 23:02:50,587 INFO L273 TraceCheckUtils]: 29: Hoare triple {19269#true} assume #t~mem1 == ~value;havoc #t~mem1;#res := 1; {19269#true} is VALID [2018-11-18 23:02:50,587 INFO L273 TraceCheckUtils]: 30: Hoare triple {19269#true} assume true; {19269#true} is VALID [2018-11-18 23:02:50,588 INFO L268 TraceCheckUtils]: 31: Hoare quadruple {19269#true} {19273#(<= (+ main_~v~0 99999) ~SIZE~0)} #132#return; {19273#(<= (+ main_~v~0 99999) ~SIZE~0)} is VALID [2018-11-18 23:02:50,589 INFO L273 TraceCheckUtils]: 32: Hoare triple {19273#(<= (+ main_~v~0 99999) ~SIZE~0)} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {19273#(<= (+ main_~v~0 99999) ~SIZE~0)} is VALID [2018-11-18 23:02:50,589 INFO L273 TraceCheckUtils]: 33: Hoare triple {19273#(<= (+ main_~v~0 99999) ~SIZE~0)} assume !(1 != #t~ret4);havoc #t~mem3;havoc #t~ret4; {19273#(<= (+ main_~v~0 99999) ~SIZE~0)} is VALID [2018-11-18 23:02:50,589 INFO L273 TraceCheckUtils]: 34: Hoare triple {19273#(<= (+ main_~v~0 99999) ~SIZE~0)} #t~post2 := ~v~0;~v~0 := 1 + #t~post2;havoc #t~post2; {19274#(<= (+ main_~v~0 99998) ~SIZE~0)} is VALID [2018-11-18 23:02:50,590 INFO L273 TraceCheckUtils]: 35: Hoare triple {19274#(<= (+ main_~v~0 99998) ~SIZE~0)} assume true; {19274#(<= (+ main_~v~0 99998) ~SIZE~0)} is VALID [2018-11-18 23:02:50,590 INFO L273 TraceCheckUtils]: 36: Hoare triple {19274#(<= (+ main_~v~0 99998) ~SIZE~0)} assume !!(~v~0 < ~SIZE~0);call #t~mem3 := read~int(~#values~0.base, ~#values~0.offset + 4 * ~v~0, 4); {19274#(<= (+ main_~v~0 99998) ~SIZE~0)} is VALID [2018-11-18 23:02:50,590 INFO L256 TraceCheckUtils]: 37: Hoare triple {19274#(<= (+ main_~v~0 99998) ~SIZE~0)} call #t~ret4 := elem_exists(~#set~0.base, ~#set~0.offset, ~n~0, #t~mem3); {19269#true} is VALID [2018-11-18 23:02:50,590 INFO L273 TraceCheckUtils]: 38: Hoare triple {19269#true} ~set.base, ~set.offset := #in~set.base, #in~set.offset;~size := #in~size;~value := #in~value;havoc ~i~0;~i~0 := 0; {19269#true} is VALID [2018-11-18 23:02:50,590 INFO L273 TraceCheckUtils]: 39: Hoare triple {19269#true} assume true; {19269#true} is VALID [2018-11-18 23:02:50,591 INFO L273 TraceCheckUtils]: 40: Hoare triple {19269#true} assume !!(~i~0 < ~size);call #t~mem1 := read~int(~set.base, ~set.offset + 4 * ~i~0, 4); {19269#true} is VALID [2018-11-18 23:02:50,591 INFO L273 TraceCheckUtils]: 41: Hoare triple {19269#true} assume #t~mem1 == ~value;havoc #t~mem1;#res := 1; {19269#true} is VALID [2018-11-18 23:02:50,591 INFO L273 TraceCheckUtils]: 42: Hoare triple {19269#true} assume true; {19269#true} is VALID [2018-11-18 23:02:50,592 INFO L268 TraceCheckUtils]: 43: Hoare quadruple {19269#true} {19274#(<= (+ main_~v~0 99998) ~SIZE~0)} #132#return; {19274#(<= (+ main_~v~0 99998) ~SIZE~0)} is VALID [2018-11-18 23:02:50,593 INFO L273 TraceCheckUtils]: 44: Hoare triple {19274#(<= (+ main_~v~0 99998) ~SIZE~0)} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {19274#(<= (+ main_~v~0 99998) ~SIZE~0)} is VALID [2018-11-18 23:02:50,593 INFO L273 TraceCheckUtils]: 45: Hoare triple {19274#(<= (+ main_~v~0 99998) ~SIZE~0)} assume !(1 != #t~ret4);havoc #t~mem3;havoc #t~ret4; {19274#(<= (+ main_~v~0 99998) ~SIZE~0)} is VALID [2018-11-18 23:02:50,594 INFO L273 TraceCheckUtils]: 46: Hoare triple {19274#(<= (+ main_~v~0 99998) ~SIZE~0)} #t~post2 := ~v~0;~v~0 := 1 + #t~post2;havoc #t~post2; {19275#(<= (+ main_~v~0 99997) ~SIZE~0)} is VALID [2018-11-18 23:02:50,594 INFO L273 TraceCheckUtils]: 47: Hoare triple {19275#(<= (+ main_~v~0 99997) ~SIZE~0)} assume true; {19275#(<= (+ main_~v~0 99997) ~SIZE~0)} is VALID [2018-11-18 23:02:50,595 INFO L273 TraceCheckUtils]: 48: Hoare triple {19275#(<= (+ main_~v~0 99997) ~SIZE~0)} assume !!(~v~0 < ~SIZE~0);call #t~mem3 := read~int(~#values~0.base, ~#values~0.offset + 4 * ~v~0, 4); {19275#(<= (+ main_~v~0 99997) ~SIZE~0)} is VALID [2018-11-18 23:02:50,595 INFO L256 TraceCheckUtils]: 49: Hoare triple {19275#(<= (+ main_~v~0 99997) ~SIZE~0)} call #t~ret4 := elem_exists(~#set~0.base, ~#set~0.offset, ~n~0, #t~mem3); {19269#true} is VALID [2018-11-18 23:02:50,595 INFO L273 TraceCheckUtils]: 50: Hoare triple {19269#true} ~set.base, ~set.offset := #in~set.base, #in~set.offset;~size := #in~size;~value := #in~value;havoc ~i~0;~i~0 := 0; {19269#true} is VALID [2018-11-18 23:02:50,595 INFO L273 TraceCheckUtils]: 51: Hoare triple {19269#true} assume true; {19269#true} is VALID [2018-11-18 23:02:50,596 INFO L273 TraceCheckUtils]: 52: Hoare triple {19269#true} assume !!(~i~0 < ~size);call #t~mem1 := read~int(~set.base, ~set.offset + 4 * ~i~0, 4); {19269#true} is VALID [2018-11-18 23:02:50,596 INFO L273 TraceCheckUtils]: 53: Hoare triple {19269#true} assume #t~mem1 == ~value;havoc #t~mem1;#res := 1; {19269#true} is VALID [2018-11-18 23:02:50,596 INFO L273 TraceCheckUtils]: 54: Hoare triple {19269#true} assume true; {19269#true} is VALID [2018-11-18 23:02:50,597 INFO L268 TraceCheckUtils]: 55: Hoare quadruple {19269#true} {19275#(<= (+ main_~v~0 99997) ~SIZE~0)} #132#return; {19275#(<= (+ main_~v~0 99997) ~SIZE~0)} is VALID [2018-11-18 23:02:50,598 INFO L273 TraceCheckUtils]: 56: Hoare triple {19275#(<= (+ main_~v~0 99997) ~SIZE~0)} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {19275#(<= (+ main_~v~0 99997) ~SIZE~0)} is VALID [2018-11-18 23:02:50,598 INFO L273 TraceCheckUtils]: 57: Hoare triple {19275#(<= (+ main_~v~0 99997) ~SIZE~0)} assume !(1 != #t~ret4);havoc #t~mem3;havoc #t~ret4; {19275#(<= (+ main_~v~0 99997) ~SIZE~0)} is VALID [2018-11-18 23:02:50,598 INFO L273 TraceCheckUtils]: 58: Hoare triple {19275#(<= (+ main_~v~0 99997) ~SIZE~0)} #t~post2 := ~v~0;~v~0 := 1 + #t~post2;havoc #t~post2; {19276#(<= (+ main_~v~0 99996) ~SIZE~0)} is VALID [2018-11-18 23:02:50,599 INFO L273 TraceCheckUtils]: 59: Hoare triple {19276#(<= (+ main_~v~0 99996) ~SIZE~0)} assume true; {19276#(<= (+ main_~v~0 99996) ~SIZE~0)} is VALID [2018-11-18 23:02:50,599 INFO L273 TraceCheckUtils]: 60: Hoare triple {19276#(<= (+ main_~v~0 99996) ~SIZE~0)} assume !!(~v~0 < ~SIZE~0);call #t~mem3 := read~int(~#values~0.base, ~#values~0.offset + 4 * ~v~0, 4); {19276#(<= (+ main_~v~0 99996) ~SIZE~0)} is VALID [2018-11-18 23:02:50,599 INFO L256 TraceCheckUtils]: 61: Hoare triple {19276#(<= (+ main_~v~0 99996) ~SIZE~0)} call #t~ret4 := elem_exists(~#set~0.base, ~#set~0.offset, ~n~0, #t~mem3); {19269#true} is VALID [2018-11-18 23:02:50,599 INFO L273 TraceCheckUtils]: 62: Hoare triple {19269#true} ~set.base, ~set.offset := #in~set.base, #in~set.offset;~size := #in~size;~value := #in~value;havoc ~i~0;~i~0 := 0; {19269#true} is VALID [2018-11-18 23:02:50,599 INFO L273 TraceCheckUtils]: 63: Hoare triple {19269#true} assume true; {19269#true} is VALID [2018-11-18 23:02:50,599 INFO L273 TraceCheckUtils]: 64: Hoare triple {19269#true} assume !!(~i~0 < ~size);call #t~mem1 := read~int(~set.base, ~set.offset + 4 * ~i~0, 4); {19269#true} is VALID [2018-11-18 23:02:50,600 INFO L273 TraceCheckUtils]: 65: Hoare triple {19269#true} assume #t~mem1 == ~value;havoc #t~mem1;#res := 1; {19269#true} is VALID [2018-11-18 23:02:50,600 INFO L273 TraceCheckUtils]: 66: Hoare triple {19269#true} assume true; {19269#true} is VALID [2018-11-18 23:02:50,601 INFO L268 TraceCheckUtils]: 67: Hoare quadruple {19269#true} {19276#(<= (+ main_~v~0 99996) ~SIZE~0)} #132#return; {19276#(<= (+ main_~v~0 99996) ~SIZE~0)} is VALID [2018-11-18 23:02:50,601 INFO L273 TraceCheckUtils]: 68: Hoare triple {19276#(<= (+ main_~v~0 99996) ~SIZE~0)} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {19276#(<= (+ main_~v~0 99996) ~SIZE~0)} is VALID [2018-11-18 23:02:50,602 INFO L273 TraceCheckUtils]: 69: Hoare triple {19276#(<= (+ main_~v~0 99996) ~SIZE~0)} assume !(1 != #t~ret4);havoc #t~mem3;havoc #t~ret4; {19276#(<= (+ main_~v~0 99996) ~SIZE~0)} is VALID [2018-11-18 23:02:50,602 INFO L273 TraceCheckUtils]: 70: Hoare triple {19276#(<= (+ main_~v~0 99996) ~SIZE~0)} #t~post2 := ~v~0;~v~0 := 1 + #t~post2;havoc #t~post2; {19277#(<= (+ main_~v~0 99995) ~SIZE~0)} is VALID [2018-11-18 23:02:50,603 INFO L273 TraceCheckUtils]: 71: Hoare triple {19277#(<= (+ main_~v~0 99995) ~SIZE~0)} assume true; {19277#(<= (+ main_~v~0 99995) ~SIZE~0)} is VALID [2018-11-18 23:02:50,603 INFO L273 TraceCheckUtils]: 72: Hoare triple {19277#(<= (+ main_~v~0 99995) ~SIZE~0)} assume !!(~v~0 < ~SIZE~0);call #t~mem3 := read~int(~#values~0.base, ~#values~0.offset + 4 * ~v~0, 4); {19277#(<= (+ main_~v~0 99995) ~SIZE~0)} is VALID [2018-11-18 23:02:50,603 INFO L256 TraceCheckUtils]: 73: Hoare triple {19277#(<= (+ main_~v~0 99995) ~SIZE~0)} call #t~ret4 := elem_exists(~#set~0.base, ~#set~0.offset, ~n~0, #t~mem3); {19269#true} is VALID [2018-11-18 23:02:50,603 INFO L273 TraceCheckUtils]: 74: Hoare triple {19269#true} ~set.base, ~set.offset := #in~set.base, #in~set.offset;~size := #in~size;~value := #in~value;havoc ~i~0;~i~0 := 0; {19269#true} is VALID [2018-11-18 23:02:50,603 INFO L273 TraceCheckUtils]: 75: Hoare triple {19269#true} assume true; {19269#true} is VALID [2018-11-18 23:02:50,603 INFO L273 TraceCheckUtils]: 76: Hoare triple {19269#true} assume !!(~i~0 < ~size);call #t~mem1 := read~int(~set.base, ~set.offset + 4 * ~i~0, 4); {19269#true} is VALID [2018-11-18 23:02:50,603 INFO L273 TraceCheckUtils]: 77: Hoare triple {19269#true} assume #t~mem1 == ~value;havoc #t~mem1;#res := 1; {19269#true} is VALID [2018-11-18 23:02:50,604 INFO L273 TraceCheckUtils]: 78: Hoare triple {19269#true} assume true; {19269#true} is VALID [2018-11-18 23:02:50,605 INFO L268 TraceCheckUtils]: 79: Hoare quadruple {19269#true} {19277#(<= (+ main_~v~0 99995) ~SIZE~0)} #132#return; {19277#(<= (+ main_~v~0 99995) ~SIZE~0)} is VALID [2018-11-18 23:02:50,605 INFO L273 TraceCheckUtils]: 80: Hoare triple {19277#(<= (+ main_~v~0 99995) ~SIZE~0)} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {19277#(<= (+ main_~v~0 99995) ~SIZE~0)} is VALID [2018-11-18 23:02:50,606 INFO L273 TraceCheckUtils]: 81: Hoare triple {19277#(<= (+ main_~v~0 99995) ~SIZE~0)} assume !(1 != #t~ret4);havoc #t~mem3;havoc #t~ret4; {19277#(<= (+ main_~v~0 99995) ~SIZE~0)} is VALID [2018-11-18 23:02:50,606 INFO L273 TraceCheckUtils]: 82: Hoare triple {19277#(<= (+ main_~v~0 99995) ~SIZE~0)} #t~post2 := ~v~0;~v~0 := 1 + #t~post2;havoc #t~post2; {19278#(<= (+ main_~v~0 99994) ~SIZE~0)} is VALID [2018-11-18 23:02:50,607 INFO L273 TraceCheckUtils]: 83: Hoare triple {19278#(<= (+ main_~v~0 99994) ~SIZE~0)} assume true; {19278#(<= (+ main_~v~0 99994) ~SIZE~0)} is VALID [2018-11-18 23:02:50,607 INFO L273 TraceCheckUtils]: 84: Hoare triple {19278#(<= (+ main_~v~0 99994) ~SIZE~0)} assume !!(~v~0 < ~SIZE~0);call #t~mem3 := read~int(~#values~0.base, ~#values~0.offset + 4 * ~v~0, 4); {19278#(<= (+ main_~v~0 99994) ~SIZE~0)} is VALID [2018-11-18 23:02:50,607 INFO L256 TraceCheckUtils]: 85: Hoare triple {19278#(<= (+ main_~v~0 99994) ~SIZE~0)} call #t~ret4 := elem_exists(~#set~0.base, ~#set~0.offset, ~n~0, #t~mem3); {19269#true} is VALID [2018-11-18 23:02:50,607 INFO L273 TraceCheckUtils]: 86: Hoare triple {19269#true} ~set.base, ~set.offset := #in~set.base, #in~set.offset;~size := #in~size;~value := #in~value;havoc ~i~0;~i~0 := 0; {19269#true} is VALID [2018-11-18 23:02:50,607 INFO L273 TraceCheckUtils]: 87: Hoare triple {19269#true} assume true; {19269#true} is VALID [2018-11-18 23:02:50,607 INFO L273 TraceCheckUtils]: 88: Hoare triple {19269#true} assume !!(~i~0 < ~size);call #t~mem1 := read~int(~set.base, ~set.offset + 4 * ~i~0, 4); {19269#true} is VALID [2018-11-18 23:02:50,607 INFO L273 TraceCheckUtils]: 89: Hoare triple {19269#true} assume #t~mem1 == ~value;havoc #t~mem1;#res := 1; {19269#true} is VALID [2018-11-18 23:02:50,607 INFO L273 TraceCheckUtils]: 90: Hoare triple {19269#true} assume true; {19269#true} is VALID [2018-11-18 23:02:50,608 INFO L268 TraceCheckUtils]: 91: Hoare quadruple {19269#true} {19278#(<= (+ main_~v~0 99994) ~SIZE~0)} #132#return; {19278#(<= (+ main_~v~0 99994) ~SIZE~0)} is VALID [2018-11-18 23:02:50,610 INFO L273 TraceCheckUtils]: 92: Hoare triple {19278#(<= (+ main_~v~0 99994) ~SIZE~0)} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {19278#(<= (+ main_~v~0 99994) ~SIZE~0)} is VALID [2018-11-18 23:02:50,611 INFO L273 TraceCheckUtils]: 93: Hoare triple {19278#(<= (+ main_~v~0 99994) ~SIZE~0)} assume !(1 != #t~ret4);havoc #t~mem3;havoc #t~ret4; {19278#(<= (+ main_~v~0 99994) ~SIZE~0)} is VALID [2018-11-18 23:02:50,611 INFO L273 TraceCheckUtils]: 94: Hoare triple {19278#(<= (+ main_~v~0 99994) ~SIZE~0)} #t~post2 := ~v~0;~v~0 := 1 + #t~post2;havoc #t~post2; {19279#(<= (+ main_~v~0 99993) ~SIZE~0)} is VALID [2018-11-18 23:02:50,611 INFO L273 TraceCheckUtils]: 95: Hoare triple {19279#(<= (+ main_~v~0 99993) ~SIZE~0)} assume true; {19279#(<= (+ main_~v~0 99993) ~SIZE~0)} is VALID [2018-11-18 23:02:50,612 INFO L273 TraceCheckUtils]: 96: Hoare triple {19279#(<= (+ main_~v~0 99993) ~SIZE~0)} assume !!(~v~0 < ~SIZE~0);call #t~mem3 := read~int(~#values~0.base, ~#values~0.offset + 4 * ~v~0, 4); {19279#(<= (+ main_~v~0 99993) ~SIZE~0)} is VALID [2018-11-18 23:02:50,612 INFO L256 TraceCheckUtils]: 97: Hoare triple {19279#(<= (+ main_~v~0 99993) ~SIZE~0)} call #t~ret4 := elem_exists(~#set~0.base, ~#set~0.offset, ~n~0, #t~mem3); {19269#true} is VALID [2018-11-18 23:02:50,612 INFO L273 TraceCheckUtils]: 98: Hoare triple {19269#true} ~set.base, ~set.offset := #in~set.base, #in~set.offset;~size := #in~size;~value := #in~value;havoc ~i~0;~i~0 := 0; {19269#true} is VALID [2018-11-18 23:02:50,612 INFO L273 TraceCheckUtils]: 99: Hoare triple {19269#true} assume true; {19269#true} is VALID [2018-11-18 23:02:50,612 INFO L273 TraceCheckUtils]: 100: Hoare triple {19269#true} assume !!(~i~0 < ~size);call #t~mem1 := read~int(~set.base, ~set.offset + 4 * ~i~0, 4); {19269#true} is VALID [2018-11-18 23:02:50,612 INFO L273 TraceCheckUtils]: 101: Hoare triple {19269#true} assume #t~mem1 == ~value;havoc #t~mem1;#res := 1; {19269#true} is VALID [2018-11-18 23:02:50,612 INFO L273 TraceCheckUtils]: 102: Hoare triple {19269#true} assume true; {19269#true} is VALID [2018-11-18 23:02:50,613 INFO L268 TraceCheckUtils]: 103: Hoare quadruple {19269#true} {19279#(<= (+ main_~v~0 99993) ~SIZE~0)} #132#return; {19279#(<= (+ main_~v~0 99993) ~SIZE~0)} is VALID [2018-11-18 23:02:50,613 INFO L273 TraceCheckUtils]: 104: Hoare triple {19279#(<= (+ main_~v~0 99993) ~SIZE~0)} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {19279#(<= (+ main_~v~0 99993) ~SIZE~0)} is VALID [2018-11-18 23:02:50,614 INFO L273 TraceCheckUtils]: 105: Hoare triple {19279#(<= (+ main_~v~0 99993) ~SIZE~0)} assume !(1 != #t~ret4);havoc #t~mem3;havoc #t~ret4; {19279#(<= (+ main_~v~0 99993) ~SIZE~0)} is VALID [2018-11-18 23:02:50,614 INFO L273 TraceCheckUtils]: 106: Hoare triple {19279#(<= (+ main_~v~0 99993) ~SIZE~0)} #t~post2 := ~v~0;~v~0 := 1 + #t~post2;havoc #t~post2; {19280#(<= (+ main_~v~0 99992) ~SIZE~0)} is VALID [2018-11-18 23:02:50,614 INFO L273 TraceCheckUtils]: 107: Hoare triple {19280#(<= (+ main_~v~0 99992) ~SIZE~0)} assume true; {19280#(<= (+ main_~v~0 99992) ~SIZE~0)} is VALID [2018-11-18 23:02:50,615 INFO L273 TraceCheckUtils]: 108: Hoare triple {19280#(<= (+ main_~v~0 99992) ~SIZE~0)} assume !!(~v~0 < ~SIZE~0);call #t~mem3 := read~int(~#values~0.base, ~#values~0.offset + 4 * ~v~0, 4); {19280#(<= (+ main_~v~0 99992) ~SIZE~0)} is VALID [2018-11-18 23:02:50,615 INFO L256 TraceCheckUtils]: 109: Hoare triple {19280#(<= (+ main_~v~0 99992) ~SIZE~0)} call #t~ret4 := elem_exists(~#set~0.base, ~#set~0.offset, ~n~0, #t~mem3); {19269#true} is VALID [2018-11-18 23:02:50,615 INFO L273 TraceCheckUtils]: 110: Hoare triple {19269#true} ~set.base, ~set.offset := #in~set.base, #in~set.offset;~size := #in~size;~value := #in~value;havoc ~i~0;~i~0 := 0; {19269#true} is VALID [2018-11-18 23:02:50,615 INFO L273 TraceCheckUtils]: 111: Hoare triple {19269#true} assume true; {19269#true} is VALID [2018-11-18 23:02:50,615 INFO L273 TraceCheckUtils]: 112: Hoare triple {19269#true} assume !!(~i~0 < ~size);call #t~mem1 := read~int(~set.base, ~set.offset + 4 * ~i~0, 4); {19269#true} is VALID [2018-11-18 23:02:50,615 INFO L273 TraceCheckUtils]: 113: Hoare triple {19269#true} assume #t~mem1 == ~value;havoc #t~mem1;#res := 1; {19269#true} is VALID [2018-11-18 23:02:50,615 INFO L273 TraceCheckUtils]: 114: Hoare triple {19269#true} assume true; {19269#true} is VALID [2018-11-18 23:02:50,616 INFO L268 TraceCheckUtils]: 115: Hoare quadruple {19269#true} {19280#(<= (+ main_~v~0 99992) ~SIZE~0)} #132#return; {19280#(<= (+ main_~v~0 99992) ~SIZE~0)} is VALID [2018-11-18 23:02:50,616 INFO L273 TraceCheckUtils]: 116: Hoare triple {19280#(<= (+ main_~v~0 99992) ~SIZE~0)} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {19280#(<= (+ main_~v~0 99992) ~SIZE~0)} is VALID [2018-11-18 23:02:50,617 INFO L273 TraceCheckUtils]: 117: Hoare triple {19280#(<= (+ main_~v~0 99992) ~SIZE~0)} assume !(1 != #t~ret4);havoc #t~mem3;havoc #t~ret4; {19280#(<= (+ main_~v~0 99992) ~SIZE~0)} is VALID [2018-11-18 23:02:50,617 INFO L273 TraceCheckUtils]: 118: Hoare triple {19280#(<= (+ main_~v~0 99992) ~SIZE~0)} #t~post2 := ~v~0;~v~0 := 1 + #t~post2;havoc #t~post2; {19281#(<= (+ main_~v~0 99991) ~SIZE~0)} is VALID [2018-11-18 23:02:50,618 INFO L273 TraceCheckUtils]: 119: Hoare triple {19281#(<= (+ main_~v~0 99991) ~SIZE~0)} assume true; {19281#(<= (+ main_~v~0 99991) ~SIZE~0)} is VALID [2018-11-18 23:02:50,619 INFO L273 TraceCheckUtils]: 120: Hoare triple {19281#(<= (+ main_~v~0 99991) ~SIZE~0)} assume !!(~v~0 < ~SIZE~0);call #t~mem3 := read~int(~#values~0.base, ~#values~0.offset + 4 * ~v~0, 4); {19281#(<= (+ main_~v~0 99991) ~SIZE~0)} is VALID [2018-11-18 23:02:50,619 INFO L256 TraceCheckUtils]: 121: Hoare triple {19281#(<= (+ main_~v~0 99991) ~SIZE~0)} call #t~ret4 := elem_exists(~#set~0.base, ~#set~0.offset, ~n~0, #t~mem3); {19269#true} is VALID [2018-11-18 23:02:50,619 INFO L273 TraceCheckUtils]: 122: Hoare triple {19269#true} ~set.base, ~set.offset := #in~set.base, #in~set.offset;~size := #in~size;~value := #in~value;havoc ~i~0;~i~0 := 0; {19269#true} is VALID [2018-11-18 23:02:50,619 INFO L273 TraceCheckUtils]: 123: Hoare triple {19269#true} assume true; {19269#true} is VALID [2018-11-18 23:02:50,619 INFO L273 TraceCheckUtils]: 124: Hoare triple {19269#true} assume !!(~i~0 < ~size);call #t~mem1 := read~int(~set.base, ~set.offset + 4 * ~i~0, 4); {19269#true} is VALID [2018-11-18 23:02:50,619 INFO L273 TraceCheckUtils]: 125: Hoare triple {19269#true} assume #t~mem1 == ~value;havoc #t~mem1;#res := 1; {19269#true} is VALID [2018-11-18 23:02:50,620 INFO L273 TraceCheckUtils]: 126: Hoare triple {19269#true} assume true; {19269#true} is VALID [2018-11-18 23:02:50,621 INFO L268 TraceCheckUtils]: 127: Hoare quadruple {19269#true} {19281#(<= (+ main_~v~0 99991) ~SIZE~0)} #132#return; {19281#(<= (+ main_~v~0 99991) ~SIZE~0)} is VALID [2018-11-18 23:02:50,621 INFO L273 TraceCheckUtils]: 128: Hoare triple {19281#(<= (+ main_~v~0 99991) ~SIZE~0)} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {19281#(<= (+ main_~v~0 99991) ~SIZE~0)} is VALID [2018-11-18 23:02:50,622 INFO L273 TraceCheckUtils]: 129: Hoare triple {19281#(<= (+ main_~v~0 99991) ~SIZE~0)} assume !(1 != #t~ret4);havoc #t~mem3;havoc #t~ret4; {19281#(<= (+ main_~v~0 99991) ~SIZE~0)} is VALID [2018-11-18 23:02:50,622 INFO L273 TraceCheckUtils]: 130: Hoare triple {19281#(<= (+ main_~v~0 99991) ~SIZE~0)} #t~post2 := ~v~0;~v~0 := 1 + #t~post2;havoc #t~post2; {19282#(<= (+ main_~v~0 99990) ~SIZE~0)} is VALID [2018-11-18 23:02:50,623 INFO L273 TraceCheckUtils]: 131: Hoare triple {19282#(<= (+ main_~v~0 99990) ~SIZE~0)} assume true; {19282#(<= (+ main_~v~0 99990) ~SIZE~0)} is VALID [2018-11-18 23:02:50,623 INFO L273 TraceCheckUtils]: 132: Hoare triple {19282#(<= (+ main_~v~0 99990) ~SIZE~0)} assume !!(~v~0 < ~SIZE~0);call #t~mem3 := read~int(~#values~0.base, ~#values~0.offset + 4 * ~v~0, 4); {19282#(<= (+ main_~v~0 99990) ~SIZE~0)} is VALID [2018-11-18 23:02:50,623 INFO L256 TraceCheckUtils]: 133: Hoare triple {19282#(<= (+ main_~v~0 99990) ~SIZE~0)} call #t~ret4 := elem_exists(~#set~0.base, ~#set~0.offset, ~n~0, #t~mem3); {19269#true} is VALID [2018-11-18 23:02:50,623 INFO L273 TraceCheckUtils]: 134: Hoare triple {19269#true} ~set.base, ~set.offset := #in~set.base, #in~set.offset;~size := #in~size;~value := #in~value;havoc ~i~0;~i~0 := 0; {19269#true} is VALID [2018-11-18 23:02:50,623 INFO L273 TraceCheckUtils]: 135: Hoare triple {19269#true} assume true; {19269#true} is VALID [2018-11-18 23:02:50,623 INFO L273 TraceCheckUtils]: 136: Hoare triple {19269#true} assume !!(~i~0 < ~size);call #t~mem1 := read~int(~set.base, ~set.offset + 4 * ~i~0, 4); {19269#true} is VALID [2018-11-18 23:02:50,624 INFO L273 TraceCheckUtils]: 137: Hoare triple {19269#true} assume #t~mem1 == ~value;havoc #t~mem1;#res := 1; {19269#true} is VALID [2018-11-18 23:02:50,624 INFO L273 TraceCheckUtils]: 138: Hoare triple {19269#true} assume true; {19269#true} is VALID [2018-11-18 23:02:50,625 INFO L268 TraceCheckUtils]: 139: Hoare quadruple {19269#true} {19282#(<= (+ main_~v~0 99990) ~SIZE~0)} #132#return; {19282#(<= (+ main_~v~0 99990) ~SIZE~0)} is VALID [2018-11-18 23:02:50,625 INFO L273 TraceCheckUtils]: 140: Hoare triple {19282#(<= (+ main_~v~0 99990) ~SIZE~0)} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {19282#(<= (+ main_~v~0 99990) ~SIZE~0)} is VALID [2018-11-18 23:02:50,626 INFO L273 TraceCheckUtils]: 141: Hoare triple {19282#(<= (+ main_~v~0 99990) ~SIZE~0)} assume !(1 != #t~ret4);havoc #t~mem3;havoc #t~ret4; {19282#(<= (+ main_~v~0 99990) ~SIZE~0)} is VALID [2018-11-18 23:02:50,627 INFO L273 TraceCheckUtils]: 142: Hoare triple {19282#(<= (+ main_~v~0 99990) ~SIZE~0)} #t~post2 := ~v~0;~v~0 := 1 + #t~post2;havoc #t~post2; {19283#(<= (+ main_~v~0 99989) ~SIZE~0)} is VALID [2018-11-18 23:02:50,627 INFO L273 TraceCheckUtils]: 143: Hoare triple {19283#(<= (+ main_~v~0 99989) ~SIZE~0)} assume true; {19283#(<= (+ main_~v~0 99989) ~SIZE~0)} is VALID [2018-11-18 23:02:50,628 INFO L273 TraceCheckUtils]: 144: Hoare triple {19283#(<= (+ main_~v~0 99989) ~SIZE~0)} assume !!(~v~0 < ~SIZE~0);call #t~mem3 := read~int(~#values~0.base, ~#values~0.offset + 4 * ~v~0, 4); {19283#(<= (+ main_~v~0 99989) ~SIZE~0)} is VALID [2018-11-18 23:02:50,628 INFO L256 TraceCheckUtils]: 145: Hoare triple {19283#(<= (+ main_~v~0 99989) ~SIZE~0)} call #t~ret4 := elem_exists(~#set~0.base, ~#set~0.offset, ~n~0, #t~mem3); {19269#true} is VALID [2018-11-18 23:02:50,628 INFO L273 TraceCheckUtils]: 146: Hoare triple {19269#true} ~set.base, ~set.offset := #in~set.base, #in~set.offset;~size := #in~size;~value := #in~value;havoc ~i~0;~i~0 := 0; {19269#true} is VALID [2018-11-18 23:02:50,628 INFO L273 TraceCheckUtils]: 147: Hoare triple {19269#true} assume true; {19269#true} is VALID [2018-11-18 23:02:50,628 INFO L273 TraceCheckUtils]: 148: Hoare triple {19269#true} assume !!(~i~0 < ~size);call #t~mem1 := read~int(~set.base, ~set.offset + 4 * ~i~0, 4); {19269#true} is VALID [2018-11-18 23:02:50,629 INFO L273 TraceCheckUtils]: 149: Hoare triple {19269#true} assume #t~mem1 == ~value;havoc #t~mem1;#res := 1; {19269#true} is VALID [2018-11-18 23:02:50,629 INFO L273 TraceCheckUtils]: 150: Hoare triple {19269#true} assume true; {19269#true} is VALID [2018-11-18 23:02:50,630 INFO L268 TraceCheckUtils]: 151: Hoare quadruple {19269#true} {19283#(<= (+ main_~v~0 99989) ~SIZE~0)} #132#return; {19283#(<= (+ main_~v~0 99989) ~SIZE~0)} is VALID [2018-11-18 23:02:50,630 INFO L273 TraceCheckUtils]: 152: Hoare triple {19283#(<= (+ main_~v~0 99989) ~SIZE~0)} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {19283#(<= (+ main_~v~0 99989) ~SIZE~0)} is VALID [2018-11-18 23:02:50,631 INFO L273 TraceCheckUtils]: 153: Hoare triple {19283#(<= (+ main_~v~0 99989) ~SIZE~0)} assume !(1 != #t~ret4);havoc #t~mem3;havoc #t~ret4; {19283#(<= (+ main_~v~0 99989) ~SIZE~0)} is VALID [2018-11-18 23:02:50,632 INFO L273 TraceCheckUtils]: 154: Hoare triple {19283#(<= (+ main_~v~0 99989) ~SIZE~0)} #t~post2 := ~v~0;~v~0 := 1 + #t~post2;havoc #t~post2; {19284#(<= (+ main_~v~0 99988) ~SIZE~0)} is VALID [2018-11-18 23:02:50,632 INFO L273 TraceCheckUtils]: 155: Hoare triple {19284#(<= (+ main_~v~0 99988) ~SIZE~0)} assume true; {19284#(<= (+ main_~v~0 99988) ~SIZE~0)} is VALID [2018-11-18 23:02:50,633 INFO L273 TraceCheckUtils]: 156: Hoare triple {19284#(<= (+ main_~v~0 99988) ~SIZE~0)} assume !!(~v~0 < ~SIZE~0);call #t~mem3 := read~int(~#values~0.base, ~#values~0.offset + 4 * ~v~0, 4); {19284#(<= (+ main_~v~0 99988) ~SIZE~0)} is VALID [2018-11-18 23:02:50,633 INFO L256 TraceCheckUtils]: 157: Hoare triple {19284#(<= (+ main_~v~0 99988) ~SIZE~0)} call #t~ret4 := elem_exists(~#set~0.base, ~#set~0.offset, ~n~0, #t~mem3); {19269#true} is VALID [2018-11-18 23:02:50,633 INFO L273 TraceCheckUtils]: 158: Hoare triple {19269#true} ~set.base, ~set.offset := #in~set.base, #in~set.offset;~size := #in~size;~value := #in~value;havoc ~i~0;~i~0 := 0; {19269#true} is VALID [2018-11-18 23:02:50,633 INFO L273 TraceCheckUtils]: 159: Hoare triple {19269#true} assume true; {19269#true} is VALID [2018-11-18 23:02:50,633 INFO L273 TraceCheckUtils]: 160: Hoare triple {19269#true} assume !!(~i~0 < ~size);call #t~mem1 := read~int(~set.base, ~set.offset + 4 * ~i~0, 4); {19269#true} is VALID [2018-11-18 23:02:50,634 INFO L273 TraceCheckUtils]: 161: Hoare triple {19269#true} assume #t~mem1 == ~value;havoc #t~mem1;#res := 1; {19269#true} is VALID [2018-11-18 23:02:50,634 INFO L273 TraceCheckUtils]: 162: Hoare triple {19269#true} assume true; {19269#true} is VALID [2018-11-18 23:02:50,635 INFO L268 TraceCheckUtils]: 163: Hoare quadruple {19269#true} {19284#(<= (+ main_~v~0 99988) ~SIZE~0)} #132#return; {19284#(<= (+ main_~v~0 99988) ~SIZE~0)} is VALID [2018-11-18 23:02:50,635 INFO L273 TraceCheckUtils]: 164: Hoare triple {19284#(<= (+ main_~v~0 99988) ~SIZE~0)} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {19284#(<= (+ main_~v~0 99988) ~SIZE~0)} is VALID [2018-11-18 23:02:50,636 INFO L273 TraceCheckUtils]: 165: Hoare triple {19284#(<= (+ main_~v~0 99988) ~SIZE~0)} assume !(1 != #t~ret4);havoc #t~mem3;havoc #t~ret4; {19284#(<= (+ main_~v~0 99988) ~SIZE~0)} is VALID [2018-11-18 23:02:50,637 INFO L273 TraceCheckUtils]: 166: Hoare triple {19284#(<= (+ main_~v~0 99988) ~SIZE~0)} #t~post2 := ~v~0;~v~0 := 1 + #t~post2;havoc #t~post2; {19285#(<= (+ main_~v~0 99987) ~SIZE~0)} is VALID [2018-11-18 23:02:50,637 INFO L273 TraceCheckUtils]: 167: Hoare triple {19285#(<= (+ main_~v~0 99987) ~SIZE~0)} assume true; {19285#(<= (+ main_~v~0 99987) ~SIZE~0)} is VALID [2018-11-18 23:02:50,638 INFO L273 TraceCheckUtils]: 168: Hoare triple {19285#(<= (+ main_~v~0 99987) ~SIZE~0)} assume !(~v~0 < ~SIZE~0); {19270#false} is VALID [2018-11-18 23:02:50,638 INFO L273 TraceCheckUtils]: 169: Hoare triple {19270#false} ~i~1 := 0; {19270#false} is VALID [2018-11-18 23:02:50,638 INFO L273 TraceCheckUtils]: 170: Hoare triple {19270#false} assume true; {19270#false} is VALID [2018-11-18 23:02:50,639 INFO L273 TraceCheckUtils]: 171: Hoare triple {19270#false} assume !!(~i~1 < ~SIZE~0 && 1 != ~found~0);call #t~mem8 := read~int(~#set~0.base, ~#set~0.offset + 4 * ~i~1, 4); {19270#false} is VALID [2018-11-18 23:02:50,639 INFO L273 TraceCheckUtils]: 172: Hoare triple {19270#false} assume !(#t~mem8 == ~element~0);havoc #t~mem8; {19270#false} is VALID [2018-11-18 23:02:50,639 INFO L273 TraceCheckUtils]: 173: Hoare triple {19270#false} #t~post7 := ~i~1;~i~1 := 1 + #t~post7;havoc #t~post7; {19270#false} is VALID [2018-11-18 23:02:50,639 INFO L273 TraceCheckUtils]: 174: Hoare triple {19270#false} assume true; {19270#false} is VALID [2018-11-18 23:02:50,639 INFO L273 TraceCheckUtils]: 175: Hoare triple {19270#false} assume !!(~i~1 < ~SIZE~0 && 1 != ~found~0);call #t~mem8 := read~int(~#set~0.base, ~#set~0.offset + 4 * ~i~1, 4); {19270#false} is VALID [2018-11-18 23:02:50,640 INFO L273 TraceCheckUtils]: 176: Hoare triple {19270#false} assume !(#t~mem8 == ~element~0);havoc #t~mem8; {19270#false} is VALID [2018-11-18 23:02:50,640 INFO L273 TraceCheckUtils]: 177: Hoare triple {19270#false} #t~post7 := ~i~1;~i~1 := 1 + #t~post7;havoc #t~post7; {19270#false} is VALID [2018-11-18 23:02:50,640 INFO L273 TraceCheckUtils]: 178: Hoare triple {19270#false} assume true; {19270#false} is VALID [2018-11-18 23:02:50,640 INFO L273 TraceCheckUtils]: 179: Hoare triple {19270#false} assume !!(~i~1 < ~SIZE~0 && 1 != ~found~0);call #t~mem8 := read~int(~#set~0.base, ~#set~0.offset + 4 * ~i~1, 4); {19270#false} is VALID [2018-11-18 23:02:50,640 INFO L273 TraceCheckUtils]: 180: Hoare triple {19270#false} assume !(#t~mem8 == ~element~0);havoc #t~mem8; {19270#false} is VALID [2018-11-18 23:02:50,641 INFO L273 TraceCheckUtils]: 181: Hoare triple {19270#false} #t~post7 := ~i~1;~i~1 := 1 + #t~post7;havoc #t~post7; {19270#false} is VALID [2018-11-18 23:02:50,641 INFO L273 TraceCheckUtils]: 182: Hoare triple {19270#false} assume true; {19270#false} is VALID [2018-11-18 23:02:50,641 INFO L273 TraceCheckUtils]: 183: Hoare triple {19270#false} assume !!(~i~1 < ~SIZE~0 && 1 != ~found~0);call #t~mem8 := read~int(~#set~0.base, ~#set~0.offset + 4 * ~i~1, 4); {19270#false} is VALID [2018-11-18 23:02:50,641 INFO L273 TraceCheckUtils]: 184: Hoare triple {19270#false} assume #t~mem8 == ~element~0;havoc #t~mem8;~found~0 := 1;~pos~0 := ~i~1; {19270#false} is VALID [2018-11-18 23:02:50,641 INFO L273 TraceCheckUtils]: 185: Hoare triple {19270#false} #t~post7 := ~i~1;~i~1 := 1 + #t~post7;havoc #t~post7; {19270#false} is VALID [2018-11-18 23:02:50,641 INFO L273 TraceCheckUtils]: 186: Hoare triple {19270#false} assume true; {19270#false} is VALID [2018-11-18 23:02:50,642 INFO L273 TraceCheckUtils]: 187: Hoare triple {19270#false} assume !(~i~1 < ~SIZE~0 && 1 != ~found~0); {19270#false} is VALID [2018-11-18 23:02:50,642 INFO L273 TraceCheckUtils]: 188: Hoare triple {19270#false} assume 1 == ~found~0;~i~1 := ~pos~0; {19270#false} is VALID [2018-11-18 23:02:50,642 INFO L273 TraceCheckUtils]: 189: Hoare triple {19270#false} assume true; {19270#false} is VALID [2018-11-18 23:02:50,642 INFO L273 TraceCheckUtils]: 190: Hoare triple {19270#false} assume !(~i~1 < ~SIZE~0 - 1); {19270#false} is VALID [2018-11-18 23:02:50,642 INFO L273 TraceCheckUtils]: 191: Hoare triple {19270#false} assume 1 == ~found~0;~i~1 := 0; {19270#false} is VALID [2018-11-18 23:02:50,643 INFO L273 TraceCheckUtils]: 192: Hoare triple {19270#false} assume true; {19270#false} is VALID [2018-11-18 23:02:50,643 INFO L273 TraceCheckUtils]: 193: Hoare triple {19270#false} assume !!(~i~1 < ~SIZE~0 - 1);call #t~mem12 := read~int(~#set~0.base, ~#set~0.offset + 4 * ~i~1, 4); {19270#false} is VALID [2018-11-18 23:02:50,643 INFO L256 TraceCheckUtils]: 194: Hoare triple {19270#false} call __VERIFIER_assert((if #t~mem12 != ~element~0 then 1 else 0)); {19270#false} is VALID [2018-11-18 23:02:50,643 INFO L273 TraceCheckUtils]: 195: Hoare triple {19270#false} ~cond := #in~cond; {19270#false} is VALID [2018-11-18 23:02:50,643 INFO L273 TraceCheckUtils]: 196: Hoare triple {19270#false} assume 0 == ~cond; {19270#false} is VALID [2018-11-18 23:02:50,643 INFO L273 TraceCheckUtils]: 197: Hoare triple {19270#false} assume !false; {19270#false} is VALID [2018-11-18 23:02:50,668 INFO L134 CoverageAnalysis]: Checked inductivity of 982 backedges. 0 proven. 494 refuted. 0 times theorem prover too weak. 488 trivial. 0 not checked. [2018-11-18 23:02:50,668 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 23:02:50,668 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-18 23:02:50,678 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-11-18 23:02:50,828 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 14 check-sat command(s) [2018-11-18 23:02:50,828 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-18 23:02:50,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 23:02:50,868 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 23:02:51,518 INFO L256 TraceCheckUtils]: 0: Hoare triple {19269#true} call ULTIMATE.init(); {19269#true} is VALID [2018-11-18 23:02:51,519 INFO L273 TraceCheckUtils]: 1: Hoare triple {19269#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~SIZE~0 := 100000; {19271#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:02:51,520 INFO L273 TraceCheckUtils]: 2: Hoare triple {19271#(<= 100000 ~SIZE~0)} assume true; {19271#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:02:51,520 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {19271#(<= 100000 ~SIZE~0)} {19269#true} #128#return; {19271#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:02:51,521 INFO L256 TraceCheckUtils]: 4: Hoare triple {19271#(<= 100000 ~SIZE~0)} call #t~ret13 := main(); {19271#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:02:51,522 INFO L273 TraceCheckUtils]: 5: Hoare triple {19271#(<= 100000 ~SIZE~0)} havoc ~i~1;havoc ~pos~0;~n~0 := 0;~found~0 := 0;call ~#set~0.base, ~#set~0.offset := #Ultimate.alloc(4 * ~SIZE~0);call ~#values~0.base, ~#values~0.offset := #Ultimate.alloc(4 * ~SIZE~0);havoc ~element~0;havoc ~v~0;~v~0 := 0; {19304#(and (<= main_~v~0 0) (<= 100000 ~SIZE~0))} is VALID [2018-11-18 23:02:51,523 INFO L273 TraceCheckUtils]: 6: Hoare triple {19304#(and (<= main_~v~0 0) (<= 100000 ~SIZE~0))} assume true; {19304#(and (<= main_~v~0 0) (<= 100000 ~SIZE~0))} is VALID [2018-11-18 23:02:51,524 INFO L273 TraceCheckUtils]: 7: Hoare triple {19304#(and (<= main_~v~0 0) (<= 100000 ~SIZE~0))} assume !!(~v~0 < ~SIZE~0);call #t~mem3 := read~int(~#values~0.base, ~#values~0.offset + 4 * ~v~0, 4); {19304#(and (<= main_~v~0 0) (<= 100000 ~SIZE~0))} is VALID [2018-11-18 23:02:51,525 INFO L256 TraceCheckUtils]: 8: Hoare triple {19304#(and (<= main_~v~0 0) (<= 100000 ~SIZE~0))} call #t~ret4 := elem_exists(~#set~0.base, ~#set~0.offset, ~n~0, #t~mem3); {19271#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:02:51,525 INFO L273 TraceCheckUtils]: 9: Hoare triple {19271#(<= 100000 ~SIZE~0)} ~set.base, ~set.offset := #in~set.base, #in~set.offset;~size := #in~size;~value := #in~value;havoc ~i~0;~i~0 := 0; {19271#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:02:51,526 INFO L273 TraceCheckUtils]: 10: Hoare triple {19271#(<= 100000 ~SIZE~0)} assume true; {19271#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:02:51,526 INFO L273 TraceCheckUtils]: 11: Hoare triple {19271#(<= 100000 ~SIZE~0)} assume !(~i~0 < ~size); {19271#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:02:51,527 INFO L273 TraceCheckUtils]: 12: Hoare triple {19271#(<= 100000 ~SIZE~0)} #res := 0; {19271#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:02:51,527 INFO L273 TraceCheckUtils]: 13: Hoare triple {19271#(<= 100000 ~SIZE~0)} assume true; {19271#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:02:51,529 INFO L268 TraceCheckUtils]: 14: Hoare quadruple {19271#(<= 100000 ~SIZE~0)} {19304#(and (<= main_~v~0 0) (<= 100000 ~SIZE~0))} #132#return; {19304#(and (<= main_~v~0 0) (<= 100000 ~SIZE~0))} is VALID [2018-11-18 23:02:51,529 INFO L273 TraceCheckUtils]: 15: Hoare triple {19304#(and (<= main_~v~0 0) (<= 100000 ~SIZE~0))} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {19304#(and (<= main_~v~0 0) (<= 100000 ~SIZE~0))} is VALID [2018-11-18 23:02:51,530 INFO L273 TraceCheckUtils]: 16: Hoare triple {19304#(and (<= main_~v~0 0) (<= 100000 ~SIZE~0))} assume 1 != #t~ret4;havoc #t~mem3;havoc #t~ret4;call #t~mem5 := read~int(~#values~0.base, ~#values~0.offset + 4 * ~v~0, 4); {19304#(and (<= main_~v~0 0) (<= 100000 ~SIZE~0))} is VALID [2018-11-18 23:02:51,532 INFO L256 TraceCheckUtils]: 17: Hoare triple {19304#(and (<= main_~v~0 0) (<= 100000 ~SIZE~0))} call #t~ret6 := insert(~#set~0.base, ~#set~0.offset, ~n~0, #t~mem5); {19271#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:02:51,532 INFO L273 TraceCheckUtils]: 18: Hoare triple {19271#(<= 100000 ~SIZE~0)} ~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; {19271#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:02:51,533 INFO L273 TraceCheckUtils]: 19: Hoare triple {19271#(<= 100000 ~SIZE~0)} assume true; {19271#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:02:51,534 INFO L268 TraceCheckUtils]: 20: Hoare quadruple {19271#(<= 100000 ~SIZE~0)} {19304#(and (<= main_~v~0 0) (<= 100000 ~SIZE~0))} #134#return; {19304#(and (<= main_~v~0 0) (<= 100000 ~SIZE~0))} is VALID [2018-11-18 23:02:51,534 INFO L273 TraceCheckUtils]: 21: Hoare triple {19304#(and (<= main_~v~0 0) (<= 100000 ~SIZE~0))} assume -2147483648 <= #t~ret6 && #t~ret6 <= 2147483647;~n~0 := #t~ret6;havoc #t~ret6;havoc #t~mem5; {19304#(and (<= main_~v~0 0) (<= 100000 ~SIZE~0))} is VALID [2018-11-18 23:02:51,535 INFO L273 TraceCheckUtils]: 22: Hoare triple {19304#(and (<= main_~v~0 0) (<= 100000 ~SIZE~0))} #t~post2 := ~v~0;~v~0 := 1 + #t~post2;havoc #t~post2; {19356#(and (<= main_~v~0 1) (<= 100000 ~SIZE~0))} is VALID [2018-11-18 23:02:51,536 INFO L273 TraceCheckUtils]: 23: Hoare triple {19356#(and (<= main_~v~0 1) (<= 100000 ~SIZE~0))} assume true; {19356#(and (<= main_~v~0 1) (<= 100000 ~SIZE~0))} is VALID [2018-11-18 23:02:51,537 INFO L273 TraceCheckUtils]: 24: Hoare triple {19356#(and (<= main_~v~0 1) (<= 100000 ~SIZE~0))} assume !!(~v~0 < ~SIZE~0);call #t~mem3 := read~int(~#values~0.base, ~#values~0.offset + 4 * ~v~0, 4); {19356#(and (<= main_~v~0 1) (<= 100000 ~SIZE~0))} is VALID [2018-11-18 23:02:51,538 INFO L256 TraceCheckUtils]: 25: Hoare triple {19356#(and (<= main_~v~0 1) (<= 100000 ~SIZE~0))} call #t~ret4 := elem_exists(~#set~0.base, ~#set~0.offset, ~n~0, #t~mem3); {19271#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:02:51,538 INFO L273 TraceCheckUtils]: 26: Hoare triple {19271#(<= 100000 ~SIZE~0)} ~set.base, ~set.offset := #in~set.base, #in~set.offset;~size := #in~size;~value := #in~value;havoc ~i~0;~i~0 := 0; {19271#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:02:51,539 INFO L273 TraceCheckUtils]: 27: Hoare triple {19271#(<= 100000 ~SIZE~0)} assume true; {19271#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:02:51,539 INFO L273 TraceCheckUtils]: 28: Hoare triple {19271#(<= 100000 ~SIZE~0)} assume !!(~i~0 < ~size);call #t~mem1 := read~int(~set.base, ~set.offset + 4 * ~i~0, 4); {19271#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:02:51,540 INFO L273 TraceCheckUtils]: 29: Hoare triple {19271#(<= 100000 ~SIZE~0)} assume #t~mem1 == ~value;havoc #t~mem1;#res := 1; {19271#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:02:51,540 INFO L273 TraceCheckUtils]: 30: Hoare triple {19271#(<= 100000 ~SIZE~0)} assume true; {19271#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:02:51,542 INFO L268 TraceCheckUtils]: 31: Hoare quadruple {19271#(<= 100000 ~SIZE~0)} {19356#(and (<= main_~v~0 1) (<= 100000 ~SIZE~0))} #132#return; {19356#(and (<= main_~v~0 1) (<= 100000 ~SIZE~0))} is VALID [2018-11-18 23:02:51,542 INFO L273 TraceCheckUtils]: 32: Hoare triple {19356#(and (<= main_~v~0 1) (<= 100000 ~SIZE~0))} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {19356#(and (<= main_~v~0 1) (<= 100000 ~SIZE~0))} is VALID [2018-11-18 23:02:51,543 INFO L273 TraceCheckUtils]: 33: Hoare triple {19356#(and (<= main_~v~0 1) (<= 100000 ~SIZE~0))} assume !(1 != #t~ret4);havoc #t~mem3;havoc #t~ret4; {19356#(and (<= main_~v~0 1) (<= 100000 ~SIZE~0))} is VALID [2018-11-18 23:02:51,544 INFO L273 TraceCheckUtils]: 34: Hoare triple {19356#(and (<= main_~v~0 1) (<= 100000 ~SIZE~0))} #t~post2 := ~v~0;~v~0 := 1 + #t~post2;havoc #t~post2; {19393#(and (<= main_~v~0 2) (<= 100000 ~SIZE~0))} is VALID [2018-11-18 23:02:51,544 INFO L273 TraceCheckUtils]: 35: Hoare triple {19393#(and (<= main_~v~0 2) (<= 100000 ~SIZE~0))} assume true; {19393#(and (<= main_~v~0 2) (<= 100000 ~SIZE~0))} is VALID [2018-11-18 23:02:51,545 INFO L273 TraceCheckUtils]: 36: Hoare triple {19393#(and (<= main_~v~0 2) (<= 100000 ~SIZE~0))} assume !!(~v~0 < ~SIZE~0);call #t~mem3 := read~int(~#values~0.base, ~#values~0.offset + 4 * ~v~0, 4); {19393#(and (<= main_~v~0 2) (<= 100000 ~SIZE~0))} is VALID [2018-11-18 23:02:51,546 INFO L256 TraceCheckUtils]: 37: Hoare triple {19393#(and (<= main_~v~0 2) (<= 100000 ~SIZE~0))} call #t~ret4 := elem_exists(~#set~0.base, ~#set~0.offset, ~n~0, #t~mem3); {19271#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:02:51,547 INFO L273 TraceCheckUtils]: 38: Hoare triple {19271#(<= 100000 ~SIZE~0)} ~set.base, ~set.offset := #in~set.base, #in~set.offset;~size := #in~size;~value := #in~value;havoc ~i~0;~i~0 := 0; {19271#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:02:51,547 INFO L273 TraceCheckUtils]: 39: Hoare triple {19271#(<= 100000 ~SIZE~0)} assume true; {19271#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:02:51,548 INFO L273 TraceCheckUtils]: 40: Hoare triple {19271#(<= 100000 ~SIZE~0)} assume !!(~i~0 < ~size);call #t~mem1 := read~int(~set.base, ~set.offset + 4 * ~i~0, 4); {19271#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:02:51,548 INFO L273 TraceCheckUtils]: 41: Hoare triple {19271#(<= 100000 ~SIZE~0)} assume #t~mem1 == ~value;havoc #t~mem1;#res := 1; {19271#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:02:51,549 INFO L273 TraceCheckUtils]: 42: Hoare triple {19271#(<= 100000 ~SIZE~0)} assume true; {19271#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:02:51,550 INFO L268 TraceCheckUtils]: 43: Hoare quadruple {19271#(<= 100000 ~SIZE~0)} {19393#(and (<= main_~v~0 2) (<= 100000 ~SIZE~0))} #132#return; {19393#(and (<= main_~v~0 2) (<= 100000 ~SIZE~0))} is VALID [2018-11-18 23:02:51,551 INFO L273 TraceCheckUtils]: 44: Hoare triple {19393#(and (<= main_~v~0 2) (<= 100000 ~SIZE~0))} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {19393#(and (<= main_~v~0 2) (<= 100000 ~SIZE~0))} is VALID [2018-11-18 23:02:51,551 INFO L273 TraceCheckUtils]: 45: Hoare triple {19393#(and (<= main_~v~0 2) (<= 100000 ~SIZE~0))} assume !(1 != #t~ret4);havoc #t~mem3;havoc #t~ret4; {19393#(and (<= main_~v~0 2) (<= 100000 ~SIZE~0))} is VALID [2018-11-18 23:02:51,552 INFO L273 TraceCheckUtils]: 46: Hoare triple {19393#(and (<= main_~v~0 2) (<= 100000 ~SIZE~0))} #t~post2 := ~v~0;~v~0 := 1 + #t~post2;havoc #t~post2; {19430#(and (<= main_~v~0 3) (<= 100000 ~SIZE~0))} is VALID [2018-11-18 23:02:51,553 INFO L273 TraceCheckUtils]: 47: Hoare triple {19430#(and (<= main_~v~0 3) (<= 100000 ~SIZE~0))} assume true; {19430#(and (<= main_~v~0 3) (<= 100000 ~SIZE~0))} is VALID [2018-11-18 23:02:51,554 INFO L273 TraceCheckUtils]: 48: Hoare triple {19430#(and (<= main_~v~0 3) (<= 100000 ~SIZE~0))} assume !!(~v~0 < ~SIZE~0);call #t~mem3 := read~int(~#values~0.base, ~#values~0.offset + 4 * ~v~0, 4); {19430#(and (<= main_~v~0 3) (<= 100000 ~SIZE~0))} is VALID [2018-11-18 23:02:51,555 INFO L256 TraceCheckUtils]: 49: Hoare triple {19430#(and (<= main_~v~0 3) (<= 100000 ~SIZE~0))} call #t~ret4 := elem_exists(~#set~0.base, ~#set~0.offset, ~n~0, #t~mem3); {19271#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:02:51,555 INFO L273 TraceCheckUtils]: 50: Hoare triple {19271#(<= 100000 ~SIZE~0)} ~set.base, ~set.offset := #in~set.base, #in~set.offset;~size := #in~size;~value := #in~value;havoc ~i~0;~i~0 := 0; {19271#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:02:51,556 INFO L273 TraceCheckUtils]: 51: Hoare triple {19271#(<= 100000 ~SIZE~0)} assume true; {19271#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:02:51,556 INFO L273 TraceCheckUtils]: 52: Hoare triple {19271#(<= 100000 ~SIZE~0)} assume !!(~i~0 < ~size);call #t~mem1 := read~int(~set.base, ~set.offset + 4 * ~i~0, 4); {19271#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:02:51,557 INFO L273 TraceCheckUtils]: 53: Hoare triple {19271#(<= 100000 ~SIZE~0)} assume #t~mem1 == ~value;havoc #t~mem1;#res := 1; {19271#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:02:51,557 INFO L273 TraceCheckUtils]: 54: Hoare triple {19271#(<= 100000 ~SIZE~0)} assume true; {19271#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:02:51,559 INFO L268 TraceCheckUtils]: 55: Hoare quadruple {19271#(<= 100000 ~SIZE~0)} {19430#(and (<= main_~v~0 3) (<= 100000 ~SIZE~0))} #132#return; {19430#(and (<= main_~v~0 3) (<= 100000 ~SIZE~0))} is VALID [2018-11-18 23:02:51,559 INFO L273 TraceCheckUtils]: 56: Hoare triple {19430#(and (<= main_~v~0 3) (<= 100000 ~SIZE~0))} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {19430#(and (<= main_~v~0 3) (<= 100000 ~SIZE~0))} is VALID [2018-11-18 23:02:51,560 INFO L273 TraceCheckUtils]: 57: Hoare triple {19430#(and (<= main_~v~0 3) (<= 100000 ~SIZE~0))} assume !(1 != #t~ret4);havoc #t~mem3;havoc #t~ret4; {19430#(and (<= main_~v~0 3) (<= 100000 ~SIZE~0))} is VALID [2018-11-18 23:02:51,561 INFO L273 TraceCheckUtils]: 58: Hoare triple {19430#(and (<= main_~v~0 3) (<= 100000 ~SIZE~0))} #t~post2 := ~v~0;~v~0 := 1 + #t~post2;havoc #t~post2; {19467#(and (<= main_~v~0 4) (<= 100000 ~SIZE~0))} is VALID [2018-11-18 23:02:51,561 INFO L273 TraceCheckUtils]: 59: Hoare triple {19467#(and (<= main_~v~0 4) (<= 100000 ~SIZE~0))} assume true; {19467#(and (<= main_~v~0 4) (<= 100000 ~SIZE~0))} is VALID [2018-11-18 23:02:51,562 INFO L273 TraceCheckUtils]: 60: Hoare triple {19467#(and (<= main_~v~0 4) (<= 100000 ~SIZE~0))} assume !!(~v~0 < ~SIZE~0);call #t~mem3 := read~int(~#values~0.base, ~#values~0.offset + 4 * ~v~0, 4); {19467#(and (<= main_~v~0 4) (<= 100000 ~SIZE~0))} is VALID [2018-11-18 23:02:51,563 INFO L256 TraceCheckUtils]: 61: Hoare triple {19467#(and (<= main_~v~0 4) (<= 100000 ~SIZE~0))} call #t~ret4 := elem_exists(~#set~0.base, ~#set~0.offset, ~n~0, #t~mem3); {19271#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:02:51,564 INFO L273 TraceCheckUtils]: 62: Hoare triple {19271#(<= 100000 ~SIZE~0)} ~set.base, ~set.offset := #in~set.base, #in~set.offset;~size := #in~size;~value := #in~value;havoc ~i~0;~i~0 := 0; {19271#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:02:51,564 INFO L273 TraceCheckUtils]: 63: Hoare triple {19271#(<= 100000 ~SIZE~0)} assume true; {19271#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:02:51,565 INFO L273 TraceCheckUtils]: 64: Hoare triple {19271#(<= 100000 ~SIZE~0)} assume !!(~i~0 < ~size);call #t~mem1 := read~int(~set.base, ~set.offset + 4 * ~i~0, 4); {19271#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:02:51,565 INFO L273 TraceCheckUtils]: 65: Hoare triple {19271#(<= 100000 ~SIZE~0)} assume #t~mem1 == ~value;havoc #t~mem1;#res := 1; {19271#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:02:51,566 INFO L273 TraceCheckUtils]: 66: Hoare triple {19271#(<= 100000 ~SIZE~0)} assume true; {19271#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:02:51,567 INFO L268 TraceCheckUtils]: 67: Hoare quadruple {19271#(<= 100000 ~SIZE~0)} {19467#(and (<= main_~v~0 4) (<= 100000 ~SIZE~0))} #132#return; {19467#(and (<= main_~v~0 4) (<= 100000 ~SIZE~0))} is VALID [2018-11-18 23:02:51,568 INFO L273 TraceCheckUtils]: 68: Hoare triple {19467#(and (<= main_~v~0 4) (<= 100000 ~SIZE~0))} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {19467#(and (<= main_~v~0 4) (<= 100000 ~SIZE~0))} is VALID [2018-11-18 23:02:51,568 INFO L273 TraceCheckUtils]: 69: Hoare triple {19467#(and (<= main_~v~0 4) (<= 100000 ~SIZE~0))} assume !(1 != #t~ret4);havoc #t~mem3;havoc #t~ret4; {19467#(and (<= main_~v~0 4) (<= 100000 ~SIZE~0))} is VALID [2018-11-18 23:02:51,569 INFO L273 TraceCheckUtils]: 70: Hoare triple {19467#(and (<= main_~v~0 4) (<= 100000 ~SIZE~0))} #t~post2 := ~v~0;~v~0 := 1 + #t~post2;havoc #t~post2; {19504#(and (<= main_~v~0 5) (<= 100000 ~SIZE~0))} is VALID [2018-11-18 23:02:51,570 INFO L273 TraceCheckUtils]: 71: Hoare triple {19504#(and (<= main_~v~0 5) (<= 100000 ~SIZE~0))} assume true; {19504#(and (<= main_~v~0 5) (<= 100000 ~SIZE~0))} is VALID [2018-11-18 23:02:51,571 INFO L273 TraceCheckUtils]: 72: Hoare triple {19504#(and (<= main_~v~0 5) (<= 100000 ~SIZE~0))} assume !!(~v~0 < ~SIZE~0);call #t~mem3 := read~int(~#values~0.base, ~#values~0.offset + 4 * ~v~0, 4); {19504#(and (<= main_~v~0 5) (<= 100000 ~SIZE~0))} is VALID [2018-11-18 23:02:51,572 INFO L256 TraceCheckUtils]: 73: Hoare triple {19504#(and (<= main_~v~0 5) (<= 100000 ~SIZE~0))} call #t~ret4 := elem_exists(~#set~0.base, ~#set~0.offset, ~n~0, #t~mem3); {19271#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:02:51,572 INFO L273 TraceCheckUtils]: 74: Hoare triple {19271#(<= 100000 ~SIZE~0)} ~set.base, ~set.offset := #in~set.base, #in~set.offset;~size := #in~size;~value := #in~value;havoc ~i~0;~i~0 := 0; {19271#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:02:51,573 INFO L273 TraceCheckUtils]: 75: Hoare triple {19271#(<= 100000 ~SIZE~0)} assume true; {19271#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:02:51,573 INFO L273 TraceCheckUtils]: 76: Hoare triple {19271#(<= 100000 ~SIZE~0)} assume !!(~i~0 < ~size);call #t~mem1 := read~int(~set.base, ~set.offset + 4 * ~i~0, 4); {19271#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:02:51,574 INFO L273 TraceCheckUtils]: 77: Hoare triple {19271#(<= 100000 ~SIZE~0)} assume #t~mem1 == ~value;havoc #t~mem1;#res := 1; {19271#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:02:51,574 INFO L273 TraceCheckUtils]: 78: Hoare triple {19271#(<= 100000 ~SIZE~0)} assume true; {19271#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:02:51,576 INFO L268 TraceCheckUtils]: 79: Hoare quadruple {19271#(<= 100000 ~SIZE~0)} {19504#(and (<= main_~v~0 5) (<= 100000 ~SIZE~0))} #132#return; {19504#(and (<= main_~v~0 5) (<= 100000 ~SIZE~0))} is VALID [2018-11-18 23:02:51,576 INFO L273 TraceCheckUtils]: 80: Hoare triple {19504#(and (<= main_~v~0 5) (<= 100000 ~SIZE~0))} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {19504#(and (<= main_~v~0 5) (<= 100000 ~SIZE~0))} is VALID [2018-11-18 23:02:51,577 INFO L273 TraceCheckUtils]: 81: Hoare triple {19504#(and (<= main_~v~0 5) (<= 100000 ~SIZE~0))} assume !(1 != #t~ret4);havoc #t~mem3;havoc #t~ret4; {19504#(and (<= main_~v~0 5) (<= 100000 ~SIZE~0))} is VALID [2018-11-18 23:02:51,578 INFO L273 TraceCheckUtils]: 82: Hoare triple {19504#(and (<= main_~v~0 5) (<= 100000 ~SIZE~0))} #t~post2 := ~v~0;~v~0 := 1 + #t~post2;havoc #t~post2; {19541#(and (<= main_~v~0 6) (<= 100000 ~SIZE~0))} is VALID [2018-11-18 23:02:51,579 INFO L273 TraceCheckUtils]: 83: Hoare triple {19541#(and (<= main_~v~0 6) (<= 100000 ~SIZE~0))} assume true; {19541#(and (<= main_~v~0 6) (<= 100000 ~SIZE~0))} is VALID [2018-11-18 23:02:51,579 INFO L273 TraceCheckUtils]: 84: Hoare triple {19541#(and (<= main_~v~0 6) (<= 100000 ~SIZE~0))} assume !!(~v~0 < ~SIZE~0);call #t~mem3 := read~int(~#values~0.base, ~#values~0.offset + 4 * ~v~0, 4); {19541#(and (<= main_~v~0 6) (<= 100000 ~SIZE~0))} is VALID [2018-11-18 23:02:51,581 INFO L256 TraceCheckUtils]: 85: Hoare triple {19541#(and (<= main_~v~0 6) (<= 100000 ~SIZE~0))} call #t~ret4 := elem_exists(~#set~0.base, ~#set~0.offset, ~n~0, #t~mem3); {19271#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:02:51,581 INFO L273 TraceCheckUtils]: 86: Hoare triple {19271#(<= 100000 ~SIZE~0)} ~set.base, ~set.offset := #in~set.base, #in~set.offset;~size := #in~size;~value := #in~value;havoc ~i~0;~i~0 := 0; {19271#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:02:51,582 INFO L273 TraceCheckUtils]: 87: Hoare triple {19271#(<= 100000 ~SIZE~0)} assume true; {19271#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:02:51,582 INFO L273 TraceCheckUtils]: 88: Hoare triple {19271#(<= 100000 ~SIZE~0)} assume !!(~i~0 < ~size);call #t~mem1 := read~int(~set.base, ~set.offset + 4 * ~i~0, 4); {19271#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:02:51,583 INFO L273 TraceCheckUtils]: 89: Hoare triple {19271#(<= 100000 ~SIZE~0)} assume #t~mem1 == ~value;havoc #t~mem1;#res := 1; {19271#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:02:51,583 INFO L273 TraceCheckUtils]: 90: Hoare triple {19271#(<= 100000 ~SIZE~0)} assume true; {19271#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:02:51,584 INFO L268 TraceCheckUtils]: 91: Hoare quadruple {19271#(<= 100000 ~SIZE~0)} {19541#(and (<= main_~v~0 6) (<= 100000 ~SIZE~0))} #132#return; {19541#(and (<= main_~v~0 6) (<= 100000 ~SIZE~0))} is VALID [2018-11-18 23:02:51,585 INFO L273 TraceCheckUtils]: 92: Hoare triple {19541#(and (<= main_~v~0 6) (<= 100000 ~SIZE~0))} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {19541#(and (<= main_~v~0 6) (<= 100000 ~SIZE~0))} is VALID [2018-11-18 23:02:51,586 INFO L273 TraceCheckUtils]: 93: Hoare triple {19541#(and (<= main_~v~0 6) (<= 100000 ~SIZE~0))} assume !(1 != #t~ret4);havoc #t~mem3;havoc #t~ret4; {19541#(and (<= main_~v~0 6) (<= 100000 ~SIZE~0))} is VALID [2018-11-18 23:02:51,586 INFO L273 TraceCheckUtils]: 94: Hoare triple {19541#(and (<= main_~v~0 6) (<= 100000 ~SIZE~0))} #t~post2 := ~v~0;~v~0 := 1 + #t~post2;havoc #t~post2; {19578#(and (<= main_~v~0 7) (<= 100000 ~SIZE~0))} is VALID [2018-11-18 23:02:51,587 INFO L273 TraceCheckUtils]: 95: Hoare triple {19578#(and (<= main_~v~0 7) (<= 100000 ~SIZE~0))} assume true; {19578#(and (<= main_~v~0 7) (<= 100000 ~SIZE~0))} is VALID [2018-11-18 23:02:51,588 INFO L273 TraceCheckUtils]: 96: Hoare triple {19578#(and (<= main_~v~0 7) (<= 100000 ~SIZE~0))} assume !!(~v~0 < ~SIZE~0);call #t~mem3 := read~int(~#values~0.base, ~#values~0.offset + 4 * ~v~0, 4); {19578#(and (<= main_~v~0 7) (<= 100000 ~SIZE~0))} is VALID [2018-11-18 23:02:51,589 INFO L256 TraceCheckUtils]: 97: Hoare triple {19578#(and (<= main_~v~0 7) (<= 100000 ~SIZE~0))} call #t~ret4 := elem_exists(~#set~0.base, ~#set~0.offset, ~n~0, #t~mem3); {19271#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:02:51,590 INFO L273 TraceCheckUtils]: 98: Hoare triple {19271#(<= 100000 ~SIZE~0)} ~set.base, ~set.offset := #in~set.base, #in~set.offset;~size := #in~size;~value := #in~value;havoc ~i~0;~i~0 := 0; {19271#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:02:51,590 INFO L273 TraceCheckUtils]: 99: Hoare triple {19271#(<= 100000 ~SIZE~0)} assume true; {19271#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:02:51,591 INFO L273 TraceCheckUtils]: 100: Hoare triple {19271#(<= 100000 ~SIZE~0)} assume !!(~i~0 < ~size);call #t~mem1 := read~int(~set.base, ~set.offset + 4 * ~i~0, 4); {19271#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:02:51,591 INFO L273 TraceCheckUtils]: 101: Hoare triple {19271#(<= 100000 ~SIZE~0)} assume #t~mem1 == ~value;havoc #t~mem1;#res := 1; {19271#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:02:51,592 INFO L273 TraceCheckUtils]: 102: Hoare triple {19271#(<= 100000 ~SIZE~0)} assume true; {19271#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:02:51,593 INFO L268 TraceCheckUtils]: 103: Hoare quadruple {19271#(<= 100000 ~SIZE~0)} {19578#(and (<= main_~v~0 7) (<= 100000 ~SIZE~0))} #132#return; {19578#(and (<= main_~v~0 7) (<= 100000 ~SIZE~0))} is VALID [2018-11-18 23:02:51,594 INFO L273 TraceCheckUtils]: 104: Hoare triple {19578#(and (<= main_~v~0 7) (<= 100000 ~SIZE~0))} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {19578#(and (<= main_~v~0 7) (<= 100000 ~SIZE~0))} is VALID [2018-11-18 23:02:51,594 INFO L273 TraceCheckUtils]: 105: Hoare triple {19578#(and (<= main_~v~0 7) (<= 100000 ~SIZE~0))} assume !(1 != #t~ret4);havoc #t~mem3;havoc #t~ret4; {19578#(and (<= main_~v~0 7) (<= 100000 ~SIZE~0))} is VALID [2018-11-18 23:02:51,595 INFO L273 TraceCheckUtils]: 106: Hoare triple {19578#(and (<= main_~v~0 7) (<= 100000 ~SIZE~0))} #t~post2 := ~v~0;~v~0 := 1 + #t~post2;havoc #t~post2; {19615#(and (<= main_~v~0 8) (<= 100000 ~SIZE~0))} is VALID [2018-11-18 23:02:51,596 INFO L273 TraceCheckUtils]: 107: Hoare triple {19615#(and (<= main_~v~0 8) (<= 100000 ~SIZE~0))} assume true; {19615#(and (<= main_~v~0 8) (<= 100000 ~SIZE~0))} is VALID [2018-11-18 23:02:51,596 INFO L273 TraceCheckUtils]: 108: Hoare triple {19615#(and (<= main_~v~0 8) (<= 100000 ~SIZE~0))} assume !!(~v~0 < ~SIZE~0);call #t~mem3 := read~int(~#values~0.base, ~#values~0.offset + 4 * ~v~0, 4); {19615#(and (<= main_~v~0 8) (<= 100000 ~SIZE~0))} is VALID [2018-11-18 23:02:51,598 INFO L256 TraceCheckUtils]: 109: Hoare triple {19615#(and (<= main_~v~0 8) (<= 100000 ~SIZE~0))} call #t~ret4 := elem_exists(~#set~0.base, ~#set~0.offset, ~n~0, #t~mem3); {19271#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:02:51,598 INFO L273 TraceCheckUtils]: 110: Hoare triple {19271#(<= 100000 ~SIZE~0)} ~set.base, ~set.offset := #in~set.base, #in~set.offset;~size := #in~size;~value := #in~value;havoc ~i~0;~i~0 := 0; {19271#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:02:51,599 INFO L273 TraceCheckUtils]: 111: Hoare triple {19271#(<= 100000 ~SIZE~0)} assume true; {19271#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:02:51,599 INFO L273 TraceCheckUtils]: 112: Hoare triple {19271#(<= 100000 ~SIZE~0)} assume !!(~i~0 < ~size);call #t~mem1 := read~int(~set.base, ~set.offset + 4 * ~i~0, 4); {19271#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:02:51,600 INFO L273 TraceCheckUtils]: 113: Hoare triple {19271#(<= 100000 ~SIZE~0)} assume #t~mem1 == ~value;havoc #t~mem1;#res := 1; {19271#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:02:51,600 INFO L273 TraceCheckUtils]: 114: Hoare triple {19271#(<= 100000 ~SIZE~0)} assume true; {19271#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:02:51,602 INFO L268 TraceCheckUtils]: 115: Hoare quadruple {19271#(<= 100000 ~SIZE~0)} {19615#(and (<= main_~v~0 8) (<= 100000 ~SIZE~0))} #132#return; {19615#(and (<= main_~v~0 8) (<= 100000 ~SIZE~0))} is VALID [2018-11-18 23:02:51,602 INFO L273 TraceCheckUtils]: 116: Hoare triple {19615#(and (<= main_~v~0 8) (<= 100000 ~SIZE~0))} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {19615#(and (<= main_~v~0 8) (<= 100000 ~SIZE~0))} is VALID [2018-11-18 23:02:51,603 INFO L273 TraceCheckUtils]: 117: Hoare triple {19615#(and (<= main_~v~0 8) (<= 100000 ~SIZE~0))} assume !(1 != #t~ret4);havoc #t~mem3;havoc #t~ret4; {19615#(and (<= main_~v~0 8) (<= 100000 ~SIZE~0))} is VALID [2018-11-18 23:02:51,604 INFO L273 TraceCheckUtils]: 118: Hoare triple {19615#(and (<= main_~v~0 8) (<= 100000 ~SIZE~0))} #t~post2 := ~v~0;~v~0 := 1 + #t~post2;havoc #t~post2; {19652#(and (<= main_~v~0 9) (<= 100000 ~SIZE~0))} is VALID [2018-11-18 23:02:51,604 INFO L273 TraceCheckUtils]: 119: Hoare triple {19652#(and (<= main_~v~0 9) (<= 100000 ~SIZE~0))} assume true; {19652#(and (<= main_~v~0 9) (<= 100000 ~SIZE~0))} is VALID [2018-11-18 23:02:51,605 INFO L273 TraceCheckUtils]: 120: Hoare triple {19652#(and (<= main_~v~0 9) (<= 100000 ~SIZE~0))} assume !!(~v~0 < ~SIZE~0);call #t~mem3 := read~int(~#values~0.base, ~#values~0.offset + 4 * ~v~0, 4); {19652#(and (<= main_~v~0 9) (<= 100000 ~SIZE~0))} is VALID [2018-11-18 23:02:51,606 INFO L256 TraceCheckUtils]: 121: Hoare triple {19652#(and (<= main_~v~0 9) (<= 100000 ~SIZE~0))} call #t~ret4 := elem_exists(~#set~0.base, ~#set~0.offset, ~n~0, #t~mem3); {19271#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:02:51,607 INFO L273 TraceCheckUtils]: 122: Hoare triple {19271#(<= 100000 ~SIZE~0)} ~set.base, ~set.offset := #in~set.base, #in~set.offset;~size := #in~size;~value := #in~value;havoc ~i~0;~i~0 := 0; {19271#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:02:51,608 INFO L273 TraceCheckUtils]: 123: Hoare triple {19271#(<= 100000 ~SIZE~0)} assume true; {19271#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:02:51,608 INFO L273 TraceCheckUtils]: 124: Hoare triple {19271#(<= 100000 ~SIZE~0)} assume !!(~i~0 < ~size);call #t~mem1 := read~int(~set.base, ~set.offset + 4 * ~i~0, 4); {19271#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:02:51,609 INFO L273 TraceCheckUtils]: 125: Hoare triple {19271#(<= 100000 ~SIZE~0)} assume #t~mem1 == ~value;havoc #t~mem1;#res := 1; {19271#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:02:51,609 INFO L273 TraceCheckUtils]: 126: Hoare triple {19271#(<= 100000 ~SIZE~0)} assume true; {19271#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:02:51,610 INFO L268 TraceCheckUtils]: 127: Hoare quadruple {19271#(<= 100000 ~SIZE~0)} {19652#(and (<= main_~v~0 9) (<= 100000 ~SIZE~0))} #132#return; {19652#(and (<= main_~v~0 9) (<= 100000 ~SIZE~0))} is VALID [2018-11-18 23:02:51,611 INFO L273 TraceCheckUtils]: 128: Hoare triple {19652#(and (<= main_~v~0 9) (<= 100000 ~SIZE~0))} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {19652#(and (<= main_~v~0 9) (<= 100000 ~SIZE~0))} is VALID [2018-11-18 23:02:51,612 INFO L273 TraceCheckUtils]: 129: Hoare triple {19652#(and (<= main_~v~0 9) (<= 100000 ~SIZE~0))} assume !(1 != #t~ret4);havoc #t~mem3;havoc #t~ret4; {19652#(and (<= main_~v~0 9) (<= 100000 ~SIZE~0))} is VALID [2018-11-18 23:02:51,612 INFO L273 TraceCheckUtils]: 130: Hoare triple {19652#(and (<= main_~v~0 9) (<= 100000 ~SIZE~0))} #t~post2 := ~v~0;~v~0 := 1 + #t~post2;havoc #t~post2; {19689#(and (<= main_~v~0 10) (<= 100000 ~SIZE~0))} is VALID [2018-11-18 23:02:51,613 INFO L273 TraceCheckUtils]: 131: Hoare triple {19689#(and (<= main_~v~0 10) (<= 100000 ~SIZE~0))} assume true; {19689#(and (<= main_~v~0 10) (<= 100000 ~SIZE~0))} is VALID [2018-11-18 23:02:51,614 INFO L273 TraceCheckUtils]: 132: Hoare triple {19689#(and (<= main_~v~0 10) (<= 100000 ~SIZE~0))} assume !!(~v~0 < ~SIZE~0);call #t~mem3 := read~int(~#values~0.base, ~#values~0.offset + 4 * ~v~0, 4); {19689#(and (<= main_~v~0 10) (<= 100000 ~SIZE~0))} is VALID [2018-11-18 23:02:51,615 INFO L256 TraceCheckUtils]: 133: Hoare triple {19689#(and (<= main_~v~0 10) (<= 100000 ~SIZE~0))} call #t~ret4 := elem_exists(~#set~0.base, ~#set~0.offset, ~n~0, #t~mem3); {19271#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:02:51,616 INFO L273 TraceCheckUtils]: 134: Hoare triple {19271#(<= 100000 ~SIZE~0)} ~set.base, ~set.offset := #in~set.base, #in~set.offset;~size := #in~size;~value := #in~value;havoc ~i~0;~i~0 := 0; {19271#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:02:51,616 INFO L273 TraceCheckUtils]: 135: Hoare triple {19271#(<= 100000 ~SIZE~0)} assume true; {19271#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:02:51,617 INFO L273 TraceCheckUtils]: 136: Hoare triple {19271#(<= 100000 ~SIZE~0)} assume !!(~i~0 < ~size);call #t~mem1 := read~int(~set.base, ~set.offset + 4 * ~i~0, 4); {19271#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:02:51,617 INFO L273 TraceCheckUtils]: 137: Hoare triple {19271#(<= 100000 ~SIZE~0)} assume #t~mem1 == ~value;havoc #t~mem1;#res := 1; {19271#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:02:51,618 INFO L273 TraceCheckUtils]: 138: Hoare triple {19271#(<= 100000 ~SIZE~0)} assume true; {19271#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:02:51,619 INFO L268 TraceCheckUtils]: 139: Hoare quadruple {19271#(<= 100000 ~SIZE~0)} {19689#(and (<= main_~v~0 10) (<= 100000 ~SIZE~0))} #132#return; {19689#(and (<= main_~v~0 10) (<= 100000 ~SIZE~0))} is VALID [2018-11-18 23:02:51,619 INFO L273 TraceCheckUtils]: 140: Hoare triple {19689#(and (<= main_~v~0 10) (<= 100000 ~SIZE~0))} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {19689#(and (<= main_~v~0 10) (<= 100000 ~SIZE~0))} is VALID [2018-11-18 23:02:51,620 INFO L273 TraceCheckUtils]: 141: Hoare triple {19689#(and (<= main_~v~0 10) (<= 100000 ~SIZE~0))} assume !(1 != #t~ret4);havoc #t~mem3;havoc #t~ret4; {19689#(and (<= main_~v~0 10) (<= 100000 ~SIZE~0))} is VALID [2018-11-18 23:02:51,621 INFO L273 TraceCheckUtils]: 142: Hoare triple {19689#(and (<= main_~v~0 10) (<= 100000 ~SIZE~0))} #t~post2 := ~v~0;~v~0 := 1 + #t~post2;havoc #t~post2; {19726#(and (<= main_~v~0 11) (<= 100000 ~SIZE~0))} is VALID [2018-11-18 23:02:51,621 INFO L273 TraceCheckUtils]: 143: Hoare triple {19726#(and (<= main_~v~0 11) (<= 100000 ~SIZE~0))} assume true; {19726#(and (<= main_~v~0 11) (<= 100000 ~SIZE~0))} is VALID [2018-11-18 23:02:51,622 INFO L273 TraceCheckUtils]: 144: Hoare triple {19726#(and (<= main_~v~0 11) (<= 100000 ~SIZE~0))} assume !!(~v~0 < ~SIZE~0);call #t~mem3 := read~int(~#values~0.base, ~#values~0.offset + 4 * ~v~0, 4); {19726#(and (<= main_~v~0 11) (<= 100000 ~SIZE~0))} is VALID [2018-11-18 23:02:51,623 INFO L256 TraceCheckUtils]: 145: Hoare triple {19726#(and (<= main_~v~0 11) (<= 100000 ~SIZE~0))} call #t~ret4 := elem_exists(~#set~0.base, ~#set~0.offset, ~n~0, #t~mem3); {19271#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:02:51,624 INFO L273 TraceCheckUtils]: 146: Hoare triple {19271#(<= 100000 ~SIZE~0)} ~set.base, ~set.offset := #in~set.base, #in~set.offset;~size := #in~size;~value := #in~value;havoc ~i~0;~i~0 := 0; {19271#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:02:51,624 INFO L273 TraceCheckUtils]: 147: Hoare triple {19271#(<= 100000 ~SIZE~0)} assume true; {19271#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:02:51,625 INFO L273 TraceCheckUtils]: 148: Hoare triple {19271#(<= 100000 ~SIZE~0)} assume !!(~i~0 < ~size);call #t~mem1 := read~int(~set.base, ~set.offset + 4 * ~i~0, 4); {19271#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:02:51,625 INFO L273 TraceCheckUtils]: 149: Hoare triple {19271#(<= 100000 ~SIZE~0)} assume #t~mem1 == ~value;havoc #t~mem1;#res := 1; {19271#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:02:51,626 INFO L273 TraceCheckUtils]: 150: Hoare triple {19271#(<= 100000 ~SIZE~0)} assume true; {19271#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:02:51,627 INFO L268 TraceCheckUtils]: 151: Hoare quadruple {19271#(<= 100000 ~SIZE~0)} {19726#(and (<= main_~v~0 11) (<= 100000 ~SIZE~0))} #132#return; {19726#(and (<= main_~v~0 11) (<= 100000 ~SIZE~0))} is VALID [2018-11-18 23:02:51,628 INFO L273 TraceCheckUtils]: 152: Hoare triple {19726#(and (<= main_~v~0 11) (<= 100000 ~SIZE~0))} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {19726#(and (<= main_~v~0 11) (<= 100000 ~SIZE~0))} is VALID [2018-11-18 23:02:51,628 INFO L273 TraceCheckUtils]: 153: Hoare triple {19726#(and (<= main_~v~0 11) (<= 100000 ~SIZE~0))} assume !(1 != #t~ret4);havoc #t~mem3;havoc #t~ret4; {19726#(and (<= main_~v~0 11) (<= 100000 ~SIZE~0))} is VALID [2018-11-18 23:02:51,629 INFO L273 TraceCheckUtils]: 154: Hoare triple {19726#(and (<= main_~v~0 11) (<= 100000 ~SIZE~0))} #t~post2 := ~v~0;~v~0 := 1 + #t~post2;havoc #t~post2; {19763#(and (<= main_~v~0 12) (<= 100000 ~SIZE~0))} is VALID [2018-11-18 23:02:51,630 INFO L273 TraceCheckUtils]: 155: Hoare triple {19763#(and (<= main_~v~0 12) (<= 100000 ~SIZE~0))} assume true; {19763#(and (<= main_~v~0 12) (<= 100000 ~SIZE~0))} is VALID [2018-11-18 23:02:51,631 INFO L273 TraceCheckUtils]: 156: Hoare triple {19763#(and (<= main_~v~0 12) (<= 100000 ~SIZE~0))} assume !!(~v~0 < ~SIZE~0);call #t~mem3 := read~int(~#values~0.base, ~#values~0.offset + 4 * ~v~0, 4); {19763#(and (<= main_~v~0 12) (<= 100000 ~SIZE~0))} is VALID [2018-11-18 23:02:51,632 INFO L256 TraceCheckUtils]: 157: Hoare triple {19763#(and (<= main_~v~0 12) (<= 100000 ~SIZE~0))} call #t~ret4 := elem_exists(~#set~0.base, ~#set~0.offset, ~n~0, #t~mem3); {19271#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:02:51,632 INFO L273 TraceCheckUtils]: 158: Hoare triple {19271#(<= 100000 ~SIZE~0)} ~set.base, ~set.offset := #in~set.base, #in~set.offset;~size := #in~size;~value := #in~value;havoc ~i~0;~i~0 := 0; {19271#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:02:51,633 INFO L273 TraceCheckUtils]: 159: Hoare triple {19271#(<= 100000 ~SIZE~0)} assume true; {19271#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:02:51,633 INFO L273 TraceCheckUtils]: 160: Hoare triple {19271#(<= 100000 ~SIZE~0)} assume !!(~i~0 < ~size);call #t~mem1 := read~int(~set.base, ~set.offset + 4 * ~i~0, 4); {19271#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:02:51,634 INFO L273 TraceCheckUtils]: 161: Hoare triple {19271#(<= 100000 ~SIZE~0)} assume #t~mem1 == ~value;havoc #t~mem1;#res := 1; {19271#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:02:51,634 INFO L273 TraceCheckUtils]: 162: Hoare triple {19271#(<= 100000 ~SIZE~0)} assume true; {19271#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:02:51,636 INFO L268 TraceCheckUtils]: 163: Hoare quadruple {19271#(<= 100000 ~SIZE~0)} {19763#(and (<= main_~v~0 12) (<= 100000 ~SIZE~0))} #132#return; {19763#(and (<= main_~v~0 12) (<= 100000 ~SIZE~0))} is VALID [2018-11-18 23:02:51,636 INFO L273 TraceCheckUtils]: 164: Hoare triple {19763#(and (<= main_~v~0 12) (<= 100000 ~SIZE~0))} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {19763#(and (<= main_~v~0 12) (<= 100000 ~SIZE~0))} is VALID [2018-11-18 23:02:51,637 INFO L273 TraceCheckUtils]: 165: Hoare triple {19763#(and (<= main_~v~0 12) (<= 100000 ~SIZE~0))} assume !(1 != #t~ret4);havoc #t~mem3;havoc #t~ret4; {19763#(and (<= main_~v~0 12) (<= 100000 ~SIZE~0))} is VALID [2018-11-18 23:02:51,638 INFO L273 TraceCheckUtils]: 166: Hoare triple {19763#(and (<= main_~v~0 12) (<= 100000 ~SIZE~0))} #t~post2 := ~v~0;~v~0 := 1 + #t~post2;havoc #t~post2; {19800#(and (<= main_~v~0 13) (<= 100000 ~SIZE~0))} is VALID [2018-11-18 23:02:51,638 INFO L273 TraceCheckUtils]: 167: Hoare triple {19800#(and (<= main_~v~0 13) (<= 100000 ~SIZE~0))} assume true; {19800#(and (<= main_~v~0 13) (<= 100000 ~SIZE~0))} is VALID [2018-11-18 23:02:51,639 INFO L273 TraceCheckUtils]: 168: Hoare triple {19800#(and (<= main_~v~0 13) (<= 100000 ~SIZE~0))} assume !(~v~0 < ~SIZE~0); {19270#false} is VALID [2018-11-18 23:02:51,639 INFO L273 TraceCheckUtils]: 169: Hoare triple {19270#false} ~i~1 := 0; {19270#false} is VALID [2018-11-18 23:02:51,640 INFO L273 TraceCheckUtils]: 170: Hoare triple {19270#false} assume true; {19270#false} is VALID [2018-11-18 23:02:51,640 INFO L273 TraceCheckUtils]: 171: Hoare triple {19270#false} assume !!(~i~1 < ~SIZE~0 && 1 != ~found~0);call #t~mem8 := read~int(~#set~0.base, ~#set~0.offset + 4 * ~i~1, 4); {19270#false} is VALID [2018-11-18 23:02:51,640 INFO L273 TraceCheckUtils]: 172: Hoare triple {19270#false} assume !(#t~mem8 == ~element~0);havoc #t~mem8; {19270#false} is VALID [2018-11-18 23:02:51,640 INFO L273 TraceCheckUtils]: 173: Hoare triple {19270#false} #t~post7 := ~i~1;~i~1 := 1 + #t~post7;havoc #t~post7; {19270#false} is VALID [2018-11-18 23:02:51,640 INFO L273 TraceCheckUtils]: 174: Hoare triple {19270#false} assume true; {19270#false} is VALID [2018-11-18 23:02:51,641 INFO L273 TraceCheckUtils]: 175: Hoare triple {19270#false} assume !!(~i~1 < ~SIZE~0 && 1 != ~found~0);call #t~mem8 := read~int(~#set~0.base, ~#set~0.offset + 4 * ~i~1, 4); {19270#false} is VALID [2018-11-18 23:02:51,641 INFO L273 TraceCheckUtils]: 176: Hoare triple {19270#false} assume !(#t~mem8 == ~element~0);havoc #t~mem8; {19270#false} is VALID [2018-11-18 23:02:51,641 INFO L273 TraceCheckUtils]: 177: Hoare triple {19270#false} #t~post7 := ~i~1;~i~1 := 1 + #t~post7;havoc #t~post7; {19270#false} is VALID [2018-11-18 23:02:51,641 INFO L273 TraceCheckUtils]: 178: Hoare triple {19270#false} assume true; {19270#false} is VALID [2018-11-18 23:02:51,641 INFO L273 TraceCheckUtils]: 179: Hoare triple {19270#false} assume !!(~i~1 < ~SIZE~0 && 1 != ~found~0);call #t~mem8 := read~int(~#set~0.base, ~#set~0.offset + 4 * ~i~1, 4); {19270#false} is VALID [2018-11-18 23:02:51,641 INFO L273 TraceCheckUtils]: 180: Hoare triple {19270#false} assume !(#t~mem8 == ~element~0);havoc #t~mem8; {19270#false} is VALID [2018-11-18 23:02:51,642 INFO L273 TraceCheckUtils]: 181: Hoare triple {19270#false} #t~post7 := ~i~1;~i~1 := 1 + #t~post7;havoc #t~post7; {19270#false} is VALID [2018-11-18 23:02:51,642 INFO L273 TraceCheckUtils]: 182: Hoare triple {19270#false} assume true; {19270#false} is VALID [2018-11-18 23:02:51,642 INFO L273 TraceCheckUtils]: 183: Hoare triple {19270#false} assume !!(~i~1 < ~SIZE~0 && 1 != ~found~0);call #t~mem8 := read~int(~#set~0.base, ~#set~0.offset + 4 * ~i~1, 4); {19270#false} is VALID [2018-11-18 23:02:51,642 INFO L273 TraceCheckUtils]: 184: Hoare triple {19270#false} assume #t~mem8 == ~element~0;havoc #t~mem8;~found~0 := 1;~pos~0 := ~i~1; {19270#false} is VALID [2018-11-18 23:02:51,642 INFO L273 TraceCheckUtils]: 185: Hoare triple {19270#false} #t~post7 := ~i~1;~i~1 := 1 + #t~post7;havoc #t~post7; {19270#false} is VALID [2018-11-18 23:02:51,643 INFO L273 TraceCheckUtils]: 186: Hoare triple {19270#false} assume true; {19270#false} is VALID [2018-11-18 23:02:51,643 INFO L273 TraceCheckUtils]: 187: Hoare triple {19270#false} assume !(~i~1 < ~SIZE~0 && 1 != ~found~0); {19270#false} is VALID [2018-11-18 23:02:51,643 INFO L273 TraceCheckUtils]: 188: Hoare triple {19270#false} assume 1 == ~found~0;~i~1 := ~pos~0; {19270#false} is VALID [2018-11-18 23:02:51,644 INFO L273 TraceCheckUtils]: 189: Hoare triple {19270#false} assume true; {19270#false} is VALID [2018-11-18 23:02:51,644 INFO L273 TraceCheckUtils]: 190: Hoare triple {19270#false} assume !(~i~1 < ~SIZE~0 - 1); {19270#false} is VALID [2018-11-18 23:02:51,644 INFO L273 TraceCheckUtils]: 191: Hoare triple {19270#false} assume 1 == ~found~0;~i~1 := 0; {19270#false} is VALID [2018-11-18 23:02:51,644 INFO L273 TraceCheckUtils]: 192: Hoare triple {19270#false} assume true; {19270#false} is VALID [2018-11-18 23:02:51,644 INFO L273 TraceCheckUtils]: 193: Hoare triple {19270#false} assume !!(~i~1 < ~SIZE~0 - 1);call #t~mem12 := read~int(~#set~0.base, ~#set~0.offset + 4 * ~i~1, 4); {19270#false} is VALID [2018-11-18 23:02:51,644 INFO L256 TraceCheckUtils]: 194: Hoare triple {19270#false} call __VERIFIER_assert((if #t~mem12 != ~element~0 then 1 else 0)); {19270#false} is VALID [2018-11-18 23:02:51,644 INFO L273 TraceCheckUtils]: 195: Hoare triple {19270#false} ~cond := #in~cond; {19270#false} is VALID [2018-11-18 23:02:51,644 INFO L273 TraceCheckUtils]: 196: Hoare triple {19270#false} assume 0 == ~cond; {19270#false} is VALID [2018-11-18 23:02:51,645 INFO L273 TraceCheckUtils]: 197: Hoare triple {19270#false} assume !false; {19270#false} is VALID [2018-11-18 23:02:51,679 INFO L134 CoverageAnalysis]: Checked inductivity of 982 backedges. 0 proven. 494 refuted. 0 times theorem prover too weak. 488 trivial. 0 not checked. [2018-11-18 23:02:51,698 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-18 23:02:51,698 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17] total 31 [2018-11-18 23:02:51,699 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 198 [2018-11-18 23:02:51,699 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-18 23:02:51,699 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 31 states. [2018-11-18 23:02:51,931 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 234 edges. 234 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 23:02:51,932 INFO L459 AbstractCegarLoop]: Interpolant automaton has 31 states [2018-11-18 23:02:51,932 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2018-11-18 23:02:51,933 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=374, Invalid=556, Unknown=0, NotChecked=0, Total=930 [2018-11-18 23:02:51,933 INFO L87 Difference]: Start difference. First operand 215 states and 282 transitions. Second operand 31 states. [2018-11-18 23:02:55,138 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 23:02:55,138 INFO L93 Difference]: Finished difference Result 294 states and 377 transitions. [2018-11-18 23:02:55,139 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-11-18 23:02:55,139 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 198 [2018-11-18 23:02:55,139 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 23:02:55,139 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2018-11-18 23:02:55,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 231 transitions. [2018-11-18 23:02:55,142 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2018-11-18 23:02:55,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 231 transitions. [2018-11-18 23:02:55,145 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 17 states and 231 transitions. [2018-11-18 23:02:55,436 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 231 edges. 231 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 23:02:55,442 INFO L225 Difference]: With dead ends: 294 [2018-11-18 23:02:55,442 INFO L226 Difference]: Without dead ends: 233 [2018-11-18 23:02:55,443 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 214 GetRequests, 185 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 361 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=374, Invalid=556, Unknown=0, NotChecked=0, Total=930 [2018-11-18 23:02:55,443 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 233 states. [2018-11-18 23:02:56,127 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 233 to 225. [2018-11-18 23:02:56,127 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-18 23:02:56,128 INFO L82 GeneralOperation]: Start isEquivalent. First operand 233 states. Second operand 225 states. [2018-11-18 23:02:56,128 INFO L74 IsIncluded]: Start isIncluded. First operand 233 states. Second operand 225 states. [2018-11-18 23:02:56,128 INFO L87 Difference]: Start difference. First operand 233 states. Second operand 225 states. [2018-11-18 23:02:56,136 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 23:02:56,136 INFO L93 Difference]: Finished difference Result 233 states and 310 transitions. [2018-11-18 23:02:56,136 INFO L276 IsEmpty]: Start isEmpty. Operand 233 states and 310 transitions. [2018-11-18 23:02:56,137 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 23:02:56,137 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 23:02:56,137 INFO L74 IsIncluded]: Start isIncluded. First operand 225 states. Second operand 233 states. [2018-11-18 23:02:56,138 INFO L87 Difference]: Start difference. First operand 225 states. Second operand 233 states. [2018-11-18 23:02:56,146 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 23:02:56,146 INFO L93 Difference]: Finished difference Result 233 states and 310 transitions. [2018-11-18 23:02:56,146 INFO L276 IsEmpty]: Start isEmpty. Operand 233 states and 310 transitions. [2018-11-18 23:02:56,147 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 23:02:56,147 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 23:02:56,147 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-18 23:02:56,148 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-18 23:02:56,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 225 states. [2018-11-18 23:02:56,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 225 states to 225 states and 297 transitions. [2018-11-18 23:02:56,154 INFO L78 Accepts]: Start accepts. Automaton has 225 states and 297 transitions. Word has length 198 [2018-11-18 23:02:56,154 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 23:02:56,155 INFO L480 AbstractCegarLoop]: Abstraction has 225 states and 297 transitions. [2018-11-18 23:02:56,155 INFO L481 AbstractCegarLoop]: Interpolant automaton has 31 states. [2018-11-18 23:02:56,155 INFO L276 IsEmpty]: Start isEmpty. Operand 225 states and 297 transitions. [2018-11-18 23:02:56,158 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 211 [2018-11-18 23:02:56,158 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 23:02:56,158 INFO L375 BasicCegarLoop]: trace histogram [15, 14, 14, 14, 14, 14, 14, 14, 14, 13, 13, 13, 5, 4, 4, 3, 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 23:02:56,158 INFO L423 AbstractCegarLoop]: === Iteration 21 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 23:02:56,159 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 23:02:56,159 INFO L82 PathProgramCache]: Analyzing trace with hash 379620554, now seen corresponding path program 6 times [2018-11-18 23:02:56,159 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 23:02:56,159 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 23:02:56,162 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 23:02:56,162 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 23:02:56,162 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 23:02:56,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 23:02:56,632 INFO L256 TraceCheckUtils]: 0: Hoare triple {21033#true} call ULTIMATE.init(); {21033#true} is VALID [2018-11-18 23:02:56,632 INFO L273 TraceCheckUtils]: 1: Hoare triple {21033#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~SIZE~0 := 100000; {21035#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:02:56,633 INFO L273 TraceCheckUtils]: 2: Hoare triple {21035#(<= 100000 ~SIZE~0)} assume true; {21035#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:02:56,633 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {21035#(<= 100000 ~SIZE~0)} {21033#true} #128#return; {21035#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:02:56,634 INFO L256 TraceCheckUtils]: 4: Hoare triple {21035#(<= 100000 ~SIZE~0)} call #t~ret13 := main(); {21035#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:02:56,635 INFO L273 TraceCheckUtils]: 5: Hoare triple {21035#(<= 100000 ~SIZE~0)} havoc ~i~1;havoc ~pos~0;~n~0 := 0;~found~0 := 0;call ~#set~0.base, ~#set~0.offset := #Ultimate.alloc(4 * ~SIZE~0);call ~#values~0.base, ~#values~0.offset := #Ultimate.alloc(4 * ~SIZE~0);havoc ~element~0;havoc ~v~0;~v~0 := 0; {21036#(and (= main_~v~0 0) (<= 100000 ~SIZE~0))} is VALID [2018-11-18 23:02:56,635 INFO L273 TraceCheckUtils]: 6: Hoare triple {21036#(and (= main_~v~0 0) (<= 100000 ~SIZE~0))} assume true; {21036#(and (= main_~v~0 0) (<= 100000 ~SIZE~0))} is VALID [2018-11-18 23:02:56,636 INFO L273 TraceCheckUtils]: 7: Hoare triple {21036#(and (= main_~v~0 0) (<= 100000 ~SIZE~0))} assume !!(~v~0 < ~SIZE~0);call #t~mem3 := read~int(~#values~0.base, ~#values~0.offset + 4 * ~v~0, 4); {21036#(and (= main_~v~0 0) (<= 100000 ~SIZE~0))} is VALID [2018-11-18 23:02:56,636 INFO L256 TraceCheckUtils]: 8: Hoare triple {21036#(and (= main_~v~0 0) (<= 100000 ~SIZE~0))} call #t~ret4 := elem_exists(~#set~0.base, ~#set~0.offset, ~n~0, #t~mem3); {21033#true} is VALID [2018-11-18 23:02:56,637 INFO L273 TraceCheckUtils]: 9: Hoare triple {21033#true} ~set.base, ~set.offset := #in~set.base, #in~set.offset;~size := #in~size;~value := #in~value;havoc ~i~0;~i~0 := 0; {21033#true} is VALID [2018-11-18 23:02:56,637 INFO L273 TraceCheckUtils]: 10: Hoare triple {21033#true} assume true; {21033#true} is VALID [2018-11-18 23:02:56,637 INFO L273 TraceCheckUtils]: 11: Hoare triple {21033#true} assume !(~i~0 < ~size); {21033#true} is VALID [2018-11-18 23:02:56,637 INFO L273 TraceCheckUtils]: 12: Hoare triple {21033#true} #res := 0; {21033#true} is VALID [2018-11-18 23:02:56,638 INFO L273 TraceCheckUtils]: 13: Hoare triple {21033#true} assume true; {21033#true} is VALID [2018-11-18 23:02:56,639 INFO L268 TraceCheckUtils]: 14: Hoare quadruple {21033#true} {21036#(and (= main_~v~0 0) (<= 100000 ~SIZE~0))} #132#return; {21036#(and (= main_~v~0 0) (<= 100000 ~SIZE~0))} is VALID [2018-11-18 23:02:56,639 INFO L273 TraceCheckUtils]: 15: Hoare triple {21036#(and (= main_~v~0 0) (<= 100000 ~SIZE~0))} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {21036#(and (= main_~v~0 0) (<= 100000 ~SIZE~0))} is VALID [2018-11-18 23:02:56,639 INFO L273 TraceCheckUtils]: 16: Hoare triple {21036#(and (= main_~v~0 0) (<= 100000 ~SIZE~0))} assume 1 != #t~ret4;havoc #t~mem3;havoc #t~ret4;call #t~mem5 := read~int(~#values~0.base, ~#values~0.offset + 4 * ~v~0, 4); {21036#(and (= main_~v~0 0) (<= 100000 ~SIZE~0))} is VALID [2018-11-18 23:02:56,640 INFO L256 TraceCheckUtils]: 17: Hoare triple {21036#(and (= main_~v~0 0) (<= 100000 ~SIZE~0))} call #t~ret6 := insert(~#set~0.base, ~#set~0.offset, ~n~0, #t~mem5); {21033#true} is VALID [2018-11-18 23:02:56,640 INFO L273 TraceCheckUtils]: 18: Hoare triple {21033#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; {21033#true} is VALID [2018-11-18 23:02:56,640 INFO L273 TraceCheckUtils]: 19: Hoare triple {21033#true} assume true; {21033#true} is VALID [2018-11-18 23:02:56,641 INFO L268 TraceCheckUtils]: 20: Hoare quadruple {21033#true} {21036#(and (= main_~v~0 0) (<= 100000 ~SIZE~0))} #134#return; {21036#(and (= main_~v~0 0) (<= 100000 ~SIZE~0))} is VALID [2018-11-18 23:02:56,641 INFO L273 TraceCheckUtils]: 21: Hoare triple {21036#(and (= main_~v~0 0) (<= 100000 ~SIZE~0))} assume -2147483648 <= #t~ret6 && #t~ret6 <= 2147483647;~n~0 := #t~ret6;havoc #t~ret6;havoc #t~mem5; {21036#(and (= main_~v~0 0) (<= 100000 ~SIZE~0))} is VALID [2018-11-18 23:02:56,642 INFO L273 TraceCheckUtils]: 22: Hoare triple {21036#(and (= main_~v~0 0) (<= 100000 ~SIZE~0))} #t~post2 := ~v~0;~v~0 := 1 + #t~post2;havoc #t~post2; {21037#(<= (+ main_~v~0 99999) ~SIZE~0)} is VALID [2018-11-18 23:02:56,642 INFO L273 TraceCheckUtils]: 23: Hoare triple {21037#(<= (+ main_~v~0 99999) ~SIZE~0)} assume true; {21037#(<= (+ main_~v~0 99999) ~SIZE~0)} is VALID [2018-11-18 23:02:56,643 INFO L273 TraceCheckUtils]: 24: Hoare triple {21037#(<= (+ main_~v~0 99999) ~SIZE~0)} assume !!(~v~0 < ~SIZE~0);call #t~mem3 := read~int(~#values~0.base, ~#values~0.offset + 4 * ~v~0, 4); {21037#(<= (+ main_~v~0 99999) ~SIZE~0)} is VALID [2018-11-18 23:02:56,643 INFO L256 TraceCheckUtils]: 25: Hoare triple {21037#(<= (+ main_~v~0 99999) ~SIZE~0)} call #t~ret4 := elem_exists(~#set~0.base, ~#set~0.offset, ~n~0, #t~mem3); {21033#true} is VALID [2018-11-18 23:02:56,643 INFO L273 TraceCheckUtils]: 26: Hoare triple {21033#true} ~set.base, ~set.offset := #in~set.base, #in~set.offset;~size := #in~size;~value := #in~value;havoc ~i~0;~i~0 := 0; {21033#true} is VALID [2018-11-18 23:02:56,643 INFO L273 TraceCheckUtils]: 27: Hoare triple {21033#true} assume true; {21033#true} is VALID [2018-11-18 23:02:56,643 INFO L273 TraceCheckUtils]: 28: Hoare triple {21033#true} assume !!(~i~0 < ~size);call #t~mem1 := read~int(~set.base, ~set.offset + 4 * ~i~0, 4); {21033#true} is VALID [2018-11-18 23:02:56,644 INFO L273 TraceCheckUtils]: 29: Hoare triple {21033#true} assume #t~mem1 == ~value;havoc #t~mem1;#res := 1; {21033#true} is VALID [2018-11-18 23:02:56,644 INFO L273 TraceCheckUtils]: 30: Hoare triple {21033#true} assume true; {21033#true} is VALID [2018-11-18 23:02:56,645 INFO L268 TraceCheckUtils]: 31: Hoare quadruple {21033#true} {21037#(<= (+ main_~v~0 99999) ~SIZE~0)} #132#return; {21037#(<= (+ main_~v~0 99999) ~SIZE~0)} is VALID [2018-11-18 23:02:56,645 INFO L273 TraceCheckUtils]: 32: Hoare triple {21037#(<= (+ main_~v~0 99999) ~SIZE~0)} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {21037#(<= (+ main_~v~0 99999) ~SIZE~0)} is VALID [2018-11-18 23:02:56,646 INFO L273 TraceCheckUtils]: 33: Hoare triple {21037#(<= (+ main_~v~0 99999) ~SIZE~0)} assume !(1 != #t~ret4);havoc #t~mem3;havoc #t~ret4; {21037#(<= (+ main_~v~0 99999) ~SIZE~0)} is VALID [2018-11-18 23:02:56,647 INFO L273 TraceCheckUtils]: 34: Hoare triple {21037#(<= (+ main_~v~0 99999) ~SIZE~0)} #t~post2 := ~v~0;~v~0 := 1 + #t~post2;havoc #t~post2; {21038#(<= (+ main_~v~0 99998) ~SIZE~0)} is VALID [2018-11-18 23:02:56,647 INFO L273 TraceCheckUtils]: 35: Hoare triple {21038#(<= (+ main_~v~0 99998) ~SIZE~0)} assume true; {21038#(<= (+ main_~v~0 99998) ~SIZE~0)} is VALID [2018-11-18 23:02:56,648 INFO L273 TraceCheckUtils]: 36: Hoare triple {21038#(<= (+ main_~v~0 99998) ~SIZE~0)} assume !!(~v~0 < ~SIZE~0);call #t~mem3 := read~int(~#values~0.base, ~#values~0.offset + 4 * ~v~0, 4); {21038#(<= (+ main_~v~0 99998) ~SIZE~0)} is VALID [2018-11-18 23:02:56,648 INFO L256 TraceCheckUtils]: 37: Hoare triple {21038#(<= (+ main_~v~0 99998) ~SIZE~0)} call #t~ret4 := elem_exists(~#set~0.base, ~#set~0.offset, ~n~0, #t~mem3); {21033#true} is VALID [2018-11-18 23:02:56,648 INFO L273 TraceCheckUtils]: 38: Hoare triple {21033#true} ~set.base, ~set.offset := #in~set.base, #in~set.offset;~size := #in~size;~value := #in~value;havoc ~i~0;~i~0 := 0; {21033#true} is VALID [2018-11-18 23:02:56,648 INFO L273 TraceCheckUtils]: 39: Hoare triple {21033#true} assume true; {21033#true} is VALID [2018-11-18 23:02:56,649 INFO L273 TraceCheckUtils]: 40: Hoare triple {21033#true} assume !!(~i~0 < ~size);call #t~mem1 := read~int(~set.base, ~set.offset + 4 * ~i~0, 4); {21033#true} is VALID [2018-11-18 23:02:56,649 INFO L273 TraceCheckUtils]: 41: Hoare triple {21033#true} assume #t~mem1 == ~value;havoc #t~mem1;#res := 1; {21033#true} is VALID [2018-11-18 23:02:56,649 INFO L273 TraceCheckUtils]: 42: Hoare triple {21033#true} assume true; {21033#true} is VALID [2018-11-18 23:02:56,650 INFO L268 TraceCheckUtils]: 43: Hoare quadruple {21033#true} {21038#(<= (+ main_~v~0 99998) ~SIZE~0)} #132#return; {21038#(<= (+ main_~v~0 99998) ~SIZE~0)} is VALID [2018-11-18 23:02:56,651 INFO L273 TraceCheckUtils]: 44: Hoare triple {21038#(<= (+ main_~v~0 99998) ~SIZE~0)} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {21038#(<= (+ main_~v~0 99998) ~SIZE~0)} is VALID [2018-11-18 23:02:56,651 INFO L273 TraceCheckUtils]: 45: Hoare triple {21038#(<= (+ main_~v~0 99998) ~SIZE~0)} assume !(1 != #t~ret4);havoc #t~mem3;havoc #t~ret4; {21038#(<= (+ main_~v~0 99998) ~SIZE~0)} is VALID [2018-11-18 23:02:56,652 INFO L273 TraceCheckUtils]: 46: Hoare triple {21038#(<= (+ main_~v~0 99998) ~SIZE~0)} #t~post2 := ~v~0;~v~0 := 1 + #t~post2;havoc #t~post2; {21039#(<= (+ main_~v~0 99997) ~SIZE~0)} is VALID [2018-11-18 23:02:56,652 INFO L273 TraceCheckUtils]: 47: Hoare triple {21039#(<= (+ main_~v~0 99997) ~SIZE~0)} assume true; {21039#(<= (+ main_~v~0 99997) ~SIZE~0)} is VALID [2018-11-18 23:02:56,652 INFO L273 TraceCheckUtils]: 48: Hoare triple {21039#(<= (+ main_~v~0 99997) ~SIZE~0)} assume !!(~v~0 < ~SIZE~0);call #t~mem3 := read~int(~#values~0.base, ~#values~0.offset + 4 * ~v~0, 4); {21039#(<= (+ main_~v~0 99997) ~SIZE~0)} is VALID [2018-11-18 23:02:56,652 INFO L256 TraceCheckUtils]: 49: Hoare triple {21039#(<= (+ main_~v~0 99997) ~SIZE~0)} call #t~ret4 := elem_exists(~#set~0.base, ~#set~0.offset, ~n~0, #t~mem3); {21033#true} is VALID [2018-11-18 23:02:56,652 INFO L273 TraceCheckUtils]: 50: Hoare triple {21033#true} ~set.base, ~set.offset := #in~set.base, #in~set.offset;~size := #in~size;~value := #in~value;havoc ~i~0;~i~0 := 0; {21033#true} is VALID [2018-11-18 23:02:56,653 INFO L273 TraceCheckUtils]: 51: Hoare triple {21033#true} assume true; {21033#true} is VALID [2018-11-18 23:02:56,653 INFO L273 TraceCheckUtils]: 52: Hoare triple {21033#true} assume !!(~i~0 < ~size);call #t~mem1 := read~int(~set.base, ~set.offset + 4 * ~i~0, 4); {21033#true} is VALID [2018-11-18 23:02:56,653 INFO L273 TraceCheckUtils]: 53: Hoare triple {21033#true} assume #t~mem1 == ~value;havoc #t~mem1;#res := 1; {21033#true} is VALID [2018-11-18 23:02:56,653 INFO L273 TraceCheckUtils]: 54: Hoare triple {21033#true} assume true; {21033#true} is VALID [2018-11-18 23:02:56,654 INFO L268 TraceCheckUtils]: 55: Hoare quadruple {21033#true} {21039#(<= (+ main_~v~0 99997) ~SIZE~0)} #132#return; {21039#(<= (+ main_~v~0 99997) ~SIZE~0)} is VALID [2018-11-18 23:02:56,654 INFO L273 TraceCheckUtils]: 56: Hoare triple {21039#(<= (+ main_~v~0 99997) ~SIZE~0)} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {21039#(<= (+ main_~v~0 99997) ~SIZE~0)} is VALID [2018-11-18 23:02:56,655 INFO L273 TraceCheckUtils]: 57: Hoare triple {21039#(<= (+ main_~v~0 99997) ~SIZE~0)} assume !(1 != #t~ret4);havoc #t~mem3;havoc #t~ret4; {21039#(<= (+ main_~v~0 99997) ~SIZE~0)} is VALID [2018-11-18 23:02:56,656 INFO L273 TraceCheckUtils]: 58: Hoare triple {21039#(<= (+ main_~v~0 99997) ~SIZE~0)} #t~post2 := ~v~0;~v~0 := 1 + #t~post2;havoc #t~post2; {21040#(<= (+ main_~v~0 99996) ~SIZE~0)} is VALID [2018-11-18 23:02:56,657 INFO L273 TraceCheckUtils]: 59: Hoare triple {21040#(<= (+ main_~v~0 99996) ~SIZE~0)} assume true; {21040#(<= (+ main_~v~0 99996) ~SIZE~0)} is VALID [2018-11-18 23:02:56,657 INFO L273 TraceCheckUtils]: 60: Hoare triple {21040#(<= (+ main_~v~0 99996) ~SIZE~0)} assume !!(~v~0 < ~SIZE~0);call #t~mem3 := read~int(~#values~0.base, ~#values~0.offset + 4 * ~v~0, 4); {21040#(<= (+ main_~v~0 99996) ~SIZE~0)} is VALID [2018-11-18 23:02:56,658 INFO L256 TraceCheckUtils]: 61: Hoare triple {21040#(<= (+ main_~v~0 99996) ~SIZE~0)} call #t~ret4 := elem_exists(~#set~0.base, ~#set~0.offset, ~n~0, #t~mem3); {21033#true} is VALID [2018-11-18 23:02:56,658 INFO L273 TraceCheckUtils]: 62: Hoare triple {21033#true} ~set.base, ~set.offset := #in~set.base, #in~set.offset;~size := #in~size;~value := #in~value;havoc ~i~0;~i~0 := 0; {21033#true} is VALID [2018-11-18 23:02:56,658 INFO L273 TraceCheckUtils]: 63: Hoare triple {21033#true} assume true; {21033#true} is VALID [2018-11-18 23:02:56,658 INFO L273 TraceCheckUtils]: 64: Hoare triple {21033#true} assume !!(~i~0 < ~size);call #t~mem1 := read~int(~set.base, ~set.offset + 4 * ~i~0, 4); {21033#true} is VALID [2018-11-18 23:02:56,658 INFO L273 TraceCheckUtils]: 65: Hoare triple {21033#true} assume #t~mem1 == ~value;havoc #t~mem1;#res := 1; {21033#true} is VALID [2018-11-18 23:02:56,659 INFO L273 TraceCheckUtils]: 66: Hoare triple {21033#true} assume true; {21033#true} is VALID [2018-11-18 23:02:56,659 INFO L268 TraceCheckUtils]: 67: Hoare quadruple {21033#true} {21040#(<= (+ main_~v~0 99996) ~SIZE~0)} #132#return; {21040#(<= (+ main_~v~0 99996) ~SIZE~0)} is VALID [2018-11-18 23:02:56,660 INFO L273 TraceCheckUtils]: 68: Hoare triple {21040#(<= (+ main_~v~0 99996) ~SIZE~0)} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {21040#(<= (+ main_~v~0 99996) ~SIZE~0)} is VALID [2018-11-18 23:02:56,660 INFO L273 TraceCheckUtils]: 69: Hoare triple {21040#(<= (+ main_~v~0 99996) ~SIZE~0)} assume !(1 != #t~ret4);havoc #t~mem3;havoc #t~ret4; {21040#(<= (+ main_~v~0 99996) ~SIZE~0)} is VALID [2018-11-18 23:02:56,660 INFO L273 TraceCheckUtils]: 70: Hoare triple {21040#(<= (+ main_~v~0 99996) ~SIZE~0)} #t~post2 := ~v~0;~v~0 := 1 + #t~post2;havoc #t~post2; {21041#(<= (+ main_~v~0 99995) ~SIZE~0)} is VALID [2018-11-18 23:02:56,661 INFO L273 TraceCheckUtils]: 71: Hoare triple {21041#(<= (+ main_~v~0 99995) ~SIZE~0)} assume true; {21041#(<= (+ main_~v~0 99995) ~SIZE~0)} is VALID [2018-11-18 23:02:56,661 INFO L273 TraceCheckUtils]: 72: Hoare triple {21041#(<= (+ main_~v~0 99995) ~SIZE~0)} assume !!(~v~0 < ~SIZE~0);call #t~mem3 := read~int(~#values~0.base, ~#values~0.offset + 4 * ~v~0, 4); {21041#(<= (+ main_~v~0 99995) ~SIZE~0)} is VALID [2018-11-18 23:02:56,661 INFO L256 TraceCheckUtils]: 73: Hoare triple {21041#(<= (+ main_~v~0 99995) ~SIZE~0)} call #t~ret4 := elem_exists(~#set~0.base, ~#set~0.offset, ~n~0, #t~mem3); {21033#true} is VALID [2018-11-18 23:02:56,661 INFO L273 TraceCheckUtils]: 74: Hoare triple {21033#true} ~set.base, ~set.offset := #in~set.base, #in~set.offset;~size := #in~size;~value := #in~value;havoc ~i~0;~i~0 := 0; {21033#true} is VALID [2018-11-18 23:02:56,662 INFO L273 TraceCheckUtils]: 75: Hoare triple {21033#true} assume true; {21033#true} is VALID [2018-11-18 23:02:56,662 INFO L273 TraceCheckUtils]: 76: Hoare triple {21033#true} assume !!(~i~0 < ~size);call #t~mem1 := read~int(~set.base, ~set.offset + 4 * ~i~0, 4); {21033#true} is VALID [2018-11-18 23:02:56,662 INFO L273 TraceCheckUtils]: 77: Hoare triple {21033#true} assume #t~mem1 == ~value;havoc #t~mem1;#res := 1; {21033#true} is VALID [2018-11-18 23:02:56,662 INFO L273 TraceCheckUtils]: 78: Hoare triple {21033#true} assume true; {21033#true} is VALID [2018-11-18 23:02:56,667 INFO L268 TraceCheckUtils]: 79: Hoare quadruple {21033#true} {21041#(<= (+ main_~v~0 99995) ~SIZE~0)} #132#return; {21041#(<= (+ main_~v~0 99995) ~SIZE~0)} is VALID [2018-11-18 23:02:56,667 INFO L273 TraceCheckUtils]: 80: Hoare triple {21041#(<= (+ main_~v~0 99995) ~SIZE~0)} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {21041#(<= (+ main_~v~0 99995) ~SIZE~0)} is VALID [2018-11-18 23:02:56,667 INFO L273 TraceCheckUtils]: 81: Hoare triple {21041#(<= (+ main_~v~0 99995) ~SIZE~0)} assume !(1 != #t~ret4);havoc #t~mem3;havoc #t~ret4; {21041#(<= (+ main_~v~0 99995) ~SIZE~0)} is VALID [2018-11-18 23:02:56,668 INFO L273 TraceCheckUtils]: 82: Hoare triple {21041#(<= (+ main_~v~0 99995) ~SIZE~0)} #t~post2 := ~v~0;~v~0 := 1 + #t~post2;havoc #t~post2; {21042#(<= (+ main_~v~0 99994) ~SIZE~0)} is VALID [2018-11-18 23:02:56,668 INFO L273 TraceCheckUtils]: 83: Hoare triple {21042#(<= (+ main_~v~0 99994) ~SIZE~0)} assume true; {21042#(<= (+ main_~v~0 99994) ~SIZE~0)} is VALID [2018-11-18 23:02:56,668 INFO L273 TraceCheckUtils]: 84: Hoare triple {21042#(<= (+ main_~v~0 99994) ~SIZE~0)} assume !!(~v~0 < ~SIZE~0);call #t~mem3 := read~int(~#values~0.base, ~#values~0.offset + 4 * ~v~0, 4); {21042#(<= (+ main_~v~0 99994) ~SIZE~0)} is VALID [2018-11-18 23:02:56,669 INFO L256 TraceCheckUtils]: 85: Hoare triple {21042#(<= (+ main_~v~0 99994) ~SIZE~0)} call #t~ret4 := elem_exists(~#set~0.base, ~#set~0.offset, ~n~0, #t~mem3); {21033#true} is VALID [2018-11-18 23:02:56,669 INFO L273 TraceCheckUtils]: 86: Hoare triple {21033#true} ~set.base, ~set.offset := #in~set.base, #in~set.offset;~size := #in~size;~value := #in~value;havoc ~i~0;~i~0 := 0; {21033#true} is VALID [2018-11-18 23:02:56,669 INFO L273 TraceCheckUtils]: 87: Hoare triple {21033#true} assume true; {21033#true} is VALID [2018-11-18 23:02:56,669 INFO L273 TraceCheckUtils]: 88: Hoare triple {21033#true} assume !!(~i~0 < ~size);call #t~mem1 := read~int(~set.base, ~set.offset + 4 * ~i~0, 4); {21033#true} is VALID [2018-11-18 23:02:56,669 INFO L273 TraceCheckUtils]: 89: Hoare triple {21033#true} assume #t~mem1 == ~value;havoc #t~mem1;#res := 1; {21033#true} is VALID [2018-11-18 23:02:56,669 INFO L273 TraceCheckUtils]: 90: Hoare triple {21033#true} assume true; {21033#true} is VALID [2018-11-18 23:02:56,670 INFO L268 TraceCheckUtils]: 91: Hoare quadruple {21033#true} {21042#(<= (+ main_~v~0 99994) ~SIZE~0)} #132#return; {21042#(<= (+ main_~v~0 99994) ~SIZE~0)} is VALID [2018-11-18 23:02:56,670 INFO L273 TraceCheckUtils]: 92: Hoare triple {21042#(<= (+ main_~v~0 99994) ~SIZE~0)} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {21042#(<= (+ main_~v~0 99994) ~SIZE~0)} is VALID [2018-11-18 23:02:56,671 INFO L273 TraceCheckUtils]: 93: Hoare triple {21042#(<= (+ main_~v~0 99994) ~SIZE~0)} assume !(1 != #t~ret4);havoc #t~mem3;havoc #t~ret4; {21042#(<= (+ main_~v~0 99994) ~SIZE~0)} is VALID [2018-11-18 23:02:56,671 INFO L273 TraceCheckUtils]: 94: Hoare triple {21042#(<= (+ main_~v~0 99994) ~SIZE~0)} #t~post2 := ~v~0;~v~0 := 1 + #t~post2;havoc #t~post2; {21043#(<= (+ main_~v~0 99993) ~SIZE~0)} is VALID [2018-11-18 23:02:56,672 INFO L273 TraceCheckUtils]: 95: Hoare triple {21043#(<= (+ main_~v~0 99993) ~SIZE~0)} assume true; {21043#(<= (+ main_~v~0 99993) ~SIZE~0)} is VALID [2018-11-18 23:02:56,672 INFO L273 TraceCheckUtils]: 96: Hoare triple {21043#(<= (+ main_~v~0 99993) ~SIZE~0)} assume !!(~v~0 < ~SIZE~0);call #t~mem3 := read~int(~#values~0.base, ~#values~0.offset + 4 * ~v~0, 4); {21043#(<= (+ main_~v~0 99993) ~SIZE~0)} is VALID [2018-11-18 23:02:56,673 INFO L256 TraceCheckUtils]: 97: Hoare triple {21043#(<= (+ main_~v~0 99993) ~SIZE~0)} call #t~ret4 := elem_exists(~#set~0.base, ~#set~0.offset, ~n~0, #t~mem3); {21033#true} is VALID [2018-11-18 23:02:56,673 INFO L273 TraceCheckUtils]: 98: Hoare triple {21033#true} ~set.base, ~set.offset := #in~set.base, #in~set.offset;~size := #in~size;~value := #in~value;havoc ~i~0;~i~0 := 0; {21033#true} is VALID [2018-11-18 23:02:56,673 INFO L273 TraceCheckUtils]: 99: Hoare triple {21033#true} assume true; {21033#true} is VALID [2018-11-18 23:02:56,673 INFO L273 TraceCheckUtils]: 100: Hoare triple {21033#true} assume !!(~i~0 < ~size);call #t~mem1 := read~int(~set.base, ~set.offset + 4 * ~i~0, 4); {21033#true} is VALID [2018-11-18 23:02:56,673 INFO L273 TraceCheckUtils]: 101: Hoare triple {21033#true} assume #t~mem1 == ~value;havoc #t~mem1;#res := 1; {21033#true} is VALID [2018-11-18 23:02:56,674 INFO L273 TraceCheckUtils]: 102: Hoare triple {21033#true} assume true; {21033#true} is VALID [2018-11-18 23:02:56,675 INFO L268 TraceCheckUtils]: 103: Hoare quadruple {21033#true} {21043#(<= (+ main_~v~0 99993) ~SIZE~0)} #132#return; {21043#(<= (+ main_~v~0 99993) ~SIZE~0)} is VALID [2018-11-18 23:02:56,675 INFO L273 TraceCheckUtils]: 104: Hoare triple {21043#(<= (+ main_~v~0 99993) ~SIZE~0)} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {21043#(<= (+ main_~v~0 99993) ~SIZE~0)} is VALID [2018-11-18 23:02:56,675 INFO L273 TraceCheckUtils]: 105: Hoare triple {21043#(<= (+ main_~v~0 99993) ~SIZE~0)} assume !(1 != #t~ret4);havoc #t~mem3;havoc #t~ret4; {21043#(<= (+ main_~v~0 99993) ~SIZE~0)} is VALID [2018-11-18 23:02:56,676 INFO L273 TraceCheckUtils]: 106: Hoare triple {21043#(<= (+ main_~v~0 99993) ~SIZE~0)} #t~post2 := ~v~0;~v~0 := 1 + #t~post2;havoc #t~post2; {21044#(<= (+ main_~v~0 99992) ~SIZE~0)} is VALID [2018-11-18 23:02:56,676 INFO L273 TraceCheckUtils]: 107: Hoare triple {21044#(<= (+ main_~v~0 99992) ~SIZE~0)} assume true; {21044#(<= (+ main_~v~0 99992) ~SIZE~0)} is VALID [2018-11-18 23:02:56,677 INFO L273 TraceCheckUtils]: 108: Hoare triple {21044#(<= (+ main_~v~0 99992) ~SIZE~0)} assume !!(~v~0 < ~SIZE~0);call #t~mem3 := read~int(~#values~0.base, ~#values~0.offset + 4 * ~v~0, 4); {21044#(<= (+ main_~v~0 99992) ~SIZE~0)} is VALID [2018-11-18 23:02:56,677 INFO L256 TraceCheckUtils]: 109: Hoare triple {21044#(<= (+ main_~v~0 99992) ~SIZE~0)} call #t~ret4 := elem_exists(~#set~0.base, ~#set~0.offset, ~n~0, #t~mem3); {21033#true} is VALID [2018-11-18 23:02:56,677 INFO L273 TraceCheckUtils]: 110: Hoare triple {21033#true} ~set.base, ~set.offset := #in~set.base, #in~set.offset;~size := #in~size;~value := #in~value;havoc ~i~0;~i~0 := 0; {21033#true} is VALID [2018-11-18 23:02:56,677 INFO L273 TraceCheckUtils]: 111: Hoare triple {21033#true} assume true; {21033#true} is VALID [2018-11-18 23:02:56,677 INFO L273 TraceCheckUtils]: 112: Hoare triple {21033#true} assume !!(~i~0 < ~size);call #t~mem1 := read~int(~set.base, ~set.offset + 4 * ~i~0, 4); {21033#true} is VALID [2018-11-18 23:02:56,677 INFO L273 TraceCheckUtils]: 113: Hoare triple {21033#true} assume #t~mem1 == ~value;havoc #t~mem1;#res := 1; {21033#true} is VALID [2018-11-18 23:02:56,677 INFO L273 TraceCheckUtils]: 114: Hoare triple {21033#true} assume true; {21033#true} is VALID [2018-11-18 23:02:56,678 INFO L268 TraceCheckUtils]: 115: Hoare quadruple {21033#true} {21044#(<= (+ main_~v~0 99992) ~SIZE~0)} #132#return; {21044#(<= (+ main_~v~0 99992) ~SIZE~0)} is VALID [2018-11-18 23:02:56,678 INFO L273 TraceCheckUtils]: 116: Hoare triple {21044#(<= (+ main_~v~0 99992) ~SIZE~0)} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {21044#(<= (+ main_~v~0 99992) ~SIZE~0)} is VALID [2018-11-18 23:02:56,679 INFO L273 TraceCheckUtils]: 117: Hoare triple {21044#(<= (+ main_~v~0 99992) ~SIZE~0)} assume !(1 != #t~ret4);havoc #t~mem3;havoc #t~ret4; {21044#(<= (+ main_~v~0 99992) ~SIZE~0)} is VALID [2018-11-18 23:02:56,680 INFO L273 TraceCheckUtils]: 118: Hoare triple {21044#(<= (+ main_~v~0 99992) ~SIZE~0)} #t~post2 := ~v~0;~v~0 := 1 + #t~post2;havoc #t~post2; {21045#(<= (+ main_~v~0 99991) ~SIZE~0)} is VALID [2018-11-18 23:02:56,680 INFO L273 TraceCheckUtils]: 119: Hoare triple {21045#(<= (+ main_~v~0 99991) ~SIZE~0)} assume true; {21045#(<= (+ main_~v~0 99991) ~SIZE~0)} is VALID [2018-11-18 23:02:56,684 INFO L273 TraceCheckUtils]: 120: Hoare triple {21045#(<= (+ main_~v~0 99991) ~SIZE~0)} assume !!(~v~0 < ~SIZE~0);call #t~mem3 := read~int(~#values~0.base, ~#values~0.offset + 4 * ~v~0, 4); {21045#(<= (+ main_~v~0 99991) ~SIZE~0)} is VALID [2018-11-18 23:02:56,684 INFO L256 TraceCheckUtils]: 121: Hoare triple {21045#(<= (+ main_~v~0 99991) ~SIZE~0)} call #t~ret4 := elem_exists(~#set~0.base, ~#set~0.offset, ~n~0, #t~mem3); {21033#true} is VALID [2018-11-18 23:02:56,684 INFO L273 TraceCheckUtils]: 122: Hoare triple {21033#true} ~set.base, ~set.offset := #in~set.base, #in~set.offset;~size := #in~size;~value := #in~value;havoc ~i~0;~i~0 := 0; {21033#true} is VALID [2018-11-18 23:02:56,684 INFO L273 TraceCheckUtils]: 123: Hoare triple {21033#true} assume true; {21033#true} is VALID [2018-11-18 23:02:56,684 INFO L273 TraceCheckUtils]: 124: Hoare triple {21033#true} assume !!(~i~0 < ~size);call #t~mem1 := read~int(~set.base, ~set.offset + 4 * ~i~0, 4); {21033#true} is VALID [2018-11-18 23:02:56,684 INFO L273 TraceCheckUtils]: 125: Hoare triple {21033#true} assume #t~mem1 == ~value;havoc #t~mem1;#res := 1; {21033#true} is VALID [2018-11-18 23:02:56,684 INFO L273 TraceCheckUtils]: 126: Hoare triple {21033#true} assume true; {21033#true} is VALID [2018-11-18 23:02:56,685 INFO L268 TraceCheckUtils]: 127: Hoare quadruple {21033#true} {21045#(<= (+ main_~v~0 99991) ~SIZE~0)} #132#return; {21045#(<= (+ main_~v~0 99991) ~SIZE~0)} is VALID [2018-11-18 23:02:56,686 INFO L273 TraceCheckUtils]: 128: Hoare triple {21045#(<= (+ main_~v~0 99991) ~SIZE~0)} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {21045#(<= (+ main_~v~0 99991) ~SIZE~0)} is VALID [2018-11-18 23:02:56,686 INFO L273 TraceCheckUtils]: 129: Hoare triple {21045#(<= (+ main_~v~0 99991) ~SIZE~0)} assume !(1 != #t~ret4);havoc #t~mem3;havoc #t~ret4; {21045#(<= (+ main_~v~0 99991) ~SIZE~0)} is VALID [2018-11-18 23:02:56,686 INFO L273 TraceCheckUtils]: 130: Hoare triple {21045#(<= (+ main_~v~0 99991) ~SIZE~0)} #t~post2 := ~v~0;~v~0 := 1 + #t~post2;havoc #t~post2; {21046#(<= (+ main_~v~0 99990) ~SIZE~0)} is VALID [2018-11-18 23:02:56,687 INFO L273 TraceCheckUtils]: 131: Hoare triple {21046#(<= (+ main_~v~0 99990) ~SIZE~0)} assume true; {21046#(<= (+ main_~v~0 99990) ~SIZE~0)} is VALID [2018-11-18 23:02:56,687 INFO L273 TraceCheckUtils]: 132: Hoare triple {21046#(<= (+ main_~v~0 99990) ~SIZE~0)} assume !!(~v~0 < ~SIZE~0);call #t~mem3 := read~int(~#values~0.base, ~#values~0.offset + 4 * ~v~0, 4); {21046#(<= (+ main_~v~0 99990) ~SIZE~0)} is VALID [2018-11-18 23:02:56,687 INFO L256 TraceCheckUtils]: 133: Hoare triple {21046#(<= (+ main_~v~0 99990) ~SIZE~0)} call #t~ret4 := elem_exists(~#set~0.base, ~#set~0.offset, ~n~0, #t~mem3); {21033#true} is VALID [2018-11-18 23:02:56,687 INFO L273 TraceCheckUtils]: 134: Hoare triple {21033#true} ~set.base, ~set.offset := #in~set.base, #in~set.offset;~size := #in~size;~value := #in~value;havoc ~i~0;~i~0 := 0; {21033#true} is VALID [2018-11-18 23:02:56,687 INFO L273 TraceCheckUtils]: 135: Hoare triple {21033#true} assume true; {21033#true} is VALID [2018-11-18 23:02:56,687 INFO L273 TraceCheckUtils]: 136: Hoare triple {21033#true} assume !!(~i~0 < ~size);call #t~mem1 := read~int(~set.base, ~set.offset + 4 * ~i~0, 4); {21033#true} is VALID [2018-11-18 23:02:56,688 INFO L273 TraceCheckUtils]: 137: Hoare triple {21033#true} assume #t~mem1 == ~value;havoc #t~mem1;#res := 1; {21033#true} is VALID [2018-11-18 23:02:56,688 INFO L273 TraceCheckUtils]: 138: Hoare triple {21033#true} assume true; {21033#true} is VALID [2018-11-18 23:02:56,688 INFO L268 TraceCheckUtils]: 139: Hoare quadruple {21033#true} {21046#(<= (+ main_~v~0 99990) ~SIZE~0)} #132#return; {21046#(<= (+ main_~v~0 99990) ~SIZE~0)} is VALID [2018-11-18 23:02:56,689 INFO L273 TraceCheckUtils]: 140: Hoare triple {21046#(<= (+ main_~v~0 99990) ~SIZE~0)} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {21046#(<= (+ main_~v~0 99990) ~SIZE~0)} is VALID [2018-11-18 23:02:56,689 INFO L273 TraceCheckUtils]: 141: Hoare triple {21046#(<= (+ main_~v~0 99990) ~SIZE~0)} assume !(1 != #t~ret4);havoc #t~mem3;havoc #t~ret4; {21046#(<= (+ main_~v~0 99990) ~SIZE~0)} is VALID [2018-11-18 23:02:56,690 INFO L273 TraceCheckUtils]: 142: Hoare triple {21046#(<= (+ main_~v~0 99990) ~SIZE~0)} #t~post2 := ~v~0;~v~0 := 1 + #t~post2;havoc #t~post2; {21047#(<= (+ main_~v~0 99989) ~SIZE~0)} is VALID [2018-11-18 23:02:56,691 INFO L273 TraceCheckUtils]: 143: Hoare triple {21047#(<= (+ main_~v~0 99989) ~SIZE~0)} assume true; {21047#(<= (+ main_~v~0 99989) ~SIZE~0)} is VALID [2018-11-18 23:02:56,691 INFO L273 TraceCheckUtils]: 144: Hoare triple {21047#(<= (+ main_~v~0 99989) ~SIZE~0)} assume !!(~v~0 < ~SIZE~0);call #t~mem3 := read~int(~#values~0.base, ~#values~0.offset + 4 * ~v~0, 4); {21047#(<= (+ main_~v~0 99989) ~SIZE~0)} is VALID [2018-11-18 23:02:56,691 INFO L256 TraceCheckUtils]: 145: Hoare triple {21047#(<= (+ main_~v~0 99989) ~SIZE~0)} call #t~ret4 := elem_exists(~#set~0.base, ~#set~0.offset, ~n~0, #t~mem3); {21033#true} is VALID [2018-11-18 23:02:56,692 INFO L273 TraceCheckUtils]: 146: Hoare triple {21033#true} ~set.base, ~set.offset := #in~set.base, #in~set.offset;~size := #in~size;~value := #in~value;havoc ~i~0;~i~0 := 0; {21033#true} is VALID [2018-11-18 23:02:56,692 INFO L273 TraceCheckUtils]: 147: Hoare triple {21033#true} assume true; {21033#true} is VALID [2018-11-18 23:02:56,692 INFO L273 TraceCheckUtils]: 148: Hoare triple {21033#true} assume !!(~i~0 < ~size);call #t~mem1 := read~int(~set.base, ~set.offset + 4 * ~i~0, 4); {21033#true} is VALID [2018-11-18 23:02:56,692 INFO L273 TraceCheckUtils]: 149: Hoare triple {21033#true} assume #t~mem1 == ~value;havoc #t~mem1;#res := 1; {21033#true} is VALID [2018-11-18 23:02:56,692 INFO L273 TraceCheckUtils]: 150: Hoare triple {21033#true} assume true; {21033#true} is VALID [2018-11-18 23:02:56,693 INFO L268 TraceCheckUtils]: 151: Hoare quadruple {21033#true} {21047#(<= (+ main_~v~0 99989) ~SIZE~0)} #132#return; {21047#(<= (+ main_~v~0 99989) ~SIZE~0)} is VALID [2018-11-18 23:02:56,694 INFO L273 TraceCheckUtils]: 152: Hoare triple {21047#(<= (+ main_~v~0 99989) ~SIZE~0)} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {21047#(<= (+ main_~v~0 99989) ~SIZE~0)} is VALID [2018-11-18 23:02:56,694 INFO L273 TraceCheckUtils]: 153: Hoare triple {21047#(<= (+ main_~v~0 99989) ~SIZE~0)} assume !(1 != #t~ret4);havoc #t~mem3;havoc #t~ret4; {21047#(<= (+ main_~v~0 99989) ~SIZE~0)} is VALID [2018-11-18 23:02:56,695 INFO L273 TraceCheckUtils]: 154: Hoare triple {21047#(<= (+ main_~v~0 99989) ~SIZE~0)} #t~post2 := ~v~0;~v~0 := 1 + #t~post2;havoc #t~post2; {21048#(<= (+ main_~v~0 99988) ~SIZE~0)} is VALID [2018-11-18 23:02:56,695 INFO L273 TraceCheckUtils]: 155: Hoare triple {21048#(<= (+ main_~v~0 99988) ~SIZE~0)} assume true; {21048#(<= (+ main_~v~0 99988) ~SIZE~0)} is VALID [2018-11-18 23:02:56,695 INFO L273 TraceCheckUtils]: 156: Hoare triple {21048#(<= (+ main_~v~0 99988) ~SIZE~0)} assume !!(~v~0 < ~SIZE~0);call #t~mem3 := read~int(~#values~0.base, ~#values~0.offset + 4 * ~v~0, 4); {21048#(<= (+ main_~v~0 99988) ~SIZE~0)} is VALID [2018-11-18 23:02:56,696 INFO L256 TraceCheckUtils]: 157: Hoare triple {21048#(<= (+ main_~v~0 99988) ~SIZE~0)} call #t~ret4 := elem_exists(~#set~0.base, ~#set~0.offset, ~n~0, #t~mem3); {21033#true} is VALID [2018-11-18 23:02:56,696 INFO L273 TraceCheckUtils]: 158: Hoare triple {21033#true} ~set.base, ~set.offset := #in~set.base, #in~set.offset;~size := #in~size;~value := #in~value;havoc ~i~0;~i~0 := 0; {21033#true} is VALID [2018-11-18 23:02:56,696 INFO L273 TraceCheckUtils]: 159: Hoare triple {21033#true} assume true; {21033#true} is VALID [2018-11-18 23:02:56,696 INFO L273 TraceCheckUtils]: 160: Hoare triple {21033#true} assume !!(~i~0 < ~size);call #t~mem1 := read~int(~set.base, ~set.offset + 4 * ~i~0, 4); {21033#true} is VALID [2018-11-18 23:02:56,696 INFO L273 TraceCheckUtils]: 161: Hoare triple {21033#true} assume #t~mem1 == ~value;havoc #t~mem1;#res := 1; {21033#true} is VALID [2018-11-18 23:02:56,696 INFO L273 TraceCheckUtils]: 162: Hoare triple {21033#true} assume true; {21033#true} is VALID [2018-11-18 23:02:56,697 INFO L268 TraceCheckUtils]: 163: Hoare quadruple {21033#true} {21048#(<= (+ main_~v~0 99988) ~SIZE~0)} #132#return; {21048#(<= (+ main_~v~0 99988) ~SIZE~0)} is VALID [2018-11-18 23:02:56,697 INFO L273 TraceCheckUtils]: 164: Hoare triple {21048#(<= (+ main_~v~0 99988) ~SIZE~0)} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {21048#(<= (+ main_~v~0 99988) ~SIZE~0)} is VALID [2018-11-18 23:02:56,697 INFO L273 TraceCheckUtils]: 165: Hoare triple {21048#(<= (+ main_~v~0 99988) ~SIZE~0)} assume !(1 != #t~ret4);havoc #t~mem3;havoc #t~ret4; {21048#(<= (+ main_~v~0 99988) ~SIZE~0)} is VALID [2018-11-18 23:02:56,698 INFO L273 TraceCheckUtils]: 166: Hoare triple {21048#(<= (+ main_~v~0 99988) ~SIZE~0)} #t~post2 := ~v~0;~v~0 := 1 + #t~post2;havoc #t~post2; {21049#(<= (+ main_~v~0 99987) ~SIZE~0)} is VALID [2018-11-18 23:02:56,699 INFO L273 TraceCheckUtils]: 167: Hoare triple {21049#(<= (+ main_~v~0 99987) ~SIZE~0)} assume true; {21049#(<= (+ main_~v~0 99987) ~SIZE~0)} is VALID [2018-11-18 23:02:56,699 INFO L273 TraceCheckUtils]: 168: Hoare triple {21049#(<= (+ main_~v~0 99987) ~SIZE~0)} assume !!(~v~0 < ~SIZE~0);call #t~mem3 := read~int(~#values~0.base, ~#values~0.offset + 4 * ~v~0, 4); {21049#(<= (+ main_~v~0 99987) ~SIZE~0)} is VALID [2018-11-18 23:02:56,699 INFO L256 TraceCheckUtils]: 169: Hoare triple {21049#(<= (+ main_~v~0 99987) ~SIZE~0)} call #t~ret4 := elem_exists(~#set~0.base, ~#set~0.offset, ~n~0, #t~mem3); {21033#true} is VALID [2018-11-18 23:02:56,700 INFO L273 TraceCheckUtils]: 170: Hoare triple {21033#true} ~set.base, ~set.offset := #in~set.base, #in~set.offset;~size := #in~size;~value := #in~value;havoc ~i~0;~i~0 := 0; {21033#true} is VALID [2018-11-18 23:02:56,700 INFO L273 TraceCheckUtils]: 171: Hoare triple {21033#true} assume true; {21033#true} is VALID [2018-11-18 23:02:56,700 INFO L273 TraceCheckUtils]: 172: Hoare triple {21033#true} assume !!(~i~0 < ~size);call #t~mem1 := read~int(~set.base, ~set.offset + 4 * ~i~0, 4); {21033#true} is VALID [2018-11-18 23:02:56,700 INFO L273 TraceCheckUtils]: 173: Hoare triple {21033#true} assume #t~mem1 == ~value;havoc #t~mem1;#res := 1; {21033#true} is VALID [2018-11-18 23:02:56,700 INFO L273 TraceCheckUtils]: 174: Hoare triple {21033#true} assume true; {21033#true} is VALID [2018-11-18 23:02:56,701 INFO L268 TraceCheckUtils]: 175: Hoare quadruple {21033#true} {21049#(<= (+ main_~v~0 99987) ~SIZE~0)} #132#return; {21049#(<= (+ main_~v~0 99987) ~SIZE~0)} is VALID [2018-11-18 23:02:56,702 INFO L273 TraceCheckUtils]: 176: Hoare triple {21049#(<= (+ main_~v~0 99987) ~SIZE~0)} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {21049#(<= (+ main_~v~0 99987) ~SIZE~0)} is VALID [2018-11-18 23:02:56,702 INFO L273 TraceCheckUtils]: 177: Hoare triple {21049#(<= (+ main_~v~0 99987) ~SIZE~0)} assume !(1 != #t~ret4);havoc #t~mem3;havoc #t~ret4; {21049#(<= (+ main_~v~0 99987) ~SIZE~0)} is VALID [2018-11-18 23:02:56,703 INFO L273 TraceCheckUtils]: 178: Hoare triple {21049#(<= (+ main_~v~0 99987) ~SIZE~0)} #t~post2 := ~v~0;~v~0 := 1 + #t~post2;havoc #t~post2; {21050#(<= (+ main_~v~0 99986) ~SIZE~0)} is VALID [2018-11-18 23:02:56,703 INFO L273 TraceCheckUtils]: 179: Hoare triple {21050#(<= (+ main_~v~0 99986) ~SIZE~0)} assume true; {21050#(<= (+ main_~v~0 99986) ~SIZE~0)} is VALID [2018-11-18 23:02:56,704 INFO L273 TraceCheckUtils]: 180: Hoare triple {21050#(<= (+ main_~v~0 99986) ~SIZE~0)} assume !(~v~0 < ~SIZE~0); {21034#false} is VALID [2018-11-18 23:02:56,704 INFO L273 TraceCheckUtils]: 181: Hoare triple {21034#false} ~i~1 := 0; {21034#false} is VALID [2018-11-18 23:02:56,704 INFO L273 TraceCheckUtils]: 182: Hoare triple {21034#false} assume true; {21034#false} is VALID [2018-11-18 23:02:56,704 INFO L273 TraceCheckUtils]: 183: Hoare triple {21034#false} assume !!(~i~1 < ~SIZE~0 && 1 != ~found~0);call #t~mem8 := read~int(~#set~0.base, ~#set~0.offset + 4 * ~i~1, 4); {21034#false} is VALID [2018-11-18 23:02:56,704 INFO L273 TraceCheckUtils]: 184: Hoare triple {21034#false} assume !(#t~mem8 == ~element~0);havoc #t~mem8; {21034#false} is VALID [2018-11-18 23:02:56,704 INFO L273 TraceCheckUtils]: 185: Hoare triple {21034#false} #t~post7 := ~i~1;~i~1 := 1 + #t~post7;havoc #t~post7; {21034#false} is VALID [2018-11-18 23:02:56,704 INFO L273 TraceCheckUtils]: 186: Hoare triple {21034#false} assume true; {21034#false} is VALID [2018-11-18 23:02:56,704 INFO L273 TraceCheckUtils]: 187: Hoare triple {21034#false} assume !!(~i~1 < ~SIZE~0 && 1 != ~found~0);call #t~mem8 := read~int(~#set~0.base, ~#set~0.offset + 4 * ~i~1, 4); {21034#false} is VALID [2018-11-18 23:02:56,704 INFO L273 TraceCheckUtils]: 188: Hoare triple {21034#false} assume !(#t~mem8 == ~element~0);havoc #t~mem8; {21034#false} is VALID [2018-11-18 23:02:56,705 INFO L273 TraceCheckUtils]: 189: Hoare triple {21034#false} #t~post7 := ~i~1;~i~1 := 1 + #t~post7;havoc #t~post7; {21034#false} is VALID [2018-11-18 23:02:56,705 INFO L273 TraceCheckUtils]: 190: Hoare triple {21034#false} assume true; {21034#false} is VALID [2018-11-18 23:02:56,705 INFO L273 TraceCheckUtils]: 191: Hoare triple {21034#false} assume !!(~i~1 < ~SIZE~0 && 1 != ~found~0);call #t~mem8 := read~int(~#set~0.base, ~#set~0.offset + 4 * ~i~1, 4); {21034#false} is VALID [2018-11-18 23:02:56,705 INFO L273 TraceCheckUtils]: 192: Hoare triple {21034#false} assume !(#t~mem8 == ~element~0);havoc #t~mem8; {21034#false} is VALID [2018-11-18 23:02:56,705 INFO L273 TraceCheckUtils]: 193: Hoare triple {21034#false} #t~post7 := ~i~1;~i~1 := 1 + #t~post7;havoc #t~post7; {21034#false} is VALID [2018-11-18 23:02:56,705 INFO L273 TraceCheckUtils]: 194: Hoare triple {21034#false} assume true; {21034#false} is VALID [2018-11-18 23:02:56,705 INFO L273 TraceCheckUtils]: 195: Hoare triple {21034#false} assume !!(~i~1 < ~SIZE~0 && 1 != ~found~0);call #t~mem8 := read~int(~#set~0.base, ~#set~0.offset + 4 * ~i~1, 4); {21034#false} is VALID [2018-11-18 23:02:56,705 INFO L273 TraceCheckUtils]: 196: Hoare triple {21034#false} assume #t~mem8 == ~element~0;havoc #t~mem8;~found~0 := 1;~pos~0 := ~i~1; {21034#false} is VALID [2018-11-18 23:02:56,706 INFO L273 TraceCheckUtils]: 197: Hoare triple {21034#false} #t~post7 := ~i~1;~i~1 := 1 + #t~post7;havoc #t~post7; {21034#false} is VALID [2018-11-18 23:02:56,706 INFO L273 TraceCheckUtils]: 198: Hoare triple {21034#false} assume true; {21034#false} is VALID [2018-11-18 23:02:56,706 INFO L273 TraceCheckUtils]: 199: Hoare triple {21034#false} assume !(~i~1 < ~SIZE~0 && 1 != ~found~0); {21034#false} is VALID [2018-11-18 23:02:56,706 INFO L273 TraceCheckUtils]: 200: Hoare triple {21034#false} assume 1 == ~found~0;~i~1 := ~pos~0; {21034#false} is VALID [2018-11-18 23:02:56,706 INFO L273 TraceCheckUtils]: 201: Hoare triple {21034#false} assume true; {21034#false} is VALID [2018-11-18 23:02:56,706 INFO L273 TraceCheckUtils]: 202: Hoare triple {21034#false} assume !(~i~1 < ~SIZE~0 - 1); {21034#false} is VALID [2018-11-18 23:02:56,707 INFO L273 TraceCheckUtils]: 203: Hoare triple {21034#false} assume 1 == ~found~0;~i~1 := 0; {21034#false} is VALID [2018-11-18 23:02:56,707 INFO L273 TraceCheckUtils]: 204: Hoare triple {21034#false} assume true; {21034#false} is VALID [2018-11-18 23:02:56,707 INFO L273 TraceCheckUtils]: 205: Hoare triple {21034#false} assume !!(~i~1 < ~SIZE~0 - 1);call #t~mem12 := read~int(~#set~0.base, ~#set~0.offset + 4 * ~i~1, 4); {21034#false} is VALID [2018-11-18 23:02:56,707 INFO L256 TraceCheckUtils]: 206: Hoare triple {21034#false} call __VERIFIER_assert((if #t~mem12 != ~element~0 then 1 else 0)); {21034#false} is VALID [2018-11-18 23:02:56,707 INFO L273 TraceCheckUtils]: 207: Hoare triple {21034#false} ~cond := #in~cond; {21034#false} is VALID [2018-11-18 23:02:56,707 INFO L273 TraceCheckUtils]: 208: Hoare triple {21034#false} assume 0 == ~cond; {21034#false} is VALID [2018-11-18 23:02:56,708 INFO L273 TraceCheckUtils]: 209: Hoare triple {21034#false} assume !false; {21034#false} is VALID [2018-11-18 23:02:56,735 INFO L134 CoverageAnalysis]: Checked inductivity of 1139 backedges. 0 proven. 574 refuted. 0 times theorem prover too weak. 565 trivial. 0 not checked. [2018-11-18 23:02:56,735 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 23:02:56,735 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-18 23:02:56,744 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-11-18 23:02:56,810 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2018-11-18 23:02:56,810 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-18 23:02:56,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 23:02:56,867 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 23:02:58,299 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2018-11-18 23:02:58,308 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 12 treesize of output 4 [2018-11-18 23:02:58,316 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 23:02:58,320 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 23:02:58,325 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 23:02:58,325 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:4 [2018-11-18 23:02:58,327 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-18 23:02:58,423 INFO L256 TraceCheckUtils]: 0: Hoare triple {21033#true} call ULTIMATE.init(); {21033#true} is VALID [2018-11-18 23:02:58,423 INFO L273 TraceCheckUtils]: 1: Hoare triple {21033#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~SIZE~0 := 100000; {21033#true} is VALID [2018-11-18 23:02:58,424 INFO L273 TraceCheckUtils]: 2: Hoare triple {21033#true} assume true; {21033#true} is VALID [2018-11-18 23:02:58,424 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {21033#true} {21033#true} #128#return; {21033#true} is VALID [2018-11-18 23:02:58,424 INFO L256 TraceCheckUtils]: 4: Hoare triple {21033#true} call #t~ret13 := main(); {21033#true} is VALID [2018-11-18 23:02:58,425 INFO L273 TraceCheckUtils]: 5: Hoare triple {21033#true} havoc ~i~1;havoc ~pos~0;~n~0 := 0;~found~0 := 0;call ~#set~0.base, ~#set~0.offset := #Ultimate.alloc(4 * ~SIZE~0);call ~#values~0.base, ~#values~0.offset := #Ultimate.alloc(4 * ~SIZE~0);havoc ~element~0;havoc ~v~0;~v~0 := 0; {21069#(and (= 0 main_~found~0) (= |main_~#set~0.offset| 0))} is VALID [2018-11-18 23:02:58,426 INFO L273 TraceCheckUtils]: 6: Hoare triple {21069#(and (= 0 main_~found~0) (= |main_~#set~0.offset| 0))} assume true; {21069#(and (= 0 main_~found~0) (= |main_~#set~0.offset| 0))} is VALID [2018-11-18 23:02:58,426 INFO L273 TraceCheckUtils]: 7: Hoare triple {21069#(and (= 0 main_~found~0) (= |main_~#set~0.offset| 0))} assume !!(~v~0 < ~SIZE~0);call #t~mem3 := read~int(~#values~0.base, ~#values~0.offset + 4 * ~v~0, 4); {21069#(and (= 0 main_~found~0) (= |main_~#set~0.offset| 0))} is VALID [2018-11-18 23:02:58,426 INFO L256 TraceCheckUtils]: 8: Hoare triple {21069#(and (= 0 main_~found~0) (= |main_~#set~0.offset| 0))} call #t~ret4 := elem_exists(~#set~0.base, ~#set~0.offset, ~n~0, #t~mem3); {21033#true} is VALID [2018-11-18 23:02:58,426 INFO L273 TraceCheckUtils]: 9: Hoare triple {21033#true} ~set.base, ~set.offset := #in~set.base, #in~set.offset;~size := #in~size;~value := #in~value;havoc ~i~0;~i~0 := 0; {21033#true} is VALID [2018-11-18 23:02:58,426 INFO L273 TraceCheckUtils]: 10: Hoare triple {21033#true} assume true; {21033#true} is VALID [2018-11-18 23:02:58,427 INFO L273 TraceCheckUtils]: 11: Hoare triple {21033#true} assume !(~i~0 < ~size); {21033#true} is VALID [2018-11-18 23:02:58,427 INFO L273 TraceCheckUtils]: 12: Hoare triple {21033#true} #res := 0; {21033#true} is VALID [2018-11-18 23:02:58,427 INFO L273 TraceCheckUtils]: 13: Hoare triple {21033#true} assume true; {21033#true} is VALID [2018-11-18 23:02:58,428 INFO L268 TraceCheckUtils]: 14: Hoare quadruple {21033#true} {21069#(and (= 0 main_~found~0) (= |main_~#set~0.offset| 0))} #132#return; {21069#(and (= 0 main_~found~0) (= |main_~#set~0.offset| 0))} is VALID [2018-11-18 23:02:58,428 INFO L273 TraceCheckUtils]: 15: Hoare triple {21069#(and (= 0 main_~found~0) (= |main_~#set~0.offset| 0))} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {21069#(and (= 0 main_~found~0) (= |main_~#set~0.offset| 0))} is VALID [2018-11-18 23:02:58,428 INFO L273 TraceCheckUtils]: 16: Hoare triple {21069#(and (= 0 main_~found~0) (= |main_~#set~0.offset| 0))} assume 1 != #t~ret4;havoc #t~mem3;havoc #t~ret4;call #t~mem5 := read~int(~#values~0.base, ~#values~0.offset + 4 * ~v~0, 4); {21069#(and (= 0 main_~found~0) (= |main_~#set~0.offset| 0))} is VALID [2018-11-18 23:02:58,429 INFO L256 TraceCheckUtils]: 17: Hoare triple {21069#(and (= 0 main_~found~0) (= |main_~#set~0.offset| 0))} call #t~ret6 := insert(~#set~0.base, ~#set~0.offset, ~n~0, #t~mem5); {21033#true} is VALID [2018-11-18 23:02:58,429 INFO L273 TraceCheckUtils]: 18: Hoare triple {21033#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; {21033#true} is VALID [2018-11-18 23:02:58,429 INFO L273 TraceCheckUtils]: 19: Hoare triple {21033#true} assume true; {21033#true} is VALID [2018-11-18 23:02:58,429 INFO L268 TraceCheckUtils]: 20: Hoare quadruple {21033#true} {21069#(and (= 0 main_~found~0) (= |main_~#set~0.offset| 0))} #134#return; {21069#(and (= 0 main_~found~0) (= |main_~#set~0.offset| 0))} is VALID [2018-11-18 23:02:58,430 INFO L273 TraceCheckUtils]: 21: Hoare triple {21069#(and (= 0 main_~found~0) (= |main_~#set~0.offset| 0))} assume -2147483648 <= #t~ret6 && #t~ret6 <= 2147483647;~n~0 := #t~ret6;havoc #t~ret6;havoc #t~mem5; {21069#(and (= 0 main_~found~0) (= |main_~#set~0.offset| 0))} is VALID [2018-11-18 23:02:58,430 INFO L273 TraceCheckUtils]: 22: Hoare triple {21069#(and (= 0 main_~found~0) (= |main_~#set~0.offset| 0))} #t~post2 := ~v~0;~v~0 := 1 + #t~post2;havoc #t~post2; {21069#(and (= 0 main_~found~0) (= |main_~#set~0.offset| 0))} is VALID [2018-11-18 23:02:58,431 INFO L273 TraceCheckUtils]: 23: Hoare triple {21069#(and (= 0 main_~found~0) (= |main_~#set~0.offset| 0))} assume true; {21069#(and (= 0 main_~found~0) (= |main_~#set~0.offset| 0))} is VALID [2018-11-18 23:02:58,431 INFO L273 TraceCheckUtils]: 24: Hoare triple {21069#(and (= 0 main_~found~0) (= |main_~#set~0.offset| 0))} assume !!(~v~0 < ~SIZE~0);call #t~mem3 := read~int(~#values~0.base, ~#values~0.offset + 4 * ~v~0, 4); {21069#(and (= 0 main_~found~0) (= |main_~#set~0.offset| 0))} is VALID [2018-11-18 23:02:58,431 INFO L256 TraceCheckUtils]: 25: Hoare triple {21069#(and (= 0 main_~found~0) (= |main_~#set~0.offset| 0))} call #t~ret4 := elem_exists(~#set~0.base, ~#set~0.offset, ~n~0, #t~mem3); {21033#true} is VALID [2018-11-18 23:02:58,431 INFO L273 TraceCheckUtils]: 26: Hoare triple {21033#true} ~set.base, ~set.offset := #in~set.base, #in~set.offset;~size := #in~size;~value := #in~value;havoc ~i~0;~i~0 := 0; {21033#true} is VALID [2018-11-18 23:02:58,431 INFO L273 TraceCheckUtils]: 27: Hoare triple {21033#true} assume true; {21033#true} is VALID [2018-11-18 23:02:58,432 INFO L273 TraceCheckUtils]: 28: Hoare triple {21033#true} assume !!(~i~0 < ~size);call #t~mem1 := read~int(~set.base, ~set.offset + 4 * ~i~0, 4); {21033#true} is VALID [2018-11-18 23:02:58,432 INFO L273 TraceCheckUtils]: 29: Hoare triple {21033#true} assume #t~mem1 == ~value;havoc #t~mem1;#res := 1; {21033#true} is VALID [2018-11-18 23:02:58,432 INFO L273 TraceCheckUtils]: 30: Hoare triple {21033#true} assume true; {21033#true} is VALID [2018-11-18 23:02:58,433 INFO L268 TraceCheckUtils]: 31: Hoare quadruple {21033#true} {21069#(and (= 0 main_~found~0) (= |main_~#set~0.offset| 0))} #132#return; {21069#(and (= 0 main_~found~0) (= |main_~#set~0.offset| 0))} is VALID [2018-11-18 23:02:58,434 INFO L273 TraceCheckUtils]: 32: Hoare triple {21069#(and (= 0 main_~found~0) (= |main_~#set~0.offset| 0))} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {21069#(and (= 0 main_~found~0) (= |main_~#set~0.offset| 0))} is VALID [2018-11-18 23:02:58,434 INFO L273 TraceCheckUtils]: 33: Hoare triple {21069#(and (= 0 main_~found~0) (= |main_~#set~0.offset| 0))} assume !(1 != #t~ret4);havoc #t~mem3;havoc #t~ret4; {21069#(and (= 0 main_~found~0) (= |main_~#set~0.offset| 0))} is VALID [2018-11-18 23:02:58,435 INFO L273 TraceCheckUtils]: 34: Hoare triple {21069#(and (= 0 main_~found~0) (= |main_~#set~0.offset| 0))} #t~post2 := ~v~0;~v~0 := 1 + #t~post2;havoc #t~post2; {21069#(and (= 0 main_~found~0) (= |main_~#set~0.offset| 0))} is VALID [2018-11-18 23:02:58,436 INFO L273 TraceCheckUtils]: 35: Hoare triple {21069#(and (= 0 main_~found~0) (= |main_~#set~0.offset| 0))} assume true; {21069#(and (= 0 main_~found~0) (= |main_~#set~0.offset| 0))} is VALID [2018-11-18 23:02:58,437 INFO L273 TraceCheckUtils]: 36: Hoare triple {21069#(and (= 0 main_~found~0) (= |main_~#set~0.offset| 0))} assume !!(~v~0 < ~SIZE~0);call #t~mem3 := read~int(~#values~0.base, ~#values~0.offset + 4 * ~v~0, 4); {21069#(and (= 0 main_~found~0) (= |main_~#set~0.offset| 0))} is VALID [2018-11-18 23:02:58,437 INFO L256 TraceCheckUtils]: 37: Hoare triple {21069#(and (= 0 main_~found~0) (= |main_~#set~0.offset| 0))} call #t~ret4 := elem_exists(~#set~0.base, ~#set~0.offset, ~n~0, #t~mem3); {21033#true} is VALID [2018-11-18 23:02:58,437 INFO L273 TraceCheckUtils]: 38: Hoare triple {21033#true} ~set.base, ~set.offset := #in~set.base, #in~set.offset;~size := #in~size;~value := #in~value;havoc ~i~0;~i~0 := 0; {21033#true} is VALID [2018-11-18 23:02:58,437 INFO L273 TraceCheckUtils]: 39: Hoare triple {21033#true} assume true; {21033#true} is VALID [2018-11-18 23:02:58,437 INFO L273 TraceCheckUtils]: 40: Hoare triple {21033#true} assume !!(~i~0 < ~size);call #t~mem1 := read~int(~set.base, ~set.offset + 4 * ~i~0, 4); {21033#true} is VALID [2018-11-18 23:02:58,437 INFO L273 TraceCheckUtils]: 41: Hoare triple {21033#true} assume #t~mem1 == ~value;havoc #t~mem1;#res := 1; {21033#true} is VALID [2018-11-18 23:02:58,438 INFO L273 TraceCheckUtils]: 42: Hoare triple {21033#true} assume true; {21033#true} is VALID [2018-11-18 23:02:58,448 INFO L268 TraceCheckUtils]: 43: Hoare quadruple {21033#true} {21069#(and (= 0 main_~found~0) (= |main_~#set~0.offset| 0))} #132#return; {21069#(and (= 0 main_~found~0) (= |main_~#set~0.offset| 0))} is VALID [2018-11-18 23:02:58,453 INFO L273 TraceCheckUtils]: 44: Hoare triple {21069#(and (= 0 main_~found~0) (= |main_~#set~0.offset| 0))} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {21069#(and (= 0 main_~found~0) (= |main_~#set~0.offset| 0))} is VALID [2018-11-18 23:02:58,453 INFO L273 TraceCheckUtils]: 45: Hoare triple {21069#(and (= 0 main_~found~0) (= |main_~#set~0.offset| 0))} assume !(1 != #t~ret4);havoc #t~mem3;havoc #t~ret4; {21069#(and (= 0 main_~found~0) (= |main_~#set~0.offset| 0))} is VALID [2018-11-18 23:02:58,454 INFO L273 TraceCheckUtils]: 46: Hoare triple {21069#(and (= 0 main_~found~0) (= |main_~#set~0.offset| 0))} #t~post2 := ~v~0;~v~0 := 1 + #t~post2;havoc #t~post2; {21069#(and (= 0 main_~found~0) (= |main_~#set~0.offset| 0))} is VALID [2018-11-18 23:02:58,454 INFO L273 TraceCheckUtils]: 47: Hoare triple {21069#(and (= 0 main_~found~0) (= |main_~#set~0.offset| 0))} assume true; {21069#(and (= 0 main_~found~0) (= |main_~#set~0.offset| 0))} is VALID [2018-11-18 23:02:58,454 INFO L273 TraceCheckUtils]: 48: Hoare triple {21069#(and (= 0 main_~found~0) (= |main_~#set~0.offset| 0))} assume !!(~v~0 < ~SIZE~0);call #t~mem3 := read~int(~#values~0.base, ~#values~0.offset + 4 * ~v~0, 4); {21069#(and (= 0 main_~found~0) (= |main_~#set~0.offset| 0))} is VALID [2018-11-18 23:02:58,455 INFO L256 TraceCheckUtils]: 49: Hoare triple {21069#(and (= 0 main_~found~0) (= |main_~#set~0.offset| 0))} call #t~ret4 := elem_exists(~#set~0.base, ~#set~0.offset, ~n~0, #t~mem3); {21033#true} is VALID [2018-11-18 23:02:58,455 INFO L273 TraceCheckUtils]: 50: Hoare triple {21033#true} ~set.base, ~set.offset := #in~set.base, #in~set.offset;~size := #in~size;~value := #in~value;havoc ~i~0;~i~0 := 0; {21033#true} is VALID [2018-11-18 23:02:58,455 INFO L273 TraceCheckUtils]: 51: Hoare triple {21033#true} assume true; {21033#true} is VALID [2018-11-18 23:02:58,455 INFO L273 TraceCheckUtils]: 52: Hoare triple {21033#true} assume !!(~i~0 < ~size);call #t~mem1 := read~int(~set.base, ~set.offset + 4 * ~i~0, 4); {21033#true} is VALID [2018-11-18 23:02:58,455 INFO L273 TraceCheckUtils]: 53: Hoare triple {21033#true} assume #t~mem1 == ~value;havoc #t~mem1;#res := 1; {21033#true} is VALID [2018-11-18 23:02:58,455 INFO L273 TraceCheckUtils]: 54: Hoare triple {21033#true} assume true; {21033#true} is VALID [2018-11-18 23:02:58,456 INFO L268 TraceCheckUtils]: 55: Hoare quadruple {21033#true} {21069#(and (= 0 main_~found~0) (= |main_~#set~0.offset| 0))} #132#return; {21069#(and (= 0 main_~found~0) (= |main_~#set~0.offset| 0))} is VALID [2018-11-18 23:02:58,456 INFO L273 TraceCheckUtils]: 56: Hoare triple {21069#(and (= 0 main_~found~0) (= |main_~#set~0.offset| 0))} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {21069#(and (= 0 main_~found~0) (= |main_~#set~0.offset| 0))} is VALID [2018-11-18 23:02:58,457 INFO L273 TraceCheckUtils]: 57: Hoare triple {21069#(and (= 0 main_~found~0) (= |main_~#set~0.offset| 0))} assume !(1 != #t~ret4);havoc #t~mem3;havoc #t~ret4; {21069#(and (= 0 main_~found~0) (= |main_~#set~0.offset| 0))} is VALID [2018-11-18 23:02:58,457 INFO L273 TraceCheckUtils]: 58: Hoare triple {21069#(and (= 0 main_~found~0) (= |main_~#set~0.offset| 0))} #t~post2 := ~v~0;~v~0 := 1 + #t~post2;havoc #t~post2; {21069#(and (= 0 main_~found~0) (= |main_~#set~0.offset| 0))} is VALID [2018-11-18 23:02:58,457 INFO L273 TraceCheckUtils]: 59: Hoare triple {21069#(and (= 0 main_~found~0) (= |main_~#set~0.offset| 0))} assume true; {21069#(and (= 0 main_~found~0) (= |main_~#set~0.offset| 0))} is VALID [2018-11-18 23:02:58,458 INFO L273 TraceCheckUtils]: 60: Hoare triple {21069#(and (= 0 main_~found~0) (= |main_~#set~0.offset| 0))} assume !!(~v~0 < ~SIZE~0);call #t~mem3 := read~int(~#values~0.base, ~#values~0.offset + 4 * ~v~0, 4); {21069#(and (= 0 main_~found~0) (= |main_~#set~0.offset| 0))} is VALID [2018-11-18 23:02:58,458 INFO L256 TraceCheckUtils]: 61: Hoare triple {21069#(and (= 0 main_~found~0) (= |main_~#set~0.offset| 0))} call #t~ret4 := elem_exists(~#set~0.base, ~#set~0.offset, ~n~0, #t~mem3); {21033#true} is VALID [2018-11-18 23:02:58,459 INFO L273 TraceCheckUtils]: 62: Hoare triple {21033#true} ~set.base, ~set.offset := #in~set.base, #in~set.offset;~size := #in~size;~value := #in~value;havoc ~i~0;~i~0 := 0; {21033#true} is VALID [2018-11-18 23:02:58,459 INFO L273 TraceCheckUtils]: 63: Hoare triple {21033#true} assume true; {21033#true} is VALID [2018-11-18 23:02:58,459 INFO L273 TraceCheckUtils]: 64: Hoare triple {21033#true} assume !!(~i~0 < ~size);call #t~mem1 := read~int(~set.base, ~set.offset + 4 * ~i~0, 4); {21033#true} is VALID [2018-11-18 23:02:58,459 INFO L273 TraceCheckUtils]: 65: Hoare triple {21033#true} assume #t~mem1 == ~value;havoc #t~mem1;#res := 1; {21033#true} is VALID [2018-11-18 23:02:58,459 INFO L273 TraceCheckUtils]: 66: Hoare triple {21033#true} assume true; {21033#true} is VALID [2018-11-18 23:02:58,460 INFO L268 TraceCheckUtils]: 67: Hoare quadruple {21033#true} {21069#(and (= 0 main_~found~0) (= |main_~#set~0.offset| 0))} #132#return; {21069#(and (= 0 main_~found~0) (= |main_~#set~0.offset| 0))} is VALID [2018-11-18 23:02:58,461 INFO L273 TraceCheckUtils]: 68: Hoare triple {21069#(and (= 0 main_~found~0) (= |main_~#set~0.offset| 0))} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {21069#(and (= 0 main_~found~0) (= |main_~#set~0.offset| 0))} is VALID [2018-11-18 23:02:58,462 INFO L273 TraceCheckUtils]: 69: Hoare triple {21069#(and (= 0 main_~found~0) (= |main_~#set~0.offset| 0))} assume !(1 != #t~ret4);havoc #t~mem3;havoc #t~ret4; {21069#(and (= 0 main_~found~0) (= |main_~#set~0.offset| 0))} is VALID [2018-11-18 23:02:58,463 INFO L273 TraceCheckUtils]: 70: Hoare triple {21069#(and (= 0 main_~found~0) (= |main_~#set~0.offset| 0))} #t~post2 := ~v~0;~v~0 := 1 + #t~post2;havoc #t~post2; {21069#(and (= 0 main_~found~0) (= |main_~#set~0.offset| 0))} is VALID [2018-11-18 23:02:58,463 INFO L273 TraceCheckUtils]: 71: Hoare triple {21069#(and (= 0 main_~found~0) (= |main_~#set~0.offset| 0))} assume true; {21069#(and (= 0 main_~found~0) (= |main_~#set~0.offset| 0))} is VALID [2018-11-18 23:02:58,464 INFO L273 TraceCheckUtils]: 72: Hoare triple {21069#(and (= 0 main_~found~0) (= |main_~#set~0.offset| 0))} assume !!(~v~0 < ~SIZE~0);call #t~mem3 := read~int(~#values~0.base, ~#values~0.offset + 4 * ~v~0, 4); {21069#(and (= 0 main_~found~0) (= |main_~#set~0.offset| 0))} is VALID [2018-11-18 23:02:58,464 INFO L256 TraceCheckUtils]: 73: Hoare triple {21069#(and (= 0 main_~found~0) (= |main_~#set~0.offset| 0))} call #t~ret4 := elem_exists(~#set~0.base, ~#set~0.offset, ~n~0, #t~mem3); {21033#true} is VALID [2018-11-18 23:02:58,464 INFO L273 TraceCheckUtils]: 74: Hoare triple {21033#true} ~set.base, ~set.offset := #in~set.base, #in~set.offset;~size := #in~size;~value := #in~value;havoc ~i~0;~i~0 := 0; {21033#true} is VALID [2018-11-18 23:02:58,464 INFO L273 TraceCheckUtils]: 75: Hoare triple {21033#true} assume true; {21033#true} is VALID [2018-11-18 23:02:58,465 INFO L273 TraceCheckUtils]: 76: Hoare triple {21033#true} assume !!(~i~0 < ~size);call #t~mem1 := read~int(~set.base, ~set.offset + 4 * ~i~0, 4); {21033#true} is VALID [2018-11-18 23:02:58,465 INFO L273 TraceCheckUtils]: 77: Hoare triple {21033#true} assume #t~mem1 == ~value;havoc #t~mem1;#res := 1; {21033#true} is VALID [2018-11-18 23:02:58,465 INFO L273 TraceCheckUtils]: 78: Hoare triple {21033#true} assume true; {21033#true} is VALID [2018-11-18 23:02:58,466 INFO L268 TraceCheckUtils]: 79: Hoare quadruple {21033#true} {21069#(and (= 0 main_~found~0) (= |main_~#set~0.offset| 0))} #132#return; {21069#(and (= 0 main_~found~0) (= |main_~#set~0.offset| 0))} is VALID [2018-11-18 23:02:58,467 INFO L273 TraceCheckUtils]: 80: Hoare triple {21069#(and (= 0 main_~found~0) (= |main_~#set~0.offset| 0))} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {21069#(and (= 0 main_~found~0) (= |main_~#set~0.offset| 0))} is VALID [2018-11-18 23:02:58,468 INFO L273 TraceCheckUtils]: 81: Hoare triple {21069#(and (= 0 main_~found~0) (= |main_~#set~0.offset| 0))} assume !(1 != #t~ret4);havoc #t~mem3;havoc #t~ret4; {21069#(and (= 0 main_~found~0) (= |main_~#set~0.offset| 0))} is VALID [2018-11-18 23:02:58,468 INFO L273 TraceCheckUtils]: 82: Hoare triple {21069#(and (= 0 main_~found~0) (= |main_~#set~0.offset| 0))} #t~post2 := ~v~0;~v~0 := 1 + #t~post2;havoc #t~post2; {21069#(and (= 0 main_~found~0) (= |main_~#set~0.offset| 0))} is VALID [2018-11-18 23:02:58,469 INFO L273 TraceCheckUtils]: 83: Hoare triple {21069#(and (= 0 main_~found~0) (= |main_~#set~0.offset| 0))} assume true; {21069#(and (= 0 main_~found~0) (= |main_~#set~0.offset| 0))} is VALID [2018-11-18 23:02:58,469 INFO L273 TraceCheckUtils]: 84: Hoare triple {21069#(and (= 0 main_~found~0) (= |main_~#set~0.offset| 0))} assume !!(~v~0 < ~SIZE~0);call #t~mem3 := read~int(~#values~0.base, ~#values~0.offset + 4 * ~v~0, 4); {21069#(and (= 0 main_~found~0) (= |main_~#set~0.offset| 0))} is VALID [2018-11-18 23:02:58,470 INFO L256 TraceCheckUtils]: 85: Hoare triple {21069#(and (= 0 main_~found~0) (= |main_~#set~0.offset| 0))} call #t~ret4 := elem_exists(~#set~0.base, ~#set~0.offset, ~n~0, #t~mem3); {21033#true} is VALID [2018-11-18 23:02:58,470 INFO L273 TraceCheckUtils]: 86: Hoare triple {21033#true} ~set.base, ~set.offset := #in~set.base, #in~set.offset;~size := #in~size;~value := #in~value;havoc ~i~0;~i~0 := 0; {21033#true} is VALID [2018-11-18 23:02:58,470 INFO L273 TraceCheckUtils]: 87: Hoare triple {21033#true} assume true; {21033#true} is VALID [2018-11-18 23:02:58,470 INFO L273 TraceCheckUtils]: 88: Hoare triple {21033#true} assume !!(~i~0 < ~size);call #t~mem1 := read~int(~set.base, ~set.offset + 4 * ~i~0, 4); {21033#true} is VALID [2018-11-18 23:02:58,470 INFO L273 TraceCheckUtils]: 89: Hoare triple {21033#true} assume #t~mem1 == ~value;havoc #t~mem1;#res := 1; {21033#true} is VALID [2018-11-18 23:02:58,471 INFO L273 TraceCheckUtils]: 90: Hoare triple {21033#true} assume true; {21033#true} is VALID [2018-11-18 23:02:58,472 INFO L268 TraceCheckUtils]: 91: Hoare quadruple {21033#true} {21069#(and (= 0 main_~found~0) (= |main_~#set~0.offset| 0))} #132#return; {21069#(and (= 0 main_~found~0) (= |main_~#set~0.offset| 0))} is VALID [2018-11-18 23:02:58,472 INFO L273 TraceCheckUtils]: 92: Hoare triple {21069#(and (= 0 main_~found~0) (= |main_~#set~0.offset| 0))} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {21069#(and (= 0 main_~found~0) (= |main_~#set~0.offset| 0))} is VALID [2018-11-18 23:02:58,473 INFO L273 TraceCheckUtils]: 93: Hoare triple {21069#(and (= 0 main_~found~0) (= |main_~#set~0.offset| 0))} assume !(1 != #t~ret4);havoc #t~mem3;havoc #t~ret4; {21069#(and (= 0 main_~found~0) (= |main_~#set~0.offset| 0))} is VALID [2018-11-18 23:02:58,474 INFO L273 TraceCheckUtils]: 94: Hoare triple {21069#(and (= 0 main_~found~0) (= |main_~#set~0.offset| 0))} #t~post2 := ~v~0;~v~0 := 1 + #t~post2;havoc #t~post2; {21069#(and (= 0 main_~found~0) (= |main_~#set~0.offset| 0))} is VALID [2018-11-18 23:02:58,474 INFO L273 TraceCheckUtils]: 95: Hoare triple {21069#(and (= 0 main_~found~0) (= |main_~#set~0.offset| 0))} assume true; {21069#(and (= 0 main_~found~0) (= |main_~#set~0.offset| 0))} is VALID [2018-11-18 23:02:58,475 INFO L273 TraceCheckUtils]: 96: Hoare triple {21069#(and (= 0 main_~found~0) (= |main_~#set~0.offset| 0))} assume !!(~v~0 < ~SIZE~0);call #t~mem3 := read~int(~#values~0.base, ~#values~0.offset + 4 * ~v~0, 4); {21069#(and (= 0 main_~found~0) (= |main_~#set~0.offset| 0))} is VALID [2018-11-18 23:02:58,475 INFO L256 TraceCheckUtils]: 97: Hoare triple {21069#(and (= 0 main_~found~0) (= |main_~#set~0.offset| 0))} call #t~ret4 := elem_exists(~#set~0.base, ~#set~0.offset, ~n~0, #t~mem3); {21033#true} is VALID [2018-11-18 23:02:58,475 INFO L273 TraceCheckUtils]: 98: Hoare triple {21033#true} ~set.base, ~set.offset := #in~set.base, #in~set.offset;~size := #in~size;~value := #in~value;havoc ~i~0;~i~0 := 0; {21033#true} is VALID [2018-11-18 23:02:58,476 INFO L273 TraceCheckUtils]: 99: Hoare triple {21033#true} assume true; {21033#true} is VALID [2018-11-18 23:02:58,476 INFO L273 TraceCheckUtils]: 100: Hoare triple {21033#true} assume !!(~i~0 < ~size);call #t~mem1 := read~int(~set.base, ~set.offset + 4 * ~i~0, 4); {21033#true} is VALID [2018-11-18 23:02:58,476 INFO L273 TraceCheckUtils]: 101: Hoare triple {21033#true} assume #t~mem1 == ~value;havoc #t~mem1;#res := 1; {21033#true} is VALID [2018-11-18 23:02:58,476 INFO L273 TraceCheckUtils]: 102: Hoare triple {21033#true} assume true; {21033#true} is VALID [2018-11-18 23:02:58,477 INFO L268 TraceCheckUtils]: 103: Hoare quadruple {21033#true} {21069#(and (= 0 main_~found~0) (= |main_~#set~0.offset| 0))} #132#return; {21069#(and (= 0 main_~found~0) (= |main_~#set~0.offset| 0))} is VALID [2018-11-18 23:02:58,478 INFO L273 TraceCheckUtils]: 104: Hoare triple {21069#(and (= 0 main_~found~0) (= |main_~#set~0.offset| 0))} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {21069#(and (= 0 main_~found~0) (= |main_~#set~0.offset| 0))} is VALID [2018-11-18 23:02:58,478 INFO L273 TraceCheckUtils]: 105: Hoare triple {21069#(and (= 0 main_~found~0) (= |main_~#set~0.offset| 0))} assume !(1 != #t~ret4);havoc #t~mem3;havoc #t~ret4; {21069#(and (= 0 main_~found~0) (= |main_~#set~0.offset| 0))} is VALID [2018-11-18 23:02:58,481 INFO L273 TraceCheckUtils]: 106: Hoare triple {21069#(and (= 0 main_~found~0) (= |main_~#set~0.offset| 0))} #t~post2 := ~v~0;~v~0 := 1 + #t~post2;havoc #t~post2; {21069#(and (= 0 main_~found~0) (= |main_~#set~0.offset| 0))} is VALID [2018-11-18 23:02:58,481 INFO L273 TraceCheckUtils]: 107: Hoare triple {21069#(and (= 0 main_~found~0) (= |main_~#set~0.offset| 0))} assume true; {21069#(and (= 0 main_~found~0) (= |main_~#set~0.offset| 0))} is VALID [2018-11-18 23:02:58,482 INFO L273 TraceCheckUtils]: 108: Hoare triple {21069#(and (= 0 main_~found~0) (= |main_~#set~0.offset| 0))} assume !!(~v~0 < ~SIZE~0);call #t~mem3 := read~int(~#values~0.base, ~#values~0.offset + 4 * ~v~0, 4); {21069#(and (= 0 main_~found~0) (= |main_~#set~0.offset| 0))} is VALID [2018-11-18 23:02:58,482 INFO L256 TraceCheckUtils]: 109: Hoare triple {21069#(and (= 0 main_~found~0) (= |main_~#set~0.offset| 0))} call #t~ret4 := elem_exists(~#set~0.base, ~#set~0.offset, ~n~0, #t~mem3); {21033#true} is VALID [2018-11-18 23:02:58,482 INFO L273 TraceCheckUtils]: 110: Hoare triple {21033#true} ~set.base, ~set.offset := #in~set.base, #in~set.offset;~size := #in~size;~value := #in~value;havoc ~i~0;~i~0 := 0; {21033#true} is VALID [2018-11-18 23:02:58,482 INFO L273 TraceCheckUtils]: 111: Hoare triple {21033#true} assume true; {21033#true} is VALID [2018-11-18 23:02:58,482 INFO L273 TraceCheckUtils]: 112: Hoare triple {21033#true} assume !!(~i~0 < ~size);call #t~mem1 := read~int(~set.base, ~set.offset + 4 * ~i~0, 4); {21033#true} is VALID [2018-11-18 23:02:58,482 INFO L273 TraceCheckUtils]: 113: Hoare triple {21033#true} assume #t~mem1 == ~value;havoc #t~mem1;#res := 1; {21033#true} is VALID [2018-11-18 23:02:58,483 INFO L273 TraceCheckUtils]: 114: Hoare triple {21033#true} assume true; {21033#true} is VALID [2018-11-18 23:02:58,483 INFO L268 TraceCheckUtils]: 115: Hoare quadruple {21033#true} {21069#(and (= 0 main_~found~0) (= |main_~#set~0.offset| 0))} #132#return; {21069#(and (= 0 main_~found~0) (= |main_~#set~0.offset| 0))} is VALID [2018-11-18 23:02:58,484 INFO L273 TraceCheckUtils]: 116: Hoare triple {21069#(and (= 0 main_~found~0) (= |main_~#set~0.offset| 0))} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {21069#(and (= 0 main_~found~0) (= |main_~#set~0.offset| 0))} is VALID [2018-11-18 23:02:58,484 INFO L273 TraceCheckUtils]: 117: Hoare triple {21069#(and (= 0 main_~found~0) (= |main_~#set~0.offset| 0))} assume !(1 != #t~ret4);havoc #t~mem3;havoc #t~ret4; {21069#(and (= 0 main_~found~0) (= |main_~#set~0.offset| 0))} is VALID [2018-11-18 23:02:58,484 INFO L273 TraceCheckUtils]: 118: Hoare triple {21069#(and (= 0 main_~found~0) (= |main_~#set~0.offset| 0))} #t~post2 := ~v~0;~v~0 := 1 + #t~post2;havoc #t~post2; {21069#(and (= 0 main_~found~0) (= |main_~#set~0.offset| 0))} is VALID [2018-11-18 23:02:58,485 INFO L273 TraceCheckUtils]: 119: Hoare triple {21069#(and (= 0 main_~found~0) (= |main_~#set~0.offset| 0))} assume true; {21069#(and (= 0 main_~found~0) (= |main_~#set~0.offset| 0))} is VALID [2018-11-18 23:02:58,486 INFO L273 TraceCheckUtils]: 120: Hoare triple {21069#(and (= 0 main_~found~0) (= |main_~#set~0.offset| 0))} assume !!(~v~0 < ~SIZE~0);call #t~mem3 := read~int(~#values~0.base, ~#values~0.offset + 4 * ~v~0, 4); {21069#(and (= 0 main_~found~0) (= |main_~#set~0.offset| 0))} is VALID [2018-11-18 23:02:58,486 INFO L256 TraceCheckUtils]: 121: Hoare triple {21069#(and (= 0 main_~found~0) (= |main_~#set~0.offset| 0))} call #t~ret4 := elem_exists(~#set~0.base, ~#set~0.offset, ~n~0, #t~mem3); {21033#true} is VALID [2018-11-18 23:02:58,486 INFO L273 TraceCheckUtils]: 122: Hoare triple {21033#true} ~set.base, ~set.offset := #in~set.base, #in~set.offset;~size := #in~size;~value := #in~value;havoc ~i~0;~i~0 := 0; {21033#true} is VALID [2018-11-18 23:02:58,486 INFO L273 TraceCheckUtils]: 123: Hoare triple {21033#true} assume true; {21033#true} is VALID [2018-11-18 23:02:58,486 INFO L273 TraceCheckUtils]: 124: Hoare triple {21033#true} assume !!(~i~0 < ~size);call #t~mem1 := read~int(~set.base, ~set.offset + 4 * ~i~0, 4); {21033#true} is VALID [2018-11-18 23:02:58,487 INFO L273 TraceCheckUtils]: 125: Hoare triple {21033#true} assume #t~mem1 == ~value;havoc #t~mem1;#res := 1; {21033#true} is VALID [2018-11-18 23:02:58,487 INFO L273 TraceCheckUtils]: 126: Hoare triple {21033#true} assume true; {21033#true} is VALID [2018-11-18 23:02:58,488 INFO L268 TraceCheckUtils]: 127: Hoare quadruple {21033#true} {21069#(and (= 0 main_~found~0) (= |main_~#set~0.offset| 0))} #132#return; {21069#(and (= 0 main_~found~0) (= |main_~#set~0.offset| 0))} is VALID [2018-11-18 23:02:58,489 INFO L273 TraceCheckUtils]: 128: Hoare triple {21069#(and (= 0 main_~found~0) (= |main_~#set~0.offset| 0))} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {21069#(and (= 0 main_~found~0) (= |main_~#set~0.offset| 0))} is VALID [2018-11-18 23:02:58,489 INFO L273 TraceCheckUtils]: 129: Hoare triple {21069#(and (= 0 main_~found~0) (= |main_~#set~0.offset| 0))} assume !(1 != #t~ret4);havoc #t~mem3;havoc #t~ret4; {21069#(and (= 0 main_~found~0) (= |main_~#set~0.offset| 0))} is VALID [2018-11-18 23:02:58,490 INFO L273 TraceCheckUtils]: 130: Hoare triple {21069#(and (= 0 main_~found~0) (= |main_~#set~0.offset| 0))} #t~post2 := ~v~0;~v~0 := 1 + #t~post2;havoc #t~post2; {21069#(and (= 0 main_~found~0) (= |main_~#set~0.offset| 0))} is VALID [2018-11-18 23:02:58,490 INFO L273 TraceCheckUtils]: 131: Hoare triple {21069#(and (= 0 main_~found~0) (= |main_~#set~0.offset| 0))} assume true; {21069#(and (= 0 main_~found~0) (= |main_~#set~0.offset| 0))} is VALID [2018-11-18 23:02:58,491 INFO L273 TraceCheckUtils]: 132: Hoare triple {21069#(and (= 0 main_~found~0) (= |main_~#set~0.offset| 0))} assume !!(~v~0 < ~SIZE~0);call #t~mem3 := read~int(~#values~0.base, ~#values~0.offset + 4 * ~v~0, 4); {21069#(and (= 0 main_~found~0) (= |main_~#set~0.offset| 0))} is VALID [2018-11-18 23:02:58,491 INFO L256 TraceCheckUtils]: 133: Hoare triple {21069#(and (= 0 main_~found~0) (= |main_~#set~0.offset| 0))} call #t~ret4 := elem_exists(~#set~0.base, ~#set~0.offset, ~n~0, #t~mem3); {21033#true} is VALID [2018-11-18 23:02:58,491 INFO L273 TraceCheckUtils]: 134: Hoare triple {21033#true} ~set.base, ~set.offset := #in~set.base, #in~set.offset;~size := #in~size;~value := #in~value;havoc ~i~0;~i~0 := 0; {21033#true} is VALID [2018-11-18 23:02:58,491 INFO L273 TraceCheckUtils]: 135: Hoare triple {21033#true} assume true; {21033#true} is VALID [2018-11-18 23:02:58,491 INFO L273 TraceCheckUtils]: 136: Hoare triple {21033#true} assume !!(~i~0 < ~size);call #t~mem1 := read~int(~set.base, ~set.offset + 4 * ~i~0, 4); {21033#true} is VALID [2018-11-18 23:02:58,491 INFO L273 TraceCheckUtils]: 137: Hoare triple {21033#true} assume #t~mem1 == ~value;havoc #t~mem1;#res := 1; {21033#true} is VALID [2018-11-18 23:02:58,491 INFO L273 TraceCheckUtils]: 138: Hoare triple {21033#true} assume true; {21033#true} is VALID [2018-11-18 23:02:58,492 INFO L268 TraceCheckUtils]: 139: Hoare quadruple {21033#true} {21069#(and (= 0 main_~found~0) (= |main_~#set~0.offset| 0))} #132#return; {21069#(and (= 0 main_~found~0) (= |main_~#set~0.offset| 0))} is VALID [2018-11-18 23:02:58,492 INFO L273 TraceCheckUtils]: 140: Hoare triple {21069#(and (= 0 main_~found~0) (= |main_~#set~0.offset| 0))} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {21069#(and (= 0 main_~found~0) (= |main_~#set~0.offset| 0))} is VALID [2018-11-18 23:02:58,493 INFO L273 TraceCheckUtils]: 141: Hoare triple {21069#(and (= 0 main_~found~0) (= |main_~#set~0.offset| 0))} assume !(1 != #t~ret4);havoc #t~mem3;havoc #t~ret4; {21069#(and (= 0 main_~found~0) (= |main_~#set~0.offset| 0))} is VALID [2018-11-18 23:02:58,493 INFO L273 TraceCheckUtils]: 142: Hoare triple {21069#(and (= 0 main_~found~0) (= |main_~#set~0.offset| 0))} #t~post2 := ~v~0;~v~0 := 1 + #t~post2;havoc #t~post2; {21069#(and (= 0 main_~found~0) (= |main_~#set~0.offset| 0))} is VALID [2018-11-18 23:02:58,494 INFO L273 TraceCheckUtils]: 143: Hoare triple {21069#(and (= 0 main_~found~0) (= |main_~#set~0.offset| 0))} assume true; {21069#(and (= 0 main_~found~0) (= |main_~#set~0.offset| 0))} is VALID [2018-11-18 23:02:58,499 INFO L273 TraceCheckUtils]: 144: Hoare triple {21069#(and (= 0 main_~found~0) (= |main_~#set~0.offset| 0))} assume !!(~v~0 < ~SIZE~0);call #t~mem3 := read~int(~#values~0.base, ~#values~0.offset + 4 * ~v~0, 4); {21069#(and (= 0 main_~found~0) (= |main_~#set~0.offset| 0))} is VALID [2018-11-18 23:02:58,499 INFO L256 TraceCheckUtils]: 145: Hoare triple {21069#(and (= 0 main_~found~0) (= |main_~#set~0.offset| 0))} call #t~ret4 := elem_exists(~#set~0.base, ~#set~0.offset, ~n~0, #t~mem3); {21033#true} is VALID [2018-11-18 23:02:58,499 INFO L273 TraceCheckUtils]: 146: Hoare triple {21033#true} ~set.base, ~set.offset := #in~set.base, #in~set.offset;~size := #in~size;~value := #in~value;havoc ~i~0;~i~0 := 0; {21033#true} is VALID [2018-11-18 23:02:58,499 INFO L273 TraceCheckUtils]: 147: Hoare triple {21033#true} assume true; {21033#true} is VALID [2018-11-18 23:02:58,499 INFO L273 TraceCheckUtils]: 148: Hoare triple {21033#true} assume !!(~i~0 < ~size);call #t~mem1 := read~int(~set.base, ~set.offset + 4 * ~i~0, 4); {21033#true} is VALID [2018-11-18 23:02:58,500 INFO L273 TraceCheckUtils]: 149: Hoare triple {21033#true} assume #t~mem1 == ~value;havoc #t~mem1;#res := 1; {21033#true} is VALID [2018-11-18 23:02:58,500 INFO L273 TraceCheckUtils]: 150: Hoare triple {21033#true} assume true; {21033#true} is VALID [2018-11-18 23:02:58,500 INFO L268 TraceCheckUtils]: 151: Hoare quadruple {21033#true} {21069#(and (= 0 main_~found~0) (= |main_~#set~0.offset| 0))} #132#return; {21069#(and (= 0 main_~found~0) (= |main_~#set~0.offset| 0))} is VALID [2018-11-18 23:02:58,501 INFO L273 TraceCheckUtils]: 152: Hoare triple {21069#(and (= 0 main_~found~0) (= |main_~#set~0.offset| 0))} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {21069#(and (= 0 main_~found~0) (= |main_~#set~0.offset| 0))} is VALID [2018-11-18 23:02:58,501 INFO L273 TraceCheckUtils]: 153: Hoare triple {21069#(and (= 0 main_~found~0) (= |main_~#set~0.offset| 0))} assume !(1 != #t~ret4);havoc #t~mem3;havoc #t~ret4; {21069#(and (= 0 main_~found~0) (= |main_~#set~0.offset| 0))} is VALID [2018-11-18 23:02:58,502 INFO L273 TraceCheckUtils]: 154: Hoare triple {21069#(and (= 0 main_~found~0) (= |main_~#set~0.offset| 0))} #t~post2 := ~v~0;~v~0 := 1 + #t~post2;havoc #t~post2; {21069#(and (= 0 main_~found~0) (= |main_~#set~0.offset| 0))} is VALID [2018-11-18 23:02:58,502 INFO L273 TraceCheckUtils]: 155: Hoare triple {21069#(and (= 0 main_~found~0) (= |main_~#set~0.offset| 0))} assume true; {21069#(and (= 0 main_~found~0) (= |main_~#set~0.offset| 0))} is VALID [2018-11-18 23:02:58,502 INFO L273 TraceCheckUtils]: 156: Hoare triple {21069#(and (= 0 main_~found~0) (= |main_~#set~0.offset| 0))} assume !!(~v~0 < ~SIZE~0);call #t~mem3 := read~int(~#values~0.base, ~#values~0.offset + 4 * ~v~0, 4); {21069#(and (= 0 main_~found~0) (= |main_~#set~0.offset| 0))} is VALID [2018-11-18 23:02:58,503 INFO L256 TraceCheckUtils]: 157: Hoare triple {21069#(and (= 0 main_~found~0) (= |main_~#set~0.offset| 0))} call #t~ret4 := elem_exists(~#set~0.base, ~#set~0.offset, ~n~0, #t~mem3); {21033#true} is VALID [2018-11-18 23:02:58,503 INFO L273 TraceCheckUtils]: 158: Hoare triple {21033#true} ~set.base, ~set.offset := #in~set.base, #in~set.offset;~size := #in~size;~value := #in~value;havoc ~i~0;~i~0 := 0; {21033#true} is VALID [2018-11-18 23:02:58,503 INFO L273 TraceCheckUtils]: 159: Hoare triple {21033#true} assume true; {21033#true} is VALID [2018-11-18 23:02:58,503 INFO L273 TraceCheckUtils]: 160: Hoare triple {21033#true} assume !!(~i~0 < ~size);call #t~mem1 := read~int(~set.base, ~set.offset + 4 * ~i~0, 4); {21033#true} is VALID [2018-11-18 23:02:58,503 INFO L273 TraceCheckUtils]: 161: Hoare triple {21033#true} assume #t~mem1 == ~value;havoc #t~mem1;#res := 1; {21033#true} is VALID [2018-11-18 23:02:58,503 INFO L273 TraceCheckUtils]: 162: Hoare triple {21033#true} assume true; {21033#true} is VALID [2018-11-18 23:02:58,504 INFO L268 TraceCheckUtils]: 163: Hoare quadruple {21033#true} {21069#(and (= 0 main_~found~0) (= |main_~#set~0.offset| 0))} #132#return; {21069#(and (= 0 main_~found~0) (= |main_~#set~0.offset| 0))} is VALID [2018-11-18 23:02:58,505 INFO L273 TraceCheckUtils]: 164: Hoare triple {21069#(and (= 0 main_~found~0) (= |main_~#set~0.offset| 0))} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {21069#(and (= 0 main_~found~0) (= |main_~#set~0.offset| 0))} is VALID [2018-11-18 23:02:58,505 INFO L273 TraceCheckUtils]: 165: Hoare triple {21069#(and (= 0 main_~found~0) (= |main_~#set~0.offset| 0))} assume !(1 != #t~ret4);havoc #t~mem3;havoc #t~ret4; {21069#(and (= 0 main_~found~0) (= |main_~#set~0.offset| 0))} is VALID [2018-11-18 23:02:58,506 INFO L273 TraceCheckUtils]: 166: Hoare triple {21069#(and (= 0 main_~found~0) (= |main_~#set~0.offset| 0))} #t~post2 := ~v~0;~v~0 := 1 + #t~post2;havoc #t~post2; {21069#(and (= 0 main_~found~0) (= |main_~#set~0.offset| 0))} is VALID [2018-11-18 23:02:58,507 INFO L273 TraceCheckUtils]: 167: Hoare triple {21069#(and (= 0 main_~found~0) (= |main_~#set~0.offset| 0))} assume true; {21069#(and (= 0 main_~found~0) (= |main_~#set~0.offset| 0))} is VALID [2018-11-18 23:02:58,507 INFO L273 TraceCheckUtils]: 168: Hoare triple {21069#(and (= 0 main_~found~0) (= |main_~#set~0.offset| 0))} assume !!(~v~0 < ~SIZE~0);call #t~mem3 := read~int(~#values~0.base, ~#values~0.offset + 4 * ~v~0, 4); {21069#(and (= 0 main_~found~0) (= |main_~#set~0.offset| 0))} is VALID [2018-11-18 23:02:58,508 INFO L256 TraceCheckUtils]: 169: Hoare triple {21069#(and (= 0 main_~found~0) (= |main_~#set~0.offset| 0))} call #t~ret4 := elem_exists(~#set~0.base, ~#set~0.offset, ~n~0, #t~mem3); {21033#true} is VALID [2018-11-18 23:02:58,508 INFO L273 TraceCheckUtils]: 170: Hoare triple {21033#true} ~set.base, ~set.offset := #in~set.base, #in~set.offset;~size := #in~size;~value := #in~value;havoc ~i~0;~i~0 := 0; {21033#true} is VALID [2018-11-18 23:02:58,508 INFO L273 TraceCheckUtils]: 171: Hoare triple {21033#true} assume true; {21033#true} is VALID [2018-11-18 23:02:58,508 INFO L273 TraceCheckUtils]: 172: Hoare triple {21033#true} assume !!(~i~0 < ~size);call #t~mem1 := read~int(~set.base, ~set.offset + 4 * ~i~0, 4); {21033#true} is VALID [2018-11-18 23:02:58,508 INFO L273 TraceCheckUtils]: 173: Hoare triple {21033#true} assume #t~mem1 == ~value;havoc #t~mem1;#res := 1; {21033#true} is VALID [2018-11-18 23:02:58,508 INFO L273 TraceCheckUtils]: 174: Hoare triple {21033#true} assume true; {21033#true} is VALID [2018-11-18 23:02:58,510 INFO L268 TraceCheckUtils]: 175: Hoare quadruple {21033#true} {21069#(and (= 0 main_~found~0) (= |main_~#set~0.offset| 0))} #132#return; {21069#(and (= 0 main_~found~0) (= |main_~#set~0.offset| 0))} is VALID [2018-11-18 23:02:58,510 INFO L273 TraceCheckUtils]: 176: Hoare triple {21069#(and (= 0 main_~found~0) (= |main_~#set~0.offset| 0))} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {21069#(and (= 0 main_~found~0) (= |main_~#set~0.offset| 0))} is VALID [2018-11-18 23:02:58,510 INFO L273 TraceCheckUtils]: 177: Hoare triple {21069#(and (= 0 main_~found~0) (= |main_~#set~0.offset| 0))} assume !(1 != #t~ret4);havoc #t~mem3;havoc #t~ret4; {21069#(and (= 0 main_~found~0) (= |main_~#set~0.offset| 0))} is VALID [2018-11-18 23:02:58,511 INFO L273 TraceCheckUtils]: 178: Hoare triple {21069#(and (= 0 main_~found~0) (= |main_~#set~0.offset| 0))} #t~post2 := ~v~0;~v~0 := 1 + #t~post2;havoc #t~post2; {21069#(and (= 0 main_~found~0) (= |main_~#set~0.offset| 0))} is VALID [2018-11-18 23:02:58,511 INFO L273 TraceCheckUtils]: 179: Hoare triple {21069#(and (= 0 main_~found~0) (= |main_~#set~0.offset| 0))} assume true; {21069#(and (= 0 main_~found~0) (= |main_~#set~0.offset| 0))} is VALID [2018-11-18 23:02:58,511 INFO L273 TraceCheckUtils]: 180: Hoare triple {21069#(and (= 0 main_~found~0) (= |main_~#set~0.offset| 0))} assume !(~v~0 < ~SIZE~0); {21069#(and (= 0 main_~found~0) (= |main_~#set~0.offset| 0))} is VALID [2018-11-18 23:02:58,512 INFO L273 TraceCheckUtils]: 181: Hoare triple {21069#(and (= 0 main_~found~0) (= |main_~#set~0.offset| 0))} ~i~1 := 0; {21598#(and (= 0 main_~found~0) (= |main_~#set~0.offset| 0) (= main_~i~1 0))} is VALID [2018-11-18 23:02:58,513 INFO L273 TraceCheckUtils]: 182: Hoare triple {21598#(and (= 0 main_~found~0) (= |main_~#set~0.offset| 0) (= main_~i~1 0))} assume true; {21598#(and (= 0 main_~found~0) (= |main_~#set~0.offset| 0) (= main_~i~1 0))} is VALID [2018-11-18 23:02:58,514 INFO L273 TraceCheckUtils]: 183: Hoare triple {21598#(and (= 0 main_~found~0) (= |main_~#set~0.offset| 0) (= main_~i~1 0))} assume !!(~i~1 < ~SIZE~0 && 1 != ~found~0);call #t~mem8 := read~int(~#set~0.base, ~#set~0.offset + 4 * ~i~1, 4); {21605#(and (= 0 main_~found~0) (= (select (select |#memory_int| |main_~#set~0.base|) |main_~#set~0.offset|) |main_#t~mem8|) (= |main_~#set~0.offset| 0))} is VALID [2018-11-18 23:02:58,514 INFO L273 TraceCheckUtils]: 184: Hoare triple {21605#(and (= 0 main_~found~0) (= (select (select |#memory_int| |main_~#set~0.base|) |main_~#set~0.offset|) |main_#t~mem8|) (= |main_~#set~0.offset| 0))} assume !(#t~mem8 == ~element~0);havoc #t~mem8; {21609#(and (= 0 main_~found~0) (= |main_~#set~0.offset| 0) (not (= (select (select |#memory_int| |main_~#set~0.base|) |main_~#set~0.offset|) main_~element~0)))} is VALID [2018-11-18 23:02:58,515 INFO L273 TraceCheckUtils]: 185: Hoare triple {21609#(and (= 0 main_~found~0) (= |main_~#set~0.offset| 0) (not (= (select (select |#memory_int| |main_~#set~0.base|) |main_~#set~0.offset|) main_~element~0)))} #t~post7 := ~i~1;~i~1 := 1 + #t~post7;havoc #t~post7; {21609#(and (= 0 main_~found~0) (= |main_~#set~0.offset| 0) (not (= (select (select |#memory_int| |main_~#set~0.base|) |main_~#set~0.offset|) main_~element~0)))} is VALID [2018-11-18 23:02:58,516 INFO L273 TraceCheckUtils]: 186: Hoare triple {21609#(and (= 0 main_~found~0) (= |main_~#set~0.offset| 0) (not (= (select (select |#memory_int| |main_~#set~0.base|) |main_~#set~0.offset|) main_~element~0)))} assume true; {21609#(and (= 0 main_~found~0) (= |main_~#set~0.offset| 0) (not (= (select (select |#memory_int| |main_~#set~0.base|) |main_~#set~0.offset|) main_~element~0)))} is VALID [2018-11-18 23:02:58,517 INFO L273 TraceCheckUtils]: 187: Hoare triple {21609#(and (= 0 main_~found~0) (= |main_~#set~0.offset| 0) (not (= (select (select |#memory_int| |main_~#set~0.base|) |main_~#set~0.offset|) main_~element~0)))} assume !!(~i~1 < ~SIZE~0 && 1 != ~found~0);call #t~mem8 := read~int(~#set~0.base, ~#set~0.offset + 4 * ~i~1, 4); {21609#(and (= 0 main_~found~0) (= |main_~#set~0.offset| 0) (not (= (select (select |#memory_int| |main_~#set~0.base|) |main_~#set~0.offset|) main_~element~0)))} is VALID [2018-11-18 23:02:58,517 INFO L273 TraceCheckUtils]: 188: Hoare triple {21609#(and (= 0 main_~found~0) (= |main_~#set~0.offset| 0) (not (= (select (select |#memory_int| |main_~#set~0.base|) |main_~#set~0.offset|) main_~element~0)))} assume !(#t~mem8 == ~element~0);havoc #t~mem8; {21609#(and (= 0 main_~found~0) (= |main_~#set~0.offset| 0) (not (= (select (select |#memory_int| |main_~#set~0.base|) |main_~#set~0.offset|) main_~element~0)))} is VALID [2018-11-18 23:02:58,518 INFO L273 TraceCheckUtils]: 189: Hoare triple {21609#(and (= 0 main_~found~0) (= |main_~#set~0.offset| 0) (not (= (select (select |#memory_int| |main_~#set~0.base|) |main_~#set~0.offset|) main_~element~0)))} #t~post7 := ~i~1;~i~1 := 1 + #t~post7;havoc #t~post7; {21609#(and (= 0 main_~found~0) (= |main_~#set~0.offset| 0) (not (= (select (select |#memory_int| |main_~#set~0.base|) |main_~#set~0.offset|) main_~element~0)))} is VALID [2018-11-18 23:02:58,519 INFO L273 TraceCheckUtils]: 190: Hoare triple {21609#(and (= 0 main_~found~0) (= |main_~#set~0.offset| 0) (not (= (select (select |#memory_int| |main_~#set~0.base|) |main_~#set~0.offset|) main_~element~0)))} assume true; {21609#(and (= 0 main_~found~0) (= |main_~#set~0.offset| 0) (not (= (select (select |#memory_int| |main_~#set~0.base|) |main_~#set~0.offset|) main_~element~0)))} is VALID [2018-11-18 23:02:58,520 INFO L273 TraceCheckUtils]: 191: Hoare triple {21609#(and (= 0 main_~found~0) (= |main_~#set~0.offset| 0) (not (= (select (select |#memory_int| |main_~#set~0.base|) |main_~#set~0.offset|) main_~element~0)))} assume !!(~i~1 < ~SIZE~0 && 1 != ~found~0);call #t~mem8 := read~int(~#set~0.base, ~#set~0.offset + 4 * ~i~1, 4); {21609#(and (= 0 main_~found~0) (= |main_~#set~0.offset| 0) (not (= (select (select |#memory_int| |main_~#set~0.base|) |main_~#set~0.offset|) main_~element~0)))} is VALID [2018-11-18 23:02:58,520 INFO L273 TraceCheckUtils]: 192: Hoare triple {21609#(and (= 0 main_~found~0) (= |main_~#set~0.offset| 0) (not (= (select (select |#memory_int| |main_~#set~0.base|) |main_~#set~0.offset|) main_~element~0)))} assume !(#t~mem8 == ~element~0);havoc #t~mem8; {21609#(and (= 0 main_~found~0) (= |main_~#set~0.offset| 0) (not (= (select (select |#memory_int| |main_~#set~0.base|) |main_~#set~0.offset|) main_~element~0)))} is VALID [2018-11-18 23:02:58,521 INFO L273 TraceCheckUtils]: 193: Hoare triple {21609#(and (= 0 main_~found~0) (= |main_~#set~0.offset| 0) (not (= (select (select |#memory_int| |main_~#set~0.base|) |main_~#set~0.offset|) main_~element~0)))} #t~post7 := ~i~1;~i~1 := 1 + #t~post7;havoc #t~post7; {21609#(and (= 0 main_~found~0) (= |main_~#set~0.offset| 0) (not (= (select (select |#memory_int| |main_~#set~0.base|) |main_~#set~0.offset|) main_~element~0)))} is VALID [2018-11-18 23:02:58,522 INFO L273 TraceCheckUtils]: 194: Hoare triple {21609#(and (= 0 main_~found~0) (= |main_~#set~0.offset| 0) (not (= (select (select |#memory_int| |main_~#set~0.base|) |main_~#set~0.offset|) main_~element~0)))} assume true; {21609#(and (= 0 main_~found~0) (= |main_~#set~0.offset| 0) (not (= (select (select |#memory_int| |main_~#set~0.base|) |main_~#set~0.offset|) main_~element~0)))} is VALID [2018-11-18 23:02:58,523 INFO L273 TraceCheckUtils]: 195: Hoare triple {21609#(and (= 0 main_~found~0) (= |main_~#set~0.offset| 0) (not (= (select (select |#memory_int| |main_~#set~0.base|) |main_~#set~0.offset|) main_~element~0)))} assume !!(~i~1 < ~SIZE~0 && 1 != ~found~0);call #t~mem8 := read~int(~#set~0.base, ~#set~0.offset + 4 * ~i~1, 4); {21643#(and (= |main_~#set~0.offset| 0) (not (= (select (select |#memory_int| |main_~#set~0.base|) |main_~#set~0.offset|) main_~element~0)))} is VALID [2018-11-18 23:02:58,523 INFO L273 TraceCheckUtils]: 196: Hoare triple {21643#(and (= |main_~#set~0.offset| 0) (not (= (select (select |#memory_int| |main_~#set~0.base|) |main_~#set~0.offset|) main_~element~0)))} assume #t~mem8 == ~element~0;havoc #t~mem8;~found~0 := 1;~pos~0 := ~i~1; {21643#(and (= |main_~#set~0.offset| 0) (not (= (select (select |#memory_int| |main_~#set~0.base|) |main_~#set~0.offset|) main_~element~0)))} is VALID [2018-11-18 23:02:58,524 INFO L273 TraceCheckUtils]: 197: Hoare triple {21643#(and (= |main_~#set~0.offset| 0) (not (= (select (select |#memory_int| |main_~#set~0.base|) |main_~#set~0.offset|) main_~element~0)))} #t~post7 := ~i~1;~i~1 := 1 + #t~post7;havoc #t~post7; {21643#(and (= |main_~#set~0.offset| 0) (not (= (select (select |#memory_int| |main_~#set~0.base|) |main_~#set~0.offset|) main_~element~0)))} is VALID [2018-11-18 23:02:58,530 INFO L273 TraceCheckUtils]: 198: Hoare triple {21643#(and (= |main_~#set~0.offset| 0) (not (= (select (select |#memory_int| |main_~#set~0.base|) |main_~#set~0.offset|) main_~element~0)))} assume true; {21643#(and (= |main_~#set~0.offset| 0) (not (= (select (select |#memory_int| |main_~#set~0.base|) |main_~#set~0.offset|) main_~element~0)))} is VALID [2018-11-18 23:02:58,530 INFO L273 TraceCheckUtils]: 199: Hoare triple {21643#(and (= |main_~#set~0.offset| 0) (not (= (select (select |#memory_int| |main_~#set~0.base|) |main_~#set~0.offset|) main_~element~0)))} assume !(~i~1 < ~SIZE~0 && 1 != ~found~0); {21643#(and (= |main_~#set~0.offset| 0) (not (= (select (select |#memory_int| |main_~#set~0.base|) |main_~#set~0.offset|) main_~element~0)))} is VALID [2018-11-18 23:02:58,531 INFO L273 TraceCheckUtils]: 200: Hoare triple {21643#(and (= |main_~#set~0.offset| 0) (not (= (select (select |#memory_int| |main_~#set~0.base|) |main_~#set~0.offset|) main_~element~0)))} assume 1 == ~found~0;~i~1 := ~pos~0; {21643#(and (= |main_~#set~0.offset| 0) (not (= (select (select |#memory_int| |main_~#set~0.base|) |main_~#set~0.offset|) main_~element~0)))} is VALID [2018-11-18 23:02:58,531 INFO L273 TraceCheckUtils]: 201: Hoare triple {21643#(and (= |main_~#set~0.offset| 0) (not (= (select (select |#memory_int| |main_~#set~0.base|) |main_~#set~0.offset|) main_~element~0)))} assume true; {21643#(and (= |main_~#set~0.offset| 0) (not (= (select (select |#memory_int| |main_~#set~0.base|) |main_~#set~0.offset|) main_~element~0)))} is VALID [2018-11-18 23:02:58,531 INFO L273 TraceCheckUtils]: 202: Hoare triple {21643#(and (= |main_~#set~0.offset| 0) (not (= (select (select |#memory_int| |main_~#set~0.base|) |main_~#set~0.offset|) main_~element~0)))} assume !(~i~1 < ~SIZE~0 - 1); {21643#(and (= |main_~#set~0.offset| 0) (not (= (select (select |#memory_int| |main_~#set~0.base|) |main_~#set~0.offset|) main_~element~0)))} is VALID [2018-11-18 23:02:58,532 INFO L273 TraceCheckUtils]: 203: Hoare triple {21643#(and (= |main_~#set~0.offset| 0) (not (= (select (select |#memory_int| |main_~#set~0.base|) |main_~#set~0.offset|) main_~element~0)))} assume 1 == ~found~0;~i~1 := 0; {21668#(and (= |main_~#set~0.offset| 0) (not (= (select (select |#memory_int| |main_~#set~0.base|) |main_~#set~0.offset|) main_~element~0)) (= main_~i~1 0))} is VALID [2018-11-18 23:02:58,532 INFO L273 TraceCheckUtils]: 204: Hoare triple {21668#(and (= |main_~#set~0.offset| 0) (not (= (select (select |#memory_int| |main_~#set~0.base|) |main_~#set~0.offset|) main_~element~0)) (= main_~i~1 0))} assume true; {21668#(and (= |main_~#set~0.offset| 0) (not (= (select (select |#memory_int| |main_~#set~0.base|) |main_~#set~0.offset|) main_~element~0)) (= main_~i~1 0))} is VALID [2018-11-18 23:02:58,533 INFO L273 TraceCheckUtils]: 205: Hoare triple {21668#(and (= |main_~#set~0.offset| 0) (not (= (select (select |#memory_int| |main_~#set~0.base|) |main_~#set~0.offset|) main_~element~0)) (= main_~i~1 0))} assume !!(~i~1 < ~SIZE~0 - 1);call #t~mem12 := read~int(~#set~0.base, ~#set~0.offset + 4 * ~i~1, 4); {21675#(not (= |main_#t~mem12| main_~element~0))} is VALID [2018-11-18 23:02:58,534 INFO L256 TraceCheckUtils]: 206: Hoare triple {21675#(not (= |main_#t~mem12| main_~element~0))} call __VERIFIER_assert((if #t~mem12 != ~element~0 then 1 else 0)); {21679#(= |__VERIFIER_assert_#in~cond| 1)} is VALID [2018-11-18 23:02:58,535 INFO L273 TraceCheckUtils]: 207: Hoare triple {21679#(= |__VERIFIER_assert_#in~cond| 1)} ~cond := #in~cond; {21683#(= 1 __VERIFIER_assert_~cond)} is VALID [2018-11-18 23:02:58,535 INFO L273 TraceCheckUtils]: 208: Hoare triple {21683#(= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {21034#false} is VALID [2018-11-18 23:02:58,536 INFO L273 TraceCheckUtils]: 209: Hoare triple {21034#false} assume !false; {21034#false} is VALID [2018-11-18 23:02:58,589 INFO L134 CoverageAnalysis]: Checked inductivity of 1139 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 1117 trivial. 0 not checked. [2018-11-18 23:02:58,608 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-18 23:02:58,608 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 11] total 27 [2018-11-18 23:02:58,609 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 210 [2018-11-18 23:02:58,609 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-18 23:02:58,609 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 27 states. [2018-11-18 23:02:58,800 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 174 edges. 174 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 23:02:58,800 INFO L459 AbstractCegarLoop]: Interpolant automaton has 27 states [2018-11-18 23:02:58,800 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2018-11-18 23:02:58,801 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=162, Invalid=540, Unknown=0, NotChecked=0, Total=702 [2018-11-18 23:02:58,801 INFO L87 Difference]: Start difference. First operand 225 states and 297 transitions. Second operand 27 states. [2018-11-18 23:03:00,119 WARN L180 SmtUtils]: Spent 121.00 ms on a formula simplification that was a NOOP. DAG size: 13 [2018-11-18 23:03:06,020 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 23:03:06,020 INFO L93 Difference]: Finished difference Result 325 states and 416 transitions. [2018-11-18 23:03:06,020 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-11-18 23:03:06,020 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 210 [2018-11-18 23:03:06,020 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 23:03:06,020 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2018-11-18 23:03:06,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 273 transitions. [2018-11-18 23:03:06,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2018-11-18 23:03:06,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 273 transitions. [2018-11-18 23:03:06,026 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 28 states and 273 transitions. [2018-11-18 23:03:06,377 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 273 edges. 273 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 23:03:06,383 INFO L225 Difference]: With dead ends: 325 [2018-11-18 23:03:06,383 INFO L226 Difference]: Without dead ends: 264 [2018-11-18 23:03:06,384 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 252 GetRequests, 202 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 496 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=529, Invalid=2123, Unknown=0, NotChecked=0, Total=2652 [2018-11-18 23:03:06,384 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 264 states. [2018-11-18 23:03:06,852 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 264 to 245. [2018-11-18 23:03:06,853 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-18 23:03:06,853 INFO L82 GeneralOperation]: Start isEquivalent. First operand 264 states. Second operand 245 states. [2018-11-18 23:03:06,853 INFO L74 IsIncluded]: Start isIncluded. First operand 264 states. Second operand 245 states. [2018-11-18 23:03:06,853 INFO L87 Difference]: Start difference. First operand 264 states. Second operand 245 states. [2018-11-18 23:03:06,860 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 23:03:06,860 INFO L93 Difference]: Finished difference Result 264 states and 348 transitions. [2018-11-18 23:03:06,860 INFO L276 IsEmpty]: Start isEmpty. Operand 264 states and 348 transitions. [2018-11-18 23:03:06,861 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 23:03:06,861 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 23:03:06,861 INFO L74 IsIncluded]: Start isIncluded. First operand 245 states. Second operand 264 states. [2018-11-18 23:03:06,861 INFO L87 Difference]: Start difference. First operand 245 states. Second operand 264 states. [2018-11-18 23:03:06,869 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 23:03:06,869 INFO L93 Difference]: Finished difference Result 264 states and 348 transitions. [2018-11-18 23:03:06,869 INFO L276 IsEmpty]: Start isEmpty. Operand 264 states and 348 transitions. [2018-11-18 23:03:06,870 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 23:03:06,870 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 23:03:06,870 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-18 23:03:06,870 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-18 23:03:06,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 245 states. [2018-11-18 23:03:06,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 245 states to 245 states and 323 transitions. [2018-11-18 23:03:06,877 INFO L78 Accepts]: Start accepts. Automaton has 245 states and 323 transitions. Word has length 210 [2018-11-18 23:03:06,877 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 23:03:06,878 INFO L480 AbstractCegarLoop]: Abstraction has 245 states and 323 transitions. [2018-11-18 23:03:06,878 INFO L481 AbstractCegarLoop]: Interpolant automaton has 27 states. [2018-11-18 23:03:06,878 INFO L276 IsEmpty]: Start isEmpty. Operand 245 states and 323 transitions. [2018-11-18 23:03:06,881 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 224 [2018-11-18 23:03:06,881 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 23:03:06,881 INFO L375 BasicCegarLoop]: trace histogram [16, 15, 15, 15, 15, 15, 15, 15, 15, 14, 14, 14, 4, 3, 3, 3, 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] [2018-11-18 23:03:06,881 INFO L423 AbstractCegarLoop]: === Iteration 22 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 23:03:06,881 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 23:03:06,882 INFO L82 PathProgramCache]: Analyzing trace with hash -696807770, now seen corresponding path program 6 times [2018-11-18 23:03:06,882 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 23:03:06,882 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 23:03:06,883 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 23:03:06,883 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 23:03:06,883 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 23:03:06,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 23:03:07,962 INFO L256 TraceCheckUtils]: 0: Hoare triple {23010#true} call ULTIMATE.init(); {23010#true} is VALID [2018-11-18 23:03:07,963 INFO L273 TraceCheckUtils]: 1: Hoare triple {23010#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~SIZE~0 := 100000; {23012#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:03:07,964 INFO L273 TraceCheckUtils]: 2: Hoare triple {23012#(<= 100000 ~SIZE~0)} assume true; {23012#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:03:07,964 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {23012#(<= 100000 ~SIZE~0)} {23010#true} #128#return; {23012#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:03:07,965 INFO L256 TraceCheckUtils]: 4: Hoare triple {23012#(<= 100000 ~SIZE~0)} call #t~ret13 := main(); {23012#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:03:07,966 INFO L273 TraceCheckUtils]: 5: Hoare triple {23012#(<= 100000 ~SIZE~0)} havoc ~i~1;havoc ~pos~0;~n~0 := 0;~found~0 := 0;call ~#set~0.base, ~#set~0.offset := #Ultimate.alloc(4 * ~SIZE~0);call ~#values~0.base, ~#values~0.offset := #Ultimate.alloc(4 * ~SIZE~0);havoc ~element~0;havoc ~v~0;~v~0 := 0; {23013#(and (= main_~v~0 0) (<= 100000 ~SIZE~0))} is VALID [2018-11-18 23:03:07,967 INFO L273 TraceCheckUtils]: 6: Hoare triple {23013#(and (= main_~v~0 0) (<= 100000 ~SIZE~0))} assume true; {23013#(and (= main_~v~0 0) (<= 100000 ~SIZE~0))} is VALID [2018-11-18 23:03:07,967 INFO L273 TraceCheckUtils]: 7: Hoare triple {23013#(and (= main_~v~0 0) (<= 100000 ~SIZE~0))} assume !!(~v~0 < ~SIZE~0);call #t~mem3 := read~int(~#values~0.base, ~#values~0.offset + 4 * ~v~0, 4); {23013#(and (= main_~v~0 0) (<= 100000 ~SIZE~0))} is VALID [2018-11-18 23:03:07,968 INFO L256 TraceCheckUtils]: 8: Hoare triple {23013#(and (= main_~v~0 0) (<= 100000 ~SIZE~0))} call #t~ret4 := elem_exists(~#set~0.base, ~#set~0.offset, ~n~0, #t~mem3); {23010#true} is VALID [2018-11-18 23:03:07,968 INFO L273 TraceCheckUtils]: 9: Hoare triple {23010#true} ~set.base, ~set.offset := #in~set.base, #in~set.offset;~size := #in~size;~value := #in~value;havoc ~i~0;~i~0 := 0; {23010#true} is VALID [2018-11-18 23:03:07,968 INFO L273 TraceCheckUtils]: 10: Hoare triple {23010#true} assume true; {23010#true} is VALID [2018-11-18 23:03:07,968 INFO L273 TraceCheckUtils]: 11: Hoare triple {23010#true} assume !(~i~0 < ~size); {23010#true} is VALID [2018-11-18 23:03:07,969 INFO L273 TraceCheckUtils]: 12: Hoare triple {23010#true} #res := 0; {23010#true} is VALID [2018-11-18 23:03:07,969 INFO L273 TraceCheckUtils]: 13: Hoare triple {23010#true} assume true; {23010#true} is VALID [2018-11-18 23:03:07,970 INFO L268 TraceCheckUtils]: 14: Hoare quadruple {23010#true} {23013#(and (= main_~v~0 0) (<= 100000 ~SIZE~0))} #132#return; {23013#(and (= main_~v~0 0) (<= 100000 ~SIZE~0))} is VALID [2018-11-18 23:03:07,971 INFO L273 TraceCheckUtils]: 15: Hoare triple {23013#(and (= main_~v~0 0) (<= 100000 ~SIZE~0))} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {23013#(and (= main_~v~0 0) (<= 100000 ~SIZE~0))} is VALID [2018-11-18 23:03:07,971 INFO L273 TraceCheckUtils]: 16: Hoare triple {23013#(and (= main_~v~0 0) (<= 100000 ~SIZE~0))} assume 1 != #t~ret4;havoc #t~mem3;havoc #t~ret4;call #t~mem5 := read~int(~#values~0.base, ~#values~0.offset + 4 * ~v~0, 4); {23013#(and (= main_~v~0 0) (<= 100000 ~SIZE~0))} is VALID [2018-11-18 23:03:07,971 INFO L256 TraceCheckUtils]: 17: Hoare triple {23013#(and (= main_~v~0 0) (<= 100000 ~SIZE~0))} call #t~ret6 := insert(~#set~0.base, ~#set~0.offset, ~n~0, #t~mem5); {23010#true} is VALID [2018-11-18 23:03:07,972 INFO L273 TraceCheckUtils]: 18: Hoare triple {23010#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; {23010#true} is VALID [2018-11-18 23:03:07,972 INFO L273 TraceCheckUtils]: 19: Hoare triple {23010#true} assume true; {23010#true} is VALID [2018-11-18 23:03:07,972 INFO L268 TraceCheckUtils]: 20: Hoare quadruple {23010#true} {23013#(and (= main_~v~0 0) (<= 100000 ~SIZE~0))} #134#return; {23013#(and (= main_~v~0 0) (<= 100000 ~SIZE~0))} is VALID [2018-11-18 23:03:07,973 INFO L273 TraceCheckUtils]: 21: Hoare triple {23013#(and (= main_~v~0 0) (<= 100000 ~SIZE~0))} assume -2147483648 <= #t~ret6 && #t~ret6 <= 2147483647;~n~0 := #t~ret6;havoc #t~ret6;havoc #t~mem5; {23013#(and (= main_~v~0 0) (<= 100000 ~SIZE~0))} is VALID [2018-11-18 23:03:07,974 INFO L273 TraceCheckUtils]: 22: Hoare triple {23013#(and (= main_~v~0 0) (<= 100000 ~SIZE~0))} #t~post2 := ~v~0;~v~0 := 1 + #t~post2;havoc #t~post2; {23014#(<= (+ main_~v~0 99999) ~SIZE~0)} is VALID [2018-11-18 23:03:07,974 INFO L273 TraceCheckUtils]: 23: Hoare triple {23014#(<= (+ main_~v~0 99999) ~SIZE~0)} assume true; {23014#(<= (+ main_~v~0 99999) ~SIZE~0)} is VALID [2018-11-18 23:03:07,975 INFO L273 TraceCheckUtils]: 24: Hoare triple {23014#(<= (+ main_~v~0 99999) ~SIZE~0)} assume !!(~v~0 < ~SIZE~0);call #t~mem3 := read~int(~#values~0.base, ~#values~0.offset + 4 * ~v~0, 4); {23014#(<= (+ main_~v~0 99999) ~SIZE~0)} is VALID [2018-11-18 23:03:07,975 INFO L256 TraceCheckUtils]: 25: Hoare triple {23014#(<= (+ main_~v~0 99999) ~SIZE~0)} call #t~ret4 := elem_exists(~#set~0.base, ~#set~0.offset, ~n~0, #t~mem3); {23010#true} is VALID [2018-11-18 23:03:07,975 INFO L273 TraceCheckUtils]: 26: Hoare triple {23010#true} ~set.base, ~set.offset := #in~set.base, #in~set.offset;~size := #in~size;~value := #in~value;havoc ~i~0;~i~0 := 0; {23010#true} is VALID [2018-11-18 23:03:07,975 INFO L273 TraceCheckUtils]: 27: Hoare triple {23010#true} assume true; {23010#true} is VALID [2018-11-18 23:03:07,976 INFO L273 TraceCheckUtils]: 28: Hoare triple {23010#true} assume !!(~i~0 < ~size);call #t~mem1 := read~int(~set.base, ~set.offset + 4 * ~i~0, 4); {23010#true} is VALID [2018-11-18 23:03:07,976 INFO L273 TraceCheckUtils]: 29: Hoare triple {23010#true} assume #t~mem1 == ~value;havoc #t~mem1;#res := 1; {23010#true} is VALID [2018-11-18 23:03:07,976 INFO L273 TraceCheckUtils]: 30: Hoare triple {23010#true} assume true; {23010#true} is VALID [2018-11-18 23:03:07,977 INFO L268 TraceCheckUtils]: 31: Hoare quadruple {23010#true} {23014#(<= (+ main_~v~0 99999) ~SIZE~0)} #132#return; {23014#(<= (+ main_~v~0 99999) ~SIZE~0)} is VALID [2018-11-18 23:03:07,978 INFO L273 TraceCheckUtils]: 32: Hoare triple {23014#(<= (+ main_~v~0 99999) ~SIZE~0)} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {23014#(<= (+ main_~v~0 99999) ~SIZE~0)} is VALID [2018-11-18 23:03:07,978 INFO L273 TraceCheckUtils]: 33: Hoare triple {23014#(<= (+ main_~v~0 99999) ~SIZE~0)} assume !(1 != #t~ret4);havoc #t~mem3;havoc #t~ret4; {23014#(<= (+ main_~v~0 99999) ~SIZE~0)} is VALID [2018-11-18 23:03:07,979 INFO L273 TraceCheckUtils]: 34: Hoare triple {23014#(<= (+ main_~v~0 99999) ~SIZE~0)} #t~post2 := ~v~0;~v~0 := 1 + #t~post2;havoc #t~post2; {23015#(<= (+ main_~v~0 99998) ~SIZE~0)} is VALID [2018-11-18 23:03:07,979 INFO L273 TraceCheckUtils]: 35: Hoare triple {23015#(<= (+ main_~v~0 99998) ~SIZE~0)} assume true; {23015#(<= (+ main_~v~0 99998) ~SIZE~0)} is VALID [2018-11-18 23:03:07,980 INFO L273 TraceCheckUtils]: 36: Hoare triple {23015#(<= (+ main_~v~0 99998) ~SIZE~0)} assume !!(~v~0 < ~SIZE~0);call #t~mem3 := read~int(~#values~0.base, ~#values~0.offset + 4 * ~v~0, 4); {23015#(<= (+ main_~v~0 99998) ~SIZE~0)} is VALID [2018-11-18 23:03:07,980 INFO L256 TraceCheckUtils]: 37: Hoare triple {23015#(<= (+ main_~v~0 99998) ~SIZE~0)} call #t~ret4 := elem_exists(~#set~0.base, ~#set~0.offset, ~n~0, #t~mem3); {23010#true} is VALID [2018-11-18 23:03:07,980 INFO L273 TraceCheckUtils]: 38: Hoare triple {23010#true} ~set.base, ~set.offset := #in~set.base, #in~set.offset;~size := #in~size;~value := #in~value;havoc ~i~0;~i~0 := 0; {23010#true} is VALID [2018-11-18 23:03:07,980 INFO L273 TraceCheckUtils]: 39: Hoare triple {23010#true} assume true; {23010#true} is VALID [2018-11-18 23:03:07,980 INFO L273 TraceCheckUtils]: 40: Hoare triple {23010#true} assume !!(~i~0 < ~size);call #t~mem1 := read~int(~set.base, ~set.offset + 4 * ~i~0, 4); {23010#true} is VALID [2018-11-18 23:03:07,980 INFO L273 TraceCheckUtils]: 41: Hoare triple {23010#true} assume #t~mem1 == ~value;havoc #t~mem1;#res := 1; {23010#true} is VALID [2018-11-18 23:03:07,980 INFO L273 TraceCheckUtils]: 42: Hoare triple {23010#true} assume true; {23010#true} is VALID [2018-11-18 23:03:07,981 INFO L268 TraceCheckUtils]: 43: Hoare quadruple {23010#true} {23015#(<= (+ main_~v~0 99998) ~SIZE~0)} #132#return; {23015#(<= (+ main_~v~0 99998) ~SIZE~0)} is VALID [2018-11-18 23:03:07,981 INFO L273 TraceCheckUtils]: 44: Hoare triple {23015#(<= (+ main_~v~0 99998) ~SIZE~0)} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {23015#(<= (+ main_~v~0 99998) ~SIZE~0)} is VALID [2018-11-18 23:03:07,982 INFO L273 TraceCheckUtils]: 45: Hoare triple {23015#(<= (+ main_~v~0 99998) ~SIZE~0)} assume !(1 != #t~ret4);havoc #t~mem3;havoc #t~ret4; {23015#(<= (+ main_~v~0 99998) ~SIZE~0)} is VALID [2018-11-18 23:03:07,982 INFO L273 TraceCheckUtils]: 46: Hoare triple {23015#(<= (+ main_~v~0 99998) ~SIZE~0)} #t~post2 := ~v~0;~v~0 := 1 + #t~post2;havoc #t~post2; {23016#(<= (+ main_~v~0 99997) ~SIZE~0)} is VALID [2018-11-18 23:03:07,983 INFO L273 TraceCheckUtils]: 47: Hoare triple {23016#(<= (+ main_~v~0 99997) ~SIZE~0)} assume true; {23016#(<= (+ main_~v~0 99997) ~SIZE~0)} is VALID [2018-11-18 23:03:07,983 INFO L273 TraceCheckUtils]: 48: Hoare triple {23016#(<= (+ main_~v~0 99997) ~SIZE~0)} assume !!(~v~0 < ~SIZE~0);call #t~mem3 := read~int(~#values~0.base, ~#values~0.offset + 4 * ~v~0, 4); {23016#(<= (+ main_~v~0 99997) ~SIZE~0)} is VALID [2018-11-18 23:03:07,984 INFO L256 TraceCheckUtils]: 49: Hoare triple {23016#(<= (+ main_~v~0 99997) ~SIZE~0)} call #t~ret4 := elem_exists(~#set~0.base, ~#set~0.offset, ~n~0, #t~mem3); {23010#true} is VALID [2018-11-18 23:03:07,984 INFO L273 TraceCheckUtils]: 50: Hoare triple {23010#true} ~set.base, ~set.offset := #in~set.base, #in~set.offset;~size := #in~size;~value := #in~value;havoc ~i~0;~i~0 := 0; {23010#true} is VALID [2018-11-18 23:03:07,984 INFO L273 TraceCheckUtils]: 51: Hoare triple {23010#true} assume true; {23010#true} is VALID [2018-11-18 23:03:07,984 INFO L273 TraceCheckUtils]: 52: Hoare triple {23010#true} assume !!(~i~0 < ~size);call #t~mem1 := read~int(~set.base, ~set.offset + 4 * ~i~0, 4); {23010#true} is VALID [2018-11-18 23:03:07,984 INFO L273 TraceCheckUtils]: 53: Hoare triple {23010#true} assume #t~mem1 == ~value;havoc #t~mem1;#res := 1; {23010#true} is VALID [2018-11-18 23:03:07,985 INFO L273 TraceCheckUtils]: 54: Hoare triple {23010#true} assume true; {23010#true} is VALID [2018-11-18 23:03:07,986 INFO L268 TraceCheckUtils]: 55: Hoare quadruple {23010#true} {23016#(<= (+ main_~v~0 99997) ~SIZE~0)} #132#return; {23016#(<= (+ main_~v~0 99997) ~SIZE~0)} is VALID [2018-11-18 23:03:07,986 INFO L273 TraceCheckUtils]: 56: Hoare triple {23016#(<= (+ main_~v~0 99997) ~SIZE~0)} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {23016#(<= (+ main_~v~0 99997) ~SIZE~0)} is VALID [2018-11-18 23:03:07,987 INFO L273 TraceCheckUtils]: 57: Hoare triple {23016#(<= (+ main_~v~0 99997) ~SIZE~0)} assume !(1 != #t~ret4);havoc #t~mem3;havoc #t~ret4; {23016#(<= (+ main_~v~0 99997) ~SIZE~0)} is VALID [2018-11-18 23:03:07,987 INFO L273 TraceCheckUtils]: 58: Hoare triple {23016#(<= (+ main_~v~0 99997) ~SIZE~0)} #t~post2 := ~v~0;~v~0 := 1 + #t~post2;havoc #t~post2; {23017#(<= (+ main_~v~0 99996) ~SIZE~0)} is VALID [2018-11-18 23:03:07,987 INFO L273 TraceCheckUtils]: 59: Hoare triple {23017#(<= (+ main_~v~0 99996) ~SIZE~0)} assume true; {23017#(<= (+ main_~v~0 99996) ~SIZE~0)} is VALID [2018-11-18 23:03:07,988 INFO L273 TraceCheckUtils]: 60: Hoare triple {23017#(<= (+ main_~v~0 99996) ~SIZE~0)} assume !!(~v~0 < ~SIZE~0);call #t~mem3 := read~int(~#values~0.base, ~#values~0.offset + 4 * ~v~0, 4); {23017#(<= (+ main_~v~0 99996) ~SIZE~0)} is VALID [2018-11-18 23:03:07,988 INFO L256 TraceCheckUtils]: 61: Hoare triple {23017#(<= (+ main_~v~0 99996) ~SIZE~0)} call #t~ret4 := elem_exists(~#set~0.base, ~#set~0.offset, ~n~0, #t~mem3); {23010#true} is VALID [2018-11-18 23:03:07,988 INFO L273 TraceCheckUtils]: 62: Hoare triple {23010#true} ~set.base, ~set.offset := #in~set.base, #in~set.offset;~size := #in~size;~value := #in~value;havoc ~i~0;~i~0 := 0; {23010#true} is VALID [2018-11-18 23:03:07,988 INFO L273 TraceCheckUtils]: 63: Hoare triple {23010#true} assume true; {23010#true} is VALID [2018-11-18 23:03:07,988 INFO L273 TraceCheckUtils]: 64: Hoare triple {23010#true} assume !!(~i~0 < ~size);call #t~mem1 := read~int(~set.base, ~set.offset + 4 * ~i~0, 4); {23010#true} is VALID [2018-11-18 23:03:07,988 INFO L273 TraceCheckUtils]: 65: Hoare triple {23010#true} assume #t~mem1 == ~value;havoc #t~mem1;#res := 1; {23010#true} is VALID [2018-11-18 23:03:07,988 INFO L273 TraceCheckUtils]: 66: Hoare triple {23010#true} assume true; {23010#true} is VALID [2018-11-18 23:03:07,990 INFO L268 TraceCheckUtils]: 67: Hoare quadruple {23010#true} {23017#(<= (+ main_~v~0 99996) ~SIZE~0)} #132#return; {23017#(<= (+ main_~v~0 99996) ~SIZE~0)} is VALID [2018-11-18 23:03:07,990 INFO L273 TraceCheckUtils]: 68: Hoare triple {23017#(<= (+ main_~v~0 99996) ~SIZE~0)} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {23017#(<= (+ main_~v~0 99996) ~SIZE~0)} is VALID [2018-11-18 23:03:07,990 INFO L273 TraceCheckUtils]: 69: Hoare triple {23017#(<= (+ main_~v~0 99996) ~SIZE~0)} assume !(1 != #t~ret4);havoc #t~mem3;havoc #t~ret4; {23017#(<= (+ main_~v~0 99996) ~SIZE~0)} is VALID [2018-11-18 23:03:07,991 INFO L273 TraceCheckUtils]: 70: Hoare triple {23017#(<= (+ main_~v~0 99996) ~SIZE~0)} #t~post2 := ~v~0;~v~0 := 1 + #t~post2;havoc #t~post2; {23018#(<= (+ main_~v~0 99995) ~SIZE~0)} is VALID [2018-11-18 23:03:07,991 INFO L273 TraceCheckUtils]: 71: Hoare triple {23018#(<= (+ main_~v~0 99995) ~SIZE~0)} assume true; {23018#(<= (+ main_~v~0 99995) ~SIZE~0)} is VALID [2018-11-18 23:03:07,991 INFO L273 TraceCheckUtils]: 72: Hoare triple {23018#(<= (+ main_~v~0 99995) ~SIZE~0)} assume !!(~v~0 < ~SIZE~0);call #t~mem3 := read~int(~#values~0.base, ~#values~0.offset + 4 * ~v~0, 4); {23018#(<= (+ main_~v~0 99995) ~SIZE~0)} is VALID [2018-11-18 23:03:07,991 INFO L256 TraceCheckUtils]: 73: Hoare triple {23018#(<= (+ main_~v~0 99995) ~SIZE~0)} call #t~ret4 := elem_exists(~#set~0.base, ~#set~0.offset, ~n~0, #t~mem3); {23010#true} is VALID [2018-11-18 23:03:07,992 INFO L273 TraceCheckUtils]: 74: Hoare triple {23010#true} ~set.base, ~set.offset := #in~set.base, #in~set.offset;~size := #in~size;~value := #in~value;havoc ~i~0;~i~0 := 0; {23010#true} is VALID [2018-11-18 23:03:07,992 INFO L273 TraceCheckUtils]: 75: Hoare triple {23010#true} assume true; {23010#true} is VALID [2018-11-18 23:03:07,992 INFO L273 TraceCheckUtils]: 76: Hoare triple {23010#true} assume !!(~i~0 < ~size);call #t~mem1 := read~int(~set.base, ~set.offset + 4 * ~i~0, 4); {23010#true} is VALID [2018-11-18 23:03:07,992 INFO L273 TraceCheckUtils]: 77: Hoare triple {23010#true} assume #t~mem1 == ~value;havoc #t~mem1;#res := 1; {23010#true} is VALID [2018-11-18 23:03:07,992 INFO L273 TraceCheckUtils]: 78: Hoare triple {23010#true} assume true; {23010#true} is VALID [2018-11-18 23:03:07,993 INFO L268 TraceCheckUtils]: 79: Hoare quadruple {23010#true} {23018#(<= (+ main_~v~0 99995) ~SIZE~0)} #132#return; {23018#(<= (+ main_~v~0 99995) ~SIZE~0)} is VALID [2018-11-18 23:03:07,993 INFO L273 TraceCheckUtils]: 80: Hoare triple {23018#(<= (+ main_~v~0 99995) ~SIZE~0)} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {23018#(<= (+ main_~v~0 99995) ~SIZE~0)} is VALID [2018-11-18 23:03:07,994 INFO L273 TraceCheckUtils]: 81: Hoare triple {23018#(<= (+ main_~v~0 99995) ~SIZE~0)} assume !(1 != #t~ret4);havoc #t~mem3;havoc #t~ret4; {23018#(<= (+ main_~v~0 99995) ~SIZE~0)} is VALID [2018-11-18 23:03:07,995 INFO L273 TraceCheckUtils]: 82: Hoare triple {23018#(<= (+ main_~v~0 99995) ~SIZE~0)} #t~post2 := ~v~0;~v~0 := 1 + #t~post2;havoc #t~post2; {23019#(<= (+ main_~v~0 99994) ~SIZE~0)} is VALID [2018-11-18 23:03:07,995 INFO L273 TraceCheckUtils]: 83: Hoare triple {23019#(<= (+ main_~v~0 99994) ~SIZE~0)} assume true; {23019#(<= (+ main_~v~0 99994) ~SIZE~0)} is VALID [2018-11-18 23:03:07,996 INFO L273 TraceCheckUtils]: 84: Hoare triple {23019#(<= (+ main_~v~0 99994) ~SIZE~0)} assume !!(~v~0 < ~SIZE~0);call #t~mem3 := read~int(~#values~0.base, ~#values~0.offset + 4 * ~v~0, 4); {23019#(<= (+ main_~v~0 99994) ~SIZE~0)} is VALID [2018-11-18 23:03:07,996 INFO L256 TraceCheckUtils]: 85: Hoare triple {23019#(<= (+ main_~v~0 99994) ~SIZE~0)} call #t~ret4 := elem_exists(~#set~0.base, ~#set~0.offset, ~n~0, #t~mem3); {23010#true} is VALID [2018-11-18 23:03:07,996 INFO L273 TraceCheckUtils]: 86: Hoare triple {23010#true} ~set.base, ~set.offset := #in~set.base, #in~set.offset;~size := #in~size;~value := #in~value;havoc ~i~0;~i~0 := 0; {23010#true} is VALID [2018-11-18 23:03:07,996 INFO L273 TraceCheckUtils]: 87: Hoare triple {23010#true} assume true; {23010#true} is VALID [2018-11-18 23:03:07,996 INFO L273 TraceCheckUtils]: 88: Hoare triple {23010#true} assume !!(~i~0 < ~size);call #t~mem1 := read~int(~set.base, ~set.offset + 4 * ~i~0, 4); {23010#true} is VALID [2018-11-18 23:03:07,997 INFO L273 TraceCheckUtils]: 89: Hoare triple {23010#true} assume #t~mem1 == ~value;havoc #t~mem1;#res := 1; {23010#true} is VALID [2018-11-18 23:03:07,997 INFO L273 TraceCheckUtils]: 90: Hoare triple {23010#true} assume true; {23010#true} is VALID [2018-11-18 23:03:07,998 INFO L268 TraceCheckUtils]: 91: Hoare quadruple {23010#true} {23019#(<= (+ main_~v~0 99994) ~SIZE~0)} #132#return; {23019#(<= (+ main_~v~0 99994) ~SIZE~0)} is VALID [2018-11-18 23:03:07,999 INFO L273 TraceCheckUtils]: 92: Hoare triple {23019#(<= (+ main_~v~0 99994) ~SIZE~0)} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {23019#(<= (+ main_~v~0 99994) ~SIZE~0)} is VALID [2018-11-18 23:03:07,999 INFO L273 TraceCheckUtils]: 93: Hoare triple {23019#(<= (+ main_~v~0 99994) ~SIZE~0)} assume !(1 != #t~ret4);havoc #t~mem3;havoc #t~ret4; {23019#(<= (+ main_~v~0 99994) ~SIZE~0)} is VALID [2018-11-18 23:03:07,999 INFO L273 TraceCheckUtils]: 94: Hoare triple {23019#(<= (+ main_~v~0 99994) ~SIZE~0)} #t~post2 := ~v~0;~v~0 := 1 + #t~post2;havoc #t~post2; {23020#(<= (+ main_~v~0 99993) ~SIZE~0)} is VALID [2018-11-18 23:03:08,000 INFO L273 TraceCheckUtils]: 95: Hoare triple {23020#(<= (+ main_~v~0 99993) ~SIZE~0)} assume true; {23020#(<= (+ main_~v~0 99993) ~SIZE~0)} is VALID [2018-11-18 23:03:08,000 INFO L273 TraceCheckUtils]: 96: Hoare triple {23020#(<= (+ main_~v~0 99993) ~SIZE~0)} assume !!(~v~0 < ~SIZE~0);call #t~mem3 := read~int(~#values~0.base, ~#values~0.offset + 4 * ~v~0, 4); {23020#(<= (+ main_~v~0 99993) ~SIZE~0)} is VALID [2018-11-18 23:03:08,000 INFO L256 TraceCheckUtils]: 97: Hoare triple {23020#(<= (+ main_~v~0 99993) ~SIZE~0)} call #t~ret4 := elem_exists(~#set~0.base, ~#set~0.offset, ~n~0, #t~mem3); {23010#true} is VALID [2018-11-18 23:03:08,000 INFO L273 TraceCheckUtils]: 98: Hoare triple {23010#true} ~set.base, ~set.offset := #in~set.base, #in~set.offset;~size := #in~size;~value := #in~value;havoc ~i~0;~i~0 := 0; {23010#true} is VALID [2018-11-18 23:03:08,000 INFO L273 TraceCheckUtils]: 99: Hoare triple {23010#true} assume true; {23010#true} is VALID [2018-11-18 23:03:08,000 INFO L273 TraceCheckUtils]: 100: Hoare triple {23010#true} assume !!(~i~0 < ~size);call #t~mem1 := read~int(~set.base, ~set.offset + 4 * ~i~0, 4); {23010#true} is VALID [2018-11-18 23:03:08,001 INFO L273 TraceCheckUtils]: 101: Hoare triple {23010#true} assume #t~mem1 == ~value;havoc #t~mem1;#res := 1; {23010#true} is VALID [2018-11-18 23:03:08,001 INFO L273 TraceCheckUtils]: 102: Hoare triple {23010#true} assume true; {23010#true} is VALID [2018-11-18 23:03:08,002 INFO L268 TraceCheckUtils]: 103: Hoare quadruple {23010#true} {23020#(<= (+ main_~v~0 99993) ~SIZE~0)} #132#return; {23020#(<= (+ main_~v~0 99993) ~SIZE~0)} is VALID [2018-11-18 23:03:08,002 INFO L273 TraceCheckUtils]: 104: Hoare triple {23020#(<= (+ main_~v~0 99993) ~SIZE~0)} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {23020#(<= (+ main_~v~0 99993) ~SIZE~0)} is VALID [2018-11-18 23:03:08,003 INFO L273 TraceCheckUtils]: 105: Hoare triple {23020#(<= (+ main_~v~0 99993) ~SIZE~0)} assume !(1 != #t~ret4);havoc #t~mem3;havoc #t~ret4; {23020#(<= (+ main_~v~0 99993) ~SIZE~0)} is VALID [2018-11-18 23:03:08,004 INFO L273 TraceCheckUtils]: 106: Hoare triple {23020#(<= (+ main_~v~0 99993) ~SIZE~0)} #t~post2 := ~v~0;~v~0 := 1 + #t~post2;havoc #t~post2; {23021#(<= (+ main_~v~0 99992) ~SIZE~0)} is VALID [2018-11-18 23:03:08,004 INFO L273 TraceCheckUtils]: 107: Hoare triple {23021#(<= (+ main_~v~0 99992) ~SIZE~0)} assume true; {23021#(<= (+ main_~v~0 99992) ~SIZE~0)} is VALID [2018-11-18 23:03:08,005 INFO L273 TraceCheckUtils]: 108: Hoare triple {23021#(<= (+ main_~v~0 99992) ~SIZE~0)} assume !!(~v~0 < ~SIZE~0);call #t~mem3 := read~int(~#values~0.base, ~#values~0.offset + 4 * ~v~0, 4); {23021#(<= (+ main_~v~0 99992) ~SIZE~0)} is VALID [2018-11-18 23:03:08,005 INFO L256 TraceCheckUtils]: 109: Hoare triple {23021#(<= (+ main_~v~0 99992) ~SIZE~0)} call #t~ret4 := elem_exists(~#set~0.base, ~#set~0.offset, ~n~0, #t~mem3); {23010#true} is VALID [2018-11-18 23:03:08,005 INFO L273 TraceCheckUtils]: 110: Hoare triple {23010#true} ~set.base, ~set.offset := #in~set.base, #in~set.offset;~size := #in~size;~value := #in~value;havoc ~i~0;~i~0 := 0; {23010#true} is VALID [2018-11-18 23:03:08,005 INFO L273 TraceCheckUtils]: 111: Hoare triple {23010#true} assume true; {23010#true} is VALID [2018-11-18 23:03:08,006 INFO L273 TraceCheckUtils]: 112: Hoare triple {23010#true} assume !!(~i~0 < ~size);call #t~mem1 := read~int(~set.base, ~set.offset + 4 * ~i~0, 4); {23010#true} is VALID [2018-11-18 23:03:08,006 INFO L273 TraceCheckUtils]: 113: Hoare triple {23010#true} assume #t~mem1 == ~value;havoc #t~mem1;#res := 1; {23010#true} is VALID [2018-11-18 23:03:08,006 INFO L273 TraceCheckUtils]: 114: Hoare triple {23010#true} assume true; {23010#true} is VALID [2018-11-18 23:03:08,007 INFO L268 TraceCheckUtils]: 115: Hoare quadruple {23010#true} {23021#(<= (+ main_~v~0 99992) ~SIZE~0)} #132#return; {23021#(<= (+ main_~v~0 99992) ~SIZE~0)} is VALID [2018-11-18 23:03:08,008 INFO L273 TraceCheckUtils]: 116: Hoare triple {23021#(<= (+ main_~v~0 99992) ~SIZE~0)} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {23021#(<= (+ main_~v~0 99992) ~SIZE~0)} is VALID [2018-11-18 23:03:08,008 INFO L273 TraceCheckUtils]: 117: Hoare triple {23021#(<= (+ main_~v~0 99992) ~SIZE~0)} assume !(1 != #t~ret4);havoc #t~mem3;havoc #t~ret4; {23021#(<= (+ main_~v~0 99992) ~SIZE~0)} is VALID [2018-11-18 23:03:08,009 INFO L273 TraceCheckUtils]: 118: Hoare triple {23021#(<= (+ main_~v~0 99992) ~SIZE~0)} #t~post2 := ~v~0;~v~0 := 1 + #t~post2;havoc #t~post2; {23022#(<= (+ main_~v~0 99991) ~SIZE~0)} is VALID [2018-11-18 23:03:08,009 INFO L273 TraceCheckUtils]: 119: Hoare triple {23022#(<= (+ main_~v~0 99991) ~SIZE~0)} assume true; {23022#(<= (+ main_~v~0 99991) ~SIZE~0)} is VALID [2018-11-18 23:03:08,010 INFO L273 TraceCheckUtils]: 120: Hoare triple {23022#(<= (+ main_~v~0 99991) ~SIZE~0)} assume !!(~v~0 < ~SIZE~0);call #t~mem3 := read~int(~#values~0.base, ~#values~0.offset + 4 * ~v~0, 4); {23022#(<= (+ main_~v~0 99991) ~SIZE~0)} is VALID [2018-11-18 23:03:08,010 INFO L256 TraceCheckUtils]: 121: Hoare triple {23022#(<= (+ main_~v~0 99991) ~SIZE~0)} call #t~ret4 := elem_exists(~#set~0.base, ~#set~0.offset, ~n~0, #t~mem3); {23010#true} is VALID [2018-11-18 23:03:08,010 INFO L273 TraceCheckUtils]: 122: Hoare triple {23010#true} ~set.base, ~set.offset := #in~set.base, #in~set.offset;~size := #in~size;~value := #in~value;havoc ~i~0;~i~0 := 0; {23010#true} is VALID [2018-11-18 23:03:08,011 INFO L273 TraceCheckUtils]: 123: Hoare triple {23010#true} assume true; {23010#true} is VALID [2018-11-18 23:03:08,011 INFO L273 TraceCheckUtils]: 124: Hoare triple {23010#true} assume !!(~i~0 < ~size);call #t~mem1 := read~int(~set.base, ~set.offset + 4 * ~i~0, 4); {23010#true} is VALID [2018-11-18 23:03:08,011 INFO L273 TraceCheckUtils]: 125: Hoare triple {23010#true} assume #t~mem1 == ~value;havoc #t~mem1;#res := 1; {23010#true} is VALID [2018-11-18 23:03:08,011 INFO L273 TraceCheckUtils]: 126: Hoare triple {23010#true} assume true; {23010#true} is VALID [2018-11-18 23:03:08,012 INFO L268 TraceCheckUtils]: 127: Hoare quadruple {23010#true} {23022#(<= (+ main_~v~0 99991) ~SIZE~0)} #132#return; {23022#(<= (+ main_~v~0 99991) ~SIZE~0)} is VALID [2018-11-18 23:03:08,013 INFO L273 TraceCheckUtils]: 128: Hoare triple {23022#(<= (+ main_~v~0 99991) ~SIZE~0)} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {23022#(<= (+ main_~v~0 99991) ~SIZE~0)} is VALID [2018-11-18 23:03:08,013 INFO L273 TraceCheckUtils]: 129: Hoare triple {23022#(<= (+ main_~v~0 99991) ~SIZE~0)} assume !(1 != #t~ret4);havoc #t~mem3;havoc #t~ret4; {23022#(<= (+ main_~v~0 99991) ~SIZE~0)} is VALID [2018-11-18 23:03:08,014 INFO L273 TraceCheckUtils]: 130: Hoare triple {23022#(<= (+ main_~v~0 99991) ~SIZE~0)} #t~post2 := ~v~0;~v~0 := 1 + #t~post2;havoc #t~post2; {23023#(<= (+ main_~v~0 99990) ~SIZE~0)} is VALID [2018-11-18 23:03:08,015 INFO L273 TraceCheckUtils]: 131: Hoare triple {23023#(<= (+ main_~v~0 99990) ~SIZE~0)} assume true; {23023#(<= (+ main_~v~0 99990) ~SIZE~0)} is VALID [2018-11-18 23:03:08,015 INFO L273 TraceCheckUtils]: 132: Hoare triple {23023#(<= (+ main_~v~0 99990) ~SIZE~0)} assume !!(~v~0 < ~SIZE~0);call #t~mem3 := read~int(~#values~0.base, ~#values~0.offset + 4 * ~v~0, 4); {23023#(<= (+ main_~v~0 99990) ~SIZE~0)} is VALID [2018-11-18 23:03:08,015 INFO L256 TraceCheckUtils]: 133: Hoare triple {23023#(<= (+ main_~v~0 99990) ~SIZE~0)} call #t~ret4 := elem_exists(~#set~0.base, ~#set~0.offset, ~n~0, #t~mem3); {23010#true} is VALID [2018-11-18 23:03:08,016 INFO L273 TraceCheckUtils]: 134: Hoare triple {23010#true} ~set.base, ~set.offset := #in~set.base, #in~set.offset;~size := #in~size;~value := #in~value;havoc ~i~0;~i~0 := 0; {23010#true} is VALID [2018-11-18 23:03:08,016 INFO L273 TraceCheckUtils]: 135: Hoare triple {23010#true} assume true; {23010#true} is VALID [2018-11-18 23:03:08,016 INFO L273 TraceCheckUtils]: 136: Hoare triple {23010#true} assume !!(~i~0 < ~size);call #t~mem1 := read~int(~set.base, ~set.offset + 4 * ~i~0, 4); {23010#true} is VALID [2018-11-18 23:03:08,016 INFO L273 TraceCheckUtils]: 137: Hoare triple {23010#true} assume #t~mem1 == ~value;havoc #t~mem1;#res := 1; {23010#true} is VALID [2018-11-18 23:03:08,016 INFO L273 TraceCheckUtils]: 138: Hoare triple {23010#true} assume true; {23010#true} is VALID [2018-11-18 23:03:08,017 INFO L268 TraceCheckUtils]: 139: Hoare quadruple {23010#true} {23023#(<= (+ main_~v~0 99990) ~SIZE~0)} #132#return; {23023#(<= (+ main_~v~0 99990) ~SIZE~0)} is VALID [2018-11-18 23:03:08,018 INFO L273 TraceCheckUtils]: 140: Hoare triple {23023#(<= (+ main_~v~0 99990) ~SIZE~0)} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {23023#(<= (+ main_~v~0 99990) ~SIZE~0)} is VALID [2018-11-18 23:03:08,018 INFO L273 TraceCheckUtils]: 141: Hoare triple {23023#(<= (+ main_~v~0 99990) ~SIZE~0)} assume !(1 != #t~ret4);havoc #t~mem3;havoc #t~ret4; {23023#(<= (+ main_~v~0 99990) ~SIZE~0)} is VALID [2018-11-18 23:03:08,019 INFO L273 TraceCheckUtils]: 142: Hoare triple {23023#(<= (+ main_~v~0 99990) ~SIZE~0)} #t~post2 := ~v~0;~v~0 := 1 + #t~post2;havoc #t~post2; {23024#(<= (+ main_~v~0 99989) ~SIZE~0)} is VALID [2018-11-18 23:03:08,020 INFO L273 TraceCheckUtils]: 143: Hoare triple {23024#(<= (+ main_~v~0 99989) ~SIZE~0)} assume true; {23024#(<= (+ main_~v~0 99989) ~SIZE~0)} is VALID [2018-11-18 23:03:08,020 INFO L273 TraceCheckUtils]: 144: Hoare triple {23024#(<= (+ main_~v~0 99989) ~SIZE~0)} assume !!(~v~0 < ~SIZE~0);call #t~mem3 := read~int(~#values~0.base, ~#values~0.offset + 4 * ~v~0, 4); {23024#(<= (+ main_~v~0 99989) ~SIZE~0)} is VALID [2018-11-18 23:03:08,021 INFO L256 TraceCheckUtils]: 145: Hoare triple {23024#(<= (+ main_~v~0 99989) ~SIZE~0)} call #t~ret4 := elem_exists(~#set~0.base, ~#set~0.offset, ~n~0, #t~mem3); {23010#true} is VALID [2018-11-18 23:03:08,021 INFO L273 TraceCheckUtils]: 146: Hoare triple {23010#true} ~set.base, ~set.offset := #in~set.base, #in~set.offset;~size := #in~size;~value := #in~value;havoc ~i~0;~i~0 := 0; {23010#true} is VALID [2018-11-18 23:03:08,021 INFO L273 TraceCheckUtils]: 147: Hoare triple {23010#true} assume true; {23010#true} is VALID [2018-11-18 23:03:08,021 INFO L273 TraceCheckUtils]: 148: Hoare triple {23010#true} assume !!(~i~0 < ~size);call #t~mem1 := read~int(~set.base, ~set.offset + 4 * ~i~0, 4); {23010#true} is VALID [2018-11-18 23:03:08,021 INFO L273 TraceCheckUtils]: 149: Hoare triple {23010#true} assume #t~mem1 == ~value;havoc #t~mem1;#res := 1; {23010#true} is VALID [2018-11-18 23:03:08,022 INFO L273 TraceCheckUtils]: 150: Hoare triple {23010#true} assume true; {23010#true} is VALID [2018-11-18 23:03:08,023 INFO L268 TraceCheckUtils]: 151: Hoare quadruple {23010#true} {23024#(<= (+ main_~v~0 99989) ~SIZE~0)} #132#return; {23024#(<= (+ main_~v~0 99989) ~SIZE~0)} is VALID [2018-11-18 23:03:08,023 INFO L273 TraceCheckUtils]: 152: Hoare triple {23024#(<= (+ main_~v~0 99989) ~SIZE~0)} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {23024#(<= (+ main_~v~0 99989) ~SIZE~0)} is VALID [2018-11-18 23:03:08,024 INFO L273 TraceCheckUtils]: 153: Hoare triple {23024#(<= (+ main_~v~0 99989) ~SIZE~0)} assume !(1 != #t~ret4);havoc #t~mem3;havoc #t~ret4; {23024#(<= (+ main_~v~0 99989) ~SIZE~0)} is VALID [2018-11-18 23:03:08,024 INFO L273 TraceCheckUtils]: 154: Hoare triple {23024#(<= (+ main_~v~0 99989) ~SIZE~0)} #t~post2 := ~v~0;~v~0 := 1 + #t~post2;havoc #t~post2; {23025#(<= (+ main_~v~0 99988) ~SIZE~0)} is VALID [2018-11-18 23:03:08,024 INFO L273 TraceCheckUtils]: 155: Hoare triple {23025#(<= (+ main_~v~0 99988) ~SIZE~0)} assume true; {23025#(<= (+ main_~v~0 99988) ~SIZE~0)} is VALID [2018-11-18 23:03:08,025 INFO L273 TraceCheckUtils]: 156: Hoare triple {23025#(<= (+ main_~v~0 99988) ~SIZE~0)} assume !!(~v~0 < ~SIZE~0);call #t~mem3 := read~int(~#values~0.base, ~#values~0.offset + 4 * ~v~0, 4); {23025#(<= (+ main_~v~0 99988) ~SIZE~0)} is VALID [2018-11-18 23:03:08,025 INFO L256 TraceCheckUtils]: 157: Hoare triple {23025#(<= (+ main_~v~0 99988) ~SIZE~0)} call #t~ret4 := elem_exists(~#set~0.base, ~#set~0.offset, ~n~0, #t~mem3); {23010#true} is VALID [2018-11-18 23:03:08,025 INFO L273 TraceCheckUtils]: 158: Hoare triple {23010#true} ~set.base, ~set.offset := #in~set.base, #in~set.offset;~size := #in~size;~value := #in~value;havoc ~i~0;~i~0 := 0; {23010#true} is VALID [2018-11-18 23:03:08,025 INFO L273 TraceCheckUtils]: 159: Hoare triple {23010#true} assume true; {23010#true} is VALID [2018-11-18 23:03:08,025 INFO L273 TraceCheckUtils]: 160: Hoare triple {23010#true} assume !!(~i~0 < ~size);call #t~mem1 := read~int(~set.base, ~set.offset + 4 * ~i~0, 4); {23010#true} is VALID [2018-11-18 23:03:08,025 INFO L273 TraceCheckUtils]: 161: Hoare triple {23010#true} assume #t~mem1 == ~value;havoc #t~mem1;#res := 1; {23010#true} is VALID [2018-11-18 23:03:08,025 INFO L273 TraceCheckUtils]: 162: Hoare triple {23010#true} assume true; {23010#true} is VALID [2018-11-18 23:03:08,027 INFO L268 TraceCheckUtils]: 163: Hoare quadruple {23010#true} {23025#(<= (+ main_~v~0 99988) ~SIZE~0)} #132#return; {23025#(<= (+ main_~v~0 99988) ~SIZE~0)} is VALID [2018-11-18 23:03:08,027 INFO L273 TraceCheckUtils]: 164: Hoare triple {23025#(<= (+ main_~v~0 99988) ~SIZE~0)} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {23025#(<= (+ main_~v~0 99988) ~SIZE~0)} is VALID [2018-11-18 23:03:08,028 INFO L273 TraceCheckUtils]: 165: Hoare triple {23025#(<= (+ main_~v~0 99988) ~SIZE~0)} assume !(1 != #t~ret4);havoc #t~mem3;havoc #t~ret4; {23025#(<= (+ main_~v~0 99988) ~SIZE~0)} is VALID [2018-11-18 23:03:08,028 INFO L273 TraceCheckUtils]: 166: Hoare triple {23025#(<= (+ main_~v~0 99988) ~SIZE~0)} #t~post2 := ~v~0;~v~0 := 1 + #t~post2;havoc #t~post2; {23026#(<= (+ main_~v~0 99987) ~SIZE~0)} is VALID [2018-11-18 23:03:08,028 INFO L273 TraceCheckUtils]: 167: Hoare triple {23026#(<= (+ main_~v~0 99987) ~SIZE~0)} assume true; {23026#(<= (+ main_~v~0 99987) ~SIZE~0)} is VALID [2018-11-18 23:03:08,029 INFO L273 TraceCheckUtils]: 168: Hoare triple {23026#(<= (+ main_~v~0 99987) ~SIZE~0)} assume !!(~v~0 < ~SIZE~0);call #t~mem3 := read~int(~#values~0.base, ~#values~0.offset + 4 * ~v~0, 4); {23026#(<= (+ main_~v~0 99987) ~SIZE~0)} is VALID [2018-11-18 23:03:08,029 INFO L256 TraceCheckUtils]: 169: Hoare triple {23026#(<= (+ main_~v~0 99987) ~SIZE~0)} call #t~ret4 := elem_exists(~#set~0.base, ~#set~0.offset, ~n~0, #t~mem3); {23010#true} is VALID [2018-11-18 23:03:08,029 INFO L273 TraceCheckUtils]: 170: Hoare triple {23010#true} ~set.base, ~set.offset := #in~set.base, #in~set.offset;~size := #in~size;~value := #in~value;havoc ~i~0;~i~0 := 0; {23010#true} is VALID [2018-11-18 23:03:08,029 INFO L273 TraceCheckUtils]: 171: Hoare triple {23010#true} assume true; {23010#true} is VALID [2018-11-18 23:03:08,029 INFO L273 TraceCheckUtils]: 172: Hoare triple {23010#true} assume !!(~i~0 < ~size);call #t~mem1 := read~int(~set.base, ~set.offset + 4 * ~i~0, 4); {23010#true} is VALID [2018-11-18 23:03:08,029 INFO L273 TraceCheckUtils]: 173: Hoare triple {23010#true} assume #t~mem1 == ~value;havoc #t~mem1;#res := 1; {23010#true} is VALID [2018-11-18 23:03:08,029 INFO L273 TraceCheckUtils]: 174: Hoare triple {23010#true} assume true; {23010#true} is VALID [2018-11-18 23:03:08,030 INFO L268 TraceCheckUtils]: 175: Hoare quadruple {23010#true} {23026#(<= (+ main_~v~0 99987) ~SIZE~0)} #132#return; {23026#(<= (+ main_~v~0 99987) ~SIZE~0)} is VALID [2018-11-18 23:03:08,030 INFO L273 TraceCheckUtils]: 176: Hoare triple {23026#(<= (+ main_~v~0 99987) ~SIZE~0)} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {23026#(<= (+ main_~v~0 99987) ~SIZE~0)} is VALID [2018-11-18 23:03:08,031 INFO L273 TraceCheckUtils]: 177: Hoare triple {23026#(<= (+ main_~v~0 99987) ~SIZE~0)} assume !(1 != #t~ret4);havoc #t~mem3;havoc #t~ret4; {23026#(<= (+ main_~v~0 99987) ~SIZE~0)} is VALID [2018-11-18 23:03:08,032 INFO L273 TraceCheckUtils]: 178: Hoare triple {23026#(<= (+ main_~v~0 99987) ~SIZE~0)} #t~post2 := ~v~0;~v~0 := 1 + #t~post2;havoc #t~post2; {23027#(<= (+ main_~v~0 99986) ~SIZE~0)} is VALID [2018-11-18 23:03:08,032 INFO L273 TraceCheckUtils]: 179: Hoare triple {23027#(<= (+ main_~v~0 99986) ~SIZE~0)} assume true; {23027#(<= (+ main_~v~0 99986) ~SIZE~0)} is VALID [2018-11-18 23:03:08,033 INFO L273 TraceCheckUtils]: 180: Hoare triple {23027#(<= (+ main_~v~0 99986) ~SIZE~0)} assume !!(~v~0 < ~SIZE~0);call #t~mem3 := read~int(~#values~0.base, ~#values~0.offset + 4 * ~v~0, 4); {23027#(<= (+ main_~v~0 99986) ~SIZE~0)} is VALID [2018-11-18 23:03:08,033 INFO L256 TraceCheckUtils]: 181: Hoare triple {23027#(<= (+ main_~v~0 99986) ~SIZE~0)} call #t~ret4 := elem_exists(~#set~0.base, ~#set~0.offset, ~n~0, #t~mem3); {23010#true} is VALID [2018-11-18 23:03:08,033 INFO L273 TraceCheckUtils]: 182: Hoare triple {23010#true} ~set.base, ~set.offset := #in~set.base, #in~set.offset;~size := #in~size;~value := #in~value;havoc ~i~0;~i~0 := 0; {23010#true} is VALID [2018-11-18 23:03:08,033 INFO L273 TraceCheckUtils]: 183: Hoare triple {23010#true} assume true; {23010#true} is VALID [2018-11-18 23:03:08,034 INFO L273 TraceCheckUtils]: 184: Hoare triple {23010#true} assume !!(~i~0 < ~size);call #t~mem1 := read~int(~set.base, ~set.offset + 4 * ~i~0, 4); {23010#true} is VALID [2018-11-18 23:03:08,034 INFO L273 TraceCheckUtils]: 185: Hoare triple {23010#true} assume #t~mem1 == ~value;havoc #t~mem1;#res := 1; {23010#true} is VALID [2018-11-18 23:03:08,034 INFO L273 TraceCheckUtils]: 186: Hoare triple {23010#true} assume true; {23010#true} is VALID [2018-11-18 23:03:08,035 INFO L268 TraceCheckUtils]: 187: Hoare quadruple {23010#true} {23027#(<= (+ main_~v~0 99986) ~SIZE~0)} #132#return; {23027#(<= (+ main_~v~0 99986) ~SIZE~0)} is VALID [2018-11-18 23:03:08,035 INFO L273 TraceCheckUtils]: 188: Hoare triple {23027#(<= (+ main_~v~0 99986) ~SIZE~0)} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {23027#(<= (+ main_~v~0 99986) ~SIZE~0)} is VALID [2018-11-18 23:03:08,036 INFO L273 TraceCheckUtils]: 189: Hoare triple {23027#(<= (+ main_~v~0 99986) ~SIZE~0)} assume !(1 != #t~ret4);havoc #t~mem3;havoc #t~ret4; {23027#(<= (+ main_~v~0 99986) ~SIZE~0)} is VALID [2018-11-18 23:03:08,036 INFO L273 TraceCheckUtils]: 190: Hoare triple {23027#(<= (+ main_~v~0 99986) ~SIZE~0)} #t~post2 := ~v~0;~v~0 := 1 + #t~post2;havoc #t~post2; {23028#(<= (+ main_~v~0 99985) ~SIZE~0)} is VALID [2018-11-18 23:03:08,036 INFO L273 TraceCheckUtils]: 191: Hoare triple {23028#(<= (+ main_~v~0 99985) ~SIZE~0)} assume true; {23028#(<= (+ main_~v~0 99985) ~SIZE~0)} is VALID [2018-11-18 23:03:08,037 INFO L273 TraceCheckUtils]: 192: Hoare triple {23028#(<= (+ main_~v~0 99985) ~SIZE~0)} assume !(~v~0 < ~SIZE~0); {23011#false} is VALID [2018-11-18 23:03:08,037 INFO L273 TraceCheckUtils]: 193: Hoare triple {23011#false} ~i~1 := 0; {23011#false} is VALID [2018-11-18 23:03:08,037 INFO L273 TraceCheckUtils]: 194: Hoare triple {23011#false} assume true; {23011#false} is VALID [2018-11-18 23:03:08,037 INFO L273 TraceCheckUtils]: 195: Hoare triple {23011#false} assume !!(~i~1 < ~SIZE~0 && 1 != ~found~0);call #t~mem8 := read~int(~#set~0.base, ~#set~0.offset + 4 * ~i~1, 4); {23011#false} is VALID [2018-11-18 23:03:08,037 INFO L273 TraceCheckUtils]: 196: Hoare triple {23011#false} assume !(#t~mem8 == ~element~0);havoc #t~mem8; {23011#false} is VALID [2018-11-18 23:03:08,037 INFO L273 TraceCheckUtils]: 197: Hoare triple {23011#false} #t~post7 := ~i~1;~i~1 := 1 + #t~post7;havoc #t~post7; {23011#false} is VALID [2018-11-18 23:03:08,037 INFO L273 TraceCheckUtils]: 198: Hoare triple {23011#false} assume true; {23011#false} is VALID [2018-11-18 23:03:08,038 INFO L273 TraceCheckUtils]: 199: Hoare triple {23011#false} assume !!(~i~1 < ~SIZE~0 && 1 != ~found~0);call #t~mem8 := read~int(~#set~0.base, ~#set~0.offset + 4 * ~i~1, 4); {23011#false} is VALID [2018-11-18 23:03:08,038 INFO L273 TraceCheckUtils]: 200: Hoare triple {23011#false} assume #t~mem8 == ~element~0;havoc #t~mem8;~found~0 := 1;~pos~0 := ~i~1; {23011#false} is VALID [2018-11-18 23:03:08,038 INFO L273 TraceCheckUtils]: 201: Hoare triple {23011#false} #t~post7 := ~i~1;~i~1 := 1 + #t~post7;havoc #t~post7; {23011#false} is VALID [2018-11-18 23:03:08,038 INFO L273 TraceCheckUtils]: 202: Hoare triple {23011#false} assume true; {23011#false} is VALID [2018-11-18 23:03:08,038 INFO L273 TraceCheckUtils]: 203: Hoare triple {23011#false} assume !(~i~1 < ~SIZE~0 && 1 != ~found~0); {23011#false} is VALID [2018-11-18 23:03:08,038 INFO L273 TraceCheckUtils]: 204: Hoare triple {23011#false} assume 1 == ~found~0;~i~1 := ~pos~0; {23011#false} is VALID [2018-11-18 23:03:08,039 INFO L273 TraceCheckUtils]: 205: Hoare triple {23011#false} assume true; {23011#false} is VALID [2018-11-18 23:03:08,039 INFO L273 TraceCheckUtils]: 206: Hoare triple {23011#false} assume !!(~i~1 < ~SIZE~0 - 1);call #t~mem10 := read~int(~#set~0.base, ~#set~0.offset + 4 * (1 + ~i~1), 4);call write~int(#t~mem10, ~#set~0.base, ~#set~0.offset + 4 * ~i~1, 4);havoc #t~mem10; {23011#false} is VALID [2018-11-18 23:03:08,039 INFO L273 TraceCheckUtils]: 207: Hoare triple {23011#false} #t~post9 := ~i~1;~i~1 := 1 + #t~post9;havoc #t~post9; {23011#false} is VALID [2018-11-18 23:03:08,039 INFO L273 TraceCheckUtils]: 208: Hoare triple {23011#false} assume true; {23011#false} is VALID [2018-11-18 23:03:08,039 INFO L273 TraceCheckUtils]: 209: Hoare triple {23011#false} assume !!(~i~1 < ~SIZE~0 - 1);call #t~mem10 := read~int(~#set~0.base, ~#set~0.offset + 4 * (1 + ~i~1), 4);call write~int(#t~mem10, ~#set~0.base, ~#set~0.offset + 4 * ~i~1, 4);havoc #t~mem10; {23011#false} is VALID [2018-11-18 23:03:08,040 INFO L273 TraceCheckUtils]: 210: Hoare triple {23011#false} #t~post9 := ~i~1;~i~1 := 1 + #t~post9;havoc #t~post9; {23011#false} is VALID [2018-11-18 23:03:08,040 INFO L273 TraceCheckUtils]: 211: Hoare triple {23011#false} assume true; {23011#false} is VALID [2018-11-18 23:03:08,040 INFO L273 TraceCheckUtils]: 212: Hoare triple {23011#false} assume !!(~i~1 < ~SIZE~0 - 1);call #t~mem10 := read~int(~#set~0.base, ~#set~0.offset + 4 * (1 + ~i~1), 4);call write~int(#t~mem10, ~#set~0.base, ~#set~0.offset + 4 * ~i~1, 4);havoc #t~mem10; {23011#false} is VALID [2018-11-18 23:03:08,040 INFO L273 TraceCheckUtils]: 213: Hoare triple {23011#false} #t~post9 := ~i~1;~i~1 := 1 + #t~post9;havoc #t~post9; {23011#false} is VALID [2018-11-18 23:03:08,040 INFO L273 TraceCheckUtils]: 214: Hoare triple {23011#false} assume true; {23011#false} is VALID [2018-11-18 23:03:08,040 INFO L273 TraceCheckUtils]: 215: Hoare triple {23011#false} assume !(~i~1 < ~SIZE~0 - 1); {23011#false} is VALID [2018-11-18 23:03:08,041 INFO L273 TraceCheckUtils]: 216: Hoare triple {23011#false} assume 1 == ~found~0;~i~1 := 0; {23011#false} is VALID [2018-11-18 23:03:08,041 INFO L273 TraceCheckUtils]: 217: Hoare triple {23011#false} assume true; {23011#false} is VALID [2018-11-18 23:03:08,041 INFO L273 TraceCheckUtils]: 218: Hoare triple {23011#false} assume !!(~i~1 < ~SIZE~0 - 1);call #t~mem12 := read~int(~#set~0.base, ~#set~0.offset + 4 * ~i~1, 4); {23011#false} is VALID [2018-11-18 23:03:08,041 INFO L256 TraceCheckUtils]: 219: Hoare triple {23011#false} call __VERIFIER_assert((if #t~mem12 != ~element~0 then 1 else 0)); {23011#false} is VALID [2018-11-18 23:03:08,041 INFO L273 TraceCheckUtils]: 220: Hoare triple {23011#false} ~cond := #in~cond; {23011#false} is VALID [2018-11-18 23:03:08,041 INFO L273 TraceCheckUtils]: 221: Hoare triple {23011#false} assume 0 == ~cond; {23011#false} is VALID [2018-11-18 23:03:08,041 INFO L273 TraceCheckUtils]: 222: Hoare triple {23011#false} assume !false; {23011#false} is VALID [2018-11-18 23:03:08,081 INFO L134 CoverageAnalysis]: Checked inductivity of 1299 backedges. 0 proven. 660 refuted. 0 times theorem prover too weak. 639 trivial. 0 not checked. [2018-11-18 23:03:08,082 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 23:03:08,082 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-18 23:03:08,094 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-11-18 23:03:08,194 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2018-11-18 23:03:08,194 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-18 23:03:08,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 23:03:08,236 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 23:03:08,605 INFO L256 TraceCheckUtils]: 0: Hoare triple {23010#true} call ULTIMATE.init(); {23010#true} is VALID [2018-11-18 23:03:08,606 INFO L273 TraceCheckUtils]: 1: Hoare triple {23010#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~SIZE~0 := 100000; {23012#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:03:08,607 INFO L273 TraceCheckUtils]: 2: Hoare triple {23012#(<= 100000 ~SIZE~0)} assume true; {23012#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:03:08,607 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {23012#(<= 100000 ~SIZE~0)} {23010#true} #128#return; {23012#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:03:08,608 INFO L256 TraceCheckUtils]: 4: Hoare triple {23012#(<= 100000 ~SIZE~0)} call #t~ret13 := main(); {23012#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:03:08,608 INFO L273 TraceCheckUtils]: 5: Hoare triple {23012#(<= 100000 ~SIZE~0)} havoc ~i~1;havoc ~pos~0;~n~0 := 0;~found~0 := 0;call ~#set~0.base, ~#set~0.offset := #Ultimate.alloc(4 * ~SIZE~0);call ~#values~0.base, ~#values~0.offset := #Ultimate.alloc(4 * ~SIZE~0);havoc ~element~0;havoc ~v~0;~v~0 := 0; {23012#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:03:08,609 INFO L273 TraceCheckUtils]: 6: Hoare triple {23012#(<= 100000 ~SIZE~0)} assume true; {23012#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:03:08,609 INFO L273 TraceCheckUtils]: 7: Hoare triple {23012#(<= 100000 ~SIZE~0)} assume !!(~v~0 < ~SIZE~0);call #t~mem3 := read~int(~#values~0.base, ~#values~0.offset + 4 * ~v~0, 4); {23012#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:03:08,610 INFO L256 TraceCheckUtils]: 8: Hoare triple {23012#(<= 100000 ~SIZE~0)} call #t~ret4 := elem_exists(~#set~0.base, ~#set~0.offset, ~n~0, #t~mem3); {23012#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:03:08,611 INFO L273 TraceCheckUtils]: 9: Hoare triple {23012#(<= 100000 ~SIZE~0)} ~set.base, ~set.offset := #in~set.base, #in~set.offset;~size := #in~size;~value := #in~value;havoc ~i~0;~i~0 := 0; {23012#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:03:08,612 INFO L273 TraceCheckUtils]: 10: Hoare triple {23012#(<= 100000 ~SIZE~0)} assume true; {23012#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:03:08,612 INFO L273 TraceCheckUtils]: 11: Hoare triple {23012#(<= 100000 ~SIZE~0)} assume !(~i~0 < ~size); {23012#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:03:08,613 INFO L273 TraceCheckUtils]: 12: Hoare triple {23012#(<= 100000 ~SIZE~0)} #res := 0; {23012#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:03:08,613 INFO L273 TraceCheckUtils]: 13: Hoare triple {23012#(<= 100000 ~SIZE~0)} assume true; {23012#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:03:08,614 INFO L268 TraceCheckUtils]: 14: Hoare quadruple {23012#(<= 100000 ~SIZE~0)} {23012#(<= 100000 ~SIZE~0)} #132#return; {23012#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:03:08,615 INFO L273 TraceCheckUtils]: 15: Hoare triple {23012#(<= 100000 ~SIZE~0)} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {23012#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:03:08,615 INFO L273 TraceCheckUtils]: 16: Hoare triple {23012#(<= 100000 ~SIZE~0)} assume 1 != #t~ret4;havoc #t~mem3;havoc #t~ret4;call #t~mem5 := read~int(~#values~0.base, ~#values~0.offset + 4 * ~v~0, 4); {23012#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:03:08,616 INFO L256 TraceCheckUtils]: 17: Hoare triple {23012#(<= 100000 ~SIZE~0)} call #t~ret6 := insert(~#set~0.base, ~#set~0.offset, ~n~0, #t~mem5); {23012#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:03:08,617 INFO L273 TraceCheckUtils]: 18: Hoare triple {23012#(<= 100000 ~SIZE~0)} ~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; {23012#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:03:08,617 INFO L273 TraceCheckUtils]: 19: Hoare triple {23012#(<= 100000 ~SIZE~0)} assume true; {23012#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:03:08,619 INFO L268 TraceCheckUtils]: 20: Hoare quadruple {23012#(<= 100000 ~SIZE~0)} {23012#(<= 100000 ~SIZE~0)} #134#return; {23012#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:03:08,619 INFO L273 TraceCheckUtils]: 21: Hoare triple {23012#(<= 100000 ~SIZE~0)} assume -2147483648 <= #t~ret6 && #t~ret6 <= 2147483647;~n~0 := #t~ret6;havoc #t~ret6;havoc #t~mem5; {23012#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:03:08,620 INFO L273 TraceCheckUtils]: 22: Hoare triple {23012#(<= 100000 ~SIZE~0)} #t~post2 := ~v~0;~v~0 := 1 + #t~post2;havoc #t~post2; {23012#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:03:08,620 INFO L273 TraceCheckUtils]: 23: Hoare triple {23012#(<= 100000 ~SIZE~0)} assume true; {23012#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:03:08,621 INFO L273 TraceCheckUtils]: 24: Hoare triple {23012#(<= 100000 ~SIZE~0)} assume !!(~v~0 < ~SIZE~0);call #t~mem3 := read~int(~#values~0.base, ~#values~0.offset + 4 * ~v~0, 4); {23012#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:03:08,622 INFO L256 TraceCheckUtils]: 25: Hoare triple {23012#(<= 100000 ~SIZE~0)} call #t~ret4 := elem_exists(~#set~0.base, ~#set~0.offset, ~n~0, #t~mem3); {23012#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:03:08,622 INFO L273 TraceCheckUtils]: 26: Hoare triple {23012#(<= 100000 ~SIZE~0)} ~set.base, ~set.offset := #in~set.base, #in~set.offset;~size := #in~size;~value := #in~value;havoc ~i~0;~i~0 := 0; {23012#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:03:08,623 INFO L273 TraceCheckUtils]: 27: Hoare triple {23012#(<= 100000 ~SIZE~0)} assume true; {23012#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:03:08,623 INFO L273 TraceCheckUtils]: 28: Hoare triple {23012#(<= 100000 ~SIZE~0)} assume !!(~i~0 < ~size);call #t~mem1 := read~int(~set.base, ~set.offset + 4 * ~i~0, 4); {23012#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:03:08,624 INFO L273 TraceCheckUtils]: 29: Hoare triple {23012#(<= 100000 ~SIZE~0)} assume #t~mem1 == ~value;havoc #t~mem1;#res := 1; {23012#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:03:08,624 INFO L273 TraceCheckUtils]: 30: Hoare triple {23012#(<= 100000 ~SIZE~0)} assume true; {23012#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:03:08,625 INFO L268 TraceCheckUtils]: 31: Hoare quadruple {23012#(<= 100000 ~SIZE~0)} {23012#(<= 100000 ~SIZE~0)} #132#return; {23012#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:03:08,626 INFO L273 TraceCheckUtils]: 32: Hoare triple {23012#(<= 100000 ~SIZE~0)} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {23012#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:03:08,626 INFO L273 TraceCheckUtils]: 33: Hoare triple {23012#(<= 100000 ~SIZE~0)} assume !(1 != #t~ret4);havoc #t~mem3;havoc #t~ret4; {23012#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:03:08,627 INFO L273 TraceCheckUtils]: 34: Hoare triple {23012#(<= 100000 ~SIZE~0)} #t~post2 := ~v~0;~v~0 := 1 + #t~post2;havoc #t~post2; {23012#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:03:08,627 INFO L273 TraceCheckUtils]: 35: Hoare triple {23012#(<= 100000 ~SIZE~0)} assume true; {23012#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:03:08,628 INFO L273 TraceCheckUtils]: 36: Hoare triple {23012#(<= 100000 ~SIZE~0)} assume !!(~v~0 < ~SIZE~0);call #t~mem3 := read~int(~#values~0.base, ~#values~0.offset + 4 * ~v~0, 4); {23012#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:03:08,629 INFO L256 TraceCheckUtils]: 37: Hoare triple {23012#(<= 100000 ~SIZE~0)} call #t~ret4 := elem_exists(~#set~0.base, ~#set~0.offset, ~n~0, #t~mem3); {23012#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:03:08,630 INFO L273 TraceCheckUtils]: 38: Hoare triple {23012#(<= 100000 ~SIZE~0)} ~set.base, ~set.offset := #in~set.base, #in~set.offset;~size := #in~size;~value := #in~value;havoc ~i~0;~i~0 := 0; {23012#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:03:08,630 INFO L273 TraceCheckUtils]: 39: Hoare triple {23012#(<= 100000 ~SIZE~0)} assume true; {23012#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:03:08,631 INFO L273 TraceCheckUtils]: 40: Hoare triple {23012#(<= 100000 ~SIZE~0)} assume !!(~i~0 < ~size);call #t~mem1 := read~int(~set.base, ~set.offset + 4 * ~i~0, 4); {23012#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:03:08,631 INFO L273 TraceCheckUtils]: 41: Hoare triple {23012#(<= 100000 ~SIZE~0)} assume #t~mem1 == ~value;havoc #t~mem1;#res := 1; {23012#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:03:08,632 INFO L273 TraceCheckUtils]: 42: Hoare triple {23012#(<= 100000 ~SIZE~0)} assume true; {23012#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:03:08,633 INFO L268 TraceCheckUtils]: 43: Hoare quadruple {23012#(<= 100000 ~SIZE~0)} {23012#(<= 100000 ~SIZE~0)} #132#return; {23012#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:03:08,633 INFO L273 TraceCheckUtils]: 44: Hoare triple {23012#(<= 100000 ~SIZE~0)} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {23012#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:03:08,634 INFO L273 TraceCheckUtils]: 45: Hoare triple {23012#(<= 100000 ~SIZE~0)} assume !(1 != #t~ret4);havoc #t~mem3;havoc #t~ret4; {23012#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:03:08,634 INFO L273 TraceCheckUtils]: 46: Hoare triple {23012#(<= 100000 ~SIZE~0)} #t~post2 := ~v~0;~v~0 := 1 + #t~post2;havoc #t~post2; {23012#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:03:08,635 INFO L273 TraceCheckUtils]: 47: Hoare triple {23012#(<= 100000 ~SIZE~0)} assume true; {23012#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:03:08,635 INFO L273 TraceCheckUtils]: 48: Hoare triple {23012#(<= 100000 ~SIZE~0)} assume !!(~v~0 < ~SIZE~0);call #t~mem3 := read~int(~#values~0.base, ~#values~0.offset + 4 * ~v~0, 4); {23012#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:03:08,636 INFO L256 TraceCheckUtils]: 49: Hoare triple {23012#(<= 100000 ~SIZE~0)} call #t~ret4 := elem_exists(~#set~0.base, ~#set~0.offset, ~n~0, #t~mem3); {23012#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:03:08,637 INFO L273 TraceCheckUtils]: 50: Hoare triple {23012#(<= 100000 ~SIZE~0)} ~set.base, ~set.offset := #in~set.base, #in~set.offset;~size := #in~size;~value := #in~value;havoc ~i~0;~i~0 := 0; {23012#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:03:08,637 INFO L273 TraceCheckUtils]: 51: Hoare triple {23012#(<= 100000 ~SIZE~0)} assume true; {23012#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:03:08,638 INFO L273 TraceCheckUtils]: 52: Hoare triple {23012#(<= 100000 ~SIZE~0)} assume !!(~i~0 < ~size);call #t~mem1 := read~int(~set.base, ~set.offset + 4 * ~i~0, 4); {23012#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:03:08,638 INFO L273 TraceCheckUtils]: 53: Hoare triple {23012#(<= 100000 ~SIZE~0)} assume #t~mem1 == ~value;havoc #t~mem1;#res := 1; {23012#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:03:08,639 INFO L273 TraceCheckUtils]: 54: Hoare triple {23012#(<= 100000 ~SIZE~0)} assume true; {23012#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:03:08,640 INFO L268 TraceCheckUtils]: 55: Hoare quadruple {23012#(<= 100000 ~SIZE~0)} {23012#(<= 100000 ~SIZE~0)} #132#return; {23012#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:03:08,641 INFO L273 TraceCheckUtils]: 56: Hoare triple {23012#(<= 100000 ~SIZE~0)} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {23012#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:03:08,641 INFO L273 TraceCheckUtils]: 57: Hoare triple {23012#(<= 100000 ~SIZE~0)} assume !(1 != #t~ret4);havoc #t~mem3;havoc #t~ret4; {23012#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:03:08,642 INFO L273 TraceCheckUtils]: 58: Hoare triple {23012#(<= 100000 ~SIZE~0)} #t~post2 := ~v~0;~v~0 := 1 + #t~post2;havoc #t~post2; {23012#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:03:08,642 INFO L273 TraceCheckUtils]: 59: Hoare triple {23012#(<= 100000 ~SIZE~0)} assume true; {23012#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:03:08,643 INFO L273 TraceCheckUtils]: 60: Hoare triple {23012#(<= 100000 ~SIZE~0)} assume !!(~v~0 < ~SIZE~0);call #t~mem3 := read~int(~#values~0.base, ~#values~0.offset + 4 * ~v~0, 4); {23012#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:03:08,644 INFO L256 TraceCheckUtils]: 61: Hoare triple {23012#(<= 100000 ~SIZE~0)} call #t~ret4 := elem_exists(~#set~0.base, ~#set~0.offset, ~n~0, #t~mem3); {23012#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:03:08,644 INFO L273 TraceCheckUtils]: 62: Hoare triple {23012#(<= 100000 ~SIZE~0)} ~set.base, ~set.offset := #in~set.base, #in~set.offset;~size := #in~size;~value := #in~value;havoc ~i~0;~i~0 := 0; {23012#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:03:08,645 INFO L273 TraceCheckUtils]: 63: Hoare triple {23012#(<= 100000 ~SIZE~0)} assume true; {23012#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:03:08,645 INFO L273 TraceCheckUtils]: 64: Hoare triple {23012#(<= 100000 ~SIZE~0)} assume !!(~i~0 < ~size);call #t~mem1 := read~int(~set.base, ~set.offset + 4 * ~i~0, 4); {23012#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:03:08,646 INFO L273 TraceCheckUtils]: 65: Hoare triple {23012#(<= 100000 ~SIZE~0)} assume #t~mem1 == ~value;havoc #t~mem1;#res := 1; {23012#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:03:08,646 INFO L273 TraceCheckUtils]: 66: Hoare triple {23012#(<= 100000 ~SIZE~0)} assume true; {23012#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:03:08,647 INFO L268 TraceCheckUtils]: 67: Hoare quadruple {23012#(<= 100000 ~SIZE~0)} {23012#(<= 100000 ~SIZE~0)} #132#return; {23012#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:03:08,648 INFO L273 TraceCheckUtils]: 68: Hoare triple {23012#(<= 100000 ~SIZE~0)} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {23012#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:03:08,648 INFO L273 TraceCheckUtils]: 69: Hoare triple {23012#(<= 100000 ~SIZE~0)} assume !(1 != #t~ret4);havoc #t~mem3;havoc #t~ret4; {23012#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:03:08,649 INFO L273 TraceCheckUtils]: 70: Hoare triple {23012#(<= 100000 ~SIZE~0)} #t~post2 := ~v~0;~v~0 := 1 + #t~post2;havoc #t~post2; {23012#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:03:08,649 INFO L273 TraceCheckUtils]: 71: Hoare triple {23012#(<= 100000 ~SIZE~0)} assume true; {23012#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:03:08,650 INFO L273 TraceCheckUtils]: 72: Hoare triple {23012#(<= 100000 ~SIZE~0)} assume !!(~v~0 < ~SIZE~0);call #t~mem3 := read~int(~#values~0.base, ~#values~0.offset + 4 * ~v~0, 4); {23012#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:03:08,651 INFO L256 TraceCheckUtils]: 73: Hoare triple {23012#(<= 100000 ~SIZE~0)} call #t~ret4 := elem_exists(~#set~0.base, ~#set~0.offset, ~n~0, #t~mem3); {23012#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:03:08,652 INFO L273 TraceCheckUtils]: 74: Hoare triple {23012#(<= 100000 ~SIZE~0)} ~set.base, ~set.offset := #in~set.base, #in~set.offset;~size := #in~size;~value := #in~value;havoc ~i~0;~i~0 := 0; {23012#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:03:08,652 INFO L273 TraceCheckUtils]: 75: Hoare triple {23012#(<= 100000 ~SIZE~0)} assume true; {23012#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:03:08,653 INFO L273 TraceCheckUtils]: 76: Hoare triple {23012#(<= 100000 ~SIZE~0)} assume !!(~i~0 < ~size);call #t~mem1 := read~int(~set.base, ~set.offset + 4 * ~i~0, 4); {23012#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:03:08,661 INFO L273 TraceCheckUtils]: 77: Hoare triple {23012#(<= 100000 ~SIZE~0)} assume #t~mem1 == ~value;havoc #t~mem1;#res := 1; {23012#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:03:08,662 INFO L273 TraceCheckUtils]: 78: Hoare triple {23012#(<= 100000 ~SIZE~0)} assume true; {23012#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:03:08,663 INFO L268 TraceCheckUtils]: 79: Hoare quadruple {23012#(<= 100000 ~SIZE~0)} {23012#(<= 100000 ~SIZE~0)} #132#return; {23012#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:03:08,663 INFO L273 TraceCheckUtils]: 80: Hoare triple {23012#(<= 100000 ~SIZE~0)} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {23012#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:03:08,663 INFO L273 TraceCheckUtils]: 81: Hoare triple {23012#(<= 100000 ~SIZE~0)} assume !(1 != #t~ret4);havoc #t~mem3;havoc #t~ret4; {23012#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:03:08,664 INFO L273 TraceCheckUtils]: 82: Hoare triple {23012#(<= 100000 ~SIZE~0)} #t~post2 := ~v~0;~v~0 := 1 + #t~post2;havoc #t~post2; {23012#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:03:08,664 INFO L273 TraceCheckUtils]: 83: Hoare triple {23012#(<= 100000 ~SIZE~0)} assume true; {23012#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:03:08,664 INFO L273 TraceCheckUtils]: 84: Hoare triple {23012#(<= 100000 ~SIZE~0)} assume !!(~v~0 < ~SIZE~0);call #t~mem3 := read~int(~#values~0.base, ~#values~0.offset + 4 * ~v~0, 4); {23012#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:03:08,665 INFO L256 TraceCheckUtils]: 85: Hoare triple {23012#(<= 100000 ~SIZE~0)} call #t~ret4 := elem_exists(~#set~0.base, ~#set~0.offset, ~n~0, #t~mem3); {23012#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:03:08,665 INFO L273 TraceCheckUtils]: 86: Hoare triple {23012#(<= 100000 ~SIZE~0)} ~set.base, ~set.offset := #in~set.base, #in~set.offset;~size := #in~size;~value := #in~value;havoc ~i~0;~i~0 := 0; {23012#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:03:08,666 INFO L273 TraceCheckUtils]: 87: Hoare triple {23012#(<= 100000 ~SIZE~0)} assume true; {23012#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:03:08,666 INFO L273 TraceCheckUtils]: 88: Hoare triple {23012#(<= 100000 ~SIZE~0)} assume !!(~i~0 < ~size);call #t~mem1 := read~int(~set.base, ~set.offset + 4 * ~i~0, 4); {23012#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:03:08,666 INFO L273 TraceCheckUtils]: 89: Hoare triple {23012#(<= 100000 ~SIZE~0)} assume #t~mem1 == ~value;havoc #t~mem1;#res := 1; {23012#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:03:08,667 INFO L273 TraceCheckUtils]: 90: Hoare triple {23012#(<= 100000 ~SIZE~0)} assume true; {23012#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:03:08,668 INFO L268 TraceCheckUtils]: 91: Hoare quadruple {23012#(<= 100000 ~SIZE~0)} {23012#(<= 100000 ~SIZE~0)} #132#return; {23012#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:03:08,669 INFO L273 TraceCheckUtils]: 92: Hoare triple {23012#(<= 100000 ~SIZE~0)} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {23012#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:03:08,669 INFO L273 TraceCheckUtils]: 93: Hoare triple {23012#(<= 100000 ~SIZE~0)} assume !(1 != #t~ret4);havoc #t~mem3;havoc #t~ret4; {23012#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:03:08,670 INFO L273 TraceCheckUtils]: 94: Hoare triple {23012#(<= 100000 ~SIZE~0)} #t~post2 := ~v~0;~v~0 := 1 + #t~post2;havoc #t~post2; {23012#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:03:08,670 INFO L273 TraceCheckUtils]: 95: Hoare triple {23012#(<= 100000 ~SIZE~0)} assume true; {23012#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:03:08,671 INFO L273 TraceCheckUtils]: 96: Hoare triple {23012#(<= 100000 ~SIZE~0)} assume !!(~v~0 < ~SIZE~0);call #t~mem3 := read~int(~#values~0.base, ~#values~0.offset + 4 * ~v~0, 4); {23012#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:03:08,672 INFO L256 TraceCheckUtils]: 97: Hoare triple {23012#(<= 100000 ~SIZE~0)} call #t~ret4 := elem_exists(~#set~0.base, ~#set~0.offset, ~n~0, #t~mem3); {23012#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:03:08,672 INFO L273 TraceCheckUtils]: 98: Hoare triple {23012#(<= 100000 ~SIZE~0)} ~set.base, ~set.offset := #in~set.base, #in~set.offset;~size := #in~size;~value := #in~value;havoc ~i~0;~i~0 := 0; {23012#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:03:08,673 INFO L273 TraceCheckUtils]: 99: Hoare triple {23012#(<= 100000 ~SIZE~0)} assume true; {23012#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:03:08,673 INFO L273 TraceCheckUtils]: 100: Hoare triple {23012#(<= 100000 ~SIZE~0)} assume !!(~i~0 < ~size);call #t~mem1 := read~int(~set.base, ~set.offset + 4 * ~i~0, 4); {23012#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:03:08,674 INFO L273 TraceCheckUtils]: 101: Hoare triple {23012#(<= 100000 ~SIZE~0)} assume #t~mem1 == ~value;havoc #t~mem1;#res := 1; {23012#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:03:08,674 INFO L273 TraceCheckUtils]: 102: Hoare triple {23012#(<= 100000 ~SIZE~0)} assume true; {23012#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:03:08,676 INFO L268 TraceCheckUtils]: 103: Hoare quadruple {23012#(<= 100000 ~SIZE~0)} {23012#(<= 100000 ~SIZE~0)} #132#return; {23012#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:03:08,676 INFO L273 TraceCheckUtils]: 104: Hoare triple {23012#(<= 100000 ~SIZE~0)} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {23012#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:03:08,677 INFO L273 TraceCheckUtils]: 105: Hoare triple {23012#(<= 100000 ~SIZE~0)} assume !(1 != #t~ret4);havoc #t~mem3;havoc #t~ret4; {23012#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:03:08,677 INFO L273 TraceCheckUtils]: 106: Hoare triple {23012#(<= 100000 ~SIZE~0)} #t~post2 := ~v~0;~v~0 := 1 + #t~post2;havoc #t~post2; {23012#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:03:08,678 INFO L273 TraceCheckUtils]: 107: Hoare triple {23012#(<= 100000 ~SIZE~0)} assume true; {23012#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:03:08,678 INFO L273 TraceCheckUtils]: 108: Hoare triple {23012#(<= 100000 ~SIZE~0)} assume !!(~v~0 < ~SIZE~0);call #t~mem3 := read~int(~#values~0.base, ~#values~0.offset + 4 * ~v~0, 4); {23012#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:03:08,679 INFO L256 TraceCheckUtils]: 109: Hoare triple {23012#(<= 100000 ~SIZE~0)} call #t~ret4 := elem_exists(~#set~0.base, ~#set~0.offset, ~n~0, #t~mem3); {23012#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:03:08,680 INFO L273 TraceCheckUtils]: 110: Hoare triple {23012#(<= 100000 ~SIZE~0)} ~set.base, ~set.offset := #in~set.base, #in~set.offset;~size := #in~size;~value := #in~value;havoc ~i~0;~i~0 := 0; {23012#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:03:08,680 INFO L273 TraceCheckUtils]: 111: Hoare triple {23012#(<= 100000 ~SIZE~0)} assume true; {23012#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:03:08,681 INFO L273 TraceCheckUtils]: 112: Hoare triple {23012#(<= 100000 ~SIZE~0)} assume !!(~i~0 < ~size);call #t~mem1 := read~int(~set.base, ~set.offset + 4 * ~i~0, 4); {23012#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:03:08,681 INFO L273 TraceCheckUtils]: 113: Hoare triple {23012#(<= 100000 ~SIZE~0)} assume #t~mem1 == ~value;havoc #t~mem1;#res := 1; {23012#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:03:08,682 INFO L273 TraceCheckUtils]: 114: Hoare triple {23012#(<= 100000 ~SIZE~0)} assume true; {23012#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:03:08,683 INFO L268 TraceCheckUtils]: 115: Hoare quadruple {23012#(<= 100000 ~SIZE~0)} {23012#(<= 100000 ~SIZE~0)} #132#return; {23012#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:03:08,683 INFO L273 TraceCheckUtils]: 116: Hoare triple {23012#(<= 100000 ~SIZE~0)} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {23012#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:03:08,684 INFO L273 TraceCheckUtils]: 117: Hoare triple {23012#(<= 100000 ~SIZE~0)} assume !(1 != #t~ret4);havoc #t~mem3;havoc #t~ret4; {23012#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:03:08,684 INFO L273 TraceCheckUtils]: 118: Hoare triple {23012#(<= 100000 ~SIZE~0)} #t~post2 := ~v~0;~v~0 := 1 + #t~post2;havoc #t~post2; {23012#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:03:08,685 INFO L273 TraceCheckUtils]: 119: Hoare triple {23012#(<= 100000 ~SIZE~0)} assume true; {23012#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:03:08,685 INFO L273 TraceCheckUtils]: 120: Hoare triple {23012#(<= 100000 ~SIZE~0)} assume !!(~v~0 < ~SIZE~0);call #t~mem3 := read~int(~#values~0.base, ~#values~0.offset + 4 * ~v~0, 4); {23012#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:03:08,687 INFO L256 TraceCheckUtils]: 121: Hoare triple {23012#(<= 100000 ~SIZE~0)} call #t~ret4 := elem_exists(~#set~0.base, ~#set~0.offset, ~n~0, #t~mem3); {23012#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:03:08,687 INFO L273 TraceCheckUtils]: 122: Hoare triple {23012#(<= 100000 ~SIZE~0)} ~set.base, ~set.offset := #in~set.base, #in~set.offset;~size := #in~size;~value := #in~value;havoc ~i~0;~i~0 := 0; {23012#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:03:08,688 INFO L273 TraceCheckUtils]: 123: Hoare triple {23012#(<= 100000 ~SIZE~0)} assume true; {23012#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:03:08,688 INFO L273 TraceCheckUtils]: 124: Hoare triple {23012#(<= 100000 ~SIZE~0)} assume !!(~i~0 < ~size);call #t~mem1 := read~int(~set.base, ~set.offset + 4 * ~i~0, 4); {23012#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:03:08,689 INFO L273 TraceCheckUtils]: 125: Hoare triple {23012#(<= 100000 ~SIZE~0)} assume #t~mem1 == ~value;havoc #t~mem1;#res := 1; {23012#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:03:08,689 INFO L273 TraceCheckUtils]: 126: Hoare triple {23012#(<= 100000 ~SIZE~0)} assume true; {23012#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:03:08,690 INFO L268 TraceCheckUtils]: 127: Hoare quadruple {23012#(<= 100000 ~SIZE~0)} {23012#(<= 100000 ~SIZE~0)} #132#return; {23012#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:03:08,691 INFO L273 TraceCheckUtils]: 128: Hoare triple {23012#(<= 100000 ~SIZE~0)} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {23012#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:03:08,691 INFO L273 TraceCheckUtils]: 129: Hoare triple {23012#(<= 100000 ~SIZE~0)} assume !(1 != #t~ret4);havoc #t~mem3;havoc #t~ret4; {23012#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:03:08,692 INFO L273 TraceCheckUtils]: 130: Hoare triple {23012#(<= 100000 ~SIZE~0)} #t~post2 := ~v~0;~v~0 := 1 + #t~post2;havoc #t~post2; {23012#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:03:08,692 INFO L273 TraceCheckUtils]: 131: Hoare triple {23012#(<= 100000 ~SIZE~0)} assume true; {23012#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:03:08,693 INFO L273 TraceCheckUtils]: 132: Hoare triple {23012#(<= 100000 ~SIZE~0)} assume !!(~v~0 < ~SIZE~0);call #t~mem3 := read~int(~#values~0.base, ~#values~0.offset + 4 * ~v~0, 4); {23012#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:03:08,694 INFO L256 TraceCheckUtils]: 133: Hoare triple {23012#(<= 100000 ~SIZE~0)} call #t~ret4 := elem_exists(~#set~0.base, ~#set~0.offset, ~n~0, #t~mem3); {23012#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:03:08,694 INFO L273 TraceCheckUtils]: 134: Hoare triple {23012#(<= 100000 ~SIZE~0)} ~set.base, ~set.offset := #in~set.base, #in~set.offset;~size := #in~size;~value := #in~value;havoc ~i~0;~i~0 := 0; {23012#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:03:08,695 INFO L273 TraceCheckUtils]: 135: Hoare triple {23012#(<= 100000 ~SIZE~0)} assume true; {23012#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:03:08,695 INFO L273 TraceCheckUtils]: 136: Hoare triple {23012#(<= 100000 ~SIZE~0)} assume !!(~i~0 < ~size);call #t~mem1 := read~int(~set.base, ~set.offset + 4 * ~i~0, 4); {23012#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:03:08,696 INFO L273 TraceCheckUtils]: 137: Hoare triple {23012#(<= 100000 ~SIZE~0)} assume #t~mem1 == ~value;havoc #t~mem1;#res := 1; {23012#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:03:08,696 INFO L273 TraceCheckUtils]: 138: Hoare triple {23012#(<= 100000 ~SIZE~0)} assume true; {23012#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:03:08,698 INFO L268 TraceCheckUtils]: 139: Hoare quadruple {23012#(<= 100000 ~SIZE~0)} {23012#(<= 100000 ~SIZE~0)} #132#return; {23012#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:03:08,698 INFO L273 TraceCheckUtils]: 140: Hoare triple {23012#(<= 100000 ~SIZE~0)} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {23012#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:03:08,699 INFO L273 TraceCheckUtils]: 141: Hoare triple {23012#(<= 100000 ~SIZE~0)} assume !(1 != #t~ret4);havoc #t~mem3;havoc #t~ret4; {23012#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:03:08,699 INFO L273 TraceCheckUtils]: 142: Hoare triple {23012#(<= 100000 ~SIZE~0)} #t~post2 := ~v~0;~v~0 := 1 + #t~post2;havoc #t~post2; {23012#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:03:08,700 INFO L273 TraceCheckUtils]: 143: Hoare triple {23012#(<= 100000 ~SIZE~0)} assume true; {23012#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:03:08,700 INFO L273 TraceCheckUtils]: 144: Hoare triple {23012#(<= 100000 ~SIZE~0)} assume !!(~v~0 < ~SIZE~0);call #t~mem3 := read~int(~#values~0.base, ~#values~0.offset + 4 * ~v~0, 4); {23012#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:03:08,701 INFO L256 TraceCheckUtils]: 145: Hoare triple {23012#(<= 100000 ~SIZE~0)} call #t~ret4 := elem_exists(~#set~0.base, ~#set~0.offset, ~n~0, #t~mem3); {23012#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:03:08,702 INFO L273 TraceCheckUtils]: 146: Hoare triple {23012#(<= 100000 ~SIZE~0)} ~set.base, ~set.offset := #in~set.base, #in~set.offset;~size := #in~size;~value := #in~value;havoc ~i~0;~i~0 := 0; {23012#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:03:08,702 INFO L273 TraceCheckUtils]: 147: Hoare triple {23012#(<= 100000 ~SIZE~0)} assume true; {23012#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:03:08,703 INFO L273 TraceCheckUtils]: 148: Hoare triple {23012#(<= 100000 ~SIZE~0)} assume !!(~i~0 < ~size);call #t~mem1 := read~int(~set.base, ~set.offset + 4 * ~i~0, 4); {23012#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:03:08,703 INFO L273 TraceCheckUtils]: 149: Hoare triple {23012#(<= 100000 ~SIZE~0)} assume #t~mem1 == ~value;havoc #t~mem1;#res := 1; {23012#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:03:08,704 INFO L273 TraceCheckUtils]: 150: Hoare triple {23012#(<= 100000 ~SIZE~0)} assume true; {23012#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:03:08,705 INFO L268 TraceCheckUtils]: 151: Hoare quadruple {23012#(<= 100000 ~SIZE~0)} {23012#(<= 100000 ~SIZE~0)} #132#return; {23012#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:03:08,706 INFO L273 TraceCheckUtils]: 152: Hoare triple {23012#(<= 100000 ~SIZE~0)} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {23012#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:03:08,706 INFO L273 TraceCheckUtils]: 153: Hoare triple {23012#(<= 100000 ~SIZE~0)} assume !(1 != #t~ret4);havoc #t~mem3;havoc #t~ret4; {23012#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:03:08,707 INFO L273 TraceCheckUtils]: 154: Hoare triple {23012#(<= 100000 ~SIZE~0)} #t~post2 := ~v~0;~v~0 := 1 + #t~post2;havoc #t~post2; {23012#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:03:08,707 INFO L273 TraceCheckUtils]: 155: Hoare triple {23012#(<= 100000 ~SIZE~0)} assume true; {23012#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:03:08,708 INFO L273 TraceCheckUtils]: 156: Hoare triple {23012#(<= 100000 ~SIZE~0)} assume !!(~v~0 < ~SIZE~0);call #t~mem3 := read~int(~#values~0.base, ~#values~0.offset + 4 * ~v~0, 4); {23012#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:03:08,709 INFO L256 TraceCheckUtils]: 157: Hoare triple {23012#(<= 100000 ~SIZE~0)} call #t~ret4 := elem_exists(~#set~0.base, ~#set~0.offset, ~n~0, #t~mem3); {23012#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:03:08,709 INFO L273 TraceCheckUtils]: 158: Hoare triple {23012#(<= 100000 ~SIZE~0)} ~set.base, ~set.offset := #in~set.base, #in~set.offset;~size := #in~size;~value := #in~value;havoc ~i~0;~i~0 := 0; {23012#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:03:08,710 INFO L273 TraceCheckUtils]: 159: Hoare triple {23012#(<= 100000 ~SIZE~0)} assume true; {23012#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:03:08,710 INFO L273 TraceCheckUtils]: 160: Hoare triple {23012#(<= 100000 ~SIZE~0)} assume !!(~i~0 < ~size);call #t~mem1 := read~int(~set.base, ~set.offset + 4 * ~i~0, 4); {23012#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:03:08,711 INFO L273 TraceCheckUtils]: 161: Hoare triple {23012#(<= 100000 ~SIZE~0)} assume #t~mem1 == ~value;havoc #t~mem1;#res := 1; {23012#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:03:08,711 INFO L273 TraceCheckUtils]: 162: Hoare triple {23012#(<= 100000 ~SIZE~0)} assume true; {23012#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:03:08,712 INFO L268 TraceCheckUtils]: 163: Hoare quadruple {23012#(<= 100000 ~SIZE~0)} {23012#(<= 100000 ~SIZE~0)} #132#return; {23012#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:03:08,713 INFO L273 TraceCheckUtils]: 164: Hoare triple {23012#(<= 100000 ~SIZE~0)} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {23012#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:03:08,713 INFO L273 TraceCheckUtils]: 165: Hoare triple {23012#(<= 100000 ~SIZE~0)} assume !(1 != #t~ret4);havoc #t~mem3;havoc #t~ret4; {23012#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:03:08,714 INFO L273 TraceCheckUtils]: 166: Hoare triple {23012#(<= 100000 ~SIZE~0)} #t~post2 := ~v~0;~v~0 := 1 + #t~post2;havoc #t~post2; {23012#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:03:08,714 INFO L273 TraceCheckUtils]: 167: Hoare triple {23012#(<= 100000 ~SIZE~0)} assume true; {23012#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:03:08,715 INFO L273 TraceCheckUtils]: 168: Hoare triple {23012#(<= 100000 ~SIZE~0)} assume !!(~v~0 < ~SIZE~0);call #t~mem3 := read~int(~#values~0.base, ~#values~0.offset + 4 * ~v~0, 4); {23012#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:03:08,716 INFO L256 TraceCheckUtils]: 169: Hoare triple {23012#(<= 100000 ~SIZE~0)} call #t~ret4 := elem_exists(~#set~0.base, ~#set~0.offset, ~n~0, #t~mem3); {23012#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:03:08,716 INFO L273 TraceCheckUtils]: 170: Hoare triple {23012#(<= 100000 ~SIZE~0)} ~set.base, ~set.offset := #in~set.base, #in~set.offset;~size := #in~size;~value := #in~value;havoc ~i~0;~i~0 := 0; {23012#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:03:08,717 INFO L273 TraceCheckUtils]: 171: Hoare triple {23012#(<= 100000 ~SIZE~0)} assume true; {23012#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:03:08,717 INFO L273 TraceCheckUtils]: 172: Hoare triple {23012#(<= 100000 ~SIZE~0)} assume !!(~i~0 < ~size);call #t~mem1 := read~int(~set.base, ~set.offset + 4 * ~i~0, 4); {23012#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:03:08,718 INFO L273 TraceCheckUtils]: 173: Hoare triple {23012#(<= 100000 ~SIZE~0)} assume #t~mem1 == ~value;havoc #t~mem1;#res := 1; {23012#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:03:08,718 INFO L273 TraceCheckUtils]: 174: Hoare triple {23012#(<= 100000 ~SIZE~0)} assume true; {23012#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:03:08,720 INFO L268 TraceCheckUtils]: 175: Hoare quadruple {23012#(<= 100000 ~SIZE~0)} {23012#(<= 100000 ~SIZE~0)} #132#return; {23012#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:03:08,720 INFO L273 TraceCheckUtils]: 176: Hoare triple {23012#(<= 100000 ~SIZE~0)} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {23012#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:03:08,721 INFO L273 TraceCheckUtils]: 177: Hoare triple {23012#(<= 100000 ~SIZE~0)} assume !(1 != #t~ret4);havoc #t~mem3;havoc #t~ret4; {23012#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:03:08,721 INFO L273 TraceCheckUtils]: 178: Hoare triple {23012#(<= 100000 ~SIZE~0)} #t~post2 := ~v~0;~v~0 := 1 + #t~post2;havoc #t~post2; {23012#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:03:08,722 INFO L273 TraceCheckUtils]: 179: Hoare triple {23012#(<= 100000 ~SIZE~0)} assume true; {23012#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:03:08,722 INFO L273 TraceCheckUtils]: 180: Hoare triple {23012#(<= 100000 ~SIZE~0)} assume !!(~v~0 < ~SIZE~0);call #t~mem3 := read~int(~#values~0.base, ~#values~0.offset + 4 * ~v~0, 4); {23012#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:03:08,723 INFO L256 TraceCheckUtils]: 181: Hoare triple {23012#(<= 100000 ~SIZE~0)} call #t~ret4 := elem_exists(~#set~0.base, ~#set~0.offset, ~n~0, #t~mem3); {23012#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:03:08,724 INFO L273 TraceCheckUtils]: 182: Hoare triple {23012#(<= 100000 ~SIZE~0)} ~set.base, ~set.offset := #in~set.base, #in~set.offset;~size := #in~size;~value := #in~value;havoc ~i~0;~i~0 := 0; {23012#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:03:08,724 INFO L273 TraceCheckUtils]: 183: Hoare triple {23012#(<= 100000 ~SIZE~0)} assume true; {23012#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:03:08,725 INFO L273 TraceCheckUtils]: 184: Hoare triple {23012#(<= 100000 ~SIZE~0)} assume !!(~i~0 < ~size);call #t~mem1 := read~int(~set.base, ~set.offset + 4 * ~i~0, 4); {23012#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:03:08,725 INFO L273 TraceCheckUtils]: 185: Hoare triple {23012#(<= 100000 ~SIZE~0)} assume #t~mem1 == ~value;havoc #t~mem1;#res := 1; {23012#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:03:08,726 INFO L273 TraceCheckUtils]: 186: Hoare triple {23012#(<= 100000 ~SIZE~0)} assume true; {23012#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:03:08,727 INFO L268 TraceCheckUtils]: 187: Hoare quadruple {23012#(<= 100000 ~SIZE~0)} {23012#(<= 100000 ~SIZE~0)} #132#return; {23012#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:03:08,727 INFO L273 TraceCheckUtils]: 188: Hoare triple {23012#(<= 100000 ~SIZE~0)} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {23012#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:03:08,728 INFO L273 TraceCheckUtils]: 189: Hoare triple {23012#(<= 100000 ~SIZE~0)} assume !(1 != #t~ret4);havoc #t~mem3;havoc #t~ret4; {23012#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:03:08,728 INFO L273 TraceCheckUtils]: 190: Hoare triple {23012#(<= 100000 ~SIZE~0)} #t~post2 := ~v~0;~v~0 := 1 + #t~post2;havoc #t~post2; {23012#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:03:08,729 INFO L273 TraceCheckUtils]: 191: Hoare triple {23012#(<= 100000 ~SIZE~0)} assume true; {23012#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:03:08,729 INFO L273 TraceCheckUtils]: 192: Hoare triple {23012#(<= 100000 ~SIZE~0)} assume !(~v~0 < ~SIZE~0); {23012#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:03:08,730 INFO L273 TraceCheckUtils]: 193: Hoare triple {23012#(<= 100000 ~SIZE~0)} ~i~1 := 0; {23611#(and (<= main_~i~1 0) (<= 100000 ~SIZE~0))} is VALID [2018-11-18 23:03:08,731 INFO L273 TraceCheckUtils]: 194: Hoare triple {23611#(and (<= main_~i~1 0) (<= 100000 ~SIZE~0))} assume true; {23611#(and (<= main_~i~1 0) (<= 100000 ~SIZE~0))} is VALID [2018-11-18 23:03:08,731 INFO L273 TraceCheckUtils]: 195: Hoare triple {23611#(and (<= main_~i~1 0) (<= 100000 ~SIZE~0))} assume !!(~i~1 < ~SIZE~0 && 1 != ~found~0);call #t~mem8 := read~int(~#set~0.base, ~#set~0.offset + 4 * ~i~1, 4); {23611#(and (<= main_~i~1 0) (<= 100000 ~SIZE~0))} is VALID [2018-11-18 23:03:08,732 INFO L273 TraceCheckUtils]: 196: Hoare triple {23611#(and (<= main_~i~1 0) (<= 100000 ~SIZE~0))} assume !(#t~mem8 == ~element~0);havoc #t~mem8; {23611#(and (<= main_~i~1 0) (<= 100000 ~SIZE~0))} is VALID [2018-11-18 23:03:08,733 INFO L273 TraceCheckUtils]: 197: Hoare triple {23611#(and (<= main_~i~1 0) (<= 100000 ~SIZE~0))} #t~post7 := ~i~1;~i~1 := 1 + #t~post7;havoc #t~post7; {23624#(and (<= main_~i~1 1) (<= 100000 ~SIZE~0))} is VALID [2018-11-18 23:03:08,734 INFO L273 TraceCheckUtils]: 198: Hoare triple {23624#(and (<= main_~i~1 1) (<= 100000 ~SIZE~0))} assume true; {23624#(and (<= main_~i~1 1) (<= 100000 ~SIZE~0))} is VALID [2018-11-18 23:03:08,734 INFO L273 TraceCheckUtils]: 199: Hoare triple {23624#(and (<= main_~i~1 1) (<= 100000 ~SIZE~0))} assume !!(~i~1 < ~SIZE~0 && 1 != ~found~0);call #t~mem8 := read~int(~#set~0.base, ~#set~0.offset + 4 * ~i~1, 4); {23624#(and (<= main_~i~1 1) (<= 100000 ~SIZE~0))} is VALID [2018-11-18 23:03:08,735 INFO L273 TraceCheckUtils]: 200: Hoare triple {23624#(and (<= main_~i~1 1) (<= 100000 ~SIZE~0))} assume #t~mem8 == ~element~0;havoc #t~mem8;~found~0 := 1;~pos~0 := ~i~1; {23634#(and (<= main_~pos~0 1) (<= 100000 ~SIZE~0))} is VALID [2018-11-18 23:03:08,736 INFO L273 TraceCheckUtils]: 201: Hoare triple {23634#(and (<= main_~pos~0 1) (<= 100000 ~SIZE~0))} #t~post7 := ~i~1;~i~1 := 1 + #t~post7;havoc #t~post7; {23634#(and (<= main_~pos~0 1) (<= 100000 ~SIZE~0))} is VALID [2018-11-18 23:03:08,736 INFO L273 TraceCheckUtils]: 202: Hoare triple {23634#(and (<= main_~pos~0 1) (<= 100000 ~SIZE~0))} assume true; {23634#(and (<= main_~pos~0 1) (<= 100000 ~SIZE~0))} is VALID [2018-11-18 23:03:08,737 INFO L273 TraceCheckUtils]: 203: Hoare triple {23634#(and (<= main_~pos~0 1) (<= 100000 ~SIZE~0))} assume !(~i~1 < ~SIZE~0 && 1 != ~found~0); {23634#(and (<= main_~pos~0 1) (<= 100000 ~SIZE~0))} is VALID [2018-11-18 23:03:08,738 INFO L273 TraceCheckUtils]: 204: Hoare triple {23634#(and (<= main_~pos~0 1) (<= 100000 ~SIZE~0))} assume 1 == ~found~0;~i~1 := ~pos~0; {23624#(and (<= main_~i~1 1) (<= 100000 ~SIZE~0))} is VALID [2018-11-18 23:03:08,738 INFO L273 TraceCheckUtils]: 205: Hoare triple {23624#(and (<= main_~i~1 1) (<= 100000 ~SIZE~0))} assume true; {23624#(and (<= main_~i~1 1) (<= 100000 ~SIZE~0))} is VALID [2018-11-18 23:03:08,739 INFO L273 TraceCheckUtils]: 206: Hoare triple {23624#(and (<= main_~i~1 1) (<= 100000 ~SIZE~0))} assume !!(~i~1 < ~SIZE~0 - 1);call #t~mem10 := read~int(~#set~0.base, ~#set~0.offset + 4 * (1 + ~i~1), 4);call write~int(#t~mem10, ~#set~0.base, ~#set~0.offset + 4 * ~i~1, 4);havoc #t~mem10; {23624#(and (<= main_~i~1 1) (<= 100000 ~SIZE~0))} is VALID [2018-11-18 23:03:08,740 INFO L273 TraceCheckUtils]: 207: Hoare triple {23624#(and (<= main_~i~1 1) (<= 100000 ~SIZE~0))} #t~post9 := ~i~1;~i~1 := 1 + #t~post9;havoc #t~post9; {23656#(and (<= main_~i~1 2) (<= 100000 ~SIZE~0))} is VALID [2018-11-18 23:03:08,741 INFO L273 TraceCheckUtils]: 208: Hoare triple {23656#(and (<= main_~i~1 2) (<= 100000 ~SIZE~0))} assume true; {23656#(and (<= main_~i~1 2) (<= 100000 ~SIZE~0))} is VALID [2018-11-18 23:03:08,742 INFO L273 TraceCheckUtils]: 209: Hoare triple {23656#(and (<= main_~i~1 2) (<= 100000 ~SIZE~0))} assume !!(~i~1 < ~SIZE~0 - 1);call #t~mem10 := read~int(~#set~0.base, ~#set~0.offset + 4 * (1 + ~i~1), 4);call write~int(#t~mem10, ~#set~0.base, ~#set~0.offset + 4 * ~i~1, 4);havoc #t~mem10; {23656#(and (<= main_~i~1 2) (<= 100000 ~SIZE~0))} is VALID [2018-11-18 23:03:08,742 INFO L273 TraceCheckUtils]: 210: Hoare triple {23656#(and (<= main_~i~1 2) (<= 100000 ~SIZE~0))} #t~post9 := ~i~1;~i~1 := 1 + #t~post9;havoc #t~post9; {23666#(and (<= main_~i~1 3) (<= 100000 ~SIZE~0))} is VALID [2018-11-18 23:03:08,743 INFO L273 TraceCheckUtils]: 211: Hoare triple {23666#(and (<= main_~i~1 3) (<= 100000 ~SIZE~0))} assume true; {23666#(and (<= main_~i~1 3) (<= 100000 ~SIZE~0))} is VALID [2018-11-18 23:03:08,744 INFO L273 TraceCheckUtils]: 212: Hoare triple {23666#(and (<= main_~i~1 3) (<= 100000 ~SIZE~0))} assume !!(~i~1 < ~SIZE~0 - 1);call #t~mem10 := read~int(~#set~0.base, ~#set~0.offset + 4 * (1 + ~i~1), 4);call write~int(#t~mem10, ~#set~0.base, ~#set~0.offset + 4 * ~i~1, 4);havoc #t~mem10; {23666#(and (<= main_~i~1 3) (<= 100000 ~SIZE~0))} is VALID [2018-11-18 23:03:08,745 INFO L273 TraceCheckUtils]: 213: Hoare triple {23666#(and (<= main_~i~1 3) (<= 100000 ~SIZE~0))} #t~post9 := ~i~1;~i~1 := 1 + #t~post9;havoc #t~post9; {23676#(and (<= main_~i~1 4) (<= 100000 ~SIZE~0))} is VALID [2018-11-18 23:03:08,745 INFO L273 TraceCheckUtils]: 214: Hoare triple {23676#(and (<= main_~i~1 4) (<= 100000 ~SIZE~0))} assume true; {23676#(and (<= main_~i~1 4) (<= 100000 ~SIZE~0))} is VALID [2018-11-18 23:03:08,746 INFO L273 TraceCheckUtils]: 215: Hoare triple {23676#(and (<= main_~i~1 4) (<= 100000 ~SIZE~0))} assume !(~i~1 < ~SIZE~0 - 1); {23011#false} is VALID [2018-11-18 23:03:08,746 INFO L273 TraceCheckUtils]: 216: Hoare triple {23011#false} assume 1 == ~found~0;~i~1 := 0; {23011#false} is VALID [2018-11-18 23:03:08,746 INFO L273 TraceCheckUtils]: 217: Hoare triple {23011#false} assume true; {23011#false} is VALID [2018-11-18 23:03:08,747 INFO L273 TraceCheckUtils]: 218: Hoare triple {23011#false} assume !!(~i~1 < ~SIZE~0 - 1);call #t~mem12 := read~int(~#set~0.base, ~#set~0.offset + 4 * ~i~1, 4); {23011#false} is VALID [2018-11-18 23:03:08,747 INFO L256 TraceCheckUtils]: 219: Hoare triple {23011#false} call __VERIFIER_assert((if #t~mem12 != ~element~0 then 1 else 0)); {23011#false} is VALID [2018-11-18 23:03:08,747 INFO L273 TraceCheckUtils]: 220: Hoare triple {23011#false} ~cond := #in~cond; {23011#false} is VALID [2018-11-18 23:03:08,747 INFO L273 TraceCheckUtils]: 221: Hoare triple {23011#false} assume 0 == ~cond; {23011#false} is VALID [2018-11-18 23:03:08,747 INFO L273 TraceCheckUtils]: 222: Hoare triple {23011#false} assume !false; {23011#false} is VALID [2018-11-18 23:03:08,781 INFO L134 CoverageAnalysis]: Checked inductivity of 1299 backedges. 0 proven. 23 refuted. 0 times theorem prover too weak. 1276 trivial. 0 not checked. [2018-11-18 23:03:08,800 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-18 23:03:08,800 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 9] total 25 [2018-11-18 23:03:08,801 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 223 [2018-11-18 23:03:08,801 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-18 23:03:08,801 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 25 states. [2018-11-18 23:03:08,984 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 189 edges. 189 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 23:03:08,985 INFO L459 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-11-18 23:03:08,985 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-11-18 23:03:08,985 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=184, Invalid=416, Unknown=0, NotChecked=0, Total=600 [2018-11-18 23:03:08,986 INFO L87 Difference]: Start difference. First operand 245 states and 323 transitions. Second operand 25 states. [2018-11-18 23:03:15,971 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 23:03:15,972 INFO L93 Difference]: Finished difference Result 424 states and 534 transitions. [2018-11-18 23:03:15,972 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-11-18 23:03:15,972 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 223 [2018-11-18 23:03:15,972 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 23:03:15,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2018-11-18 23:03:15,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 374 transitions. [2018-11-18 23:03:15,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2018-11-18 23:03:15,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 374 transitions. [2018-11-18 23:03:15,980 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 30 states and 374 transitions. [2018-11-18 23:03:16,416 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 374 edges. 374 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 23:03:16,425 INFO L225 Difference]: With dead ends: 424 [2018-11-18 23:03:16,425 INFO L226 Difference]: Without dead ends: 353 [2018-11-18 23:03:16,426 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 261 GetRequests, 218 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 296 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=514, Invalid=1466, Unknown=0, NotChecked=0, Total=1980 [2018-11-18 23:03:16,426 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 353 states. [2018-11-18 23:03:17,321 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 353 to 255. [2018-11-18 23:03:17,321 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-18 23:03:17,321 INFO L82 GeneralOperation]: Start isEquivalent. First operand 353 states. Second operand 255 states. [2018-11-18 23:03:17,321 INFO L74 IsIncluded]: Start isIncluded. First operand 353 states. Second operand 255 states. [2018-11-18 23:03:17,322 INFO L87 Difference]: Start difference. First operand 353 states. Second operand 255 states. [2018-11-18 23:03:17,330 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 23:03:17,330 INFO L93 Difference]: Finished difference Result 353 states and 455 transitions. [2018-11-18 23:03:17,330 INFO L276 IsEmpty]: Start isEmpty. Operand 353 states and 455 transitions. [2018-11-18 23:03:17,331 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 23:03:17,331 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 23:03:17,331 INFO L74 IsIncluded]: Start isIncluded. First operand 255 states. Second operand 353 states. [2018-11-18 23:03:17,332 INFO L87 Difference]: Start difference. First operand 255 states. Second operand 353 states. [2018-11-18 23:03:17,342 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 23:03:17,343 INFO L93 Difference]: Finished difference Result 353 states and 455 transitions. [2018-11-18 23:03:17,343 INFO L276 IsEmpty]: Start isEmpty. Operand 353 states and 455 transitions. [2018-11-18 23:03:17,344 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 23:03:17,344 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 23:03:17,344 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-18 23:03:17,345 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-18 23:03:17,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 255 states. [2018-11-18 23:03:17,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 255 states to 255 states and 338 transitions. [2018-11-18 23:03:17,352 INFO L78 Accepts]: Start accepts. Automaton has 255 states and 338 transitions. Word has length 223 [2018-11-18 23:03:17,352 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 23:03:17,353 INFO L480 AbstractCegarLoop]: Abstraction has 255 states and 338 transitions. [2018-11-18 23:03:17,353 INFO L481 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-11-18 23:03:17,353 INFO L276 IsEmpty]: Start isEmpty. Operand 255 states and 338 transitions. [2018-11-18 23:03:17,354 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 237 [2018-11-18 23:03:17,355 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 23:03:17,355 INFO L375 BasicCegarLoop]: trace histogram [17, 16, 16, 16, 16, 16, 16, 16, 16, 15, 15, 15, 4, 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 23:03:17,355 INFO L423 AbstractCegarLoop]: === Iteration 23 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 23:03:17,355 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 23:03:17,355 INFO L82 PathProgramCache]: Analyzing trace with hash -1338744165, now seen corresponding path program 7 times [2018-11-18 23:03:17,356 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 23:03:17,356 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 23:03:17,356 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 23:03:17,356 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 23:03:17,357 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 23:03:17,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 23:03:19,302 INFO L256 TraceCheckUtils]: 0: Hoare triple {25339#true} call ULTIMATE.init(); {25339#true} is VALID [2018-11-18 23:03:19,303 INFO L273 TraceCheckUtils]: 1: Hoare triple {25339#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~SIZE~0 := 100000; {25341#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:03:19,304 INFO L273 TraceCheckUtils]: 2: Hoare triple {25341#(<= 100000 ~SIZE~0)} assume true; {25341#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:03:19,304 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {25341#(<= 100000 ~SIZE~0)} {25339#true} #128#return; {25341#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:03:19,305 INFO L256 TraceCheckUtils]: 4: Hoare triple {25341#(<= 100000 ~SIZE~0)} call #t~ret13 := main(); {25341#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:03:19,306 INFO L273 TraceCheckUtils]: 5: Hoare triple {25341#(<= 100000 ~SIZE~0)} havoc ~i~1;havoc ~pos~0;~n~0 := 0;~found~0 := 0;call ~#set~0.base, ~#set~0.offset := #Ultimate.alloc(4 * ~SIZE~0);call ~#values~0.base, ~#values~0.offset := #Ultimate.alloc(4 * ~SIZE~0);havoc ~element~0;havoc ~v~0;~v~0 := 0; {25342#(and (= main_~v~0 0) (<= 100000 ~SIZE~0))} is VALID [2018-11-18 23:03:19,307 INFO L273 TraceCheckUtils]: 6: Hoare triple {25342#(and (= main_~v~0 0) (<= 100000 ~SIZE~0))} assume true; {25342#(and (= main_~v~0 0) (<= 100000 ~SIZE~0))} is VALID [2018-11-18 23:03:19,307 INFO L273 TraceCheckUtils]: 7: Hoare triple {25342#(and (= main_~v~0 0) (<= 100000 ~SIZE~0))} assume !!(~v~0 < ~SIZE~0);call #t~mem3 := read~int(~#values~0.base, ~#values~0.offset + 4 * ~v~0, 4); {25342#(and (= main_~v~0 0) (<= 100000 ~SIZE~0))} is VALID [2018-11-18 23:03:19,307 INFO L256 TraceCheckUtils]: 8: Hoare triple {25342#(and (= main_~v~0 0) (<= 100000 ~SIZE~0))} call #t~ret4 := elem_exists(~#set~0.base, ~#set~0.offset, ~n~0, #t~mem3); {25339#true} is VALID [2018-11-18 23:03:19,308 INFO L273 TraceCheckUtils]: 9: Hoare triple {25339#true} ~set.base, ~set.offset := #in~set.base, #in~set.offset;~size := #in~size;~value := #in~value;havoc ~i~0;~i~0 := 0; {25339#true} is VALID [2018-11-18 23:03:19,308 INFO L273 TraceCheckUtils]: 10: Hoare triple {25339#true} assume true; {25339#true} is VALID [2018-11-18 23:03:19,308 INFO L273 TraceCheckUtils]: 11: Hoare triple {25339#true} assume !(~i~0 < ~size); {25339#true} is VALID [2018-11-18 23:03:19,308 INFO L273 TraceCheckUtils]: 12: Hoare triple {25339#true} #res := 0; {25339#true} is VALID [2018-11-18 23:03:19,308 INFO L273 TraceCheckUtils]: 13: Hoare triple {25339#true} assume true; {25339#true} is VALID [2018-11-18 23:03:19,309 INFO L268 TraceCheckUtils]: 14: Hoare quadruple {25339#true} {25342#(and (= main_~v~0 0) (<= 100000 ~SIZE~0))} #132#return; {25342#(and (= main_~v~0 0) (<= 100000 ~SIZE~0))} is VALID [2018-11-18 23:03:19,310 INFO L273 TraceCheckUtils]: 15: Hoare triple {25342#(and (= main_~v~0 0) (<= 100000 ~SIZE~0))} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {25342#(and (= main_~v~0 0) (<= 100000 ~SIZE~0))} is VALID [2018-11-18 23:03:19,310 INFO L273 TraceCheckUtils]: 16: Hoare triple {25342#(and (= main_~v~0 0) (<= 100000 ~SIZE~0))} assume 1 != #t~ret4;havoc #t~mem3;havoc #t~ret4;call #t~mem5 := read~int(~#values~0.base, ~#values~0.offset + 4 * ~v~0, 4); {25342#(and (= main_~v~0 0) (<= 100000 ~SIZE~0))} is VALID [2018-11-18 23:03:19,311 INFO L256 TraceCheckUtils]: 17: Hoare triple {25342#(and (= main_~v~0 0) (<= 100000 ~SIZE~0))} call #t~ret6 := insert(~#set~0.base, ~#set~0.offset, ~n~0, #t~mem5); {25339#true} is VALID [2018-11-18 23:03:19,311 INFO L273 TraceCheckUtils]: 18: Hoare triple {25339#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; {25339#true} is VALID [2018-11-18 23:03:19,311 INFO L273 TraceCheckUtils]: 19: Hoare triple {25339#true} assume true; {25339#true} is VALID [2018-11-18 23:03:19,313 INFO L268 TraceCheckUtils]: 20: Hoare quadruple {25339#true} {25342#(and (= main_~v~0 0) (<= 100000 ~SIZE~0))} #134#return; {25342#(and (= main_~v~0 0) (<= 100000 ~SIZE~0))} is VALID [2018-11-18 23:03:19,313 INFO L273 TraceCheckUtils]: 21: Hoare triple {25342#(and (= main_~v~0 0) (<= 100000 ~SIZE~0))} assume -2147483648 <= #t~ret6 && #t~ret6 <= 2147483647;~n~0 := #t~ret6;havoc #t~ret6;havoc #t~mem5; {25342#(and (= main_~v~0 0) (<= 100000 ~SIZE~0))} is VALID [2018-11-18 23:03:19,314 INFO L273 TraceCheckUtils]: 22: Hoare triple {25342#(and (= main_~v~0 0) (<= 100000 ~SIZE~0))} #t~post2 := ~v~0;~v~0 := 1 + #t~post2;havoc #t~post2; {25343#(<= (+ main_~v~0 99999) ~SIZE~0)} is VALID [2018-11-18 23:03:19,315 INFO L273 TraceCheckUtils]: 23: Hoare triple {25343#(<= (+ main_~v~0 99999) ~SIZE~0)} assume true; {25343#(<= (+ main_~v~0 99999) ~SIZE~0)} is VALID [2018-11-18 23:03:19,315 INFO L273 TraceCheckUtils]: 24: Hoare triple {25343#(<= (+ main_~v~0 99999) ~SIZE~0)} assume !!(~v~0 < ~SIZE~0);call #t~mem3 := read~int(~#values~0.base, ~#values~0.offset + 4 * ~v~0, 4); {25343#(<= (+ main_~v~0 99999) ~SIZE~0)} is VALID [2018-11-18 23:03:19,315 INFO L256 TraceCheckUtils]: 25: Hoare triple {25343#(<= (+ main_~v~0 99999) ~SIZE~0)} call #t~ret4 := elem_exists(~#set~0.base, ~#set~0.offset, ~n~0, #t~mem3); {25339#true} is VALID [2018-11-18 23:03:19,316 INFO L273 TraceCheckUtils]: 26: Hoare triple {25339#true} ~set.base, ~set.offset := #in~set.base, #in~set.offset;~size := #in~size;~value := #in~value;havoc ~i~0;~i~0 := 0; {25339#true} is VALID [2018-11-18 23:03:19,316 INFO L273 TraceCheckUtils]: 27: Hoare triple {25339#true} assume true; {25339#true} is VALID [2018-11-18 23:03:19,316 INFO L273 TraceCheckUtils]: 28: Hoare triple {25339#true} assume !!(~i~0 < ~size);call #t~mem1 := read~int(~set.base, ~set.offset + 4 * ~i~0, 4); {25339#true} is VALID [2018-11-18 23:03:19,316 INFO L273 TraceCheckUtils]: 29: Hoare triple {25339#true} assume #t~mem1 == ~value;havoc #t~mem1;#res := 1; {25339#true} is VALID [2018-11-18 23:03:19,316 INFO L273 TraceCheckUtils]: 30: Hoare triple {25339#true} assume true; {25339#true} is VALID [2018-11-18 23:03:19,318 INFO L268 TraceCheckUtils]: 31: Hoare quadruple {25339#true} {25343#(<= (+ main_~v~0 99999) ~SIZE~0)} #132#return; {25343#(<= (+ main_~v~0 99999) ~SIZE~0)} is VALID [2018-11-18 23:03:19,319 INFO L273 TraceCheckUtils]: 32: Hoare triple {25343#(<= (+ main_~v~0 99999) ~SIZE~0)} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {25343#(<= (+ main_~v~0 99999) ~SIZE~0)} is VALID [2018-11-18 23:03:19,319 INFO L273 TraceCheckUtils]: 33: Hoare triple {25343#(<= (+ main_~v~0 99999) ~SIZE~0)} assume !(1 != #t~ret4);havoc #t~mem3;havoc #t~ret4; {25343#(<= (+ main_~v~0 99999) ~SIZE~0)} is VALID [2018-11-18 23:03:19,320 INFO L273 TraceCheckUtils]: 34: Hoare triple {25343#(<= (+ main_~v~0 99999) ~SIZE~0)} #t~post2 := ~v~0;~v~0 := 1 + #t~post2;havoc #t~post2; {25344#(<= (+ main_~v~0 99998) ~SIZE~0)} is VALID [2018-11-18 23:03:19,321 INFO L273 TraceCheckUtils]: 35: Hoare triple {25344#(<= (+ main_~v~0 99998) ~SIZE~0)} assume true; {25344#(<= (+ main_~v~0 99998) ~SIZE~0)} is VALID [2018-11-18 23:03:19,321 INFO L273 TraceCheckUtils]: 36: Hoare triple {25344#(<= (+ main_~v~0 99998) ~SIZE~0)} assume !!(~v~0 < ~SIZE~0);call #t~mem3 := read~int(~#values~0.base, ~#values~0.offset + 4 * ~v~0, 4); {25344#(<= (+ main_~v~0 99998) ~SIZE~0)} is VALID [2018-11-18 23:03:19,321 INFO L256 TraceCheckUtils]: 37: Hoare triple {25344#(<= (+ main_~v~0 99998) ~SIZE~0)} call #t~ret4 := elem_exists(~#set~0.base, ~#set~0.offset, ~n~0, #t~mem3); {25339#true} is VALID [2018-11-18 23:03:19,322 INFO L273 TraceCheckUtils]: 38: Hoare triple {25339#true} ~set.base, ~set.offset := #in~set.base, #in~set.offset;~size := #in~size;~value := #in~value;havoc ~i~0;~i~0 := 0; {25339#true} is VALID [2018-11-18 23:03:19,322 INFO L273 TraceCheckUtils]: 39: Hoare triple {25339#true} assume true; {25339#true} is VALID [2018-11-18 23:03:19,322 INFO L273 TraceCheckUtils]: 40: Hoare triple {25339#true} assume !!(~i~0 < ~size);call #t~mem1 := read~int(~set.base, ~set.offset + 4 * ~i~0, 4); {25339#true} is VALID [2018-11-18 23:03:19,322 INFO L273 TraceCheckUtils]: 41: Hoare triple {25339#true} assume #t~mem1 == ~value;havoc #t~mem1;#res := 1; {25339#true} is VALID [2018-11-18 23:03:19,322 INFO L273 TraceCheckUtils]: 42: Hoare triple {25339#true} assume true; {25339#true} is VALID [2018-11-18 23:03:19,324 INFO L268 TraceCheckUtils]: 43: Hoare quadruple {25339#true} {25344#(<= (+ main_~v~0 99998) ~SIZE~0)} #132#return; {25344#(<= (+ main_~v~0 99998) ~SIZE~0)} is VALID [2018-11-18 23:03:19,325 INFO L273 TraceCheckUtils]: 44: Hoare triple {25344#(<= (+ main_~v~0 99998) ~SIZE~0)} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {25344#(<= (+ main_~v~0 99998) ~SIZE~0)} is VALID [2018-11-18 23:03:19,325 INFO L273 TraceCheckUtils]: 45: Hoare triple {25344#(<= (+ main_~v~0 99998) ~SIZE~0)} assume !(1 != #t~ret4);havoc #t~mem3;havoc #t~ret4; {25344#(<= (+ main_~v~0 99998) ~SIZE~0)} is VALID [2018-11-18 23:03:19,326 INFO L273 TraceCheckUtils]: 46: Hoare triple {25344#(<= (+ main_~v~0 99998) ~SIZE~0)} #t~post2 := ~v~0;~v~0 := 1 + #t~post2;havoc #t~post2; {25345#(<= (+ main_~v~0 99997) ~SIZE~0)} is VALID [2018-11-18 23:03:19,327 INFO L273 TraceCheckUtils]: 47: Hoare triple {25345#(<= (+ main_~v~0 99997) ~SIZE~0)} assume true; {25345#(<= (+ main_~v~0 99997) ~SIZE~0)} is VALID [2018-11-18 23:03:19,327 INFO L273 TraceCheckUtils]: 48: Hoare triple {25345#(<= (+ main_~v~0 99997) ~SIZE~0)} assume !!(~v~0 < ~SIZE~0);call #t~mem3 := read~int(~#values~0.base, ~#values~0.offset + 4 * ~v~0, 4); {25345#(<= (+ main_~v~0 99997) ~SIZE~0)} is VALID [2018-11-18 23:03:19,328 INFO L256 TraceCheckUtils]: 49: Hoare triple {25345#(<= (+ main_~v~0 99997) ~SIZE~0)} call #t~ret4 := elem_exists(~#set~0.base, ~#set~0.offset, ~n~0, #t~mem3); {25339#true} is VALID [2018-11-18 23:03:19,328 INFO L273 TraceCheckUtils]: 50: Hoare triple {25339#true} ~set.base, ~set.offset := #in~set.base, #in~set.offset;~size := #in~size;~value := #in~value;havoc ~i~0;~i~0 := 0; {25339#true} is VALID [2018-11-18 23:03:19,328 INFO L273 TraceCheckUtils]: 51: Hoare triple {25339#true} assume true; {25339#true} is VALID [2018-11-18 23:03:19,328 INFO L273 TraceCheckUtils]: 52: Hoare triple {25339#true} assume !!(~i~0 < ~size);call #t~mem1 := read~int(~set.base, ~set.offset + 4 * ~i~0, 4); {25339#true} is VALID [2018-11-18 23:03:19,328 INFO L273 TraceCheckUtils]: 53: Hoare triple {25339#true} assume #t~mem1 == ~value;havoc #t~mem1;#res := 1; {25339#true} is VALID [2018-11-18 23:03:19,328 INFO L273 TraceCheckUtils]: 54: Hoare triple {25339#true} assume true; {25339#true} is VALID [2018-11-18 23:03:19,330 INFO L268 TraceCheckUtils]: 55: Hoare quadruple {25339#true} {25345#(<= (+ main_~v~0 99997) ~SIZE~0)} #132#return; {25345#(<= (+ main_~v~0 99997) ~SIZE~0)} is VALID [2018-11-18 23:03:19,331 INFO L273 TraceCheckUtils]: 56: Hoare triple {25345#(<= (+ main_~v~0 99997) ~SIZE~0)} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {25345#(<= (+ main_~v~0 99997) ~SIZE~0)} is VALID [2018-11-18 23:03:19,331 INFO L273 TraceCheckUtils]: 57: Hoare triple {25345#(<= (+ main_~v~0 99997) ~SIZE~0)} assume !(1 != #t~ret4);havoc #t~mem3;havoc #t~ret4; {25345#(<= (+ main_~v~0 99997) ~SIZE~0)} is VALID [2018-11-18 23:03:19,332 INFO L273 TraceCheckUtils]: 58: Hoare triple {25345#(<= (+ main_~v~0 99997) ~SIZE~0)} #t~post2 := ~v~0;~v~0 := 1 + #t~post2;havoc #t~post2; {25346#(<= (+ main_~v~0 99996) ~SIZE~0)} is VALID [2018-11-18 23:03:19,333 INFO L273 TraceCheckUtils]: 59: Hoare triple {25346#(<= (+ main_~v~0 99996) ~SIZE~0)} assume true; {25346#(<= (+ main_~v~0 99996) ~SIZE~0)} is VALID [2018-11-18 23:03:19,333 INFO L273 TraceCheckUtils]: 60: Hoare triple {25346#(<= (+ main_~v~0 99996) ~SIZE~0)} assume !!(~v~0 < ~SIZE~0);call #t~mem3 := read~int(~#values~0.base, ~#values~0.offset + 4 * ~v~0, 4); {25346#(<= (+ main_~v~0 99996) ~SIZE~0)} is VALID [2018-11-18 23:03:19,334 INFO L256 TraceCheckUtils]: 61: Hoare triple {25346#(<= (+ main_~v~0 99996) ~SIZE~0)} call #t~ret4 := elem_exists(~#set~0.base, ~#set~0.offset, ~n~0, #t~mem3); {25339#true} is VALID [2018-11-18 23:03:19,334 INFO L273 TraceCheckUtils]: 62: Hoare triple {25339#true} ~set.base, ~set.offset := #in~set.base, #in~set.offset;~size := #in~size;~value := #in~value;havoc ~i~0;~i~0 := 0; {25339#true} is VALID [2018-11-18 23:03:19,334 INFO L273 TraceCheckUtils]: 63: Hoare triple {25339#true} assume true; {25339#true} is VALID [2018-11-18 23:03:19,334 INFO L273 TraceCheckUtils]: 64: Hoare triple {25339#true} assume !!(~i~0 < ~size);call #t~mem1 := read~int(~set.base, ~set.offset + 4 * ~i~0, 4); {25339#true} is VALID [2018-11-18 23:03:19,334 INFO L273 TraceCheckUtils]: 65: Hoare triple {25339#true} assume #t~mem1 == ~value;havoc #t~mem1;#res := 1; {25339#true} is VALID [2018-11-18 23:03:19,335 INFO L273 TraceCheckUtils]: 66: Hoare triple {25339#true} assume true; {25339#true} is VALID [2018-11-18 23:03:19,336 INFO L268 TraceCheckUtils]: 67: Hoare quadruple {25339#true} {25346#(<= (+ main_~v~0 99996) ~SIZE~0)} #132#return; {25346#(<= (+ main_~v~0 99996) ~SIZE~0)} is VALID [2018-11-18 23:03:19,337 INFO L273 TraceCheckUtils]: 68: Hoare triple {25346#(<= (+ main_~v~0 99996) ~SIZE~0)} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {25346#(<= (+ main_~v~0 99996) ~SIZE~0)} is VALID [2018-11-18 23:03:19,337 INFO L273 TraceCheckUtils]: 69: Hoare triple {25346#(<= (+ main_~v~0 99996) ~SIZE~0)} assume !(1 != #t~ret4);havoc #t~mem3;havoc #t~ret4; {25346#(<= (+ main_~v~0 99996) ~SIZE~0)} is VALID [2018-11-18 23:03:19,338 INFO L273 TraceCheckUtils]: 70: Hoare triple {25346#(<= (+ main_~v~0 99996) ~SIZE~0)} #t~post2 := ~v~0;~v~0 := 1 + #t~post2;havoc #t~post2; {25347#(<= (+ main_~v~0 99995) ~SIZE~0)} is VALID [2018-11-18 23:03:19,338 INFO L273 TraceCheckUtils]: 71: Hoare triple {25347#(<= (+ main_~v~0 99995) ~SIZE~0)} assume true; {25347#(<= (+ main_~v~0 99995) ~SIZE~0)} is VALID [2018-11-18 23:03:19,338 INFO L273 TraceCheckUtils]: 72: Hoare triple {25347#(<= (+ main_~v~0 99995) ~SIZE~0)} assume !!(~v~0 < ~SIZE~0);call #t~mem3 := read~int(~#values~0.base, ~#values~0.offset + 4 * ~v~0, 4); {25347#(<= (+ main_~v~0 99995) ~SIZE~0)} is VALID [2018-11-18 23:03:19,339 INFO L256 TraceCheckUtils]: 73: Hoare triple {25347#(<= (+ main_~v~0 99995) ~SIZE~0)} call #t~ret4 := elem_exists(~#set~0.base, ~#set~0.offset, ~n~0, #t~mem3); {25339#true} is VALID [2018-11-18 23:03:19,339 INFO L273 TraceCheckUtils]: 74: Hoare triple {25339#true} ~set.base, ~set.offset := #in~set.base, #in~set.offset;~size := #in~size;~value := #in~value;havoc ~i~0;~i~0 := 0; {25339#true} is VALID [2018-11-18 23:03:19,339 INFO L273 TraceCheckUtils]: 75: Hoare triple {25339#true} assume true; {25339#true} is VALID [2018-11-18 23:03:19,339 INFO L273 TraceCheckUtils]: 76: Hoare triple {25339#true} assume !!(~i~0 < ~size);call #t~mem1 := read~int(~set.base, ~set.offset + 4 * ~i~0, 4); {25339#true} is VALID [2018-11-18 23:03:19,339 INFO L273 TraceCheckUtils]: 77: Hoare triple {25339#true} assume #t~mem1 == ~value;havoc #t~mem1;#res := 1; {25339#true} is VALID [2018-11-18 23:03:19,340 INFO L273 TraceCheckUtils]: 78: Hoare triple {25339#true} assume true; {25339#true} is VALID [2018-11-18 23:03:19,341 INFO L268 TraceCheckUtils]: 79: Hoare quadruple {25339#true} {25347#(<= (+ main_~v~0 99995) ~SIZE~0)} #132#return; {25347#(<= (+ main_~v~0 99995) ~SIZE~0)} is VALID [2018-11-18 23:03:19,342 INFO L273 TraceCheckUtils]: 80: Hoare triple {25347#(<= (+ main_~v~0 99995) ~SIZE~0)} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {25347#(<= (+ main_~v~0 99995) ~SIZE~0)} is VALID [2018-11-18 23:03:19,342 INFO L273 TraceCheckUtils]: 81: Hoare triple {25347#(<= (+ main_~v~0 99995) ~SIZE~0)} assume !(1 != #t~ret4);havoc #t~mem3;havoc #t~ret4; {25347#(<= (+ main_~v~0 99995) ~SIZE~0)} is VALID [2018-11-18 23:03:19,343 INFO L273 TraceCheckUtils]: 82: Hoare triple {25347#(<= (+ main_~v~0 99995) ~SIZE~0)} #t~post2 := ~v~0;~v~0 := 1 + #t~post2;havoc #t~post2; {25348#(<= (+ main_~v~0 99994) ~SIZE~0)} is VALID [2018-11-18 23:03:19,343 INFO L273 TraceCheckUtils]: 83: Hoare triple {25348#(<= (+ main_~v~0 99994) ~SIZE~0)} assume true; {25348#(<= (+ main_~v~0 99994) ~SIZE~0)} is VALID [2018-11-18 23:03:19,343 INFO L273 TraceCheckUtils]: 84: Hoare triple {25348#(<= (+ main_~v~0 99994) ~SIZE~0)} assume !!(~v~0 < ~SIZE~0);call #t~mem3 := read~int(~#values~0.base, ~#values~0.offset + 4 * ~v~0, 4); {25348#(<= (+ main_~v~0 99994) ~SIZE~0)} is VALID [2018-11-18 23:03:19,344 INFO L256 TraceCheckUtils]: 85: Hoare triple {25348#(<= (+ main_~v~0 99994) ~SIZE~0)} call #t~ret4 := elem_exists(~#set~0.base, ~#set~0.offset, ~n~0, #t~mem3); {25339#true} is VALID [2018-11-18 23:03:19,344 INFO L273 TraceCheckUtils]: 86: Hoare triple {25339#true} ~set.base, ~set.offset := #in~set.base, #in~set.offset;~size := #in~size;~value := #in~value;havoc ~i~0;~i~0 := 0; {25339#true} is VALID [2018-11-18 23:03:19,344 INFO L273 TraceCheckUtils]: 87: Hoare triple {25339#true} assume true; {25339#true} is VALID [2018-11-18 23:03:19,344 INFO L273 TraceCheckUtils]: 88: Hoare triple {25339#true} assume !!(~i~0 < ~size);call #t~mem1 := read~int(~set.base, ~set.offset + 4 * ~i~0, 4); {25339#true} is VALID [2018-11-18 23:03:19,344 INFO L273 TraceCheckUtils]: 89: Hoare triple {25339#true} assume #t~mem1 == ~value;havoc #t~mem1;#res := 1; {25339#true} is VALID [2018-11-18 23:03:19,345 INFO L273 TraceCheckUtils]: 90: Hoare triple {25339#true} assume true; {25339#true} is VALID [2018-11-18 23:03:19,346 INFO L268 TraceCheckUtils]: 91: Hoare quadruple {25339#true} {25348#(<= (+ main_~v~0 99994) ~SIZE~0)} #132#return; {25348#(<= (+ main_~v~0 99994) ~SIZE~0)} is VALID [2018-11-18 23:03:19,347 INFO L273 TraceCheckUtils]: 92: Hoare triple {25348#(<= (+ main_~v~0 99994) ~SIZE~0)} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {25348#(<= (+ main_~v~0 99994) ~SIZE~0)} is VALID [2018-11-18 23:03:19,347 INFO L273 TraceCheckUtils]: 93: Hoare triple {25348#(<= (+ main_~v~0 99994) ~SIZE~0)} assume !(1 != #t~ret4);havoc #t~mem3;havoc #t~ret4; {25348#(<= (+ main_~v~0 99994) ~SIZE~0)} is VALID [2018-11-18 23:03:19,347 INFO L273 TraceCheckUtils]: 94: Hoare triple {25348#(<= (+ main_~v~0 99994) ~SIZE~0)} #t~post2 := ~v~0;~v~0 := 1 + #t~post2;havoc #t~post2; {25349#(<= (+ main_~v~0 99993) ~SIZE~0)} is VALID [2018-11-18 23:03:19,348 INFO L273 TraceCheckUtils]: 95: Hoare triple {25349#(<= (+ main_~v~0 99993) ~SIZE~0)} assume true; {25349#(<= (+ main_~v~0 99993) ~SIZE~0)} is VALID [2018-11-18 23:03:19,348 INFO L273 TraceCheckUtils]: 96: Hoare triple {25349#(<= (+ main_~v~0 99993) ~SIZE~0)} assume !!(~v~0 < ~SIZE~0);call #t~mem3 := read~int(~#values~0.base, ~#values~0.offset + 4 * ~v~0, 4); {25349#(<= (+ main_~v~0 99993) ~SIZE~0)} is VALID [2018-11-18 23:03:19,348 INFO L256 TraceCheckUtils]: 97: Hoare triple {25349#(<= (+ main_~v~0 99993) ~SIZE~0)} call #t~ret4 := elem_exists(~#set~0.base, ~#set~0.offset, ~n~0, #t~mem3); {25339#true} is VALID [2018-11-18 23:03:19,349 INFO L273 TraceCheckUtils]: 98: Hoare triple {25339#true} ~set.base, ~set.offset := #in~set.base, #in~set.offset;~size := #in~size;~value := #in~value;havoc ~i~0;~i~0 := 0; {25339#true} is VALID [2018-11-18 23:03:19,349 INFO L273 TraceCheckUtils]: 99: Hoare triple {25339#true} assume true; {25339#true} is VALID [2018-11-18 23:03:19,349 INFO L273 TraceCheckUtils]: 100: Hoare triple {25339#true} assume !!(~i~0 < ~size);call #t~mem1 := read~int(~set.base, ~set.offset + 4 * ~i~0, 4); {25339#true} is VALID [2018-11-18 23:03:19,349 INFO L273 TraceCheckUtils]: 101: Hoare triple {25339#true} assume #t~mem1 == ~value;havoc #t~mem1;#res := 1; {25339#true} is VALID [2018-11-18 23:03:19,349 INFO L273 TraceCheckUtils]: 102: Hoare triple {25339#true} assume true; {25339#true} is VALID [2018-11-18 23:03:19,351 INFO L268 TraceCheckUtils]: 103: Hoare quadruple {25339#true} {25349#(<= (+ main_~v~0 99993) ~SIZE~0)} #132#return; {25349#(<= (+ main_~v~0 99993) ~SIZE~0)} is VALID [2018-11-18 23:03:19,352 INFO L273 TraceCheckUtils]: 104: Hoare triple {25349#(<= (+ main_~v~0 99993) ~SIZE~0)} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {25349#(<= (+ main_~v~0 99993) ~SIZE~0)} is VALID [2018-11-18 23:03:19,352 INFO L273 TraceCheckUtils]: 105: Hoare triple {25349#(<= (+ main_~v~0 99993) ~SIZE~0)} assume !(1 != #t~ret4);havoc #t~mem3;havoc #t~ret4; {25349#(<= (+ main_~v~0 99993) ~SIZE~0)} is VALID [2018-11-18 23:03:19,352 INFO L273 TraceCheckUtils]: 106: Hoare triple {25349#(<= (+ main_~v~0 99993) ~SIZE~0)} #t~post2 := ~v~0;~v~0 := 1 + #t~post2;havoc #t~post2; {25350#(<= (+ main_~v~0 99992) ~SIZE~0)} is VALID [2018-11-18 23:03:19,353 INFO L273 TraceCheckUtils]: 107: Hoare triple {25350#(<= (+ main_~v~0 99992) ~SIZE~0)} assume true; {25350#(<= (+ main_~v~0 99992) ~SIZE~0)} is VALID [2018-11-18 23:03:19,353 INFO L273 TraceCheckUtils]: 108: Hoare triple {25350#(<= (+ main_~v~0 99992) ~SIZE~0)} assume !!(~v~0 < ~SIZE~0);call #t~mem3 := read~int(~#values~0.base, ~#values~0.offset + 4 * ~v~0, 4); {25350#(<= (+ main_~v~0 99992) ~SIZE~0)} is VALID [2018-11-18 23:03:19,353 INFO L256 TraceCheckUtils]: 109: Hoare triple {25350#(<= (+ main_~v~0 99992) ~SIZE~0)} call #t~ret4 := elem_exists(~#set~0.base, ~#set~0.offset, ~n~0, #t~mem3); {25339#true} is VALID [2018-11-18 23:03:19,353 INFO L273 TraceCheckUtils]: 110: Hoare triple {25339#true} ~set.base, ~set.offset := #in~set.base, #in~set.offset;~size := #in~size;~value := #in~value;havoc ~i~0;~i~0 := 0; {25339#true} is VALID [2018-11-18 23:03:19,354 INFO L273 TraceCheckUtils]: 111: Hoare triple {25339#true} assume true; {25339#true} is VALID [2018-11-18 23:03:19,354 INFO L273 TraceCheckUtils]: 112: Hoare triple {25339#true} assume !!(~i~0 < ~size);call #t~mem1 := read~int(~set.base, ~set.offset + 4 * ~i~0, 4); {25339#true} is VALID [2018-11-18 23:03:19,354 INFO L273 TraceCheckUtils]: 113: Hoare triple {25339#true} assume #t~mem1 == ~value;havoc #t~mem1;#res := 1; {25339#true} is VALID [2018-11-18 23:03:19,354 INFO L273 TraceCheckUtils]: 114: Hoare triple {25339#true} assume true; {25339#true} is VALID [2018-11-18 23:03:19,356 INFO L268 TraceCheckUtils]: 115: Hoare quadruple {25339#true} {25350#(<= (+ main_~v~0 99992) ~SIZE~0)} #132#return; {25350#(<= (+ main_~v~0 99992) ~SIZE~0)} is VALID [2018-11-18 23:03:19,357 INFO L273 TraceCheckUtils]: 116: Hoare triple {25350#(<= (+ main_~v~0 99992) ~SIZE~0)} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {25350#(<= (+ main_~v~0 99992) ~SIZE~0)} is VALID [2018-11-18 23:03:19,357 INFO L273 TraceCheckUtils]: 117: Hoare triple {25350#(<= (+ main_~v~0 99992) ~SIZE~0)} assume !(1 != #t~ret4);havoc #t~mem3;havoc #t~ret4; {25350#(<= (+ main_~v~0 99992) ~SIZE~0)} is VALID [2018-11-18 23:03:19,358 INFO L273 TraceCheckUtils]: 118: Hoare triple {25350#(<= (+ main_~v~0 99992) ~SIZE~0)} #t~post2 := ~v~0;~v~0 := 1 + #t~post2;havoc #t~post2; {25351#(<= (+ main_~v~0 99991) ~SIZE~0)} is VALID [2018-11-18 23:03:19,358 INFO L273 TraceCheckUtils]: 119: Hoare triple {25351#(<= (+ main_~v~0 99991) ~SIZE~0)} assume true; {25351#(<= (+ main_~v~0 99991) ~SIZE~0)} is VALID [2018-11-18 23:03:19,358 INFO L273 TraceCheckUtils]: 120: Hoare triple {25351#(<= (+ main_~v~0 99991) ~SIZE~0)} assume !!(~v~0 < ~SIZE~0);call #t~mem3 := read~int(~#values~0.base, ~#values~0.offset + 4 * ~v~0, 4); {25351#(<= (+ main_~v~0 99991) ~SIZE~0)} is VALID [2018-11-18 23:03:19,358 INFO L256 TraceCheckUtils]: 121: Hoare triple {25351#(<= (+ main_~v~0 99991) ~SIZE~0)} call #t~ret4 := elem_exists(~#set~0.base, ~#set~0.offset, ~n~0, #t~mem3); {25339#true} is VALID [2018-11-18 23:03:19,359 INFO L273 TraceCheckUtils]: 122: Hoare triple {25339#true} ~set.base, ~set.offset := #in~set.base, #in~set.offset;~size := #in~size;~value := #in~value;havoc ~i~0;~i~0 := 0; {25339#true} is VALID [2018-11-18 23:03:19,359 INFO L273 TraceCheckUtils]: 123: Hoare triple {25339#true} assume true; {25339#true} is VALID [2018-11-18 23:03:19,359 INFO L273 TraceCheckUtils]: 124: Hoare triple {25339#true} assume !!(~i~0 < ~size);call #t~mem1 := read~int(~set.base, ~set.offset + 4 * ~i~0, 4); {25339#true} is VALID [2018-11-18 23:03:19,359 INFO L273 TraceCheckUtils]: 125: Hoare triple {25339#true} assume #t~mem1 == ~value;havoc #t~mem1;#res := 1; {25339#true} is VALID [2018-11-18 23:03:19,359 INFO L273 TraceCheckUtils]: 126: Hoare triple {25339#true} assume true; {25339#true} is VALID [2018-11-18 23:03:19,361 INFO L268 TraceCheckUtils]: 127: Hoare quadruple {25339#true} {25351#(<= (+ main_~v~0 99991) ~SIZE~0)} #132#return; {25351#(<= (+ main_~v~0 99991) ~SIZE~0)} is VALID [2018-11-18 23:03:19,361 INFO L273 TraceCheckUtils]: 128: Hoare triple {25351#(<= (+ main_~v~0 99991) ~SIZE~0)} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {25351#(<= (+ main_~v~0 99991) ~SIZE~0)} is VALID [2018-11-18 23:03:19,362 INFO L273 TraceCheckUtils]: 129: Hoare triple {25351#(<= (+ main_~v~0 99991) ~SIZE~0)} assume !(1 != #t~ret4);havoc #t~mem3;havoc #t~ret4; {25351#(<= (+ main_~v~0 99991) ~SIZE~0)} is VALID [2018-11-18 23:03:19,363 INFO L273 TraceCheckUtils]: 130: Hoare triple {25351#(<= (+ main_~v~0 99991) ~SIZE~0)} #t~post2 := ~v~0;~v~0 := 1 + #t~post2;havoc #t~post2; {25352#(<= (+ main_~v~0 99990) ~SIZE~0)} is VALID [2018-11-18 23:03:19,363 INFO L273 TraceCheckUtils]: 131: Hoare triple {25352#(<= (+ main_~v~0 99990) ~SIZE~0)} assume true; {25352#(<= (+ main_~v~0 99990) ~SIZE~0)} is VALID [2018-11-18 23:03:19,364 INFO L273 TraceCheckUtils]: 132: Hoare triple {25352#(<= (+ main_~v~0 99990) ~SIZE~0)} assume !!(~v~0 < ~SIZE~0);call #t~mem3 := read~int(~#values~0.base, ~#values~0.offset + 4 * ~v~0, 4); {25352#(<= (+ main_~v~0 99990) ~SIZE~0)} is VALID [2018-11-18 23:03:19,364 INFO L256 TraceCheckUtils]: 133: Hoare triple {25352#(<= (+ main_~v~0 99990) ~SIZE~0)} call #t~ret4 := elem_exists(~#set~0.base, ~#set~0.offset, ~n~0, #t~mem3); {25339#true} is VALID [2018-11-18 23:03:19,364 INFO L273 TraceCheckUtils]: 134: Hoare triple {25339#true} ~set.base, ~set.offset := #in~set.base, #in~set.offset;~size := #in~size;~value := #in~value;havoc ~i~0;~i~0 := 0; {25339#true} is VALID [2018-11-18 23:03:19,364 INFO L273 TraceCheckUtils]: 135: Hoare triple {25339#true} assume true; {25339#true} is VALID [2018-11-18 23:03:19,365 INFO L273 TraceCheckUtils]: 136: Hoare triple {25339#true} assume !!(~i~0 < ~size);call #t~mem1 := read~int(~set.base, ~set.offset + 4 * ~i~0, 4); {25339#true} is VALID [2018-11-18 23:03:19,365 INFO L273 TraceCheckUtils]: 137: Hoare triple {25339#true} assume #t~mem1 == ~value;havoc #t~mem1;#res := 1; {25339#true} is VALID [2018-11-18 23:03:19,365 INFO L273 TraceCheckUtils]: 138: Hoare triple {25339#true} assume true; {25339#true} is VALID [2018-11-18 23:03:19,367 INFO L268 TraceCheckUtils]: 139: Hoare quadruple {25339#true} {25352#(<= (+ main_~v~0 99990) ~SIZE~0)} #132#return; {25352#(<= (+ main_~v~0 99990) ~SIZE~0)} is VALID [2018-11-18 23:03:19,367 INFO L273 TraceCheckUtils]: 140: Hoare triple {25352#(<= (+ main_~v~0 99990) ~SIZE~0)} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {25352#(<= (+ main_~v~0 99990) ~SIZE~0)} is VALID [2018-11-18 23:03:19,368 INFO L273 TraceCheckUtils]: 141: Hoare triple {25352#(<= (+ main_~v~0 99990) ~SIZE~0)} assume !(1 != #t~ret4);havoc #t~mem3;havoc #t~ret4; {25352#(<= (+ main_~v~0 99990) ~SIZE~0)} is VALID [2018-11-18 23:03:19,369 INFO L273 TraceCheckUtils]: 142: Hoare triple {25352#(<= (+ main_~v~0 99990) ~SIZE~0)} #t~post2 := ~v~0;~v~0 := 1 + #t~post2;havoc #t~post2; {25353#(<= (+ main_~v~0 99989) ~SIZE~0)} is VALID [2018-11-18 23:03:19,369 INFO L273 TraceCheckUtils]: 143: Hoare triple {25353#(<= (+ main_~v~0 99989) ~SIZE~0)} assume true; {25353#(<= (+ main_~v~0 99989) ~SIZE~0)} is VALID [2018-11-18 23:03:19,370 INFO L273 TraceCheckUtils]: 144: Hoare triple {25353#(<= (+ main_~v~0 99989) ~SIZE~0)} assume !!(~v~0 < ~SIZE~0);call #t~mem3 := read~int(~#values~0.base, ~#values~0.offset + 4 * ~v~0, 4); {25353#(<= (+ main_~v~0 99989) ~SIZE~0)} is VALID [2018-11-18 23:03:19,370 INFO L256 TraceCheckUtils]: 145: Hoare triple {25353#(<= (+ main_~v~0 99989) ~SIZE~0)} call #t~ret4 := elem_exists(~#set~0.base, ~#set~0.offset, ~n~0, #t~mem3); {25339#true} is VALID [2018-11-18 23:03:19,370 INFO L273 TraceCheckUtils]: 146: Hoare triple {25339#true} ~set.base, ~set.offset := #in~set.base, #in~set.offset;~size := #in~size;~value := #in~value;havoc ~i~0;~i~0 := 0; {25339#true} is VALID [2018-11-18 23:03:19,370 INFO L273 TraceCheckUtils]: 147: Hoare triple {25339#true} assume true; {25339#true} is VALID [2018-11-18 23:03:19,371 INFO L273 TraceCheckUtils]: 148: Hoare triple {25339#true} assume !!(~i~0 < ~size);call #t~mem1 := read~int(~set.base, ~set.offset + 4 * ~i~0, 4); {25339#true} is VALID [2018-11-18 23:03:19,371 INFO L273 TraceCheckUtils]: 149: Hoare triple {25339#true} assume #t~mem1 == ~value;havoc #t~mem1;#res := 1; {25339#true} is VALID [2018-11-18 23:03:19,371 INFO L273 TraceCheckUtils]: 150: Hoare triple {25339#true} assume true; {25339#true} is VALID [2018-11-18 23:03:19,373 INFO L268 TraceCheckUtils]: 151: Hoare quadruple {25339#true} {25353#(<= (+ main_~v~0 99989) ~SIZE~0)} #132#return; {25353#(<= (+ main_~v~0 99989) ~SIZE~0)} is VALID [2018-11-18 23:03:19,373 INFO L273 TraceCheckUtils]: 152: Hoare triple {25353#(<= (+ main_~v~0 99989) ~SIZE~0)} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {25353#(<= (+ main_~v~0 99989) ~SIZE~0)} is VALID [2018-11-18 23:03:19,374 INFO L273 TraceCheckUtils]: 153: Hoare triple {25353#(<= (+ main_~v~0 99989) ~SIZE~0)} assume !(1 != #t~ret4);havoc #t~mem3;havoc #t~ret4; {25353#(<= (+ main_~v~0 99989) ~SIZE~0)} is VALID [2018-11-18 23:03:19,375 INFO L273 TraceCheckUtils]: 154: Hoare triple {25353#(<= (+ main_~v~0 99989) ~SIZE~0)} #t~post2 := ~v~0;~v~0 := 1 + #t~post2;havoc #t~post2; {25354#(<= (+ main_~v~0 99988) ~SIZE~0)} is VALID [2018-11-18 23:03:19,375 INFO L273 TraceCheckUtils]: 155: Hoare triple {25354#(<= (+ main_~v~0 99988) ~SIZE~0)} assume true; {25354#(<= (+ main_~v~0 99988) ~SIZE~0)} is VALID [2018-11-18 23:03:19,376 INFO L273 TraceCheckUtils]: 156: Hoare triple {25354#(<= (+ main_~v~0 99988) ~SIZE~0)} assume !!(~v~0 < ~SIZE~0);call #t~mem3 := read~int(~#values~0.base, ~#values~0.offset + 4 * ~v~0, 4); {25354#(<= (+ main_~v~0 99988) ~SIZE~0)} is VALID [2018-11-18 23:03:19,376 INFO L256 TraceCheckUtils]: 157: Hoare triple {25354#(<= (+ main_~v~0 99988) ~SIZE~0)} call #t~ret4 := elem_exists(~#set~0.base, ~#set~0.offset, ~n~0, #t~mem3); {25339#true} is VALID [2018-11-18 23:03:19,376 INFO L273 TraceCheckUtils]: 158: Hoare triple {25339#true} ~set.base, ~set.offset := #in~set.base, #in~set.offset;~size := #in~size;~value := #in~value;havoc ~i~0;~i~0 := 0; {25339#true} is VALID [2018-11-18 23:03:19,377 INFO L273 TraceCheckUtils]: 159: Hoare triple {25339#true} assume true; {25339#true} is VALID [2018-11-18 23:03:19,377 INFO L273 TraceCheckUtils]: 160: Hoare triple {25339#true} assume !!(~i~0 < ~size);call #t~mem1 := read~int(~set.base, ~set.offset + 4 * ~i~0, 4); {25339#true} is VALID [2018-11-18 23:03:19,377 INFO L273 TraceCheckUtils]: 161: Hoare triple {25339#true} assume #t~mem1 == ~value;havoc #t~mem1;#res := 1; {25339#true} is VALID [2018-11-18 23:03:19,377 INFO L273 TraceCheckUtils]: 162: Hoare triple {25339#true} assume true; {25339#true} is VALID [2018-11-18 23:03:19,379 INFO L268 TraceCheckUtils]: 163: Hoare quadruple {25339#true} {25354#(<= (+ main_~v~0 99988) ~SIZE~0)} #132#return; {25354#(<= (+ main_~v~0 99988) ~SIZE~0)} is VALID [2018-11-18 23:03:19,379 INFO L273 TraceCheckUtils]: 164: Hoare triple {25354#(<= (+ main_~v~0 99988) ~SIZE~0)} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {25354#(<= (+ main_~v~0 99988) ~SIZE~0)} is VALID [2018-11-18 23:03:19,380 INFO L273 TraceCheckUtils]: 165: Hoare triple {25354#(<= (+ main_~v~0 99988) ~SIZE~0)} assume !(1 != #t~ret4);havoc #t~mem3;havoc #t~ret4; {25354#(<= (+ main_~v~0 99988) ~SIZE~0)} is VALID [2018-11-18 23:03:19,380 INFO L273 TraceCheckUtils]: 166: Hoare triple {25354#(<= (+ main_~v~0 99988) ~SIZE~0)} #t~post2 := ~v~0;~v~0 := 1 + #t~post2;havoc #t~post2; {25355#(<= (+ main_~v~0 99987) ~SIZE~0)} is VALID [2018-11-18 23:03:19,381 INFO L273 TraceCheckUtils]: 167: Hoare triple {25355#(<= (+ main_~v~0 99987) ~SIZE~0)} assume true; {25355#(<= (+ main_~v~0 99987) ~SIZE~0)} is VALID [2018-11-18 23:03:19,381 INFO L273 TraceCheckUtils]: 168: Hoare triple {25355#(<= (+ main_~v~0 99987) ~SIZE~0)} assume !!(~v~0 < ~SIZE~0);call #t~mem3 := read~int(~#values~0.base, ~#values~0.offset + 4 * ~v~0, 4); {25355#(<= (+ main_~v~0 99987) ~SIZE~0)} is VALID [2018-11-18 23:03:19,381 INFO L256 TraceCheckUtils]: 169: Hoare triple {25355#(<= (+ main_~v~0 99987) ~SIZE~0)} call #t~ret4 := elem_exists(~#set~0.base, ~#set~0.offset, ~n~0, #t~mem3); {25339#true} is VALID [2018-11-18 23:03:19,381 INFO L273 TraceCheckUtils]: 170: Hoare triple {25339#true} ~set.base, ~set.offset := #in~set.base, #in~set.offset;~size := #in~size;~value := #in~value;havoc ~i~0;~i~0 := 0; {25339#true} is VALID [2018-11-18 23:03:19,381 INFO L273 TraceCheckUtils]: 171: Hoare triple {25339#true} assume true; {25339#true} is VALID [2018-11-18 23:03:19,382 INFO L273 TraceCheckUtils]: 172: Hoare triple {25339#true} assume !!(~i~0 < ~size);call #t~mem1 := read~int(~set.base, ~set.offset + 4 * ~i~0, 4); {25339#true} is VALID [2018-11-18 23:03:19,382 INFO L273 TraceCheckUtils]: 173: Hoare triple {25339#true} assume #t~mem1 == ~value;havoc #t~mem1;#res := 1; {25339#true} is VALID [2018-11-18 23:03:19,382 INFO L273 TraceCheckUtils]: 174: Hoare triple {25339#true} assume true; {25339#true} is VALID [2018-11-18 23:03:19,384 INFO L268 TraceCheckUtils]: 175: Hoare quadruple {25339#true} {25355#(<= (+ main_~v~0 99987) ~SIZE~0)} #132#return; {25355#(<= (+ main_~v~0 99987) ~SIZE~0)} is VALID [2018-11-18 23:03:19,384 INFO L273 TraceCheckUtils]: 176: Hoare triple {25355#(<= (+ main_~v~0 99987) ~SIZE~0)} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {25355#(<= (+ main_~v~0 99987) ~SIZE~0)} is VALID [2018-11-18 23:03:19,385 INFO L273 TraceCheckUtils]: 177: Hoare triple {25355#(<= (+ main_~v~0 99987) ~SIZE~0)} assume !(1 != #t~ret4);havoc #t~mem3;havoc #t~ret4; {25355#(<= (+ main_~v~0 99987) ~SIZE~0)} is VALID [2018-11-18 23:03:19,386 INFO L273 TraceCheckUtils]: 178: Hoare triple {25355#(<= (+ main_~v~0 99987) ~SIZE~0)} #t~post2 := ~v~0;~v~0 := 1 + #t~post2;havoc #t~post2; {25356#(<= (+ main_~v~0 99986) ~SIZE~0)} is VALID [2018-11-18 23:03:19,386 INFO L273 TraceCheckUtils]: 179: Hoare triple {25356#(<= (+ main_~v~0 99986) ~SIZE~0)} assume true; {25356#(<= (+ main_~v~0 99986) ~SIZE~0)} is VALID [2018-11-18 23:03:19,386 INFO L273 TraceCheckUtils]: 180: Hoare triple {25356#(<= (+ main_~v~0 99986) ~SIZE~0)} assume !!(~v~0 < ~SIZE~0);call #t~mem3 := read~int(~#values~0.base, ~#values~0.offset + 4 * ~v~0, 4); {25356#(<= (+ main_~v~0 99986) ~SIZE~0)} is VALID [2018-11-18 23:03:19,386 INFO L256 TraceCheckUtils]: 181: Hoare triple {25356#(<= (+ main_~v~0 99986) ~SIZE~0)} call #t~ret4 := elem_exists(~#set~0.base, ~#set~0.offset, ~n~0, #t~mem3); {25339#true} is VALID [2018-11-18 23:03:19,386 INFO L273 TraceCheckUtils]: 182: Hoare triple {25339#true} ~set.base, ~set.offset := #in~set.base, #in~set.offset;~size := #in~size;~value := #in~value;havoc ~i~0;~i~0 := 0; {25339#true} is VALID [2018-11-18 23:03:19,387 INFO L273 TraceCheckUtils]: 183: Hoare triple {25339#true} assume true; {25339#true} is VALID [2018-11-18 23:03:19,387 INFO L273 TraceCheckUtils]: 184: Hoare triple {25339#true} assume !!(~i~0 < ~size);call #t~mem1 := read~int(~set.base, ~set.offset + 4 * ~i~0, 4); {25339#true} is VALID [2018-11-18 23:03:19,387 INFO L273 TraceCheckUtils]: 185: Hoare triple {25339#true} assume #t~mem1 == ~value;havoc #t~mem1;#res := 1; {25339#true} is VALID [2018-11-18 23:03:19,387 INFO L273 TraceCheckUtils]: 186: Hoare triple {25339#true} assume true; {25339#true} is VALID [2018-11-18 23:03:19,389 INFO L268 TraceCheckUtils]: 187: Hoare quadruple {25339#true} {25356#(<= (+ main_~v~0 99986) ~SIZE~0)} #132#return; {25356#(<= (+ main_~v~0 99986) ~SIZE~0)} is VALID [2018-11-18 23:03:19,389 INFO L273 TraceCheckUtils]: 188: Hoare triple {25356#(<= (+ main_~v~0 99986) ~SIZE~0)} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {25356#(<= (+ main_~v~0 99986) ~SIZE~0)} is VALID [2018-11-18 23:03:19,390 INFO L273 TraceCheckUtils]: 189: Hoare triple {25356#(<= (+ main_~v~0 99986) ~SIZE~0)} assume !(1 != #t~ret4);havoc #t~mem3;havoc #t~ret4; {25356#(<= (+ main_~v~0 99986) ~SIZE~0)} is VALID [2018-11-18 23:03:19,391 INFO L273 TraceCheckUtils]: 190: Hoare triple {25356#(<= (+ main_~v~0 99986) ~SIZE~0)} #t~post2 := ~v~0;~v~0 := 1 + #t~post2;havoc #t~post2; {25357#(<= (+ main_~v~0 99985) ~SIZE~0)} is VALID [2018-11-18 23:03:19,391 INFO L273 TraceCheckUtils]: 191: Hoare triple {25357#(<= (+ main_~v~0 99985) ~SIZE~0)} assume true; {25357#(<= (+ main_~v~0 99985) ~SIZE~0)} is VALID [2018-11-18 23:03:19,392 INFO L273 TraceCheckUtils]: 192: Hoare triple {25357#(<= (+ main_~v~0 99985) ~SIZE~0)} assume !!(~v~0 < ~SIZE~0);call #t~mem3 := read~int(~#values~0.base, ~#values~0.offset + 4 * ~v~0, 4); {25357#(<= (+ main_~v~0 99985) ~SIZE~0)} is VALID [2018-11-18 23:03:19,392 INFO L256 TraceCheckUtils]: 193: Hoare triple {25357#(<= (+ main_~v~0 99985) ~SIZE~0)} call #t~ret4 := elem_exists(~#set~0.base, ~#set~0.offset, ~n~0, #t~mem3); {25339#true} is VALID [2018-11-18 23:03:19,392 INFO L273 TraceCheckUtils]: 194: Hoare triple {25339#true} ~set.base, ~set.offset := #in~set.base, #in~set.offset;~size := #in~size;~value := #in~value;havoc ~i~0;~i~0 := 0; {25339#true} is VALID [2018-11-18 23:03:19,392 INFO L273 TraceCheckUtils]: 195: Hoare triple {25339#true} assume true; {25339#true} is VALID [2018-11-18 23:03:19,392 INFO L273 TraceCheckUtils]: 196: Hoare triple {25339#true} assume !!(~i~0 < ~size);call #t~mem1 := read~int(~set.base, ~set.offset + 4 * ~i~0, 4); {25339#true} is VALID [2018-11-18 23:03:19,393 INFO L273 TraceCheckUtils]: 197: Hoare triple {25339#true} assume #t~mem1 == ~value;havoc #t~mem1;#res := 1; {25339#true} is VALID [2018-11-18 23:03:19,393 INFO L273 TraceCheckUtils]: 198: Hoare triple {25339#true} assume true; {25339#true} is VALID [2018-11-18 23:03:19,396 INFO L268 TraceCheckUtils]: 199: Hoare quadruple {25339#true} {25357#(<= (+ main_~v~0 99985) ~SIZE~0)} #132#return; {25357#(<= (+ main_~v~0 99985) ~SIZE~0)} is VALID [2018-11-18 23:03:19,397 INFO L273 TraceCheckUtils]: 200: Hoare triple {25357#(<= (+ main_~v~0 99985) ~SIZE~0)} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {25357#(<= (+ main_~v~0 99985) ~SIZE~0)} is VALID [2018-11-18 23:03:19,399 INFO L273 TraceCheckUtils]: 201: Hoare triple {25357#(<= (+ main_~v~0 99985) ~SIZE~0)} assume !(1 != #t~ret4);havoc #t~mem3;havoc #t~ret4; {25357#(<= (+ main_~v~0 99985) ~SIZE~0)} is VALID [2018-11-18 23:03:19,400 INFO L273 TraceCheckUtils]: 202: Hoare triple {25357#(<= (+ main_~v~0 99985) ~SIZE~0)} #t~post2 := ~v~0;~v~0 := 1 + #t~post2;havoc #t~post2; {25358#(<= (+ main_~v~0 99984) ~SIZE~0)} is VALID [2018-11-18 23:03:19,400 INFO L273 TraceCheckUtils]: 203: Hoare triple {25358#(<= (+ main_~v~0 99984) ~SIZE~0)} assume true; {25358#(<= (+ main_~v~0 99984) ~SIZE~0)} is VALID [2018-11-18 23:03:19,401 INFO L273 TraceCheckUtils]: 204: Hoare triple {25358#(<= (+ main_~v~0 99984) ~SIZE~0)} assume !(~v~0 < ~SIZE~0); {25340#false} is VALID [2018-11-18 23:03:19,401 INFO L273 TraceCheckUtils]: 205: Hoare triple {25340#false} ~i~1 := 0; {25340#false} is VALID [2018-11-18 23:03:19,401 INFO L273 TraceCheckUtils]: 206: Hoare triple {25340#false} assume true; {25340#false} is VALID [2018-11-18 23:03:19,401 INFO L273 TraceCheckUtils]: 207: Hoare triple {25340#false} assume !!(~i~1 < ~SIZE~0 && 1 != ~found~0);call #t~mem8 := read~int(~#set~0.base, ~#set~0.offset + 4 * ~i~1, 4); {25340#false} is VALID [2018-11-18 23:03:19,401 INFO L273 TraceCheckUtils]: 208: Hoare triple {25340#false} assume !(#t~mem8 == ~element~0);havoc #t~mem8; {25340#false} is VALID [2018-11-18 23:03:19,401 INFO L273 TraceCheckUtils]: 209: Hoare triple {25340#false} #t~post7 := ~i~1;~i~1 := 1 + #t~post7;havoc #t~post7; {25340#false} is VALID [2018-11-18 23:03:19,401 INFO L273 TraceCheckUtils]: 210: Hoare triple {25340#false} assume true; {25340#false} is VALID [2018-11-18 23:03:19,401 INFO L273 TraceCheckUtils]: 211: Hoare triple {25340#false} assume !!(~i~1 < ~SIZE~0 && 1 != ~found~0);call #t~mem8 := read~int(~#set~0.base, ~#set~0.offset + 4 * ~i~1, 4); {25340#false} is VALID [2018-11-18 23:03:19,402 INFO L273 TraceCheckUtils]: 212: Hoare triple {25340#false} assume !(#t~mem8 == ~element~0);havoc #t~mem8; {25340#false} is VALID [2018-11-18 23:03:19,402 INFO L273 TraceCheckUtils]: 213: Hoare triple {25340#false} #t~post7 := ~i~1;~i~1 := 1 + #t~post7;havoc #t~post7; {25340#false} is VALID [2018-11-18 23:03:19,402 INFO L273 TraceCheckUtils]: 214: Hoare triple {25340#false} assume true; {25340#false} is VALID [2018-11-18 23:03:19,402 INFO L273 TraceCheckUtils]: 215: Hoare triple {25340#false} assume !!(~i~1 < ~SIZE~0 && 1 != ~found~0);call #t~mem8 := read~int(~#set~0.base, ~#set~0.offset + 4 * ~i~1, 4); {25340#false} is VALID [2018-11-18 23:03:19,402 INFO L273 TraceCheckUtils]: 216: Hoare triple {25340#false} assume #t~mem8 == ~element~0;havoc #t~mem8;~found~0 := 1;~pos~0 := ~i~1; {25340#false} is VALID [2018-11-18 23:03:19,402 INFO L273 TraceCheckUtils]: 217: Hoare triple {25340#false} #t~post7 := ~i~1;~i~1 := 1 + #t~post7;havoc #t~post7; {25340#false} is VALID [2018-11-18 23:03:19,402 INFO L273 TraceCheckUtils]: 218: Hoare triple {25340#false} assume true; {25340#false} is VALID [2018-11-18 23:03:19,402 INFO L273 TraceCheckUtils]: 219: Hoare triple {25340#false} assume !(~i~1 < ~SIZE~0 && 1 != ~found~0); {25340#false} is VALID [2018-11-18 23:03:19,402 INFO L273 TraceCheckUtils]: 220: Hoare triple {25340#false} assume 1 == ~found~0;~i~1 := ~pos~0; {25340#false} is VALID [2018-11-18 23:03:19,403 INFO L273 TraceCheckUtils]: 221: Hoare triple {25340#false} assume true; {25340#false} is VALID [2018-11-18 23:03:19,403 INFO L273 TraceCheckUtils]: 222: Hoare triple {25340#false} assume !!(~i~1 < ~SIZE~0 - 1);call #t~mem10 := read~int(~#set~0.base, ~#set~0.offset + 4 * (1 + ~i~1), 4);call write~int(#t~mem10, ~#set~0.base, ~#set~0.offset + 4 * ~i~1, 4);havoc #t~mem10; {25340#false} is VALID [2018-11-18 23:03:19,403 INFO L273 TraceCheckUtils]: 223: Hoare triple {25340#false} #t~post9 := ~i~1;~i~1 := 1 + #t~post9;havoc #t~post9; {25340#false} is VALID [2018-11-18 23:03:19,403 INFO L273 TraceCheckUtils]: 224: Hoare triple {25340#false} assume true; {25340#false} is VALID [2018-11-18 23:03:19,403 INFO L273 TraceCheckUtils]: 225: Hoare triple {25340#false} assume !!(~i~1 < ~SIZE~0 - 1);call #t~mem10 := read~int(~#set~0.base, ~#set~0.offset + 4 * (1 + ~i~1), 4);call write~int(#t~mem10, ~#set~0.base, ~#set~0.offset + 4 * ~i~1, 4);havoc #t~mem10; {25340#false} is VALID [2018-11-18 23:03:19,403 INFO L273 TraceCheckUtils]: 226: Hoare triple {25340#false} #t~post9 := ~i~1;~i~1 := 1 + #t~post9;havoc #t~post9; {25340#false} is VALID [2018-11-18 23:03:19,403 INFO L273 TraceCheckUtils]: 227: Hoare triple {25340#false} assume true; {25340#false} is VALID [2018-11-18 23:03:19,403 INFO L273 TraceCheckUtils]: 228: Hoare triple {25340#false} assume !(~i~1 < ~SIZE~0 - 1); {25340#false} is VALID [2018-11-18 23:03:19,403 INFO L273 TraceCheckUtils]: 229: Hoare triple {25340#false} assume 1 == ~found~0;~i~1 := 0; {25340#false} is VALID [2018-11-18 23:03:19,404 INFO L273 TraceCheckUtils]: 230: Hoare triple {25340#false} assume true; {25340#false} is VALID [2018-11-18 23:03:19,404 INFO L273 TraceCheckUtils]: 231: Hoare triple {25340#false} assume !!(~i~1 < ~SIZE~0 - 1);call #t~mem12 := read~int(~#set~0.base, ~#set~0.offset + 4 * ~i~1, 4); {25340#false} is VALID [2018-11-18 23:03:19,404 INFO L256 TraceCheckUtils]: 232: Hoare triple {25340#false} call __VERIFIER_assert((if #t~mem12 != ~element~0 then 1 else 0)); {25340#false} is VALID [2018-11-18 23:03:19,404 INFO L273 TraceCheckUtils]: 233: Hoare triple {25340#false} ~cond := #in~cond; {25340#false} is VALID [2018-11-18 23:03:19,404 INFO L273 TraceCheckUtils]: 234: Hoare triple {25340#false} assume 0 == ~cond; {25340#false} is VALID [2018-11-18 23:03:19,404 INFO L273 TraceCheckUtils]: 235: Hoare triple {25340#false} assume !false; {25340#false} is VALID [2018-11-18 23:03:19,439 INFO L134 CoverageAnalysis]: Checked inductivity of 1482 backedges. 0 proven. 752 refuted. 0 times theorem prover too weak. 730 trivial. 0 not checked. [2018-11-18 23:03:19,439 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 23:03:19,440 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-18 23:03:19,449 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 23:03:19,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 23:03:19,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 23:03:19,600 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 23:03:20,539 INFO L256 TraceCheckUtils]: 0: Hoare triple {25339#true} call ULTIMATE.init(); {25339#true} is VALID [2018-11-18 23:03:20,540 INFO L273 TraceCheckUtils]: 1: Hoare triple {25339#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~SIZE~0 := 100000; {25341#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:03:20,540 INFO L273 TraceCheckUtils]: 2: Hoare triple {25341#(<= 100000 ~SIZE~0)} assume true; {25341#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:03:20,541 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {25341#(<= 100000 ~SIZE~0)} {25339#true} #128#return; {25341#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:03:20,542 INFO L256 TraceCheckUtils]: 4: Hoare triple {25341#(<= 100000 ~SIZE~0)} call #t~ret13 := main(); {25341#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:03:20,543 INFO L273 TraceCheckUtils]: 5: Hoare triple {25341#(<= 100000 ~SIZE~0)} havoc ~i~1;havoc ~pos~0;~n~0 := 0;~found~0 := 0;call ~#set~0.base, ~#set~0.offset := #Ultimate.alloc(4 * ~SIZE~0);call ~#values~0.base, ~#values~0.offset := #Ultimate.alloc(4 * ~SIZE~0);havoc ~element~0;havoc ~v~0;~v~0 := 0; {25377#(and (<= main_~v~0 0) (<= 100000 ~SIZE~0))} is VALID [2018-11-18 23:03:20,543 INFO L273 TraceCheckUtils]: 6: Hoare triple {25377#(and (<= main_~v~0 0) (<= 100000 ~SIZE~0))} assume true; {25377#(and (<= main_~v~0 0) (<= 100000 ~SIZE~0))} is VALID [2018-11-18 23:03:20,544 INFO L273 TraceCheckUtils]: 7: Hoare triple {25377#(and (<= main_~v~0 0) (<= 100000 ~SIZE~0))} assume !!(~v~0 < ~SIZE~0);call #t~mem3 := read~int(~#values~0.base, ~#values~0.offset + 4 * ~v~0, 4); {25377#(and (<= main_~v~0 0) (<= 100000 ~SIZE~0))} is VALID [2018-11-18 23:03:20,545 INFO L256 TraceCheckUtils]: 8: Hoare triple {25377#(and (<= main_~v~0 0) (<= 100000 ~SIZE~0))} call #t~ret4 := elem_exists(~#set~0.base, ~#set~0.offset, ~n~0, #t~mem3); {25341#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:03:20,546 INFO L273 TraceCheckUtils]: 9: Hoare triple {25341#(<= 100000 ~SIZE~0)} ~set.base, ~set.offset := #in~set.base, #in~set.offset;~size := #in~size;~value := #in~value;havoc ~i~0;~i~0 := 0; {25341#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:03:20,546 INFO L273 TraceCheckUtils]: 10: Hoare triple {25341#(<= 100000 ~SIZE~0)} assume true; {25341#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:03:20,547 INFO L273 TraceCheckUtils]: 11: Hoare triple {25341#(<= 100000 ~SIZE~0)} assume !(~i~0 < ~size); {25341#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:03:20,547 INFO L273 TraceCheckUtils]: 12: Hoare triple {25341#(<= 100000 ~SIZE~0)} #res := 0; {25341#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:03:20,548 INFO L273 TraceCheckUtils]: 13: Hoare triple {25341#(<= 100000 ~SIZE~0)} assume true; {25341#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:03:20,549 INFO L268 TraceCheckUtils]: 14: Hoare quadruple {25341#(<= 100000 ~SIZE~0)} {25377#(and (<= main_~v~0 0) (<= 100000 ~SIZE~0))} #132#return; {25377#(and (<= main_~v~0 0) (<= 100000 ~SIZE~0))} is VALID [2018-11-18 23:03:20,550 INFO L273 TraceCheckUtils]: 15: Hoare triple {25377#(and (<= main_~v~0 0) (<= 100000 ~SIZE~0))} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {25377#(and (<= main_~v~0 0) (<= 100000 ~SIZE~0))} is VALID [2018-11-18 23:03:20,550 INFO L273 TraceCheckUtils]: 16: Hoare triple {25377#(and (<= main_~v~0 0) (<= 100000 ~SIZE~0))} assume 1 != #t~ret4;havoc #t~mem3;havoc #t~ret4;call #t~mem5 := read~int(~#values~0.base, ~#values~0.offset + 4 * ~v~0, 4); {25377#(and (<= main_~v~0 0) (<= 100000 ~SIZE~0))} is VALID [2018-11-18 23:03:20,551 INFO L256 TraceCheckUtils]: 17: Hoare triple {25377#(and (<= main_~v~0 0) (<= 100000 ~SIZE~0))} call #t~ret6 := insert(~#set~0.base, ~#set~0.offset, ~n~0, #t~mem5); {25341#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:03:20,552 INFO L273 TraceCheckUtils]: 18: Hoare triple {25341#(<= 100000 ~SIZE~0)} ~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; {25341#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:03:20,552 INFO L273 TraceCheckUtils]: 19: Hoare triple {25341#(<= 100000 ~SIZE~0)} assume true; {25341#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:03:20,554 INFO L268 TraceCheckUtils]: 20: Hoare quadruple {25341#(<= 100000 ~SIZE~0)} {25377#(and (<= main_~v~0 0) (<= 100000 ~SIZE~0))} #134#return; {25377#(and (<= main_~v~0 0) (<= 100000 ~SIZE~0))} is VALID [2018-11-18 23:03:20,554 INFO L273 TraceCheckUtils]: 21: Hoare triple {25377#(and (<= main_~v~0 0) (<= 100000 ~SIZE~0))} assume -2147483648 <= #t~ret6 && #t~ret6 <= 2147483647;~n~0 := #t~ret6;havoc #t~ret6;havoc #t~mem5; {25377#(and (<= main_~v~0 0) (<= 100000 ~SIZE~0))} is VALID [2018-11-18 23:03:20,555 INFO L273 TraceCheckUtils]: 22: Hoare triple {25377#(and (<= main_~v~0 0) (<= 100000 ~SIZE~0))} #t~post2 := ~v~0;~v~0 := 1 + #t~post2;havoc #t~post2; {25429#(and (<= main_~v~0 1) (<= 100000 ~SIZE~0))} is VALID [2018-11-18 23:03:20,556 INFO L273 TraceCheckUtils]: 23: Hoare triple {25429#(and (<= main_~v~0 1) (<= 100000 ~SIZE~0))} assume true; {25429#(and (<= main_~v~0 1) (<= 100000 ~SIZE~0))} is VALID [2018-11-18 23:03:20,557 INFO L273 TraceCheckUtils]: 24: Hoare triple {25429#(and (<= main_~v~0 1) (<= 100000 ~SIZE~0))} assume !!(~v~0 < ~SIZE~0);call #t~mem3 := read~int(~#values~0.base, ~#values~0.offset + 4 * ~v~0, 4); {25429#(and (<= main_~v~0 1) (<= 100000 ~SIZE~0))} is VALID [2018-11-18 23:03:20,558 INFO L256 TraceCheckUtils]: 25: Hoare triple {25429#(and (<= main_~v~0 1) (<= 100000 ~SIZE~0))} call #t~ret4 := elem_exists(~#set~0.base, ~#set~0.offset, ~n~0, #t~mem3); {25341#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:03:20,558 INFO L273 TraceCheckUtils]: 26: Hoare triple {25341#(<= 100000 ~SIZE~0)} ~set.base, ~set.offset := #in~set.base, #in~set.offset;~size := #in~size;~value := #in~value;havoc ~i~0;~i~0 := 0; {25341#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:03:20,559 INFO L273 TraceCheckUtils]: 27: Hoare triple {25341#(<= 100000 ~SIZE~0)} assume true; {25341#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:03:20,559 INFO L273 TraceCheckUtils]: 28: Hoare triple {25341#(<= 100000 ~SIZE~0)} assume !!(~i~0 < ~size);call #t~mem1 := read~int(~set.base, ~set.offset + 4 * ~i~0, 4); {25341#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:03:20,560 INFO L273 TraceCheckUtils]: 29: Hoare triple {25341#(<= 100000 ~SIZE~0)} assume #t~mem1 == ~value;havoc #t~mem1;#res := 1; {25341#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:03:20,560 INFO L273 TraceCheckUtils]: 30: Hoare triple {25341#(<= 100000 ~SIZE~0)} assume true; {25341#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:03:20,578 INFO L268 TraceCheckUtils]: 31: Hoare quadruple {25341#(<= 100000 ~SIZE~0)} {25429#(and (<= main_~v~0 1) (<= 100000 ~SIZE~0))} #132#return; {25429#(and (<= main_~v~0 1) (<= 100000 ~SIZE~0))} is VALID [2018-11-18 23:03:20,594 INFO L273 TraceCheckUtils]: 32: Hoare triple {25429#(and (<= main_~v~0 1) (<= 100000 ~SIZE~0))} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {25429#(and (<= main_~v~0 1) (<= 100000 ~SIZE~0))} is VALID [2018-11-18 23:03:20,598 INFO L273 TraceCheckUtils]: 33: Hoare triple {25429#(and (<= main_~v~0 1) (<= 100000 ~SIZE~0))} assume !(1 != #t~ret4);havoc #t~mem3;havoc #t~ret4; {25429#(and (<= main_~v~0 1) (<= 100000 ~SIZE~0))} is VALID [2018-11-18 23:03:20,599 INFO L273 TraceCheckUtils]: 34: Hoare triple {25429#(and (<= main_~v~0 1) (<= 100000 ~SIZE~0))} #t~post2 := ~v~0;~v~0 := 1 + #t~post2;havoc #t~post2; {25466#(and (<= main_~v~0 2) (<= 100000 ~SIZE~0))} is VALID [2018-11-18 23:03:20,599 INFO L273 TraceCheckUtils]: 35: Hoare triple {25466#(and (<= main_~v~0 2) (<= 100000 ~SIZE~0))} assume true; {25466#(and (<= main_~v~0 2) (<= 100000 ~SIZE~0))} is VALID [2018-11-18 23:03:20,599 INFO L273 TraceCheckUtils]: 36: Hoare triple {25466#(and (<= main_~v~0 2) (<= 100000 ~SIZE~0))} assume !!(~v~0 < ~SIZE~0);call #t~mem3 := read~int(~#values~0.base, ~#values~0.offset + 4 * ~v~0, 4); {25466#(and (<= main_~v~0 2) (<= 100000 ~SIZE~0))} is VALID [2018-11-18 23:03:20,600 INFO L256 TraceCheckUtils]: 37: Hoare triple {25466#(and (<= main_~v~0 2) (<= 100000 ~SIZE~0))} call #t~ret4 := elem_exists(~#set~0.base, ~#set~0.offset, ~n~0, #t~mem3); {25341#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:03:20,601 INFO L273 TraceCheckUtils]: 38: Hoare triple {25341#(<= 100000 ~SIZE~0)} ~set.base, ~set.offset := #in~set.base, #in~set.offset;~size := #in~size;~value := #in~value;havoc ~i~0;~i~0 := 0; {25341#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:03:20,601 INFO L273 TraceCheckUtils]: 39: Hoare triple {25341#(<= 100000 ~SIZE~0)} assume true; {25341#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:03:20,601 INFO L273 TraceCheckUtils]: 40: Hoare triple {25341#(<= 100000 ~SIZE~0)} assume !!(~i~0 < ~size);call #t~mem1 := read~int(~set.base, ~set.offset + 4 * ~i~0, 4); {25341#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:03:20,602 INFO L273 TraceCheckUtils]: 41: Hoare triple {25341#(<= 100000 ~SIZE~0)} assume #t~mem1 == ~value;havoc #t~mem1;#res := 1; {25341#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:03:20,602 INFO L273 TraceCheckUtils]: 42: Hoare triple {25341#(<= 100000 ~SIZE~0)} assume true; {25341#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:03:20,603 INFO L268 TraceCheckUtils]: 43: Hoare quadruple {25341#(<= 100000 ~SIZE~0)} {25466#(and (<= main_~v~0 2) (<= 100000 ~SIZE~0))} #132#return; {25466#(and (<= main_~v~0 2) (<= 100000 ~SIZE~0))} is VALID [2018-11-18 23:03:20,604 INFO L273 TraceCheckUtils]: 44: Hoare triple {25466#(and (<= main_~v~0 2) (<= 100000 ~SIZE~0))} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {25466#(and (<= main_~v~0 2) (<= 100000 ~SIZE~0))} is VALID [2018-11-18 23:03:20,605 INFO L273 TraceCheckUtils]: 45: Hoare triple {25466#(and (<= main_~v~0 2) (<= 100000 ~SIZE~0))} assume !(1 != #t~ret4);havoc #t~mem3;havoc #t~ret4; {25466#(and (<= main_~v~0 2) (<= 100000 ~SIZE~0))} is VALID [2018-11-18 23:03:20,605 INFO L273 TraceCheckUtils]: 46: Hoare triple {25466#(and (<= main_~v~0 2) (<= 100000 ~SIZE~0))} #t~post2 := ~v~0;~v~0 := 1 + #t~post2;havoc #t~post2; {25503#(and (<= main_~v~0 3) (<= 100000 ~SIZE~0))} is VALID [2018-11-18 23:03:20,606 INFO L273 TraceCheckUtils]: 47: Hoare triple {25503#(and (<= main_~v~0 3) (<= 100000 ~SIZE~0))} assume true; {25503#(and (<= main_~v~0 3) (<= 100000 ~SIZE~0))} is VALID [2018-11-18 23:03:20,607 INFO L273 TraceCheckUtils]: 48: Hoare triple {25503#(and (<= main_~v~0 3) (<= 100000 ~SIZE~0))} assume !!(~v~0 < ~SIZE~0);call #t~mem3 := read~int(~#values~0.base, ~#values~0.offset + 4 * ~v~0, 4); {25503#(and (<= main_~v~0 3) (<= 100000 ~SIZE~0))} is VALID [2018-11-18 23:03:20,608 INFO L256 TraceCheckUtils]: 49: Hoare triple {25503#(and (<= main_~v~0 3) (<= 100000 ~SIZE~0))} call #t~ret4 := elem_exists(~#set~0.base, ~#set~0.offset, ~n~0, #t~mem3); {25341#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:03:20,609 INFO L273 TraceCheckUtils]: 50: Hoare triple {25341#(<= 100000 ~SIZE~0)} ~set.base, ~set.offset := #in~set.base, #in~set.offset;~size := #in~size;~value := #in~value;havoc ~i~0;~i~0 := 0; {25341#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:03:20,609 INFO L273 TraceCheckUtils]: 51: Hoare triple {25341#(<= 100000 ~SIZE~0)} assume true; {25341#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:03:20,610 INFO L273 TraceCheckUtils]: 52: Hoare triple {25341#(<= 100000 ~SIZE~0)} assume !!(~i~0 < ~size);call #t~mem1 := read~int(~set.base, ~set.offset + 4 * ~i~0, 4); {25341#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:03:20,610 INFO L273 TraceCheckUtils]: 53: Hoare triple {25341#(<= 100000 ~SIZE~0)} assume #t~mem1 == ~value;havoc #t~mem1;#res := 1; {25341#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:03:20,611 INFO L273 TraceCheckUtils]: 54: Hoare triple {25341#(<= 100000 ~SIZE~0)} assume true; {25341#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:03:20,612 INFO L268 TraceCheckUtils]: 55: Hoare quadruple {25341#(<= 100000 ~SIZE~0)} {25503#(and (<= main_~v~0 3) (<= 100000 ~SIZE~0))} #132#return; {25503#(and (<= main_~v~0 3) (<= 100000 ~SIZE~0))} is VALID [2018-11-18 23:03:20,612 INFO L273 TraceCheckUtils]: 56: Hoare triple {25503#(and (<= main_~v~0 3) (<= 100000 ~SIZE~0))} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {25503#(and (<= main_~v~0 3) (<= 100000 ~SIZE~0))} is VALID [2018-11-18 23:03:20,613 INFO L273 TraceCheckUtils]: 57: Hoare triple {25503#(and (<= main_~v~0 3) (<= 100000 ~SIZE~0))} assume !(1 != #t~ret4);havoc #t~mem3;havoc #t~ret4; {25503#(and (<= main_~v~0 3) (<= 100000 ~SIZE~0))} is VALID [2018-11-18 23:03:20,614 INFO L273 TraceCheckUtils]: 58: Hoare triple {25503#(and (<= main_~v~0 3) (<= 100000 ~SIZE~0))} #t~post2 := ~v~0;~v~0 := 1 + #t~post2;havoc #t~post2; {25540#(and (<= main_~v~0 4) (<= 100000 ~SIZE~0))} is VALID [2018-11-18 23:03:20,615 INFO L273 TraceCheckUtils]: 59: Hoare triple {25540#(and (<= main_~v~0 4) (<= 100000 ~SIZE~0))} assume true; {25540#(and (<= main_~v~0 4) (<= 100000 ~SIZE~0))} is VALID [2018-11-18 23:03:20,615 INFO L273 TraceCheckUtils]: 60: Hoare triple {25540#(and (<= main_~v~0 4) (<= 100000 ~SIZE~0))} assume !!(~v~0 < ~SIZE~0);call #t~mem3 := read~int(~#values~0.base, ~#values~0.offset + 4 * ~v~0, 4); {25540#(and (<= main_~v~0 4) (<= 100000 ~SIZE~0))} is VALID [2018-11-18 23:03:20,617 INFO L256 TraceCheckUtils]: 61: Hoare triple {25540#(and (<= main_~v~0 4) (<= 100000 ~SIZE~0))} call #t~ret4 := elem_exists(~#set~0.base, ~#set~0.offset, ~n~0, #t~mem3); {25341#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:03:20,617 INFO L273 TraceCheckUtils]: 62: Hoare triple {25341#(<= 100000 ~SIZE~0)} ~set.base, ~set.offset := #in~set.base, #in~set.offset;~size := #in~size;~value := #in~value;havoc ~i~0;~i~0 := 0; {25341#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:03:20,618 INFO L273 TraceCheckUtils]: 63: Hoare triple {25341#(<= 100000 ~SIZE~0)} assume true; {25341#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:03:20,618 INFO L273 TraceCheckUtils]: 64: Hoare triple {25341#(<= 100000 ~SIZE~0)} assume !!(~i~0 < ~size);call #t~mem1 := read~int(~set.base, ~set.offset + 4 * ~i~0, 4); {25341#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:03:20,619 INFO L273 TraceCheckUtils]: 65: Hoare triple {25341#(<= 100000 ~SIZE~0)} assume #t~mem1 == ~value;havoc #t~mem1;#res := 1; {25341#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:03:20,619 INFO L273 TraceCheckUtils]: 66: Hoare triple {25341#(<= 100000 ~SIZE~0)} assume true; {25341#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:03:20,620 INFO L268 TraceCheckUtils]: 67: Hoare quadruple {25341#(<= 100000 ~SIZE~0)} {25540#(and (<= main_~v~0 4) (<= 100000 ~SIZE~0))} #132#return; {25540#(and (<= main_~v~0 4) (<= 100000 ~SIZE~0))} is VALID [2018-11-18 23:03:20,621 INFO L273 TraceCheckUtils]: 68: Hoare triple {25540#(and (<= main_~v~0 4) (<= 100000 ~SIZE~0))} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {25540#(and (<= main_~v~0 4) (<= 100000 ~SIZE~0))} is VALID [2018-11-18 23:03:20,622 INFO L273 TraceCheckUtils]: 69: Hoare triple {25540#(and (<= main_~v~0 4) (<= 100000 ~SIZE~0))} assume !(1 != #t~ret4);havoc #t~mem3;havoc #t~ret4; {25540#(and (<= main_~v~0 4) (<= 100000 ~SIZE~0))} is VALID [2018-11-18 23:03:20,622 INFO L273 TraceCheckUtils]: 70: Hoare triple {25540#(and (<= main_~v~0 4) (<= 100000 ~SIZE~0))} #t~post2 := ~v~0;~v~0 := 1 + #t~post2;havoc #t~post2; {25577#(and (<= main_~v~0 5) (<= 100000 ~SIZE~0))} is VALID [2018-11-18 23:03:20,623 INFO L273 TraceCheckUtils]: 71: Hoare triple {25577#(and (<= main_~v~0 5) (<= 100000 ~SIZE~0))} assume true; {25577#(and (<= main_~v~0 5) (<= 100000 ~SIZE~0))} is VALID [2018-11-18 23:03:20,624 INFO L273 TraceCheckUtils]: 72: Hoare triple {25577#(and (<= main_~v~0 5) (<= 100000 ~SIZE~0))} assume !!(~v~0 < ~SIZE~0);call #t~mem3 := read~int(~#values~0.base, ~#values~0.offset + 4 * ~v~0, 4); {25577#(and (<= main_~v~0 5) (<= 100000 ~SIZE~0))} is VALID [2018-11-18 23:03:20,625 INFO L256 TraceCheckUtils]: 73: Hoare triple {25577#(and (<= main_~v~0 5) (<= 100000 ~SIZE~0))} call #t~ret4 := elem_exists(~#set~0.base, ~#set~0.offset, ~n~0, #t~mem3); {25341#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:03:20,626 INFO L273 TraceCheckUtils]: 74: Hoare triple {25341#(<= 100000 ~SIZE~0)} ~set.base, ~set.offset := #in~set.base, #in~set.offset;~size := #in~size;~value := #in~value;havoc ~i~0;~i~0 := 0; {25341#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:03:20,626 INFO L273 TraceCheckUtils]: 75: Hoare triple {25341#(<= 100000 ~SIZE~0)} assume true; {25341#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:03:20,627 INFO L273 TraceCheckUtils]: 76: Hoare triple {25341#(<= 100000 ~SIZE~0)} assume !!(~i~0 < ~size);call #t~mem1 := read~int(~set.base, ~set.offset + 4 * ~i~0, 4); {25341#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:03:20,627 INFO L273 TraceCheckUtils]: 77: Hoare triple {25341#(<= 100000 ~SIZE~0)} assume #t~mem1 == ~value;havoc #t~mem1;#res := 1; {25341#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:03:20,628 INFO L273 TraceCheckUtils]: 78: Hoare triple {25341#(<= 100000 ~SIZE~0)} assume true; {25341#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:03:20,629 INFO L268 TraceCheckUtils]: 79: Hoare quadruple {25341#(<= 100000 ~SIZE~0)} {25577#(and (<= main_~v~0 5) (<= 100000 ~SIZE~0))} #132#return; {25577#(and (<= main_~v~0 5) (<= 100000 ~SIZE~0))} is VALID [2018-11-18 23:03:20,629 INFO L273 TraceCheckUtils]: 80: Hoare triple {25577#(and (<= main_~v~0 5) (<= 100000 ~SIZE~0))} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {25577#(and (<= main_~v~0 5) (<= 100000 ~SIZE~0))} is VALID [2018-11-18 23:03:20,630 INFO L273 TraceCheckUtils]: 81: Hoare triple {25577#(and (<= main_~v~0 5) (<= 100000 ~SIZE~0))} assume !(1 != #t~ret4);havoc #t~mem3;havoc #t~ret4; {25577#(and (<= main_~v~0 5) (<= 100000 ~SIZE~0))} is VALID [2018-11-18 23:03:20,631 INFO L273 TraceCheckUtils]: 82: Hoare triple {25577#(and (<= main_~v~0 5) (<= 100000 ~SIZE~0))} #t~post2 := ~v~0;~v~0 := 1 + #t~post2;havoc #t~post2; {25614#(and (<= main_~v~0 6) (<= 100000 ~SIZE~0))} is VALID [2018-11-18 23:03:20,631 INFO L273 TraceCheckUtils]: 83: Hoare triple {25614#(and (<= main_~v~0 6) (<= 100000 ~SIZE~0))} assume true; {25614#(and (<= main_~v~0 6) (<= 100000 ~SIZE~0))} is VALID [2018-11-18 23:03:20,632 INFO L273 TraceCheckUtils]: 84: Hoare triple {25614#(and (<= main_~v~0 6) (<= 100000 ~SIZE~0))} assume !!(~v~0 < ~SIZE~0);call #t~mem3 := read~int(~#values~0.base, ~#values~0.offset + 4 * ~v~0, 4); {25614#(and (<= main_~v~0 6) (<= 100000 ~SIZE~0))} is VALID [2018-11-18 23:03:20,633 INFO L256 TraceCheckUtils]: 85: Hoare triple {25614#(and (<= main_~v~0 6) (<= 100000 ~SIZE~0))} call #t~ret4 := elem_exists(~#set~0.base, ~#set~0.offset, ~n~0, #t~mem3); {25341#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:03:20,634 INFO L273 TraceCheckUtils]: 86: Hoare triple {25341#(<= 100000 ~SIZE~0)} ~set.base, ~set.offset := #in~set.base, #in~set.offset;~size := #in~size;~value := #in~value;havoc ~i~0;~i~0 := 0; {25341#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:03:20,634 INFO L273 TraceCheckUtils]: 87: Hoare triple {25341#(<= 100000 ~SIZE~0)} assume true; {25341#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:03:20,635 INFO L273 TraceCheckUtils]: 88: Hoare triple {25341#(<= 100000 ~SIZE~0)} assume !!(~i~0 < ~size);call #t~mem1 := read~int(~set.base, ~set.offset + 4 * ~i~0, 4); {25341#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:03:20,635 INFO L273 TraceCheckUtils]: 89: Hoare triple {25341#(<= 100000 ~SIZE~0)} assume #t~mem1 == ~value;havoc #t~mem1;#res := 1; {25341#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:03:20,636 INFO L273 TraceCheckUtils]: 90: Hoare triple {25341#(<= 100000 ~SIZE~0)} assume true; {25341#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:03:20,637 INFO L268 TraceCheckUtils]: 91: Hoare quadruple {25341#(<= 100000 ~SIZE~0)} {25614#(and (<= main_~v~0 6) (<= 100000 ~SIZE~0))} #132#return; {25614#(and (<= main_~v~0 6) (<= 100000 ~SIZE~0))} is VALID [2018-11-18 23:03:20,638 INFO L273 TraceCheckUtils]: 92: Hoare triple {25614#(and (<= main_~v~0 6) (<= 100000 ~SIZE~0))} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {25614#(and (<= main_~v~0 6) (<= 100000 ~SIZE~0))} is VALID [2018-11-18 23:03:20,638 INFO L273 TraceCheckUtils]: 93: Hoare triple {25614#(and (<= main_~v~0 6) (<= 100000 ~SIZE~0))} assume !(1 != #t~ret4);havoc #t~mem3;havoc #t~ret4; {25614#(and (<= main_~v~0 6) (<= 100000 ~SIZE~0))} is VALID [2018-11-18 23:03:20,639 INFO L273 TraceCheckUtils]: 94: Hoare triple {25614#(and (<= main_~v~0 6) (<= 100000 ~SIZE~0))} #t~post2 := ~v~0;~v~0 := 1 + #t~post2;havoc #t~post2; {25651#(and (<= main_~v~0 7) (<= 100000 ~SIZE~0))} is VALID [2018-11-18 23:03:20,640 INFO L273 TraceCheckUtils]: 95: Hoare triple {25651#(and (<= main_~v~0 7) (<= 100000 ~SIZE~0))} assume true; {25651#(and (<= main_~v~0 7) (<= 100000 ~SIZE~0))} is VALID [2018-11-18 23:03:20,641 INFO L273 TraceCheckUtils]: 96: Hoare triple {25651#(and (<= main_~v~0 7) (<= 100000 ~SIZE~0))} assume !!(~v~0 < ~SIZE~0);call #t~mem3 := read~int(~#values~0.base, ~#values~0.offset + 4 * ~v~0, 4); {25651#(and (<= main_~v~0 7) (<= 100000 ~SIZE~0))} is VALID [2018-11-18 23:03:20,642 INFO L256 TraceCheckUtils]: 97: Hoare triple {25651#(and (<= main_~v~0 7) (<= 100000 ~SIZE~0))} call #t~ret4 := elem_exists(~#set~0.base, ~#set~0.offset, ~n~0, #t~mem3); {25341#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:03:20,642 INFO L273 TraceCheckUtils]: 98: Hoare triple {25341#(<= 100000 ~SIZE~0)} ~set.base, ~set.offset := #in~set.base, #in~set.offset;~size := #in~size;~value := #in~value;havoc ~i~0;~i~0 := 0; {25341#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:03:20,643 INFO L273 TraceCheckUtils]: 99: Hoare triple {25341#(<= 100000 ~SIZE~0)} assume true; {25341#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:03:20,643 INFO L273 TraceCheckUtils]: 100: Hoare triple {25341#(<= 100000 ~SIZE~0)} assume !!(~i~0 < ~size);call #t~mem1 := read~int(~set.base, ~set.offset + 4 * ~i~0, 4); {25341#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:03:20,644 INFO L273 TraceCheckUtils]: 101: Hoare triple {25341#(<= 100000 ~SIZE~0)} assume #t~mem1 == ~value;havoc #t~mem1;#res := 1; {25341#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:03:20,644 INFO L273 TraceCheckUtils]: 102: Hoare triple {25341#(<= 100000 ~SIZE~0)} assume true; {25341#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:03:20,646 INFO L268 TraceCheckUtils]: 103: Hoare quadruple {25341#(<= 100000 ~SIZE~0)} {25651#(and (<= main_~v~0 7) (<= 100000 ~SIZE~0))} #132#return; {25651#(and (<= main_~v~0 7) (<= 100000 ~SIZE~0))} is VALID [2018-11-18 23:03:20,646 INFO L273 TraceCheckUtils]: 104: Hoare triple {25651#(and (<= main_~v~0 7) (<= 100000 ~SIZE~0))} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {25651#(and (<= main_~v~0 7) (<= 100000 ~SIZE~0))} is VALID [2018-11-18 23:03:20,647 INFO L273 TraceCheckUtils]: 105: Hoare triple {25651#(and (<= main_~v~0 7) (<= 100000 ~SIZE~0))} assume !(1 != #t~ret4);havoc #t~mem3;havoc #t~ret4; {25651#(and (<= main_~v~0 7) (<= 100000 ~SIZE~0))} is VALID [2018-11-18 23:03:20,648 INFO L273 TraceCheckUtils]: 106: Hoare triple {25651#(and (<= main_~v~0 7) (<= 100000 ~SIZE~0))} #t~post2 := ~v~0;~v~0 := 1 + #t~post2;havoc #t~post2; {25688#(and (<= main_~v~0 8) (<= 100000 ~SIZE~0))} is VALID [2018-11-18 23:03:20,648 INFO L273 TraceCheckUtils]: 107: Hoare triple {25688#(and (<= main_~v~0 8) (<= 100000 ~SIZE~0))} assume true; {25688#(and (<= main_~v~0 8) (<= 100000 ~SIZE~0))} is VALID [2018-11-18 23:03:20,649 INFO L273 TraceCheckUtils]: 108: Hoare triple {25688#(and (<= main_~v~0 8) (<= 100000 ~SIZE~0))} assume !!(~v~0 < ~SIZE~0);call #t~mem3 := read~int(~#values~0.base, ~#values~0.offset + 4 * ~v~0, 4); {25688#(and (<= main_~v~0 8) (<= 100000 ~SIZE~0))} is VALID [2018-11-18 23:03:20,650 INFO L256 TraceCheckUtils]: 109: Hoare triple {25688#(and (<= main_~v~0 8) (<= 100000 ~SIZE~0))} call #t~ret4 := elem_exists(~#set~0.base, ~#set~0.offset, ~n~0, #t~mem3); {25341#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:03:20,651 INFO L273 TraceCheckUtils]: 110: Hoare triple {25341#(<= 100000 ~SIZE~0)} ~set.base, ~set.offset := #in~set.base, #in~set.offset;~size := #in~size;~value := #in~value;havoc ~i~0;~i~0 := 0; {25341#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:03:20,651 INFO L273 TraceCheckUtils]: 111: Hoare triple {25341#(<= 100000 ~SIZE~0)} assume true; {25341#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:03:20,652 INFO L273 TraceCheckUtils]: 112: Hoare triple {25341#(<= 100000 ~SIZE~0)} assume !!(~i~0 < ~size);call #t~mem1 := read~int(~set.base, ~set.offset + 4 * ~i~0, 4); {25341#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:03:20,652 INFO L273 TraceCheckUtils]: 113: Hoare triple {25341#(<= 100000 ~SIZE~0)} assume #t~mem1 == ~value;havoc #t~mem1;#res := 1; {25341#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:03:20,653 INFO L273 TraceCheckUtils]: 114: Hoare triple {25341#(<= 100000 ~SIZE~0)} assume true; {25341#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:03:20,654 INFO L268 TraceCheckUtils]: 115: Hoare quadruple {25341#(<= 100000 ~SIZE~0)} {25688#(and (<= main_~v~0 8) (<= 100000 ~SIZE~0))} #132#return; {25688#(and (<= main_~v~0 8) (<= 100000 ~SIZE~0))} is VALID [2018-11-18 23:03:20,655 INFO L273 TraceCheckUtils]: 116: Hoare triple {25688#(and (<= main_~v~0 8) (<= 100000 ~SIZE~0))} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {25688#(and (<= main_~v~0 8) (<= 100000 ~SIZE~0))} is VALID [2018-11-18 23:03:20,655 INFO L273 TraceCheckUtils]: 117: Hoare triple {25688#(and (<= main_~v~0 8) (<= 100000 ~SIZE~0))} assume !(1 != #t~ret4);havoc #t~mem3;havoc #t~ret4; {25688#(and (<= main_~v~0 8) (<= 100000 ~SIZE~0))} is VALID [2018-11-18 23:03:20,656 INFO L273 TraceCheckUtils]: 118: Hoare triple {25688#(and (<= main_~v~0 8) (<= 100000 ~SIZE~0))} #t~post2 := ~v~0;~v~0 := 1 + #t~post2;havoc #t~post2; {25725#(and (<= main_~v~0 9) (<= 100000 ~SIZE~0))} is VALID [2018-11-18 23:03:20,657 INFO L273 TraceCheckUtils]: 119: Hoare triple {25725#(and (<= main_~v~0 9) (<= 100000 ~SIZE~0))} assume true; {25725#(and (<= main_~v~0 9) (<= 100000 ~SIZE~0))} is VALID [2018-11-18 23:03:20,658 INFO L273 TraceCheckUtils]: 120: Hoare triple {25725#(and (<= main_~v~0 9) (<= 100000 ~SIZE~0))} assume !!(~v~0 < ~SIZE~0);call #t~mem3 := read~int(~#values~0.base, ~#values~0.offset + 4 * ~v~0, 4); {25725#(and (<= main_~v~0 9) (<= 100000 ~SIZE~0))} is VALID [2018-11-18 23:03:20,659 INFO L256 TraceCheckUtils]: 121: Hoare triple {25725#(and (<= main_~v~0 9) (<= 100000 ~SIZE~0))} call #t~ret4 := elem_exists(~#set~0.base, ~#set~0.offset, ~n~0, #t~mem3); {25341#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:03:20,659 INFO L273 TraceCheckUtils]: 122: Hoare triple {25341#(<= 100000 ~SIZE~0)} ~set.base, ~set.offset := #in~set.base, #in~set.offset;~size := #in~size;~value := #in~value;havoc ~i~0;~i~0 := 0; {25341#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:03:20,660 INFO L273 TraceCheckUtils]: 123: Hoare triple {25341#(<= 100000 ~SIZE~0)} assume true; {25341#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:03:20,660 INFO L273 TraceCheckUtils]: 124: Hoare triple {25341#(<= 100000 ~SIZE~0)} assume !!(~i~0 < ~size);call #t~mem1 := read~int(~set.base, ~set.offset + 4 * ~i~0, 4); {25341#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:03:20,661 INFO L273 TraceCheckUtils]: 125: Hoare triple {25341#(<= 100000 ~SIZE~0)} assume #t~mem1 == ~value;havoc #t~mem1;#res := 1; {25341#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:03:20,661 INFO L273 TraceCheckUtils]: 126: Hoare triple {25341#(<= 100000 ~SIZE~0)} assume true; {25341#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:03:20,663 INFO L268 TraceCheckUtils]: 127: Hoare quadruple {25341#(<= 100000 ~SIZE~0)} {25725#(and (<= main_~v~0 9) (<= 100000 ~SIZE~0))} #132#return; {25725#(and (<= main_~v~0 9) (<= 100000 ~SIZE~0))} is VALID [2018-11-18 23:03:20,663 INFO L273 TraceCheckUtils]: 128: Hoare triple {25725#(and (<= main_~v~0 9) (<= 100000 ~SIZE~0))} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {25725#(and (<= main_~v~0 9) (<= 100000 ~SIZE~0))} is VALID [2018-11-18 23:03:20,664 INFO L273 TraceCheckUtils]: 129: Hoare triple {25725#(and (<= main_~v~0 9) (<= 100000 ~SIZE~0))} assume !(1 != #t~ret4);havoc #t~mem3;havoc #t~ret4; {25725#(and (<= main_~v~0 9) (<= 100000 ~SIZE~0))} is VALID [2018-11-18 23:03:20,665 INFO L273 TraceCheckUtils]: 130: Hoare triple {25725#(and (<= main_~v~0 9) (<= 100000 ~SIZE~0))} #t~post2 := ~v~0;~v~0 := 1 + #t~post2;havoc #t~post2; {25762#(and (<= main_~v~0 10) (<= 100000 ~SIZE~0))} is VALID [2018-11-18 23:03:20,665 INFO L273 TraceCheckUtils]: 131: Hoare triple {25762#(and (<= main_~v~0 10) (<= 100000 ~SIZE~0))} assume true; {25762#(and (<= main_~v~0 10) (<= 100000 ~SIZE~0))} is VALID [2018-11-18 23:03:20,666 INFO L273 TraceCheckUtils]: 132: Hoare triple {25762#(and (<= main_~v~0 10) (<= 100000 ~SIZE~0))} assume !!(~v~0 < ~SIZE~0);call #t~mem3 := read~int(~#values~0.base, ~#values~0.offset + 4 * ~v~0, 4); {25762#(and (<= main_~v~0 10) (<= 100000 ~SIZE~0))} is VALID [2018-11-18 23:03:20,667 INFO L256 TraceCheckUtils]: 133: Hoare triple {25762#(and (<= main_~v~0 10) (<= 100000 ~SIZE~0))} call #t~ret4 := elem_exists(~#set~0.base, ~#set~0.offset, ~n~0, #t~mem3); {25341#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:03:20,668 INFO L273 TraceCheckUtils]: 134: Hoare triple {25341#(<= 100000 ~SIZE~0)} ~set.base, ~set.offset := #in~set.base, #in~set.offset;~size := #in~size;~value := #in~value;havoc ~i~0;~i~0 := 0; {25341#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:03:20,668 INFO L273 TraceCheckUtils]: 135: Hoare triple {25341#(<= 100000 ~SIZE~0)} assume true; {25341#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:03:20,669 INFO L273 TraceCheckUtils]: 136: Hoare triple {25341#(<= 100000 ~SIZE~0)} assume !!(~i~0 < ~size);call #t~mem1 := read~int(~set.base, ~set.offset + 4 * ~i~0, 4); {25341#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:03:20,669 INFO L273 TraceCheckUtils]: 137: Hoare triple {25341#(<= 100000 ~SIZE~0)} assume #t~mem1 == ~value;havoc #t~mem1;#res := 1; {25341#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:03:20,670 INFO L273 TraceCheckUtils]: 138: Hoare triple {25341#(<= 100000 ~SIZE~0)} assume true; {25341#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:03:20,671 INFO L268 TraceCheckUtils]: 139: Hoare quadruple {25341#(<= 100000 ~SIZE~0)} {25762#(and (<= main_~v~0 10) (<= 100000 ~SIZE~0))} #132#return; {25762#(and (<= main_~v~0 10) (<= 100000 ~SIZE~0))} is VALID [2018-11-18 23:03:20,672 INFO L273 TraceCheckUtils]: 140: Hoare triple {25762#(and (<= main_~v~0 10) (<= 100000 ~SIZE~0))} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {25762#(and (<= main_~v~0 10) (<= 100000 ~SIZE~0))} is VALID [2018-11-18 23:03:20,673 INFO L273 TraceCheckUtils]: 141: Hoare triple {25762#(and (<= main_~v~0 10) (<= 100000 ~SIZE~0))} assume !(1 != #t~ret4);havoc #t~mem3;havoc #t~ret4; {25762#(and (<= main_~v~0 10) (<= 100000 ~SIZE~0))} is VALID [2018-11-18 23:03:20,673 INFO L273 TraceCheckUtils]: 142: Hoare triple {25762#(and (<= main_~v~0 10) (<= 100000 ~SIZE~0))} #t~post2 := ~v~0;~v~0 := 1 + #t~post2;havoc #t~post2; {25799#(and (<= main_~v~0 11) (<= 100000 ~SIZE~0))} is VALID [2018-11-18 23:03:20,674 INFO L273 TraceCheckUtils]: 143: Hoare triple {25799#(and (<= main_~v~0 11) (<= 100000 ~SIZE~0))} assume true; {25799#(and (<= main_~v~0 11) (<= 100000 ~SIZE~0))} is VALID [2018-11-18 23:03:20,675 INFO L273 TraceCheckUtils]: 144: Hoare triple {25799#(and (<= main_~v~0 11) (<= 100000 ~SIZE~0))} assume !!(~v~0 < ~SIZE~0);call #t~mem3 := read~int(~#values~0.base, ~#values~0.offset + 4 * ~v~0, 4); {25799#(and (<= main_~v~0 11) (<= 100000 ~SIZE~0))} is VALID [2018-11-18 23:03:20,676 INFO L256 TraceCheckUtils]: 145: Hoare triple {25799#(and (<= main_~v~0 11) (<= 100000 ~SIZE~0))} call #t~ret4 := elem_exists(~#set~0.base, ~#set~0.offset, ~n~0, #t~mem3); {25341#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:03:20,677 INFO L273 TraceCheckUtils]: 146: Hoare triple {25341#(<= 100000 ~SIZE~0)} ~set.base, ~set.offset := #in~set.base, #in~set.offset;~size := #in~size;~value := #in~value;havoc ~i~0;~i~0 := 0; {25341#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:03:20,677 INFO L273 TraceCheckUtils]: 147: Hoare triple {25341#(<= 100000 ~SIZE~0)} assume true; {25341#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:03:20,678 INFO L273 TraceCheckUtils]: 148: Hoare triple {25341#(<= 100000 ~SIZE~0)} assume !!(~i~0 < ~size);call #t~mem1 := read~int(~set.base, ~set.offset + 4 * ~i~0, 4); {25341#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:03:20,678 INFO L273 TraceCheckUtils]: 149: Hoare triple {25341#(<= 100000 ~SIZE~0)} assume #t~mem1 == ~value;havoc #t~mem1;#res := 1; {25341#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:03:20,679 INFO L273 TraceCheckUtils]: 150: Hoare triple {25341#(<= 100000 ~SIZE~0)} assume true; {25341#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:03:20,680 INFO L268 TraceCheckUtils]: 151: Hoare quadruple {25341#(<= 100000 ~SIZE~0)} {25799#(and (<= main_~v~0 11) (<= 100000 ~SIZE~0))} #132#return; {25799#(and (<= main_~v~0 11) (<= 100000 ~SIZE~0))} is VALID [2018-11-18 23:03:20,680 INFO L273 TraceCheckUtils]: 152: Hoare triple {25799#(and (<= main_~v~0 11) (<= 100000 ~SIZE~0))} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {25799#(and (<= main_~v~0 11) (<= 100000 ~SIZE~0))} is VALID [2018-11-18 23:03:20,681 INFO L273 TraceCheckUtils]: 153: Hoare triple {25799#(and (<= main_~v~0 11) (<= 100000 ~SIZE~0))} assume !(1 != #t~ret4);havoc #t~mem3;havoc #t~ret4; {25799#(and (<= main_~v~0 11) (<= 100000 ~SIZE~0))} is VALID [2018-11-18 23:03:20,682 INFO L273 TraceCheckUtils]: 154: Hoare triple {25799#(and (<= main_~v~0 11) (<= 100000 ~SIZE~0))} #t~post2 := ~v~0;~v~0 := 1 + #t~post2;havoc #t~post2; {25836#(and (<= main_~v~0 12) (<= 100000 ~SIZE~0))} is VALID [2018-11-18 23:03:20,693 INFO L273 TraceCheckUtils]: 155: Hoare triple {25836#(and (<= main_~v~0 12) (<= 100000 ~SIZE~0))} assume true; {25836#(and (<= main_~v~0 12) (<= 100000 ~SIZE~0))} is VALID [2018-11-18 23:03:20,693 INFO L273 TraceCheckUtils]: 156: Hoare triple {25836#(and (<= main_~v~0 12) (<= 100000 ~SIZE~0))} assume !!(~v~0 < ~SIZE~0);call #t~mem3 := read~int(~#values~0.base, ~#values~0.offset + 4 * ~v~0, 4); {25836#(and (<= main_~v~0 12) (<= 100000 ~SIZE~0))} is VALID [2018-11-18 23:03:20,694 INFO L256 TraceCheckUtils]: 157: Hoare triple {25836#(and (<= main_~v~0 12) (<= 100000 ~SIZE~0))} call #t~ret4 := elem_exists(~#set~0.base, ~#set~0.offset, ~n~0, #t~mem3); {25341#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:03:20,695 INFO L273 TraceCheckUtils]: 158: Hoare triple {25341#(<= 100000 ~SIZE~0)} ~set.base, ~set.offset := #in~set.base, #in~set.offset;~size := #in~size;~value := #in~value;havoc ~i~0;~i~0 := 0; {25341#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:03:20,695 INFO L273 TraceCheckUtils]: 159: Hoare triple {25341#(<= 100000 ~SIZE~0)} assume true; {25341#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:03:20,695 INFO L273 TraceCheckUtils]: 160: Hoare triple {25341#(<= 100000 ~SIZE~0)} assume !!(~i~0 < ~size);call #t~mem1 := read~int(~set.base, ~set.offset + 4 * ~i~0, 4); {25341#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:03:20,695 INFO L273 TraceCheckUtils]: 161: Hoare triple {25341#(<= 100000 ~SIZE~0)} assume #t~mem1 == ~value;havoc #t~mem1;#res := 1; {25341#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:03:20,696 INFO L273 TraceCheckUtils]: 162: Hoare triple {25341#(<= 100000 ~SIZE~0)} assume true; {25341#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:03:20,697 INFO L268 TraceCheckUtils]: 163: Hoare quadruple {25341#(<= 100000 ~SIZE~0)} {25836#(and (<= main_~v~0 12) (<= 100000 ~SIZE~0))} #132#return; {25836#(and (<= main_~v~0 12) (<= 100000 ~SIZE~0))} is VALID [2018-11-18 23:03:20,698 INFO L273 TraceCheckUtils]: 164: Hoare triple {25836#(and (<= main_~v~0 12) (<= 100000 ~SIZE~0))} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {25836#(and (<= main_~v~0 12) (<= 100000 ~SIZE~0))} is VALID [2018-11-18 23:03:20,698 INFO L273 TraceCheckUtils]: 165: Hoare triple {25836#(and (<= main_~v~0 12) (<= 100000 ~SIZE~0))} assume !(1 != #t~ret4);havoc #t~mem3;havoc #t~ret4; {25836#(and (<= main_~v~0 12) (<= 100000 ~SIZE~0))} is VALID [2018-11-18 23:03:20,699 INFO L273 TraceCheckUtils]: 166: Hoare triple {25836#(and (<= main_~v~0 12) (<= 100000 ~SIZE~0))} #t~post2 := ~v~0;~v~0 := 1 + #t~post2;havoc #t~post2; {25873#(and (<= main_~v~0 13) (<= 100000 ~SIZE~0))} is VALID [2018-11-18 23:03:20,700 INFO L273 TraceCheckUtils]: 167: Hoare triple {25873#(and (<= main_~v~0 13) (<= 100000 ~SIZE~0))} assume true; {25873#(and (<= main_~v~0 13) (<= 100000 ~SIZE~0))} is VALID [2018-11-18 23:03:20,701 INFO L273 TraceCheckUtils]: 168: Hoare triple {25873#(and (<= main_~v~0 13) (<= 100000 ~SIZE~0))} assume !!(~v~0 < ~SIZE~0);call #t~mem3 := read~int(~#values~0.base, ~#values~0.offset + 4 * ~v~0, 4); {25873#(and (<= main_~v~0 13) (<= 100000 ~SIZE~0))} is VALID [2018-11-18 23:03:20,702 INFO L256 TraceCheckUtils]: 169: Hoare triple {25873#(and (<= main_~v~0 13) (<= 100000 ~SIZE~0))} call #t~ret4 := elem_exists(~#set~0.base, ~#set~0.offset, ~n~0, #t~mem3); {25341#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:03:20,702 INFO L273 TraceCheckUtils]: 170: Hoare triple {25341#(<= 100000 ~SIZE~0)} ~set.base, ~set.offset := #in~set.base, #in~set.offset;~size := #in~size;~value := #in~value;havoc ~i~0;~i~0 := 0; {25341#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:03:20,703 INFO L273 TraceCheckUtils]: 171: Hoare triple {25341#(<= 100000 ~SIZE~0)} assume true; {25341#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:03:20,703 INFO L273 TraceCheckUtils]: 172: Hoare triple {25341#(<= 100000 ~SIZE~0)} assume !!(~i~0 < ~size);call #t~mem1 := read~int(~set.base, ~set.offset + 4 * ~i~0, 4); {25341#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:03:20,704 INFO L273 TraceCheckUtils]: 173: Hoare triple {25341#(<= 100000 ~SIZE~0)} assume #t~mem1 == ~value;havoc #t~mem1;#res := 1; {25341#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:03:20,704 INFO L273 TraceCheckUtils]: 174: Hoare triple {25341#(<= 100000 ~SIZE~0)} assume true; {25341#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:03:20,706 INFO L268 TraceCheckUtils]: 175: Hoare quadruple {25341#(<= 100000 ~SIZE~0)} {25873#(and (<= main_~v~0 13) (<= 100000 ~SIZE~0))} #132#return; {25873#(and (<= main_~v~0 13) (<= 100000 ~SIZE~0))} is VALID [2018-11-18 23:03:20,706 INFO L273 TraceCheckUtils]: 176: Hoare triple {25873#(and (<= main_~v~0 13) (<= 100000 ~SIZE~0))} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {25873#(and (<= main_~v~0 13) (<= 100000 ~SIZE~0))} is VALID [2018-11-18 23:03:20,707 INFO L273 TraceCheckUtils]: 177: Hoare triple {25873#(and (<= main_~v~0 13) (<= 100000 ~SIZE~0))} assume !(1 != #t~ret4);havoc #t~mem3;havoc #t~ret4; {25873#(and (<= main_~v~0 13) (<= 100000 ~SIZE~0))} is VALID [2018-11-18 23:03:20,708 INFO L273 TraceCheckUtils]: 178: Hoare triple {25873#(and (<= main_~v~0 13) (<= 100000 ~SIZE~0))} #t~post2 := ~v~0;~v~0 := 1 + #t~post2;havoc #t~post2; {25910#(and (<= main_~v~0 14) (<= 100000 ~SIZE~0))} is VALID [2018-11-18 23:03:20,709 INFO L273 TraceCheckUtils]: 179: Hoare triple {25910#(and (<= main_~v~0 14) (<= 100000 ~SIZE~0))} assume true; {25910#(and (<= main_~v~0 14) (<= 100000 ~SIZE~0))} is VALID [2018-11-18 23:03:20,709 INFO L273 TraceCheckUtils]: 180: Hoare triple {25910#(and (<= main_~v~0 14) (<= 100000 ~SIZE~0))} assume !!(~v~0 < ~SIZE~0);call #t~mem3 := read~int(~#values~0.base, ~#values~0.offset + 4 * ~v~0, 4); {25910#(and (<= main_~v~0 14) (<= 100000 ~SIZE~0))} is VALID [2018-11-18 23:03:20,711 INFO L256 TraceCheckUtils]: 181: Hoare triple {25910#(and (<= main_~v~0 14) (<= 100000 ~SIZE~0))} call #t~ret4 := elem_exists(~#set~0.base, ~#set~0.offset, ~n~0, #t~mem3); {25341#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:03:20,711 INFO L273 TraceCheckUtils]: 182: Hoare triple {25341#(<= 100000 ~SIZE~0)} ~set.base, ~set.offset := #in~set.base, #in~set.offset;~size := #in~size;~value := #in~value;havoc ~i~0;~i~0 := 0; {25341#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:03:20,712 INFO L273 TraceCheckUtils]: 183: Hoare triple {25341#(<= 100000 ~SIZE~0)} assume true; {25341#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:03:20,712 INFO L273 TraceCheckUtils]: 184: Hoare triple {25341#(<= 100000 ~SIZE~0)} assume !!(~i~0 < ~size);call #t~mem1 := read~int(~set.base, ~set.offset + 4 * ~i~0, 4); {25341#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:03:20,713 INFO L273 TraceCheckUtils]: 185: Hoare triple {25341#(<= 100000 ~SIZE~0)} assume #t~mem1 == ~value;havoc #t~mem1;#res := 1; {25341#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:03:20,713 INFO L273 TraceCheckUtils]: 186: Hoare triple {25341#(<= 100000 ~SIZE~0)} assume true; {25341#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:03:20,714 INFO L268 TraceCheckUtils]: 187: Hoare quadruple {25341#(<= 100000 ~SIZE~0)} {25910#(and (<= main_~v~0 14) (<= 100000 ~SIZE~0))} #132#return; {25910#(and (<= main_~v~0 14) (<= 100000 ~SIZE~0))} is VALID [2018-11-18 23:03:20,715 INFO L273 TraceCheckUtils]: 188: Hoare triple {25910#(and (<= main_~v~0 14) (<= 100000 ~SIZE~0))} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {25910#(and (<= main_~v~0 14) (<= 100000 ~SIZE~0))} is VALID [2018-11-18 23:03:20,716 INFO L273 TraceCheckUtils]: 189: Hoare triple {25910#(and (<= main_~v~0 14) (<= 100000 ~SIZE~0))} assume !(1 != #t~ret4);havoc #t~mem3;havoc #t~ret4; {25910#(and (<= main_~v~0 14) (<= 100000 ~SIZE~0))} is VALID [2018-11-18 23:03:20,716 INFO L273 TraceCheckUtils]: 190: Hoare triple {25910#(and (<= main_~v~0 14) (<= 100000 ~SIZE~0))} #t~post2 := ~v~0;~v~0 := 1 + #t~post2;havoc #t~post2; {25947#(and (<= main_~v~0 15) (<= 100000 ~SIZE~0))} is VALID [2018-11-18 23:03:20,717 INFO L273 TraceCheckUtils]: 191: Hoare triple {25947#(and (<= main_~v~0 15) (<= 100000 ~SIZE~0))} assume true; {25947#(and (<= main_~v~0 15) (<= 100000 ~SIZE~0))} is VALID [2018-11-18 23:03:20,718 INFO L273 TraceCheckUtils]: 192: Hoare triple {25947#(and (<= main_~v~0 15) (<= 100000 ~SIZE~0))} assume !!(~v~0 < ~SIZE~0);call #t~mem3 := read~int(~#values~0.base, ~#values~0.offset + 4 * ~v~0, 4); {25947#(and (<= main_~v~0 15) (<= 100000 ~SIZE~0))} is VALID [2018-11-18 23:03:20,719 INFO L256 TraceCheckUtils]: 193: Hoare triple {25947#(and (<= main_~v~0 15) (<= 100000 ~SIZE~0))} call #t~ret4 := elem_exists(~#set~0.base, ~#set~0.offset, ~n~0, #t~mem3); {25341#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:03:20,720 INFO L273 TraceCheckUtils]: 194: Hoare triple {25341#(<= 100000 ~SIZE~0)} ~set.base, ~set.offset := #in~set.base, #in~set.offset;~size := #in~size;~value := #in~value;havoc ~i~0;~i~0 := 0; {25341#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:03:20,720 INFO L273 TraceCheckUtils]: 195: Hoare triple {25341#(<= 100000 ~SIZE~0)} assume true; {25341#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:03:20,721 INFO L273 TraceCheckUtils]: 196: Hoare triple {25341#(<= 100000 ~SIZE~0)} assume !!(~i~0 < ~size);call #t~mem1 := read~int(~set.base, ~set.offset + 4 * ~i~0, 4); {25341#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:03:20,721 INFO L273 TraceCheckUtils]: 197: Hoare triple {25341#(<= 100000 ~SIZE~0)} assume #t~mem1 == ~value;havoc #t~mem1;#res := 1; {25341#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:03:20,722 INFO L273 TraceCheckUtils]: 198: Hoare triple {25341#(<= 100000 ~SIZE~0)} assume true; {25341#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:03:20,723 INFO L268 TraceCheckUtils]: 199: Hoare quadruple {25341#(<= 100000 ~SIZE~0)} {25947#(and (<= main_~v~0 15) (<= 100000 ~SIZE~0))} #132#return; {25947#(and (<= main_~v~0 15) (<= 100000 ~SIZE~0))} is VALID [2018-11-18 23:03:20,724 INFO L273 TraceCheckUtils]: 200: Hoare triple {25947#(and (<= main_~v~0 15) (<= 100000 ~SIZE~0))} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {25947#(and (<= main_~v~0 15) (<= 100000 ~SIZE~0))} is VALID [2018-11-18 23:03:20,724 INFO L273 TraceCheckUtils]: 201: Hoare triple {25947#(and (<= main_~v~0 15) (<= 100000 ~SIZE~0))} assume !(1 != #t~ret4);havoc #t~mem3;havoc #t~ret4; {25947#(and (<= main_~v~0 15) (<= 100000 ~SIZE~0))} is VALID [2018-11-18 23:03:20,725 INFO L273 TraceCheckUtils]: 202: Hoare triple {25947#(and (<= main_~v~0 15) (<= 100000 ~SIZE~0))} #t~post2 := ~v~0;~v~0 := 1 + #t~post2;havoc #t~post2; {25984#(and (<= main_~v~0 16) (<= 100000 ~SIZE~0))} is VALID [2018-11-18 23:03:20,726 INFO L273 TraceCheckUtils]: 203: Hoare triple {25984#(and (<= main_~v~0 16) (<= 100000 ~SIZE~0))} assume true; {25984#(and (<= main_~v~0 16) (<= 100000 ~SIZE~0))} is VALID [2018-11-18 23:03:20,726 INFO L273 TraceCheckUtils]: 204: Hoare triple {25984#(and (<= main_~v~0 16) (<= 100000 ~SIZE~0))} assume !(~v~0 < ~SIZE~0); {25340#false} is VALID [2018-11-18 23:03:20,727 INFO L273 TraceCheckUtils]: 205: Hoare triple {25340#false} ~i~1 := 0; {25340#false} is VALID [2018-11-18 23:03:20,727 INFO L273 TraceCheckUtils]: 206: Hoare triple {25340#false} assume true; {25340#false} is VALID [2018-11-18 23:03:20,727 INFO L273 TraceCheckUtils]: 207: Hoare triple {25340#false} assume !!(~i~1 < ~SIZE~0 && 1 != ~found~0);call #t~mem8 := read~int(~#set~0.base, ~#set~0.offset + 4 * ~i~1, 4); {25340#false} is VALID [2018-11-18 23:03:20,727 INFO L273 TraceCheckUtils]: 208: Hoare triple {25340#false} assume !(#t~mem8 == ~element~0);havoc #t~mem8; {25340#false} is VALID [2018-11-18 23:03:20,727 INFO L273 TraceCheckUtils]: 209: Hoare triple {25340#false} #t~post7 := ~i~1;~i~1 := 1 + #t~post7;havoc #t~post7; {25340#false} is VALID [2018-11-18 23:03:20,728 INFO L273 TraceCheckUtils]: 210: Hoare triple {25340#false} assume true; {25340#false} is VALID [2018-11-18 23:03:20,728 INFO L273 TraceCheckUtils]: 211: Hoare triple {25340#false} assume !!(~i~1 < ~SIZE~0 && 1 != ~found~0);call #t~mem8 := read~int(~#set~0.base, ~#set~0.offset + 4 * ~i~1, 4); {25340#false} is VALID [2018-11-18 23:03:20,728 INFO L273 TraceCheckUtils]: 212: Hoare triple {25340#false} assume !(#t~mem8 == ~element~0);havoc #t~mem8; {25340#false} is VALID [2018-11-18 23:03:20,728 INFO L273 TraceCheckUtils]: 213: Hoare triple {25340#false} #t~post7 := ~i~1;~i~1 := 1 + #t~post7;havoc #t~post7; {25340#false} is VALID [2018-11-18 23:03:20,728 INFO L273 TraceCheckUtils]: 214: Hoare triple {25340#false} assume true; {25340#false} is VALID [2018-11-18 23:03:20,729 INFO L273 TraceCheckUtils]: 215: Hoare triple {25340#false} assume !!(~i~1 < ~SIZE~0 && 1 != ~found~0);call #t~mem8 := read~int(~#set~0.base, ~#set~0.offset + 4 * ~i~1, 4); {25340#false} is VALID [2018-11-18 23:03:20,729 INFO L273 TraceCheckUtils]: 216: Hoare triple {25340#false} assume #t~mem8 == ~element~0;havoc #t~mem8;~found~0 := 1;~pos~0 := ~i~1; {25340#false} is VALID [2018-11-18 23:03:20,729 INFO L273 TraceCheckUtils]: 217: Hoare triple {25340#false} #t~post7 := ~i~1;~i~1 := 1 + #t~post7;havoc #t~post7; {25340#false} is VALID [2018-11-18 23:03:20,729 INFO L273 TraceCheckUtils]: 218: Hoare triple {25340#false} assume true; {25340#false} is VALID [2018-11-18 23:03:20,729 INFO L273 TraceCheckUtils]: 219: Hoare triple {25340#false} assume !(~i~1 < ~SIZE~0 && 1 != ~found~0); {25340#false} is VALID [2018-11-18 23:03:20,729 INFO L273 TraceCheckUtils]: 220: Hoare triple {25340#false} assume 1 == ~found~0;~i~1 := ~pos~0; {25340#false} is VALID [2018-11-18 23:03:20,730 INFO L273 TraceCheckUtils]: 221: Hoare triple {25340#false} assume true; {25340#false} is VALID [2018-11-18 23:03:20,730 INFO L273 TraceCheckUtils]: 222: Hoare triple {25340#false} assume !!(~i~1 < ~SIZE~0 - 1);call #t~mem10 := read~int(~#set~0.base, ~#set~0.offset + 4 * (1 + ~i~1), 4);call write~int(#t~mem10, ~#set~0.base, ~#set~0.offset + 4 * ~i~1, 4);havoc #t~mem10; {25340#false} is VALID [2018-11-18 23:03:20,730 INFO L273 TraceCheckUtils]: 223: Hoare triple {25340#false} #t~post9 := ~i~1;~i~1 := 1 + #t~post9;havoc #t~post9; {25340#false} is VALID [2018-11-18 23:03:20,730 INFO L273 TraceCheckUtils]: 224: Hoare triple {25340#false} assume true; {25340#false} is VALID [2018-11-18 23:03:20,730 INFO L273 TraceCheckUtils]: 225: Hoare triple {25340#false} assume !!(~i~1 < ~SIZE~0 - 1);call #t~mem10 := read~int(~#set~0.base, ~#set~0.offset + 4 * (1 + ~i~1), 4);call write~int(#t~mem10, ~#set~0.base, ~#set~0.offset + 4 * ~i~1, 4);havoc #t~mem10; {25340#false} is VALID [2018-11-18 23:03:20,731 INFO L273 TraceCheckUtils]: 226: Hoare triple {25340#false} #t~post9 := ~i~1;~i~1 := 1 + #t~post9;havoc #t~post9; {25340#false} is VALID [2018-11-18 23:03:20,731 INFO L273 TraceCheckUtils]: 227: Hoare triple {25340#false} assume true; {25340#false} is VALID [2018-11-18 23:03:20,731 INFO L273 TraceCheckUtils]: 228: Hoare triple {25340#false} assume !(~i~1 < ~SIZE~0 - 1); {25340#false} is VALID [2018-11-18 23:03:20,731 INFO L273 TraceCheckUtils]: 229: Hoare triple {25340#false} assume 1 == ~found~0;~i~1 := 0; {25340#false} is VALID [2018-11-18 23:03:20,731 INFO L273 TraceCheckUtils]: 230: Hoare triple {25340#false} assume true; {25340#false} is VALID [2018-11-18 23:03:20,731 INFO L273 TraceCheckUtils]: 231: Hoare triple {25340#false} assume !!(~i~1 < ~SIZE~0 - 1);call #t~mem12 := read~int(~#set~0.base, ~#set~0.offset + 4 * ~i~1, 4); {25340#false} is VALID [2018-11-18 23:03:20,731 INFO L256 TraceCheckUtils]: 232: Hoare triple {25340#false} call __VERIFIER_assert((if #t~mem12 != ~element~0 then 1 else 0)); {25340#false} is VALID [2018-11-18 23:03:20,731 INFO L273 TraceCheckUtils]: 233: Hoare triple {25340#false} ~cond := #in~cond; {25340#false} is VALID [2018-11-18 23:03:20,731 INFO L273 TraceCheckUtils]: 234: Hoare triple {25340#false} assume 0 == ~cond; {25340#false} is VALID [2018-11-18 23:03:20,732 INFO L273 TraceCheckUtils]: 235: Hoare triple {25340#false} assume !false; {25340#false} is VALID [2018-11-18 23:03:20,783 INFO L134 CoverageAnalysis]: Checked inductivity of 1482 backedges. 0 proven. 752 refuted. 0 times theorem prover too weak. 730 trivial. 0 not checked. [2018-11-18 23:03:20,802 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-18 23:03:20,803 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 20] total 37 [2018-11-18 23:03:20,803 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 236 [2018-11-18 23:03:20,804 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-18 23:03:20,804 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 37 states. [2018-11-18 23:03:21,087 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 278 edges. 278 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 23:03:21,088 INFO L459 AbstractCegarLoop]: Interpolant automaton has 37 states [2018-11-18 23:03:21,088 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2018-11-18 23:03:21,089 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=530, Invalid=802, Unknown=0, NotChecked=0, Total=1332 [2018-11-18 23:03:21,089 INFO L87 Difference]: Start difference. First operand 255 states and 338 transitions. Second operand 37 states. [2018-11-18 23:03:24,958 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 23:03:24,958 INFO L93 Difference]: Finished difference Result 344 states and 444 transitions. [2018-11-18 23:03:24,958 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-11-18 23:03:24,958 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 236 [2018-11-18 23:03:24,959 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 23:03:24,959 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2018-11-18 23:03:24,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 264 transitions. [2018-11-18 23:03:24,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2018-11-18 23:03:24,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 264 transitions. [2018-11-18 23:03:24,966 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 20 states and 264 transitions. [2018-11-18 23:03:25,281 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 264 edges. 264 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 23:03:25,288 INFO L225 Difference]: With dead ends: 344 [2018-11-18 23:03:25,288 INFO L226 Difference]: Without dead ends: 273 [2018-11-18 23:03:25,289 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 255 GetRequests, 220 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 541 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=530, Invalid=802, Unknown=0, NotChecked=0, Total=1332 [2018-11-18 23:03:25,289 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 273 states. [2018-11-18 23:03:25,894 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 273 to 265. [2018-11-18 23:03:25,894 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-18 23:03:25,894 INFO L82 GeneralOperation]: Start isEquivalent. First operand 273 states. Second operand 265 states. [2018-11-18 23:03:25,894 INFO L74 IsIncluded]: Start isIncluded. First operand 273 states. Second operand 265 states. [2018-11-18 23:03:25,895 INFO L87 Difference]: Start difference. First operand 273 states. Second operand 265 states. [2018-11-18 23:03:25,901 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 23:03:25,901 INFO L93 Difference]: Finished difference Result 273 states and 366 transitions. [2018-11-18 23:03:25,901 INFO L276 IsEmpty]: Start isEmpty. Operand 273 states and 366 transitions. [2018-11-18 23:03:25,902 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 23:03:25,902 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 23:03:25,902 INFO L74 IsIncluded]: Start isIncluded. First operand 265 states. Second operand 273 states. [2018-11-18 23:03:25,902 INFO L87 Difference]: Start difference. First operand 265 states. Second operand 273 states. [2018-11-18 23:03:25,910 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 23:03:25,911 INFO L93 Difference]: Finished difference Result 273 states and 366 transitions. [2018-11-18 23:03:25,911 INFO L276 IsEmpty]: Start isEmpty. Operand 273 states and 366 transitions. [2018-11-18 23:03:25,912 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 23:03:25,912 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 23:03:25,912 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-18 23:03:25,912 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-18 23:03:25,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 265 states. [2018-11-18 23:03:25,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 265 states to 265 states and 353 transitions. [2018-11-18 23:03:25,920 INFO L78 Accepts]: Start accepts. Automaton has 265 states and 353 transitions. Word has length 236 [2018-11-18 23:03:25,921 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 23:03:25,921 INFO L480 AbstractCegarLoop]: Abstraction has 265 states and 353 transitions. [2018-11-18 23:03:25,921 INFO L481 AbstractCegarLoop]: Interpolant automaton has 37 states. [2018-11-18 23:03:25,921 INFO L276 IsEmpty]: Start isEmpty. Operand 265 states and 353 transitions. [2018-11-18 23:03:25,923 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 249 [2018-11-18 23:03:25,923 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 23:03:25,923 INFO L375 BasicCegarLoop]: trace histogram [18, 17, 17, 17, 17, 17, 17, 17, 17, 16, 16, 16, 4, 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 23:03:25,923 INFO L423 AbstractCegarLoop]: === Iteration 24 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 23:03:25,923 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 23:03:25,924 INFO L82 PathProgramCache]: Analyzing trace with hash 655693959, now seen corresponding path program 8 times [2018-11-18 23:03:25,924 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 23:03:25,924 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 23:03:25,925 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 23:03:25,925 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 23:03:25,925 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 23:03:25,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 23:03:26,613 INFO L256 TraceCheckUtils]: 0: Hoare triple {27423#true} call ULTIMATE.init(); {27423#true} is VALID [2018-11-18 23:03:26,622 INFO L273 TraceCheckUtils]: 1: Hoare triple {27423#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~SIZE~0 := 100000; {27425#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:03:26,635 INFO L273 TraceCheckUtils]: 2: Hoare triple {27425#(<= 100000 ~SIZE~0)} assume true; {27425#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:03:26,647 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {27425#(<= 100000 ~SIZE~0)} {27423#true} #128#return; {27425#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:03:26,660 INFO L256 TraceCheckUtils]: 4: Hoare triple {27425#(<= 100000 ~SIZE~0)} call #t~ret13 := main(); {27425#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:03:26,673 INFO L273 TraceCheckUtils]: 5: Hoare triple {27425#(<= 100000 ~SIZE~0)} havoc ~i~1;havoc ~pos~0;~n~0 := 0;~found~0 := 0;call ~#set~0.base, ~#set~0.offset := #Ultimate.alloc(4 * ~SIZE~0);call ~#values~0.base, ~#values~0.offset := #Ultimate.alloc(4 * ~SIZE~0);havoc ~element~0;havoc ~v~0;~v~0 := 0; {27426#(and (= main_~v~0 0) (<= 100000 ~SIZE~0))} is VALID [2018-11-18 23:03:26,686 INFO L273 TraceCheckUtils]: 6: Hoare triple {27426#(and (= main_~v~0 0) (<= 100000 ~SIZE~0))} assume true; {27426#(and (= main_~v~0 0) (<= 100000 ~SIZE~0))} is VALID [2018-11-18 23:03:26,699 INFO L273 TraceCheckUtils]: 7: Hoare triple {27426#(and (= main_~v~0 0) (<= 100000 ~SIZE~0))} assume !!(~v~0 < ~SIZE~0);call #t~mem3 := read~int(~#values~0.base, ~#values~0.offset + 4 * ~v~0, 4); {27426#(and (= main_~v~0 0) (<= 100000 ~SIZE~0))} is VALID [2018-11-18 23:03:26,699 INFO L256 TraceCheckUtils]: 8: Hoare triple {27426#(and (= main_~v~0 0) (<= 100000 ~SIZE~0))} call #t~ret4 := elem_exists(~#set~0.base, ~#set~0.offset, ~n~0, #t~mem3); {27423#true} is VALID [2018-11-18 23:03:26,699 INFO L273 TraceCheckUtils]: 9: Hoare triple {27423#true} ~set.base, ~set.offset := #in~set.base, #in~set.offset;~size := #in~size;~value := #in~value;havoc ~i~0;~i~0 := 0; {27423#true} is VALID [2018-11-18 23:03:26,700 INFO L273 TraceCheckUtils]: 10: Hoare triple {27423#true} assume true; {27423#true} is VALID [2018-11-18 23:03:26,700 INFO L273 TraceCheckUtils]: 11: Hoare triple {27423#true} assume !(~i~0 < ~size); {27423#true} is VALID [2018-11-18 23:03:26,700 INFO L273 TraceCheckUtils]: 12: Hoare triple {27423#true} #res := 0; {27423#true} is VALID [2018-11-18 23:03:26,700 INFO L273 TraceCheckUtils]: 13: Hoare triple {27423#true} assume true; {27423#true} is VALID [2018-11-18 23:03:26,714 INFO L268 TraceCheckUtils]: 14: Hoare quadruple {27423#true} {27426#(and (= main_~v~0 0) (<= 100000 ~SIZE~0))} #132#return; {27426#(and (= main_~v~0 0) (<= 100000 ~SIZE~0))} is VALID [2018-11-18 23:03:26,727 INFO L273 TraceCheckUtils]: 15: Hoare triple {27426#(and (= main_~v~0 0) (<= 100000 ~SIZE~0))} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {27426#(and (= main_~v~0 0) (<= 100000 ~SIZE~0))} is VALID [2018-11-18 23:03:26,744 INFO L273 TraceCheckUtils]: 16: Hoare triple {27426#(and (= main_~v~0 0) (<= 100000 ~SIZE~0))} assume 1 != #t~ret4;havoc #t~mem3;havoc #t~ret4;call #t~mem5 := read~int(~#values~0.base, ~#values~0.offset + 4 * ~v~0, 4); {27426#(and (= main_~v~0 0) (<= 100000 ~SIZE~0))} is VALID [2018-11-18 23:03:26,744 INFO L256 TraceCheckUtils]: 17: Hoare triple {27426#(and (= main_~v~0 0) (<= 100000 ~SIZE~0))} call #t~ret6 := insert(~#set~0.base, ~#set~0.offset, ~n~0, #t~mem5); {27423#true} is VALID [2018-11-18 23:03:26,744 INFO L273 TraceCheckUtils]: 18: Hoare triple {27423#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; {27423#true} is VALID [2018-11-18 23:03:26,745 INFO L273 TraceCheckUtils]: 19: Hoare triple {27423#true} assume true; {27423#true} is VALID [2018-11-18 23:03:26,755 INFO L268 TraceCheckUtils]: 20: Hoare quadruple {27423#true} {27426#(and (= main_~v~0 0) (<= 100000 ~SIZE~0))} #134#return; {27426#(and (= main_~v~0 0) (<= 100000 ~SIZE~0))} is VALID [2018-11-18 23:03:26,767 INFO L273 TraceCheckUtils]: 21: Hoare triple {27426#(and (= main_~v~0 0) (<= 100000 ~SIZE~0))} assume -2147483648 <= #t~ret6 && #t~ret6 <= 2147483647;~n~0 := #t~ret6;havoc #t~ret6;havoc #t~mem5; {27426#(and (= main_~v~0 0) (<= 100000 ~SIZE~0))} is VALID [2018-11-18 23:03:26,780 INFO L273 TraceCheckUtils]: 22: Hoare triple {27426#(and (= main_~v~0 0) (<= 100000 ~SIZE~0))} #t~post2 := ~v~0;~v~0 := 1 + #t~post2;havoc #t~post2; {27427#(<= (+ main_~v~0 99999) ~SIZE~0)} is VALID [2018-11-18 23:03:26,793 INFO L273 TraceCheckUtils]: 23: Hoare triple {27427#(<= (+ main_~v~0 99999) ~SIZE~0)} assume true; {27427#(<= (+ main_~v~0 99999) ~SIZE~0)} is VALID [2018-11-18 23:03:26,806 INFO L273 TraceCheckUtils]: 24: Hoare triple {27427#(<= (+ main_~v~0 99999) ~SIZE~0)} assume !!(~v~0 < ~SIZE~0);call #t~mem3 := read~int(~#values~0.base, ~#values~0.offset + 4 * ~v~0, 4); {27427#(<= (+ main_~v~0 99999) ~SIZE~0)} is VALID [2018-11-18 23:03:26,806 INFO L256 TraceCheckUtils]: 25: Hoare triple {27427#(<= (+ main_~v~0 99999) ~SIZE~0)} call #t~ret4 := elem_exists(~#set~0.base, ~#set~0.offset, ~n~0, #t~mem3); {27423#true} is VALID [2018-11-18 23:03:26,806 INFO L273 TraceCheckUtils]: 26: Hoare triple {27423#true} ~set.base, ~set.offset := #in~set.base, #in~set.offset;~size := #in~size;~value := #in~value;havoc ~i~0;~i~0 := 0; {27423#true} is VALID [2018-11-18 23:03:26,806 INFO L273 TraceCheckUtils]: 27: Hoare triple {27423#true} assume true; {27423#true} is VALID [2018-11-18 23:03:26,806 INFO L273 TraceCheckUtils]: 28: Hoare triple {27423#true} assume !!(~i~0 < ~size);call #t~mem1 := read~int(~set.base, ~set.offset + 4 * ~i~0, 4); {27423#true} is VALID [2018-11-18 23:03:26,807 INFO L273 TraceCheckUtils]: 29: Hoare triple {27423#true} assume #t~mem1 == ~value;havoc #t~mem1;#res := 1; {27423#true} is VALID [2018-11-18 23:03:26,807 INFO L273 TraceCheckUtils]: 30: Hoare triple {27423#true} assume true; {27423#true} is VALID [2018-11-18 23:03:26,821 INFO L268 TraceCheckUtils]: 31: Hoare quadruple {27423#true} {27427#(<= (+ main_~v~0 99999) ~SIZE~0)} #132#return; {27427#(<= (+ main_~v~0 99999) ~SIZE~0)} is VALID [2018-11-18 23:03:26,833 INFO L273 TraceCheckUtils]: 32: Hoare triple {27427#(<= (+ main_~v~0 99999) ~SIZE~0)} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {27427#(<= (+ main_~v~0 99999) ~SIZE~0)} is VALID [2018-11-18 23:03:26,846 INFO L273 TraceCheckUtils]: 33: Hoare triple {27427#(<= (+ main_~v~0 99999) ~SIZE~0)} assume !(1 != #t~ret4);havoc #t~mem3;havoc #t~ret4; {27427#(<= (+ main_~v~0 99999) ~SIZE~0)} is VALID [2018-11-18 23:03:26,859 INFO L273 TraceCheckUtils]: 34: Hoare triple {27427#(<= (+ main_~v~0 99999) ~SIZE~0)} #t~post2 := ~v~0;~v~0 := 1 + #t~post2;havoc #t~post2; {27428#(<= (+ main_~v~0 99998) ~SIZE~0)} is VALID [2018-11-18 23:03:26,871 INFO L273 TraceCheckUtils]: 35: Hoare triple {27428#(<= (+ main_~v~0 99998) ~SIZE~0)} assume true; {27428#(<= (+ main_~v~0 99998) ~SIZE~0)} is VALID [2018-11-18 23:03:26,884 INFO L273 TraceCheckUtils]: 36: Hoare triple {27428#(<= (+ main_~v~0 99998) ~SIZE~0)} assume !!(~v~0 < ~SIZE~0);call #t~mem3 := read~int(~#values~0.base, ~#values~0.offset + 4 * ~v~0, 4); {27428#(<= (+ main_~v~0 99998) ~SIZE~0)} is VALID [2018-11-18 23:03:26,884 INFO L256 TraceCheckUtils]: 37: Hoare triple {27428#(<= (+ main_~v~0 99998) ~SIZE~0)} call #t~ret4 := elem_exists(~#set~0.base, ~#set~0.offset, ~n~0, #t~mem3); {27423#true} is VALID [2018-11-18 23:03:26,885 INFO L273 TraceCheckUtils]: 38: Hoare triple {27423#true} ~set.base, ~set.offset := #in~set.base, #in~set.offset;~size := #in~size;~value := #in~value;havoc ~i~0;~i~0 := 0; {27423#true} is VALID [2018-11-18 23:03:26,885 INFO L273 TraceCheckUtils]: 39: Hoare triple {27423#true} assume true; {27423#true} is VALID [2018-11-18 23:03:26,885 INFO L273 TraceCheckUtils]: 40: Hoare triple {27423#true} assume !!(~i~0 < ~size);call #t~mem1 := read~int(~set.base, ~set.offset + 4 * ~i~0, 4); {27423#true} is VALID [2018-11-18 23:03:26,885 INFO L273 TraceCheckUtils]: 41: Hoare triple {27423#true} assume #t~mem1 == ~value;havoc #t~mem1;#res := 1; {27423#true} is VALID [2018-11-18 23:03:26,885 INFO L273 TraceCheckUtils]: 42: Hoare triple {27423#true} assume true; {27423#true} is VALID [2018-11-18 23:03:26,899 INFO L268 TraceCheckUtils]: 43: Hoare quadruple {27423#true} {27428#(<= (+ main_~v~0 99998) ~SIZE~0)} #132#return; {27428#(<= (+ main_~v~0 99998) ~SIZE~0)} is VALID [2018-11-18 23:03:26,912 INFO L273 TraceCheckUtils]: 44: Hoare triple {27428#(<= (+ main_~v~0 99998) ~SIZE~0)} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {27428#(<= (+ main_~v~0 99998) ~SIZE~0)} is VALID [2018-11-18 23:03:26,931 INFO L273 TraceCheckUtils]: 45: Hoare triple {27428#(<= (+ main_~v~0 99998) ~SIZE~0)} assume !(1 != #t~ret4);havoc #t~mem3;havoc #t~ret4; {27428#(<= (+ main_~v~0 99998) ~SIZE~0)} is VALID [2018-11-18 23:03:26,940 INFO L273 TraceCheckUtils]: 46: Hoare triple {27428#(<= (+ main_~v~0 99998) ~SIZE~0)} #t~post2 := ~v~0;~v~0 := 1 + #t~post2;havoc #t~post2; {27429#(<= (+ main_~v~0 99997) ~SIZE~0)} is VALID [2018-11-18 23:03:26,953 INFO L273 TraceCheckUtils]: 47: Hoare triple {27429#(<= (+ main_~v~0 99997) ~SIZE~0)} assume true; {27429#(<= (+ main_~v~0 99997) ~SIZE~0)} is VALID [2018-11-18 23:03:26,965 INFO L273 TraceCheckUtils]: 48: Hoare triple {27429#(<= (+ main_~v~0 99997) ~SIZE~0)} assume !!(~v~0 < ~SIZE~0);call #t~mem3 := read~int(~#values~0.base, ~#values~0.offset + 4 * ~v~0, 4); {27429#(<= (+ main_~v~0 99997) ~SIZE~0)} is VALID [2018-11-18 23:03:26,966 INFO L256 TraceCheckUtils]: 49: Hoare triple {27429#(<= (+ main_~v~0 99997) ~SIZE~0)} call #t~ret4 := elem_exists(~#set~0.base, ~#set~0.offset, ~n~0, #t~mem3); {27423#true} is VALID [2018-11-18 23:03:26,966 INFO L273 TraceCheckUtils]: 50: Hoare triple {27423#true} ~set.base, ~set.offset := #in~set.base, #in~set.offset;~size := #in~size;~value := #in~value;havoc ~i~0;~i~0 := 0; {27423#true} is VALID [2018-11-18 23:03:26,966 INFO L273 TraceCheckUtils]: 51: Hoare triple {27423#true} assume true; {27423#true} is VALID [2018-11-18 23:03:26,966 INFO L273 TraceCheckUtils]: 52: Hoare triple {27423#true} assume !!(~i~0 < ~size);call #t~mem1 := read~int(~set.base, ~set.offset + 4 * ~i~0, 4); {27423#true} is VALID [2018-11-18 23:03:26,966 INFO L273 TraceCheckUtils]: 53: Hoare triple {27423#true} assume #t~mem1 == ~value;havoc #t~mem1;#res := 1; {27423#true} is VALID [2018-11-18 23:03:26,966 INFO L273 TraceCheckUtils]: 54: Hoare triple {27423#true} assume true; {27423#true} is VALID [2018-11-18 23:03:26,980 INFO L268 TraceCheckUtils]: 55: Hoare quadruple {27423#true} {27429#(<= (+ main_~v~0 99997) ~SIZE~0)} #132#return; {27429#(<= (+ main_~v~0 99997) ~SIZE~0)} is VALID [2018-11-18 23:03:27,000 INFO L273 TraceCheckUtils]: 56: Hoare triple {27429#(<= (+ main_~v~0 99997) ~SIZE~0)} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {27429#(<= (+ main_~v~0 99997) ~SIZE~0)} is VALID [2018-11-18 23:03:27,004 INFO L273 TraceCheckUtils]: 57: Hoare triple {27429#(<= (+ main_~v~0 99997) ~SIZE~0)} assume !(1 != #t~ret4);havoc #t~mem3;havoc #t~ret4; {27429#(<= (+ main_~v~0 99997) ~SIZE~0)} is VALID [2018-11-18 23:03:27,005 INFO L273 TraceCheckUtils]: 58: Hoare triple {27429#(<= (+ main_~v~0 99997) ~SIZE~0)} #t~post2 := ~v~0;~v~0 := 1 + #t~post2;havoc #t~post2; {27430#(<= (+ main_~v~0 99996) ~SIZE~0)} is VALID [2018-11-18 23:03:27,006 INFO L273 TraceCheckUtils]: 59: Hoare triple {27430#(<= (+ main_~v~0 99996) ~SIZE~0)} assume true; {27430#(<= (+ main_~v~0 99996) ~SIZE~0)} is VALID [2018-11-18 23:03:27,006 INFO L273 TraceCheckUtils]: 60: Hoare triple {27430#(<= (+ main_~v~0 99996) ~SIZE~0)} assume !!(~v~0 < ~SIZE~0);call #t~mem3 := read~int(~#values~0.base, ~#values~0.offset + 4 * ~v~0, 4); {27430#(<= (+ main_~v~0 99996) ~SIZE~0)} is VALID [2018-11-18 23:03:27,006 INFO L256 TraceCheckUtils]: 61: Hoare triple {27430#(<= (+ main_~v~0 99996) ~SIZE~0)} call #t~ret4 := elem_exists(~#set~0.base, ~#set~0.offset, ~n~0, #t~mem3); {27423#true} is VALID [2018-11-18 23:03:27,006 INFO L273 TraceCheckUtils]: 62: Hoare triple {27423#true} ~set.base, ~set.offset := #in~set.base, #in~set.offset;~size := #in~size;~value := #in~value;havoc ~i~0;~i~0 := 0; {27423#true} is VALID [2018-11-18 23:03:27,006 INFO L273 TraceCheckUtils]: 63: Hoare triple {27423#true} assume true; {27423#true} is VALID [2018-11-18 23:03:27,006 INFO L273 TraceCheckUtils]: 64: Hoare triple {27423#true} assume !!(~i~0 < ~size);call #t~mem1 := read~int(~set.base, ~set.offset + 4 * ~i~0, 4); {27423#true} is VALID [2018-11-18 23:03:27,007 INFO L273 TraceCheckUtils]: 65: Hoare triple {27423#true} assume #t~mem1 == ~value;havoc #t~mem1;#res := 1; {27423#true} is VALID [2018-11-18 23:03:27,007 INFO L273 TraceCheckUtils]: 66: Hoare triple {27423#true} assume true; {27423#true} is VALID [2018-11-18 23:03:27,009 INFO L268 TraceCheckUtils]: 67: Hoare quadruple {27423#true} {27430#(<= (+ main_~v~0 99996) ~SIZE~0)} #132#return; {27430#(<= (+ main_~v~0 99996) ~SIZE~0)} is VALID [2018-11-18 23:03:27,011 INFO L273 TraceCheckUtils]: 68: Hoare triple {27430#(<= (+ main_~v~0 99996) ~SIZE~0)} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {27430#(<= (+ main_~v~0 99996) ~SIZE~0)} is VALID [2018-11-18 23:03:27,011 INFO L273 TraceCheckUtils]: 69: Hoare triple {27430#(<= (+ main_~v~0 99996) ~SIZE~0)} assume !(1 != #t~ret4);havoc #t~mem3;havoc #t~ret4; {27430#(<= (+ main_~v~0 99996) ~SIZE~0)} is VALID [2018-11-18 23:03:27,013 INFO L273 TraceCheckUtils]: 70: Hoare triple {27430#(<= (+ main_~v~0 99996) ~SIZE~0)} #t~post2 := ~v~0;~v~0 := 1 + #t~post2;havoc #t~post2; {27431#(<= (+ main_~v~0 99995) ~SIZE~0)} is VALID [2018-11-18 23:03:27,013 INFO L273 TraceCheckUtils]: 71: Hoare triple {27431#(<= (+ main_~v~0 99995) ~SIZE~0)} assume true; {27431#(<= (+ main_~v~0 99995) ~SIZE~0)} is VALID [2018-11-18 23:03:27,016 INFO L273 TraceCheckUtils]: 72: Hoare triple {27431#(<= (+ main_~v~0 99995) ~SIZE~0)} assume !!(~v~0 < ~SIZE~0);call #t~mem3 := read~int(~#values~0.base, ~#values~0.offset + 4 * ~v~0, 4); {27431#(<= (+ main_~v~0 99995) ~SIZE~0)} is VALID [2018-11-18 23:03:27,016 INFO L256 TraceCheckUtils]: 73: Hoare triple {27431#(<= (+ main_~v~0 99995) ~SIZE~0)} call #t~ret4 := elem_exists(~#set~0.base, ~#set~0.offset, ~n~0, #t~mem3); {27423#true} is VALID [2018-11-18 23:03:27,016 INFO L273 TraceCheckUtils]: 74: Hoare triple {27423#true} ~set.base, ~set.offset := #in~set.base, #in~set.offset;~size := #in~size;~value := #in~value;havoc ~i~0;~i~0 := 0; {27423#true} is VALID [2018-11-18 23:03:27,016 INFO L273 TraceCheckUtils]: 75: Hoare triple {27423#true} assume true; {27423#true} is VALID [2018-11-18 23:03:27,016 INFO L273 TraceCheckUtils]: 76: Hoare triple {27423#true} assume !!(~i~0 < ~size);call #t~mem1 := read~int(~set.base, ~set.offset + 4 * ~i~0, 4); {27423#true} is VALID [2018-11-18 23:03:27,016 INFO L273 TraceCheckUtils]: 77: Hoare triple {27423#true} assume #t~mem1 == ~value;havoc #t~mem1;#res := 1; {27423#true} is VALID [2018-11-18 23:03:27,016 INFO L273 TraceCheckUtils]: 78: Hoare triple {27423#true} assume true; {27423#true} is VALID [2018-11-18 23:03:27,018 INFO L268 TraceCheckUtils]: 79: Hoare quadruple {27423#true} {27431#(<= (+ main_~v~0 99995) ~SIZE~0)} #132#return; {27431#(<= (+ main_~v~0 99995) ~SIZE~0)} is VALID [2018-11-18 23:03:27,018 INFO L273 TraceCheckUtils]: 80: Hoare triple {27431#(<= (+ main_~v~0 99995) ~SIZE~0)} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {27431#(<= (+ main_~v~0 99995) ~SIZE~0)} is VALID [2018-11-18 23:03:27,019 INFO L273 TraceCheckUtils]: 81: Hoare triple {27431#(<= (+ main_~v~0 99995) ~SIZE~0)} assume !(1 != #t~ret4);havoc #t~mem3;havoc #t~ret4; {27431#(<= (+ main_~v~0 99995) ~SIZE~0)} is VALID [2018-11-18 23:03:27,020 INFO L273 TraceCheckUtils]: 82: Hoare triple {27431#(<= (+ main_~v~0 99995) ~SIZE~0)} #t~post2 := ~v~0;~v~0 := 1 + #t~post2;havoc #t~post2; {27432#(<= (+ main_~v~0 99994) ~SIZE~0)} is VALID [2018-11-18 23:03:27,020 INFO L273 TraceCheckUtils]: 83: Hoare triple {27432#(<= (+ main_~v~0 99994) ~SIZE~0)} assume true; {27432#(<= (+ main_~v~0 99994) ~SIZE~0)} is VALID [2018-11-18 23:03:27,021 INFO L273 TraceCheckUtils]: 84: Hoare triple {27432#(<= (+ main_~v~0 99994) ~SIZE~0)} assume !!(~v~0 < ~SIZE~0);call #t~mem3 := read~int(~#values~0.base, ~#values~0.offset + 4 * ~v~0, 4); {27432#(<= (+ main_~v~0 99994) ~SIZE~0)} is VALID [2018-11-18 23:03:27,021 INFO L256 TraceCheckUtils]: 85: Hoare triple {27432#(<= (+ main_~v~0 99994) ~SIZE~0)} call #t~ret4 := elem_exists(~#set~0.base, ~#set~0.offset, ~n~0, #t~mem3); {27423#true} is VALID [2018-11-18 23:03:27,021 INFO L273 TraceCheckUtils]: 86: Hoare triple {27423#true} ~set.base, ~set.offset := #in~set.base, #in~set.offset;~size := #in~size;~value := #in~value;havoc ~i~0;~i~0 := 0; {27423#true} is VALID [2018-11-18 23:03:27,021 INFO L273 TraceCheckUtils]: 87: Hoare triple {27423#true} assume true; {27423#true} is VALID [2018-11-18 23:03:27,022 INFO L273 TraceCheckUtils]: 88: Hoare triple {27423#true} assume !!(~i~0 < ~size);call #t~mem1 := read~int(~set.base, ~set.offset + 4 * ~i~0, 4); {27423#true} is VALID [2018-11-18 23:03:27,022 INFO L273 TraceCheckUtils]: 89: Hoare triple {27423#true} assume #t~mem1 == ~value;havoc #t~mem1;#res := 1; {27423#true} is VALID [2018-11-18 23:03:27,022 INFO L273 TraceCheckUtils]: 90: Hoare triple {27423#true} assume true; {27423#true} is VALID [2018-11-18 23:03:27,024 INFO L268 TraceCheckUtils]: 91: Hoare quadruple {27423#true} {27432#(<= (+ main_~v~0 99994) ~SIZE~0)} #132#return; {27432#(<= (+ main_~v~0 99994) ~SIZE~0)} is VALID [2018-11-18 23:03:27,025 INFO L273 TraceCheckUtils]: 92: Hoare triple {27432#(<= (+ main_~v~0 99994) ~SIZE~0)} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {27432#(<= (+ main_~v~0 99994) ~SIZE~0)} is VALID [2018-11-18 23:03:27,025 INFO L273 TraceCheckUtils]: 93: Hoare triple {27432#(<= (+ main_~v~0 99994) ~SIZE~0)} assume !(1 != #t~ret4);havoc #t~mem3;havoc #t~ret4; {27432#(<= (+ main_~v~0 99994) ~SIZE~0)} is VALID [2018-11-18 23:03:27,026 INFO L273 TraceCheckUtils]: 94: Hoare triple {27432#(<= (+ main_~v~0 99994) ~SIZE~0)} #t~post2 := ~v~0;~v~0 := 1 + #t~post2;havoc #t~post2; {27433#(<= (+ main_~v~0 99993) ~SIZE~0)} is VALID [2018-11-18 23:03:27,026 INFO L273 TraceCheckUtils]: 95: Hoare triple {27433#(<= (+ main_~v~0 99993) ~SIZE~0)} assume true; {27433#(<= (+ main_~v~0 99993) ~SIZE~0)} is VALID [2018-11-18 23:03:27,026 INFO L273 TraceCheckUtils]: 96: Hoare triple {27433#(<= (+ main_~v~0 99993) ~SIZE~0)} assume !!(~v~0 < ~SIZE~0);call #t~mem3 := read~int(~#values~0.base, ~#values~0.offset + 4 * ~v~0, 4); {27433#(<= (+ main_~v~0 99993) ~SIZE~0)} is VALID [2018-11-18 23:03:27,026 INFO L256 TraceCheckUtils]: 97: Hoare triple {27433#(<= (+ main_~v~0 99993) ~SIZE~0)} call #t~ret4 := elem_exists(~#set~0.base, ~#set~0.offset, ~n~0, #t~mem3); {27423#true} is VALID [2018-11-18 23:03:27,026 INFO L273 TraceCheckUtils]: 98: Hoare triple {27423#true} ~set.base, ~set.offset := #in~set.base, #in~set.offset;~size := #in~size;~value := #in~value;havoc ~i~0;~i~0 := 0; {27423#true} is VALID [2018-11-18 23:03:27,027 INFO L273 TraceCheckUtils]: 99: Hoare triple {27423#true} assume true; {27423#true} is VALID [2018-11-18 23:03:27,027 INFO L273 TraceCheckUtils]: 100: Hoare triple {27423#true} assume !!(~i~0 < ~size);call #t~mem1 := read~int(~set.base, ~set.offset + 4 * ~i~0, 4); {27423#true} is VALID [2018-11-18 23:03:27,027 INFO L273 TraceCheckUtils]: 101: Hoare triple {27423#true} assume #t~mem1 == ~value;havoc #t~mem1;#res := 1; {27423#true} is VALID [2018-11-18 23:03:27,027 INFO L273 TraceCheckUtils]: 102: Hoare triple {27423#true} assume true; {27423#true} is VALID [2018-11-18 23:03:27,029 INFO L268 TraceCheckUtils]: 103: Hoare quadruple {27423#true} {27433#(<= (+ main_~v~0 99993) ~SIZE~0)} #132#return; {27433#(<= (+ main_~v~0 99993) ~SIZE~0)} is VALID [2018-11-18 23:03:27,029 INFO L273 TraceCheckUtils]: 104: Hoare triple {27433#(<= (+ main_~v~0 99993) ~SIZE~0)} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {27433#(<= (+ main_~v~0 99993) ~SIZE~0)} is VALID [2018-11-18 23:03:27,030 INFO L273 TraceCheckUtils]: 105: Hoare triple {27433#(<= (+ main_~v~0 99993) ~SIZE~0)} assume !(1 != #t~ret4);havoc #t~mem3;havoc #t~ret4; {27433#(<= (+ main_~v~0 99993) ~SIZE~0)} is VALID [2018-11-18 23:03:27,030 INFO L273 TraceCheckUtils]: 106: Hoare triple {27433#(<= (+ main_~v~0 99993) ~SIZE~0)} #t~post2 := ~v~0;~v~0 := 1 + #t~post2;havoc #t~post2; {27434#(<= (+ main_~v~0 99992) ~SIZE~0)} is VALID [2018-11-18 23:03:27,031 INFO L273 TraceCheckUtils]: 107: Hoare triple {27434#(<= (+ main_~v~0 99992) ~SIZE~0)} assume true; {27434#(<= (+ main_~v~0 99992) ~SIZE~0)} is VALID [2018-11-18 23:03:27,031 INFO L273 TraceCheckUtils]: 108: Hoare triple {27434#(<= (+ main_~v~0 99992) ~SIZE~0)} assume !!(~v~0 < ~SIZE~0);call #t~mem3 := read~int(~#values~0.base, ~#values~0.offset + 4 * ~v~0, 4); {27434#(<= (+ main_~v~0 99992) ~SIZE~0)} is VALID [2018-11-18 23:03:27,031 INFO L256 TraceCheckUtils]: 109: Hoare triple {27434#(<= (+ main_~v~0 99992) ~SIZE~0)} call #t~ret4 := elem_exists(~#set~0.base, ~#set~0.offset, ~n~0, #t~mem3); {27423#true} is VALID [2018-11-18 23:03:27,032 INFO L273 TraceCheckUtils]: 110: Hoare triple {27423#true} ~set.base, ~set.offset := #in~set.base, #in~set.offset;~size := #in~size;~value := #in~value;havoc ~i~0;~i~0 := 0; {27423#true} is VALID [2018-11-18 23:03:27,032 INFO L273 TraceCheckUtils]: 111: Hoare triple {27423#true} assume true; {27423#true} is VALID [2018-11-18 23:03:27,032 INFO L273 TraceCheckUtils]: 112: Hoare triple {27423#true} assume !!(~i~0 < ~size);call #t~mem1 := read~int(~set.base, ~set.offset + 4 * ~i~0, 4); {27423#true} is VALID [2018-11-18 23:03:27,032 INFO L273 TraceCheckUtils]: 113: Hoare triple {27423#true} assume #t~mem1 == ~value;havoc #t~mem1;#res := 1; {27423#true} is VALID [2018-11-18 23:03:27,032 INFO L273 TraceCheckUtils]: 114: Hoare triple {27423#true} assume true; {27423#true} is VALID [2018-11-18 23:03:27,034 INFO L268 TraceCheckUtils]: 115: Hoare quadruple {27423#true} {27434#(<= (+ main_~v~0 99992) ~SIZE~0)} #132#return; {27434#(<= (+ main_~v~0 99992) ~SIZE~0)} is VALID [2018-11-18 23:03:27,034 INFO L273 TraceCheckUtils]: 116: Hoare triple {27434#(<= (+ main_~v~0 99992) ~SIZE~0)} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {27434#(<= (+ main_~v~0 99992) ~SIZE~0)} is VALID [2018-11-18 23:03:27,035 INFO L273 TraceCheckUtils]: 117: Hoare triple {27434#(<= (+ main_~v~0 99992) ~SIZE~0)} assume !(1 != #t~ret4);havoc #t~mem3;havoc #t~ret4; {27434#(<= (+ main_~v~0 99992) ~SIZE~0)} is VALID [2018-11-18 23:03:27,035 INFO L273 TraceCheckUtils]: 118: Hoare triple {27434#(<= (+ main_~v~0 99992) ~SIZE~0)} #t~post2 := ~v~0;~v~0 := 1 + #t~post2;havoc #t~post2; {27435#(<= (+ main_~v~0 99991) ~SIZE~0)} is VALID [2018-11-18 23:03:27,036 INFO L273 TraceCheckUtils]: 119: Hoare triple {27435#(<= (+ main_~v~0 99991) ~SIZE~0)} assume true; {27435#(<= (+ main_~v~0 99991) ~SIZE~0)} is VALID [2018-11-18 23:03:27,036 INFO L273 TraceCheckUtils]: 120: Hoare triple {27435#(<= (+ main_~v~0 99991) ~SIZE~0)} assume !!(~v~0 < ~SIZE~0);call #t~mem3 := read~int(~#values~0.base, ~#values~0.offset + 4 * ~v~0, 4); {27435#(<= (+ main_~v~0 99991) ~SIZE~0)} is VALID [2018-11-18 23:03:27,036 INFO L256 TraceCheckUtils]: 121: Hoare triple {27435#(<= (+ main_~v~0 99991) ~SIZE~0)} call #t~ret4 := elem_exists(~#set~0.base, ~#set~0.offset, ~n~0, #t~mem3); {27423#true} is VALID [2018-11-18 23:03:27,037 INFO L273 TraceCheckUtils]: 122: Hoare triple {27423#true} ~set.base, ~set.offset := #in~set.base, #in~set.offset;~size := #in~size;~value := #in~value;havoc ~i~0;~i~0 := 0; {27423#true} is VALID [2018-11-18 23:03:27,037 INFO L273 TraceCheckUtils]: 123: Hoare triple {27423#true} assume true; {27423#true} is VALID [2018-11-18 23:03:27,037 INFO L273 TraceCheckUtils]: 124: Hoare triple {27423#true} assume !!(~i~0 < ~size);call #t~mem1 := read~int(~set.base, ~set.offset + 4 * ~i~0, 4); {27423#true} is VALID [2018-11-18 23:03:27,037 INFO L273 TraceCheckUtils]: 125: Hoare triple {27423#true} assume #t~mem1 == ~value;havoc #t~mem1;#res := 1; {27423#true} is VALID [2018-11-18 23:03:27,037 INFO L273 TraceCheckUtils]: 126: Hoare triple {27423#true} assume true; {27423#true} is VALID [2018-11-18 23:03:27,039 INFO L268 TraceCheckUtils]: 127: Hoare quadruple {27423#true} {27435#(<= (+ main_~v~0 99991) ~SIZE~0)} #132#return; {27435#(<= (+ main_~v~0 99991) ~SIZE~0)} is VALID [2018-11-18 23:03:27,040 INFO L273 TraceCheckUtils]: 128: Hoare triple {27435#(<= (+ main_~v~0 99991) ~SIZE~0)} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {27435#(<= (+ main_~v~0 99991) ~SIZE~0)} is VALID [2018-11-18 23:03:27,040 INFO L273 TraceCheckUtils]: 129: Hoare triple {27435#(<= (+ main_~v~0 99991) ~SIZE~0)} assume !(1 != #t~ret4);havoc #t~mem3;havoc #t~ret4; {27435#(<= (+ main_~v~0 99991) ~SIZE~0)} is VALID [2018-11-18 23:03:27,041 INFO L273 TraceCheckUtils]: 130: Hoare triple {27435#(<= (+ main_~v~0 99991) ~SIZE~0)} #t~post2 := ~v~0;~v~0 := 1 + #t~post2;havoc #t~post2; {27436#(<= (+ main_~v~0 99990) ~SIZE~0)} is VALID [2018-11-18 23:03:27,041 INFO L273 TraceCheckUtils]: 131: Hoare triple {27436#(<= (+ main_~v~0 99990) ~SIZE~0)} assume true; {27436#(<= (+ main_~v~0 99990) ~SIZE~0)} is VALID [2018-11-18 23:03:27,042 INFO L273 TraceCheckUtils]: 132: Hoare triple {27436#(<= (+ main_~v~0 99990) ~SIZE~0)} assume !!(~v~0 < ~SIZE~0);call #t~mem3 := read~int(~#values~0.base, ~#values~0.offset + 4 * ~v~0, 4); {27436#(<= (+ main_~v~0 99990) ~SIZE~0)} is VALID [2018-11-18 23:03:27,042 INFO L256 TraceCheckUtils]: 133: Hoare triple {27436#(<= (+ main_~v~0 99990) ~SIZE~0)} call #t~ret4 := elem_exists(~#set~0.base, ~#set~0.offset, ~n~0, #t~mem3); {27423#true} is VALID [2018-11-18 23:03:27,042 INFO L273 TraceCheckUtils]: 134: Hoare triple {27423#true} ~set.base, ~set.offset := #in~set.base, #in~set.offset;~size := #in~size;~value := #in~value;havoc ~i~0;~i~0 := 0; {27423#true} is VALID [2018-11-18 23:03:27,042 INFO L273 TraceCheckUtils]: 135: Hoare triple {27423#true} assume true; {27423#true} is VALID [2018-11-18 23:03:27,042 INFO L273 TraceCheckUtils]: 136: Hoare triple {27423#true} assume !!(~i~0 < ~size);call #t~mem1 := read~int(~set.base, ~set.offset + 4 * ~i~0, 4); {27423#true} is VALID [2018-11-18 23:03:27,043 INFO L273 TraceCheckUtils]: 137: Hoare triple {27423#true} assume #t~mem1 == ~value;havoc #t~mem1;#res := 1; {27423#true} is VALID [2018-11-18 23:03:27,043 INFO L273 TraceCheckUtils]: 138: Hoare triple {27423#true} assume true; {27423#true} is VALID [2018-11-18 23:03:27,045 INFO L268 TraceCheckUtils]: 139: Hoare quadruple {27423#true} {27436#(<= (+ main_~v~0 99990) ~SIZE~0)} #132#return; {27436#(<= (+ main_~v~0 99990) ~SIZE~0)} is VALID [2018-11-18 23:03:27,046 INFO L273 TraceCheckUtils]: 140: Hoare triple {27436#(<= (+ main_~v~0 99990) ~SIZE~0)} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {27436#(<= (+ main_~v~0 99990) ~SIZE~0)} is VALID [2018-11-18 23:03:27,046 INFO L273 TraceCheckUtils]: 141: Hoare triple {27436#(<= (+ main_~v~0 99990) ~SIZE~0)} assume !(1 != #t~ret4);havoc #t~mem3;havoc #t~ret4; {27436#(<= (+ main_~v~0 99990) ~SIZE~0)} is VALID [2018-11-18 23:03:27,047 INFO L273 TraceCheckUtils]: 142: Hoare triple {27436#(<= (+ main_~v~0 99990) ~SIZE~0)} #t~post2 := ~v~0;~v~0 := 1 + #t~post2;havoc #t~post2; {27437#(<= (+ main_~v~0 99989) ~SIZE~0)} is VALID [2018-11-18 23:03:27,047 INFO L273 TraceCheckUtils]: 143: Hoare triple {27437#(<= (+ main_~v~0 99989) ~SIZE~0)} assume true; {27437#(<= (+ main_~v~0 99989) ~SIZE~0)} is VALID [2018-11-18 23:03:27,048 INFO L273 TraceCheckUtils]: 144: Hoare triple {27437#(<= (+ main_~v~0 99989) ~SIZE~0)} assume !!(~v~0 < ~SIZE~0);call #t~mem3 := read~int(~#values~0.base, ~#values~0.offset + 4 * ~v~0, 4); {27437#(<= (+ main_~v~0 99989) ~SIZE~0)} is VALID [2018-11-18 23:03:27,048 INFO L256 TraceCheckUtils]: 145: Hoare triple {27437#(<= (+ main_~v~0 99989) ~SIZE~0)} call #t~ret4 := elem_exists(~#set~0.base, ~#set~0.offset, ~n~0, #t~mem3); {27423#true} is VALID [2018-11-18 23:03:27,048 INFO L273 TraceCheckUtils]: 146: Hoare triple {27423#true} ~set.base, ~set.offset := #in~set.base, #in~set.offset;~size := #in~size;~value := #in~value;havoc ~i~0;~i~0 := 0; {27423#true} is VALID [2018-11-18 23:03:27,049 INFO L273 TraceCheckUtils]: 147: Hoare triple {27423#true} assume true; {27423#true} is VALID [2018-11-18 23:03:27,049 INFO L273 TraceCheckUtils]: 148: Hoare triple {27423#true} assume !!(~i~0 < ~size);call #t~mem1 := read~int(~set.base, ~set.offset + 4 * ~i~0, 4); {27423#true} is VALID [2018-11-18 23:03:27,049 INFO L273 TraceCheckUtils]: 149: Hoare triple {27423#true} assume #t~mem1 == ~value;havoc #t~mem1;#res := 1; {27423#true} is VALID [2018-11-18 23:03:27,049 INFO L273 TraceCheckUtils]: 150: Hoare triple {27423#true} assume true; {27423#true} is VALID [2018-11-18 23:03:27,051 INFO L268 TraceCheckUtils]: 151: Hoare quadruple {27423#true} {27437#(<= (+ main_~v~0 99989) ~SIZE~0)} #132#return; {27437#(<= (+ main_~v~0 99989) ~SIZE~0)} is VALID [2018-11-18 23:03:27,052 INFO L273 TraceCheckUtils]: 152: Hoare triple {27437#(<= (+ main_~v~0 99989) ~SIZE~0)} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {27437#(<= (+ main_~v~0 99989) ~SIZE~0)} is VALID [2018-11-18 23:03:27,052 INFO L273 TraceCheckUtils]: 153: Hoare triple {27437#(<= (+ main_~v~0 99989) ~SIZE~0)} assume !(1 != #t~ret4);havoc #t~mem3;havoc #t~ret4; {27437#(<= (+ main_~v~0 99989) ~SIZE~0)} is VALID [2018-11-18 23:03:27,052 INFO L273 TraceCheckUtils]: 154: Hoare triple {27437#(<= (+ main_~v~0 99989) ~SIZE~0)} #t~post2 := ~v~0;~v~0 := 1 + #t~post2;havoc #t~post2; {27438#(<= (+ main_~v~0 99988) ~SIZE~0)} is VALID [2018-11-18 23:03:27,053 INFO L273 TraceCheckUtils]: 155: Hoare triple {27438#(<= (+ main_~v~0 99988) ~SIZE~0)} assume true; {27438#(<= (+ main_~v~0 99988) ~SIZE~0)} is VALID [2018-11-18 23:03:27,053 INFO L273 TraceCheckUtils]: 156: Hoare triple {27438#(<= (+ main_~v~0 99988) ~SIZE~0)} assume !!(~v~0 < ~SIZE~0);call #t~mem3 := read~int(~#values~0.base, ~#values~0.offset + 4 * ~v~0, 4); {27438#(<= (+ main_~v~0 99988) ~SIZE~0)} is VALID [2018-11-18 23:03:27,054 INFO L256 TraceCheckUtils]: 157: Hoare triple {27438#(<= (+ main_~v~0 99988) ~SIZE~0)} call #t~ret4 := elem_exists(~#set~0.base, ~#set~0.offset, ~n~0, #t~mem3); {27423#true} is VALID [2018-11-18 23:03:27,054 INFO L273 TraceCheckUtils]: 158: Hoare triple {27423#true} ~set.base, ~set.offset := #in~set.base, #in~set.offset;~size := #in~size;~value := #in~value;havoc ~i~0;~i~0 := 0; {27423#true} is VALID [2018-11-18 23:03:27,054 INFO L273 TraceCheckUtils]: 159: Hoare triple {27423#true} assume true; {27423#true} is VALID [2018-11-18 23:03:27,054 INFO L273 TraceCheckUtils]: 160: Hoare triple {27423#true} assume !!(~i~0 < ~size);call #t~mem1 := read~int(~set.base, ~set.offset + 4 * ~i~0, 4); {27423#true} is VALID [2018-11-18 23:03:27,054 INFO L273 TraceCheckUtils]: 161: Hoare triple {27423#true} assume #t~mem1 == ~value;havoc #t~mem1;#res := 1; {27423#true} is VALID [2018-11-18 23:03:27,055 INFO L273 TraceCheckUtils]: 162: Hoare triple {27423#true} assume true; {27423#true} is VALID [2018-11-18 23:03:27,057 INFO L268 TraceCheckUtils]: 163: Hoare quadruple {27423#true} {27438#(<= (+ main_~v~0 99988) ~SIZE~0)} #132#return; {27438#(<= (+ main_~v~0 99988) ~SIZE~0)} is VALID [2018-11-18 23:03:27,057 INFO L273 TraceCheckUtils]: 164: Hoare triple {27438#(<= (+ main_~v~0 99988) ~SIZE~0)} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {27438#(<= (+ main_~v~0 99988) ~SIZE~0)} is VALID [2018-11-18 23:03:27,058 INFO L273 TraceCheckUtils]: 165: Hoare triple {27438#(<= (+ main_~v~0 99988) ~SIZE~0)} assume !(1 != #t~ret4);havoc #t~mem3;havoc #t~ret4; {27438#(<= (+ main_~v~0 99988) ~SIZE~0)} is VALID [2018-11-18 23:03:27,059 INFO L273 TraceCheckUtils]: 166: Hoare triple {27438#(<= (+ main_~v~0 99988) ~SIZE~0)} #t~post2 := ~v~0;~v~0 := 1 + #t~post2;havoc #t~post2; {27439#(<= (+ main_~v~0 99987) ~SIZE~0)} is VALID [2018-11-18 23:03:27,059 INFO L273 TraceCheckUtils]: 167: Hoare triple {27439#(<= (+ main_~v~0 99987) ~SIZE~0)} assume true; {27439#(<= (+ main_~v~0 99987) ~SIZE~0)} is VALID [2018-11-18 23:03:27,060 INFO L273 TraceCheckUtils]: 168: Hoare triple {27439#(<= (+ main_~v~0 99987) ~SIZE~0)} assume !!(~v~0 < ~SIZE~0);call #t~mem3 := read~int(~#values~0.base, ~#values~0.offset + 4 * ~v~0, 4); {27439#(<= (+ main_~v~0 99987) ~SIZE~0)} is VALID [2018-11-18 23:03:27,060 INFO L256 TraceCheckUtils]: 169: Hoare triple {27439#(<= (+ main_~v~0 99987) ~SIZE~0)} call #t~ret4 := elem_exists(~#set~0.base, ~#set~0.offset, ~n~0, #t~mem3); {27423#true} is VALID [2018-11-18 23:03:27,060 INFO L273 TraceCheckUtils]: 170: Hoare triple {27423#true} ~set.base, ~set.offset := #in~set.base, #in~set.offset;~size := #in~size;~value := #in~value;havoc ~i~0;~i~0 := 0; {27423#true} is VALID [2018-11-18 23:03:27,060 INFO L273 TraceCheckUtils]: 171: Hoare triple {27423#true} assume true; {27423#true} is VALID [2018-11-18 23:03:27,061 INFO L273 TraceCheckUtils]: 172: Hoare triple {27423#true} assume !!(~i~0 < ~size);call #t~mem1 := read~int(~set.base, ~set.offset + 4 * ~i~0, 4); {27423#true} is VALID [2018-11-18 23:03:27,061 INFO L273 TraceCheckUtils]: 173: Hoare triple {27423#true} assume #t~mem1 == ~value;havoc #t~mem1;#res := 1; {27423#true} is VALID [2018-11-18 23:03:27,061 INFO L273 TraceCheckUtils]: 174: Hoare triple {27423#true} assume true; {27423#true} is VALID [2018-11-18 23:03:27,063 INFO L268 TraceCheckUtils]: 175: Hoare quadruple {27423#true} {27439#(<= (+ main_~v~0 99987) ~SIZE~0)} #132#return; {27439#(<= (+ main_~v~0 99987) ~SIZE~0)} is VALID [2018-11-18 23:03:27,064 INFO L273 TraceCheckUtils]: 176: Hoare triple {27439#(<= (+ main_~v~0 99987) ~SIZE~0)} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {27439#(<= (+ main_~v~0 99987) ~SIZE~0)} is VALID [2018-11-18 23:03:27,064 INFO L273 TraceCheckUtils]: 177: Hoare triple {27439#(<= (+ main_~v~0 99987) ~SIZE~0)} assume !(1 != #t~ret4);havoc #t~mem3;havoc #t~ret4; {27439#(<= (+ main_~v~0 99987) ~SIZE~0)} is VALID [2018-11-18 23:03:27,065 INFO L273 TraceCheckUtils]: 178: Hoare triple {27439#(<= (+ main_~v~0 99987) ~SIZE~0)} #t~post2 := ~v~0;~v~0 := 1 + #t~post2;havoc #t~post2; {27440#(<= (+ main_~v~0 99986) ~SIZE~0)} is VALID [2018-11-18 23:03:27,065 INFO L273 TraceCheckUtils]: 179: Hoare triple {27440#(<= (+ main_~v~0 99986) ~SIZE~0)} assume true; {27440#(<= (+ main_~v~0 99986) ~SIZE~0)} is VALID [2018-11-18 23:03:27,066 INFO L273 TraceCheckUtils]: 180: Hoare triple {27440#(<= (+ main_~v~0 99986) ~SIZE~0)} assume !!(~v~0 < ~SIZE~0);call #t~mem3 := read~int(~#values~0.base, ~#values~0.offset + 4 * ~v~0, 4); {27440#(<= (+ main_~v~0 99986) ~SIZE~0)} is VALID [2018-11-18 23:03:27,066 INFO L256 TraceCheckUtils]: 181: Hoare triple {27440#(<= (+ main_~v~0 99986) ~SIZE~0)} call #t~ret4 := elem_exists(~#set~0.base, ~#set~0.offset, ~n~0, #t~mem3); {27423#true} is VALID [2018-11-18 23:03:27,066 INFO L273 TraceCheckUtils]: 182: Hoare triple {27423#true} ~set.base, ~set.offset := #in~set.base, #in~set.offset;~size := #in~size;~value := #in~value;havoc ~i~0;~i~0 := 0; {27423#true} is VALID [2018-11-18 23:03:27,067 INFO L273 TraceCheckUtils]: 183: Hoare triple {27423#true} assume true; {27423#true} is VALID [2018-11-18 23:03:27,067 INFO L273 TraceCheckUtils]: 184: Hoare triple {27423#true} assume !!(~i~0 < ~size);call #t~mem1 := read~int(~set.base, ~set.offset + 4 * ~i~0, 4); {27423#true} is VALID [2018-11-18 23:03:27,067 INFO L273 TraceCheckUtils]: 185: Hoare triple {27423#true} assume #t~mem1 == ~value;havoc #t~mem1;#res := 1; {27423#true} is VALID [2018-11-18 23:03:27,067 INFO L273 TraceCheckUtils]: 186: Hoare triple {27423#true} assume true; {27423#true} is VALID [2018-11-18 23:03:27,069 INFO L268 TraceCheckUtils]: 187: Hoare quadruple {27423#true} {27440#(<= (+ main_~v~0 99986) ~SIZE~0)} #132#return; {27440#(<= (+ main_~v~0 99986) ~SIZE~0)} is VALID [2018-11-18 23:03:27,070 INFO L273 TraceCheckUtils]: 188: Hoare triple {27440#(<= (+ main_~v~0 99986) ~SIZE~0)} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {27440#(<= (+ main_~v~0 99986) ~SIZE~0)} is VALID [2018-11-18 23:03:27,070 INFO L273 TraceCheckUtils]: 189: Hoare triple {27440#(<= (+ main_~v~0 99986) ~SIZE~0)} assume !(1 != #t~ret4);havoc #t~mem3;havoc #t~ret4; {27440#(<= (+ main_~v~0 99986) ~SIZE~0)} is VALID [2018-11-18 23:03:27,071 INFO L273 TraceCheckUtils]: 190: Hoare triple {27440#(<= (+ main_~v~0 99986) ~SIZE~0)} #t~post2 := ~v~0;~v~0 := 1 + #t~post2;havoc #t~post2; {27441#(<= (+ main_~v~0 99985) ~SIZE~0)} is VALID [2018-11-18 23:03:27,072 INFO L273 TraceCheckUtils]: 191: Hoare triple {27441#(<= (+ main_~v~0 99985) ~SIZE~0)} assume true; {27441#(<= (+ main_~v~0 99985) ~SIZE~0)} is VALID [2018-11-18 23:03:27,072 INFO L273 TraceCheckUtils]: 192: Hoare triple {27441#(<= (+ main_~v~0 99985) ~SIZE~0)} assume !!(~v~0 < ~SIZE~0);call #t~mem3 := read~int(~#values~0.base, ~#values~0.offset + 4 * ~v~0, 4); {27441#(<= (+ main_~v~0 99985) ~SIZE~0)} is VALID [2018-11-18 23:03:27,073 INFO L256 TraceCheckUtils]: 193: Hoare triple {27441#(<= (+ main_~v~0 99985) ~SIZE~0)} call #t~ret4 := elem_exists(~#set~0.base, ~#set~0.offset, ~n~0, #t~mem3); {27423#true} is VALID [2018-11-18 23:03:27,073 INFO L273 TraceCheckUtils]: 194: Hoare triple {27423#true} ~set.base, ~set.offset := #in~set.base, #in~set.offset;~size := #in~size;~value := #in~value;havoc ~i~0;~i~0 := 0; {27423#true} is VALID [2018-11-18 23:03:27,073 INFO L273 TraceCheckUtils]: 195: Hoare triple {27423#true} assume true; {27423#true} is VALID [2018-11-18 23:03:27,073 INFO L273 TraceCheckUtils]: 196: Hoare triple {27423#true} assume !!(~i~0 < ~size);call #t~mem1 := read~int(~set.base, ~set.offset + 4 * ~i~0, 4); {27423#true} is VALID [2018-11-18 23:03:27,073 INFO L273 TraceCheckUtils]: 197: Hoare triple {27423#true} assume #t~mem1 == ~value;havoc #t~mem1;#res := 1; {27423#true} is VALID [2018-11-18 23:03:27,074 INFO L273 TraceCheckUtils]: 198: Hoare triple {27423#true} assume true; {27423#true} is VALID [2018-11-18 23:03:27,076 INFO L268 TraceCheckUtils]: 199: Hoare quadruple {27423#true} {27441#(<= (+ main_~v~0 99985) ~SIZE~0)} #132#return; {27441#(<= (+ main_~v~0 99985) ~SIZE~0)} is VALID [2018-11-18 23:03:27,076 INFO L273 TraceCheckUtils]: 200: Hoare triple {27441#(<= (+ main_~v~0 99985) ~SIZE~0)} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {27441#(<= (+ main_~v~0 99985) ~SIZE~0)} is VALID [2018-11-18 23:03:27,077 INFO L273 TraceCheckUtils]: 201: Hoare triple {27441#(<= (+ main_~v~0 99985) ~SIZE~0)} assume !(1 != #t~ret4);havoc #t~mem3;havoc #t~ret4; {27441#(<= (+ main_~v~0 99985) ~SIZE~0)} is VALID [2018-11-18 23:03:27,078 INFO L273 TraceCheckUtils]: 202: Hoare triple {27441#(<= (+ main_~v~0 99985) ~SIZE~0)} #t~post2 := ~v~0;~v~0 := 1 + #t~post2;havoc #t~post2; {27442#(<= (+ main_~v~0 99984) ~SIZE~0)} is VALID [2018-11-18 23:03:27,078 INFO L273 TraceCheckUtils]: 203: Hoare triple {27442#(<= (+ main_~v~0 99984) ~SIZE~0)} assume true; {27442#(<= (+ main_~v~0 99984) ~SIZE~0)} is VALID [2018-11-18 23:03:27,079 INFO L273 TraceCheckUtils]: 204: Hoare triple {27442#(<= (+ main_~v~0 99984) ~SIZE~0)} assume !!(~v~0 < ~SIZE~0);call #t~mem3 := read~int(~#values~0.base, ~#values~0.offset + 4 * ~v~0, 4); {27442#(<= (+ main_~v~0 99984) ~SIZE~0)} is VALID [2018-11-18 23:03:27,079 INFO L256 TraceCheckUtils]: 205: Hoare triple {27442#(<= (+ main_~v~0 99984) ~SIZE~0)} call #t~ret4 := elem_exists(~#set~0.base, ~#set~0.offset, ~n~0, #t~mem3); {27423#true} is VALID [2018-11-18 23:03:27,079 INFO L273 TraceCheckUtils]: 206: Hoare triple {27423#true} ~set.base, ~set.offset := #in~set.base, #in~set.offset;~size := #in~size;~value := #in~value;havoc ~i~0;~i~0 := 0; {27423#true} is VALID [2018-11-18 23:03:27,079 INFO L273 TraceCheckUtils]: 207: Hoare triple {27423#true} assume true; {27423#true} is VALID [2018-11-18 23:03:27,079 INFO L273 TraceCheckUtils]: 208: Hoare triple {27423#true} assume !!(~i~0 < ~size);call #t~mem1 := read~int(~set.base, ~set.offset + 4 * ~i~0, 4); {27423#true} is VALID [2018-11-18 23:03:27,080 INFO L273 TraceCheckUtils]: 209: Hoare triple {27423#true} assume #t~mem1 == ~value;havoc #t~mem1;#res := 1; {27423#true} is VALID [2018-11-18 23:03:27,080 INFO L273 TraceCheckUtils]: 210: Hoare triple {27423#true} assume true; {27423#true} is VALID [2018-11-18 23:03:27,082 INFO L268 TraceCheckUtils]: 211: Hoare quadruple {27423#true} {27442#(<= (+ main_~v~0 99984) ~SIZE~0)} #132#return; {27442#(<= (+ main_~v~0 99984) ~SIZE~0)} is VALID [2018-11-18 23:03:27,082 INFO L273 TraceCheckUtils]: 212: Hoare triple {27442#(<= (+ main_~v~0 99984) ~SIZE~0)} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {27442#(<= (+ main_~v~0 99984) ~SIZE~0)} is VALID [2018-11-18 23:03:27,082 INFO L273 TraceCheckUtils]: 213: Hoare triple {27442#(<= (+ main_~v~0 99984) ~SIZE~0)} assume !(1 != #t~ret4);havoc #t~mem3;havoc #t~ret4; {27442#(<= (+ main_~v~0 99984) ~SIZE~0)} is VALID [2018-11-18 23:03:27,083 INFO L273 TraceCheckUtils]: 214: Hoare triple {27442#(<= (+ main_~v~0 99984) ~SIZE~0)} #t~post2 := ~v~0;~v~0 := 1 + #t~post2;havoc #t~post2; {27443#(<= (+ main_~v~0 99983) ~SIZE~0)} is VALID [2018-11-18 23:03:27,083 INFO L273 TraceCheckUtils]: 215: Hoare triple {27443#(<= (+ main_~v~0 99983) ~SIZE~0)} assume true; {27443#(<= (+ main_~v~0 99983) ~SIZE~0)} is VALID [2018-11-18 23:03:27,084 INFO L273 TraceCheckUtils]: 216: Hoare triple {27443#(<= (+ main_~v~0 99983) ~SIZE~0)} assume !(~v~0 < ~SIZE~0); {27424#false} is VALID [2018-11-18 23:03:27,084 INFO L273 TraceCheckUtils]: 217: Hoare triple {27424#false} ~i~1 := 0; {27424#false} is VALID [2018-11-18 23:03:27,084 INFO L273 TraceCheckUtils]: 218: Hoare triple {27424#false} assume true; {27424#false} is VALID [2018-11-18 23:03:27,084 INFO L273 TraceCheckUtils]: 219: Hoare triple {27424#false} assume !!(~i~1 < ~SIZE~0 && 1 != ~found~0);call #t~mem8 := read~int(~#set~0.base, ~#set~0.offset + 4 * ~i~1, 4); {27424#false} is VALID [2018-11-18 23:03:27,085 INFO L273 TraceCheckUtils]: 220: Hoare triple {27424#false} assume !(#t~mem8 == ~element~0);havoc #t~mem8; {27424#false} is VALID [2018-11-18 23:03:27,085 INFO L273 TraceCheckUtils]: 221: Hoare triple {27424#false} #t~post7 := ~i~1;~i~1 := 1 + #t~post7;havoc #t~post7; {27424#false} is VALID [2018-11-18 23:03:27,085 INFO L273 TraceCheckUtils]: 222: Hoare triple {27424#false} assume true; {27424#false} is VALID [2018-11-18 23:03:27,085 INFO L273 TraceCheckUtils]: 223: Hoare triple {27424#false} assume !!(~i~1 < ~SIZE~0 && 1 != ~found~0);call #t~mem8 := read~int(~#set~0.base, ~#set~0.offset + 4 * ~i~1, 4); {27424#false} is VALID [2018-11-18 23:03:27,085 INFO L273 TraceCheckUtils]: 224: Hoare triple {27424#false} assume !(#t~mem8 == ~element~0);havoc #t~mem8; {27424#false} is VALID [2018-11-18 23:03:27,086 INFO L273 TraceCheckUtils]: 225: Hoare triple {27424#false} #t~post7 := ~i~1;~i~1 := 1 + #t~post7;havoc #t~post7; {27424#false} is VALID [2018-11-18 23:03:27,086 INFO L273 TraceCheckUtils]: 226: Hoare triple {27424#false} assume true; {27424#false} is VALID [2018-11-18 23:03:27,086 INFO L273 TraceCheckUtils]: 227: Hoare triple {27424#false} assume !!(~i~1 < ~SIZE~0 && 1 != ~found~0);call #t~mem8 := read~int(~#set~0.base, ~#set~0.offset + 4 * ~i~1, 4); {27424#false} is VALID [2018-11-18 23:03:27,086 INFO L273 TraceCheckUtils]: 228: Hoare triple {27424#false} assume #t~mem8 == ~element~0;havoc #t~mem8;~found~0 := 1;~pos~0 := ~i~1; {27424#false} is VALID [2018-11-18 23:03:27,086 INFO L273 TraceCheckUtils]: 229: Hoare triple {27424#false} #t~post7 := ~i~1;~i~1 := 1 + #t~post7;havoc #t~post7; {27424#false} is VALID [2018-11-18 23:03:27,087 INFO L273 TraceCheckUtils]: 230: Hoare triple {27424#false} assume true; {27424#false} is VALID [2018-11-18 23:03:27,087 INFO L273 TraceCheckUtils]: 231: Hoare triple {27424#false} assume !(~i~1 < ~SIZE~0 && 1 != ~found~0); {27424#false} is VALID [2018-11-18 23:03:27,087 INFO L273 TraceCheckUtils]: 232: Hoare triple {27424#false} assume 1 == ~found~0;~i~1 := ~pos~0; {27424#false} is VALID [2018-11-18 23:03:27,087 INFO L273 TraceCheckUtils]: 233: Hoare triple {27424#false} assume true; {27424#false} is VALID [2018-11-18 23:03:27,087 INFO L273 TraceCheckUtils]: 234: Hoare triple {27424#false} assume !!(~i~1 < ~SIZE~0 - 1);call #t~mem10 := read~int(~#set~0.base, ~#set~0.offset + 4 * (1 + ~i~1), 4);call write~int(#t~mem10, ~#set~0.base, ~#set~0.offset + 4 * ~i~1, 4);havoc #t~mem10; {27424#false} is VALID [2018-11-18 23:03:27,087 INFO L273 TraceCheckUtils]: 235: Hoare triple {27424#false} #t~post9 := ~i~1;~i~1 := 1 + #t~post9;havoc #t~post9; {27424#false} is VALID [2018-11-18 23:03:27,088 INFO L273 TraceCheckUtils]: 236: Hoare triple {27424#false} assume true; {27424#false} is VALID [2018-11-18 23:03:27,088 INFO L273 TraceCheckUtils]: 237: Hoare triple {27424#false} assume !!(~i~1 < ~SIZE~0 - 1);call #t~mem10 := read~int(~#set~0.base, ~#set~0.offset + 4 * (1 + ~i~1), 4);call write~int(#t~mem10, ~#set~0.base, ~#set~0.offset + 4 * ~i~1, 4);havoc #t~mem10; {27424#false} is VALID [2018-11-18 23:03:27,088 INFO L273 TraceCheckUtils]: 238: Hoare triple {27424#false} #t~post9 := ~i~1;~i~1 := 1 + #t~post9;havoc #t~post9; {27424#false} is VALID [2018-11-18 23:03:27,088 INFO L273 TraceCheckUtils]: 239: Hoare triple {27424#false} assume true; {27424#false} is VALID [2018-11-18 23:03:27,088 INFO L273 TraceCheckUtils]: 240: Hoare triple {27424#false} assume !(~i~1 < ~SIZE~0 - 1); {27424#false} is VALID [2018-11-18 23:03:27,089 INFO L273 TraceCheckUtils]: 241: Hoare triple {27424#false} assume 1 == ~found~0;~i~1 := 0; {27424#false} is VALID [2018-11-18 23:03:27,089 INFO L273 TraceCheckUtils]: 242: Hoare triple {27424#false} assume true; {27424#false} is VALID [2018-11-18 23:03:27,089 INFO L273 TraceCheckUtils]: 243: Hoare triple {27424#false} assume !!(~i~1 < ~SIZE~0 - 1);call #t~mem12 := read~int(~#set~0.base, ~#set~0.offset + 4 * ~i~1, 4); {27424#false} is VALID [2018-11-18 23:03:27,089 INFO L256 TraceCheckUtils]: 244: Hoare triple {27424#false} call __VERIFIER_assert((if #t~mem12 != ~element~0 then 1 else 0)); {27424#false} is VALID [2018-11-18 23:03:27,089 INFO L273 TraceCheckUtils]: 245: Hoare triple {27424#false} ~cond := #in~cond; {27424#false} is VALID [2018-11-18 23:03:27,090 INFO L273 TraceCheckUtils]: 246: Hoare triple {27424#false} assume 0 == ~cond; {27424#false} is VALID [2018-11-18 23:03:27,090 INFO L273 TraceCheckUtils]: 247: Hoare triple {27424#false} assume !false; {27424#false} is VALID [2018-11-18 23:03:27,188 INFO L134 CoverageAnalysis]: Checked inductivity of 1675 backedges. 0 proven. 850 refuted. 0 times theorem prover too weak. 825 trivial. 0 not checked. [2018-11-18 23:03:27,188 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 23:03:27,188 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-18 23:03:27,207 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-18 23:03:27,317 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-18 23:03:27,317 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-18 23:03:27,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 23:03:27,367 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 23:03:28,374 INFO L256 TraceCheckUtils]: 0: Hoare triple {27423#true} call ULTIMATE.init(); {27423#true} is VALID [2018-11-18 23:03:28,375 INFO L273 TraceCheckUtils]: 1: Hoare triple {27423#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~SIZE~0 := 100000; {27425#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:03:28,376 INFO L273 TraceCheckUtils]: 2: Hoare triple {27425#(<= 100000 ~SIZE~0)} assume true; {27425#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:03:28,376 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {27425#(<= 100000 ~SIZE~0)} {27423#true} #128#return; {27425#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:03:28,377 INFO L256 TraceCheckUtils]: 4: Hoare triple {27425#(<= 100000 ~SIZE~0)} call #t~ret13 := main(); {27425#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:03:28,378 INFO L273 TraceCheckUtils]: 5: Hoare triple {27425#(<= 100000 ~SIZE~0)} havoc ~i~1;havoc ~pos~0;~n~0 := 0;~found~0 := 0;call ~#set~0.base, ~#set~0.offset := #Ultimate.alloc(4 * ~SIZE~0);call ~#values~0.base, ~#values~0.offset := #Ultimate.alloc(4 * ~SIZE~0);havoc ~element~0;havoc ~v~0;~v~0 := 0; {27462#(and (<= main_~v~0 0) (<= 100000 ~SIZE~0))} is VALID [2018-11-18 23:03:28,378 INFO L273 TraceCheckUtils]: 6: Hoare triple {27462#(and (<= main_~v~0 0) (<= 100000 ~SIZE~0))} assume true; {27462#(and (<= main_~v~0 0) (<= 100000 ~SIZE~0))} is VALID [2018-11-18 23:03:28,379 INFO L273 TraceCheckUtils]: 7: Hoare triple {27462#(and (<= main_~v~0 0) (<= 100000 ~SIZE~0))} assume !!(~v~0 < ~SIZE~0);call #t~mem3 := read~int(~#values~0.base, ~#values~0.offset + 4 * ~v~0, 4); {27462#(and (<= main_~v~0 0) (<= 100000 ~SIZE~0))} is VALID [2018-11-18 23:03:28,380 INFO L256 TraceCheckUtils]: 8: Hoare triple {27462#(and (<= main_~v~0 0) (<= 100000 ~SIZE~0))} call #t~ret4 := elem_exists(~#set~0.base, ~#set~0.offset, ~n~0, #t~mem3); {27425#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:03:28,380 INFO L273 TraceCheckUtils]: 9: Hoare triple {27425#(<= 100000 ~SIZE~0)} ~set.base, ~set.offset := #in~set.base, #in~set.offset;~size := #in~size;~value := #in~value;havoc ~i~0;~i~0 := 0; {27425#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:03:28,380 INFO L273 TraceCheckUtils]: 10: Hoare triple {27425#(<= 100000 ~SIZE~0)} assume true; {27425#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:03:28,380 INFO L273 TraceCheckUtils]: 11: Hoare triple {27425#(<= 100000 ~SIZE~0)} assume !(~i~0 < ~size); {27425#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:03:28,381 INFO L273 TraceCheckUtils]: 12: Hoare triple {27425#(<= 100000 ~SIZE~0)} #res := 0; {27425#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:03:28,381 INFO L273 TraceCheckUtils]: 13: Hoare triple {27425#(<= 100000 ~SIZE~0)} assume true; {27425#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:03:28,382 INFO L268 TraceCheckUtils]: 14: Hoare quadruple {27425#(<= 100000 ~SIZE~0)} {27462#(and (<= main_~v~0 0) (<= 100000 ~SIZE~0))} #132#return; {27462#(and (<= main_~v~0 0) (<= 100000 ~SIZE~0))} is VALID [2018-11-18 23:03:28,383 INFO L273 TraceCheckUtils]: 15: Hoare triple {27462#(and (<= main_~v~0 0) (<= 100000 ~SIZE~0))} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {27462#(and (<= main_~v~0 0) (<= 100000 ~SIZE~0))} is VALID [2018-11-18 23:03:28,384 INFO L273 TraceCheckUtils]: 16: Hoare triple {27462#(and (<= main_~v~0 0) (<= 100000 ~SIZE~0))} assume 1 != #t~ret4;havoc #t~mem3;havoc #t~ret4;call #t~mem5 := read~int(~#values~0.base, ~#values~0.offset + 4 * ~v~0, 4); {27462#(and (<= main_~v~0 0) (<= 100000 ~SIZE~0))} is VALID [2018-11-18 23:03:28,386 INFO L256 TraceCheckUtils]: 17: Hoare triple {27462#(and (<= main_~v~0 0) (<= 100000 ~SIZE~0))} call #t~ret6 := insert(~#set~0.base, ~#set~0.offset, ~n~0, #t~mem5); {27425#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:03:28,387 INFO L273 TraceCheckUtils]: 18: Hoare triple {27425#(<= 100000 ~SIZE~0)} ~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; {27425#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:03:28,387 INFO L273 TraceCheckUtils]: 19: Hoare triple {27425#(<= 100000 ~SIZE~0)} assume true; {27425#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:03:28,388 INFO L268 TraceCheckUtils]: 20: Hoare quadruple {27425#(<= 100000 ~SIZE~0)} {27462#(and (<= main_~v~0 0) (<= 100000 ~SIZE~0))} #134#return; {27462#(and (<= main_~v~0 0) (<= 100000 ~SIZE~0))} is VALID [2018-11-18 23:03:28,388 INFO L273 TraceCheckUtils]: 21: Hoare triple {27462#(and (<= main_~v~0 0) (<= 100000 ~SIZE~0))} assume -2147483648 <= #t~ret6 && #t~ret6 <= 2147483647;~n~0 := #t~ret6;havoc #t~ret6;havoc #t~mem5; {27462#(and (<= main_~v~0 0) (<= 100000 ~SIZE~0))} is VALID [2018-11-18 23:03:28,389 INFO L273 TraceCheckUtils]: 22: Hoare triple {27462#(and (<= main_~v~0 0) (<= 100000 ~SIZE~0))} #t~post2 := ~v~0;~v~0 := 1 + #t~post2;havoc #t~post2; {27514#(and (<= main_~v~0 1) (<= 100000 ~SIZE~0))} is VALID [2018-11-18 23:03:28,389 INFO L273 TraceCheckUtils]: 23: Hoare triple {27514#(and (<= main_~v~0 1) (<= 100000 ~SIZE~0))} assume true; {27514#(and (<= main_~v~0 1) (<= 100000 ~SIZE~0))} is VALID [2018-11-18 23:03:28,390 INFO L273 TraceCheckUtils]: 24: Hoare triple {27514#(and (<= main_~v~0 1) (<= 100000 ~SIZE~0))} assume !!(~v~0 < ~SIZE~0);call #t~mem3 := read~int(~#values~0.base, ~#values~0.offset + 4 * ~v~0, 4); {27514#(and (<= main_~v~0 1) (<= 100000 ~SIZE~0))} is VALID [2018-11-18 23:03:28,391 INFO L256 TraceCheckUtils]: 25: Hoare triple {27514#(and (<= main_~v~0 1) (<= 100000 ~SIZE~0))} call #t~ret4 := elem_exists(~#set~0.base, ~#set~0.offset, ~n~0, #t~mem3); {27425#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:03:28,392 INFO L273 TraceCheckUtils]: 26: Hoare triple {27425#(<= 100000 ~SIZE~0)} ~set.base, ~set.offset := #in~set.base, #in~set.offset;~size := #in~size;~value := #in~value;havoc ~i~0;~i~0 := 0; {27425#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:03:28,392 INFO L273 TraceCheckUtils]: 27: Hoare triple {27425#(<= 100000 ~SIZE~0)} assume true; {27425#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:03:28,393 INFO L273 TraceCheckUtils]: 28: Hoare triple {27425#(<= 100000 ~SIZE~0)} assume !!(~i~0 < ~size);call #t~mem1 := read~int(~set.base, ~set.offset + 4 * ~i~0, 4); {27425#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:03:28,393 INFO L273 TraceCheckUtils]: 29: Hoare triple {27425#(<= 100000 ~SIZE~0)} assume #t~mem1 == ~value;havoc #t~mem1;#res := 1; {27425#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:03:28,394 INFO L273 TraceCheckUtils]: 30: Hoare triple {27425#(<= 100000 ~SIZE~0)} assume true; {27425#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:03:28,395 INFO L268 TraceCheckUtils]: 31: Hoare quadruple {27425#(<= 100000 ~SIZE~0)} {27514#(and (<= main_~v~0 1) (<= 100000 ~SIZE~0))} #132#return; {27514#(and (<= main_~v~0 1) (<= 100000 ~SIZE~0))} is VALID [2018-11-18 23:03:28,395 INFO L273 TraceCheckUtils]: 32: Hoare triple {27514#(and (<= main_~v~0 1) (<= 100000 ~SIZE~0))} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {27514#(and (<= main_~v~0 1) (<= 100000 ~SIZE~0))} is VALID [2018-11-18 23:03:28,396 INFO L273 TraceCheckUtils]: 33: Hoare triple {27514#(and (<= main_~v~0 1) (<= 100000 ~SIZE~0))} assume !(1 != #t~ret4);havoc #t~mem3;havoc #t~ret4; {27514#(and (<= main_~v~0 1) (<= 100000 ~SIZE~0))} is VALID [2018-11-18 23:03:28,397 INFO L273 TraceCheckUtils]: 34: Hoare triple {27514#(and (<= main_~v~0 1) (<= 100000 ~SIZE~0))} #t~post2 := ~v~0;~v~0 := 1 + #t~post2;havoc #t~post2; {27551#(and (<= main_~v~0 2) (<= 100000 ~SIZE~0))} is VALID [2018-11-18 23:03:28,398 INFO L273 TraceCheckUtils]: 35: Hoare triple {27551#(and (<= main_~v~0 2) (<= 100000 ~SIZE~0))} assume true; {27551#(and (<= main_~v~0 2) (<= 100000 ~SIZE~0))} is VALID [2018-11-18 23:03:28,398 INFO L273 TraceCheckUtils]: 36: Hoare triple {27551#(and (<= main_~v~0 2) (<= 100000 ~SIZE~0))} assume !!(~v~0 < ~SIZE~0);call #t~mem3 := read~int(~#values~0.base, ~#values~0.offset + 4 * ~v~0, 4); {27551#(and (<= main_~v~0 2) (<= 100000 ~SIZE~0))} is VALID [2018-11-18 23:03:28,400 INFO L256 TraceCheckUtils]: 37: Hoare triple {27551#(and (<= main_~v~0 2) (<= 100000 ~SIZE~0))} call #t~ret4 := elem_exists(~#set~0.base, ~#set~0.offset, ~n~0, #t~mem3); {27425#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:03:28,400 INFO L273 TraceCheckUtils]: 38: Hoare triple {27425#(<= 100000 ~SIZE~0)} ~set.base, ~set.offset := #in~set.base, #in~set.offset;~size := #in~size;~value := #in~value;havoc ~i~0;~i~0 := 0; {27425#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:03:28,401 INFO L273 TraceCheckUtils]: 39: Hoare triple {27425#(<= 100000 ~SIZE~0)} assume true; {27425#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:03:28,401 INFO L273 TraceCheckUtils]: 40: Hoare triple {27425#(<= 100000 ~SIZE~0)} assume !!(~i~0 < ~size);call #t~mem1 := read~int(~set.base, ~set.offset + 4 * ~i~0, 4); {27425#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:03:28,402 INFO L273 TraceCheckUtils]: 41: Hoare triple {27425#(<= 100000 ~SIZE~0)} assume #t~mem1 == ~value;havoc #t~mem1;#res := 1; {27425#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:03:28,402 INFO L273 TraceCheckUtils]: 42: Hoare triple {27425#(<= 100000 ~SIZE~0)} assume true; {27425#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:03:28,403 INFO L268 TraceCheckUtils]: 43: Hoare quadruple {27425#(<= 100000 ~SIZE~0)} {27551#(and (<= main_~v~0 2) (<= 100000 ~SIZE~0))} #132#return; {27551#(and (<= main_~v~0 2) (<= 100000 ~SIZE~0))} is VALID [2018-11-18 23:03:28,404 INFO L273 TraceCheckUtils]: 44: Hoare triple {27551#(and (<= main_~v~0 2) (<= 100000 ~SIZE~0))} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {27551#(and (<= main_~v~0 2) (<= 100000 ~SIZE~0))} is VALID [2018-11-18 23:03:28,405 INFO L273 TraceCheckUtils]: 45: Hoare triple {27551#(and (<= main_~v~0 2) (<= 100000 ~SIZE~0))} assume !(1 != #t~ret4);havoc #t~mem3;havoc #t~ret4; {27551#(and (<= main_~v~0 2) (<= 100000 ~SIZE~0))} is VALID [2018-11-18 23:03:28,405 INFO L273 TraceCheckUtils]: 46: Hoare triple {27551#(and (<= main_~v~0 2) (<= 100000 ~SIZE~0))} #t~post2 := ~v~0;~v~0 := 1 + #t~post2;havoc #t~post2; {27588#(and (<= main_~v~0 3) (<= 100000 ~SIZE~0))} is VALID [2018-11-18 23:03:28,406 INFO L273 TraceCheckUtils]: 47: Hoare triple {27588#(and (<= main_~v~0 3) (<= 100000 ~SIZE~0))} assume true; {27588#(and (<= main_~v~0 3) (<= 100000 ~SIZE~0))} is VALID [2018-11-18 23:03:28,407 INFO L273 TraceCheckUtils]: 48: Hoare triple {27588#(and (<= main_~v~0 3) (<= 100000 ~SIZE~0))} assume !!(~v~0 < ~SIZE~0);call #t~mem3 := read~int(~#values~0.base, ~#values~0.offset + 4 * ~v~0, 4); {27588#(and (<= main_~v~0 3) (<= 100000 ~SIZE~0))} is VALID [2018-11-18 23:03:28,408 INFO L256 TraceCheckUtils]: 49: Hoare triple {27588#(and (<= main_~v~0 3) (<= 100000 ~SIZE~0))} call #t~ret4 := elem_exists(~#set~0.base, ~#set~0.offset, ~n~0, #t~mem3); {27425#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:03:28,409 INFO L273 TraceCheckUtils]: 50: Hoare triple {27425#(<= 100000 ~SIZE~0)} ~set.base, ~set.offset := #in~set.base, #in~set.offset;~size := #in~size;~value := #in~value;havoc ~i~0;~i~0 := 0; {27425#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:03:28,409 INFO L273 TraceCheckUtils]: 51: Hoare triple {27425#(<= 100000 ~SIZE~0)} assume true; {27425#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:03:28,410 INFO L273 TraceCheckUtils]: 52: Hoare triple {27425#(<= 100000 ~SIZE~0)} assume !!(~i~0 < ~size);call #t~mem1 := read~int(~set.base, ~set.offset + 4 * ~i~0, 4); {27425#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:03:28,410 INFO L273 TraceCheckUtils]: 53: Hoare triple {27425#(<= 100000 ~SIZE~0)} assume #t~mem1 == ~value;havoc #t~mem1;#res := 1; {27425#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:03:28,411 INFO L273 TraceCheckUtils]: 54: Hoare triple {27425#(<= 100000 ~SIZE~0)} assume true; {27425#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:03:28,412 INFO L268 TraceCheckUtils]: 55: Hoare quadruple {27425#(<= 100000 ~SIZE~0)} {27588#(and (<= main_~v~0 3) (<= 100000 ~SIZE~0))} #132#return; {27588#(and (<= main_~v~0 3) (<= 100000 ~SIZE~0))} is VALID [2018-11-18 23:03:28,412 INFO L273 TraceCheckUtils]: 56: Hoare triple {27588#(and (<= main_~v~0 3) (<= 100000 ~SIZE~0))} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {27588#(and (<= main_~v~0 3) (<= 100000 ~SIZE~0))} is VALID [2018-11-18 23:03:28,413 INFO L273 TraceCheckUtils]: 57: Hoare triple {27588#(and (<= main_~v~0 3) (<= 100000 ~SIZE~0))} assume !(1 != #t~ret4);havoc #t~mem3;havoc #t~ret4; {27588#(and (<= main_~v~0 3) (<= 100000 ~SIZE~0))} is VALID [2018-11-18 23:03:28,414 INFO L273 TraceCheckUtils]: 58: Hoare triple {27588#(and (<= main_~v~0 3) (<= 100000 ~SIZE~0))} #t~post2 := ~v~0;~v~0 := 1 + #t~post2;havoc #t~post2; {27625#(and (<= main_~v~0 4) (<= 100000 ~SIZE~0))} is VALID [2018-11-18 23:03:28,414 INFO L273 TraceCheckUtils]: 59: Hoare triple {27625#(and (<= main_~v~0 4) (<= 100000 ~SIZE~0))} assume true; {27625#(and (<= main_~v~0 4) (<= 100000 ~SIZE~0))} is VALID [2018-11-18 23:03:28,415 INFO L273 TraceCheckUtils]: 60: Hoare triple {27625#(and (<= main_~v~0 4) (<= 100000 ~SIZE~0))} assume !!(~v~0 < ~SIZE~0);call #t~mem3 := read~int(~#values~0.base, ~#values~0.offset + 4 * ~v~0, 4); {27625#(and (<= main_~v~0 4) (<= 100000 ~SIZE~0))} is VALID [2018-11-18 23:03:28,416 INFO L256 TraceCheckUtils]: 61: Hoare triple {27625#(and (<= main_~v~0 4) (<= 100000 ~SIZE~0))} call #t~ret4 := elem_exists(~#set~0.base, ~#set~0.offset, ~n~0, #t~mem3); {27425#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:03:28,417 INFO L273 TraceCheckUtils]: 62: Hoare triple {27425#(<= 100000 ~SIZE~0)} ~set.base, ~set.offset := #in~set.base, #in~set.offset;~size := #in~size;~value := #in~value;havoc ~i~0;~i~0 := 0; {27425#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:03:28,417 INFO L273 TraceCheckUtils]: 63: Hoare triple {27425#(<= 100000 ~SIZE~0)} assume true; {27425#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:03:28,418 INFO L273 TraceCheckUtils]: 64: Hoare triple {27425#(<= 100000 ~SIZE~0)} assume !!(~i~0 < ~size);call #t~mem1 := read~int(~set.base, ~set.offset + 4 * ~i~0, 4); {27425#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:03:28,418 INFO L273 TraceCheckUtils]: 65: Hoare triple {27425#(<= 100000 ~SIZE~0)} assume #t~mem1 == ~value;havoc #t~mem1;#res := 1; {27425#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:03:28,419 INFO L273 TraceCheckUtils]: 66: Hoare triple {27425#(<= 100000 ~SIZE~0)} assume true; {27425#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:03:28,420 INFO L268 TraceCheckUtils]: 67: Hoare quadruple {27425#(<= 100000 ~SIZE~0)} {27625#(and (<= main_~v~0 4) (<= 100000 ~SIZE~0))} #132#return; {27625#(and (<= main_~v~0 4) (<= 100000 ~SIZE~0))} is VALID [2018-11-18 23:03:28,421 INFO L273 TraceCheckUtils]: 68: Hoare triple {27625#(and (<= main_~v~0 4) (<= 100000 ~SIZE~0))} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {27625#(and (<= main_~v~0 4) (<= 100000 ~SIZE~0))} is VALID [2018-11-18 23:03:28,421 INFO L273 TraceCheckUtils]: 69: Hoare triple {27625#(and (<= main_~v~0 4) (<= 100000 ~SIZE~0))} assume !(1 != #t~ret4);havoc #t~mem3;havoc #t~ret4; {27625#(and (<= main_~v~0 4) (<= 100000 ~SIZE~0))} is VALID [2018-11-18 23:03:28,422 INFO L273 TraceCheckUtils]: 70: Hoare triple {27625#(and (<= main_~v~0 4) (<= 100000 ~SIZE~0))} #t~post2 := ~v~0;~v~0 := 1 + #t~post2;havoc #t~post2; {27662#(and (<= main_~v~0 5) (<= 100000 ~SIZE~0))} is VALID [2018-11-18 23:03:28,423 INFO L273 TraceCheckUtils]: 71: Hoare triple {27662#(and (<= main_~v~0 5) (<= 100000 ~SIZE~0))} assume true; {27662#(and (<= main_~v~0 5) (<= 100000 ~SIZE~0))} is VALID [2018-11-18 23:03:28,424 INFO L273 TraceCheckUtils]: 72: Hoare triple {27662#(and (<= main_~v~0 5) (<= 100000 ~SIZE~0))} assume !!(~v~0 < ~SIZE~0);call #t~mem3 := read~int(~#values~0.base, ~#values~0.offset + 4 * ~v~0, 4); {27662#(and (<= main_~v~0 5) (<= 100000 ~SIZE~0))} is VALID [2018-11-18 23:03:28,425 INFO L256 TraceCheckUtils]: 73: Hoare triple {27662#(and (<= main_~v~0 5) (<= 100000 ~SIZE~0))} call #t~ret4 := elem_exists(~#set~0.base, ~#set~0.offset, ~n~0, #t~mem3); {27425#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:03:28,425 INFO L273 TraceCheckUtils]: 74: Hoare triple {27425#(<= 100000 ~SIZE~0)} ~set.base, ~set.offset := #in~set.base, #in~set.offset;~size := #in~size;~value := #in~value;havoc ~i~0;~i~0 := 0; {27425#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:03:28,426 INFO L273 TraceCheckUtils]: 75: Hoare triple {27425#(<= 100000 ~SIZE~0)} assume true; {27425#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:03:28,426 INFO L273 TraceCheckUtils]: 76: Hoare triple {27425#(<= 100000 ~SIZE~0)} assume !!(~i~0 < ~size);call #t~mem1 := read~int(~set.base, ~set.offset + 4 * ~i~0, 4); {27425#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:03:28,427 INFO L273 TraceCheckUtils]: 77: Hoare triple {27425#(<= 100000 ~SIZE~0)} assume #t~mem1 == ~value;havoc #t~mem1;#res := 1; {27425#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:03:28,427 INFO L273 TraceCheckUtils]: 78: Hoare triple {27425#(<= 100000 ~SIZE~0)} assume true; {27425#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:03:28,428 INFO L268 TraceCheckUtils]: 79: Hoare quadruple {27425#(<= 100000 ~SIZE~0)} {27662#(and (<= main_~v~0 5) (<= 100000 ~SIZE~0))} #132#return; {27662#(and (<= main_~v~0 5) (<= 100000 ~SIZE~0))} is VALID [2018-11-18 23:03:28,429 INFO L273 TraceCheckUtils]: 80: Hoare triple {27662#(and (<= main_~v~0 5) (<= 100000 ~SIZE~0))} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {27662#(and (<= main_~v~0 5) (<= 100000 ~SIZE~0))} is VALID [2018-11-18 23:03:28,430 INFO L273 TraceCheckUtils]: 81: Hoare triple {27662#(and (<= main_~v~0 5) (<= 100000 ~SIZE~0))} assume !(1 != #t~ret4);havoc #t~mem3;havoc #t~ret4; {27662#(and (<= main_~v~0 5) (<= 100000 ~SIZE~0))} is VALID [2018-11-18 23:03:28,430 INFO L273 TraceCheckUtils]: 82: Hoare triple {27662#(and (<= main_~v~0 5) (<= 100000 ~SIZE~0))} #t~post2 := ~v~0;~v~0 := 1 + #t~post2;havoc #t~post2; {27699#(and (<= main_~v~0 6) (<= 100000 ~SIZE~0))} is VALID [2018-11-18 23:03:28,443 INFO L273 TraceCheckUtils]: 83: Hoare triple {27699#(and (<= main_~v~0 6) (<= 100000 ~SIZE~0))} assume true; {27699#(and (<= main_~v~0 6) (<= 100000 ~SIZE~0))} is VALID [2018-11-18 23:03:28,444 INFO L273 TraceCheckUtils]: 84: Hoare triple {27699#(and (<= main_~v~0 6) (<= 100000 ~SIZE~0))} assume !!(~v~0 < ~SIZE~0);call #t~mem3 := read~int(~#values~0.base, ~#values~0.offset + 4 * ~v~0, 4); {27699#(and (<= main_~v~0 6) (<= 100000 ~SIZE~0))} is VALID [2018-11-18 23:03:28,444 INFO L256 TraceCheckUtils]: 85: Hoare triple {27699#(and (<= main_~v~0 6) (<= 100000 ~SIZE~0))} call #t~ret4 := elem_exists(~#set~0.base, ~#set~0.offset, ~n~0, #t~mem3); {27425#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:03:28,445 INFO L273 TraceCheckUtils]: 86: Hoare triple {27425#(<= 100000 ~SIZE~0)} ~set.base, ~set.offset := #in~set.base, #in~set.offset;~size := #in~size;~value := #in~value;havoc ~i~0;~i~0 := 0; {27425#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:03:28,445 INFO L273 TraceCheckUtils]: 87: Hoare triple {27425#(<= 100000 ~SIZE~0)} assume true; {27425#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:03:28,445 INFO L273 TraceCheckUtils]: 88: Hoare triple {27425#(<= 100000 ~SIZE~0)} assume !!(~i~0 < ~size);call #t~mem1 := read~int(~set.base, ~set.offset + 4 * ~i~0, 4); {27425#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:03:28,446 INFO L273 TraceCheckUtils]: 89: Hoare triple {27425#(<= 100000 ~SIZE~0)} assume #t~mem1 == ~value;havoc #t~mem1;#res := 1; {27425#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:03:28,446 INFO L273 TraceCheckUtils]: 90: Hoare triple {27425#(<= 100000 ~SIZE~0)} assume true; {27425#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:03:28,447 INFO L268 TraceCheckUtils]: 91: Hoare quadruple {27425#(<= 100000 ~SIZE~0)} {27699#(and (<= main_~v~0 6) (<= 100000 ~SIZE~0))} #132#return; {27699#(and (<= main_~v~0 6) (<= 100000 ~SIZE~0))} is VALID [2018-11-18 23:03:28,448 INFO L273 TraceCheckUtils]: 92: Hoare triple {27699#(and (<= main_~v~0 6) (<= 100000 ~SIZE~0))} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {27699#(and (<= main_~v~0 6) (<= 100000 ~SIZE~0))} is VALID [2018-11-18 23:03:28,448 INFO L273 TraceCheckUtils]: 93: Hoare triple {27699#(and (<= main_~v~0 6) (<= 100000 ~SIZE~0))} assume !(1 != #t~ret4);havoc #t~mem3;havoc #t~ret4; {27699#(and (<= main_~v~0 6) (<= 100000 ~SIZE~0))} is VALID [2018-11-18 23:03:28,449 INFO L273 TraceCheckUtils]: 94: Hoare triple {27699#(and (<= main_~v~0 6) (<= 100000 ~SIZE~0))} #t~post2 := ~v~0;~v~0 := 1 + #t~post2;havoc #t~post2; {27736#(and (<= main_~v~0 7) (<= 100000 ~SIZE~0))} is VALID [2018-11-18 23:03:28,450 INFO L273 TraceCheckUtils]: 95: Hoare triple {27736#(and (<= main_~v~0 7) (<= 100000 ~SIZE~0))} assume true; {27736#(and (<= main_~v~0 7) (<= 100000 ~SIZE~0))} is VALID [2018-11-18 23:03:28,451 INFO L273 TraceCheckUtils]: 96: Hoare triple {27736#(and (<= main_~v~0 7) (<= 100000 ~SIZE~0))} assume !!(~v~0 < ~SIZE~0);call #t~mem3 := read~int(~#values~0.base, ~#values~0.offset + 4 * ~v~0, 4); {27736#(and (<= main_~v~0 7) (<= 100000 ~SIZE~0))} is VALID [2018-11-18 23:03:28,452 INFO L256 TraceCheckUtils]: 97: Hoare triple {27736#(and (<= main_~v~0 7) (<= 100000 ~SIZE~0))} call #t~ret4 := elem_exists(~#set~0.base, ~#set~0.offset, ~n~0, #t~mem3); {27425#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:03:28,452 INFO L273 TraceCheckUtils]: 98: Hoare triple {27425#(<= 100000 ~SIZE~0)} ~set.base, ~set.offset := #in~set.base, #in~set.offset;~size := #in~size;~value := #in~value;havoc ~i~0;~i~0 := 0; {27425#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:03:28,453 INFO L273 TraceCheckUtils]: 99: Hoare triple {27425#(<= 100000 ~SIZE~0)} assume true; {27425#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:03:28,453 INFO L273 TraceCheckUtils]: 100: Hoare triple {27425#(<= 100000 ~SIZE~0)} assume !!(~i~0 < ~size);call #t~mem1 := read~int(~set.base, ~set.offset + 4 * ~i~0, 4); {27425#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:03:28,454 INFO L273 TraceCheckUtils]: 101: Hoare triple {27425#(<= 100000 ~SIZE~0)} assume #t~mem1 == ~value;havoc #t~mem1;#res := 1; {27425#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:03:28,454 INFO L273 TraceCheckUtils]: 102: Hoare triple {27425#(<= 100000 ~SIZE~0)} assume true; {27425#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:03:28,456 INFO L268 TraceCheckUtils]: 103: Hoare quadruple {27425#(<= 100000 ~SIZE~0)} {27736#(and (<= main_~v~0 7) (<= 100000 ~SIZE~0))} #132#return; {27736#(and (<= main_~v~0 7) (<= 100000 ~SIZE~0))} is VALID [2018-11-18 23:03:28,456 INFO L273 TraceCheckUtils]: 104: Hoare triple {27736#(and (<= main_~v~0 7) (<= 100000 ~SIZE~0))} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {27736#(and (<= main_~v~0 7) (<= 100000 ~SIZE~0))} is VALID [2018-11-18 23:03:28,457 INFO L273 TraceCheckUtils]: 105: Hoare triple {27736#(and (<= main_~v~0 7) (<= 100000 ~SIZE~0))} assume !(1 != #t~ret4);havoc #t~mem3;havoc #t~ret4; {27736#(and (<= main_~v~0 7) (<= 100000 ~SIZE~0))} is VALID [2018-11-18 23:03:28,458 INFO L273 TraceCheckUtils]: 106: Hoare triple {27736#(and (<= main_~v~0 7) (<= 100000 ~SIZE~0))} #t~post2 := ~v~0;~v~0 := 1 + #t~post2;havoc #t~post2; {27773#(and (<= main_~v~0 8) (<= 100000 ~SIZE~0))} is VALID [2018-11-18 23:03:28,458 INFO L273 TraceCheckUtils]: 107: Hoare triple {27773#(and (<= main_~v~0 8) (<= 100000 ~SIZE~0))} assume true; {27773#(and (<= main_~v~0 8) (<= 100000 ~SIZE~0))} is VALID [2018-11-18 23:03:28,459 INFO L273 TraceCheckUtils]: 108: Hoare triple {27773#(and (<= main_~v~0 8) (<= 100000 ~SIZE~0))} assume !!(~v~0 < ~SIZE~0);call #t~mem3 := read~int(~#values~0.base, ~#values~0.offset + 4 * ~v~0, 4); {27773#(and (<= main_~v~0 8) (<= 100000 ~SIZE~0))} is VALID [2018-11-18 23:03:28,460 INFO L256 TraceCheckUtils]: 109: Hoare triple {27773#(and (<= main_~v~0 8) (<= 100000 ~SIZE~0))} call #t~ret4 := elem_exists(~#set~0.base, ~#set~0.offset, ~n~0, #t~mem3); {27425#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:03:28,461 INFO L273 TraceCheckUtils]: 110: Hoare triple {27425#(<= 100000 ~SIZE~0)} ~set.base, ~set.offset := #in~set.base, #in~set.offset;~size := #in~size;~value := #in~value;havoc ~i~0;~i~0 := 0; {27425#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:03:28,461 INFO L273 TraceCheckUtils]: 111: Hoare triple {27425#(<= 100000 ~SIZE~0)} assume true; {27425#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:03:28,462 INFO L273 TraceCheckUtils]: 112: Hoare triple {27425#(<= 100000 ~SIZE~0)} assume !!(~i~0 < ~size);call #t~mem1 := read~int(~set.base, ~set.offset + 4 * ~i~0, 4); {27425#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:03:28,462 INFO L273 TraceCheckUtils]: 113: Hoare triple {27425#(<= 100000 ~SIZE~0)} assume #t~mem1 == ~value;havoc #t~mem1;#res := 1; {27425#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:03:28,463 INFO L273 TraceCheckUtils]: 114: Hoare triple {27425#(<= 100000 ~SIZE~0)} assume true; {27425#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:03:28,464 INFO L268 TraceCheckUtils]: 115: Hoare quadruple {27425#(<= 100000 ~SIZE~0)} {27773#(and (<= main_~v~0 8) (<= 100000 ~SIZE~0))} #132#return; {27773#(and (<= main_~v~0 8) (<= 100000 ~SIZE~0))} is VALID [2018-11-18 23:03:28,465 INFO L273 TraceCheckUtils]: 116: Hoare triple {27773#(and (<= main_~v~0 8) (<= 100000 ~SIZE~0))} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {27773#(and (<= main_~v~0 8) (<= 100000 ~SIZE~0))} is VALID [2018-11-18 23:03:28,465 INFO L273 TraceCheckUtils]: 117: Hoare triple {27773#(and (<= main_~v~0 8) (<= 100000 ~SIZE~0))} assume !(1 != #t~ret4);havoc #t~mem3;havoc #t~ret4; {27773#(and (<= main_~v~0 8) (<= 100000 ~SIZE~0))} is VALID [2018-11-18 23:03:28,466 INFO L273 TraceCheckUtils]: 118: Hoare triple {27773#(and (<= main_~v~0 8) (<= 100000 ~SIZE~0))} #t~post2 := ~v~0;~v~0 := 1 + #t~post2;havoc #t~post2; {27810#(and (<= main_~v~0 9) (<= 100000 ~SIZE~0))} is VALID [2018-11-18 23:03:28,467 INFO L273 TraceCheckUtils]: 119: Hoare triple {27810#(and (<= main_~v~0 9) (<= 100000 ~SIZE~0))} assume true; {27810#(and (<= main_~v~0 9) (<= 100000 ~SIZE~0))} is VALID [2018-11-18 23:03:28,468 INFO L273 TraceCheckUtils]: 120: Hoare triple {27810#(and (<= main_~v~0 9) (<= 100000 ~SIZE~0))} assume !!(~v~0 < ~SIZE~0);call #t~mem3 := read~int(~#values~0.base, ~#values~0.offset + 4 * ~v~0, 4); {27810#(and (<= main_~v~0 9) (<= 100000 ~SIZE~0))} is VALID [2018-11-18 23:03:28,469 INFO L256 TraceCheckUtils]: 121: Hoare triple {27810#(and (<= main_~v~0 9) (<= 100000 ~SIZE~0))} call #t~ret4 := elem_exists(~#set~0.base, ~#set~0.offset, ~n~0, #t~mem3); {27425#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:03:28,469 INFO L273 TraceCheckUtils]: 122: Hoare triple {27425#(<= 100000 ~SIZE~0)} ~set.base, ~set.offset := #in~set.base, #in~set.offset;~size := #in~size;~value := #in~value;havoc ~i~0;~i~0 := 0; {27425#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:03:28,470 INFO L273 TraceCheckUtils]: 123: Hoare triple {27425#(<= 100000 ~SIZE~0)} assume true; {27425#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:03:28,470 INFO L273 TraceCheckUtils]: 124: Hoare triple {27425#(<= 100000 ~SIZE~0)} assume !!(~i~0 < ~size);call #t~mem1 := read~int(~set.base, ~set.offset + 4 * ~i~0, 4); {27425#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:03:28,471 INFO L273 TraceCheckUtils]: 125: Hoare triple {27425#(<= 100000 ~SIZE~0)} assume #t~mem1 == ~value;havoc #t~mem1;#res := 1; {27425#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:03:28,471 INFO L273 TraceCheckUtils]: 126: Hoare triple {27425#(<= 100000 ~SIZE~0)} assume true; {27425#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:03:28,473 INFO L268 TraceCheckUtils]: 127: Hoare quadruple {27425#(<= 100000 ~SIZE~0)} {27810#(and (<= main_~v~0 9) (<= 100000 ~SIZE~0))} #132#return; {27810#(and (<= main_~v~0 9) (<= 100000 ~SIZE~0))} is VALID [2018-11-18 23:03:28,473 INFO L273 TraceCheckUtils]: 128: Hoare triple {27810#(and (<= main_~v~0 9) (<= 100000 ~SIZE~0))} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {27810#(and (<= main_~v~0 9) (<= 100000 ~SIZE~0))} is VALID [2018-11-18 23:03:28,474 INFO L273 TraceCheckUtils]: 129: Hoare triple {27810#(and (<= main_~v~0 9) (<= 100000 ~SIZE~0))} assume !(1 != #t~ret4);havoc #t~mem3;havoc #t~ret4; {27810#(and (<= main_~v~0 9) (<= 100000 ~SIZE~0))} is VALID [2018-11-18 23:03:28,475 INFO L273 TraceCheckUtils]: 130: Hoare triple {27810#(and (<= main_~v~0 9) (<= 100000 ~SIZE~0))} #t~post2 := ~v~0;~v~0 := 1 + #t~post2;havoc #t~post2; {27847#(and (<= main_~v~0 10) (<= 100000 ~SIZE~0))} is VALID [2018-11-18 23:03:28,475 INFO L273 TraceCheckUtils]: 131: Hoare triple {27847#(and (<= main_~v~0 10) (<= 100000 ~SIZE~0))} assume true; {27847#(and (<= main_~v~0 10) (<= 100000 ~SIZE~0))} is VALID [2018-11-18 23:03:28,476 INFO L273 TraceCheckUtils]: 132: Hoare triple {27847#(and (<= main_~v~0 10) (<= 100000 ~SIZE~0))} assume !!(~v~0 < ~SIZE~0);call #t~mem3 := read~int(~#values~0.base, ~#values~0.offset + 4 * ~v~0, 4); {27847#(and (<= main_~v~0 10) (<= 100000 ~SIZE~0))} is VALID [2018-11-18 23:03:28,477 INFO L256 TraceCheckUtils]: 133: Hoare triple {27847#(and (<= main_~v~0 10) (<= 100000 ~SIZE~0))} call #t~ret4 := elem_exists(~#set~0.base, ~#set~0.offset, ~n~0, #t~mem3); {27425#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:03:28,478 INFO L273 TraceCheckUtils]: 134: Hoare triple {27425#(<= 100000 ~SIZE~0)} ~set.base, ~set.offset := #in~set.base, #in~set.offset;~size := #in~size;~value := #in~value;havoc ~i~0;~i~0 := 0; {27425#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:03:28,478 INFO L273 TraceCheckUtils]: 135: Hoare triple {27425#(<= 100000 ~SIZE~0)} assume true; {27425#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:03:28,479 INFO L273 TraceCheckUtils]: 136: Hoare triple {27425#(<= 100000 ~SIZE~0)} assume !!(~i~0 < ~size);call #t~mem1 := read~int(~set.base, ~set.offset + 4 * ~i~0, 4); {27425#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:03:28,479 INFO L273 TraceCheckUtils]: 137: Hoare triple {27425#(<= 100000 ~SIZE~0)} assume #t~mem1 == ~value;havoc #t~mem1;#res := 1; {27425#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:03:28,480 INFO L273 TraceCheckUtils]: 138: Hoare triple {27425#(<= 100000 ~SIZE~0)} assume true; {27425#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:03:28,481 INFO L268 TraceCheckUtils]: 139: Hoare quadruple {27425#(<= 100000 ~SIZE~0)} {27847#(and (<= main_~v~0 10) (<= 100000 ~SIZE~0))} #132#return; {27847#(and (<= main_~v~0 10) (<= 100000 ~SIZE~0))} is VALID [2018-11-18 23:03:28,482 INFO L273 TraceCheckUtils]: 140: Hoare triple {27847#(and (<= main_~v~0 10) (<= 100000 ~SIZE~0))} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {27847#(and (<= main_~v~0 10) (<= 100000 ~SIZE~0))} is VALID [2018-11-18 23:03:28,482 INFO L273 TraceCheckUtils]: 141: Hoare triple {27847#(and (<= main_~v~0 10) (<= 100000 ~SIZE~0))} assume !(1 != #t~ret4);havoc #t~mem3;havoc #t~ret4; {27847#(and (<= main_~v~0 10) (<= 100000 ~SIZE~0))} is VALID [2018-11-18 23:03:28,483 INFO L273 TraceCheckUtils]: 142: Hoare triple {27847#(and (<= main_~v~0 10) (<= 100000 ~SIZE~0))} #t~post2 := ~v~0;~v~0 := 1 + #t~post2;havoc #t~post2; {27884#(and (<= main_~v~0 11) (<= 100000 ~SIZE~0))} is VALID [2018-11-18 23:03:28,484 INFO L273 TraceCheckUtils]: 143: Hoare triple {27884#(and (<= main_~v~0 11) (<= 100000 ~SIZE~0))} assume true; {27884#(and (<= main_~v~0 11) (<= 100000 ~SIZE~0))} is VALID [2018-11-18 23:03:28,485 INFO L273 TraceCheckUtils]: 144: Hoare triple {27884#(and (<= main_~v~0 11) (<= 100000 ~SIZE~0))} assume !!(~v~0 < ~SIZE~0);call #t~mem3 := read~int(~#values~0.base, ~#values~0.offset + 4 * ~v~0, 4); {27884#(and (<= main_~v~0 11) (<= 100000 ~SIZE~0))} is VALID [2018-11-18 23:03:28,486 INFO L256 TraceCheckUtils]: 145: Hoare triple {27884#(and (<= main_~v~0 11) (<= 100000 ~SIZE~0))} call #t~ret4 := elem_exists(~#set~0.base, ~#set~0.offset, ~n~0, #t~mem3); {27425#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:03:28,486 INFO L273 TraceCheckUtils]: 146: Hoare triple {27425#(<= 100000 ~SIZE~0)} ~set.base, ~set.offset := #in~set.base, #in~set.offset;~size := #in~size;~value := #in~value;havoc ~i~0;~i~0 := 0; {27425#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:03:28,487 INFO L273 TraceCheckUtils]: 147: Hoare triple {27425#(<= 100000 ~SIZE~0)} assume true; {27425#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:03:28,487 INFO L273 TraceCheckUtils]: 148: Hoare triple {27425#(<= 100000 ~SIZE~0)} assume !!(~i~0 < ~size);call #t~mem1 := read~int(~set.base, ~set.offset + 4 * ~i~0, 4); {27425#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:03:28,488 INFO L273 TraceCheckUtils]: 149: Hoare triple {27425#(<= 100000 ~SIZE~0)} assume #t~mem1 == ~value;havoc #t~mem1;#res := 1; {27425#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:03:28,488 INFO L273 TraceCheckUtils]: 150: Hoare triple {27425#(<= 100000 ~SIZE~0)} assume true; {27425#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:03:28,490 INFO L268 TraceCheckUtils]: 151: Hoare quadruple {27425#(<= 100000 ~SIZE~0)} {27884#(and (<= main_~v~0 11) (<= 100000 ~SIZE~0))} #132#return; {27884#(and (<= main_~v~0 11) (<= 100000 ~SIZE~0))} is VALID [2018-11-18 23:03:28,490 INFO L273 TraceCheckUtils]: 152: Hoare triple {27884#(and (<= main_~v~0 11) (<= 100000 ~SIZE~0))} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {27884#(and (<= main_~v~0 11) (<= 100000 ~SIZE~0))} is VALID [2018-11-18 23:03:28,491 INFO L273 TraceCheckUtils]: 153: Hoare triple {27884#(and (<= main_~v~0 11) (<= 100000 ~SIZE~0))} assume !(1 != #t~ret4);havoc #t~mem3;havoc #t~ret4; {27884#(and (<= main_~v~0 11) (<= 100000 ~SIZE~0))} is VALID [2018-11-18 23:03:28,492 INFO L273 TraceCheckUtils]: 154: Hoare triple {27884#(and (<= main_~v~0 11) (<= 100000 ~SIZE~0))} #t~post2 := ~v~0;~v~0 := 1 + #t~post2;havoc #t~post2; {27921#(and (<= main_~v~0 12) (<= 100000 ~SIZE~0))} is VALID [2018-11-18 23:03:28,492 INFO L273 TraceCheckUtils]: 155: Hoare triple {27921#(and (<= main_~v~0 12) (<= 100000 ~SIZE~0))} assume true; {27921#(and (<= main_~v~0 12) (<= 100000 ~SIZE~0))} is VALID [2018-11-18 23:03:28,493 INFO L273 TraceCheckUtils]: 156: Hoare triple {27921#(and (<= main_~v~0 12) (<= 100000 ~SIZE~0))} assume !!(~v~0 < ~SIZE~0);call #t~mem3 := read~int(~#values~0.base, ~#values~0.offset + 4 * ~v~0, 4); {27921#(and (<= main_~v~0 12) (<= 100000 ~SIZE~0))} is VALID [2018-11-18 23:03:28,494 INFO L256 TraceCheckUtils]: 157: Hoare triple {27921#(and (<= main_~v~0 12) (<= 100000 ~SIZE~0))} call #t~ret4 := elem_exists(~#set~0.base, ~#set~0.offset, ~n~0, #t~mem3); {27425#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:03:28,495 INFO L273 TraceCheckUtils]: 158: Hoare triple {27425#(<= 100000 ~SIZE~0)} ~set.base, ~set.offset := #in~set.base, #in~set.offset;~size := #in~size;~value := #in~value;havoc ~i~0;~i~0 := 0; {27425#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:03:28,495 INFO L273 TraceCheckUtils]: 159: Hoare triple {27425#(<= 100000 ~SIZE~0)} assume true; {27425#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:03:28,496 INFO L273 TraceCheckUtils]: 160: Hoare triple {27425#(<= 100000 ~SIZE~0)} assume !!(~i~0 < ~size);call #t~mem1 := read~int(~set.base, ~set.offset + 4 * ~i~0, 4); {27425#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:03:28,496 INFO L273 TraceCheckUtils]: 161: Hoare triple {27425#(<= 100000 ~SIZE~0)} assume #t~mem1 == ~value;havoc #t~mem1;#res := 1; {27425#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:03:28,497 INFO L273 TraceCheckUtils]: 162: Hoare triple {27425#(<= 100000 ~SIZE~0)} assume true; {27425#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:03:28,498 INFO L268 TraceCheckUtils]: 163: Hoare quadruple {27425#(<= 100000 ~SIZE~0)} {27921#(and (<= main_~v~0 12) (<= 100000 ~SIZE~0))} #132#return; {27921#(and (<= main_~v~0 12) (<= 100000 ~SIZE~0))} is VALID [2018-11-18 23:03:28,499 INFO L273 TraceCheckUtils]: 164: Hoare triple {27921#(and (<= main_~v~0 12) (<= 100000 ~SIZE~0))} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {27921#(and (<= main_~v~0 12) (<= 100000 ~SIZE~0))} is VALID [2018-11-18 23:03:28,499 INFO L273 TraceCheckUtils]: 165: Hoare triple {27921#(and (<= main_~v~0 12) (<= 100000 ~SIZE~0))} assume !(1 != #t~ret4);havoc #t~mem3;havoc #t~ret4; {27921#(and (<= main_~v~0 12) (<= 100000 ~SIZE~0))} is VALID [2018-11-18 23:03:28,500 INFO L273 TraceCheckUtils]: 166: Hoare triple {27921#(and (<= main_~v~0 12) (<= 100000 ~SIZE~0))} #t~post2 := ~v~0;~v~0 := 1 + #t~post2;havoc #t~post2; {27958#(and (<= main_~v~0 13) (<= 100000 ~SIZE~0))} is VALID [2018-11-18 23:03:28,501 INFO L273 TraceCheckUtils]: 167: Hoare triple {27958#(and (<= main_~v~0 13) (<= 100000 ~SIZE~0))} assume true; {27958#(and (<= main_~v~0 13) (<= 100000 ~SIZE~0))} is VALID [2018-11-18 23:03:28,502 INFO L273 TraceCheckUtils]: 168: Hoare triple {27958#(and (<= main_~v~0 13) (<= 100000 ~SIZE~0))} assume !!(~v~0 < ~SIZE~0);call #t~mem3 := read~int(~#values~0.base, ~#values~0.offset + 4 * ~v~0, 4); {27958#(and (<= main_~v~0 13) (<= 100000 ~SIZE~0))} is VALID [2018-11-18 23:03:28,503 INFO L256 TraceCheckUtils]: 169: Hoare triple {27958#(and (<= main_~v~0 13) (<= 100000 ~SIZE~0))} call #t~ret4 := elem_exists(~#set~0.base, ~#set~0.offset, ~n~0, #t~mem3); {27425#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:03:28,503 INFO L273 TraceCheckUtils]: 170: Hoare triple {27425#(<= 100000 ~SIZE~0)} ~set.base, ~set.offset := #in~set.base, #in~set.offset;~size := #in~size;~value := #in~value;havoc ~i~0;~i~0 := 0; {27425#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:03:28,504 INFO L273 TraceCheckUtils]: 171: Hoare triple {27425#(<= 100000 ~SIZE~0)} assume true; {27425#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:03:28,504 INFO L273 TraceCheckUtils]: 172: Hoare triple {27425#(<= 100000 ~SIZE~0)} assume !!(~i~0 < ~size);call #t~mem1 := read~int(~set.base, ~set.offset + 4 * ~i~0, 4); {27425#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:03:28,505 INFO L273 TraceCheckUtils]: 173: Hoare triple {27425#(<= 100000 ~SIZE~0)} assume #t~mem1 == ~value;havoc #t~mem1;#res := 1; {27425#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:03:28,505 INFO L273 TraceCheckUtils]: 174: Hoare triple {27425#(<= 100000 ~SIZE~0)} assume true; {27425#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:03:28,506 INFO L268 TraceCheckUtils]: 175: Hoare quadruple {27425#(<= 100000 ~SIZE~0)} {27958#(and (<= main_~v~0 13) (<= 100000 ~SIZE~0))} #132#return; {27958#(and (<= main_~v~0 13) (<= 100000 ~SIZE~0))} is VALID [2018-11-18 23:03:28,507 INFO L273 TraceCheckUtils]: 176: Hoare triple {27958#(and (<= main_~v~0 13) (<= 100000 ~SIZE~0))} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {27958#(and (<= main_~v~0 13) (<= 100000 ~SIZE~0))} is VALID [2018-11-18 23:03:28,508 INFO L273 TraceCheckUtils]: 177: Hoare triple {27958#(and (<= main_~v~0 13) (<= 100000 ~SIZE~0))} assume !(1 != #t~ret4);havoc #t~mem3;havoc #t~ret4; {27958#(and (<= main_~v~0 13) (<= 100000 ~SIZE~0))} is VALID [2018-11-18 23:03:28,509 INFO L273 TraceCheckUtils]: 178: Hoare triple {27958#(and (<= main_~v~0 13) (<= 100000 ~SIZE~0))} #t~post2 := ~v~0;~v~0 := 1 + #t~post2;havoc #t~post2; {27995#(and (<= main_~v~0 14) (<= 100000 ~SIZE~0))} is VALID [2018-11-18 23:03:28,509 INFO L273 TraceCheckUtils]: 179: Hoare triple {27995#(and (<= main_~v~0 14) (<= 100000 ~SIZE~0))} assume true; {27995#(and (<= main_~v~0 14) (<= 100000 ~SIZE~0))} is VALID [2018-11-18 23:03:28,510 INFO L273 TraceCheckUtils]: 180: Hoare triple {27995#(and (<= main_~v~0 14) (<= 100000 ~SIZE~0))} assume !!(~v~0 < ~SIZE~0);call #t~mem3 := read~int(~#values~0.base, ~#values~0.offset + 4 * ~v~0, 4); {27995#(and (<= main_~v~0 14) (<= 100000 ~SIZE~0))} is VALID [2018-11-18 23:03:28,511 INFO L256 TraceCheckUtils]: 181: Hoare triple {27995#(and (<= main_~v~0 14) (<= 100000 ~SIZE~0))} call #t~ret4 := elem_exists(~#set~0.base, ~#set~0.offset, ~n~0, #t~mem3); {27425#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:03:28,512 INFO L273 TraceCheckUtils]: 182: Hoare triple {27425#(<= 100000 ~SIZE~0)} ~set.base, ~set.offset := #in~set.base, #in~set.offset;~size := #in~size;~value := #in~value;havoc ~i~0;~i~0 := 0; {27425#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:03:28,512 INFO L273 TraceCheckUtils]: 183: Hoare triple {27425#(<= 100000 ~SIZE~0)} assume true; {27425#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:03:28,513 INFO L273 TraceCheckUtils]: 184: Hoare triple {27425#(<= 100000 ~SIZE~0)} assume !!(~i~0 < ~size);call #t~mem1 := read~int(~set.base, ~set.offset + 4 * ~i~0, 4); {27425#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:03:28,513 INFO L273 TraceCheckUtils]: 185: Hoare triple {27425#(<= 100000 ~SIZE~0)} assume #t~mem1 == ~value;havoc #t~mem1;#res := 1; {27425#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:03:28,514 INFO L273 TraceCheckUtils]: 186: Hoare triple {27425#(<= 100000 ~SIZE~0)} assume true; {27425#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:03:28,515 INFO L268 TraceCheckUtils]: 187: Hoare quadruple {27425#(<= 100000 ~SIZE~0)} {27995#(and (<= main_~v~0 14) (<= 100000 ~SIZE~0))} #132#return; {27995#(and (<= main_~v~0 14) (<= 100000 ~SIZE~0))} is VALID [2018-11-18 23:03:28,515 INFO L273 TraceCheckUtils]: 188: Hoare triple {27995#(and (<= main_~v~0 14) (<= 100000 ~SIZE~0))} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {27995#(and (<= main_~v~0 14) (<= 100000 ~SIZE~0))} is VALID [2018-11-18 23:03:28,516 INFO L273 TraceCheckUtils]: 189: Hoare triple {27995#(and (<= main_~v~0 14) (<= 100000 ~SIZE~0))} assume !(1 != #t~ret4);havoc #t~mem3;havoc #t~ret4; {27995#(and (<= main_~v~0 14) (<= 100000 ~SIZE~0))} is VALID [2018-11-18 23:03:28,517 INFO L273 TraceCheckUtils]: 190: Hoare triple {27995#(and (<= main_~v~0 14) (<= 100000 ~SIZE~0))} #t~post2 := ~v~0;~v~0 := 1 + #t~post2;havoc #t~post2; {28032#(and (<= main_~v~0 15) (<= 100000 ~SIZE~0))} is VALID [2018-11-18 23:03:28,518 INFO L273 TraceCheckUtils]: 191: Hoare triple {28032#(and (<= main_~v~0 15) (<= 100000 ~SIZE~0))} assume true; {28032#(and (<= main_~v~0 15) (<= 100000 ~SIZE~0))} is VALID [2018-11-18 23:03:28,518 INFO L273 TraceCheckUtils]: 192: Hoare triple {28032#(and (<= main_~v~0 15) (<= 100000 ~SIZE~0))} assume !!(~v~0 < ~SIZE~0);call #t~mem3 := read~int(~#values~0.base, ~#values~0.offset + 4 * ~v~0, 4); {28032#(and (<= main_~v~0 15) (<= 100000 ~SIZE~0))} is VALID [2018-11-18 23:03:28,520 INFO L256 TraceCheckUtils]: 193: Hoare triple {28032#(and (<= main_~v~0 15) (<= 100000 ~SIZE~0))} call #t~ret4 := elem_exists(~#set~0.base, ~#set~0.offset, ~n~0, #t~mem3); {27425#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:03:28,520 INFO L273 TraceCheckUtils]: 194: Hoare triple {27425#(<= 100000 ~SIZE~0)} ~set.base, ~set.offset := #in~set.base, #in~set.offset;~size := #in~size;~value := #in~value;havoc ~i~0;~i~0 := 0; {27425#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:03:28,521 INFO L273 TraceCheckUtils]: 195: Hoare triple {27425#(<= 100000 ~SIZE~0)} assume true; {27425#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:03:28,521 INFO L273 TraceCheckUtils]: 196: Hoare triple {27425#(<= 100000 ~SIZE~0)} assume !!(~i~0 < ~size);call #t~mem1 := read~int(~set.base, ~set.offset + 4 * ~i~0, 4); {27425#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:03:28,522 INFO L273 TraceCheckUtils]: 197: Hoare triple {27425#(<= 100000 ~SIZE~0)} assume #t~mem1 == ~value;havoc #t~mem1;#res := 1; {27425#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:03:28,522 INFO L273 TraceCheckUtils]: 198: Hoare triple {27425#(<= 100000 ~SIZE~0)} assume true; {27425#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:03:28,523 INFO L268 TraceCheckUtils]: 199: Hoare quadruple {27425#(<= 100000 ~SIZE~0)} {28032#(and (<= main_~v~0 15) (<= 100000 ~SIZE~0))} #132#return; {28032#(and (<= main_~v~0 15) (<= 100000 ~SIZE~0))} is VALID [2018-11-18 23:03:28,524 INFO L273 TraceCheckUtils]: 200: Hoare triple {28032#(and (<= main_~v~0 15) (<= 100000 ~SIZE~0))} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {28032#(and (<= main_~v~0 15) (<= 100000 ~SIZE~0))} is VALID [2018-11-18 23:03:28,525 INFO L273 TraceCheckUtils]: 201: Hoare triple {28032#(and (<= main_~v~0 15) (<= 100000 ~SIZE~0))} assume !(1 != #t~ret4);havoc #t~mem3;havoc #t~ret4; {28032#(and (<= main_~v~0 15) (<= 100000 ~SIZE~0))} is VALID [2018-11-18 23:03:28,526 INFO L273 TraceCheckUtils]: 202: Hoare triple {28032#(and (<= main_~v~0 15) (<= 100000 ~SIZE~0))} #t~post2 := ~v~0;~v~0 := 1 + #t~post2;havoc #t~post2; {28069#(and (<= main_~v~0 16) (<= 100000 ~SIZE~0))} is VALID [2018-11-18 23:03:28,526 INFO L273 TraceCheckUtils]: 203: Hoare triple {28069#(and (<= main_~v~0 16) (<= 100000 ~SIZE~0))} assume true; {28069#(and (<= main_~v~0 16) (<= 100000 ~SIZE~0))} is VALID [2018-11-18 23:03:28,527 INFO L273 TraceCheckUtils]: 204: Hoare triple {28069#(and (<= main_~v~0 16) (<= 100000 ~SIZE~0))} assume !!(~v~0 < ~SIZE~0);call #t~mem3 := read~int(~#values~0.base, ~#values~0.offset + 4 * ~v~0, 4); {28069#(and (<= main_~v~0 16) (<= 100000 ~SIZE~0))} is VALID [2018-11-18 23:03:28,528 INFO L256 TraceCheckUtils]: 205: Hoare triple {28069#(and (<= main_~v~0 16) (<= 100000 ~SIZE~0))} call #t~ret4 := elem_exists(~#set~0.base, ~#set~0.offset, ~n~0, #t~mem3); {27425#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:03:28,529 INFO L273 TraceCheckUtils]: 206: Hoare triple {27425#(<= 100000 ~SIZE~0)} ~set.base, ~set.offset := #in~set.base, #in~set.offset;~size := #in~size;~value := #in~value;havoc ~i~0;~i~0 := 0; {27425#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:03:28,529 INFO L273 TraceCheckUtils]: 207: Hoare triple {27425#(<= 100000 ~SIZE~0)} assume true; {27425#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:03:28,530 INFO L273 TraceCheckUtils]: 208: Hoare triple {27425#(<= 100000 ~SIZE~0)} assume !!(~i~0 < ~size);call #t~mem1 := read~int(~set.base, ~set.offset + 4 * ~i~0, 4); {27425#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:03:28,530 INFO L273 TraceCheckUtils]: 209: Hoare triple {27425#(<= 100000 ~SIZE~0)} assume #t~mem1 == ~value;havoc #t~mem1;#res := 1; {27425#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:03:28,531 INFO L273 TraceCheckUtils]: 210: Hoare triple {27425#(<= 100000 ~SIZE~0)} assume true; {27425#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:03:28,532 INFO L268 TraceCheckUtils]: 211: Hoare quadruple {27425#(<= 100000 ~SIZE~0)} {28069#(and (<= main_~v~0 16) (<= 100000 ~SIZE~0))} #132#return; {28069#(and (<= main_~v~0 16) (<= 100000 ~SIZE~0))} is VALID [2018-11-18 23:03:28,533 INFO L273 TraceCheckUtils]: 212: Hoare triple {28069#(and (<= main_~v~0 16) (<= 100000 ~SIZE~0))} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {28069#(and (<= main_~v~0 16) (<= 100000 ~SIZE~0))} is VALID [2018-11-18 23:03:28,533 INFO L273 TraceCheckUtils]: 213: Hoare triple {28069#(and (<= main_~v~0 16) (<= 100000 ~SIZE~0))} assume !(1 != #t~ret4);havoc #t~mem3;havoc #t~ret4; {28069#(and (<= main_~v~0 16) (<= 100000 ~SIZE~0))} is VALID [2018-11-18 23:03:28,534 INFO L273 TraceCheckUtils]: 214: Hoare triple {28069#(and (<= main_~v~0 16) (<= 100000 ~SIZE~0))} #t~post2 := ~v~0;~v~0 := 1 + #t~post2;havoc #t~post2; {28106#(and (<= main_~v~0 17) (<= 100000 ~SIZE~0))} is VALID [2018-11-18 23:03:28,535 INFO L273 TraceCheckUtils]: 215: Hoare triple {28106#(and (<= main_~v~0 17) (<= 100000 ~SIZE~0))} assume true; {28106#(and (<= main_~v~0 17) (<= 100000 ~SIZE~0))} is VALID [2018-11-18 23:03:28,536 INFO L273 TraceCheckUtils]: 216: Hoare triple {28106#(and (<= main_~v~0 17) (<= 100000 ~SIZE~0))} assume !(~v~0 < ~SIZE~0); {27424#false} is VALID [2018-11-18 23:03:28,536 INFO L273 TraceCheckUtils]: 217: Hoare triple {27424#false} ~i~1 := 0; {27424#false} is VALID [2018-11-18 23:03:28,536 INFO L273 TraceCheckUtils]: 218: Hoare triple {27424#false} assume true; {27424#false} is VALID [2018-11-18 23:03:28,536 INFO L273 TraceCheckUtils]: 219: Hoare triple {27424#false} assume !!(~i~1 < ~SIZE~0 && 1 != ~found~0);call #t~mem8 := read~int(~#set~0.base, ~#set~0.offset + 4 * ~i~1, 4); {27424#false} is VALID [2018-11-18 23:03:28,536 INFO L273 TraceCheckUtils]: 220: Hoare triple {27424#false} assume !(#t~mem8 == ~element~0);havoc #t~mem8; {27424#false} is VALID [2018-11-18 23:03:28,537 INFO L273 TraceCheckUtils]: 221: Hoare triple {27424#false} #t~post7 := ~i~1;~i~1 := 1 + #t~post7;havoc #t~post7; {27424#false} is VALID [2018-11-18 23:03:28,537 INFO L273 TraceCheckUtils]: 222: Hoare triple {27424#false} assume true; {27424#false} is VALID [2018-11-18 23:03:28,537 INFO L273 TraceCheckUtils]: 223: Hoare triple {27424#false} assume !!(~i~1 < ~SIZE~0 && 1 != ~found~0);call #t~mem8 := read~int(~#set~0.base, ~#set~0.offset + 4 * ~i~1, 4); {27424#false} is VALID [2018-11-18 23:03:28,537 INFO L273 TraceCheckUtils]: 224: Hoare triple {27424#false} assume !(#t~mem8 == ~element~0);havoc #t~mem8; {27424#false} is VALID [2018-11-18 23:03:28,537 INFO L273 TraceCheckUtils]: 225: Hoare triple {27424#false} #t~post7 := ~i~1;~i~1 := 1 + #t~post7;havoc #t~post7; {27424#false} is VALID [2018-11-18 23:03:28,537 INFO L273 TraceCheckUtils]: 226: Hoare triple {27424#false} assume true; {27424#false} is VALID [2018-11-18 23:03:28,538 INFO L273 TraceCheckUtils]: 227: Hoare triple {27424#false} assume !!(~i~1 < ~SIZE~0 && 1 != ~found~0);call #t~mem8 := read~int(~#set~0.base, ~#set~0.offset + 4 * ~i~1, 4); {27424#false} is VALID [2018-11-18 23:03:28,538 INFO L273 TraceCheckUtils]: 228: Hoare triple {27424#false} assume #t~mem8 == ~element~0;havoc #t~mem8;~found~0 := 1;~pos~0 := ~i~1; {27424#false} is VALID [2018-11-18 23:03:28,538 INFO L273 TraceCheckUtils]: 229: Hoare triple {27424#false} #t~post7 := ~i~1;~i~1 := 1 + #t~post7;havoc #t~post7; {27424#false} is VALID [2018-11-18 23:03:28,538 INFO L273 TraceCheckUtils]: 230: Hoare triple {27424#false} assume true; {27424#false} is VALID [2018-11-18 23:03:28,538 INFO L273 TraceCheckUtils]: 231: Hoare triple {27424#false} assume !(~i~1 < ~SIZE~0 && 1 != ~found~0); {27424#false} is VALID [2018-11-18 23:03:28,539 INFO L273 TraceCheckUtils]: 232: Hoare triple {27424#false} assume 1 == ~found~0;~i~1 := ~pos~0; {27424#false} is VALID [2018-11-18 23:03:28,539 INFO L273 TraceCheckUtils]: 233: Hoare triple {27424#false} assume true; {27424#false} is VALID [2018-11-18 23:03:28,539 INFO L273 TraceCheckUtils]: 234: Hoare triple {27424#false} assume !!(~i~1 < ~SIZE~0 - 1);call #t~mem10 := read~int(~#set~0.base, ~#set~0.offset + 4 * (1 + ~i~1), 4);call write~int(#t~mem10, ~#set~0.base, ~#set~0.offset + 4 * ~i~1, 4);havoc #t~mem10; {27424#false} is VALID [2018-11-18 23:03:28,539 INFO L273 TraceCheckUtils]: 235: Hoare triple {27424#false} #t~post9 := ~i~1;~i~1 := 1 + #t~post9;havoc #t~post9; {27424#false} is VALID [2018-11-18 23:03:28,539 INFO L273 TraceCheckUtils]: 236: Hoare triple {27424#false} assume true; {27424#false} is VALID [2018-11-18 23:03:28,539 INFO L273 TraceCheckUtils]: 237: Hoare triple {27424#false} assume !!(~i~1 < ~SIZE~0 - 1);call #t~mem10 := read~int(~#set~0.base, ~#set~0.offset + 4 * (1 + ~i~1), 4);call write~int(#t~mem10, ~#set~0.base, ~#set~0.offset + 4 * ~i~1, 4);havoc #t~mem10; {27424#false} is VALID [2018-11-18 23:03:28,540 INFO L273 TraceCheckUtils]: 238: Hoare triple {27424#false} #t~post9 := ~i~1;~i~1 := 1 + #t~post9;havoc #t~post9; {27424#false} is VALID [2018-11-18 23:03:28,540 INFO L273 TraceCheckUtils]: 239: Hoare triple {27424#false} assume true; {27424#false} is VALID [2018-11-18 23:03:28,540 INFO L273 TraceCheckUtils]: 240: Hoare triple {27424#false} assume !(~i~1 < ~SIZE~0 - 1); {27424#false} is VALID [2018-11-18 23:03:28,540 INFO L273 TraceCheckUtils]: 241: Hoare triple {27424#false} assume 1 == ~found~0;~i~1 := 0; {27424#false} is VALID [2018-11-18 23:03:28,540 INFO L273 TraceCheckUtils]: 242: Hoare triple {27424#false} assume true; {27424#false} is VALID [2018-11-18 23:03:28,540 INFO L273 TraceCheckUtils]: 243: Hoare triple {27424#false} assume !!(~i~1 < ~SIZE~0 - 1);call #t~mem12 := read~int(~#set~0.base, ~#set~0.offset + 4 * ~i~1, 4); {27424#false} is VALID [2018-11-18 23:03:28,540 INFO L256 TraceCheckUtils]: 244: Hoare triple {27424#false} call __VERIFIER_assert((if #t~mem12 != ~element~0 then 1 else 0)); {27424#false} is VALID [2018-11-18 23:03:28,540 INFO L273 TraceCheckUtils]: 245: Hoare triple {27424#false} ~cond := #in~cond; {27424#false} is VALID [2018-11-18 23:03:28,540 INFO L273 TraceCheckUtils]: 246: Hoare triple {27424#false} assume 0 == ~cond; {27424#false} is VALID [2018-11-18 23:03:28,541 INFO L273 TraceCheckUtils]: 247: Hoare triple {27424#false} assume !false; {27424#false} is VALID [2018-11-18 23:03:28,592 INFO L134 CoverageAnalysis]: Checked inductivity of 1675 backedges. 0 proven. 850 refuted. 0 times theorem prover too weak. 825 trivial. 0 not checked. [2018-11-18 23:03:28,612 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-18 23:03:28,612 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21] total 39 [2018-11-18 23:03:28,613 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 248 [2018-11-18 23:03:28,613 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-18 23:03:28,613 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 39 states. [2018-11-18 23:03:28,956 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 292 edges. 292 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 23:03:28,957 INFO L459 AbstractCegarLoop]: Interpolant automaton has 39 states [2018-11-18 23:03:28,957 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2018-11-18 23:03:28,958 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=588, Invalid=894, Unknown=0, NotChecked=0, Total=1482 [2018-11-18 23:03:28,958 INFO L87 Difference]: Start difference. First operand 265 states and 353 transitions. Second operand 39 states. [2018-11-18 23:03:33,946 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 23:03:33,947 INFO L93 Difference]: Finished difference Result 354 states and 459 transitions. [2018-11-18 23:03:33,947 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-11-18 23:03:33,947 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 248 [2018-11-18 23:03:33,947 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 23:03:33,947 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2018-11-18 23:03:33,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 275 transitions. [2018-11-18 23:03:33,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2018-11-18 23:03:33,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 275 transitions. [2018-11-18 23:03:33,953 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 21 states and 275 transitions. [2018-11-18 23:03:34,314 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 275 edges. 275 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 23:03:34,322 INFO L225 Difference]: With dead ends: 354 [2018-11-18 23:03:34,322 INFO L226 Difference]: Without dead ends: 283 [2018-11-18 23:03:34,323 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 268 GetRequests, 231 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 609 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=588, Invalid=894, Unknown=0, NotChecked=0, Total=1482 [2018-11-18 23:03:34,323 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 283 states. [2018-11-18 23:03:35,076 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 283 to 275. [2018-11-18 23:03:35,076 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-18 23:03:35,076 INFO L82 GeneralOperation]: Start isEquivalent. First operand 283 states. Second operand 275 states. [2018-11-18 23:03:35,076 INFO L74 IsIncluded]: Start isIncluded. First operand 283 states. Second operand 275 states. [2018-11-18 23:03:35,076 INFO L87 Difference]: Start difference. First operand 283 states. Second operand 275 states. [2018-11-18 23:03:35,087 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 23:03:35,087 INFO L93 Difference]: Finished difference Result 283 states and 381 transitions. [2018-11-18 23:03:35,087 INFO L276 IsEmpty]: Start isEmpty. Operand 283 states and 381 transitions. [2018-11-18 23:03:35,088 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 23:03:35,088 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 23:03:35,088 INFO L74 IsIncluded]: Start isIncluded. First operand 275 states. Second operand 283 states. [2018-11-18 23:03:35,088 INFO L87 Difference]: Start difference. First operand 275 states. Second operand 283 states. [2018-11-18 23:03:35,097 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 23:03:35,097 INFO L93 Difference]: Finished difference Result 283 states and 381 transitions. [2018-11-18 23:03:35,097 INFO L276 IsEmpty]: Start isEmpty. Operand 283 states and 381 transitions. [2018-11-18 23:03:35,098 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 23:03:35,099 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 23:03:35,099 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-18 23:03:35,099 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-18 23:03:35,099 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 275 states. [2018-11-18 23:03:35,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 275 states to 275 states and 368 transitions. [2018-11-18 23:03:35,109 INFO L78 Accepts]: Start accepts. Automaton has 275 states and 368 transitions. Word has length 248 [2018-11-18 23:03:35,110 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 23:03:35,110 INFO L480 AbstractCegarLoop]: Abstraction has 275 states and 368 transitions. [2018-11-18 23:03:35,110 INFO L481 AbstractCegarLoop]: Interpolant automaton has 39 states. [2018-11-18 23:03:35,110 INFO L276 IsEmpty]: Start isEmpty. Operand 275 states and 368 transitions. [2018-11-18 23:03:35,112 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 261 [2018-11-18 23:03:35,113 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 23:03:35,113 INFO L375 BasicCegarLoop]: trace histogram [19, 18, 18, 18, 18, 18, 18, 18, 18, 17, 17, 17, 4, 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 23:03:35,113 INFO L423 AbstractCegarLoop]: === Iteration 25 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 23:03:35,113 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 23:03:35,114 INFO L82 PathProgramCache]: Analyzing trace with hash -765965197, now seen corresponding path program 9 times [2018-11-18 23:03:35,114 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 23:03:35,114 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 23:03:35,114 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 23:03:35,115 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 23:03:35,115 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 23:03:35,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 23:03:36,096 INFO L256 TraceCheckUtils]: 0: Hoare triple {29591#true} call ULTIMATE.init(); {29591#true} is VALID [2018-11-18 23:03:36,097 INFO L273 TraceCheckUtils]: 1: Hoare triple {29591#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~SIZE~0 := 100000; {29593#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:03:36,097 INFO L273 TraceCheckUtils]: 2: Hoare triple {29593#(<= 100000 ~SIZE~0)} assume true; {29593#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:03:36,098 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {29593#(<= 100000 ~SIZE~0)} {29591#true} #128#return; {29593#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:03:36,098 INFO L256 TraceCheckUtils]: 4: Hoare triple {29593#(<= 100000 ~SIZE~0)} call #t~ret13 := main(); {29593#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:03:36,099 INFO L273 TraceCheckUtils]: 5: Hoare triple {29593#(<= 100000 ~SIZE~0)} havoc ~i~1;havoc ~pos~0;~n~0 := 0;~found~0 := 0;call ~#set~0.base, ~#set~0.offset := #Ultimate.alloc(4 * ~SIZE~0);call ~#values~0.base, ~#values~0.offset := #Ultimate.alloc(4 * ~SIZE~0);havoc ~element~0;havoc ~v~0;~v~0 := 0; {29594#(and (= main_~v~0 0) (<= 100000 ~SIZE~0))} is VALID [2018-11-18 23:03:36,100 INFO L273 TraceCheckUtils]: 6: Hoare triple {29594#(and (= main_~v~0 0) (<= 100000 ~SIZE~0))} assume true; {29594#(and (= main_~v~0 0) (<= 100000 ~SIZE~0))} is VALID [2018-11-18 23:03:36,101 INFO L273 TraceCheckUtils]: 7: Hoare triple {29594#(and (= main_~v~0 0) (<= 100000 ~SIZE~0))} assume !!(~v~0 < ~SIZE~0);call #t~mem3 := read~int(~#values~0.base, ~#values~0.offset + 4 * ~v~0, 4); {29594#(and (= main_~v~0 0) (<= 100000 ~SIZE~0))} is VALID [2018-11-18 23:03:36,101 INFO L256 TraceCheckUtils]: 8: Hoare triple {29594#(and (= main_~v~0 0) (<= 100000 ~SIZE~0))} call #t~ret4 := elem_exists(~#set~0.base, ~#set~0.offset, ~n~0, #t~mem3); {29591#true} is VALID [2018-11-18 23:03:36,101 INFO L273 TraceCheckUtils]: 9: Hoare triple {29591#true} ~set.base, ~set.offset := #in~set.base, #in~set.offset;~size := #in~size;~value := #in~value;havoc ~i~0;~i~0 := 0; {29591#true} is VALID [2018-11-18 23:03:36,101 INFO L273 TraceCheckUtils]: 10: Hoare triple {29591#true} assume true; {29591#true} is VALID [2018-11-18 23:03:36,102 INFO L273 TraceCheckUtils]: 11: Hoare triple {29591#true} assume !(~i~0 < ~size); {29591#true} is VALID [2018-11-18 23:03:36,102 INFO L273 TraceCheckUtils]: 12: Hoare triple {29591#true} #res := 0; {29591#true} is VALID [2018-11-18 23:03:36,102 INFO L273 TraceCheckUtils]: 13: Hoare triple {29591#true} assume true; {29591#true} is VALID [2018-11-18 23:03:36,103 INFO L268 TraceCheckUtils]: 14: Hoare quadruple {29591#true} {29594#(and (= main_~v~0 0) (<= 100000 ~SIZE~0))} #132#return; {29594#(and (= main_~v~0 0) (<= 100000 ~SIZE~0))} is VALID [2018-11-18 23:03:36,104 INFO L273 TraceCheckUtils]: 15: Hoare triple {29594#(and (= main_~v~0 0) (<= 100000 ~SIZE~0))} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {29594#(and (= main_~v~0 0) (<= 100000 ~SIZE~0))} is VALID [2018-11-18 23:03:36,104 INFO L273 TraceCheckUtils]: 16: Hoare triple {29594#(and (= main_~v~0 0) (<= 100000 ~SIZE~0))} assume 1 != #t~ret4;havoc #t~mem3;havoc #t~ret4;call #t~mem5 := read~int(~#values~0.base, ~#values~0.offset + 4 * ~v~0, 4); {29594#(and (= main_~v~0 0) (<= 100000 ~SIZE~0))} is VALID [2018-11-18 23:03:36,104 INFO L256 TraceCheckUtils]: 17: Hoare triple {29594#(and (= main_~v~0 0) (<= 100000 ~SIZE~0))} call #t~ret6 := insert(~#set~0.base, ~#set~0.offset, ~n~0, #t~mem5); {29591#true} is VALID [2018-11-18 23:03:36,104 INFO L273 TraceCheckUtils]: 18: Hoare triple {29591#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; {29591#true} is VALID [2018-11-18 23:03:36,105 INFO L273 TraceCheckUtils]: 19: Hoare triple {29591#true} assume true; {29591#true} is VALID [2018-11-18 23:03:36,105 INFO L268 TraceCheckUtils]: 20: Hoare quadruple {29591#true} {29594#(and (= main_~v~0 0) (<= 100000 ~SIZE~0))} #134#return; {29594#(and (= main_~v~0 0) (<= 100000 ~SIZE~0))} is VALID [2018-11-18 23:03:36,106 INFO L273 TraceCheckUtils]: 21: Hoare triple {29594#(and (= main_~v~0 0) (<= 100000 ~SIZE~0))} assume -2147483648 <= #t~ret6 && #t~ret6 <= 2147483647;~n~0 := #t~ret6;havoc #t~ret6;havoc #t~mem5; {29594#(and (= main_~v~0 0) (<= 100000 ~SIZE~0))} is VALID [2018-11-18 23:03:36,106 INFO L273 TraceCheckUtils]: 22: Hoare triple {29594#(and (= main_~v~0 0) (<= 100000 ~SIZE~0))} #t~post2 := ~v~0;~v~0 := 1 + #t~post2;havoc #t~post2; {29595#(<= (+ main_~v~0 99999) ~SIZE~0)} is VALID [2018-11-18 23:03:36,106 INFO L273 TraceCheckUtils]: 23: Hoare triple {29595#(<= (+ main_~v~0 99999) ~SIZE~0)} assume true; {29595#(<= (+ main_~v~0 99999) ~SIZE~0)} is VALID [2018-11-18 23:03:36,107 INFO L273 TraceCheckUtils]: 24: Hoare triple {29595#(<= (+ main_~v~0 99999) ~SIZE~0)} assume !!(~v~0 < ~SIZE~0);call #t~mem3 := read~int(~#values~0.base, ~#values~0.offset + 4 * ~v~0, 4); {29595#(<= (+ main_~v~0 99999) ~SIZE~0)} is VALID [2018-11-18 23:03:36,107 INFO L256 TraceCheckUtils]: 25: Hoare triple {29595#(<= (+ main_~v~0 99999) ~SIZE~0)} call #t~ret4 := elem_exists(~#set~0.base, ~#set~0.offset, ~n~0, #t~mem3); {29591#true} is VALID [2018-11-18 23:03:36,107 INFO L273 TraceCheckUtils]: 26: Hoare triple {29591#true} ~set.base, ~set.offset := #in~set.base, #in~set.offset;~size := #in~size;~value := #in~value;havoc ~i~0;~i~0 := 0; {29591#true} is VALID [2018-11-18 23:03:36,107 INFO L273 TraceCheckUtils]: 27: Hoare triple {29591#true} assume true; {29591#true} is VALID [2018-11-18 23:03:36,107 INFO L273 TraceCheckUtils]: 28: Hoare triple {29591#true} assume !!(~i~0 < ~size);call #t~mem1 := read~int(~set.base, ~set.offset + 4 * ~i~0, 4); {29591#true} is VALID [2018-11-18 23:03:36,108 INFO L273 TraceCheckUtils]: 29: Hoare triple {29591#true} assume #t~mem1 == ~value;havoc #t~mem1;#res := 1; {29591#true} is VALID [2018-11-18 23:03:36,108 INFO L273 TraceCheckUtils]: 30: Hoare triple {29591#true} assume true; {29591#true} is VALID [2018-11-18 23:03:36,109 INFO L268 TraceCheckUtils]: 31: Hoare quadruple {29591#true} {29595#(<= (+ main_~v~0 99999) ~SIZE~0)} #132#return; {29595#(<= (+ main_~v~0 99999) ~SIZE~0)} is VALID [2018-11-18 23:03:36,109 INFO L273 TraceCheckUtils]: 32: Hoare triple {29595#(<= (+ main_~v~0 99999) ~SIZE~0)} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {29595#(<= (+ main_~v~0 99999) ~SIZE~0)} is VALID [2018-11-18 23:03:36,109 INFO L273 TraceCheckUtils]: 33: Hoare triple {29595#(<= (+ main_~v~0 99999) ~SIZE~0)} assume !(1 != #t~ret4);havoc #t~mem3;havoc #t~ret4; {29595#(<= (+ main_~v~0 99999) ~SIZE~0)} is VALID [2018-11-18 23:03:36,110 INFO L273 TraceCheckUtils]: 34: Hoare triple {29595#(<= (+ main_~v~0 99999) ~SIZE~0)} #t~post2 := ~v~0;~v~0 := 1 + #t~post2;havoc #t~post2; {29596#(<= (+ main_~v~0 99998) ~SIZE~0)} is VALID [2018-11-18 23:03:36,110 INFO L273 TraceCheckUtils]: 35: Hoare triple {29596#(<= (+ main_~v~0 99998) ~SIZE~0)} assume true; {29596#(<= (+ main_~v~0 99998) ~SIZE~0)} is VALID [2018-11-18 23:03:36,111 INFO L273 TraceCheckUtils]: 36: Hoare triple {29596#(<= (+ main_~v~0 99998) ~SIZE~0)} assume !!(~v~0 < ~SIZE~0);call #t~mem3 := read~int(~#values~0.base, ~#values~0.offset + 4 * ~v~0, 4); {29596#(<= (+ main_~v~0 99998) ~SIZE~0)} is VALID [2018-11-18 23:03:36,111 INFO L256 TraceCheckUtils]: 37: Hoare triple {29596#(<= (+ main_~v~0 99998) ~SIZE~0)} call #t~ret4 := elem_exists(~#set~0.base, ~#set~0.offset, ~n~0, #t~mem3); {29591#true} is VALID [2018-11-18 23:03:36,111 INFO L273 TraceCheckUtils]: 38: Hoare triple {29591#true} ~set.base, ~set.offset := #in~set.base, #in~set.offset;~size := #in~size;~value := #in~value;havoc ~i~0;~i~0 := 0; {29591#true} is VALID [2018-11-18 23:03:36,111 INFO L273 TraceCheckUtils]: 39: Hoare triple {29591#true} assume true; {29591#true} is VALID [2018-11-18 23:03:36,111 INFO L273 TraceCheckUtils]: 40: Hoare triple {29591#true} assume !!(~i~0 < ~size);call #t~mem1 := read~int(~set.base, ~set.offset + 4 * ~i~0, 4); {29591#true} is VALID [2018-11-18 23:03:36,111 INFO L273 TraceCheckUtils]: 41: Hoare triple {29591#true} assume #t~mem1 == ~value;havoc #t~mem1;#res := 1; {29591#true} is VALID [2018-11-18 23:03:36,112 INFO L273 TraceCheckUtils]: 42: Hoare triple {29591#true} assume true; {29591#true} is VALID [2018-11-18 23:03:36,113 INFO L268 TraceCheckUtils]: 43: Hoare quadruple {29591#true} {29596#(<= (+ main_~v~0 99998) ~SIZE~0)} #132#return; {29596#(<= (+ main_~v~0 99998) ~SIZE~0)} is VALID [2018-11-18 23:03:36,113 INFO L273 TraceCheckUtils]: 44: Hoare triple {29596#(<= (+ main_~v~0 99998) ~SIZE~0)} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {29596#(<= (+ main_~v~0 99998) ~SIZE~0)} is VALID [2018-11-18 23:03:36,114 INFO L273 TraceCheckUtils]: 45: Hoare triple {29596#(<= (+ main_~v~0 99998) ~SIZE~0)} assume !(1 != #t~ret4);havoc #t~mem3;havoc #t~ret4; {29596#(<= (+ main_~v~0 99998) ~SIZE~0)} is VALID [2018-11-18 23:03:36,114 INFO L273 TraceCheckUtils]: 46: Hoare triple {29596#(<= (+ main_~v~0 99998) ~SIZE~0)} #t~post2 := ~v~0;~v~0 := 1 + #t~post2;havoc #t~post2; {29597#(<= (+ main_~v~0 99997) ~SIZE~0)} is VALID [2018-11-18 23:03:36,115 INFO L273 TraceCheckUtils]: 47: Hoare triple {29597#(<= (+ main_~v~0 99997) ~SIZE~0)} assume true; {29597#(<= (+ main_~v~0 99997) ~SIZE~0)} is VALID [2018-11-18 23:03:36,115 INFO L273 TraceCheckUtils]: 48: Hoare triple {29597#(<= (+ main_~v~0 99997) ~SIZE~0)} assume !!(~v~0 < ~SIZE~0);call #t~mem3 := read~int(~#values~0.base, ~#values~0.offset + 4 * ~v~0, 4); {29597#(<= (+ main_~v~0 99997) ~SIZE~0)} is VALID [2018-11-18 23:03:36,115 INFO L256 TraceCheckUtils]: 49: Hoare triple {29597#(<= (+ main_~v~0 99997) ~SIZE~0)} call #t~ret4 := elem_exists(~#set~0.base, ~#set~0.offset, ~n~0, #t~mem3); {29591#true} is VALID [2018-11-18 23:03:36,115 INFO L273 TraceCheckUtils]: 50: Hoare triple {29591#true} ~set.base, ~set.offset := #in~set.base, #in~set.offset;~size := #in~size;~value := #in~value;havoc ~i~0;~i~0 := 0; {29591#true} is VALID [2018-11-18 23:03:36,115 INFO L273 TraceCheckUtils]: 51: Hoare triple {29591#true} assume true; {29591#true} is VALID [2018-11-18 23:03:36,115 INFO L273 TraceCheckUtils]: 52: Hoare triple {29591#true} assume !!(~i~0 < ~size);call #t~mem1 := read~int(~set.base, ~set.offset + 4 * ~i~0, 4); {29591#true} is VALID [2018-11-18 23:03:36,115 INFO L273 TraceCheckUtils]: 53: Hoare triple {29591#true} assume #t~mem1 == ~value;havoc #t~mem1;#res := 1; {29591#true} is VALID [2018-11-18 23:03:36,116 INFO L273 TraceCheckUtils]: 54: Hoare triple {29591#true} assume true; {29591#true} is VALID [2018-11-18 23:03:36,116 INFO L268 TraceCheckUtils]: 55: Hoare quadruple {29591#true} {29597#(<= (+ main_~v~0 99997) ~SIZE~0)} #132#return; {29597#(<= (+ main_~v~0 99997) ~SIZE~0)} is VALID [2018-11-18 23:03:36,116 INFO L273 TraceCheckUtils]: 56: Hoare triple {29597#(<= (+ main_~v~0 99997) ~SIZE~0)} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {29597#(<= (+ main_~v~0 99997) ~SIZE~0)} is VALID [2018-11-18 23:03:36,117 INFO L273 TraceCheckUtils]: 57: Hoare triple {29597#(<= (+ main_~v~0 99997) ~SIZE~0)} assume !(1 != #t~ret4);havoc #t~mem3;havoc #t~ret4; {29597#(<= (+ main_~v~0 99997) ~SIZE~0)} is VALID [2018-11-18 23:03:36,118 INFO L273 TraceCheckUtils]: 58: Hoare triple {29597#(<= (+ main_~v~0 99997) ~SIZE~0)} #t~post2 := ~v~0;~v~0 := 1 + #t~post2;havoc #t~post2; {29598#(<= (+ main_~v~0 99996) ~SIZE~0)} is VALID [2018-11-18 23:03:36,118 INFO L273 TraceCheckUtils]: 59: Hoare triple {29598#(<= (+ main_~v~0 99996) ~SIZE~0)} assume true; {29598#(<= (+ main_~v~0 99996) ~SIZE~0)} is VALID [2018-11-18 23:03:36,119 INFO L273 TraceCheckUtils]: 60: Hoare triple {29598#(<= (+ main_~v~0 99996) ~SIZE~0)} assume !!(~v~0 < ~SIZE~0);call #t~mem3 := read~int(~#values~0.base, ~#values~0.offset + 4 * ~v~0, 4); {29598#(<= (+ main_~v~0 99996) ~SIZE~0)} is VALID [2018-11-18 23:03:36,119 INFO L256 TraceCheckUtils]: 61: Hoare triple {29598#(<= (+ main_~v~0 99996) ~SIZE~0)} call #t~ret4 := elem_exists(~#set~0.base, ~#set~0.offset, ~n~0, #t~mem3); {29591#true} is VALID [2018-11-18 23:03:36,119 INFO L273 TraceCheckUtils]: 62: Hoare triple {29591#true} ~set.base, ~set.offset := #in~set.base, #in~set.offset;~size := #in~size;~value := #in~value;havoc ~i~0;~i~0 := 0; {29591#true} is VALID [2018-11-18 23:03:36,119 INFO L273 TraceCheckUtils]: 63: Hoare triple {29591#true} assume true; {29591#true} is VALID [2018-11-18 23:03:36,119 INFO L273 TraceCheckUtils]: 64: Hoare triple {29591#true} assume !!(~i~0 < ~size);call #t~mem1 := read~int(~set.base, ~set.offset + 4 * ~i~0, 4); {29591#true} is VALID [2018-11-18 23:03:36,120 INFO L273 TraceCheckUtils]: 65: Hoare triple {29591#true} assume #t~mem1 == ~value;havoc #t~mem1;#res := 1; {29591#true} is VALID [2018-11-18 23:03:36,120 INFO L273 TraceCheckUtils]: 66: Hoare triple {29591#true} assume true; {29591#true} is VALID [2018-11-18 23:03:36,121 INFO L268 TraceCheckUtils]: 67: Hoare quadruple {29591#true} {29598#(<= (+ main_~v~0 99996) ~SIZE~0)} #132#return; {29598#(<= (+ main_~v~0 99996) ~SIZE~0)} is VALID [2018-11-18 23:03:36,121 INFO L273 TraceCheckUtils]: 68: Hoare triple {29598#(<= (+ main_~v~0 99996) ~SIZE~0)} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {29598#(<= (+ main_~v~0 99996) ~SIZE~0)} is VALID [2018-11-18 23:03:36,121 INFO L273 TraceCheckUtils]: 69: Hoare triple {29598#(<= (+ main_~v~0 99996) ~SIZE~0)} assume !(1 != #t~ret4);havoc #t~mem3;havoc #t~ret4; {29598#(<= (+ main_~v~0 99996) ~SIZE~0)} is VALID [2018-11-18 23:03:36,122 INFO L273 TraceCheckUtils]: 70: Hoare triple {29598#(<= (+ main_~v~0 99996) ~SIZE~0)} #t~post2 := ~v~0;~v~0 := 1 + #t~post2;havoc #t~post2; {29599#(<= (+ main_~v~0 99995) ~SIZE~0)} is VALID [2018-11-18 23:03:36,122 INFO L273 TraceCheckUtils]: 71: Hoare triple {29599#(<= (+ main_~v~0 99995) ~SIZE~0)} assume true; {29599#(<= (+ main_~v~0 99995) ~SIZE~0)} is VALID [2018-11-18 23:03:36,123 INFO L273 TraceCheckUtils]: 72: Hoare triple {29599#(<= (+ main_~v~0 99995) ~SIZE~0)} assume !!(~v~0 < ~SIZE~0);call #t~mem3 := read~int(~#values~0.base, ~#values~0.offset + 4 * ~v~0, 4); {29599#(<= (+ main_~v~0 99995) ~SIZE~0)} is VALID [2018-11-18 23:03:36,123 INFO L256 TraceCheckUtils]: 73: Hoare triple {29599#(<= (+ main_~v~0 99995) ~SIZE~0)} call #t~ret4 := elem_exists(~#set~0.base, ~#set~0.offset, ~n~0, #t~mem3); {29591#true} is VALID [2018-11-18 23:03:36,123 INFO L273 TraceCheckUtils]: 74: Hoare triple {29591#true} ~set.base, ~set.offset := #in~set.base, #in~set.offset;~size := #in~size;~value := #in~value;havoc ~i~0;~i~0 := 0; {29591#true} is VALID [2018-11-18 23:03:36,123 INFO L273 TraceCheckUtils]: 75: Hoare triple {29591#true} assume true; {29591#true} is VALID [2018-11-18 23:03:36,123 INFO L273 TraceCheckUtils]: 76: Hoare triple {29591#true} assume !!(~i~0 < ~size);call #t~mem1 := read~int(~set.base, ~set.offset + 4 * ~i~0, 4); {29591#true} is VALID [2018-11-18 23:03:36,123 INFO L273 TraceCheckUtils]: 77: Hoare triple {29591#true} assume #t~mem1 == ~value;havoc #t~mem1;#res := 1; {29591#true} is VALID [2018-11-18 23:03:36,123 INFO L273 TraceCheckUtils]: 78: Hoare triple {29591#true} assume true; {29591#true} is VALID [2018-11-18 23:03:36,124 INFO L268 TraceCheckUtils]: 79: Hoare quadruple {29591#true} {29599#(<= (+ main_~v~0 99995) ~SIZE~0)} #132#return; {29599#(<= (+ main_~v~0 99995) ~SIZE~0)} is VALID [2018-11-18 23:03:36,125 INFO L273 TraceCheckUtils]: 80: Hoare triple {29599#(<= (+ main_~v~0 99995) ~SIZE~0)} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {29599#(<= (+ main_~v~0 99995) ~SIZE~0)} is VALID [2018-11-18 23:03:36,125 INFO L273 TraceCheckUtils]: 81: Hoare triple {29599#(<= (+ main_~v~0 99995) ~SIZE~0)} assume !(1 != #t~ret4);havoc #t~mem3;havoc #t~ret4; {29599#(<= (+ main_~v~0 99995) ~SIZE~0)} is VALID [2018-11-18 23:03:36,126 INFO L273 TraceCheckUtils]: 82: Hoare triple {29599#(<= (+ main_~v~0 99995) ~SIZE~0)} #t~post2 := ~v~0;~v~0 := 1 + #t~post2;havoc #t~post2; {29600#(<= (+ main_~v~0 99994) ~SIZE~0)} is VALID [2018-11-18 23:03:36,127 INFO L273 TraceCheckUtils]: 83: Hoare triple {29600#(<= (+ main_~v~0 99994) ~SIZE~0)} assume true; {29600#(<= (+ main_~v~0 99994) ~SIZE~0)} is VALID [2018-11-18 23:03:36,127 INFO L273 TraceCheckUtils]: 84: Hoare triple {29600#(<= (+ main_~v~0 99994) ~SIZE~0)} assume !!(~v~0 < ~SIZE~0);call #t~mem3 := read~int(~#values~0.base, ~#values~0.offset + 4 * ~v~0, 4); {29600#(<= (+ main_~v~0 99994) ~SIZE~0)} is VALID [2018-11-18 23:03:36,127 INFO L256 TraceCheckUtils]: 85: Hoare triple {29600#(<= (+ main_~v~0 99994) ~SIZE~0)} call #t~ret4 := elem_exists(~#set~0.base, ~#set~0.offset, ~n~0, #t~mem3); {29591#true} is VALID [2018-11-18 23:03:36,127 INFO L273 TraceCheckUtils]: 86: Hoare triple {29591#true} ~set.base, ~set.offset := #in~set.base, #in~set.offset;~size := #in~size;~value := #in~value;havoc ~i~0;~i~0 := 0; {29591#true} is VALID [2018-11-18 23:03:36,128 INFO L273 TraceCheckUtils]: 87: Hoare triple {29591#true} assume true; {29591#true} is VALID [2018-11-18 23:03:36,128 INFO L273 TraceCheckUtils]: 88: Hoare triple {29591#true} assume !!(~i~0 < ~size);call #t~mem1 := read~int(~set.base, ~set.offset + 4 * ~i~0, 4); {29591#true} is VALID [2018-11-18 23:03:36,128 INFO L273 TraceCheckUtils]: 89: Hoare triple {29591#true} assume #t~mem1 == ~value;havoc #t~mem1;#res := 1; {29591#true} is VALID [2018-11-18 23:03:36,128 INFO L273 TraceCheckUtils]: 90: Hoare triple {29591#true} assume true; {29591#true} is VALID [2018-11-18 23:03:36,129 INFO L268 TraceCheckUtils]: 91: Hoare quadruple {29591#true} {29600#(<= (+ main_~v~0 99994) ~SIZE~0)} #132#return; {29600#(<= (+ main_~v~0 99994) ~SIZE~0)} is VALID [2018-11-18 23:03:36,130 INFO L273 TraceCheckUtils]: 92: Hoare triple {29600#(<= (+ main_~v~0 99994) ~SIZE~0)} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {29600#(<= (+ main_~v~0 99994) ~SIZE~0)} is VALID [2018-11-18 23:03:36,130 INFO L273 TraceCheckUtils]: 93: Hoare triple {29600#(<= (+ main_~v~0 99994) ~SIZE~0)} assume !(1 != #t~ret4);havoc #t~mem3;havoc #t~ret4; {29600#(<= (+ main_~v~0 99994) ~SIZE~0)} is VALID [2018-11-18 23:03:36,131 INFO L273 TraceCheckUtils]: 94: Hoare triple {29600#(<= (+ main_~v~0 99994) ~SIZE~0)} #t~post2 := ~v~0;~v~0 := 1 + #t~post2;havoc #t~post2; {29601#(<= (+ main_~v~0 99993) ~SIZE~0)} is VALID [2018-11-18 23:03:36,132 INFO L273 TraceCheckUtils]: 95: Hoare triple {29601#(<= (+ main_~v~0 99993) ~SIZE~0)} assume true; {29601#(<= (+ main_~v~0 99993) ~SIZE~0)} is VALID [2018-11-18 23:03:36,132 INFO L273 TraceCheckUtils]: 96: Hoare triple {29601#(<= (+ main_~v~0 99993) ~SIZE~0)} assume !!(~v~0 < ~SIZE~0);call #t~mem3 := read~int(~#values~0.base, ~#values~0.offset + 4 * ~v~0, 4); {29601#(<= (+ main_~v~0 99993) ~SIZE~0)} is VALID [2018-11-18 23:03:36,132 INFO L256 TraceCheckUtils]: 97: Hoare triple {29601#(<= (+ main_~v~0 99993) ~SIZE~0)} call #t~ret4 := elem_exists(~#set~0.base, ~#set~0.offset, ~n~0, #t~mem3); {29591#true} is VALID [2018-11-18 23:03:36,133 INFO L273 TraceCheckUtils]: 98: Hoare triple {29591#true} ~set.base, ~set.offset := #in~set.base, #in~set.offset;~size := #in~size;~value := #in~value;havoc ~i~0;~i~0 := 0; {29591#true} is VALID [2018-11-18 23:03:36,133 INFO L273 TraceCheckUtils]: 99: Hoare triple {29591#true} assume true; {29591#true} is VALID [2018-11-18 23:03:36,133 INFO L273 TraceCheckUtils]: 100: Hoare triple {29591#true} assume !!(~i~0 < ~size);call #t~mem1 := read~int(~set.base, ~set.offset + 4 * ~i~0, 4); {29591#true} is VALID [2018-11-18 23:03:36,133 INFO L273 TraceCheckUtils]: 101: Hoare triple {29591#true} assume #t~mem1 == ~value;havoc #t~mem1;#res := 1; {29591#true} is VALID [2018-11-18 23:03:36,133 INFO L273 TraceCheckUtils]: 102: Hoare triple {29591#true} assume true; {29591#true} is VALID [2018-11-18 23:03:36,134 INFO L268 TraceCheckUtils]: 103: Hoare quadruple {29591#true} {29601#(<= (+ main_~v~0 99993) ~SIZE~0)} #132#return; {29601#(<= (+ main_~v~0 99993) ~SIZE~0)} is VALID [2018-11-18 23:03:36,135 INFO L273 TraceCheckUtils]: 104: Hoare triple {29601#(<= (+ main_~v~0 99993) ~SIZE~0)} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {29601#(<= (+ main_~v~0 99993) ~SIZE~0)} is VALID [2018-11-18 23:03:36,135 INFO L273 TraceCheckUtils]: 105: Hoare triple {29601#(<= (+ main_~v~0 99993) ~SIZE~0)} assume !(1 != #t~ret4);havoc #t~mem3;havoc #t~ret4; {29601#(<= (+ main_~v~0 99993) ~SIZE~0)} is VALID [2018-11-18 23:03:36,136 INFO L273 TraceCheckUtils]: 106: Hoare triple {29601#(<= (+ main_~v~0 99993) ~SIZE~0)} #t~post2 := ~v~0;~v~0 := 1 + #t~post2;havoc #t~post2; {29602#(<= (+ main_~v~0 99992) ~SIZE~0)} is VALID [2018-11-18 23:03:36,137 INFO L273 TraceCheckUtils]: 107: Hoare triple {29602#(<= (+ main_~v~0 99992) ~SIZE~0)} assume true; {29602#(<= (+ main_~v~0 99992) ~SIZE~0)} is VALID [2018-11-18 23:03:36,137 INFO L273 TraceCheckUtils]: 108: Hoare triple {29602#(<= (+ main_~v~0 99992) ~SIZE~0)} assume !!(~v~0 < ~SIZE~0);call #t~mem3 := read~int(~#values~0.base, ~#values~0.offset + 4 * ~v~0, 4); {29602#(<= (+ main_~v~0 99992) ~SIZE~0)} is VALID [2018-11-18 23:03:36,137 INFO L256 TraceCheckUtils]: 109: Hoare triple {29602#(<= (+ main_~v~0 99992) ~SIZE~0)} call #t~ret4 := elem_exists(~#set~0.base, ~#set~0.offset, ~n~0, #t~mem3); {29591#true} is VALID [2018-11-18 23:03:36,138 INFO L273 TraceCheckUtils]: 110: Hoare triple {29591#true} ~set.base, ~set.offset := #in~set.base, #in~set.offset;~size := #in~size;~value := #in~value;havoc ~i~0;~i~0 := 0; {29591#true} is VALID [2018-11-18 23:03:36,138 INFO L273 TraceCheckUtils]: 111: Hoare triple {29591#true} assume true; {29591#true} is VALID [2018-11-18 23:03:36,138 INFO L273 TraceCheckUtils]: 112: Hoare triple {29591#true} assume !!(~i~0 < ~size);call #t~mem1 := read~int(~set.base, ~set.offset + 4 * ~i~0, 4); {29591#true} is VALID [2018-11-18 23:03:36,138 INFO L273 TraceCheckUtils]: 113: Hoare triple {29591#true} assume #t~mem1 == ~value;havoc #t~mem1;#res := 1; {29591#true} is VALID [2018-11-18 23:03:36,138 INFO L273 TraceCheckUtils]: 114: Hoare triple {29591#true} assume true; {29591#true} is VALID [2018-11-18 23:03:36,139 INFO L268 TraceCheckUtils]: 115: Hoare quadruple {29591#true} {29602#(<= (+ main_~v~0 99992) ~SIZE~0)} #132#return; {29602#(<= (+ main_~v~0 99992) ~SIZE~0)} is VALID [2018-11-18 23:03:36,140 INFO L273 TraceCheckUtils]: 116: Hoare triple {29602#(<= (+ main_~v~0 99992) ~SIZE~0)} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {29602#(<= (+ main_~v~0 99992) ~SIZE~0)} is VALID [2018-11-18 23:03:36,140 INFO L273 TraceCheckUtils]: 117: Hoare triple {29602#(<= (+ main_~v~0 99992) ~SIZE~0)} assume !(1 != #t~ret4);havoc #t~mem3;havoc #t~ret4; {29602#(<= (+ main_~v~0 99992) ~SIZE~0)} is VALID [2018-11-18 23:03:36,141 INFO L273 TraceCheckUtils]: 118: Hoare triple {29602#(<= (+ main_~v~0 99992) ~SIZE~0)} #t~post2 := ~v~0;~v~0 := 1 + #t~post2;havoc #t~post2; {29603#(<= (+ main_~v~0 99991) ~SIZE~0)} is VALID [2018-11-18 23:03:36,141 INFO L273 TraceCheckUtils]: 119: Hoare triple {29603#(<= (+ main_~v~0 99991) ~SIZE~0)} assume true; {29603#(<= (+ main_~v~0 99991) ~SIZE~0)} is VALID [2018-11-18 23:03:36,141 INFO L273 TraceCheckUtils]: 120: Hoare triple {29603#(<= (+ main_~v~0 99991) ~SIZE~0)} assume !!(~v~0 < ~SIZE~0);call #t~mem3 := read~int(~#values~0.base, ~#values~0.offset + 4 * ~v~0, 4); {29603#(<= (+ main_~v~0 99991) ~SIZE~0)} is VALID [2018-11-18 23:03:36,141 INFO L256 TraceCheckUtils]: 121: Hoare triple {29603#(<= (+ main_~v~0 99991) ~SIZE~0)} call #t~ret4 := elem_exists(~#set~0.base, ~#set~0.offset, ~n~0, #t~mem3); {29591#true} is VALID [2018-11-18 23:03:36,142 INFO L273 TraceCheckUtils]: 122: Hoare triple {29591#true} ~set.base, ~set.offset := #in~set.base, #in~set.offset;~size := #in~size;~value := #in~value;havoc ~i~0;~i~0 := 0; {29591#true} is VALID [2018-11-18 23:03:36,142 INFO L273 TraceCheckUtils]: 123: Hoare triple {29591#true} assume true; {29591#true} is VALID [2018-11-18 23:03:36,142 INFO L273 TraceCheckUtils]: 124: Hoare triple {29591#true} assume !!(~i~0 < ~size);call #t~mem1 := read~int(~set.base, ~set.offset + 4 * ~i~0, 4); {29591#true} is VALID [2018-11-18 23:03:36,142 INFO L273 TraceCheckUtils]: 125: Hoare triple {29591#true} assume #t~mem1 == ~value;havoc #t~mem1;#res := 1; {29591#true} is VALID [2018-11-18 23:03:36,142 INFO L273 TraceCheckUtils]: 126: Hoare triple {29591#true} assume true; {29591#true} is VALID [2018-11-18 23:03:36,143 INFO L268 TraceCheckUtils]: 127: Hoare quadruple {29591#true} {29603#(<= (+ main_~v~0 99991) ~SIZE~0)} #132#return; {29603#(<= (+ main_~v~0 99991) ~SIZE~0)} is VALID [2018-11-18 23:03:36,144 INFO L273 TraceCheckUtils]: 128: Hoare triple {29603#(<= (+ main_~v~0 99991) ~SIZE~0)} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {29603#(<= (+ main_~v~0 99991) ~SIZE~0)} is VALID [2018-11-18 23:03:36,144 INFO L273 TraceCheckUtils]: 129: Hoare triple {29603#(<= (+ main_~v~0 99991) ~SIZE~0)} assume !(1 != #t~ret4);havoc #t~mem3;havoc #t~ret4; {29603#(<= (+ main_~v~0 99991) ~SIZE~0)} is VALID [2018-11-18 23:03:36,145 INFO L273 TraceCheckUtils]: 130: Hoare triple {29603#(<= (+ main_~v~0 99991) ~SIZE~0)} #t~post2 := ~v~0;~v~0 := 1 + #t~post2;havoc #t~post2; {29604#(<= (+ main_~v~0 99990) ~SIZE~0)} is VALID [2018-11-18 23:03:36,145 INFO L273 TraceCheckUtils]: 131: Hoare triple {29604#(<= (+ main_~v~0 99990) ~SIZE~0)} assume true; {29604#(<= (+ main_~v~0 99990) ~SIZE~0)} is VALID [2018-11-18 23:03:36,145 INFO L273 TraceCheckUtils]: 132: Hoare triple {29604#(<= (+ main_~v~0 99990) ~SIZE~0)} assume !!(~v~0 < ~SIZE~0);call #t~mem3 := read~int(~#values~0.base, ~#values~0.offset + 4 * ~v~0, 4); {29604#(<= (+ main_~v~0 99990) ~SIZE~0)} is VALID [2018-11-18 23:03:36,145 INFO L256 TraceCheckUtils]: 133: Hoare triple {29604#(<= (+ main_~v~0 99990) ~SIZE~0)} call #t~ret4 := elem_exists(~#set~0.base, ~#set~0.offset, ~n~0, #t~mem3); {29591#true} is VALID [2018-11-18 23:03:36,145 INFO L273 TraceCheckUtils]: 134: Hoare triple {29591#true} ~set.base, ~set.offset := #in~set.base, #in~set.offset;~size := #in~size;~value := #in~value;havoc ~i~0;~i~0 := 0; {29591#true} is VALID [2018-11-18 23:03:36,146 INFO L273 TraceCheckUtils]: 135: Hoare triple {29591#true} assume true; {29591#true} is VALID [2018-11-18 23:03:36,146 INFO L273 TraceCheckUtils]: 136: Hoare triple {29591#true} assume !!(~i~0 < ~size);call #t~mem1 := read~int(~set.base, ~set.offset + 4 * ~i~0, 4); {29591#true} is VALID [2018-11-18 23:03:36,146 INFO L273 TraceCheckUtils]: 137: Hoare triple {29591#true} assume #t~mem1 == ~value;havoc #t~mem1;#res := 1; {29591#true} is VALID [2018-11-18 23:03:36,146 INFO L273 TraceCheckUtils]: 138: Hoare triple {29591#true} assume true; {29591#true} is VALID [2018-11-18 23:03:36,147 INFO L268 TraceCheckUtils]: 139: Hoare quadruple {29591#true} {29604#(<= (+ main_~v~0 99990) ~SIZE~0)} #132#return; {29604#(<= (+ main_~v~0 99990) ~SIZE~0)} is VALID [2018-11-18 23:03:36,147 INFO L273 TraceCheckUtils]: 140: Hoare triple {29604#(<= (+ main_~v~0 99990) ~SIZE~0)} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {29604#(<= (+ main_~v~0 99990) ~SIZE~0)} is VALID [2018-11-18 23:03:36,147 INFO L273 TraceCheckUtils]: 141: Hoare triple {29604#(<= (+ main_~v~0 99990) ~SIZE~0)} assume !(1 != #t~ret4);havoc #t~mem3;havoc #t~ret4; {29604#(<= (+ main_~v~0 99990) ~SIZE~0)} is VALID [2018-11-18 23:03:36,148 INFO L273 TraceCheckUtils]: 142: Hoare triple {29604#(<= (+ main_~v~0 99990) ~SIZE~0)} #t~post2 := ~v~0;~v~0 := 1 + #t~post2;havoc #t~post2; {29605#(<= (+ main_~v~0 99989) ~SIZE~0)} is VALID [2018-11-18 23:03:36,149 INFO L273 TraceCheckUtils]: 143: Hoare triple {29605#(<= (+ main_~v~0 99989) ~SIZE~0)} assume true; {29605#(<= (+ main_~v~0 99989) ~SIZE~0)} is VALID [2018-11-18 23:03:36,149 INFO L273 TraceCheckUtils]: 144: Hoare triple {29605#(<= (+ main_~v~0 99989) ~SIZE~0)} assume !!(~v~0 < ~SIZE~0);call #t~mem3 := read~int(~#values~0.base, ~#values~0.offset + 4 * ~v~0, 4); {29605#(<= (+ main_~v~0 99989) ~SIZE~0)} is VALID [2018-11-18 23:03:36,150 INFO L256 TraceCheckUtils]: 145: Hoare triple {29605#(<= (+ main_~v~0 99989) ~SIZE~0)} call #t~ret4 := elem_exists(~#set~0.base, ~#set~0.offset, ~n~0, #t~mem3); {29591#true} is VALID [2018-11-18 23:03:36,150 INFO L273 TraceCheckUtils]: 146: Hoare triple {29591#true} ~set.base, ~set.offset := #in~set.base, #in~set.offset;~size := #in~size;~value := #in~value;havoc ~i~0;~i~0 := 0; {29591#true} is VALID [2018-11-18 23:03:36,150 INFO L273 TraceCheckUtils]: 147: Hoare triple {29591#true} assume true; {29591#true} is VALID [2018-11-18 23:03:36,150 INFO L273 TraceCheckUtils]: 148: Hoare triple {29591#true} assume !!(~i~0 < ~size);call #t~mem1 := read~int(~set.base, ~set.offset + 4 * ~i~0, 4); {29591#true} is VALID [2018-11-18 23:03:36,150 INFO L273 TraceCheckUtils]: 149: Hoare triple {29591#true} assume #t~mem1 == ~value;havoc #t~mem1;#res := 1; {29591#true} is VALID [2018-11-18 23:03:36,150 INFO L273 TraceCheckUtils]: 150: Hoare triple {29591#true} assume true; {29591#true} is VALID [2018-11-18 23:03:36,152 INFO L268 TraceCheckUtils]: 151: Hoare quadruple {29591#true} {29605#(<= (+ main_~v~0 99989) ~SIZE~0)} #132#return; {29605#(<= (+ main_~v~0 99989) ~SIZE~0)} is VALID [2018-11-18 23:03:36,152 INFO L273 TraceCheckUtils]: 152: Hoare triple {29605#(<= (+ main_~v~0 99989) ~SIZE~0)} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {29605#(<= (+ main_~v~0 99989) ~SIZE~0)} is VALID [2018-11-18 23:03:36,152 INFO L273 TraceCheckUtils]: 153: Hoare triple {29605#(<= (+ main_~v~0 99989) ~SIZE~0)} assume !(1 != #t~ret4);havoc #t~mem3;havoc #t~ret4; {29605#(<= (+ main_~v~0 99989) ~SIZE~0)} is VALID [2018-11-18 23:03:36,153 INFO L273 TraceCheckUtils]: 154: Hoare triple {29605#(<= (+ main_~v~0 99989) ~SIZE~0)} #t~post2 := ~v~0;~v~0 := 1 + #t~post2;havoc #t~post2; {29606#(<= (+ main_~v~0 99988) ~SIZE~0)} is VALID [2018-11-18 23:03:36,153 INFO L273 TraceCheckUtils]: 155: Hoare triple {29606#(<= (+ main_~v~0 99988) ~SIZE~0)} assume true; {29606#(<= (+ main_~v~0 99988) ~SIZE~0)} is VALID [2018-11-18 23:03:36,153 INFO L273 TraceCheckUtils]: 156: Hoare triple {29606#(<= (+ main_~v~0 99988) ~SIZE~0)} assume !!(~v~0 < ~SIZE~0);call #t~mem3 := read~int(~#values~0.base, ~#values~0.offset + 4 * ~v~0, 4); {29606#(<= (+ main_~v~0 99988) ~SIZE~0)} is VALID [2018-11-18 23:03:36,154 INFO L256 TraceCheckUtils]: 157: Hoare triple {29606#(<= (+ main_~v~0 99988) ~SIZE~0)} call #t~ret4 := elem_exists(~#set~0.base, ~#set~0.offset, ~n~0, #t~mem3); {29591#true} is VALID [2018-11-18 23:03:36,154 INFO L273 TraceCheckUtils]: 158: Hoare triple {29591#true} ~set.base, ~set.offset := #in~set.base, #in~set.offset;~size := #in~size;~value := #in~value;havoc ~i~0;~i~0 := 0; {29591#true} is VALID [2018-11-18 23:03:36,154 INFO L273 TraceCheckUtils]: 159: Hoare triple {29591#true} assume true; {29591#true} is VALID [2018-11-18 23:03:36,154 INFO L273 TraceCheckUtils]: 160: Hoare triple {29591#true} assume !!(~i~0 < ~size);call #t~mem1 := read~int(~set.base, ~set.offset + 4 * ~i~0, 4); {29591#true} is VALID [2018-11-18 23:03:36,154 INFO L273 TraceCheckUtils]: 161: Hoare triple {29591#true} assume #t~mem1 == ~value;havoc #t~mem1;#res := 1; {29591#true} is VALID [2018-11-18 23:03:36,154 INFO L273 TraceCheckUtils]: 162: Hoare triple {29591#true} assume true; {29591#true} is VALID [2018-11-18 23:03:36,156 INFO L268 TraceCheckUtils]: 163: Hoare quadruple {29591#true} {29606#(<= (+ main_~v~0 99988) ~SIZE~0)} #132#return; {29606#(<= (+ main_~v~0 99988) ~SIZE~0)} is VALID [2018-11-18 23:03:36,156 INFO L273 TraceCheckUtils]: 164: Hoare triple {29606#(<= (+ main_~v~0 99988) ~SIZE~0)} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {29606#(<= (+ main_~v~0 99988) ~SIZE~0)} is VALID [2018-11-18 23:03:36,156 INFO L273 TraceCheckUtils]: 165: Hoare triple {29606#(<= (+ main_~v~0 99988) ~SIZE~0)} assume !(1 != #t~ret4);havoc #t~mem3;havoc #t~ret4; {29606#(<= (+ main_~v~0 99988) ~SIZE~0)} is VALID [2018-11-18 23:03:36,157 INFO L273 TraceCheckUtils]: 166: Hoare triple {29606#(<= (+ main_~v~0 99988) ~SIZE~0)} #t~post2 := ~v~0;~v~0 := 1 + #t~post2;havoc #t~post2; {29607#(<= (+ main_~v~0 99987) ~SIZE~0)} is VALID [2018-11-18 23:03:36,157 INFO L273 TraceCheckUtils]: 167: Hoare triple {29607#(<= (+ main_~v~0 99987) ~SIZE~0)} assume true; {29607#(<= (+ main_~v~0 99987) ~SIZE~0)} is VALID [2018-11-18 23:03:36,157 INFO L273 TraceCheckUtils]: 168: Hoare triple {29607#(<= (+ main_~v~0 99987) ~SIZE~0)} assume !!(~v~0 < ~SIZE~0);call #t~mem3 := read~int(~#values~0.base, ~#values~0.offset + 4 * ~v~0, 4); {29607#(<= (+ main_~v~0 99987) ~SIZE~0)} is VALID [2018-11-18 23:03:36,158 INFO L256 TraceCheckUtils]: 169: Hoare triple {29607#(<= (+ main_~v~0 99987) ~SIZE~0)} call #t~ret4 := elem_exists(~#set~0.base, ~#set~0.offset, ~n~0, #t~mem3); {29591#true} is VALID [2018-11-18 23:03:36,158 INFO L273 TraceCheckUtils]: 170: Hoare triple {29591#true} ~set.base, ~set.offset := #in~set.base, #in~set.offset;~size := #in~size;~value := #in~value;havoc ~i~0;~i~0 := 0; {29591#true} is VALID [2018-11-18 23:03:36,158 INFO L273 TraceCheckUtils]: 171: Hoare triple {29591#true} assume true; {29591#true} is VALID [2018-11-18 23:03:36,158 INFO L273 TraceCheckUtils]: 172: Hoare triple {29591#true} assume !!(~i~0 < ~size);call #t~mem1 := read~int(~set.base, ~set.offset + 4 * ~i~0, 4); {29591#true} is VALID [2018-11-18 23:03:36,158 INFO L273 TraceCheckUtils]: 173: Hoare triple {29591#true} assume #t~mem1 == ~value;havoc #t~mem1;#res := 1; {29591#true} is VALID [2018-11-18 23:03:36,158 INFO L273 TraceCheckUtils]: 174: Hoare triple {29591#true} assume true; {29591#true} is VALID [2018-11-18 23:03:36,159 INFO L268 TraceCheckUtils]: 175: Hoare quadruple {29591#true} {29607#(<= (+ main_~v~0 99987) ~SIZE~0)} #132#return; {29607#(<= (+ main_~v~0 99987) ~SIZE~0)} is VALID [2018-11-18 23:03:36,159 INFO L273 TraceCheckUtils]: 176: Hoare triple {29607#(<= (+ main_~v~0 99987) ~SIZE~0)} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {29607#(<= (+ main_~v~0 99987) ~SIZE~0)} is VALID [2018-11-18 23:03:36,160 INFO L273 TraceCheckUtils]: 177: Hoare triple {29607#(<= (+ main_~v~0 99987) ~SIZE~0)} assume !(1 != #t~ret4);havoc #t~mem3;havoc #t~ret4; {29607#(<= (+ main_~v~0 99987) ~SIZE~0)} is VALID [2018-11-18 23:03:36,161 INFO L273 TraceCheckUtils]: 178: Hoare triple {29607#(<= (+ main_~v~0 99987) ~SIZE~0)} #t~post2 := ~v~0;~v~0 := 1 + #t~post2;havoc #t~post2; {29608#(<= (+ main_~v~0 99986) ~SIZE~0)} is VALID [2018-11-18 23:03:36,161 INFO L273 TraceCheckUtils]: 179: Hoare triple {29608#(<= (+ main_~v~0 99986) ~SIZE~0)} assume true; {29608#(<= (+ main_~v~0 99986) ~SIZE~0)} is VALID [2018-11-18 23:03:36,162 INFO L273 TraceCheckUtils]: 180: Hoare triple {29608#(<= (+ main_~v~0 99986) ~SIZE~0)} assume !!(~v~0 < ~SIZE~0);call #t~mem3 := read~int(~#values~0.base, ~#values~0.offset + 4 * ~v~0, 4); {29608#(<= (+ main_~v~0 99986) ~SIZE~0)} is VALID [2018-11-18 23:03:36,162 INFO L256 TraceCheckUtils]: 181: Hoare triple {29608#(<= (+ main_~v~0 99986) ~SIZE~0)} call #t~ret4 := elem_exists(~#set~0.base, ~#set~0.offset, ~n~0, #t~mem3); {29591#true} is VALID [2018-11-18 23:03:36,162 INFO L273 TraceCheckUtils]: 182: Hoare triple {29591#true} ~set.base, ~set.offset := #in~set.base, #in~set.offset;~size := #in~size;~value := #in~value;havoc ~i~0;~i~0 := 0; {29591#true} is VALID [2018-11-18 23:03:36,162 INFO L273 TraceCheckUtils]: 183: Hoare triple {29591#true} assume true; {29591#true} is VALID [2018-11-18 23:03:36,162 INFO L273 TraceCheckUtils]: 184: Hoare triple {29591#true} assume !!(~i~0 < ~size);call #t~mem1 := read~int(~set.base, ~set.offset + 4 * ~i~0, 4); {29591#true} is VALID [2018-11-18 23:03:36,163 INFO L273 TraceCheckUtils]: 185: Hoare triple {29591#true} assume #t~mem1 == ~value;havoc #t~mem1;#res := 1; {29591#true} is VALID [2018-11-18 23:03:36,163 INFO L273 TraceCheckUtils]: 186: Hoare triple {29591#true} assume true; {29591#true} is VALID [2018-11-18 23:03:36,186 INFO L268 TraceCheckUtils]: 187: Hoare quadruple {29591#true} {29608#(<= (+ main_~v~0 99986) ~SIZE~0)} #132#return; {29608#(<= (+ main_~v~0 99986) ~SIZE~0)} is VALID [2018-11-18 23:03:36,195 INFO L273 TraceCheckUtils]: 188: Hoare triple {29608#(<= (+ main_~v~0 99986) ~SIZE~0)} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {29608#(<= (+ main_~v~0 99986) ~SIZE~0)} is VALID [2018-11-18 23:03:36,196 INFO L273 TraceCheckUtils]: 189: Hoare triple {29608#(<= (+ main_~v~0 99986) ~SIZE~0)} assume !(1 != #t~ret4);havoc #t~mem3;havoc #t~ret4; {29608#(<= (+ main_~v~0 99986) ~SIZE~0)} is VALID [2018-11-18 23:03:36,196 INFO L273 TraceCheckUtils]: 190: Hoare triple {29608#(<= (+ main_~v~0 99986) ~SIZE~0)} #t~post2 := ~v~0;~v~0 := 1 + #t~post2;havoc #t~post2; {29609#(<= (+ main_~v~0 99985) ~SIZE~0)} is VALID [2018-11-18 23:03:36,196 INFO L273 TraceCheckUtils]: 191: Hoare triple {29609#(<= (+ main_~v~0 99985) ~SIZE~0)} assume true; {29609#(<= (+ main_~v~0 99985) ~SIZE~0)} is VALID [2018-11-18 23:03:36,197 INFO L273 TraceCheckUtils]: 192: Hoare triple {29609#(<= (+ main_~v~0 99985) ~SIZE~0)} assume !!(~v~0 < ~SIZE~0);call #t~mem3 := read~int(~#values~0.base, ~#values~0.offset + 4 * ~v~0, 4); {29609#(<= (+ main_~v~0 99985) ~SIZE~0)} is VALID [2018-11-18 23:03:36,197 INFO L256 TraceCheckUtils]: 193: Hoare triple {29609#(<= (+ main_~v~0 99985) ~SIZE~0)} call #t~ret4 := elem_exists(~#set~0.base, ~#set~0.offset, ~n~0, #t~mem3); {29591#true} is VALID [2018-11-18 23:03:36,197 INFO L273 TraceCheckUtils]: 194: Hoare triple {29591#true} ~set.base, ~set.offset := #in~set.base, #in~set.offset;~size := #in~size;~value := #in~value;havoc ~i~0;~i~0 := 0; {29591#true} is VALID [2018-11-18 23:03:36,197 INFO L273 TraceCheckUtils]: 195: Hoare triple {29591#true} assume true; {29591#true} is VALID [2018-11-18 23:03:36,197 INFO L273 TraceCheckUtils]: 196: Hoare triple {29591#true} assume !!(~i~0 < ~size);call #t~mem1 := read~int(~set.base, ~set.offset + 4 * ~i~0, 4); {29591#true} is VALID [2018-11-18 23:03:36,197 INFO L273 TraceCheckUtils]: 197: Hoare triple {29591#true} assume #t~mem1 == ~value;havoc #t~mem1;#res := 1; {29591#true} is VALID [2018-11-18 23:03:36,197 INFO L273 TraceCheckUtils]: 198: Hoare triple {29591#true} assume true; {29591#true} is VALID [2018-11-18 23:03:36,198 INFO L268 TraceCheckUtils]: 199: Hoare quadruple {29591#true} {29609#(<= (+ main_~v~0 99985) ~SIZE~0)} #132#return; {29609#(<= (+ main_~v~0 99985) ~SIZE~0)} is VALID [2018-11-18 23:03:36,198 INFO L273 TraceCheckUtils]: 200: Hoare triple {29609#(<= (+ main_~v~0 99985) ~SIZE~0)} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {29609#(<= (+ main_~v~0 99985) ~SIZE~0)} is VALID [2018-11-18 23:03:36,199 INFO L273 TraceCheckUtils]: 201: Hoare triple {29609#(<= (+ main_~v~0 99985) ~SIZE~0)} assume !(1 != #t~ret4);havoc #t~mem3;havoc #t~ret4; {29609#(<= (+ main_~v~0 99985) ~SIZE~0)} is VALID [2018-11-18 23:03:36,199 INFO L273 TraceCheckUtils]: 202: Hoare triple {29609#(<= (+ main_~v~0 99985) ~SIZE~0)} #t~post2 := ~v~0;~v~0 := 1 + #t~post2;havoc #t~post2; {29610#(<= (+ main_~v~0 99984) ~SIZE~0)} is VALID [2018-11-18 23:03:36,200 INFO L273 TraceCheckUtils]: 203: Hoare triple {29610#(<= (+ main_~v~0 99984) ~SIZE~0)} assume true; {29610#(<= (+ main_~v~0 99984) ~SIZE~0)} is VALID [2018-11-18 23:03:36,200 INFO L273 TraceCheckUtils]: 204: Hoare triple {29610#(<= (+ main_~v~0 99984) ~SIZE~0)} assume !!(~v~0 < ~SIZE~0);call #t~mem3 := read~int(~#values~0.base, ~#values~0.offset + 4 * ~v~0, 4); {29610#(<= (+ main_~v~0 99984) ~SIZE~0)} is VALID [2018-11-18 23:03:36,200 INFO L256 TraceCheckUtils]: 205: Hoare triple {29610#(<= (+ main_~v~0 99984) ~SIZE~0)} call #t~ret4 := elem_exists(~#set~0.base, ~#set~0.offset, ~n~0, #t~mem3); {29591#true} is VALID [2018-11-18 23:03:36,200 INFO L273 TraceCheckUtils]: 206: Hoare triple {29591#true} ~set.base, ~set.offset := #in~set.base, #in~set.offset;~size := #in~size;~value := #in~value;havoc ~i~0;~i~0 := 0; {29591#true} is VALID [2018-11-18 23:03:36,201 INFO L273 TraceCheckUtils]: 207: Hoare triple {29591#true} assume true; {29591#true} is VALID [2018-11-18 23:03:36,201 INFO L273 TraceCheckUtils]: 208: Hoare triple {29591#true} assume !!(~i~0 < ~size);call #t~mem1 := read~int(~set.base, ~set.offset + 4 * ~i~0, 4); {29591#true} is VALID [2018-11-18 23:03:36,201 INFO L273 TraceCheckUtils]: 209: Hoare triple {29591#true} assume #t~mem1 == ~value;havoc #t~mem1;#res := 1; {29591#true} is VALID [2018-11-18 23:03:36,201 INFO L273 TraceCheckUtils]: 210: Hoare triple {29591#true} assume true; {29591#true} is VALID [2018-11-18 23:03:36,202 INFO L268 TraceCheckUtils]: 211: Hoare quadruple {29591#true} {29610#(<= (+ main_~v~0 99984) ~SIZE~0)} #132#return; {29610#(<= (+ main_~v~0 99984) ~SIZE~0)} is VALID [2018-11-18 23:03:36,202 INFO L273 TraceCheckUtils]: 212: Hoare triple {29610#(<= (+ main_~v~0 99984) ~SIZE~0)} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {29610#(<= (+ main_~v~0 99984) ~SIZE~0)} is VALID [2018-11-18 23:03:36,203 INFO L273 TraceCheckUtils]: 213: Hoare triple {29610#(<= (+ main_~v~0 99984) ~SIZE~0)} assume !(1 != #t~ret4);havoc #t~mem3;havoc #t~ret4; {29610#(<= (+ main_~v~0 99984) ~SIZE~0)} is VALID [2018-11-18 23:03:36,203 INFO L273 TraceCheckUtils]: 214: Hoare triple {29610#(<= (+ main_~v~0 99984) ~SIZE~0)} #t~post2 := ~v~0;~v~0 := 1 + #t~post2;havoc #t~post2; {29611#(<= (+ main_~v~0 99983) ~SIZE~0)} is VALID [2018-11-18 23:03:36,203 INFO L273 TraceCheckUtils]: 215: Hoare triple {29611#(<= (+ main_~v~0 99983) ~SIZE~0)} assume true; {29611#(<= (+ main_~v~0 99983) ~SIZE~0)} is VALID [2018-11-18 23:03:36,204 INFO L273 TraceCheckUtils]: 216: Hoare triple {29611#(<= (+ main_~v~0 99983) ~SIZE~0)} assume !!(~v~0 < ~SIZE~0);call #t~mem3 := read~int(~#values~0.base, ~#values~0.offset + 4 * ~v~0, 4); {29611#(<= (+ main_~v~0 99983) ~SIZE~0)} is VALID [2018-11-18 23:03:36,204 INFO L256 TraceCheckUtils]: 217: Hoare triple {29611#(<= (+ main_~v~0 99983) ~SIZE~0)} call #t~ret4 := elem_exists(~#set~0.base, ~#set~0.offset, ~n~0, #t~mem3); {29591#true} is VALID [2018-11-18 23:03:36,204 INFO L273 TraceCheckUtils]: 218: Hoare triple {29591#true} ~set.base, ~set.offset := #in~set.base, #in~set.offset;~size := #in~size;~value := #in~value;havoc ~i~0;~i~0 := 0; {29591#true} is VALID [2018-11-18 23:03:36,204 INFO L273 TraceCheckUtils]: 219: Hoare triple {29591#true} assume true; {29591#true} is VALID [2018-11-18 23:03:36,204 INFO L273 TraceCheckUtils]: 220: Hoare triple {29591#true} assume !!(~i~0 < ~size);call #t~mem1 := read~int(~set.base, ~set.offset + 4 * ~i~0, 4); {29591#true} is VALID [2018-11-18 23:03:36,204 INFO L273 TraceCheckUtils]: 221: Hoare triple {29591#true} assume #t~mem1 == ~value;havoc #t~mem1;#res := 1; {29591#true} is VALID [2018-11-18 23:03:36,204 INFO L273 TraceCheckUtils]: 222: Hoare triple {29591#true} assume true; {29591#true} is VALID [2018-11-18 23:03:36,205 INFO L268 TraceCheckUtils]: 223: Hoare quadruple {29591#true} {29611#(<= (+ main_~v~0 99983) ~SIZE~0)} #132#return; {29611#(<= (+ main_~v~0 99983) ~SIZE~0)} is VALID [2018-11-18 23:03:36,206 INFO L273 TraceCheckUtils]: 224: Hoare triple {29611#(<= (+ main_~v~0 99983) ~SIZE~0)} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {29611#(<= (+ main_~v~0 99983) ~SIZE~0)} is VALID [2018-11-18 23:03:36,206 INFO L273 TraceCheckUtils]: 225: Hoare triple {29611#(<= (+ main_~v~0 99983) ~SIZE~0)} assume !(1 != #t~ret4);havoc #t~mem3;havoc #t~ret4; {29611#(<= (+ main_~v~0 99983) ~SIZE~0)} is VALID [2018-11-18 23:03:36,207 INFO L273 TraceCheckUtils]: 226: Hoare triple {29611#(<= (+ main_~v~0 99983) ~SIZE~0)} #t~post2 := ~v~0;~v~0 := 1 + #t~post2;havoc #t~post2; {29612#(<= (+ main_~v~0 99982) ~SIZE~0)} is VALID [2018-11-18 23:03:36,208 INFO L273 TraceCheckUtils]: 227: Hoare triple {29612#(<= (+ main_~v~0 99982) ~SIZE~0)} assume true; {29612#(<= (+ main_~v~0 99982) ~SIZE~0)} is VALID [2018-11-18 23:03:36,208 INFO L273 TraceCheckUtils]: 228: Hoare triple {29612#(<= (+ main_~v~0 99982) ~SIZE~0)} assume !(~v~0 < ~SIZE~0); {29592#false} is VALID [2018-11-18 23:03:36,209 INFO L273 TraceCheckUtils]: 229: Hoare triple {29592#false} ~i~1 := 0; {29592#false} is VALID [2018-11-18 23:03:36,209 INFO L273 TraceCheckUtils]: 230: Hoare triple {29592#false} assume true; {29592#false} is VALID [2018-11-18 23:03:36,209 INFO L273 TraceCheckUtils]: 231: Hoare triple {29592#false} assume !!(~i~1 < ~SIZE~0 && 1 != ~found~0);call #t~mem8 := read~int(~#set~0.base, ~#set~0.offset + 4 * ~i~1, 4); {29592#false} is VALID [2018-11-18 23:03:36,209 INFO L273 TraceCheckUtils]: 232: Hoare triple {29592#false} assume !(#t~mem8 == ~element~0);havoc #t~mem8; {29592#false} is VALID [2018-11-18 23:03:36,209 INFO L273 TraceCheckUtils]: 233: Hoare triple {29592#false} #t~post7 := ~i~1;~i~1 := 1 + #t~post7;havoc #t~post7; {29592#false} is VALID [2018-11-18 23:03:36,210 INFO L273 TraceCheckUtils]: 234: Hoare triple {29592#false} assume true; {29592#false} is VALID [2018-11-18 23:03:36,210 INFO L273 TraceCheckUtils]: 235: Hoare triple {29592#false} assume !!(~i~1 < ~SIZE~0 && 1 != ~found~0);call #t~mem8 := read~int(~#set~0.base, ~#set~0.offset + 4 * ~i~1, 4); {29592#false} is VALID [2018-11-18 23:03:36,210 INFO L273 TraceCheckUtils]: 236: Hoare triple {29592#false} assume !(#t~mem8 == ~element~0);havoc #t~mem8; {29592#false} is VALID [2018-11-18 23:03:36,210 INFO L273 TraceCheckUtils]: 237: Hoare triple {29592#false} #t~post7 := ~i~1;~i~1 := 1 + #t~post7;havoc #t~post7; {29592#false} is VALID [2018-11-18 23:03:36,210 INFO L273 TraceCheckUtils]: 238: Hoare triple {29592#false} assume true; {29592#false} is VALID [2018-11-18 23:03:36,210 INFO L273 TraceCheckUtils]: 239: Hoare triple {29592#false} assume !!(~i~1 < ~SIZE~0 && 1 != ~found~0);call #t~mem8 := read~int(~#set~0.base, ~#set~0.offset + 4 * ~i~1, 4); {29592#false} is VALID [2018-11-18 23:03:36,211 INFO L273 TraceCheckUtils]: 240: Hoare triple {29592#false} assume #t~mem8 == ~element~0;havoc #t~mem8;~found~0 := 1;~pos~0 := ~i~1; {29592#false} is VALID [2018-11-18 23:03:36,211 INFO L273 TraceCheckUtils]: 241: Hoare triple {29592#false} #t~post7 := ~i~1;~i~1 := 1 + #t~post7;havoc #t~post7; {29592#false} is VALID [2018-11-18 23:03:36,211 INFO L273 TraceCheckUtils]: 242: Hoare triple {29592#false} assume true; {29592#false} is VALID [2018-11-18 23:03:36,211 INFO L273 TraceCheckUtils]: 243: Hoare triple {29592#false} assume !(~i~1 < ~SIZE~0 && 1 != ~found~0); {29592#false} is VALID [2018-11-18 23:03:36,211 INFO L273 TraceCheckUtils]: 244: Hoare triple {29592#false} assume 1 == ~found~0;~i~1 := ~pos~0; {29592#false} is VALID [2018-11-18 23:03:36,212 INFO L273 TraceCheckUtils]: 245: Hoare triple {29592#false} assume true; {29592#false} is VALID [2018-11-18 23:03:36,212 INFO L273 TraceCheckUtils]: 246: Hoare triple {29592#false} assume !!(~i~1 < ~SIZE~0 - 1);call #t~mem10 := read~int(~#set~0.base, ~#set~0.offset + 4 * (1 + ~i~1), 4);call write~int(#t~mem10, ~#set~0.base, ~#set~0.offset + 4 * ~i~1, 4);havoc #t~mem10; {29592#false} is VALID [2018-11-18 23:03:36,212 INFO L273 TraceCheckUtils]: 247: Hoare triple {29592#false} #t~post9 := ~i~1;~i~1 := 1 + #t~post9;havoc #t~post9; {29592#false} is VALID [2018-11-18 23:03:36,212 INFO L273 TraceCheckUtils]: 248: Hoare triple {29592#false} assume true; {29592#false} is VALID [2018-11-18 23:03:36,212 INFO L273 TraceCheckUtils]: 249: Hoare triple {29592#false} assume !!(~i~1 < ~SIZE~0 - 1);call #t~mem10 := read~int(~#set~0.base, ~#set~0.offset + 4 * (1 + ~i~1), 4);call write~int(#t~mem10, ~#set~0.base, ~#set~0.offset + 4 * ~i~1, 4);havoc #t~mem10; {29592#false} is VALID [2018-11-18 23:03:36,212 INFO L273 TraceCheckUtils]: 250: Hoare triple {29592#false} #t~post9 := ~i~1;~i~1 := 1 + #t~post9;havoc #t~post9; {29592#false} is VALID [2018-11-18 23:03:36,212 INFO L273 TraceCheckUtils]: 251: Hoare triple {29592#false} assume true; {29592#false} is VALID [2018-11-18 23:03:36,212 INFO L273 TraceCheckUtils]: 252: Hoare triple {29592#false} assume !(~i~1 < ~SIZE~0 - 1); {29592#false} is VALID [2018-11-18 23:03:36,213 INFO L273 TraceCheckUtils]: 253: Hoare triple {29592#false} assume 1 == ~found~0;~i~1 := 0; {29592#false} is VALID [2018-11-18 23:03:36,213 INFO L273 TraceCheckUtils]: 254: Hoare triple {29592#false} assume true; {29592#false} is VALID [2018-11-18 23:03:36,213 INFO L273 TraceCheckUtils]: 255: Hoare triple {29592#false} assume !!(~i~1 < ~SIZE~0 - 1);call #t~mem12 := read~int(~#set~0.base, ~#set~0.offset + 4 * ~i~1, 4); {29592#false} is VALID [2018-11-18 23:03:36,213 INFO L256 TraceCheckUtils]: 256: Hoare triple {29592#false} call __VERIFIER_assert((if #t~mem12 != ~element~0 then 1 else 0)); {29592#false} is VALID [2018-11-18 23:03:36,213 INFO L273 TraceCheckUtils]: 257: Hoare triple {29592#false} ~cond := #in~cond; {29592#false} is VALID [2018-11-18 23:03:36,213 INFO L273 TraceCheckUtils]: 258: Hoare triple {29592#false} assume 0 == ~cond; {29592#false} is VALID [2018-11-18 23:03:36,213 INFO L273 TraceCheckUtils]: 259: Hoare triple {29592#false} assume !false; {29592#false} is VALID [2018-11-18 23:03:36,255 INFO L134 CoverageAnalysis]: Checked inductivity of 1880 backedges. 0 proven. 954 refuted. 0 times theorem prover too weak. 926 trivial. 0 not checked. [2018-11-18 23:03:36,256 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 23:03:36,256 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-18 23:03:36,265 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-18 23:03:36,318 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2018-11-18 23:03:36,319 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-18 23:03:36,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 23:03:36,385 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 23:03:36,969 INFO L256 TraceCheckUtils]: 0: Hoare triple {29591#true} call ULTIMATE.init(); {29591#true} is VALID [2018-11-18 23:03:36,970 INFO L273 TraceCheckUtils]: 1: Hoare triple {29591#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~SIZE~0 := 100000; {29593#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:03:36,971 INFO L273 TraceCheckUtils]: 2: Hoare triple {29593#(<= 100000 ~SIZE~0)} assume true; {29593#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:03:36,971 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {29593#(<= 100000 ~SIZE~0)} {29591#true} #128#return; {29593#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:03:36,972 INFO L256 TraceCheckUtils]: 4: Hoare triple {29593#(<= 100000 ~SIZE~0)} call #t~ret13 := main(); {29593#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:03:36,972 INFO L273 TraceCheckUtils]: 5: Hoare triple {29593#(<= 100000 ~SIZE~0)} havoc ~i~1;havoc ~pos~0;~n~0 := 0;~found~0 := 0;call ~#set~0.base, ~#set~0.offset := #Ultimate.alloc(4 * ~SIZE~0);call ~#values~0.base, ~#values~0.offset := #Ultimate.alloc(4 * ~SIZE~0);havoc ~element~0;havoc ~v~0;~v~0 := 0; {29593#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:03:36,973 INFO L273 TraceCheckUtils]: 6: Hoare triple {29593#(<= 100000 ~SIZE~0)} assume true; {29593#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:03:36,973 INFO L273 TraceCheckUtils]: 7: Hoare triple {29593#(<= 100000 ~SIZE~0)} assume !!(~v~0 < ~SIZE~0);call #t~mem3 := read~int(~#values~0.base, ~#values~0.offset + 4 * ~v~0, 4); {29593#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:03:36,974 INFO L256 TraceCheckUtils]: 8: Hoare triple {29593#(<= 100000 ~SIZE~0)} call #t~ret4 := elem_exists(~#set~0.base, ~#set~0.offset, ~n~0, #t~mem3); {29593#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:03:36,975 INFO L273 TraceCheckUtils]: 9: Hoare triple {29593#(<= 100000 ~SIZE~0)} ~set.base, ~set.offset := #in~set.base, #in~set.offset;~size := #in~size;~value := #in~value;havoc ~i~0;~i~0 := 0; {29593#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:03:36,975 INFO L273 TraceCheckUtils]: 10: Hoare triple {29593#(<= 100000 ~SIZE~0)} assume true; {29593#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:03:36,976 INFO L273 TraceCheckUtils]: 11: Hoare triple {29593#(<= 100000 ~SIZE~0)} assume !(~i~0 < ~size); {29593#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:03:36,976 INFO L273 TraceCheckUtils]: 12: Hoare triple {29593#(<= 100000 ~SIZE~0)} #res := 0; {29593#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:03:36,977 INFO L273 TraceCheckUtils]: 13: Hoare triple {29593#(<= 100000 ~SIZE~0)} assume true; {29593#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:03:36,978 INFO L268 TraceCheckUtils]: 14: Hoare quadruple {29593#(<= 100000 ~SIZE~0)} {29593#(<= 100000 ~SIZE~0)} #132#return; {29593#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:03:36,978 INFO L273 TraceCheckUtils]: 15: Hoare triple {29593#(<= 100000 ~SIZE~0)} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {29593#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:03:36,979 INFO L273 TraceCheckUtils]: 16: Hoare triple {29593#(<= 100000 ~SIZE~0)} assume 1 != #t~ret4;havoc #t~mem3;havoc #t~ret4;call #t~mem5 := read~int(~#values~0.base, ~#values~0.offset + 4 * ~v~0, 4); {29593#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:03:36,980 INFO L256 TraceCheckUtils]: 17: Hoare triple {29593#(<= 100000 ~SIZE~0)} call #t~ret6 := insert(~#set~0.base, ~#set~0.offset, ~n~0, #t~mem5); {29593#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:03:36,980 INFO L273 TraceCheckUtils]: 18: Hoare triple {29593#(<= 100000 ~SIZE~0)} ~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; {29593#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:03:36,981 INFO L273 TraceCheckUtils]: 19: Hoare triple {29593#(<= 100000 ~SIZE~0)} assume true; {29593#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:03:36,982 INFO L268 TraceCheckUtils]: 20: Hoare quadruple {29593#(<= 100000 ~SIZE~0)} {29593#(<= 100000 ~SIZE~0)} #134#return; {29593#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:03:36,982 INFO L273 TraceCheckUtils]: 21: Hoare triple {29593#(<= 100000 ~SIZE~0)} assume -2147483648 <= #t~ret6 && #t~ret6 <= 2147483647;~n~0 := #t~ret6;havoc #t~ret6;havoc #t~mem5; {29593#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:03:36,983 INFO L273 TraceCheckUtils]: 22: Hoare triple {29593#(<= 100000 ~SIZE~0)} #t~post2 := ~v~0;~v~0 := 1 + #t~post2;havoc #t~post2; {29593#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:03:36,983 INFO L273 TraceCheckUtils]: 23: Hoare triple {29593#(<= 100000 ~SIZE~0)} assume true; {29593#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:03:36,984 INFO L273 TraceCheckUtils]: 24: Hoare triple {29593#(<= 100000 ~SIZE~0)} assume !!(~v~0 < ~SIZE~0);call #t~mem3 := read~int(~#values~0.base, ~#values~0.offset + 4 * ~v~0, 4); {29593#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:03:36,985 INFO L256 TraceCheckUtils]: 25: Hoare triple {29593#(<= 100000 ~SIZE~0)} call #t~ret4 := elem_exists(~#set~0.base, ~#set~0.offset, ~n~0, #t~mem3); {29593#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:03:36,986 INFO L273 TraceCheckUtils]: 26: Hoare triple {29593#(<= 100000 ~SIZE~0)} ~set.base, ~set.offset := #in~set.base, #in~set.offset;~size := #in~size;~value := #in~value;havoc ~i~0;~i~0 := 0; {29593#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:03:36,986 INFO L273 TraceCheckUtils]: 27: Hoare triple {29593#(<= 100000 ~SIZE~0)} assume true; {29593#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:03:36,986 INFO L273 TraceCheckUtils]: 28: Hoare triple {29593#(<= 100000 ~SIZE~0)} assume !!(~i~0 < ~size);call #t~mem1 := read~int(~set.base, ~set.offset + 4 * ~i~0, 4); {29593#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:03:36,987 INFO L273 TraceCheckUtils]: 29: Hoare triple {29593#(<= 100000 ~SIZE~0)} assume #t~mem1 == ~value;havoc #t~mem1;#res := 1; {29593#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:03:36,987 INFO L273 TraceCheckUtils]: 30: Hoare triple {29593#(<= 100000 ~SIZE~0)} assume true; {29593#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:03:36,989 INFO L268 TraceCheckUtils]: 31: Hoare quadruple {29593#(<= 100000 ~SIZE~0)} {29593#(<= 100000 ~SIZE~0)} #132#return; {29593#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:03:36,989 INFO L273 TraceCheckUtils]: 32: Hoare triple {29593#(<= 100000 ~SIZE~0)} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {29593#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:03:36,990 INFO L273 TraceCheckUtils]: 33: Hoare triple {29593#(<= 100000 ~SIZE~0)} assume !(1 != #t~ret4);havoc #t~mem3;havoc #t~ret4; {29593#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:03:36,990 INFO L273 TraceCheckUtils]: 34: Hoare triple {29593#(<= 100000 ~SIZE~0)} #t~post2 := ~v~0;~v~0 := 1 + #t~post2;havoc #t~post2; {29593#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:03:36,991 INFO L273 TraceCheckUtils]: 35: Hoare triple {29593#(<= 100000 ~SIZE~0)} assume true; {29593#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:03:36,991 INFO L273 TraceCheckUtils]: 36: Hoare triple {29593#(<= 100000 ~SIZE~0)} assume !!(~v~0 < ~SIZE~0);call #t~mem3 := read~int(~#values~0.base, ~#values~0.offset + 4 * ~v~0, 4); {29593#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:03:36,992 INFO L256 TraceCheckUtils]: 37: Hoare triple {29593#(<= 100000 ~SIZE~0)} call #t~ret4 := elem_exists(~#set~0.base, ~#set~0.offset, ~n~0, #t~mem3); {29593#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:03:36,992 INFO L273 TraceCheckUtils]: 38: Hoare triple {29593#(<= 100000 ~SIZE~0)} ~set.base, ~set.offset := #in~set.base, #in~set.offset;~size := #in~size;~value := #in~value;havoc ~i~0;~i~0 := 0; {29593#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:03:36,993 INFO L273 TraceCheckUtils]: 39: Hoare triple {29593#(<= 100000 ~SIZE~0)} assume true; {29593#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:03:36,993 INFO L273 TraceCheckUtils]: 40: Hoare triple {29593#(<= 100000 ~SIZE~0)} assume !!(~i~0 < ~size);call #t~mem1 := read~int(~set.base, ~set.offset + 4 * ~i~0, 4); {29593#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:03:36,994 INFO L273 TraceCheckUtils]: 41: Hoare triple {29593#(<= 100000 ~SIZE~0)} assume #t~mem1 == ~value;havoc #t~mem1;#res := 1; {29593#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:03:36,994 INFO L273 TraceCheckUtils]: 42: Hoare triple {29593#(<= 100000 ~SIZE~0)} assume true; {29593#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:03:36,996 INFO L268 TraceCheckUtils]: 43: Hoare quadruple {29593#(<= 100000 ~SIZE~0)} {29593#(<= 100000 ~SIZE~0)} #132#return; {29593#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:03:36,996 INFO L273 TraceCheckUtils]: 44: Hoare triple {29593#(<= 100000 ~SIZE~0)} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {29593#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:03:36,997 INFO L273 TraceCheckUtils]: 45: Hoare triple {29593#(<= 100000 ~SIZE~0)} assume !(1 != #t~ret4);havoc #t~mem3;havoc #t~ret4; {29593#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:03:36,997 INFO L273 TraceCheckUtils]: 46: Hoare triple {29593#(<= 100000 ~SIZE~0)} #t~post2 := ~v~0;~v~0 := 1 + #t~post2;havoc #t~post2; {29593#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:03:36,997 INFO L273 TraceCheckUtils]: 47: Hoare triple {29593#(<= 100000 ~SIZE~0)} assume true; {29593#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:03:36,998 INFO L273 TraceCheckUtils]: 48: Hoare triple {29593#(<= 100000 ~SIZE~0)} assume !!(~v~0 < ~SIZE~0);call #t~mem3 := read~int(~#values~0.base, ~#values~0.offset + 4 * ~v~0, 4); {29593#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:03:36,999 INFO L256 TraceCheckUtils]: 49: Hoare triple {29593#(<= 100000 ~SIZE~0)} call #t~ret4 := elem_exists(~#set~0.base, ~#set~0.offset, ~n~0, #t~mem3); {29593#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:03:36,999 INFO L273 TraceCheckUtils]: 50: Hoare triple {29593#(<= 100000 ~SIZE~0)} ~set.base, ~set.offset := #in~set.base, #in~set.offset;~size := #in~size;~value := #in~value;havoc ~i~0;~i~0 := 0; {29593#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:03:37,000 INFO L273 TraceCheckUtils]: 51: Hoare triple {29593#(<= 100000 ~SIZE~0)} assume true; {29593#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:03:37,000 INFO L273 TraceCheckUtils]: 52: Hoare triple {29593#(<= 100000 ~SIZE~0)} assume !!(~i~0 < ~size);call #t~mem1 := read~int(~set.base, ~set.offset + 4 * ~i~0, 4); {29593#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:03:37,001 INFO L273 TraceCheckUtils]: 53: Hoare triple {29593#(<= 100000 ~SIZE~0)} assume #t~mem1 == ~value;havoc #t~mem1;#res := 1; {29593#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:03:37,001 INFO L273 TraceCheckUtils]: 54: Hoare triple {29593#(<= 100000 ~SIZE~0)} assume true; {29593#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:03:37,003 INFO L268 TraceCheckUtils]: 55: Hoare quadruple {29593#(<= 100000 ~SIZE~0)} {29593#(<= 100000 ~SIZE~0)} #132#return; {29593#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:03:37,003 INFO L273 TraceCheckUtils]: 56: Hoare triple {29593#(<= 100000 ~SIZE~0)} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {29593#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:03:37,004 INFO L273 TraceCheckUtils]: 57: Hoare triple {29593#(<= 100000 ~SIZE~0)} assume !(1 != #t~ret4);havoc #t~mem3;havoc #t~ret4; {29593#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:03:37,004 INFO L273 TraceCheckUtils]: 58: Hoare triple {29593#(<= 100000 ~SIZE~0)} #t~post2 := ~v~0;~v~0 := 1 + #t~post2;havoc #t~post2; {29593#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:03:37,005 INFO L273 TraceCheckUtils]: 59: Hoare triple {29593#(<= 100000 ~SIZE~0)} assume true; {29593#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:03:37,005 INFO L273 TraceCheckUtils]: 60: Hoare triple {29593#(<= 100000 ~SIZE~0)} assume !!(~v~0 < ~SIZE~0);call #t~mem3 := read~int(~#values~0.base, ~#values~0.offset + 4 * ~v~0, 4); {29593#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:03:37,006 INFO L256 TraceCheckUtils]: 61: Hoare triple {29593#(<= 100000 ~SIZE~0)} call #t~ret4 := elem_exists(~#set~0.base, ~#set~0.offset, ~n~0, #t~mem3); {29593#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:03:37,007 INFO L273 TraceCheckUtils]: 62: Hoare triple {29593#(<= 100000 ~SIZE~0)} ~set.base, ~set.offset := #in~set.base, #in~set.offset;~size := #in~size;~value := #in~value;havoc ~i~0;~i~0 := 0; {29593#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:03:37,007 INFO L273 TraceCheckUtils]: 63: Hoare triple {29593#(<= 100000 ~SIZE~0)} assume true; {29593#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:03:37,008 INFO L273 TraceCheckUtils]: 64: Hoare triple {29593#(<= 100000 ~SIZE~0)} assume !!(~i~0 < ~size);call #t~mem1 := read~int(~set.base, ~set.offset + 4 * ~i~0, 4); {29593#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:03:37,008 INFO L273 TraceCheckUtils]: 65: Hoare triple {29593#(<= 100000 ~SIZE~0)} assume #t~mem1 == ~value;havoc #t~mem1;#res := 1; {29593#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:03:37,008 INFO L273 TraceCheckUtils]: 66: Hoare triple {29593#(<= 100000 ~SIZE~0)} assume true; {29593#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:03:37,010 INFO L268 TraceCheckUtils]: 67: Hoare quadruple {29593#(<= 100000 ~SIZE~0)} {29593#(<= 100000 ~SIZE~0)} #132#return; {29593#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:03:37,010 INFO L273 TraceCheckUtils]: 68: Hoare triple {29593#(<= 100000 ~SIZE~0)} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {29593#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:03:37,011 INFO L273 TraceCheckUtils]: 69: Hoare triple {29593#(<= 100000 ~SIZE~0)} assume !(1 != #t~ret4);havoc #t~mem3;havoc #t~ret4; {29593#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:03:37,011 INFO L273 TraceCheckUtils]: 70: Hoare triple {29593#(<= 100000 ~SIZE~0)} #t~post2 := ~v~0;~v~0 := 1 + #t~post2;havoc #t~post2; {29593#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:03:37,012 INFO L273 TraceCheckUtils]: 71: Hoare triple {29593#(<= 100000 ~SIZE~0)} assume true; {29593#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:03:37,012 INFO L273 TraceCheckUtils]: 72: Hoare triple {29593#(<= 100000 ~SIZE~0)} assume !!(~v~0 < ~SIZE~0);call #t~mem3 := read~int(~#values~0.base, ~#values~0.offset + 4 * ~v~0, 4); {29593#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:03:37,013 INFO L256 TraceCheckUtils]: 73: Hoare triple {29593#(<= 100000 ~SIZE~0)} call #t~ret4 := elem_exists(~#set~0.base, ~#set~0.offset, ~n~0, #t~mem3); {29593#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:03:37,014 INFO L273 TraceCheckUtils]: 74: Hoare triple {29593#(<= 100000 ~SIZE~0)} ~set.base, ~set.offset := #in~set.base, #in~set.offset;~size := #in~size;~value := #in~value;havoc ~i~0;~i~0 := 0; {29593#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:03:37,014 INFO L273 TraceCheckUtils]: 75: Hoare triple {29593#(<= 100000 ~SIZE~0)} assume true; {29593#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:03:37,015 INFO L273 TraceCheckUtils]: 76: Hoare triple {29593#(<= 100000 ~SIZE~0)} assume !!(~i~0 < ~size);call #t~mem1 := read~int(~set.base, ~set.offset + 4 * ~i~0, 4); {29593#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:03:37,015 INFO L273 TraceCheckUtils]: 77: Hoare triple {29593#(<= 100000 ~SIZE~0)} assume #t~mem1 == ~value;havoc #t~mem1;#res := 1; {29593#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:03:37,016 INFO L273 TraceCheckUtils]: 78: Hoare triple {29593#(<= 100000 ~SIZE~0)} assume true; {29593#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:03:37,017 INFO L268 TraceCheckUtils]: 79: Hoare quadruple {29593#(<= 100000 ~SIZE~0)} {29593#(<= 100000 ~SIZE~0)} #132#return; {29593#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:03:37,017 INFO L273 TraceCheckUtils]: 80: Hoare triple {29593#(<= 100000 ~SIZE~0)} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {29593#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:03:37,018 INFO L273 TraceCheckUtils]: 81: Hoare triple {29593#(<= 100000 ~SIZE~0)} assume !(1 != #t~ret4);havoc #t~mem3;havoc #t~ret4; {29593#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:03:37,018 INFO L273 TraceCheckUtils]: 82: Hoare triple {29593#(<= 100000 ~SIZE~0)} #t~post2 := ~v~0;~v~0 := 1 + #t~post2;havoc #t~post2; {29593#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:03:37,019 INFO L273 TraceCheckUtils]: 83: Hoare triple {29593#(<= 100000 ~SIZE~0)} assume true; {29593#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:03:37,019 INFO L273 TraceCheckUtils]: 84: Hoare triple {29593#(<= 100000 ~SIZE~0)} assume !!(~v~0 < ~SIZE~0);call #t~mem3 := read~int(~#values~0.base, ~#values~0.offset + 4 * ~v~0, 4); {29593#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:03:37,020 INFO L256 TraceCheckUtils]: 85: Hoare triple {29593#(<= 100000 ~SIZE~0)} call #t~ret4 := elem_exists(~#set~0.base, ~#set~0.offset, ~n~0, #t~mem3); {29593#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:03:37,021 INFO L273 TraceCheckUtils]: 86: Hoare triple {29593#(<= 100000 ~SIZE~0)} ~set.base, ~set.offset := #in~set.base, #in~set.offset;~size := #in~size;~value := #in~value;havoc ~i~0;~i~0 := 0; {29593#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:03:37,021 INFO L273 TraceCheckUtils]: 87: Hoare triple {29593#(<= 100000 ~SIZE~0)} assume true; {29593#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:03:37,022 INFO L273 TraceCheckUtils]: 88: Hoare triple {29593#(<= 100000 ~SIZE~0)} assume !!(~i~0 < ~size);call #t~mem1 := read~int(~set.base, ~set.offset + 4 * ~i~0, 4); {29593#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:03:37,022 INFO L273 TraceCheckUtils]: 89: Hoare triple {29593#(<= 100000 ~SIZE~0)} assume #t~mem1 == ~value;havoc #t~mem1;#res := 1; {29593#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:03:37,023 INFO L273 TraceCheckUtils]: 90: Hoare triple {29593#(<= 100000 ~SIZE~0)} assume true; {29593#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:03:37,024 INFO L268 TraceCheckUtils]: 91: Hoare quadruple {29593#(<= 100000 ~SIZE~0)} {29593#(<= 100000 ~SIZE~0)} #132#return; {29593#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:03:37,024 INFO L273 TraceCheckUtils]: 92: Hoare triple {29593#(<= 100000 ~SIZE~0)} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {29593#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:03:37,025 INFO L273 TraceCheckUtils]: 93: Hoare triple {29593#(<= 100000 ~SIZE~0)} assume !(1 != #t~ret4);havoc #t~mem3;havoc #t~ret4; {29593#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:03:37,025 INFO L273 TraceCheckUtils]: 94: Hoare triple {29593#(<= 100000 ~SIZE~0)} #t~post2 := ~v~0;~v~0 := 1 + #t~post2;havoc #t~post2; {29593#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:03:37,026 INFO L273 TraceCheckUtils]: 95: Hoare triple {29593#(<= 100000 ~SIZE~0)} assume true; {29593#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:03:37,026 INFO L273 TraceCheckUtils]: 96: Hoare triple {29593#(<= 100000 ~SIZE~0)} assume !!(~v~0 < ~SIZE~0);call #t~mem3 := read~int(~#values~0.base, ~#values~0.offset + 4 * ~v~0, 4); {29593#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:03:37,027 INFO L256 TraceCheckUtils]: 97: Hoare triple {29593#(<= 100000 ~SIZE~0)} call #t~ret4 := elem_exists(~#set~0.base, ~#set~0.offset, ~n~0, #t~mem3); {29593#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:03:37,028 INFO L273 TraceCheckUtils]: 98: Hoare triple {29593#(<= 100000 ~SIZE~0)} ~set.base, ~set.offset := #in~set.base, #in~set.offset;~size := #in~size;~value := #in~value;havoc ~i~0;~i~0 := 0; {29593#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:03:37,028 INFO L273 TraceCheckUtils]: 99: Hoare triple {29593#(<= 100000 ~SIZE~0)} assume true; {29593#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:03:37,029 INFO L273 TraceCheckUtils]: 100: Hoare triple {29593#(<= 100000 ~SIZE~0)} assume !!(~i~0 < ~size);call #t~mem1 := read~int(~set.base, ~set.offset + 4 * ~i~0, 4); {29593#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:03:37,029 INFO L273 TraceCheckUtils]: 101: Hoare triple {29593#(<= 100000 ~SIZE~0)} assume #t~mem1 == ~value;havoc #t~mem1;#res := 1; {29593#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:03:37,030 INFO L273 TraceCheckUtils]: 102: Hoare triple {29593#(<= 100000 ~SIZE~0)} assume true; {29593#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:03:37,031 INFO L268 TraceCheckUtils]: 103: Hoare quadruple {29593#(<= 100000 ~SIZE~0)} {29593#(<= 100000 ~SIZE~0)} #132#return; {29593#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:03:37,031 INFO L273 TraceCheckUtils]: 104: Hoare triple {29593#(<= 100000 ~SIZE~0)} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {29593#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:03:37,032 INFO L273 TraceCheckUtils]: 105: Hoare triple {29593#(<= 100000 ~SIZE~0)} assume !(1 != #t~ret4);havoc #t~mem3;havoc #t~ret4; {29593#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:03:37,032 INFO L273 TraceCheckUtils]: 106: Hoare triple {29593#(<= 100000 ~SIZE~0)} #t~post2 := ~v~0;~v~0 := 1 + #t~post2;havoc #t~post2; {29593#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:03:37,033 INFO L273 TraceCheckUtils]: 107: Hoare triple {29593#(<= 100000 ~SIZE~0)} assume true; {29593#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:03:37,033 INFO L273 TraceCheckUtils]: 108: Hoare triple {29593#(<= 100000 ~SIZE~0)} assume !!(~v~0 < ~SIZE~0);call #t~mem3 := read~int(~#values~0.base, ~#values~0.offset + 4 * ~v~0, 4); {29593#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:03:37,034 INFO L256 TraceCheckUtils]: 109: Hoare triple {29593#(<= 100000 ~SIZE~0)} call #t~ret4 := elem_exists(~#set~0.base, ~#set~0.offset, ~n~0, #t~mem3); {29593#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:03:37,035 INFO L273 TraceCheckUtils]: 110: Hoare triple {29593#(<= 100000 ~SIZE~0)} ~set.base, ~set.offset := #in~set.base, #in~set.offset;~size := #in~size;~value := #in~value;havoc ~i~0;~i~0 := 0; {29593#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:03:37,035 INFO L273 TraceCheckUtils]: 111: Hoare triple {29593#(<= 100000 ~SIZE~0)} assume true; {29593#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:03:37,036 INFO L273 TraceCheckUtils]: 112: Hoare triple {29593#(<= 100000 ~SIZE~0)} assume !!(~i~0 < ~size);call #t~mem1 := read~int(~set.base, ~set.offset + 4 * ~i~0, 4); {29593#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:03:37,036 INFO L273 TraceCheckUtils]: 113: Hoare triple {29593#(<= 100000 ~SIZE~0)} assume #t~mem1 == ~value;havoc #t~mem1;#res := 1; {29593#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:03:37,037 INFO L273 TraceCheckUtils]: 114: Hoare triple {29593#(<= 100000 ~SIZE~0)} assume true; {29593#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:03:37,038 INFO L268 TraceCheckUtils]: 115: Hoare quadruple {29593#(<= 100000 ~SIZE~0)} {29593#(<= 100000 ~SIZE~0)} #132#return; {29593#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:03:37,038 INFO L273 TraceCheckUtils]: 116: Hoare triple {29593#(<= 100000 ~SIZE~0)} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {29593#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:03:37,039 INFO L273 TraceCheckUtils]: 117: Hoare triple {29593#(<= 100000 ~SIZE~0)} assume !(1 != #t~ret4);havoc #t~mem3;havoc #t~ret4; {29593#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:03:37,039 INFO L273 TraceCheckUtils]: 118: Hoare triple {29593#(<= 100000 ~SIZE~0)} #t~post2 := ~v~0;~v~0 := 1 + #t~post2;havoc #t~post2; {29593#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:03:37,040 INFO L273 TraceCheckUtils]: 119: Hoare triple {29593#(<= 100000 ~SIZE~0)} assume true; {29593#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:03:37,040 INFO L273 TraceCheckUtils]: 120: Hoare triple {29593#(<= 100000 ~SIZE~0)} assume !!(~v~0 < ~SIZE~0);call #t~mem3 := read~int(~#values~0.base, ~#values~0.offset + 4 * ~v~0, 4); {29593#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:03:37,041 INFO L256 TraceCheckUtils]: 121: Hoare triple {29593#(<= 100000 ~SIZE~0)} call #t~ret4 := elem_exists(~#set~0.base, ~#set~0.offset, ~n~0, #t~mem3); {29593#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:03:37,042 INFO L273 TraceCheckUtils]: 122: Hoare triple {29593#(<= 100000 ~SIZE~0)} ~set.base, ~set.offset := #in~set.base, #in~set.offset;~size := #in~size;~value := #in~value;havoc ~i~0;~i~0 := 0; {29593#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:03:37,042 INFO L273 TraceCheckUtils]: 123: Hoare triple {29593#(<= 100000 ~SIZE~0)} assume true; {29593#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:03:37,043 INFO L273 TraceCheckUtils]: 124: Hoare triple {29593#(<= 100000 ~SIZE~0)} assume !!(~i~0 < ~size);call #t~mem1 := read~int(~set.base, ~set.offset + 4 * ~i~0, 4); {29593#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:03:37,043 INFO L273 TraceCheckUtils]: 125: Hoare triple {29593#(<= 100000 ~SIZE~0)} assume #t~mem1 == ~value;havoc #t~mem1;#res := 1; {29593#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:03:37,044 INFO L273 TraceCheckUtils]: 126: Hoare triple {29593#(<= 100000 ~SIZE~0)} assume true; {29593#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:03:37,045 INFO L268 TraceCheckUtils]: 127: Hoare quadruple {29593#(<= 100000 ~SIZE~0)} {29593#(<= 100000 ~SIZE~0)} #132#return; {29593#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:03:37,046 INFO L273 TraceCheckUtils]: 128: Hoare triple {29593#(<= 100000 ~SIZE~0)} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {29593#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:03:37,046 INFO L273 TraceCheckUtils]: 129: Hoare triple {29593#(<= 100000 ~SIZE~0)} assume !(1 != #t~ret4);havoc #t~mem3;havoc #t~ret4; {29593#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:03:37,047 INFO L273 TraceCheckUtils]: 130: Hoare triple {29593#(<= 100000 ~SIZE~0)} #t~post2 := ~v~0;~v~0 := 1 + #t~post2;havoc #t~post2; {29593#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:03:37,047 INFO L273 TraceCheckUtils]: 131: Hoare triple {29593#(<= 100000 ~SIZE~0)} assume true; {29593#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:03:37,048 INFO L273 TraceCheckUtils]: 132: Hoare triple {29593#(<= 100000 ~SIZE~0)} assume !!(~v~0 < ~SIZE~0);call #t~mem3 := read~int(~#values~0.base, ~#values~0.offset + 4 * ~v~0, 4); {29593#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:03:37,049 INFO L256 TraceCheckUtils]: 133: Hoare triple {29593#(<= 100000 ~SIZE~0)} call #t~ret4 := elem_exists(~#set~0.base, ~#set~0.offset, ~n~0, #t~mem3); {29593#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:03:37,049 INFO L273 TraceCheckUtils]: 134: Hoare triple {29593#(<= 100000 ~SIZE~0)} ~set.base, ~set.offset := #in~set.base, #in~set.offset;~size := #in~size;~value := #in~value;havoc ~i~0;~i~0 := 0; {29593#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:03:37,050 INFO L273 TraceCheckUtils]: 135: Hoare triple {29593#(<= 100000 ~SIZE~0)} assume true; {29593#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:03:37,050 INFO L273 TraceCheckUtils]: 136: Hoare triple {29593#(<= 100000 ~SIZE~0)} assume !!(~i~0 < ~size);call #t~mem1 := read~int(~set.base, ~set.offset + 4 * ~i~0, 4); {29593#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:03:37,051 INFO L273 TraceCheckUtils]: 137: Hoare triple {29593#(<= 100000 ~SIZE~0)} assume #t~mem1 == ~value;havoc #t~mem1;#res := 1; {29593#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:03:37,051 INFO L273 TraceCheckUtils]: 138: Hoare triple {29593#(<= 100000 ~SIZE~0)} assume true; {29593#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:03:37,052 INFO L268 TraceCheckUtils]: 139: Hoare quadruple {29593#(<= 100000 ~SIZE~0)} {29593#(<= 100000 ~SIZE~0)} #132#return; {29593#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:03:37,053 INFO L273 TraceCheckUtils]: 140: Hoare triple {29593#(<= 100000 ~SIZE~0)} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {29593#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:03:37,053 INFO L273 TraceCheckUtils]: 141: Hoare triple {29593#(<= 100000 ~SIZE~0)} assume !(1 != #t~ret4);havoc #t~mem3;havoc #t~ret4; {29593#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:03:37,054 INFO L273 TraceCheckUtils]: 142: Hoare triple {29593#(<= 100000 ~SIZE~0)} #t~post2 := ~v~0;~v~0 := 1 + #t~post2;havoc #t~post2; {29593#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:03:37,054 INFO L273 TraceCheckUtils]: 143: Hoare triple {29593#(<= 100000 ~SIZE~0)} assume true; {29593#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:03:37,055 INFO L273 TraceCheckUtils]: 144: Hoare triple {29593#(<= 100000 ~SIZE~0)} assume !!(~v~0 < ~SIZE~0);call #t~mem3 := read~int(~#values~0.base, ~#values~0.offset + 4 * ~v~0, 4); {29593#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:03:37,056 INFO L256 TraceCheckUtils]: 145: Hoare triple {29593#(<= 100000 ~SIZE~0)} call #t~ret4 := elem_exists(~#set~0.base, ~#set~0.offset, ~n~0, #t~mem3); {29593#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:03:37,056 INFO L273 TraceCheckUtils]: 146: Hoare triple {29593#(<= 100000 ~SIZE~0)} ~set.base, ~set.offset := #in~set.base, #in~set.offset;~size := #in~size;~value := #in~value;havoc ~i~0;~i~0 := 0; {29593#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:03:37,057 INFO L273 TraceCheckUtils]: 147: Hoare triple {29593#(<= 100000 ~SIZE~0)} assume true; {29593#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:03:37,057 INFO L273 TraceCheckUtils]: 148: Hoare triple {29593#(<= 100000 ~SIZE~0)} assume !!(~i~0 < ~size);call #t~mem1 := read~int(~set.base, ~set.offset + 4 * ~i~0, 4); {29593#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:03:37,058 INFO L273 TraceCheckUtils]: 149: Hoare triple {29593#(<= 100000 ~SIZE~0)} assume #t~mem1 == ~value;havoc #t~mem1;#res := 1; {29593#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:03:37,058 INFO L273 TraceCheckUtils]: 150: Hoare triple {29593#(<= 100000 ~SIZE~0)} assume true; {29593#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:03:37,059 INFO L268 TraceCheckUtils]: 151: Hoare quadruple {29593#(<= 100000 ~SIZE~0)} {29593#(<= 100000 ~SIZE~0)} #132#return; {29593#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:03:37,060 INFO L273 TraceCheckUtils]: 152: Hoare triple {29593#(<= 100000 ~SIZE~0)} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {29593#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:03:37,060 INFO L273 TraceCheckUtils]: 153: Hoare triple {29593#(<= 100000 ~SIZE~0)} assume !(1 != #t~ret4);havoc #t~mem3;havoc #t~ret4; {29593#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:03:37,061 INFO L273 TraceCheckUtils]: 154: Hoare triple {29593#(<= 100000 ~SIZE~0)} #t~post2 := ~v~0;~v~0 := 1 + #t~post2;havoc #t~post2; {29593#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:03:37,061 INFO L273 TraceCheckUtils]: 155: Hoare triple {29593#(<= 100000 ~SIZE~0)} assume true; {29593#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:03:37,062 INFO L273 TraceCheckUtils]: 156: Hoare triple {29593#(<= 100000 ~SIZE~0)} assume !!(~v~0 < ~SIZE~0);call #t~mem3 := read~int(~#values~0.base, ~#values~0.offset + 4 * ~v~0, 4); {29593#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:03:37,063 INFO L256 TraceCheckUtils]: 157: Hoare triple {29593#(<= 100000 ~SIZE~0)} call #t~ret4 := elem_exists(~#set~0.base, ~#set~0.offset, ~n~0, #t~mem3); {29593#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:03:37,063 INFO L273 TraceCheckUtils]: 158: Hoare triple {29593#(<= 100000 ~SIZE~0)} ~set.base, ~set.offset := #in~set.base, #in~set.offset;~size := #in~size;~value := #in~value;havoc ~i~0;~i~0 := 0; {29593#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:03:37,064 INFO L273 TraceCheckUtils]: 159: Hoare triple {29593#(<= 100000 ~SIZE~0)} assume true; {29593#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:03:37,064 INFO L273 TraceCheckUtils]: 160: Hoare triple {29593#(<= 100000 ~SIZE~0)} assume !!(~i~0 < ~size);call #t~mem1 := read~int(~set.base, ~set.offset + 4 * ~i~0, 4); {29593#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:03:37,065 INFO L273 TraceCheckUtils]: 161: Hoare triple {29593#(<= 100000 ~SIZE~0)} assume #t~mem1 == ~value;havoc #t~mem1;#res := 1; {29593#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:03:37,065 INFO L273 TraceCheckUtils]: 162: Hoare triple {29593#(<= 100000 ~SIZE~0)} assume true; {29593#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:03:37,066 INFO L268 TraceCheckUtils]: 163: Hoare quadruple {29593#(<= 100000 ~SIZE~0)} {29593#(<= 100000 ~SIZE~0)} #132#return; {29593#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:03:37,067 INFO L273 TraceCheckUtils]: 164: Hoare triple {29593#(<= 100000 ~SIZE~0)} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {29593#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:03:37,067 INFO L273 TraceCheckUtils]: 165: Hoare triple {29593#(<= 100000 ~SIZE~0)} assume !(1 != #t~ret4);havoc #t~mem3;havoc #t~ret4; {29593#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:03:37,068 INFO L273 TraceCheckUtils]: 166: Hoare triple {29593#(<= 100000 ~SIZE~0)} #t~post2 := ~v~0;~v~0 := 1 + #t~post2;havoc #t~post2; {29593#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:03:37,068 INFO L273 TraceCheckUtils]: 167: Hoare triple {29593#(<= 100000 ~SIZE~0)} assume true; {29593#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:03:37,069 INFO L273 TraceCheckUtils]: 168: Hoare triple {29593#(<= 100000 ~SIZE~0)} assume !!(~v~0 < ~SIZE~0);call #t~mem3 := read~int(~#values~0.base, ~#values~0.offset + 4 * ~v~0, 4); {29593#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:03:37,070 INFO L256 TraceCheckUtils]: 169: Hoare triple {29593#(<= 100000 ~SIZE~0)} call #t~ret4 := elem_exists(~#set~0.base, ~#set~0.offset, ~n~0, #t~mem3); {29593#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:03:37,070 INFO L273 TraceCheckUtils]: 170: Hoare triple {29593#(<= 100000 ~SIZE~0)} ~set.base, ~set.offset := #in~set.base, #in~set.offset;~size := #in~size;~value := #in~value;havoc ~i~0;~i~0 := 0; {29593#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:03:37,071 INFO L273 TraceCheckUtils]: 171: Hoare triple {29593#(<= 100000 ~SIZE~0)} assume true; {29593#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:03:37,071 INFO L273 TraceCheckUtils]: 172: Hoare triple {29593#(<= 100000 ~SIZE~0)} assume !!(~i~0 < ~size);call #t~mem1 := read~int(~set.base, ~set.offset + 4 * ~i~0, 4); {29593#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:03:37,072 INFO L273 TraceCheckUtils]: 173: Hoare triple {29593#(<= 100000 ~SIZE~0)} assume #t~mem1 == ~value;havoc #t~mem1;#res := 1; {29593#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:03:37,073 INFO L273 TraceCheckUtils]: 174: Hoare triple {29593#(<= 100000 ~SIZE~0)} assume true; {29593#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:03:37,074 INFO L268 TraceCheckUtils]: 175: Hoare quadruple {29593#(<= 100000 ~SIZE~0)} {29593#(<= 100000 ~SIZE~0)} #132#return; {29593#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:03:37,074 INFO L273 TraceCheckUtils]: 176: Hoare triple {29593#(<= 100000 ~SIZE~0)} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {29593#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:03:37,075 INFO L273 TraceCheckUtils]: 177: Hoare triple {29593#(<= 100000 ~SIZE~0)} assume !(1 != #t~ret4);havoc #t~mem3;havoc #t~ret4; {29593#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:03:37,075 INFO L273 TraceCheckUtils]: 178: Hoare triple {29593#(<= 100000 ~SIZE~0)} #t~post2 := ~v~0;~v~0 := 1 + #t~post2;havoc #t~post2; {29593#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:03:37,076 INFO L273 TraceCheckUtils]: 179: Hoare triple {29593#(<= 100000 ~SIZE~0)} assume true; {29593#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:03:37,076 INFO L273 TraceCheckUtils]: 180: Hoare triple {29593#(<= 100000 ~SIZE~0)} assume !!(~v~0 < ~SIZE~0);call #t~mem3 := read~int(~#values~0.base, ~#values~0.offset + 4 * ~v~0, 4); {29593#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:03:37,077 INFO L256 TraceCheckUtils]: 181: Hoare triple {29593#(<= 100000 ~SIZE~0)} call #t~ret4 := elem_exists(~#set~0.base, ~#set~0.offset, ~n~0, #t~mem3); {29593#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:03:37,078 INFO L273 TraceCheckUtils]: 182: Hoare triple {29593#(<= 100000 ~SIZE~0)} ~set.base, ~set.offset := #in~set.base, #in~set.offset;~size := #in~size;~value := #in~value;havoc ~i~0;~i~0 := 0; {29593#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:03:37,078 INFO L273 TraceCheckUtils]: 183: Hoare triple {29593#(<= 100000 ~SIZE~0)} assume true; {29593#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:03:37,079 INFO L273 TraceCheckUtils]: 184: Hoare triple {29593#(<= 100000 ~SIZE~0)} assume !!(~i~0 < ~size);call #t~mem1 := read~int(~set.base, ~set.offset + 4 * ~i~0, 4); {29593#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:03:37,079 INFO L273 TraceCheckUtils]: 185: Hoare triple {29593#(<= 100000 ~SIZE~0)} assume #t~mem1 == ~value;havoc #t~mem1;#res := 1; {29593#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:03:37,080 INFO L273 TraceCheckUtils]: 186: Hoare triple {29593#(<= 100000 ~SIZE~0)} assume true; {29593#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:03:37,081 INFO L268 TraceCheckUtils]: 187: Hoare quadruple {29593#(<= 100000 ~SIZE~0)} {29593#(<= 100000 ~SIZE~0)} #132#return; {29593#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:03:37,081 INFO L273 TraceCheckUtils]: 188: Hoare triple {29593#(<= 100000 ~SIZE~0)} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {29593#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:03:37,082 INFO L273 TraceCheckUtils]: 189: Hoare triple {29593#(<= 100000 ~SIZE~0)} assume !(1 != #t~ret4);havoc #t~mem3;havoc #t~ret4; {29593#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:03:37,082 INFO L273 TraceCheckUtils]: 190: Hoare triple {29593#(<= 100000 ~SIZE~0)} #t~post2 := ~v~0;~v~0 := 1 + #t~post2;havoc #t~post2; {29593#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:03:37,083 INFO L273 TraceCheckUtils]: 191: Hoare triple {29593#(<= 100000 ~SIZE~0)} assume true; {29593#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:03:37,083 INFO L273 TraceCheckUtils]: 192: Hoare triple {29593#(<= 100000 ~SIZE~0)} assume !!(~v~0 < ~SIZE~0);call #t~mem3 := read~int(~#values~0.base, ~#values~0.offset + 4 * ~v~0, 4); {29593#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:03:37,084 INFO L256 TraceCheckUtils]: 193: Hoare triple {29593#(<= 100000 ~SIZE~0)} call #t~ret4 := elem_exists(~#set~0.base, ~#set~0.offset, ~n~0, #t~mem3); {29593#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:03:37,085 INFO L273 TraceCheckUtils]: 194: Hoare triple {29593#(<= 100000 ~SIZE~0)} ~set.base, ~set.offset := #in~set.base, #in~set.offset;~size := #in~size;~value := #in~value;havoc ~i~0;~i~0 := 0; {29593#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:03:37,085 INFO L273 TraceCheckUtils]: 195: Hoare triple {29593#(<= 100000 ~SIZE~0)} assume true; {29593#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:03:37,086 INFO L273 TraceCheckUtils]: 196: Hoare triple {29593#(<= 100000 ~SIZE~0)} assume !!(~i~0 < ~size);call #t~mem1 := read~int(~set.base, ~set.offset + 4 * ~i~0, 4); {29593#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:03:37,086 INFO L273 TraceCheckUtils]: 197: Hoare triple {29593#(<= 100000 ~SIZE~0)} assume #t~mem1 == ~value;havoc #t~mem1;#res := 1; {29593#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:03:37,087 INFO L273 TraceCheckUtils]: 198: Hoare triple {29593#(<= 100000 ~SIZE~0)} assume true; {29593#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:03:37,088 INFO L268 TraceCheckUtils]: 199: Hoare quadruple {29593#(<= 100000 ~SIZE~0)} {29593#(<= 100000 ~SIZE~0)} #132#return; {29593#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:03:37,089 INFO L273 TraceCheckUtils]: 200: Hoare triple {29593#(<= 100000 ~SIZE~0)} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {29593#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:03:37,089 INFO L273 TraceCheckUtils]: 201: Hoare triple {29593#(<= 100000 ~SIZE~0)} assume !(1 != #t~ret4);havoc #t~mem3;havoc #t~ret4; {29593#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:03:37,090 INFO L273 TraceCheckUtils]: 202: Hoare triple {29593#(<= 100000 ~SIZE~0)} #t~post2 := ~v~0;~v~0 := 1 + #t~post2;havoc #t~post2; {29593#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:03:37,090 INFO L273 TraceCheckUtils]: 203: Hoare triple {29593#(<= 100000 ~SIZE~0)} assume true; {29593#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:03:37,091 INFO L273 TraceCheckUtils]: 204: Hoare triple {29593#(<= 100000 ~SIZE~0)} assume !!(~v~0 < ~SIZE~0);call #t~mem3 := read~int(~#values~0.base, ~#values~0.offset + 4 * ~v~0, 4); {29593#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:03:37,092 INFO L256 TraceCheckUtils]: 205: Hoare triple {29593#(<= 100000 ~SIZE~0)} call #t~ret4 := elem_exists(~#set~0.base, ~#set~0.offset, ~n~0, #t~mem3); {29593#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:03:37,092 INFO L273 TraceCheckUtils]: 206: Hoare triple {29593#(<= 100000 ~SIZE~0)} ~set.base, ~set.offset := #in~set.base, #in~set.offset;~size := #in~size;~value := #in~value;havoc ~i~0;~i~0 := 0; {29593#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:03:37,093 INFO L273 TraceCheckUtils]: 207: Hoare triple {29593#(<= 100000 ~SIZE~0)} assume true; {29593#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:03:37,093 INFO L273 TraceCheckUtils]: 208: Hoare triple {29593#(<= 100000 ~SIZE~0)} assume !!(~i~0 < ~size);call #t~mem1 := read~int(~set.base, ~set.offset + 4 * ~i~0, 4); {29593#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:03:37,094 INFO L273 TraceCheckUtils]: 209: Hoare triple {29593#(<= 100000 ~SIZE~0)} assume #t~mem1 == ~value;havoc #t~mem1;#res := 1; {29593#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:03:37,094 INFO L273 TraceCheckUtils]: 210: Hoare triple {29593#(<= 100000 ~SIZE~0)} assume true; {29593#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:03:37,095 INFO L268 TraceCheckUtils]: 211: Hoare quadruple {29593#(<= 100000 ~SIZE~0)} {29593#(<= 100000 ~SIZE~0)} #132#return; {29593#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:03:37,096 INFO L273 TraceCheckUtils]: 212: Hoare triple {29593#(<= 100000 ~SIZE~0)} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {29593#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:03:37,096 INFO L273 TraceCheckUtils]: 213: Hoare triple {29593#(<= 100000 ~SIZE~0)} assume !(1 != #t~ret4);havoc #t~mem3;havoc #t~ret4; {29593#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:03:37,097 INFO L273 TraceCheckUtils]: 214: Hoare triple {29593#(<= 100000 ~SIZE~0)} #t~post2 := ~v~0;~v~0 := 1 + #t~post2;havoc #t~post2; {29593#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:03:37,097 INFO L273 TraceCheckUtils]: 215: Hoare triple {29593#(<= 100000 ~SIZE~0)} assume true; {29593#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:03:37,098 INFO L273 TraceCheckUtils]: 216: Hoare triple {29593#(<= 100000 ~SIZE~0)} assume !!(~v~0 < ~SIZE~0);call #t~mem3 := read~int(~#values~0.base, ~#values~0.offset + 4 * ~v~0, 4); {29593#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:03:37,099 INFO L256 TraceCheckUtils]: 217: Hoare triple {29593#(<= 100000 ~SIZE~0)} call #t~ret4 := elem_exists(~#set~0.base, ~#set~0.offset, ~n~0, #t~mem3); {29593#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:03:37,099 INFO L273 TraceCheckUtils]: 218: Hoare triple {29593#(<= 100000 ~SIZE~0)} ~set.base, ~set.offset := #in~set.base, #in~set.offset;~size := #in~size;~value := #in~value;havoc ~i~0;~i~0 := 0; {29593#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:03:37,100 INFO L273 TraceCheckUtils]: 219: Hoare triple {29593#(<= 100000 ~SIZE~0)} assume true; {29593#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:03:37,100 INFO L273 TraceCheckUtils]: 220: Hoare triple {29593#(<= 100000 ~SIZE~0)} assume !!(~i~0 < ~size);call #t~mem1 := read~int(~set.base, ~set.offset + 4 * ~i~0, 4); {29593#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:03:37,101 INFO L273 TraceCheckUtils]: 221: Hoare triple {29593#(<= 100000 ~SIZE~0)} assume #t~mem1 == ~value;havoc #t~mem1;#res := 1; {29593#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:03:37,101 INFO L273 TraceCheckUtils]: 222: Hoare triple {29593#(<= 100000 ~SIZE~0)} assume true; {29593#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:03:37,103 INFO L268 TraceCheckUtils]: 223: Hoare quadruple {29593#(<= 100000 ~SIZE~0)} {29593#(<= 100000 ~SIZE~0)} #132#return; {29593#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:03:37,103 INFO L273 TraceCheckUtils]: 224: Hoare triple {29593#(<= 100000 ~SIZE~0)} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {29593#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:03:37,103 INFO L273 TraceCheckUtils]: 225: Hoare triple {29593#(<= 100000 ~SIZE~0)} assume !(1 != #t~ret4);havoc #t~mem3;havoc #t~ret4; {29593#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:03:37,104 INFO L273 TraceCheckUtils]: 226: Hoare triple {29593#(<= 100000 ~SIZE~0)} #t~post2 := ~v~0;~v~0 := 1 + #t~post2;havoc #t~post2; {29593#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:03:37,104 INFO L273 TraceCheckUtils]: 227: Hoare triple {29593#(<= 100000 ~SIZE~0)} assume true; {29593#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:03:37,105 INFO L273 TraceCheckUtils]: 228: Hoare triple {29593#(<= 100000 ~SIZE~0)} assume !(~v~0 < ~SIZE~0); {29593#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:03:37,106 INFO L273 TraceCheckUtils]: 229: Hoare triple {29593#(<= 100000 ~SIZE~0)} ~i~1 := 0; {30303#(and (<= main_~i~1 0) (<= 100000 ~SIZE~0))} is VALID [2018-11-18 23:03:37,106 INFO L273 TraceCheckUtils]: 230: Hoare triple {30303#(and (<= main_~i~1 0) (<= 100000 ~SIZE~0))} assume true; {30303#(and (<= main_~i~1 0) (<= 100000 ~SIZE~0))} is VALID [2018-11-18 23:03:37,107 INFO L273 TraceCheckUtils]: 231: Hoare triple {30303#(and (<= main_~i~1 0) (<= 100000 ~SIZE~0))} assume !!(~i~1 < ~SIZE~0 && 1 != ~found~0);call #t~mem8 := read~int(~#set~0.base, ~#set~0.offset + 4 * ~i~1, 4); {30303#(and (<= main_~i~1 0) (<= 100000 ~SIZE~0))} is VALID [2018-11-18 23:03:37,108 INFO L273 TraceCheckUtils]: 232: Hoare triple {30303#(and (<= main_~i~1 0) (<= 100000 ~SIZE~0))} assume !(#t~mem8 == ~element~0);havoc #t~mem8; {30303#(and (<= main_~i~1 0) (<= 100000 ~SIZE~0))} is VALID [2018-11-18 23:03:37,109 INFO L273 TraceCheckUtils]: 233: Hoare triple {30303#(and (<= main_~i~1 0) (<= 100000 ~SIZE~0))} #t~post7 := ~i~1;~i~1 := 1 + #t~post7;havoc #t~post7; {30316#(and (<= main_~i~1 1) (<= 100000 ~SIZE~0))} is VALID [2018-11-18 23:03:37,109 INFO L273 TraceCheckUtils]: 234: Hoare triple {30316#(and (<= main_~i~1 1) (<= 100000 ~SIZE~0))} assume true; {30316#(and (<= main_~i~1 1) (<= 100000 ~SIZE~0))} is VALID [2018-11-18 23:03:37,110 INFO L273 TraceCheckUtils]: 235: Hoare triple {30316#(and (<= main_~i~1 1) (<= 100000 ~SIZE~0))} assume !!(~i~1 < ~SIZE~0 && 1 != ~found~0);call #t~mem8 := read~int(~#set~0.base, ~#set~0.offset + 4 * ~i~1, 4); {30316#(and (<= main_~i~1 1) (<= 100000 ~SIZE~0))} is VALID [2018-11-18 23:03:37,111 INFO L273 TraceCheckUtils]: 236: Hoare triple {30316#(and (<= main_~i~1 1) (<= 100000 ~SIZE~0))} assume !(#t~mem8 == ~element~0);havoc #t~mem8; {30316#(and (<= main_~i~1 1) (<= 100000 ~SIZE~0))} is VALID [2018-11-18 23:03:37,111 INFO L273 TraceCheckUtils]: 237: Hoare triple {30316#(and (<= main_~i~1 1) (<= 100000 ~SIZE~0))} #t~post7 := ~i~1;~i~1 := 1 + #t~post7;havoc #t~post7; {30329#(and (<= main_~i~1 2) (<= 100000 ~SIZE~0))} is VALID [2018-11-18 23:03:37,112 INFO L273 TraceCheckUtils]: 238: Hoare triple {30329#(and (<= main_~i~1 2) (<= 100000 ~SIZE~0))} assume true; {30329#(and (<= main_~i~1 2) (<= 100000 ~SIZE~0))} is VALID [2018-11-18 23:03:37,113 INFO L273 TraceCheckUtils]: 239: Hoare triple {30329#(and (<= main_~i~1 2) (<= 100000 ~SIZE~0))} assume !!(~i~1 < ~SIZE~0 && 1 != ~found~0);call #t~mem8 := read~int(~#set~0.base, ~#set~0.offset + 4 * ~i~1, 4); {30329#(and (<= main_~i~1 2) (<= 100000 ~SIZE~0))} is VALID [2018-11-18 23:03:37,113 INFO L273 TraceCheckUtils]: 240: Hoare triple {30329#(and (<= main_~i~1 2) (<= 100000 ~SIZE~0))} assume #t~mem8 == ~element~0;havoc #t~mem8;~found~0 := 1;~pos~0 := ~i~1; {30339#(and (<= main_~pos~0 2) (<= 100000 ~SIZE~0))} is VALID [2018-11-18 23:03:37,114 INFO L273 TraceCheckUtils]: 241: Hoare triple {30339#(and (<= main_~pos~0 2) (<= 100000 ~SIZE~0))} #t~post7 := ~i~1;~i~1 := 1 + #t~post7;havoc #t~post7; {30339#(and (<= main_~pos~0 2) (<= 100000 ~SIZE~0))} is VALID [2018-11-18 23:03:37,115 INFO L273 TraceCheckUtils]: 242: Hoare triple {30339#(and (<= main_~pos~0 2) (<= 100000 ~SIZE~0))} assume true; {30339#(and (<= main_~pos~0 2) (<= 100000 ~SIZE~0))} is VALID [2018-11-18 23:03:37,115 INFO L273 TraceCheckUtils]: 243: Hoare triple {30339#(and (<= main_~pos~0 2) (<= 100000 ~SIZE~0))} assume !(~i~1 < ~SIZE~0 && 1 != ~found~0); {30339#(and (<= main_~pos~0 2) (<= 100000 ~SIZE~0))} is VALID [2018-11-18 23:03:37,116 INFO L273 TraceCheckUtils]: 244: Hoare triple {30339#(and (<= main_~pos~0 2) (<= 100000 ~SIZE~0))} assume 1 == ~found~0;~i~1 := ~pos~0; {30329#(and (<= main_~i~1 2) (<= 100000 ~SIZE~0))} is VALID [2018-11-18 23:03:37,117 INFO L273 TraceCheckUtils]: 245: Hoare triple {30329#(and (<= main_~i~1 2) (<= 100000 ~SIZE~0))} assume true; {30329#(and (<= main_~i~1 2) (<= 100000 ~SIZE~0))} is VALID [2018-11-18 23:03:37,118 INFO L273 TraceCheckUtils]: 246: Hoare triple {30329#(and (<= main_~i~1 2) (<= 100000 ~SIZE~0))} assume !!(~i~1 < ~SIZE~0 - 1);call #t~mem10 := read~int(~#set~0.base, ~#set~0.offset + 4 * (1 + ~i~1), 4);call write~int(#t~mem10, ~#set~0.base, ~#set~0.offset + 4 * ~i~1, 4);havoc #t~mem10; {30329#(and (<= main_~i~1 2) (<= 100000 ~SIZE~0))} is VALID [2018-11-18 23:03:37,118 INFO L273 TraceCheckUtils]: 247: Hoare triple {30329#(and (<= main_~i~1 2) (<= 100000 ~SIZE~0))} #t~post9 := ~i~1;~i~1 := 1 + #t~post9;havoc #t~post9; {30361#(and (<= main_~i~1 3) (<= 100000 ~SIZE~0))} is VALID [2018-11-18 23:03:37,119 INFO L273 TraceCheckUtils]: 248: Hoare triple {30361#(and (<= main_~i~1 3) (<= 100000 ~SIZE~0))} assume true; {30361#(and (<= main_~i~1 3) (<= 100000 ~SIZE~0))} is VALID [2018-11-18 23:03:37,120 INFO L273 TraceCheckUtils]: 249: Hoare triple {30361#(and (<= main_~i~1 3) (<= 100000 ~SIZE~0))} assume !!(~i~1 < ~SIZE~0 - 1);call #t~mem10 := read~int(~#set~0.base, ~#set~0.offset + 4 * (1 + ~i~1), 4);call write~int(#t~mem10, ~#set~0.base, ~#set~0.offset + 4 * ~i~1, 4);havoc #t~mem10; {30361#(and (<= main_~i~1 3) (<= 100000 ~SIZE~0))} is VALID [2018-11-18 23:03:37,121 INFO L273 TraceCheckUtils]: 250: Hoare triple {30361#(and (<= main_~i~1 3) (<= 100000 ~SIZE~0))} #t~post9 := ~i~1;~i~1 := 1 + #t~post9;havoc #t~post9; {30371#(and (<= main_~i~1 4) (<= 100000 ~SIZE~0))} is VALID [2018-11-18 23:03:37,121 INFO L273 TraceCheckUtils]: 251: Hoare triple {30371#(and (<= main_~i~1 4) (<= 100000 ~SIZE~0))} assume true; {30371#(and (<= main_~i~1 4) (<= 100000 ~SIZE~0))} is VALID [2018-11-18 23:03:37,122 INFO L273 TraceCheckUtils]: 252: Hoare triple {30371#(and (<= main_~i~1 4) (<= 100000 ~SIZE~0))} assume !(~i~1 < ~SIZE~0 - 1); {29592#false} is VALID [2018-11-18 23:03:37,122 INFO L273 TraceCheckUtils]: 253: Hoare triple {29592#false} assume 1 == ~found~0;~i~1 := 0; {29592#false} is VALID [2018-11-18 23:03:37,122 INFO L273 TraceCheckUtils]: 254: Hoare triple {29592#false} assume true; {29592#false} is VALID [2018-11-18 23:03:37,123 INFO L273 TraceCheckUtils]: 255: Hoare triple {29592#false} assume !!(~i~1 < ~SIZE~0 - 1);call #t~mem12 := read~int(~#set~0.base, ~#set~0.offset + 4 * ~i~1, 4); {29592#false} is VALID [2018-11-18 23:03:37,123 INFO L256 TraceCheckUtils]: 256: Hoare triple {29592#false} call __VERIFIER_assert((if #t~mem12 != ~element~0 then 1 else 0)); {29592#false} is VALID [2018-11-18 23:03:37,123 INFO L273 TraceCheckUtils]: 257: Hoare triple {29592#false} ~cond := #in~cond; {29592#false} is VALID [2018-11-18 23:03:37,123 INFO L273 TraceCheckUtils]: 258: Hoare triple {29592#false} assume 0 == ~cond; {29592#false} is VALID [2018-11-18 23:03:37,123 INFO L273 TraceCheckUtils]: 259: Hoare triple {29592#false} assume !false; {29592#false} is VALID [2018-11-18 23:03:37,166 INFO L134 CoverageAnalysis]: Checked inductivity of 1880 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 1855 trivial. 0 not checked. [2018-11-18 23:03:37,185 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-18 23:03:37,185 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 9] total 28 [2018-11-18 23:03:37,186 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 260 [2018-11-18 23:03:37,186 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-18 23:03:37,186 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 28 states. [2018-11-18 23:03:37,396 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 211 edges. 211 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 23:03:37,397 INFO L459 AbstractCegarLoop]: Interpolant automaton has 28 states [2018-11-18 23:03:37,397 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2018-11-18 23:03:37,397 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=241, Invalid=515, Unknown=0, NotChecked=0, Total=756 [2018-11-18 23:03:37,398 INFO L87 Difference]: Start difference. First operand 275 states and 368 transitions. Second operand 28 states. [2018-11-18 23:03:44,939 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 23:03:44,940 INFO L93 Difference]: Finished difference Result 455 states and 580 transitions. [2018-11-18 23:03:44,940 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2018-11-18 23:03:44,940 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 260 [2018-11-18 23:03:44,940 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 23:03:44,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2018-11-18 23:03:44,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 406 transitions. [2018-11-18 23:03:44,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2018-11-18 23:03:44,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 406 transitions. [2018-11-18 23:03:44,949 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 33 states and 406 transitions. [2018-11-18 23:03:45,515 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 406 edges. 406 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 23:03:45,528 INFO L225 Difference]: With dead ends: 455 [2018-11-18 23:03:45,528 INFO L226 Difference]: Without dead ends: 384 [2018-11-18 23:03:45,530 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 304 GetRequests, 255 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 381 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=682, Invalid=1868, Unknown=0, NotChecked=0, Total=2550 [2018-11-18 23:03:45,530 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 384 states. [2018-11-18 23:03:46,323 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 384 to 285. [2018-11-18 23:03:46,323 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-18 23:03:46,323 INFO L82 GeneralOperation]: Start isEquivalent. First operand 384 states. Second operand 285 states. [2018-11-18 23:03:46,324 INFO L74 IsIncluded]: Start isIncluded. First operand 384 states. Second operand 285 states. [2018-11-18 23:03:46,324 INFO L87 Difference]: Start difference. First operand 384 states. Second operand 285 states. [2018-11-18 23:03:46,334 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 23:03:46,334 INFO L93 Difference]: Finished difference Result 384 states and 501 transitions. [2018-11-18 23:03:46,334 INFO L276 IsEmpty]: Start isEmpty. Operand 384 states and 501 transitions. [2018-11-18 23:03:46,335 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 23:03:46,336 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 23:03:46,336 INFO L74 IsIncluded]: Start isIncluded. First operand 285 states. Second operand 384 states. [2018-11-18 23:03:46,336 INFO L87 Difference]: Start difference. First operand 285 states. Second operand 384 states. [2018-11-18 23:03:46,349 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 23:03:46,349 INFO L93 Difference]: Finished difference Result 384 states and 501 transitions. [2018-11-18 23:03:46,349 INFO L276 IsEmpty]: Start isEmpty. Operand 384 states and 501 transitions. [2018-11-18 23:03:46,350 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 23:03:46,350 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 23:03:46,351 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-18 23:03:46,351 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-18 23:03:46,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 285 states. [2018-11-18 23:03:46,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 285 states to 285 states and 383 transitions. [2018-11-18 23:03:46,360 INFO L78 Accepts]: Start accepts. Automaton has 285 states and 383 transitions. Word has length 260 [2018-11-18 23:03:46,360 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 23:03:46,360 INFO L480 AbstractCegarLoop]: Abstraction has 285 states and 383 transitions. [2018-11-18 23:03:46,361 INFO L481 AbstractCegarLoop]: Interpolant automaton has 28 states. [2018-11-18 23:03:46,361 INFO L276 IsEmpty]: Start isEmpty. Operand 285 states and 383 transitions. [2018-11-18 23:03:46,363 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 274 [2018-11-18 23:03:46,363 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 23:03:46,363 INFO L375 BasicCegarLoop]: trace histogram [20, 19, 19, 19, 19, 19, 19, 19, 19, 18, 18, 18, 6, 5, 5, 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] [2018-11-18 23:03:46,363 INFO L423 AbstractCegarLoop]: === Iteration 26 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 23:03:46,364 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 23:03:46,364 INFO L82 PathProgramCache]: Analyzing trace with hash -1860459363, now seen corresponding path program 4 times [2018-11-18 23:03:46,364 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 23:03:46,364 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 23:03:46,365 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 23:03:46,365 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 23:03:46,365 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 23:03:46,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 23:03:48,473 INFO L256 TraceCheckUtils]: 0: Hoare triple {32181#true} call ULTIMATE.init(); {32181#true} is VALID [2018-11-18 23:03:48,473 INFO L273 TraceCheckUtils]: 1: Hoare triple {32181#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~SIZE~0 := 100000; {32183#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:03:48,475 INFO L273 TraceCheckUtils]: 2: Hoare triple {32183#(<= 100000 ~SIZE~0)} assume true; {32183#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:03:48,477 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {32183#(<= 100000 ~SIZE~0)} {32181#true} #128#return; {32183#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:03:48,477 INFO L256 TraceCheckUtils]: 4: Hoare triple {32183#(<= 100000 ~SIZE~0)} call #t~ret13 := main(); {32183#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:03:48,478 INFO L273 TraceCheckUtils]: 5: Hoare triple {32183#(<= 100000 ~SIZE~0)} havoc ~i~1;havoc ~pos~0;~n~0 := 0;~found~0 := 0;call ~#set~0.base, ~#set~0.offset := #Ultimate.alloc(4 * ~SIZE~0);call ~#values~0.base, ~#values~0.offset := #Ultimate.alloc(4 * ~SIZE~0);havoc ~element~0;havoc ~v~0;~v~0 := 0; {32183#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:03:48,478 INFO L273 TraceCheckUtils]: 6: Hoare triple {32183#(<= 100000 ~SIZE~0)} assume true; {32183#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:03:48,478 INFO L273 TraceCheckUtils]: 7: Hoare triple {32183#(<= 100000 ~SIZE~0)} assume !!(~v~0 < ~SIZE~0);call #t~mem3 := read~int(~#values~0.base, ~#values~0.offset + 4 * ~v~0, 4); {32183#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:03:48,478 INFO L256 TraceCheckUtils]: 8: Hoare triple {32183#(<= 100000 ~SIZE~0)} call #t~ret4 := elem_exists(~#set~0.base, ~#set~0.offset, ~n~0, #t~mem3); {32181#true} is VALID [2018-11-18 23:03:48,479 INFO L273 TraceCheckUtils]: 9: Hoare triple {32181#true} ~set.base, ~set.offset := #in~set.base, #in~set.offset;~size := #in~size;~value := #in~value;havoc ~i~0;~i~0 := 0; {32181#true} is VALID [2018-11-18 23:03:48,479 INFO L273 TraceCheckUtils]: 10: Hoare triple {32181#true} assume true; {32181#true} is VALID [2018-11-18 23:03:48,479 INFO L273 TraceCheckUtils]: 11: Hoare triple {32181#true} assume !(~i~0 < ~size); {32181#true} is VALID [2018-11-18 23:03:48,479 INFO L273 TraceCheckUtils]: 12: Hoare triple {32181#true} #res := 0; {32181#true} is VALID [2018-11-18 23:03:48,479 INFO L273 TraceCheckUtils]: 13: Hoare triple {32181#true} assume true; {32181#true} is VALID [2018-11-18 23:03:48,480 INFO L268 TraceCheckUtils]: 14: Hoare quadruple {32181#true} {32183#(<= 100000 ~SIZE~0)} #132#return; {32183#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:03:48,481 INFO L273 TraceCheckUtils]: 15: Hoare triple {32183#(<= 100000 ~SIZE~0)} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {32183#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:03:48,481 INFO L273 TraceCheckUtils]: 16: Hoare triple {32183#(<= 100000 ~SIZE~0)} assume 1 != #t~ret4;havoc #t~mem3;havoc #t~ret4;call #t~mem5 := read~int(~#values~0.base, ~#values~0.offset + 4 * ~v~0, 4); {32183#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:03:48,481 INFO L256 TraceCheckUtils]: 17: Hoare triple {32183#(<= 100000 ~SIZE~0)} call #t~ret6 := insert(~#set~0.base, ~#set~0.offset, ~n~0, #t~mem5); {32181#true} is VALID [2018-11-18 23:03:48,482 INFO L273 TraceCheckUtils]: 18: Hoare triple {32181#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; {32181#true} is VALID [2018-11-18 23:03:48,482 INFO L273 TraceCheckUtils]: 19: Hoare triple {32181#true} assume true; {32181#true} is VALID [2018-11-18 23:03:48,484 INFO L268 TraceCheckUtils]: 20: Hoare quadruple {32181#true} {32183#(<= 100000 ~SIZE~0)} #134#return; {32183#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:03:48,484 INFO L273 TraceCheckUtils]: 21: Hoare triple {32183#(<= 100000 ~SIZE~0)} assume -2147483648 <= #t~ret6 && #t~ret6 <= 2147483647;~n~0 := #t~ret6;havoc #t~ret6;havoc #t~mem5; {32183#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:03:48,485 INFO L273 TraceCheckUtils]: 22: Hoare triple {32183#(<= 100000 ~SIZE~0)} #t~post2 := ~v~0;~v~0 := 1 + #t~post2;havoc #t~post2; {32183#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:03:48,485 INFO L273 TraceCheckUtils]: 23: Hoare triple {32183#(<= 100000 ~SIZE~0)} assume true; {32183#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:03:48,486 INFO L273 TraceCheckUtils]: 24: Hoare triple {32183#(<= 100000 ~SIZE~0)} assume !!(~v~0 < ~SIZE~0);call #t~mem3 := read~int(~#values~0.base, ~#values~0.offset + 4 * ~v~0, 4); {32183#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:03:48,486 INFO L256 TraceCheckUtils]: 25: Hoare triple {32183#(<= 100000 ~SIZE~0)} call #t~ret4 := elem_exists(~#set~0.base, ~#set~0.offset, ~n~0, #t~mem3); {32181#true} is VALID [2018-11-18 23:03:48,486 INFO L273 TraceCheckUtils]: 26: Hoare triple {32181#true} ~set.base, ~set.offset := #in~set.base, #in~set.offset;~size := #in~size;~value := #in~value;havoc ~i~0;~i~0 := 0; {32181#true} is VALID [2018-11-18 23:03:48,486 INFO L273 TraceCheckUtils]: 27: Hoare triple {32181#true} assume true; {32181#true} is VALID [2018-11-18 23:03:48,486 INFO L273 TraceCheckUtils]: 28: Hoare triple {32181#true} assume !!(~i~0 < ~size);call #t~mem1 := read~int(~set.base, ~set.offset + 4 * ~i~0, 4); {32181#true} is VALID [2018-11-18 23:03:48,487 INFO L273 TraceCheckUtils]: 29: Hoare triple {32181#true} assume #t~mem1 == ~value;havoc #t~mem1;#res := 1; {32181#true} is VALID [2018-11-18 23:03:48,487 INFO L273 TraceCheckUtils]: 30: Hoare triple {32181#true} assume true; {32181#true} is VALID [2018-11-18 23:03:48,489 INFO L268 TraceCheckUtils]: 31: Hoare quadruple {32181#true} {32183#(<= 100000 ~SIZE~0)} #132#return; {32183#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:03:48,489 INFO L273 TraceCheckUtils]: 32: Hoare triple {32183#(<= 100000 ~SIZE~0)} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {32183#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:03:48,490 INFO L273 TraceCheckUtils]: 33: Hoare triple {32183#(<= 100000 ~SIZE~0)} assume !(1 != #t~ret4);havoc #t~mem3;havoc #t~ret4; {32183#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:03:48,490 INFO L273 TraceCheckUtils]: 34: Hoare triple {32183#(<= 100000 ~SIZE~0)} #t~post2 := ~v~0;~v~0 := 1 + #t~post2;havoc #t~post2; {32183#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:03:48,490 INFO L273 TraceCheckUtils]: 35: Hoare triple {32183#(<= 100000 ~SIZE~0)} assume true; {32183#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:03:48,491 INFO L273 TraceCheckUtils]: 36: Hoare triple {32183#(<= 100000 ~SIZE~0)} assume !!(~v~0 < ~SIZE~0);call #t~mem3 := read~int(~#values~0.base, ~#values~0.offset + 4 * ~v~0, 4); {32183#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:03:48,491 INFO L256 TraceCheckUtils]: 37: Hoare triple {32183#(<= 100000 ~SIZE~0)} call #t~ret4 := elem_exists(~#set~0.base, ~#set~0.offset, ~n~0, #t~mem3); {32181#true} is VALID [2018-11-18 23:03:48,491 INFO L273 TraceCheckUtils]: 38: Hoare triple {32181#true} ~set.base, ~set.offset := #in~set.base, #in~set.offset;~size := #in~size;~value := #in~value;havoc ~i~0;~i~0 := 0; {32181#true} is VALID [2018-11-18 23:03:48,491 INFO L273 TraceCheckUtils]: 39: Hoare triple {32181#true} assume true; {32181#true} is VALID [2018-11-18 23:03:48,491 INFO L273 TraceCheckUtils]: 40: Hoare triple {32181#true} assume !!(~i~0 < ~size);call #t~mem1 := read~int(~set.base, ~set.offset + 4 * ~i~0, 4); {32181#true} is VALID [2018-11-18 23:03:48,491 INFO L273 TraceCheckUtils]: 41: Hoare triple {32181#true} assume #t~mem1 == ~value;havoc #t~mem1;#res := 1; {32181#true} is VALID [2018-11-18 23:03:48,491 INFO L273 TraceCheckUtils]: 42: Hoare triple {32181#true} assume true; {32181#true} is VALID [2018-11-18 23:03:48,493 INFO L268 TraceCheckUtils]: 43: Hoare quadruple {32181#true} {32183#(<= 100000 ~SIZE~0)} #132#return; {32183#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:03:48,493 INFO L273 TraceCheckUtils]: 44: Hoare triple {32183#(<= 100000 ~SIZE~0)} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {32183#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:03:48,493 INFO L273 TraceCheckUtils]: 45: Hoare triple {32183#(<= 100000 ~SIZE~0)} assume !(1 != #t~ret4);havoc #t~mem3;havoc #t~ret4; {32183#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:03:48,494 INFO L273 TraceCheckUtils]: 46: Hoare triple {32183#(<= 100000 ~SIZE~0)} #t~post2 := ~v~0;~v~0 := 1 + #t~post2;havoc #t~post2; {32183#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:03:48,494 INFO L273 TraceCheckUtils]: 47: Hoare triple {32183#(<= 100000 ~SIZE~0)} assume true; {32183#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:03:48,495 INFO L273 TraceCheckUtils]: 48: Hoare triple {32183#(<= 100000 ~SIZE~0)} assume !!(~v~0 < ~SIZE~0);call #t~mem3 := read~int(~#values~0.base, ~#values~0.offset + 4 * ~v~0, 4); {32183#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:03:48,495 INFO L256 TraceCheckUtils]: 49: Hoare triple {32183#(<= 100000 ~SIZE~0)} call #t~ret4 := elem_exists(~#set~0.base, ~#set~0.offset, ~n~0, #t~mem3); {32181#true} is VALID [2018-11-18 23:03:48,495 INFO L273 TraceCheckUtils]: 50: Hoare triple {32181#true} ~set.base, ~set.offset := #in~set.base, #in~set.offset;~size := #in~size;~value := #in~value;havoc ~i~0;~i~0 := 0; {32181#true} is VALID [2018-11-18 23:03:48,496 INFO L273 TraceCheckUtils]: 51: Hoare triple {32181#true} assume true; {32181#true} is VALID [2018-11-18 23:03:48,496 INFO L273 TraceCheckUtils]: 52: Hoare triple {32181#true} assume !!(~i~0 < ~size);call #t~mem1 := read~int(~set.base, ~set.offset + 4 * ~i~0, 4); {32181#true} is VALID [2018-11-18 23:03:48,496 INFO L273 TraceCheckUtils]: 53: Hoare triple {32181#true} assume #t~mem1 == ~value;havoc #t~mem1;#res := 1; {32181#true} is VALID [2018-11-18 23:03:48,496 INFO L273 TraceCheckUtils]: 54: Hoare triple {32181#true} assume true; {32181#true} is VALID [2018-11-18 23:03:48,498 INFO L268 TraceCheckUtils]: 55: Hoare quadruple {32181#true} {32183#(<= 100000 ~SIZE~0)} #132#return; {32183#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:03:48,498 INFO L273 TraceCheckUtils]: 56: Hoare triple {32183#(<= 100000 ~SIZE~0)} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {32183#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:03:48,499 INFO L273 TraceCheckUtils]: 57: Hoare triple {32183#(<= 100000 ~SIZE~0)} assume !(1 != #t~ret4);havoc #t~mem3;havoc #t~ret4; {32183#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:03:48,499 INFO L273 TraceCheckUtils]: 58: Hoare triple {32183#(<= 100000 ~SIZE~0)} #t~post2 := ~v~0;~v~0 := 1 + #t~post2;havoc #t~post2; {32183#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:03:48,499 INFO L273 TraceCheckUtils]: 59: Hoare triple {32183#(<= 100000 ~SIZE~0)} assume true; {32183#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:03:48,499 INFO L273 TraceCheckUtils]: 60: Hoare triple {32183#(<= 100000 ~SIZE~0)} assume !!(~v~0 < ~SIZE~0);call #t~mem3 := read~int(~#values~0.base, ~#values~0.offset + 4 * ~v~0, 4); {32183#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:03:48,500 INFO L256 TraceCheckUtils]: 61: Hoare triple {32183#(<= 100000 ~SIZE~0)} call #t~ret4 := elem_exists(~#set~0.base, ~#set~0.offset, ~n~0, #t~mem3); {32181#true} is VALID [2018-11-18 23:03:48,500 INFO L273 TraceCheckUtils]: 62: Hoare triple {32181#true} ~set.base, ~set.offset := #in~set.base, #in~set.offset;~size := #in~size;~value := #in~value;havoc ~i~0;~i~0 := 0; {32181#true} is VALID [2018-11-18 23:03:48,500 INFO L273 TraceCheckUtils]: 63: Hoare triple {32181#true} assume true; {32181#true} is VALID [2018-11-18 23:03:48,500 INFO L273 TraceCheckUtils]: 64: Hoare triple {32181#true} assume !!(~i~0 < ~size);call #t~mem1 := read~int(~set.base, ~set.offset + 4 * ~i~0, 4); {32181#true} is VALID [2018-11-18 23:03:48,500 INFO L273 TraceCheckUtils]: 65: Hoare triple {32181#true} assume #t~mem1 == ~value;havoc #t~mem1;#res := 1; {32181#true} is VALID [2018-11-18 23:03:48,500 INFO L273 TraceCheckUtils]: 66: Hoare triple {32181#true} assume true; {32181#true} is VALID [2018-11-18 23:03:48,501 INFO L268 TraceCheckUtils]: 67: Hoare quadruple {32181#true} {32183#(<= 100000 ~SIZE~0)} #132#return; {32183#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:03:48,502 INFO L273 TraceCheckUtils]: 68: Hoare triple {32183#(<= 100000 ~SIZE~0)} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {32183#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:03:48,502 INFO L273 TraceCheckUtils]: 69: Hoare triple {32183#(<= 100000 ~SIZE~0)} assume !(1 != #t~ret4);havoc #t~mem3;havoc #t~ret4; {32183#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:03:48,502 INFO L273 TraceCheckUtils]: 70: Hoare triple {32183#(<= 100000 ~SIZE~0)} #t~post2 := ~v~0;~v~0 := 1 + #t~post2;havoc #t~post2; {32183#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:03:48,503 INFO L273 TraceCheckUtils]: 71: Hoare triple {32183#(<= 100000 ~SIZE~0)} assume true; {32183#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:03:48,503 INFO L273 TraceCheckUtils]: 72: Hoare triple {32183#(<= 100000 ~SIZE~0)} assume !!(~v~0 < ~SIZE~0);call #t~mem3 := read~int(~#values~0.base, ~#values~0.offset + 4 * ~v~0, 4); {32183#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:03:48,503 INFO L256 TraceCheckUtils]: 73: Hoare triple {32183#(<= 100000 ~SIZE~0)} call #t~ret4 := elem_exists(~#set~0.base, ~#set~0.offset, ~n~0, #t~mem3); {32181#true} is VALID [2018-11-18 23:03:48,504 INFO L273 TraceCheckUtils]: 74: Hoare triple {32181#true} ~set.base, ~set.offset := #in~set.base, #in~set.offset;~size := #in~size;~value := #in~value;havoc ~i~0;~i~0 := 0; {32181#true} is VALID [2018-11-18 23:03:48,504 INFO L273 TraceCheckUtils]: 75: Hoare triple {32181#true} assume true; {32181#true} is VALID [2018-11-18 23:03:48,504 INFO L273 TraceCheckUtils]: 76: Hoare triple {32181#true} assume !!(~i~0 < ~size);call #t~mem1 := read~int(~set.base, ~set.offset + 4 * ~i~0, 4); {32181#true} is VALID [2018-11-18 23:03:48,504 INFO L273 TraceCheckUtils]: 77: Hoare triple {32181#true} assume #t~mem1 == ~value;havoc #t~mem1;#res := 1; {32181#true} is VALID [2018-11-18 23:03:48,504 INFO L273 TraceCheckUtils]: 78: Hoare triple {32181#true} assume true; {32181#true} is VALID [2018-11-18 23:03:48,506 INFO L268 TraceCheckUtils]: 79: Hoare quadruple {32181#true} {32183#(<= 100000 ~SIZE~0)} #132#return; {32183#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:03:48,507 INFO L273 TraceCheckUtils]: 80: Hoare triple {32183#(<= 100000 ~SIZE~0)} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {32183#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:03:48,507 INFO L273 TraceCheckUtils]: 81: Hoare triple {32183#(<= 100000 ~SIZE~0)} assume !(1 != #t~ret4);havoc #t~mem3;havoc #t~ret4; {32183#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:03:48,508 INFO L273 TraceCheckUtils]: 82: Hoare triple {32183#(<= 100000 ~SIZE~0)} #t~post2 := ~v~0;~v~0 := 1 + #t~post2;havoc #t~post2; {32183#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:03:48,508 INFO L273 TraceCheckUtils]: 83: Hoare triple {32183#(<= 100000 ~SIZE~0)} assume true; {32183#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:03:48,509 INFO L273 TraceCheckUtils]: 84: Hoare triple {32183#(<= 100000 ~SIZE~0)} assume !!(~v~0 < ~SIZE~0);call #t~mem3 := read~int(~#values~0.base, ~#values~0.offset + 4 * ~v~0, 4); {32183#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:03:48,509 INFO L256 TraceCheckUtils]: 85: Hoare triple {32183#(<= 100000 ~SIZE~0)} call #t~ret4 := elem_exists(~#set~0.base, ~#set~0.offset, ~n~0, #t~mem3); {32181#true} is VALID [2018-11-18 23:03:48,509 INFO L273 TraceCheckUtils]: 86: Hoare triple {32181#true} ~set.base, ~set.offset := #in~set.base, #in~set.offset;~size := #in~size;~value := #in~value;havoc ~i~0;~i~0 := 0; {32181#true} is VALID [2018-11-18 23:03:48,509 INFO L273 TraceCheckUtils]: 87: Hoare triple {32181#true} assume true; {32181#true} is VALID [2018-11-18 23:03:48,509 INFO L273 TraceCheckUtils]: 88: Hoare triple {32181#true} assume !!(~i~0 < ~size);call #t~mem1 := read~int(~set.base, ~set.offset + 4 * ~i~0, 4); {32181#true} is VALID [2018-11-18 23:03:48,510 INFO L273 TraceCheckUtils]: 89: Hoare triple {32181#true} assume #t~mem1 == ~value;havoc #t~mem1;#res := 1; {32181#true} is VALID [2018-11-18 23:03:48,510 INFO L273 TraceCheckUtils]: 90: Hoare triple {32181#true} assume true; {32181#true} is VALID [2018-11-18 23:03:48,512 INFO L268 TraceCheckUtils]: 91: Hoare quadruple {32181#true} {32183#(<= 100000 ~SIZE~0)} #132#return; {32183#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:03:48,512 INFO L273 TraceCheckUtils]: 92: Hoare triple {32183#(<= 100000 ~SIZE~0)} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {32183#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:03:48,513 INFO L273 TraceCheckUtils]: 93: Hoare triple {32183#(<= 100000 ~SIZE~0)} assume !(1 != #t~ret4);havoc #t~mem3;havoc #t~ret4; {32183#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:03:48,513 INFO L273 TraceCheckUtils]: 94: Hoare triple {32183#(<= 100000 ~SIZE~0)} #t~post2 := ~v~0;~v~0 := 1 + #t~post2;havoc #t~post2; {32183#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:03:48,513 INFO L273 TraceCheckUtils]: 95: Hoare triple {32183#(<= 100000 ~SIZE~0)} assume true; {32183#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:03:48,514 INFO L273 TraceCheckUtils]: 96: Hoare triple {32183#(<= 100000 ~SIZE~0)} assume !!(~v~0 < ~SIZE~0);call #t~mem3 := read~int(~#values~0.base, ~#values~0.offset + 4 * ~v~0, 4); {32183#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:03:48,514 INFO L256 TraceCheckUtils]: 97: Hoare triple {32183#(<= 100000 ~SIZE~0)} call #t~ret4 := elem_exists(~#set~0.base, ~#set~0.offset, ~n~0, #t~mem3); {32181#true} is VALID [2018-11-18 23:03:48,514 INFO L273 TraceCheckUtils]: 98: Hoare triple {32181#true} ~set.base, ~set.offset := #in~set.base, #in~set.offset;~size := #in~size;~value := #in~value;havoc ~i~0;~i~0 := 0; {32181#true} is VALID [2018-11-18 23:03:48,514 INFO L273 TraceCheckUtils]: 99: Hoare triple {32181#true} assume true; {32181#true} is VALID [2018-11-18 23:03:48,514 INFO L273 TraceCheckUtils]: 100: Hoare triple {32181#true} assume !!(~i~0 < ~size);call #t~mem1 := read~int(~set.base, ~set.offset + 4 * ~i~0, 4); {32181#true} is VALID [2018-11-18 23:03:48,514 INFO L273 TraceCheckUtils]: 101: Hoare triple {32181#true} assume #t~mem1 == ~value;havoc #t~mem1;#res := 1; {32181#true} is VALID [2018-11-18 23:03:48,514 INFO L273 TraceCheckUtils]: 102: Hoare triple {32181#true} assume true; {32181#true} is VALID [2018-11-18 23:03:48,516 INFO L268 TraceCheckUtils]: 103: Hoare quadruple {32181#true} {32183#(<= 100000 ~SIZE~0)} #132#return; {32183#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:03:48,517 INFO L273 TraceCheckUtils]: 104: Hoare triple {32183#(<= 100000 ~SIZE~0)} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {32183#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:03:48,517 INFO L273 TraceCheckUtils]: 105: Hoare triple {32183#(<= 100000 ~SIZE~0)} assume !(1 != #t~ret4);havoc #t~mem3;havoc #t~ret4; {32183#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:03:48,518 INFO L273 TraceCheckUtils]: 106: Hoare triple {32183#(<= 100000 ~SIZE~0)} #t~post2 := ~v~0;~v~0 := 1 + #t~post2;havoc #t~post2; {32183#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:03:48,518 INFO L273 TraceCheckUtils]: 107: Hoare triple {32183#(<= 100000 ~SIZE~0)} assume true; {32183#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:03:48,519 INFO L273 TraceCheckUtils]: 108: Hoare triple {32183#(<= 100000 ~SIZE~0)} assume !!(~v~0 < ~SIZE~0);call #t~mem3 := read~int(~#values~0.base, ~#values~0.offset + 4 * ~v~0, 4); {32183#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:03:48,519 INFO L256 TraceCheckUtils]: 109: Hoare triple {32183#(<= 100000 ~SIZE~0)} call #t~ret4 := elem_exists(~#set~0.base, ~#set~0.offset, ~n~0, #t~mem3); {32181#true} is VALID [2018-11-18 23:03:48,519 INFO L273 TraceCheckUtils]: 110: Hoare triple {32181#true} ~set.base, ~set.offset := #in~set.base, #in~set.offset;~size := #in~size;~value := #in~value;havoc ~i~0;~i~0 := 0; {32181#true} is VALID [2018-11-18 23:03:48,519 INFO L273 TraceCheckUtils]: 111: Hoare triple {32181#true} assume true; {32181#true} is VALID [2018-11-18 23:03:48,519 INFO L273 TraceCheckUtils]: 112: Hoare triple {32181#true} assume !!(~i~0 < ~size);call #t~mem1 := read~int(~set.base, ~set.offset + 4 * ~i~0, 4); {32181#true} is VALID [2018-11-18 23:03:48,520 INFO L273 TraceCheckUtils]: 113: Hoare triple {32181#true} assume #t~mem1 == ~value;havoc #t~mem1;#res := 1; {32181#true} is VALID [2018-11-18 23:03:48,520 INFO L273 TraceCheckUtils]: 114: Hoare triple {32181#true} assume true; {32181#true} is VALID [2018-11-18 23:03:48,522 INFO L268 TraceCheckUtils]: 115: Hoare quadruple {32181#true} {32183#(<= 100000 ~SIZE~0)} #132#return; {32183#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:03:48,522 INFO L273 TraceCheckUtils]: 116: Hoare triple {32183#(<= 100000 ~SIZE~0)} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {32183#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:03:48,523 INFO L273 TraceCheckUtils]: 117: Hoare triple {32183#(<= 100000 ~SIZE~0)} assume !(1 != #t~ret4);havoc #t~mem3;havoc #t~ret4; {32183#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:03:48,523 INFO L273 TraceCheckUtils]: 118: Hoare triple {32183#(<= 100000 ~SIZE~0)} #t~post2 := ~v~0;~v~0 := 1 + #t~post2;havoc #t~post2; {32183#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:03:48,524 INFO L273 TraceCheckUtils]: 119: Hoare triple {32183#(<= 100000 ~SIZE~0)} assume true; {32183#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:03:48,524 INFO L273 TraceCheckUtils]: 120: Hoare triple {32183#(<= 100000 ~SIZE~0)} assume !!(~v~0 < ~SIZE~0);call #t~mem3 := read~int(~#values~0.base, ~#values~0.offset + 4 * ~v~0, 4); {32183#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:03:48,524 INFO L256 TraceCheckUtils]: 121: Hoare triple {32183#(<= 100000 ~SIZE~0)} call #t~ret4 := elem_exists(~#set~0.base, ~#set~0.offset, ~n~0, #t~mem3); {32181#true} is VALID [2018-11-18 23:03:48,525 INFO L273 TraceCheckUtils]: 122: Hoare triple {32181#true} ~set.base, ~set.offset := #in~set.base, #in~set.offset;~size := #in~size;~value := #in~value;havoc ~i~0;~i~0 := 0; {32181#true} is VALID [2018-11-18 23:03:48,525 INFO L273 TraceCheckUtils]: 123: Hoare triple {32181#true} assume true; {32181#true} is VALID [2018-11-18 23:03:48,525 INFO L273 TraceCheckUtils]: 124: Hoare triple {32181#true} assume !!(~i~0 < ~size);call #t~mem1 := read~int(~set.base, ~set.offset + 4 * ~i~0, 4); {32181#true} is VALID [2018-11-18 23:03:48,525 INFO L273 TraceCheckUtils]: 125: Hoare triple {32181#true} assume #t~mem1 == ~value;havoc #t~mem1;#res := 1; {32181#true} is VALID [2018-11-18 23:03:48,525 INFO L273 TraceCheckUtils]: 126: Hoare triple {32181#true} assume true; {32181#true} is VALID [2018-11-18 23:03:48,527 INFO L268 TraceCheckUtils]: 127: Hoare quadruple {32181#true} {32183#(<= 100000 ~SIZE~0)} #132#return; {32183#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:03:48,528 INFO L273 TraceCheckUtils]: 128: Hoare triple {32183#(<= 100000 ~SIZE~0)} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {32183#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:03:48,528 INFO L273 TraceCheckUtils]: 129: Hoare triple {32183#(<= 100000 ~SIZE~0)} assume !(1 != #t~ret4);havoc #t~mem3;havoc #t~ret4; {32183#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:03:48,529 INFO L273 TraceCheckUtils]: 130: Hoare triple {32183#(<= 100000 ~SIZE~0)} #t~post2 := ~v~0;~v~0 := 1 + #t~post2;havoc #t~post2; {32183#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:03:48,529 INFO L273 TraceCheckUtils]: 131: Hoare triple {32183#(<= 100000 ~SIZE~0)} assume true; {32183#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:03:48,530 INFO L273 TraceCheckUtils]: 132: Hoare triple {32183#(<= 100000 ~SIZE~0)} assume !!(~v~0 < ~SIZE~0);call #t~mem3 := read~int(~#values~0.base, ~#values~0.offset + 4 * ~v~0, 4); {32183#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:03:48,530 INFO L256 TraceCheckUtils]: 133: Hoare triple {32183#(<= 100000 ~SIZE~0)} call #t~ret4 := elem_exists(~#set~0.base, ~#set~0.offset, ~n~0, #t~mem3); {32181#true} is VALID [2018-11-18 23:03:48,530 INFO L273 TraceCheckUtils]: 134: Hoare triple {32181#true} ~set.base, ~set.offset := #in~set.base, #in~set.offset;~size := #in~size;~value := #in~value;havoc ~i~0;~i~0 := 0; {32181#true} is VALID [2018-11-18 23:03:48,530 INFO L273 TraceCheckUtils]: 135: Hoare triple {32181#true} assume true; {32181#true} is VALID [2018-11-18 23:03:48,530 INFO L273 TraceCheckUtils]: 136: Hoare triple {32181#true} assume !!(~i~0 < ~size);call #t~mem1 := read~int(~set.base, ~set.offset + 4 * ~i~0, 4); {32181#true} is VALID [2018-11-18 23:03:48,531 INFO L273 TraceCheckUtils]: 137: Hoare triple {32181#true} assume #t~mem1 == ~value;havoc #t~mem1;#res := 1; {32181#true} is VALID [2018-11-18 23:03:48,531 INFO L273 TraceCheckUtils]: 138: Hoare triple {32181#true} assume true; {32181#true} is VALID [2018-11-18 23:03:48,532 INFO L268 TraceCheckUtils]: 139: Hoare quadruple {32181#true} {32183#(<= 100000 ~SIZE~0)} #132#return; {32183#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:03:48,533 INFO L273 TraceCheckUtils]: 140: Hoare triple {32183#(<= 100000 ~SIZE~0)} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {32183#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:03:48,533 INFO L273 TraceCheckUtils]: 141: Hoare triple {32183#(<= 100000 ~SIZE~0)} assume !(1 != #t~ret4);havoc #t~mem3;havoc #t~ret4; {32183#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:03:48,533 INFO L273 TraceCheckUtils]: 142: Hoare triple {32183#(<= 100000 ~SIZE~0)} #t~post2 := ~v~0;~v~0 := 1 + #t~post2;havoc #t~post2; {32183#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:03:48,534 INFO L273 TraceCheckUtils]: 143: Hoare triple {32183#(<= 100000 ~SIZE~0)} assume true; {32183#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:03:48,534 INFO L273 TraceCheckUtils]: 144: Hoare triple {32183#(<= 100000 ~SIZE~0)} assume !!(~v~0 < ~SIZE~0);call #t~mem3 := read~int(~#values~0.base, ~#values~0.offset + 4 * ~v~0, 4); {32183#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:03:48,534 INFO L256 TraceCheckUtils]: 145: Hoare triple {32183#(<= 100000 ~SIZE~0)} call #t~ret4 := elem_exists(~#set~0.base, ~#set~0.offset, ~n~0, #t~mem3); {32181#true} is VALID [2018-11-18 23:03:48,534 INFO L273 TraceCheckUtils]: 146: Hoare triple {32181#true} ~set.base, ~set.offset := #in~set.base, #in~set.offset;~size := #in~size;~value := #in~value;havoc ~i~0;~i~0 := 0; {32181#true} is VALID [2018-11-18 23:03:48,534 INFO L273 TraceCheckUtils]: 147: Hoare triple {32181#true} assume true; {32181#true} is VALID [2018-11-18 23:03:48,535 INFO L273 TraceCheckUtils]: 148: Hoare triple {32181#true} assume !!(~i~0 < ~size);call #t~mem1 := read~int(~set.base, ~set.offset + 4 * ~i~0, 4); {32181#true} is VALID [2018-11-18 23:03:48,535 INFO L273 TraceCheckUtils]: 149: Hoare triple {32181#true} assume #t~mem1 == ~value;havoc #t~mem1;#res := 1; {32181#true} is VALID [2018-11-18 23:03:48,535 INFO L273 TraceCheckUtils]: 150: Hoare triple {32181#true} assume true; {32181#true} is VALID [2018-11-18 23:03:48,537 INFO L268 TraceCheckUtils]: 151: Hoare quadruple {32181#true} {32183#(<= 100000 ~SIZE~0)} #132#return; {32183#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:03:48,537 INFO L273 TraceCheckUtils]: 152: Hoare triple {32183#(<= 100000 ~SIZE~0)} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {32183#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:03:48,538 INFO L273 TraceCheckUtils]: 153: Hoare triple {32183#(<= 100000 ~SIZE~0)} assume !(1 != #t~ret4);havoc #t~mem3;havoc #t~ret4; {32183#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:03:48,538 INFO L273 TraceCheckUtils]: 154: Hoare triple {32183#(<= 100000 ~SIZE~0)} #t~post2 := ~v~0;~v~0 := 1 + #t~post2;havoc #t~post2; {32183#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:03:48,538 INFO L273 TraceCheckUtils]: 155: Hoare triple {32183#(<= 100000 ~SIZE~0)} assume true; {32183#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:03:48,538 INFO L273 TraceCheckUtils]: 156: Hoare triple {32183#(<= 100000 ~SIZE~0)} assume !!(~v~0 < ~SIZE~0);call #t~mem3 := read~int(~#values~0.base, ~#values~0.offset + 4 * ~v~0, 4); {32183#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:03:48,539 INFO L256 TraceCheckUtils]: 157: Hoare triple {32183#(<= 100000 ~SIZE~0)} call #t~ret4 := elem_exists(~#set~0.base, ~#set~0.offset, ~n~0, #t~mem3); {32181#true} is VALID [2018-11-18 23:03:48,539 INFO L273 TraceCheckUtils]: 158: Hoare triple {32181#true} ~set.base, ~set.offset := #in~set.base, #in~set.offset;~size := #in~size;~value := #in~value;havoc ~i~0;~i~0 := 0; {32181#true} is VALID [2018-11-18 23:03:48,539 INFO L273 TraceCheckUtils]: 159: Hoare triple {32181#true} assume true; {32181#true} is VALID [2018-11-18 23:03:48,539 INFO L273 TraceCheckUtils]: 160: Hoare triple {32181#true} assume !!(~i~0 < ~size);call #t~mem1 := read~int(~set.base, ~set.offset + 4 * ~i~0, 4); {32181#true} is VALID [2018-11-18 23:03:48,539 INFO L273 TraceCheckUtils]: 161: Hoare triple {32181#true} assume #t~mem1 == ~value;havoc #t~mem1;#res := 1; {32181#true} is VALID [2018-11-18 23:03:48,539 INFO L273 TraceCheckUtils]: 162: Hoare triple {32181#true} assume true; {32181#true} is VALID [2018-11-18 23:03:48,541 INFO L268 TraceCheckUtils]: 163: Hoare quadruple {32181#true} {32183#(<= 100000 ~SIZE~0)} #132#return; {32183#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:03:48,541 INFO L273 TraceCheckUtils]: 164: Hoare triple {32183#(<= 100000 ~SIZE~0)} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {32183#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:03:48,542 INFO L273 TraceCheckUtils]: 165: Hoare triple {32183#(<= 100000 ~SIZE~0)} assume !(1 != #t~ret4);havoc #t~mem3;havoc #t~ret4; {32183#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:03:48,542 INFO L273 TraceCheckUtils]: 166: Hoare triple {32183#(<= 100000 ~SIZE~0)} #t~post2 := ~v~0;~v~0 := 1 + #t~post2;havoc #t~post2; {32183#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:03:48,543 INFO L273 TraceCheckUtils]: 167: Hoare triple {32183#(<= 100000 ~SIZE~0)} assume true; {32183#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:03:48,543 INFO L273 TraceCheckUtils]: 168: Hoare triple {32183#(<= 100000 ~SIZE~0)} assume !!(~v~0 < ~SIZE~0);call #t~mem3 := read~int(~#values~0.base, ~#values~0.offset + 4 * ~v~0, 4); {32183#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:03:48,543 INFO L256 TraceCheckUtils]: 169: Hoare triple {32183#(<= 100000 ~SIZE~0)} call #t~ret4 := elem_exists(~#set~0.base, ~#set~0.offset, ~n~0, #t~mem3); {32181#true} is VALID [2018-11-18 23:03:48,544 INFO L273 TraceCheckUtils]: 170: Hoare triple {32181#true} ~set.base, ~set.offset := #in~set.base, #in~set.offset;~size := #in~size;~value := #in~value;havoc ~i~0;~i~0 := 0; {32181#true} is VALID [2018-11-18 23:03:48,544 INFO L273 TraceCheckUtils]: 171: Hoare triple {32181#true} assume true; {32181#true} is VALID [2018-11-18 23:03:48,544 INFO L273 TraceCheckUtils]: 172: Hoare triple {32181#true} assume !!(~i~0 < ~size);call #t~mem1 := read~int(~set.base, ~set.offset + 4 * ~i~0, 4); {32181#true} is VALID [2018-11-18 23:03:48,544 INFO L273 TraceCheckUtils]: 173: Hoare triple {32181#true} assume #t~mem1 == ~value;havoc #t~mem1;#res := 1; {32181#true} is VALID [2018-11-18 23:03:48,544 INFO L273 TraceCheckUtils]: 174: Hoare triple {32181#true} assume true; {32181#true} is VALID [2018-11-18 23:03:48,546 INFO L268 TraceCheckUtils]: 175: Hoare quadruple {32181#true} {32183#(<= 100000 ~SIZE~0)} #132#return; {32183#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:03:48,547 INFO L273 TraceCheckUtils]: 176: Hoare triple {32183#(<= 100000 ~SIZE~0)} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {32183#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:03:48,547 INFO L273 TraceCheckUtils]: 177: Hoare triple {32183#(<= 100000 ~SIZE~0)} assume !(1 != #t~ret4);havoc #t~mem3;havoc #t~ret4; {32183#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:03:48,548 INFO L273 TraceCheckUtils]: 178: Hoare triple {32183#(<= 100000 ~SIZE~0)} #t~post2 := ~v~0;~v~0 := 1 + #t~post2;havoc #t~post2; {32183#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:03:48,548 INFO L273 TraceCheckUtils]: 179: Hoare triple {32183#(<= 100000 ~SIZE~0)} assume true; {32183#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:03:48,549 INFO L273 TraceCheckUtils]: 180: Hoare triple {32183#(<= 100000 ~SIZE~0)} assume !!(~v~0 < ~SIZE~0);call #t~mem3 := read~int(~#values~0.base, ~#values~0.offset + 4 * ~v~0, 4); {32183#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:03:48,549 INFO L256 TraceCheckUtils]: 181: Hoare triple {32183#(<= 100000 ~SIZE~0)} call #t~ret4 := elem_exists(~#set~0.base, ~#set~0.offset, ~n~0, #t~mem3); {32181#true} is VALID [2018-11-18 23:03:48,549 INFO L273 TraceCheckUtils]: 182: Hoare triple {32181#true} ~set.base, ~set.offset := #in~set.base, #in~set.offset;~size := #in~size;~value := #in~value;havoc ~i~0;~i~0 := 0; {32181#true} is VALID [2018-11-18 23:03:48,549 INFO L273 TraceCheckUtils]: 183: Hoare triple {32181#true} assume true; {32181#true} is VALID [2018-11-18 23:03:48,550 INFO L273 TraceCheckUtils]: 184: Hoare triple {32181#true} assume !!(~i~0 < ~size);call #t~mem1 := read~int(~set.base, ~set.offset + 4 * ~i~0, 4); {32181#true} is VALID [2018-11-18 23:03:48,550 INFO L273 TraceCheckUtils]: 185: Hoare triple {32181#true} assume #t~mem1 == ~value;havoc #t~mem1;#res := 1; {32181#true} is VALID [2018-11-18 23:03:48,550 INFO L273 TraceCheckUtils]: 186: Hoare triple {32181#true} assume true; {32181#true} is VALID [2018-11-18 23:03:48,552 INFO L268 TraceCheckUtils]: 187: Hoare quadruple {32181#true} {32183#(<= 100000 ~SIZE~0)} #132#return; {32183#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:03:48,553 INFO L273 TraceCheckUtils]: 188: Hoare triple {32183#(<= 100000 ~SIZE~0)} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {32183#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:03:48,553 INFO L273 TraceCheckUtils]: 189: Hoare triple {32183#(<= 100000 ~SIZE~0)} assume !(1 != #t~ret4);havoc #t~mem3;havoc #t~ret4; {32183#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:03:48,553 INFO L273 TraceCheckUtils]: 190: Hoare triple {32183#(<= 100000 ~SIZE~0)} #t~post2 := ~v~0;~v~0 := 1 + #t~post2;havoc #t~post2; {32183#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:03:48,554 INFO L273 TraceCheckUtils]: 191: Hoare triple {32183#(<= 100000 ~SIZE~0)} assume true; {32183#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:03:48,554 INFO L273 TraceCheckUtils]: 192: Hoare triple {32183#(<= 100000 ~SIZE~0)} assume !!(~v~0 < ~SIZE~0);call #t~mem3 := read~int(~#values~0.base, ~#values~0.offset + 4 * ~v~0, 4); {32183#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:03:48,554 INFO L256 TraceCheckUtils]: 193: Hoare triple {32183#(<= 100000 ~SIZE~0)} call #t~ret4 := elem_exists(~#set~0.base, ~#set~0.offset, ~n~0, #t~mem3); {32181#true} is VALID [2018-11-18 23:03:48,554 INFO L273 TraceCheckUtils]: 194: Hoare triple {32181#true} ~set.base, ~set.offset := #in~set.base, #in~set.offset;~size := #in~size;~value := #in~value;havoc ~i~0;~i~0 := 0; {32181#true} is VALID [2018-11-18 23:03:48,554 INFO L273 TraceCheckUtils]: 195: Hoare triple {32181#true} assume true; {32181#true} is VALID [2018-11-18 23:03:48,554 INFO L273 TraceCheckUtils]: 196: Hoare triple {32181#true} assume !!(~i~0 < ~size);call #t~mem1 := read~int(~set.base, ~set.offset + 4 * ~i~0, 4); {32181#true} is VALID [2018-11-18 23:03:48,555 INFO L273 TraceCheckUtils]: 197: Hoare triple {32181#true} assume #t~mem1 == ~value;havoc #t~mem1;#res := 1; {32181#true} is VALID [2018-11-18 23:03:48,555 INFO L273 TraceCheckUtils]: 198: Hoare triple {32181#true} assume true; {32181#true} is VALID [2018-11-18 23:03:48,556 INFO L268 TraceCheckUtils]: 199: Hoare quadruple {32181#true} {32183#(<= 100000 ~SIZE~0)} #132#return; {32183#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:03:48,556 INFO L273 TraceCheckUtils]: 200: Hoare triple {32183#(<= 100000 ~SIZE~0)} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {32183#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:03:48,557 INFO L273 TraceCheckUtils]: 201: Hoare triple {32183#(<= 100000 ~SIZE~0)} assume !(1 != #t~ret4);havoc #t~mem3;havoc #t~ret4; {32183#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:03:48,557 INFO L273 TraceCheckUtils]: 202: Hoare triple {32183#(<= 100000 ~SIZE~0)} #t~post2 := ~v~0;~v~0 := 1 + #t~post2;havoc #t~post2; {32183#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:03:48,558 INFO L273 TraceCheckUtils]: 203: Hoare triple {32183#(<= 100000 ~SIZE~0)} assume true; {32183#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:03:48,558 INFO L273 TraceCheckUtils]: 204: Hoare triple {32183#(<= 100000 ~SIZE~0)} assume !!(~v~0 < ~SIZE~0);call #t~mem3 := read~int(~#values~0.base, ~#values~0.offset + 4 * ~v~0, 4); {32183#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:03:48,559 INFO L256 TraceCheckUtils]: 205: Hoare triple {32183#(<= 100000 ~SIZE~0)} call #t~ret4 := elem_exists(~#set~0.base, ~#set~0.offset, ~n~0, #t~mem3); {32181#true} is VALID [2018-11-18 23:03:48,559 INFO L273 TraceCheckUtils]: 206: Hoare triple {32181#true} ~set.base, ~set.offset := #in~set.base, #in~set.offset;~size := #in~size;~value := #in~value;havoc ~i~0;~i~0 := 0; {32181#true} is VALID [2018-11-18 23:03:48,559 INFO L273 TraceCheckUtils]: 207: Hoare triple {32181#true} assume true; {32181#true} is VALID [2018-11-18 23:03:48,559 INFO L273 TraceCheckUtils]: 208: Hoare triple {32181#true} assume !!(~i~0 < ~size);call #t~mem1 := read~int(~set.base, ~set.offset + 4 * ~i~0, 4); {32181#true} is VALID [2018-11-18 23:03:48,559 INFO L273 TraceCheckUtils]: 209: Hoare triple {32181#true} assume #t~mem1 == ~value;havoc #t~mem1;#res := 1; {32181#true} is VALID [2018-11-18 23:03:48,560 INFO L273 TraceCheckUtils]: 210: Hoare triple {32181#true} assume true; {32181#true} is VALID [2018-11-18 23:03:48,561 INFO L268 TraceCheckUtils]: 211: Hoare quadruple {32181#true} {32183#(<= 100000 ~SIZE~0)} #132#return; {32183#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:03:48,562 INFO L273 TraceCheckUtils]: 212: Hoare triple {32183#(<= 100000 ~SIZE~0)} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {32183#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:03:48,562 INFO L273 TraceCheckUtils]: 213: Hoare triple {32183#(<= 100000 ~SIZE~0)} assume !(1 != #t~ret4);havoc #t~mem3;havoc #t~ret4; {32183#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:03:48,563 INFO L273 TraceCheckUtils]: 214: Hoare triple {32183#(<= 100000 ~SIZE~0)} #t~post2 := ~v~0;~v~0 := 1 + #t~post2;havoc #t~post2; {32183#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:03:48,563 INFO L273 TraceCheckUtils]: 215: Hoare triple {32183#(<= 100000 ~SIZE~0)} assume true; {32183#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:03:48,563 INFO L273 TraceCheckUtils]: 216: Hoare triple {32183#(<= 100000 ~SIZE~0)} assume !!(~v~0 < ~SIZE~0);call #t~mem3 := read~int(~#values~0.base, ~#values~0.offset + 4 * ~v~0, 4); {32183#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:03:48,563 INFO L256 TraceCheckUtils]: 217: Hoare triple {32183#(<= 100000 ~SIZE~0)} call #t~ret4 := elem_exists(~#set~0.base, ~#set~0.offset, ~n~0, #t~mem3); {32181#true} is VALID [2018-11-18 23:03:48,563 INFO L273 TraceCheckUtils]: 218: Hoare triple {32181#true} ~set.base, ~set.offset := #in~set.base, #in~set.offset;~size := #in~size;~value := #in~value;havoc ~i~0;~i~0 := 0; {32181#true} is VALID [2018-11-18 23:03:48,564 INFO L273 TraceCheckUtils]: 219: Hoare triple {32181#true} assume true; {32181#true} is VALID [2018-11-18 23:03:48,564 INFO L273 TraceCheckUtils]: 220: Hoare triple {32181#true} assume !!(~i~0 < ~size);call #t~mem1 := read~int(~set.base, ~set.offset + 4 * ~i~0, 4); {32181#true} is VALID [2018-11-18 23:03:48,564 INFO L273 TraceCheckUtils]: 221: Hoare triple {32181#true} assume #t~mem1 == ~value;havoc #t~mem1;#res := 1; {32181#true} is VALID [2018-11-18 23:03:48,564 INFO L273 TraceCheckUtils]: 222: Hoare triple {32181#true} assume true; {32181#true} is VALID [2018-11-18 23:03:48,565 INFO L268 TraceCheckUtils]: 223: Hoare quadruple {32181#true} {32183#(<= 100000 ~SIZE~0)} #132#return; {32183#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:03:48,565 INFO L273 TraceCheckUtils]: 224: Hoare triple {32183#(<= 100000 ~SIZE~0)} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {32183#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:03:48,566 INFO L273 TraceCheckUtils]: 225: Hoare triple {32183#(<= 100000 ~SIZE~0)} assume !(1 != #t~ret4);havoc #t~mem3;havoc #t~ret4; {32183#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:03:48,566 INFO L273 TraceCheckUtils]: 226: Hoare triple {32183#(<= 100000 ~SIZE~0)} #t~post2 := ~v~0;~v~0 := 1 + #t~post2;havoc #t~post2; {32183#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:03:48,566 INFO L273 TraceCheckUtils]: 227: Hoare triple {32183#(<= 100000 ~SIZE~0)} assume true; {32183#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:03:48,567 INFO L273 TraceCheckUtils]: 228: Hoare triple {32183#(<= 100000 ~SIZE~0)} assume !!(~v~0 < ~SIZE~0);call #t~mem3 := read~int(~#values~0.base, ~#values~0.offset + 4 * ~v~0, 4); {32183#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:03:48,567 INFO L256 TraceCheckUtils]: 229: Hoare triple {32183#(<= 100000 ~SIZE~0)} call #t~ret4 := elem_exists(~#set~0.base, ~#set~0.offset, ~n~0, #t~mem3); {32181#true} is VALID [2018-11-18 23:03:48,567 INFO L273 TraceCheckUtils]: 230: Hoare triple {32181#true} ~set.base, ~set.offset := #in~set.base, #in~set.offset;~size := #in~size;~value := #in~value;havoc ~i~0;~i~0 := 0; {32181#true} is VALID [2018-11-18 23:03:48,567 INFO L273 TraceCheckUtils]: 231: Hoare triple {32181#true} assume true; {32181#true} is VALID [2018-11-18 23:03:48,567 INFO L273 TraceCheckUtils]: 232: Hoare triple {32181#true} assume !!(~i~0 < ~size);call #t~mem1 := read~int(~set.base, ~set.offset + 4 * ~i~0, 4); {32181#true} is VALID [2018-11-18 23:03:48,567 INFO L273 TraceCheckUtils]: 233: Hoare triple {32181#true} assume #t~mem1 == ~value;havoc #t~mem1;#res := 1; {32181#true} is VALID [2018-11-18 23:03:48,567 INFO L273 TraceCheckUtils]: 234: Hoare triple {32181#true} assume true; {32181#true} is VALID [2018-11-18 23:03:48,569 INFO L268 TraceCheckUtils]: 235: Hoare quadruple {32181#true} {32183#(<= 100000 ~SIZE~0)} #132#return; {32183#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:03:48,569 INFO L273 TraceCheckUtils]: 236: Hoare triple {32183#(<= 100000 ~SIZE~0)} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {32183#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:03:48,569 INFO L273 TraceCheckUtils]: 237: Hoare triple {32183#(<= 100000 ~SIZE~0)} assume !(1 != #t~ret4);havoc #t~mem3;havoc #t~ret4; {32183#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:03:48,570 INFO L273 TraceCheckUtils]: 238: Hoare triple {32183#(<= 100000 ~SIZE~0)} #t~post2 := ~v~0;~v~0 := 1 + #t~post2;havoc #t~post2; {32183#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:03:48,570 INFO L273 TraceCheckUtils]: 239: Hoare triple {32183#(<= 100000 ~SIZE~0)} assume true; {32183#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:03:48,571 INFO L273 TraceCheckUtils]: 240: Hoare triple {32183#(<= 100000 ~SIZE~0)} assume !(~v~0 < ~SIZE~0); {32183#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:03:48,571 INFO L273 TraceCheckUtils]: 241: Hoare triple {32183#(<= 100000 ~SIZE~0)} ~i~1 := 0; {32184#(and (= 0 main_~i~1) (<= 100000 ~SIZE~0))} is VALID [2018-11-18 23:03:48,572 INFO L273 TraceCheckUtils]: 242: Hoare triple {32184#(and (= 0 main_~i~1) (<= 100000 ~SIZE~0))} assume true; {32184#(and (= 0 main_~i~1) (<= 100000 ~SIZE~0))} is VALID [2018-11-18 23:03:48,573 INFO L273 TraceCheckUtils]: 243: Hoare triple {32184#(and (= 0 main_~i~1) (<= 100000 ~SIZE~0))} assume !!(~i~1 < ~SIZE~0 && 1 != ~found~0);call #t~mem8 := read~int(~#set~0.base, ~#set~0.offset + 4 * ~i~1, 4); {32184#(and (= 0 main_~i~1) (<= 100000 ~SIZE~0))} is VALID [2018-11-18 23:03:48,573 INFO L273 TraceCheckUtils]: 244: Hoare triple {32184#(and (= 0 main_~i~1) (<= 100000 ~SIZE~0))} assume #t~mem8 == ~element~0;havoc #t~mem8;~found~0 := 1;~pos~0 := ~i~1; {32185#(and (= 0 main_~pos~0) (<= 100000 ~SIZE~0))} is VALID [2018-11-18 23:03:48,574 INFO L273 TraceCheckUtils]: 245: Hoare triple {32185#(and (= 0 main_~pos~0) (<= 100000 ~SIZE~0))} #t~post7 := ~i~1;~i~1 := 1 + #t~post7;havoc #t~post7; {32185#(and (= 0 main_~pos~0) (<= 100000 ~SIZE~0))} is VALID [2018-11-18 23:03:48,575 INFO L273 TraceCheckUtils]: 246: Hoare triple {32185#(and (= 0 main_~pos~0) (<= 100000 ~SIZE~0))} assume true; {32185#(and (= 0 main_~pos~0) (<= 100000 ~SIZE~0))} is VALID [2018-11-18 23:03:48,575 INFO L273 TraceCheckUtils]: 247: Hoare triple {32185#(and (= 0 main_~pos~0) (<= 100000 ~SIZE~0))} assume !(~i~1 < ~SIZE~0 && 1 != ~found~0); {32185#(and (= 0 main_~pos~0) (<= 100000 ~SIZE~0))} is VALID [2018-11-18 23:03:48,576 INFO L273 TraceCheckUtils]: 248: Hoare triple {32185#(and (= 0 main_~pos~0) (<= 100000 ~SIZE~0))} assume 1 == ~found~0;~i~1 := ~pos~0; {32184#(and (= 0 main_~i~1) (<= 100000 ~SIZE~0))} is VALID [2018-11-18 23:03:48,577 INFO L273 TraceCheckUtils]: 249: Hoare triple {32184#(and (= 0 main_~i~1) (<= 100000 ~SIZE~0))} assume true; {32184#(and (= 0 main_~i~1) (<= 100000 ~SIZE~0))} is VALID [2018-11-18 23:03:48,578 INFO L273 TraceCheckUtils]: 250: Hoare triple {32184#(and (= 0 main_~i~1) (<= 100000 ~SIZE~0))} assume !!(~i~1 < ~SIZE~0 - 1);call #t~mem10 := read~int(~#set~0.base, ~#set~0.offset + 4 * (1 + ~i~1), 4);call write~int(#t~mem10, ~#set~0.base, ~#set~0.offset + 4 * ~i~1, 4);havoc #t~mem10; {32184#(and (= 0 main_~i~1) (<= 100000 ~SIZE~0))} is VALID [2018-11-18 23:03:48,578 INFO L273 TraceCheckUtils]: 251: Hoare triple {32184#(and (= 0 main_~i~1) (<= 100000 ~SIZE~0))} #t~post9 := ~i~1;~i~1 := 1 + #t~post9;havoc #t~post9; {32186#(<= (+ main_~i~1 99999) ~SIZE~0)} is VALID [2018-11-18 23:03:48,579 INFO L273 TraceCheckUtils]: 252: Hoare triple {32186#(<= (+ main_~i~1 99999) ~SIZE~0)} assume true; {32186#(<= (+ main_~i~1 99999) ~SIZE~0)} is VALID [2018-11-18 23:03:48,579 INFO L273 TraceCheckUtils]: 253: Hoare triple {32186#(<= (+ main_~i~1 99999) ~SIZE~0)} assume !!(~i~1 < ~SIZE~0 - 1);call #t~mem10 := read~int(~#set~0.base, ~#set~0.offset + 4 * (1 + ~i~1), 4);call write~int(#t~mem10, ~#set~0.base, ~#set~0.offset + 4 * ~i~1, 4);havoc #t~mem10; {32186#(<= (+ main_~i~1 99999) ~SIZE~0)} is VALID [2018-11-18 23:03:48,580 INFO L273 TraceCheckUtils]: 254: Hoare triple {32186#(<= (+ main_~i~1 99999) ~SIZE~0)} #t~post9 := ~i~1;~i~1 := 1 + #t~post9;havoc #t~post9; {32187#(<= (+ main_~i~1 99998) ~SIZE~0)} is VALID [2018-11-18 23:03:48,581 INFO L273 TraceCheckUtils]: 255: Hoare triple {32187#(<= (+ main_~i~1 99998) ~SIZE~0)} assume true; {32187#(<= (+ main_~i~1 99998) ~SIZE~0)} is VALID [2018-11-18 23:03:48,581 INFO L273 TraceCheckUtils]: 256: Hoare triple {32187#(<= (+ main_~i~1 99998) ~SIZE~0)} assume !!(~i~1 < ~SIZE~0 - 1);call #t~mem10 := read~int(~#set~0.base, ~#set~0.offset + 4 * (1 + ~i~1), 4);call write~int(#t~mem10, ~#set~0.base, ~#set~0.offset + 4 * ~i~1, 4);havoc #t~mem10; {32187#(<= (+ main_~i~1 99998) ~SIZE~0)} is VALID [2018-11-18 23:03:48,582 INFO L273 TraceCheckUtils]: 257: Hoare triple {32187#(<= (+ main_~i~1 99998) ~SIZE~0)} #t~post9 := ~i~1;~i~1 := 1 + #t~post9;havoc #t~post9; {32188#(<= (+ main_~i~1 99997) ~SIZE~0)} is VALID [2018-11-18 23:03:48,583 INFO L273 TraceCheckUtils]: 258: Hoare triple {32188#(<= (+ main_~i~1 99997) ~SIZE~0)} assume true; {32188#(<= (+ main_~i~1 99997) ~SIZE~0)} is VALID [2018-11-18 23:03:48,583 INFO L273 TraceCheckUtils]: 259: Hoare triple {32188#(<= (+ main_~i~1 99997) ~SIZE~0)} assume !!(~i~1 < ~SIZE~0 - 1);call #t~mem10 := read~int(~#set~0.base, ~#set~0.offset + 4 * (1 + ~i~1), 4);call write~int(#t~mem10, ~#set~0.base, ~#set~0.offset + 4 * ~i~1, 4);havoc #t~mem10; {32188#(<= (+ main_~i~1 99997) ~SIZE~0)} is VALID [2018-11-18 23:03:48,584 INFO L273 TraceCheckUtils]: 260: Hoare triple {32188#(<= (+ main_~i~1 99997) ~SIZE~0)} #t~post9 := ~i~1;~i~1 := 1 + #t~post9;havoc #t~post9; {32189#(<= (+ main_~i~1 99996) ~SIZE~0)} is VALID [2018-11-18 23:03:48,585 INFO L273 TraceCheckUtils]: 261: Hoare triple {32189#(<= (+ main_~i~1 99996) ~SIZE~0)} assume true; {32189#(<= (+ main_~i~1 99996) ~SIZE~0)} is VALID [2018-11-18 23:03:48,585 INFO L273 TraceCheckUtils]: 262: Hoare triple {32189#(<= (+ main_~i~1 99996) ~SIZE~0)} assume !!(~i~1 < ~SIZE~0 - 1);call #t~mem10 := read~int(~#set~0.base, ~#set~0.offset + 4 * (1 + ~i~1), 4);call write~int(#t~mem10, ~#set~0.base, ~#set~0.offset + 4 * ~i~1, 4);havoc #t~mem10; {32189#(<= (+ main_~i~1 99996) ~SIZE~0)} is VALID [2018-11-18 23:03:48,586 INFO L273 TraceCheckUtils]: 263: Hoare triple {32189#(<= (+ main_~i~1 99996) ~SIZE~0)} #t~post9 := ~i~1;~i~1 := 1 + #t~post9;havoc #t~post9; {32190#(<= (+ main_~i~1 99995) ~SIZE~0)} is VALID [2018-11-18 23:03:48,587 INFO L273 TraceCheckUtils]: 264: Hoare triple {32190#(<= (+ main_~i~1 99995) ~SIZE~0)} assume true; {32190#(<= (+ main_~i~1 99995) ~SIZE~0)} is VALID [2018-11-18 23:03:48,587 INFO L273 TraceCheckUtils]: 265: Hoare triple {32190#(<= (+ main_~i~1 99995) ~SIZE~0)} assume !(~i~1 < ~SIZE~0 - 1); {32182#false} is VALID [2018-11-18 23:03:48,587 INFO L273 TraceCheckUtils]: 266: Hoare triple {32182#false} assume 1 == ~found~0;~i~1 := 0; {32182#false} is VALID [2018-11-18 23:03:48,588 INFO L273 TraceCheckUtils]: 267: Hoare triple {32182#false} assume true; {32182#false} is VALID [2018-11-18 23:03:48,588 INFO L273 TraceCheckUtils]: 268: Hoare triple {32182#false} assume !!(~i~1 < ~SIZE~0 - 1);call #t~mem12 := read~int(~#set~0.base, ~#set~0.offset + 4 * ~i~1, 4); {32182#false} is VALID [2018-11-18 23:03:48,588 INFO L256 TraceCheckUtils]: 269: Hoare triple {32182#false} call __VERIFIER_assert((if #t~mem12 != ~element~0 then 1 else 0)); {32182#false} is VALID [2018-11-18 23:03:48,588 INFO L273 TraceCheckUtils]: 270: Hoare triple {32182#false} ~cond := #in~cond; {32182#false} is VALID [2018-11-18 23:03:48,588 INFO L273 TraceCheckUtils]: 271: Hoare triple {32182#false} assume 0 == ~cond; {32182#false} is VALID [2018-11-18 23:03:48,592 INFO L273 TraceCheckUtils]: 272: Hoare triple {32182#false} assume !false; {32182#false} is VALID [2018-11-18 23:03:48,665 INFO L134 CoverageAnalysis]: Checked inductivity of 2114 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 2072 trivial. 0 not checked. [2018-11-18 23:03:48,666 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 23:03:48,666 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-18 23:03:48,677 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-18 23:03:48,794 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-18 23:03:48,794 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-18 23:03:48,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 23:03:48,846 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 23:03:49,653 INFO L256 TraceCheckUtils]: 0: Hoare triple {32181#true} call ULTIMATE.init(); {32181#true} is VALID [2018-11-18 23:03:49,653 INFO L273 TraceCheckUtils]: 1: Hoare triple {32181#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~SIZE~0 := 100000; {32181#true} is VALID [2018-11-18 23:03:49,654 INFO L273 TraceCheckUtils]: 2: Hoare triple {32181#true} assume true; {32181#true} is VALID [2018-11-18 23:03:49,654 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {32181#true} {32181#true} #128#return; {32181#true} is VALID [2018-11-18 23:03:49,654 INFO L256 TraceCheckUtils]: 4: Hoare triple {32181#true} call #t~ret13 := main(); {32181#true} is VALID [2018-11-18 23:03:49,655 INFO L273 TraceCheckUtils]: 5: Hoare triple {32181#true} havoc ~i~1;havoc ~pos~0;~n~0 := 0;~found~0 := 0;call ~#set~0.base, ~#set~0.offset := #Ultimate.alloc(4 * ~SIZE~0);call ~#values~0.base, ~#values~0.offset := #Ultimate.alloc(4 * ~SIZE~0);havoc ~element~0;havoc ~v~0;~v~0 := 0; {32209#(<= 0 main_~v~0)} is VALID [2018-11-18 23:03:49,656 INFO L273 TraceCheckUtils]: 6: Hoare triple {32209#(<= 0 main_~v~0)} assume true; {32209#(<= 0 main_~v~0)} is VALID [2018-11-18 23:03:49,656 INFO L273 TraceCheckUtils]: 7: Hoare triple {32209#(<= 0 main_~v~0)} assume !!(~v~0 < ~SIZE~0);call #t~mem3 := read~int(~#values~0.base, ~#values~0.offset + 4 * ~v~0, 4); {32209#(<= 0 main_~v~0)} is VALID [2018-11-18 23:03:49,656 INFO L256 TraceCheckUtils]: 8: Hoare triple {32209#(<= 0 main_~v~0)} call #t~ret4 := elem_exists(~#set~0.base, ~#set~0.offset, ~n~0, #t~mem3); {32181#true} is VALID [2018-11-18 23:03:49,656 INFO L273 TraceCheckUtils]: 9: Hoare triple {32181#true} ~set.base, ~set.offset := #in~set.base, #in~set.offset;~size := #in~size;~value := #in~value;havoc ~i~0;~i~0 := 0; {32181#true} is VALID [2018-11-18 23:03:49,656 INFO L273 TraceCheckUtils]: 10: Hoare triple {32181#true} assume true; {32181#true} is VALID [2018-11-18 23:03:49,656 INFO L273 TraceCheckUtils]: 11: Hoare triple {32181#true} assume !(~i~0 < ~size); {32181#true} is VALID [2018-11-18 23:03:49,656 INFO L273 TraceCheckUtils]: 12: Hoare triple {32181#true} #res := 0; {32181#true} is VALID [2018-11-18 23:03:49,657 INFO L273 TraceCheckUtils]: 13: Hoare triple {32181#true} assume true; {32181#true} is VALID [2018-11-18 23:03:49,657 INFO L268 TraceCheckUtils]: 14: Hoare quadruple {32181#true} {32209#(<= 0 main_~v~0)} #132#return; {32209#(<= 0 main_~v~0)} is VALID [2018-11-18 23:03:49,657 INFO L273 TraceCheckUtils]: 15: Hoare triple {32209#(<= 0 main_~v~0)} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {32209#(<= 0 main_~v~0)} is VALID [2018-11-18 23:03:49,658 INFO L273 TraceCheckUtils]: 16: Hoare triple {32209#(<= 0 main_~v~0)} assume 1 != #t~ret4;havoc #t~mem3;havoc #t~ret4;call #t~mem5 := read~int(~#values~0.base, ~#values~0.offset + 4 * ~v~0, 4); {32209#(<= 0 main_~v~0)} is VALID [2018-11-18 23:03:49,658 INFO L256 TraceCheckUtils]: 17: Hoare triple {32209#(<= 0 main_~v~0)} call #t~ret6 := insert(~#set~0.base, ~#set~0.offset, ~n~0, #t~mem5); {32181#true} is VALID [2018-11-18 23:03:49,658 INFO L273 TraceCheckUtils]: 18: Hoare triple {32181#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; {32181#true} is VALID [2018-11-18 23:03:49,658 INFO L273 TraceCheckUtils]: 19: Hoare triple {32181#true} assume true; {32181#true} is VALID [2018-11-18 23:03:49,659 INFO L268 TraceCheckUtils]: 20: Hoare quadruple {32181#true} {32209#(<= 0 main_~v~0)} #134#return; {32209#(<= 0 main_~v~0)} is VALID [2018-11-18 23:03:49,659 INFO L273 TraceCheckUtils]: 21: Hoare triple {32209#(<= 0 main_~v~0)} assume -2147483648 <= #t~ret6 && #t~ret6 <= 2147483647;~n~0 := #t~ret6;havoc #t~ret6;havoc #t~mem5; {32209#(<= 0 main_~v~0)} is VALID [2018-11-18 23:03:49,660 INFO L273 TraceCheckUtils]: 22: Hoare triple {32209#(<= 0 main_~v~0)} #t~post2 := ~v~0;~v~0 := 1 + #t~post2;havoc #t~post2; {32261#(<= 1 main_~v~0)} is VALID [2018-11-18 23:03:49,660 INFO L273 TraceCheckUtils]: 23: Hoare triple {32261#(<= 1 main_~v~0)} assume true; {32261#(<= 1 main_~v~0)} is VALID [2018-11-18 23:03:49,661 INFO L273 TraceCheckUtils]: 24: Hoare triple {32261#(<= 1 main_~v~0)} assume !!(~v~0 < ~SIZE~0);call #t~mem3 := read~int(~#values~0.base, ~#values~0.offset + 4 * ~v~0, 4); {32261#(<= 1 main_~v~0)} is VALID [2018-11-18 23:03:49,661 INFO L256 TraceCheckUtils]: 25: Hoare triple {32261#(<= 1 main_~v~0)} call #t~ret4 := elem_exists(~#set~0.base, ~#set~0.offset, ~n~0, #t~mem3); {32181#true} is VALID [2018-11-18 23:03:49,661 INFO L273 TraceCheckUtils]: 26: Hoare triple {32181#true} ~set.base, ~set.offset := #in~set.base, #in~set.offset;~size := #in~size;~value := #in~value;havoc ~i~0;~i~0 := 0; {32181#true} is VALID [2018-11-18 23:03:49,661 INFO L273 TraceCheckUtils]: 27: Hoare triple {32181#true} assume true; {32181#true} is VALID [2018-11-18 23:03:49,661 INFO L273 TraceCheckUtils]: 28: Hoare triple {32181#true} assume !!(~i~0 < ~size);call #t~mem1 := read~int(~set.base, ~set.offset + 4 * ~i~0, 4); {32181#true} is VALID [2018-11-18 23:03:49,662 INFO L273 TraceCheckUtils]: 29: Hoare triple {32181#true} assume #t~mem1 == ~value;havoc #t~mem1;#res := 1; {32181#true} is VALID [2018-11-18 23:03:49,662 INFO L273 TraceCheckUtils]: 30: Hoare triple {32181#true} assume true; {32181#true} is VALID [2018-11-18 23:03:49,663 INFO L268 TraceCheckUtils]: 31: Hoare quadruple {32181#true} {32261#(<= 1 main_~v~0)} #132#return; {32261#(<= 1 main_~v~0)} is VALID [2018-11-18 23:03:49,663 INFO L273 TraceCheckUtils]: 32: Hoare triple {32261#(<= 1 main_~v~0)} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {32261#(<= 1 main_~v~0)} is VALID [2018-11-18 23:03:49,663 INFO L273 TraceCheckUtils]: 33: Hoare triple {32261#(<= 1 main_~v~0)} assume !(1 != #t~ret4);havoc #t~mem3;havoc #t~ret4; {32261#(<= 1 main_~v~0)} is VALID [2018-11-18 23:03:49,664 INFO L273 TraceCheckUtils]: 34: Hoare triple {32261#(<= 1 main_~v~0)} #t~post2 := ~v~0;~v~0 := 1 + #t~post2;havoc #t~post2; {32298#(<= 2 main_~v~0)} is VALID [2018-11-18 23:03:49,664 INFO L273 TraceCheckUtils]: 35: Hoare triple {32298#(<= 2 main_~v~0)} assume true; {32298#(<= 2 main_~v~0)} is VALID [2018-11-18 23:03:49,664 INFO L273 TraceCheckUtils]: 36: Hoare triple {32298#(<= 2 main_~v~0)} assume !!(~v~0 < ~SIZE~0);call #t~mem3 := read~int(~#values~0.base, ~#values~0.offset + 4 * ~v~0, 4); {32298#(<= 2 main_~v~0)} is VALID [2018-11-18 23:03:49,665 INFO L256 TraceCheckUtils]: 37: Hoare triple {32298#(<= 2 main_~v~0)} call #t~ret4 := elem_exists(~#set~0.base, ~#set~0.offset, ~n~0, #t~mem3); {32181#true} is VALID [2018-11-18 23:03:49,665 INFO L273 TraceCheckUtils]: 38: Hoare triple {32181#true} ~set.base, ~set.offset := #in~set.base, #in~set.offset;~size := #in~size;~value := #in~value;havoc ~i~0;~i~0 := 0; {32181#true} is VALID [2018-11-18 23:03:49,665 INFO L273 TraceCheckUtils]: 39: Hoare triple {32181#true} assume true; {32181#true} is VALID [2018-11-18 23:03:49,665 INFO L273 TraceCheckUtils]: 40: Hoare triple {32181#true} assume !!(~i~0 < ~size);call #t~mem1 := read~int(~set.base, ~set.offset + 4 * ~i~0, 4); {32181#true} is VALID [2018-11-18 23:03:49,665 INFO L273 TraceCheckUtils]: 41: Hoare triple {32181#true} assume #t~mem1 == ~value;havoc #t~mem1;#res := 1; {32181#true} is VALID [2018-11-18 23:03:49,666 INFO L273 TraceCheckUtils]: 42: Hoare triple {32181#true} assume true; {32181#true} is VALID [2018-11-18 23:03:49,667 INFO L268 TraceCheckUtils]: 43: Hoare quadruple {32181#true} {32298#(<= 2 main_~v~0)} #132#return; {32298#(<= 2 main_~v~0)} is VALID [2018-11-18 23:03:49,667 INFO L273 TraceCheckUtils]: 44: Hoare triple {32298#(<= 2 main_~v~0)} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {32298#(<= 2 main_~v~0)} is VALID [2018-11-18 23:03:49,668 INFO L273 TraceCheckUtils]: 45: Hoare triple {32298#(<= 2 main_~v~0)} assume !(1 != #t~ret4);havoc #t~mem3;havoc #t~ret4; {32298#(<= 2 main_~v~0)} is VALID [2018-11-18 23:03:49,669 INFO L273 TraceCheckUtils]: 46: Hoare triple {32298#(<= 2 main_~v~0)} #t~post2 := ~v~0;~v~0 := 1 + #t~post2;havoc #t~post2; {32335#(<= 3 main_~v~0)} is VALID [2018-11-18 23:03:49,669 INFO L273 TraceCheckUtils]: 47: Hoare triple {32335#(<= 3 main_~v~0)} assume true; {32335#(<= 3 main_~v~0)} is VALID [2018-11-18 23:03:49,670 INFO L273 TraceCheckUtils]: 48: Hoare triple {32335#(<= 3 main_~v~0)} assume !!(~v~0 < ~SIZE~0);call #t~mem3 := read~int(~#values~0.base, ~#values~0.offset + 4 * ~v~0, 4); {32335#(<= 3 main_~v~0)} is VALID [2018-11-18 23:03:49,670 INFO L256 TraceCheckUtils]: 49: Hoare triple {32335#(<= 3 main_~v~0)} call #t~ret4 := elem_exists(~#set~0.base, ~#set~0.offset, ~n~0, #t~mem3); {32181#true} is VALID [2018-11-18 23:03:49,670 INFO L273 TraceCheckUtils]: 50: Hoare triple {32181#true} ~set.base, ~set.offset := #in~set.base, #in~set.offset;~size := #in~size;~value := #in~value;havoc ~i~0;~i~0 := 0; {32181#true} is VALID [2018-11-18 23:03:49,670 INFO L273 TraceCheckUtils]: 51: Hoare triple {32181#true} assume true; {32181#true} is VALID [2018-11-18 23:03:49,670 INFO L273 TraceCheckUtils]: 52: Hoare triple {32181#true} assume !!(~i~0 < ~size);call #t~mem1 := read~int(~set.base, ~set.offset + 4 * ~i~0, 4); {32181#true} is VALID [2018-11-18 23:03:49,671 INFO L273 TraceCheckUtils]: 53: Hoare triple {32181#true} assume #t~mem1 == ~value;havoc #t~mem1;#res := 1; {32181#true} is VALID [2018-11-18 23:03:49,671 INFO L273 TraceCheckUtils]: 54: Hoare triple {32181#true} assume true; {32181#true} is VALID [2018-11-18 23:03:49,672 INFO L268 TraceCheckUtils]: 55: Hoare quadruple {32181#true} {32335#(<= 3 main_~v~0)} #132#return; {32335#(<= 3 main_~v~0)} is VALID [2018-11-18 23:03:49,672 INFO L273 TraceCheckUtils]: 56: Hoare triple {32335#(<= 3 main_~v~0)} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {32335#(<= 3 main_~v~0)} is VALID [2018-11-18 23:03:49,673 INFO L273 TraceCheckUtils]: 57: Hoare triple {32335#(<= 3 main_~v~0)} assume !(1 != #t~ret4);havoc #t~mem3;havoc #t~ret4; {32335#(<= 3 main_~v~0)} is VALID [2018-11-18 23:03:49,673 INFO L273 TraceCheckUtils]: 58: Hoare triple {32335#(<= 3 main_~v~0)} #t~post2 := ~v~0;~v~0 := 1 + #t~post2;havoc #t~post2; {32372#(<= 4 main_~v~0)} is VALID [2018-11-18 23:03:49,673 INFO L273 TraceCheckUtils]: 59: Hoare triple {32372#(<= 4 main_~v~0)} assume true; {32372#(<= 4 main_~v~0)} is VALID [2018-11-18 23:03:49,674 INFO L273 TraceCheckUtils]: 60: Hoare triple {32372#(<= 4 main_~v~0)} assume !!(~v~0 < ~SIZE~0);call #t~mem3 := read~int(~#values~0.base, ~#values~0.offset + 4 * ~v~0, 4); {32372#(<= 4 main_~v~0)} is VALID [2018-11-18 23:03:49,674 INFO L256 TraceCheckUtils]: 61: Hoare triple {32372#(<= 4 main_~v~0)} call #t~ret4 := elem_exists(~#set~0.base, ~#set~0.offset, ~n~0, #t~mem3); {32181#true} is VALID [2018-11-18 23:03:49,674 INFO L273 TraceCheckUtils]: 62: Hoare triple {32181#true} ~set.base, ~set.offset := #in~set.base, #in~set.offset;~size := #in~size;~value := #in~value;havoc ~i~0;~i~0 := 0; {32181#true} is VALID [2018-11-18 23:03:49,674 INFO L273 TraceCheckUtils]: 63: Hoare triple {32181#true} assume true; {32181#true} is VALID [2018-11-18 23:03:49,674 INFO L273 TraceCheckUtils]: 64: Hoare triple {32181#true} assume !!(~i~0 < ~size);call #t~mem1 := read~int(~set.base, ~set.offset + 4 * ~i~0, 4); {32181#true} is VALID [2018-11-18 23:03:49,674 INFO L273 TraceCheckUtils]: 65: Hoare triple {32181#true} assume #t~mem1 == ~value;havoc #t~mem1;#res := 1; {32181#true} is VALID [2018-11-18 23:03:49,674 INFO L273 TraceCheckUtils]: 66: Hoare triple {32181#true} assume true; {32181#true} is VALID [2018-11-18 23:03:49,675 INFO L268 TraceCheckUtils]: 67: Hoare quadruple {32181#true} {32372#(<= 4 main_~v~0)} #132#return; {32372#(<= 4 main_~v~0)} is VALID [2018-11-18 23:03:49,676 INFO L273 TraceCheckUtils]: 68: Hoare triple {32372#(<= 4 main_~v~0)} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {32372#(<= 4 main_~v~0)} is VALID [2018-11-18 23:03:49,676 INFO L273 TraceCheckUtils]: 69: Hoare triple {32372#(<= 4 main_~v~0)} assume !(1 != #t~ret4);havoc #t~mem3;havoc #t~ret4; {32372#(<= 4 main_~v~0)} is VALID [2018-11-18 23:03:49,677 INFO L273 TraceCheckUtils]: 70: Hoare triple {32372#(<= 4 main_~v~0)} #t~post2 := ~v~0;~v~0 := 1 + #t~post2;havoc #t~post2; {32409#(<= 5 main_~v~0)} is VALID [2018-11-18 23:03:49,678 INFO L273 TraceCheckUtils]: 71: Hoare triple {32409#(<= 5 main_~v~0)} assume true; {32409#(<= 5 main_~v~0)} is VALID [2018-11-18 23:03:49,678 INFO L273 TraceCheckUtils]: 72: Hoare triple {32409#(<= 5 main_~v~0)} assume !!(~v~0 < ~SIZE~0);call #t~mem3 := read~int(~#values~0.base, ~#values~0.offset + 4 * ~v~0, 4); {32409#(<= 5 main_~v~0)} is VALID [2018-11-18 23:03:49,678 INFO L256 TraceCheckUtils]: 73: Hoare triple {32409#(<= 5 main_~v~0)} call #t~ret4 := elem_exists(~#set~0.base, ~#set~0.offset, ~n~0, #t~mem3); {32181#true} is VALID [2018-11-18 23:03:49,679 INFO L273 TraceCheckUtils]: 74: Hoare triple {32181#true} ~set.base, ~set.offset := #in~set.base, #in~set.offset;~size := #in~size;~value := #in~value;havoc ~i~0;~i~0 := 0; {32181#true} is VALID [2018-11-18 23:03:49,679 INFO L273 TraceCheckUtils]: 75: Hoare triple {32181#true} assume true; {32181#true} is VALID [2018-11-18 23:03:49,679 INFO L273 TraceCheckUtils]: 76: Hoare triple {32181#true} assume !!(~i~0 < ~size);call #t~mem1 := read~int(~set.base, ~set.offset + 4 * ~i~0, 4); {32181#true} is VALID [2018-11-18 23:03:49,679 INFO L273 TraceCheckUtils]: 77: Hoare triple {32181#true} assume #t~mem1 == ~value;havoc #t~mem1;#res := 1; {32181#true} is VALID [2018-11-18 23:03:49,679 INFO L273 TraceCheckUtils]: 78: Hoare triple {32181#true} assume true; {32181#true} is VALID [2018-11-18 23:03:49,680 INFO L268 TraceCheckUtils]: 79: Hoare quadruple {32181#true} {32409#(<= 5 main_~v~0)} #132#return; {32409#(<= 5 main_~v~0)} is VALID [2018-11-18 23:03:49,681 INFO L273 TraceCheckUtils]: 80: Hoare triple {32409#(<= 5 main_~v~0)} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {32409#(<= 5 main_~v~0)} is VALID [2018-11-18 23:03:49,681 INFO L273 TraceCheckUtils]: 81: Hoare triple {32409#(<= 5 main_~v~0)} assume !(1 != #t~ret4);havoc #t~mem3;havoc #t~ret4; {32409#(<= 5 main_~v~0)} is VALID [2018-11-18 23:03:49,681 INFO L273 TraceCheckUtils]: 82: Hoare triple {32409#(<= 5 main_~v~0)} #t~post2 := ~v~0;~v~0 := 1 + #t~post2;havoc #t~post2; {32446#(<= 6 main_~v~0)} is VALID [2018-11-18 23:03:49,682 INFO L273 TraceCheckUtils]: 83: Hoare triple {32446#(<= 6 main_~v~0)} assume true; {32446#(<= 6 main_~v~0)} is VALID [2018-11-18 23:03:49,682 INFO L273 TraceCheckUtils]: 84: Hoare triple {32446#(<= 6 main_~v~0)} assume !!(~v~0 < ~SIZE~0);call #t~mem3 := read~int(~#values~0.base, ~#values~0.offset + 4 * ~v~0, 4); {32446#(<= 6 main_~v~0)} is VALID [2018-11-18 23:03:49,682 INFO L256 TraceCheckUtils]: 85: Hoare triple {32446#(<= 6 main_~v~0)} call #t~ret4 := elem_exists(~#set~0.base, ~#set~0.offset, ~n~0, #t~mem3); {32181#true} is VALID [2018-11-18 23:03:49,682 INFO L273 TraceCheckUtils]: 86: Hoare triple {32181#true} ~set.base, ~set.offset := #in~set.base, #in~set.offset;~size := #in~size;~value := #in~value;havoc ~i~0;~i~0 := 0; {32181#true} is VALID [2018-11-18 23:03:49,682 INFO L273 TraceCheckUtils]: 87: Hoare triple {32181#true} assume true; {32181#true} is VALID [2018-11-18 23:03:49,683 INFO L273 TraceCheckUtils]: 88: Hoare triple {32181#true} assume !!(~i~0 < ~size);call #t~mem1 := read~int(~set.base, ~set.offset + 4 * ~i~0, 4); {32181#true} is VALID [2018-11-18 23:03:49,683 INFO L273 TraceCheckUtils]: 89: Hoare triple {32181#true} assume #t~mem1 == ~value;havoc #t~mem1;#res := 1; {32181#true} is VALID [2018-11-18 23:03:49,683 INFO L273 TraceCheckUtils]: 90: Hoare triple {32181#true} assume true; {32181#true} is VALID [2018-11-18 23:03:49,684 INFO L268 TraceCheckUtils]: 91: Hoare quadruple {32181#true} {32446#(<= 6 main_~v~0)} #132#return; {32446#(<= 6 main_~v~0)} is VALID [2018-11-18 23:03:49,684 INFO L273 TraceCheckUtils]: 92: Hoare triple {32446#(<= 6 main_~v~0)} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {32446#(<= 6 main_~v~0)} is VALID [2018-11-18 23:03:49,685 INFO L273 TraceCheckUtils]: 93: Hoare triple {32446#(<= 6 main_~v~0)} assume !(1 != #t~ret4);havoc #t~mem3;havoc #t~ret4; {32446#(<= 6 main_~v~0)} is VALID [2018-11-18 23:03:49,686 INFO L273 TraceCheckUtils]: 94: Hoare triple {32446#(<= 6 main_~v~0)} #t~post2 := ~v~0;~v~0 := 1 + #t~post2;havoc #t~post2; {32483#(<= 7 main_~v~0)} is VALID [2018-11-18 23:03:49,686 INFO L273 TraceCheckUtils]: 95: Hoare triple {32483#(<= 7 main_~v~0)} assume true; {32483#(<= 7 main_~v~0)} is VALID [2018-11-18 23:03:49,686 INFO L273 TraceCheckUtils]: 96: Hoare triple {32483#(<= 7 main_~v~0)} assume !!(~v~0 < ~SIZE~0);call #t~mem3 := read~int(~#values~0.base, ~#values~0.offset + 4 * ~v~0, 4); {32483#(<= 7 main_~v~0)} is VALID [2018-11-18 23:03:49,686 INFO L256 TraceCheckUtils]: 97: Hoare triple {32483#(<= 7 main_~v~0)} call #t~ret4 := elem_exists(~#set~0.base, ~#set~0.offset, ~n~0, #t~mem3); {32181#true} is VALID [2018-11-18 23:03:49,686 INFO L273 TraceCheckUtils]: 98: Hoare triple {32181#true} ~set.base, ~set.offset := #in~set.base, #in~set.offset;~size := #in~size;~value := #in~value;havoc ~i~0;~i~0 := 0; {32181#true} is VALID [2018-11-18 23:03:49,687 INFO L273 TraceCheckUtils]: 99: Hoare triple {32181#true} assume true; {32181#true} is VALID [2018-11-18 23:03:49,687 INFO L273 TraceCheckUtils]: 100: Hoare triple {32181#true} assume !!(~i~0 < ~size);call #t~mem1 := read~int(~set.base, ~set.offset + 4 * ~i~0, 4); {32181#true} is VALID [2018-11-18 23:03:49,687 INFO L273 TraceCheckUtils]: 101: Hoare triple {32181#true} assume #t~mem1 == ~value;havoc #t~mem1;#res := 1; {32181#true} is VALID [2018-11-18 23:03:49,687 INFO L273 TraceCheckUtils]: 102: Hoare triple {32181#true} assume true; {32181#true} is VALID [2018-11-18 23:03:49,687 INFO L268 TraceCheckUtils]: 103: Hoare quadruple {32181#true} {32483#(<= 7 main_~v~0)} #132#return; {32483#(<= 7 main_~v~0)} is VALID [2018-11-18 23:03:49,688 INFO L273 TraceCheckUtils]: 104: Hoare triple {32483#(<= 7 main_~v~0)} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {32483#(<= 7 main_~v~0)} is VALID [2018-11-18 23:03:49,688 INFO L273 TraceCheckUtils]: 105: Hoare triple {32483#(<= 7 main_~v~0)} assume !(1 != #t~ret4);havoc #t~mem3;havoc #t~ret4; {32483#(<= 7 main_~v~0)} is VALID [2018-11-18 23:03:49,689 INFO L273 TraceCheckUtils]: 106: Hoare triple {32483#(<= 7 main_~v~0)} #t~post2 := ~v~0;~v~0 := 1 + #t~post2;havoc #t~post2; {32520#(<= 8 main_~v~0)} is VALID [2018-11-18 23:03:49,689 INFO L273 TraceCheckUtils]: 107: Hoare triple {32520#(<= 8 main_~v~0)} assume true; {32520#(<= 8 main_~v~0)} is VALID [2018-11-18 23:03:49,690 INFO L273 TraceCheckUtils]: 108: Hoare triple {32520#(<= 8 main_~v~0)} assume !!(~v~0 < ~SIZE~0);call #t~mem3 := read~int(~#values~0.base, ~#values~0.offset + 4 * ~v~0, 4); {32520#(<= 8 main_~v~0)} is VALID [2018-11-18 23:03:49,690 INFO L256 TraceCheckUtils]: 109: Hoare triple {32520#(<= 8 main_~v~0)} call #t~ret4 := elem_exists(~#set~0.base, ~#set~0.offset, ~n~0, #t~mem3); {32181#true} is VALID [2018-11-18 23:03:49,690 INFO L273 TraceCheckUtils]: 110: Hoare triple {32181#true} ~set.base, ~set.offset := #in~set.base, #in~set.offset;~size := #in~size;~value := #in~value;havoc ~i~0;~i~0 := 0; {32181#true} is VALID [2018-11-18 23:03:49,690 INFO L273 TraceCheckUtils]: 111: Hoare triple {32181#true} assume true; {32181#true} is VALID [2018-11-18 23:03:49,690 INFO L273 TraceCheckUtils]: 112: Hoare triple {32181#true} assume !!(~i~0 < ~size);call #t~mem1 := read~int(~set.base, ~set.offset + 4 * ~i~0, 4); {32181#true} is VALID [2018-11-18 23:03:49,691 INFO L273 TraceCheckUtils]: 113: Hoare triple {32181#true} assume #t~mem1 == ~value;havoc #t~mem1;#res := 1; {32181#true} is VALID [2018-11-18 23:03:49,691 INFO L273 TraceCheckUtils]: 114: Hoare triple {32181#true} assume true; {32181#true} is VALID [2018-11-18 23:03:49,692 INFO L268 TraceCheckUtils]: 115: Hoare quadruple {32181#true} {32520#(<= 8 main_~v~0)} #132#return; {32520#(<= 8 main_~v~0)} is VALID [2018-11-18 23:03:49,692 INFO L273 TraceCheckUtils]: 116: Hoare triple {32520#(<= 8 main_~v~0)} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {32520#(<= 8 main_~v~0)} is VALID [2018-11-18 23:03:49,693 INFO L273 TraceCheckUtils]: 117: Hoare triple {32520#(<= 8 main_~v~0)} assume !(1 != #t~ret4);havoc #t~mem3;havoc #t~ret4; {32520#(<= 8 main_~v~0)} is VALID [2018-11-18 23:03:49,694 INFO L273 TraceCheckUtils]: 118: Hoare triple {32520#(<= 8 main_~v~0)} #t~post2 := ~v~0;~v~0 := 1 + #t~post2;havoc #t~post2; {32557#(<= 9 main_~v~0)} is VALID [2018-11-18 23:03:49,694 INFO L273 TraceCheckUtils]: 119: Hoare triple {32557#(<= 9 main_~v~0)} assume true; {32557#(<= 9 main_~v~0)} is VALID [2018-11-18 23:03:49,695 INFO L273 TraceCheckUtils]: 120: Hoare triple {32557#(<= 9 main_~v~0)} assume !!(~v~0 < ~SIZE~0);call #t~mem3 := read~int(~#values~0.base, ~#values~0.offset + 4 * ~v~0, 4); {32557#(<= 9 main_~v~0)} is VALID [2018-11-18 23:03:49,695 INFO L256 TraceCheckUtils]: 121: Hoare triple {32557#(<= 9 main_~v~0)} call #t~ret4 := elem_exists(~#set~0.base, ~#set~0.offset, ~n~0, #t~mem3); {32181#true} is VALID [2018-11-18 23:03:49,695 INFO L273 TraceCheckUtils]: 122: Hoare triple {32181#true} ~set.base, ~set.offset := #in~set.base, #in~set.offset;~size := #in~size;~value := #in~value;havoc ~i~0;~i~0 := 0; {32181#true} is VALID [2018-11-18 23:03:49,695 INFO L273 TraceCheckUtils]: 123: Hoare triple {32181#true} assume true; {32181#true} is VALID [2018-11-18 23:03:49,695 INFO L273 TraceCheckUtils]: 124: Hoare triple {32181#true} assume !!(~i~0 < ~size);call #t~mem1 := read~int(~set.base, ~set.offset + 4 * ~i~0, 4); {32181#true} is VALID [2018-11-18 23:03:49,696 INFO L273 TraceCheckUtils]: 125: Hoare triple {32181#true} assume #t~mem1 == ~value;havoc #t~mem1;#res := 1; {32181#true} is VALID [2018-11-18 23:03:49,696 INFO L273 TraceCheckUtils]: 126: Hoare triple {32181#true} assume true; {32181#true} is VALID [2018-11-18 23:03:49,697 INFO L268 TraceCheckUtils]: 127: Hoare quadruple {32181#true} {32557#(<= 9 main_~v~0)} #132#return; {32557#(<= 9 main_~v~0)} is VALID [2018-11-18 23:03:49,697 INFO L273 TraceCheckUtils]: 128: Hoare triple {32557#(<= 9 main_~v~0)} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {32557#(<= 9 main_~v~0)} is VALID [2018-11-18 23:03:49,698 INFO L273 TraceCheckUtils]: 129: Hoare triple {32557#(<= 9 main_~v~0)} assume !(1 != #t~ret4);havoc #t~mem3;havoc #t~ret4; {32557#(<= 9 main_~v~0)} is VALID [2018-11-18 23:03:49,698 INFO L273 TraceCheckUtils]: 130: Hoare triple {32557#(<= 9 main_~v~0)} #t~post2 := ~v~0;~v~0 := 1 + #t~post2;havoc #t~post2; {32594#(<= 10 main_~v~0)} is VALID [2018-11-18 23:03:49,698 INFO L273 TraceCheckUtils]: 131: Hoare triple {32594#(<= 10 main_~v~0)} assume true; {32594#(<= 10 main_~v~0)} is VALID [2018-11-18 23:03:49,699 INFO L273 TraceCheckUtils]: 132: Hoare triple {32594#(<= 10 main_~v~0)} assume !!(~v~0 < ~SIZE~0);call #t~mem3 := read~int(~#values~0.base, ~#values~0.offset + 4 * ~v~0, 4); {32594#(<= 10 main_~v~0)} is VALID [2018-11-18 23:03:49,699 INFO L256 TraceCheckUtils]: 133: Hoare triple {32594#(<= 10 main_~v~0)} call #t~ret4 := elem_exists(~#set~0.base, ~#set~0.offset, ~n~0, #t~mem3); {32181#true} is VALID [2018-11-18 23:03:49,699 INFO L273 TraceCheckUtils]: 134: Hoare triple {32181#true} ~set.base, ~set.offset := #in~set.base, #in~set.offset;~size := #in~size;~value := #in~value;havoc ~i~0;~i~0 := 0; {32181#true} is VALID [2018-11-18 23:03:49,699 INFO L273 TraceCheckUtils]: 135: Hoare triple {32181#true} assume true; {32181#true} is VALID [2018-11-18 23:03:49,699 INFO L273 TraceCheckUtils]: 136: Hoare triple {32181#true} assume !!(~i~0 < ~size);call #t~mem1 := read~int(~set.base, ~set.offset + 4 * ~i~0, 4); {32181#true} is VALID [2018-11-18 23:03:49,699 INFO L273 TraceCheckUtils]: 137: Hoare triple {32181#true} assume #t~mem1 == ~value;havoc #t~mem1;#res := 1; {32181#true} is VALID [2018-11-18 23:03:49,699 INFO L273 TraceCheckUtils]: 138: Hoare triple {32181#true} assume true; {32181#true} is VALID [2018-11-18 23:03:49,700 INFO L268 TraceCheckUtils]: 139: Hoare quadruple {32181#true} {32594#(<= 10 main_~v~0)} #132#return; {32594#(<= 10 main_~v~0)} is VALID [2018-11-18 23:03:49,701 INFO L273 TraceCheckUtils]: 140: Hoare triple {32594#(<= 10 main_~v~0)} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {32594#(<= 10 main_~v~0)} is VALID [2018-11-18 23:03:49,701 INFO L273 TraceCheckUtils]: 141: Hoare triple {32594#(<= 10 main_~v~0)} assume !(1 != #t~ret4);havoc #t~mem3;havoc #t~ret4; {32594#(<= 10 main_~v~0)} is VALID [2018-11-18 23:03:49,702 INFO L273 TraceCheckUtils]: 142: Hoare triple {32594#(<= 10 main_~v~0)} #t~post2 := ~v~0;~v~0 := 1 + #t~post2;havoc #t~post2; {32631#(<= 11 main_~v~0)} is VALID [2018-11-18 23:03:49,702 INFO L273 TraceCheckUtils]: 143: Hoare triple {32631#(<= 11 main_~v~0)} assume true; {32631#(<= 11 main_~v~0)} is VALID [2018-11-18 23:03:49,702 INFO L273 TraceCheckUtils]: 144: Hoare triple {32631#(<= 11 main_~v~0)} assume !!(~v~0 < ~SIZE~0);call #t~mem3 := read~int(~#values~0.base, ~#values~0.offset + 4 * ~v~0, 4); {32631#(<= 11 main_~v~0)} is VALID [2018-11-18 23:03:49,703 INFO L256 TraceCheckUtils]: 145: Hoare triple {32631#(<= 11 main_~v~0)} call #t~ret4 := elem_exists(~#set~0.base, ~#set~0.offset, ~n~0, #t~mem3); {32181#true} is VALID [2018-11-18 23:03:49,703 INFO L273 TraceCheckUtils]: 146: Hoare triple {32181#true} ~set.base, ~set.offset := #in~set.base, #in~set.offset;~size := #in~size;~value := #in~value;havoc ~i~0;~i~0 := 0; {32181#true} is VALID [2018-11-18 23:03:49,703 INFO L273 TraceCheckUtils]: 147: Hoare triple {32181#true} assume true; {32181#true} is VALID [2018-11-18 23:03:49,703 INFO L273 TraceCheckUtils]: 148: Hoare triple {32181#true} assume !!(~i~0 < ~size);call #t~mem1 := read~int(~set.base, ~set.offset + 4 * ~i~0, 4); {32181#true} is VALID [2018-11-18 23:03:49,703 INFO L273 TraceCheckUtils]: 149: Hoare triple {32181#true} assume #t~mem1 == ~value;havoc #t~mem1;#res := 1; {32181#true} is VALID [2018-11-18 23:03:49,703 INFO L273 TraceCheckUtils]: 150: Hoare triple {32181#true} assume true; {32181#true} is VALID [2018-11-18 23:03:49,704 INFO L268 TraceCheckUtils]: 151: Hoare quadruple {32181#true} {32631#(<= 11 main_~v~0)} #132#return; {32631#(<= 11 main_~v~0)} is VALID [2018-11-18 23:03:49,705 INFO L273 TraceCheckUtils]: 152: Hoare triple {32631#(<= 11 main_~v~0)} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {32631#(<= 11 main_~v~0)} is VALID [2018-11-18 23:03:49,705 INFO L273 TraceCheckUtils]: 153: Hoare triple {32631#(<= 11 main_~v~0)} assume !(1 != #t~ret4);havoc #t~mem3;havoc #t~ret4; {32631#(<= 11 main_~v~0)} is VALID [2018-11-18 23:03:49,706 INFO L273 TraceCheckUtils]: 154: Hoare triple {32631#(<= 11 main_~v~0)} #t~post2 := ~v~0;~v~0 := 1 + #t~post2;havoc #t~post2; {32668#(<= 12 main_~v~0)} is VALID [2018-11-18 23:03:49,706 INFO L273 TraceCheckUtils]: 155: Hoare triple {32668#(<= 12 main_~v~0)} assume true; {32668#(<= 12 main_~v~0)} is VALID [2018-11-18 23:03:49,706 INFO L273 TraceCheckUtils]: 156: Hoare triple {32668#(<= 12 main_~v~0)} assume !!(~v~0 < ~SIZE~0);call #t~mem3 := read~int(~#values~0.base, ~#values~0.offset + 4 * ~v~0, 4); {32668#(<= 12 main_~v~0)} is VALID [2018-11-18 23:03:49,706 INFO L256 TraceCheckUtils]: 157: Hoare triple {32668#(<= 12 main_~v~0)} call #t~ret4 := elem_exists(~#set~0.base, ~#set~0.offset, ~n~0, #t~mem3); {32181#true} is VALID [2018-11-18 23:03:49,706 INFO L273 TraceCheckUtils]: 158: Hoare triple {32181#true} ~set.base, ~set.offset := #in~set.base, #in~set.offset;~size := #in~size;~value := #in~value;havoc ~i~0;~i~0 := 0; {32181#true} is VALID [2018-11-18 23:03:49,707 INFO L273 TraceCheckUtils]: 159: Hoare triple {32181#true} assume true; {32181#true} is VALID [2018-11-18 23:03:49,707 INFO L273 TraceCheckUtils]: 160: Hoare triple {32181#true} assume !!(~i~0 < ~size);call #t~mem1 := read~int(~set.base, ~set.offset + 4 * ~i~0, 4); {32181#true} is VALID [2018-11-18 23:03:49,707 INFO L273 TraceCheckUtils]: 161: Hoare triple {32181#true} assume #t~mem1 == ~value;havoc #t~mem1;#res := 1; {32181#true} is VALID [2018-11-18 23:03:49,707 INFO L273 TraceCheckUtils]: 162: Hoare triple {32181#true} assume true; {32181#true} is VALID [2018-11-18 23:03:49,708 INFO L268 TraceCheckUtils]: 163: Hoare quadruple {32181#true} {32668#(<= 12 main_~v~0)} #132#return; {32668#(<= 12 main_~v~0)} is VALID [2018-11-18 23:03:49,708 INFO L273 TraceCheckUtils]: 164: Hoare triple {32668#(<= 12 main_~v~0)} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {32668#(<= 12 main_~v~0)} is VALID [2018-11-18 23:03:49,708 INFO L273 TraceCheckUtils]: 165: Hoare triple {32668#(<= 12 main_~v~0)} assume !(1 != #t~ret4);havoc #t~mem3;havoc #t~ret4; {32668#(<= 12 main_~v~0)} is VALID [2018-11-18 23:03:49,709 INFO L273 TraceCheckUtils]: 166: Hoare triple {32668#(<= 12 main_~v~0)} #t~post2 := ~v~0;~v~0 := 1 + #t~post2;havoc #t~post2; {32705#(<= 13 main_~v~0)} is VALID [2018-11-18 23:03:49,709 INFO L273 TraceCheckUtils]: 167: Hoare triple {32705#(<= 13 main_~v~0)} assume true; {32705#(<= 13 main_~v~0)} is VALID [2018-11-18 23:03:49,710 INFO L273 TraceCheckUtils]: 168: Hoare triple {32705#(<= 13 main_~v~0)} assume !!(~v~0 < ~SIZE~0);call #t~mem3 := read~int(~#values~0.base, ~#values~0.offset + 4 * ~v~0, 4); {32705#(<= 13 main_~v~0)} is VALID [2018-11-18 23:03:49,710 INFO L256 TraceCheckUtils]: 169: Hoare triple {32705#(<= 13 main_~v~0)} call #t~ret4 := elem_exists(~#set~0.base, ~#set~0.offset, ~n~0, #t~mem3); {32181#true} is VALID [2018-11-18 23:03:49,710 INFO L273 TraceCheckUtils]: 170: Hoare triple {32181#true} ~set.base, ~set.offset := #in~set.base, #in~set.offset;~size := #in~size;~value := #in~value;havoc ~i~0;~i~0 := 0; {32181#true} is VALID [2018-11-18 23:03:49,710 INFO L273 TraceCheckUtils]: 171: Hoare triple {32181#true} assume true; {32181#true} is VALID [2018-11-18 23:03:49,710 INFO L273 TraceCheckUtils]: 172: Hoare triple {32181#true} assume !!(~i~0 < ~size);call #t~mem1 := read~int(~set.base, ~set.offset + 4 * ~i~0, 4); {32181#true} is VALID [2018-11-18 23:03:49,711 INFO L273 TraceCheckUtils]: 173: Hoare triple {32181#true} assume #t~mem1 == ~value;havoc #t~mem1;#res := 1; {32181#true} is VALID [2018-11-18 23:03:49,711 INFO L273 TraceCheckUtils]: 174: Hoare triple {32181#true} assume true; {32181#true} is VALID [2018-11-18 23:03:49,712 INFO L268 TraceCheckUtils]: 175: Hoare quadruple {32181#true} {32705#(<= 13 main_~v~0)} #132#return; {32705#(<= 13 main_~v~0)} is VALID [2018-11-18 23:03:49,712 INFO L273 TraceCheckUtils]: 176: Hoare triple {32705#(<= 13 main_~v~0)} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {32705#(<= 13 main_~v~0)} is VALID [2018-11-18 23:03:49,713 INFO L273 TraceCheckUtils]: 177: Hoare triple {32705#(<= 13 main_~v~0)} assume !(1 != #t~ret4);havoc #t~mem3;havoc #t~ret4; {32705#(<= 13 main_~v~0)} is VALID [2018-11-18 23:03:49,714 INFO L273 TraceCheckUtils]: 178: Hoare triple {32705#(<= 13 main_~v~0)} #t~post2 := ~v~0;~v~0 := 1 + #t~post2;havoc #t~post2; {32742#(<= 14 main_~v~0)} is VALID [2018-11-18 23:03:49,714 INFO L273 TraceCheckUtils]: 179: Hoare triple {32742#(<= 14 main_~v~0)} assume true; {32742#(<= 14 main_~v~0)} is VALID [2018-11-18 23:03:49,715 INFO L273 TraceCheckUtils]: 180: Hoare triple {32742#(<= 14 main_~v~0)} assume !!(~v~0 < ~SIZE~0);call #t~mem3 := read~int(~#values~0.base, ~#values~0.offset + 4 * ~v~0, 4); {32742#(<= 14 main_~v~0)} is VALID [2018-11-18 23:03:49,715 INFO L256 TraceCheckUtils]: 181: Hoare triple {32742#(<= 14 main_~v~0)} call #t~ret4 := elem_exists(~#set~0.base, ~#set~0.offset, ~n~0, #t~mem3); {32181#true} is VALID [2018-11-18 23:03:49,715 INFO L273 TraceCheckUtils]: 182: Hoare triple {32181#true} ~set.base, ~set.offset := #in~set.base, #in~set.offset;~size := #in~size;~value := #in~value;havoc ~i~0;~i~0 := 0; {32181#true} is VALID [2018-11-18 23:03:49,715 INFO L273 TraceCheckUtils]: 183: Hoare triple {32181#true} assume true; {32181#true} is VALID [2018-11-18 23:03:49,715 INFO L273 TraceCheckUtils]: 184: Hoare triple {32181#true} assume !!(~i~0 < ~size);call #t~mem1 := read~int(~set.base, ~set.offset + 4 * ~i~0, 4); {32181#true} is VALID [2018-11-18 23:03:49,716 INFO L273 TraceCheckUtils]: 185: Hoare triple {32181#true} assume #t~mem1 == ~value;havoc #t~mem1;#res := 1; {32181#true} is VALID [2018-11-18 23:03:49,716 INFO L273 TraceCheckUtils]: 186: Hoare triple {32181#true} assume true; {32181#true} is VALID [2018-11-18 23:03:49,717 INFO L268 TraceCheckUtils]: 187: Hoare quadruple {32181#true} {32742#(<= 14 main_~v~0)} #132#return; {32742#(<= 14 main_~v~0)} is VALID [2018-11-18 23:03:49,717 INFO L273 TraceCheckUtils]: 188: Hoare triple {32742#(<= 14 main_~v~0)} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {32742#(<= 14 main_~v~0)} is VALID [2018-11-18 23:03:49,718 INFO L273 TraceCheckUtils]: 189: Hoare triple {32742#(<= 14 main_~v~0)} assume !(1 != #t~ret4);havoc #t~mem3;havoc #t~ret4; {32742#(<= 14 main_~v~0)} is VALID [2018-11-18 23:03:49,719 INFO L273 TraceCheckUtils]: 190: Hoare triple {32742#(<= 14 main_~v~0)} #t~post2 := ~v~0;~v~0 := 1 + #t~post2;havoc #t~post2; {32779#(<= 15 main_~v~0)} is VALID [2018-11-18 23:03:49,719 INFO L273 TraceCheckUtils]: 191: Hoare triple {32779#(<= 15 main_~v~0)} assume true; {32779#(<= 15 main_~v~0)} is VALID [2018-11-18 23:03:49,719 INFO L273 TraceCheckUtils]: 192: Hoare triple {32779#(<= 15 main_~v~0)} assume !!(~v~0 < ~SIZE~0);call #t~mem3 := read~int(~#values~0.base, ~#values~0.offset + 4 * ~v~0, 4); {32779#(<= 15 main_~v~0)} is VALID [2018-11-18 23:03:49,719 INFO L256 TraceCheckUtils]: 193: Hoare triple {32779#(<= 15 main_~v~0)} call #t~ret4 := elem_exists(~#set~0.base, ~#set~0.offset, ~n~0, #t~mem3); {32181#true} is VALID [2018-11-18 23:03:49,719 INFO L273 TraceCheckUtils]: 194: Hoare triple {32181#true} ~set.base, ~set.offset := #in~set.base, #in~set.offset;~size := #in~size;~value := #in~value;havoc ~i~0;~i~0 := 0; {32181#true} is VALID [2018-11-18 23:03:49,719 INFO L273 TraceCheckUtils]: 195: Hoare triple {32181#true} assume true; {32181#true} is VALID [2018-11-18 23:03:49,720 INFO L273 TraceCheckUtils]: 196: Hoare triple {32181#true} assume !!(~i~0 < ~size);call #t~mem1 := read~int(~set.base, ~set.offset + 4 * ~i~0, 4); {32181#true} is VALID [2018-11-18 23:03:49,720 INFO L273 TraceCheckUtils]: 197: Hoare triple {32181#true} assume #t~mem1 == ~value;havoc #t~mem1;#res := 1; {32181#true} is VALID [2018-11-18 23:03:49,720 INFO L273 TraceCheckUtils]: 198: Hoare triple {32181#true} assume true; {32181#true} is VALID [2018-11-18 23:03:49,720 INFO L268 TraceCheckUtils]: 199: Hoare quadruple {32181#true} {32779#(<= 15 main_~v~0)} #132#return; {32779#(<= 15 main_~v~0)} is VALID [2018-11-18 23:03:49,721 INFO L273 TraceCheckUtils]: 200: Hoare triple {32779#(<= 15 main_~v~0)} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {32779#(<= 15 main_~v~0)} is VALID [2018-11-18 23:03:49,721 INFO L273 TraceCheckUtils]: 201: Hoare triple {32779#(<= 15 main_~v~0)} assume !(1 != #t~ret4);havoc #t~mem3;havoc #t~ret4; {32779#(<= 15 main_~v~0)} is VALID [2018-11-18 23:03:49,722 INFO L273 TraceCheckUtils]: 202: Hoare triple {32779#(<= 15 main_~v~0)} #t~post2 := ~v~0;~v~0 := 1 + #t~post2;havoc #t~post2; {32816#(<= 16 main_~v~0)} is VALID [2018-11-18 23:03:49,722 INFO L273 TraceCheckUtils]: 203: Hoare triple {32816#(<= 16 main_~v~0)} assume true; {32816#(<= 16 main_~v~0)} is VALID [2018-11-18 23:03:49,723 INFO L273 TraceCheckUtils]: 204: Hoare triple {32816#(<= 16 main_~v~0)} assume !!(~v~0 < ~SIZE~0);call #t~mem3 := read~int(~#values~0.base, ~#values~0.offset + 4 * ~v~0, 4); {32816#(<= 16 main_~v~0)} is VALID [2018-11-18 23:03:49,723 INFO L256 TraceCheckUtils]: 205: Hoare triple {32816#(<= 16 main_~v~0)} call #t~ret4 := elem_exists(~#set~0.base, ~#set~0.offset, ~n~0, #t~mem3); {32181#true} is VALID [2018-11-18 23:03:49,723 INFO L273 TraceCheckUtils]: 206: Hoare triple {32181#true} ~set.base, ~set.offset := #in~set.base, #in~set.offset;~size := #in~size;~value := #in~value;havoc ~i~0;~i~0 := 0; {32181#true} is VALID [2018-11-18 23:03:49,723 INFO L273 TraceCheckUtils]: 207: Hoare triple {32181#true} assume true; {32181#true} is VALID [2018-11-18 23:03:49,723 INFO L273 TraceCheckUtils]: 208: Hoare triple {32181#true} assume !!(~i~0 < ~size);call #t~mem1 := read~int(~set.base, ~set.offset + 4 * ~i~0, 4); {32181#true} is VALID [2018-11-18 23:03:49,723 INFO L273 TraceCheckUtils]: 209: Hoare triple {32181#true} assume #t~mem1 == ~value;havoc #t~mem1;#res := 1; {32181#true} is VALID [2018-11-18 23:03:49,724 INFO L273 TraceCheckUtils]: 210: Hoare triple {32181#true} assume true; {32181#true} is VALID [2018-11-18 23:03:49,725 INFO L268 TraceCheckUtils]: 211: Hoare quadruple {32181#true} {32816#(<= 16 main_~v~0)} #132#return; {32816#(<= 16 main_~v~0)} is VALID [2018-11-18 23:03:49,725 INFO L273 TraceCheckUtils]: 212: Hoare triple {32816#(<= 16 main_~v~0)} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {32816#(<= 16 main_~v~0)} is VALID [2018-11-18 23:03:49,726 INFO L273 TraceCheckUtils]: 213: Hoare triple {32816#(<= 16 main_~v~0)} assume !(1 != #t~ret4);havoc #t~mem3;havoc #t~ret4; {32816#(<= 16 main_~v~0)} is VALID [2018-11-18 23:03:49,726 INFO L273 TraceCheckUtils]: 214: Hoare triple {32816#(<= 16 main_~v~0)} #t~post2 := ~v~0;~v~0 := 1 + #t~post2;havoc #t~post2; {32853#(<= 17 main_~v~0)} is VALID [2018-11-18 23:03:49,726 INFO L273 TraceCheckUtils]: 215: Hoare triple {32853#(<= 17 main_~v~0)} assume true; {32853#(<= 17 main_~v~0)} is VALID [2018-11-18 23:03:49,727 INFO L273 TraceCheckUtils]: 216: Hoare triple {32853#(<= 17 main_~v~0)} assume !!(~v~0 < ~SIZE~0);call #t~mem3 := read~int(~#values~0.base, ~#values~0.offset + 4 * ~v~0, 4); {32853#(<= 17 main_~v~0)} is VALID [2018-11-18 23:03:49,727 INFO L256 TraceCheckUtils]: 217: Hoare triple {32853#(<= 17 main_~v~0)} call #t~ret4 := elem_exists(~#set~0.base, ~#set~0.offset, ~n~0, #t~mem3); {32181#true} is VALID [2018-11-18 23:03:49,727 INFO L273 TraceCheckUtils]: 218: Hoare triple {32181#true} ~set.base, ~set.offset := #in~set.base, #in~set.offset;~size := #in~size;~value := #in~value;havoc ~i~0;~i~0 := 0; {32181#true} is VALID [2018-11-18 23:03:49,727 INFO L273 TraceCheckUtils]: 219: Hoare triple {32181#true} assume true; {32181#true} is VALID [2018-11-18 23:03:49,727 INFO L273 TraceCheckUtils]: 220: Hoare triple {32181#true} assume !!(~i~0 < ~size);call #t~mem1 := read~int(~set.base, ~set.offset + 4 * ~i~0, 4); {32181#true} is VALID [2018-11-18 23:03:49,727 INFO L273 TraceCheckUtils]: 221: Hoare triple {32181#true} assume #t~mem1 == ~value;havoc #t~mem1;#res := 1; {32181#true} is VALID [2018-11-18 23:03:49,727 INFO L273 TraceCheckUtils]: 222: Hoare triple {32181#true} assume true; {32181#true} is VALID [2018-11-18 23:03:49,728 INFO L268 TraceCheckUtils]: 223: Hoare quadruple {32181#true} {32853#(<= 17 main_~v~0)} #132#return; {32853#(<= 17 main_~v~0)} is VALID [2018-11-18 23:03:49,729 INFO L273 TraceCheckUtils]: 224: Hoare triple {32853#(<= 17 main_~v~0)} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {32853#(<= 17 main_~v~0)} is VALID [2018-11-18 23:03:49,729 INFO L273 TraceCheckUtils]: 225: Hoare triple {32853#(<= 17 main_~v~0)} assume !(1 != #t~ret4);havoc #t~mem3;havoc #t~ret4; {32853#(<= 17 main_~v~0)} is VALID [2018-11-18 23:03:49,730 INFO L273 TraceCheckUtils]: 226: Hoare triple {32853#(<= 17 main_~v~0)} #t~post2 := ~v~0;~v~0 := 1 + #t~post2;havoc #t~post2; {32890#(<= 18 main_~v~0)} is VALID [2018-11-18 23:03:49,731 INFO L273 TraceCheckUtils]: 227: Hoare triple {32890#(<= 18 main_~v~0)} assume true; {32890#(<= 18 main_~v~0)} is VALID [2018-11-18 23:03:49,732 INFO L273 TraceCheckUtils]: 228: Hoare triple {32890#(<= 18 main_~v~0)} assume !!(~v~0 < ~SIZE~0);call #t~mem3 := read~int(~#values~0.base, ~#values~0.offset + 4 * ~v~0, 4); {32897#(<= 19 ~SIZE~0)} is VALID [2018-11-18 23:03:49,733 INFO L256 TraceCheckUtils]: 229: Hoare triple {32897#(<= 19 ~SIZE~0)} call #t~ret4 := elem_exists(~#set~0.base, ~#set~0.offset, ~n~0, #t~mem3); {32897#(<= 19 ~SIZE~0)} is VALID [2018-11-18 23:03:49,733 INFO L273 TraceCheckUtils]: 230: Hoare triple {32897#(<= 19 ~SIZE~0)} ~set.base, ~set.offset := #in~set.base, #in~set.offset;~size := #in~size;~value := #in~value;havoc ~i~0;~i~0 := 0; {32897#(<= 19 ~SIZE~0)} is VALID [2018-11-18 23:03:49,752 INFO L273 TraceCheckUtils]: 231: Hoare triple {32897#(<= 19 ~SIZE~0)} assume true; {32897#(<= 19 ~SIZE~0)} is VALID [2018-11-18 23:03:49,767 INFO L273 TraceCheckUtils]: 232: Hoare triple {32897#(<= 19 ~SIZE~0)} assume !!(~i~0 < ~size);call #t~mem1 := read~int(~set.base, ~set.offset + 4 * ~i~0, 4); {32897#(<= 19 ~SIZE~0)} is VALID [2018-11-18 23:03:49,776 INFO L273 TraceCheckUtils]: 233: Hoare triple {32897#(<= 19 ~SIZE~0)} assume #t~mem1 == ~value;havoc #t~mem1;#res := 1; {32897#(<= 19 ~SIZE~0)} is VALID [2018-11-18 23:03:49,785 INFO L273 TraceCheckUtils]: 234: Hoare triple {32897#(<= 19 ~SIZE~0)} assume true; {32897#(<= 19 ~SIZE~0)} is VALID [2018-11-18 23:03:49,790 INFO L268 TraceCheckUtils]: 235: Hoare quadruple {32897#(<= 19 ~SIZE~0)} {32897#(<= 19 ~SIZE~0)} #132#return; {32897#(<= 19 ~SIZE~0)} is VALID [2018-11-18 23:03:49,790 INFO L273 TraceCheckUtils]: 236: Hoare triple {32897#(<= 19 ~SIZE~0)} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {32897#(<= 19 ~SIZE~0)} is VALID [2018-11-18 23:03:49,791 INFO L273 TraceCheckUtils]: 237: Hoare triple {32897#(<= 19 ~SIZE~0)} assume !(1 != #t~ret4);havoc #t~mem3;havoc #t~ret4; {32897#(<= 19 ~SIZE~0)} is VALID [2018-11-18 23:03:49,791 INFO L273 TraceCheckUtils]: 238: Hoare triple {32897#(<= 19 ~SIZE~0)} #t~post2 := ~v~0;~v~0 := 1 + #t~post2;havoc #t~post2; {32897#(<= 19 ~SIZE~0)} is VALID [2018-11-18 23:03:49,791 INFO L273 TraceCheckUtils]: 239: Hoare triple {32897#(<= 19 ~SIZE~0)} assume true; {32897#(<= 19 ~SIZE~0)} is VALID [2018-11-18 23:03:49,791 INFO L273 TraceCheckUtils]: 240: Hoare triple {32897#(<= 19 ~SIZE~0)} assume !(~v~0 < ~SIZE~0); {32897#(<= 19 ~SIZE~0)} is VALID [2018-11-18 23:03:49,792 INFO L273 TraceCheckUtils]: 241: Hoare triple {32897#(<= 19 ~SIZE~0)} ~i~1 := 0; {32937#(and (<= main_~i~1 0) (<= 19 ~SIZE~0))} is VALID [2018-11-18 23:03:49,792 INFO L273 TraceCheckUtils]: 242: Hoare triple {32937#(and (<= main_~i~1 0) (<= 19 ~SIZE~0))} assume true; {32937#(and (<= main_~i~1 0) (<= 19 ~SIZE~0))} is VALID [2018-11-18 23:03:49,793 INFO L273 TraceCheckUtils]: 243: Hoare triple {32937#(and (<= main_~i~1 0) (<= 19 ~SIZE~0))} assume !!(~i~1 < ~SIZE~0 && 1 != ~found~0);call #t~mem8 := read~int(~#set~0.base, ~#set~0.offset + 4 * ~i~1, 4); {32937#(and (<= main_~i~1 0) (<= 19 ~SIZE~0))} is VALID [2018-11-18 23:03:49,793 INFO L273 TraceCheckUtils]: 244: Hoare triple {32937#(and (<= main_~i~1 0) (<= 19 ~SIZE~0))} assume #t~mem8 == ~element~0;havoc #t~mem8;~found~0 := 1;~pos~0 := ~i~1; {32947#(and (<= main_~pos~0 0) (<= 19 ~SIZE~0))} is VALID [2018-11-18 23:03:49,793 INFO L273 TraceCheckUtils]: 245: Hoare triple {32947#(and (<= main_~pos~0 0) (<= 19 ~SIZE~0))} #t~post7 := ~i~1;~i~1 := 1 + #t~post7;havoc #t~post7; {32947#(and (<= main_~pos~0 0) (<= 19 ~SIZE~0))} is VALID [2018-11-18 23:03:49,794 INFO L273 TraceCheckUtils]: 246: Hoare triple {32947#(and (<= main_~pos~0 0) (<= 19 ~SIZE~0))} assume true; {32947#(and (<= main_~pos~0 0) (<= 19 ~SIZE~0))} is VALID [2018-11-18 23:03:49,795 INFO L273 TraceCheckUtils]: 247: Hoare triple {32947#(and (<= main_~pos~0 0) (<= 19 ~SIZE~0))} assume !(~i~1 < ~SIZE~0 && 1 != ~found~0); {32947#(and (<= main_~pos~0 0) (<= 19 ~SIZE~0))} is VALID [2018-11-18 23:03:49,795 INFO L273 TraceCheckUtils]: 248: Hoare triple {32947#(and (<= main_~pos~0 0) (<= 19 ~SIZE~0))} assume 1 == ~found~0;~i~1 := ~pos~0; {32937#(and (<= main_~i~1 0) (<= 19 ~SIZE~0))} is VALID [2018-11-18 23:03:49,796 INFO L273 TraceCheckUtils]: 249: Hoare triple {32937#(and (<= main_~i~1 0) (<= 19 ~SIZE~0))} assume true; {32937#(and (<= main_~i~1 0) (<= 19 ~SIZE~0))} is VALID [2018-11-18 23:03:49,797 INFO L273 TraceCheckUtils]: 250: Hoare triple {32937#(and (<= main_~i~1 0) (<= 19 ~SIZE~0))} assume !!(~i~1 < ~SIZE~0 - 1);call #t~mem10 := read~int(~#set~0.base, ~#set~0.offset + 4 * (1 + ~i~1), 4);call write~int(#t~mem10, ~#set~0.base, ~#set~0.offset + 4 * ~i~1, 4);havoc #t~mem10; {32937#(and (<= main_~i~1 0) (<= 19 ~SIZE~0))} is VALID [2018-11-18 23:03:49,798 INFO L273 TraceCheckUtils]: 251: Hoare triple {32937#(and (<= main_~i~1 0) (<= 19 ~SIZE~0))} #t~post9 := ~i~1;~i~1 := 1 + #t~post9;havoc #t~post9; {32969#(and (<= main_~i~1 1) (<= 19 ~SIZE~0))} is VALID [2018-11-18 23:03:49,798 INFO L273 TraceCheckUtils]: 252: Hoare triple {32969#(and (<= main_~i~1 1) (<= 19 ~SIZE~0))} assume true; {32969#(and (<= main_~i~1 1) (<= 19 ~SIZE~0))} is VALID [2018-11-18 23:03:49,799 INFO L273 TraceCheckUtils]: 253: Hoare triple {32969#(and (<= main_~i~1 1) (<= 19 ~SIZE~0))} assume !!(~i~1 < ~SIZE~0 - 1);call #t~mem10 := read~int(~#set~0.base, ~#set~0.offset + 4 * (1 + ~i~1), 4);call write~int(#t~mem10, ~#set~0.base, ~#set~0.offset + 4 * ~i~1, 4);havoc #t~mem10; {32969#(and (<= main_~i~1 1) (<= 19 ~SIZE~0))} is VALID [2018-11-18 23:03:49,800 INFO L273 TraceCheckUtils]: 254: Hoare triple {32969#(and (<= main_~i~1 1) (<= 19 ~SIZE~0))} #t~post9 := ~i~1;~i~1 := 1 + #t~post9;havoc #t~post9; {32979#(and (<= main_~i~1 2) (<= 19 ~SIZE~0))} is VALID [2018-11-18 23:03:49,801 INFO L273 TraceCheckUtils]: 255: Hoare triple {32979#(and (<= main_~i~1 2) (<= 19 ~SIZE~0))} assume true; {32979#(and (<= main_~i~1 2) (<= 19 ~SIZE~0))} is VALID [2018-11-18 23:03:49,801 INFO L273 TraceCheckUtils]: 256: Hoare triple {32979#(and (<= main_~i~1 2) (<= 19 ~SIZE~0))} assume !!(~i~1 < ~SIZE~0 - 1);call #t~mem10 := read~int(~#set~0.base, ~#set~0.offset + 4 * (1 + ~i~1), 4);call write~int(#t~mem10, ~#set~0.base, ~#set~0.offset + 4 * ~i~1, 4);havoc #t~mem10; {32979#(and (<= main_~i~1 2) (<= 19 ~SIZE~0))} is VALID [2018-11-18 23:03:49,802 INFO L273 TraceCheckUtils]: 257: Hoare triple {32979#(and (<= main_~i~1 2) (<= 19 ~SIZE~0))} #t~post9 := ~i~1;~i~1 := 1 + #t~post9;havoc #t~post9; {32989#(and (<= main_~i~1 3) (<= 19 ~SIZE~0))} is VALID [2018-11-18 23:03:49,803 INFO L273 TraceCheckUtils]: 258: Hoare triple {32989#(and (<= main_~i~1 3) (<= 19 ~SIZE~0))} assume true; {32989#(and (<= main_~i~1 3) (<= 19 ~SIZE~0))} is VALID [2018-11-18 23:03:49,804 INFO L273 TraceCheckUtils]: 259: Hoare triple {32989#(and (<= main_~i~1 3) (<= 19 ~SIZE~0))} assume !!(~i~1 < ~SIZE~0 - 1);call #t~mem10 := read~int(~#set~0.base, ~#set~0.offset + 4 * (1 + ~i~1), 4);call write~int(#t~mem10, ~#set~0.base, ~#set~0.offset + 4 * ~i~1, 4);havoc #t~mem10; {32989#(and (<= main_~i~1 3) (<= 19 ~SIZE~0))} is VALID [2018-11-18 23:03:49,805 INFO L273 TraceCheckUtils]: 260: Hoare triple {32989#(and (<= main_~i~1 3) (<= 19 ~SIZE~0))} #t~post9 := ~i~1;~i~1 := 1 + #t~post9;havoc #t~post9; {32999#(and (<= main_~i~1 4) (<= 19 ~SIZE~0))} is VALID [2018-11-18 23:03:49,805 INFO L273 TraceCheckUtils]: 261: Hoare triple {32999#(and (<= main_~i~1 4) (<= 19 ~SIZE~0))} assume true; {32999#(and (<= main_~i~1 4) (<= 19 ~SIZE~0))} is VALID [2018-11-18 23:03:49,806 INFO L273 TraceCheckUtils]: 262: Hoare triple {32999#(and (<= main_~i~1 4) (<= 19 ~SIZE~0))} assume !!(~i~1 < ~SIZE~0 - 1);call #t~mem10 := read~int(~#set~0.base, ~#set~0.offset + 4 * (1 + ~i~1), 4);call write~int(#t~mem10, ~#set~0.base, ~#set~0.offset + 4 * ~i~1, 4);havoc #t~mem10; {32999#(and (<= main_~i~1 4) (<= 19 ~SIZE~0))} is VALID [2018-11-18 23:03:49,807 INFO L273 TraceCheckUtils]: 263: Hoare triple {32999#(and (<= main_~i~1 4) (<= 19 ~SIZE~0))} #t~post9 := ~i~1;~i~1 := 1 + #t~post9;havoc #t~post9; {33009#(and (<= main_~i~1 5) (<= 19 ~SIZE~0))} is VALID [2018-11-18 23:03:49,807 INFO L273 TraceCheckUtils]: 264: Hoare triple {33009#(and (<= main_~i~1 5) (<= 19 ~SIZE~0))} assume true; {33009#(and (<= main_~i~1 5) (<= 19 ~SIZE~0))} is VALID [2018-11-18 23:03:49,808 INFO L273 TraceCheckUtils]: 265: Hoare triple {33009#(and (<= main_~i~1 5) (<= 19 ~SIZE~0))} assume !(~i~1 < ~SIZE~0 - 1); {32182#false} is VALID [2018-11-18 23:03:49,808 INFO L273 TraceCheckUtils]: 266: Hoare triple {32182#false} assume 1 == ~found~0;~i~1 := 0; {32182#false} is VALID [2018-11-18 23:03:49,809 INFO L273 TraceCheckUtils]: 267: Hoare triple {32182#false} assume true; {32182#false} is VALID [2018-11-18 23:03:49,809 INFO L273 TraceCheckUtils]: 268: Hoare triple {32182#false} assume !!(~i~1 < ~SIZE~0 - 1);call #t~mem12 := read~int(~#set~0.base, ~#set~0.offset + 4 * ~i~1, 4); {32182#false} is VALID [2018-11-18 23:03:49,809 INFO L256 TraceCheckUtils]: 269: Hoare triple {32182#false} call __VERIFIER_assert((if #t~mem12 != ~element~0 then 1 else 0)); {32182#false} is VALID [2018-11-18 23:03:49,809 INFO L273 TraceCheckUtils]: 270: Hoare triple {32182#false} ~cond := #in~cond; {32182#false} is VALID [2018-11-18 23:03:49,809 INFO L273 TraceCheckUtils]: 271: Hoare triple {32182#false} assume 0 == ~cond; {32182#false} is VALID [2018-11-18 23:03:49,809 INFO L273 TraceCheckUtils]: 272: Hoare triple {32182#false} assume !false; {32182#false} is VALID [2018-11-18 23:03:49,850 INFO L134 CoverageAnalysis]: Checked inductivity of 2114 backedges. 1061 proven. 152 refuted. 0 times theorem prover too weak. 901 trivial. 0 not checked. [2018-11-18 23:03:49,870 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-18 23:03:49,871 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 29] total 37 [2018-11-18 23:03:49,871 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 273 [2018-11-18 23:03:49,871 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-18 23:03:49,875 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 37 states. [2018-11-18 23:03:50,653 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 232 edges. 232 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 23:03:50,654 INFO L459 AbstractCegarLoop]: Interpolant automaton has 37 states [2018-11-18 23:03:50,654 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2018-11-18 23:03:50,655 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=291, Invalid=1041, Unknown=0, NotChecked=0, Total=1332 [2018-11-18 23:03:50,655 INFO L87 Difference]: Start difference. First operand 285 states and 383 transitions. Second operand 37 states. [2018-11-18 23:04:02,367 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 23:04:02,367 INFO L93 Difference]: Finished difference Result 403 states and 519 transitions. [2018-11-18 23:04:02,367 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2018-11-18 23:04:02,367 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 273 [2018-11-18 23:04:02,368 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 23:04:02,368 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2018-11-18 23:04:02,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 406 transitions. [2018-11-18 23:04:02,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2018-11-18 23:04:02,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 406 transitions. [2018-11-18 23:04:02,378 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 35 states and 406 transitions. [2018-11-18 23:04:02,894 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 406 edges. 406 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 23:04:02,908 INFO L225 Difference]: With dead ends: 403 [2018-11-18 23:04:02,908 INFO L226 Difference]: Without dead ends: 391 [2018-11-18 23:04:02,910 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 315 GetRequests, 247 SyntacticMatches, 1 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 587 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=1429, Invalid=3263, Unknown=0, NotChecked=0, Total=4692 [2018-11-18 23:04:02,911 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 391 states. [2018-11-18 23:04:03,575 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 391 to 288. [2018-11-18 23:04:03,575 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-18 23:04:03,576 INFO L82 GeneralOperation]: Start isEquivalent. First operand 391 states. Second operand 288 states. [2018-11-18 23:04:03,576 INFO L74 IsIncluded]: Start isIncluded. First operand 391 states. Second operand 288 states. [2018-11-18 23:04:03,576 INFO L87 Difference]: Start difference. First operand 391 states. Second operand 288 states. [2018-11-18 23:04:03,587 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 23:04:03,588 INFO L93 Difference]: Finished difference Result 391 states and 506 transitions. [2018-11-18 23:04:03,588 INFO L276 IsEmpty]: Start isEmpty. Operand 391 states and 506 transitions. [2018-11-18 23:04:03,589 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 23:04:03,589 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 23:04:03,589 INFO L74 IsIncluded]: Start isIncluded. First operand 288 states. Second operand 391 states. [2018-11-18 23:04:03,589 INFO L87 Difference]: Start difference. First operand 288 states. Second operand 391 states. [2018-11-18 23:04:03,599 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 23:04:03,600 INFO L93 Difference]: Finished difference Result 391 states and 506 transitions. [2018-11-18 23:04:03,600 INFO L276 IsEmpty]: Start isEmpty. Operand 391 states and 506 transitions. [2018-11-18 23:04:03,601 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 23:04:03,601 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 23:04:03,601 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-18 23:04:03,601 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-18 23:04:03,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 288 states. [2018-11-18 23:04:03,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 288 states to 288 states and 386 transitions. [2018-11-18 23:04:03,611 INFO L78 Accepts]: Start accepts. Automaton has 288 states and 386 transitions. Word has length 273 [2018-11-18 23:04:03,611 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 23:04:03,611 INFO L480 AbstractCegarLoop]: Abstraction has 288 states and 386 transitions. [2018-11-18 23:04:03,612 INFO L481 AbstractCegarLoop]: Interpolant automaton has 37 states. [2018-11-18 23:04:03,612 INFO L276 IsEmpty]: Start isEmpty. Operand 288 states and 386 transitions. [2018-11-18 23:04:03,614 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 274 [2018-11-18 23:04:03,614 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 23:04:03,614 INFO L375 BasicCegarLoop]: trace histogram [20, 19, 19, 19, 19, 19, 19, 19, 19, 18, 18, 18, 5, 4, 4, 3, 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] [2018-11-18 23:04:03,614 INFO L423 AbstractCegarLoop]: === Iteration 27 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 23:04:03,615 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 23:04:03,615 INFO L82 PathProgramCache]: Analyzing trace with hash -572473368, now seen corresponding path program 10 times [2018-11-18 23:04:03,615 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 23:04:03,615 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 23:04:03,616 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 23:04:03,616 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 23:04:03,616 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 23:04:03,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 23:04:05,235 INFO L256 TraceCheckUtils]: 0: Hoare triple {34788#true} call ULTIMATE.init(); {34788#true} is VALID [2018-11-18 23:04:05,254 INFO L273 TraceCheckUtils]: 1: Hoare triple {34788#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~SIZE~0 := 100000; {34790#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:04:05,268 INFO L273 TraceCheckUtils]: 2: Hoare triple {34790#(<= 100000 ~SIZE~0)} assume true; {34790#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:04:05,277 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {34790#(<= 100000 ~SIZE~0)} {34788#true} #128#return; {34790#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:04:05,279 INFO L256 TraceCheckUtils]: 4: Hoare triple {34790#(<= 100000 ~SIZE~0)} call #t~ret13 := main(); {34790#(<= 100000 ~SIZE~0)} is VALID [2018-11-18 23:04:05,280 INFO L273 TraceCheckUtils]: 5: Hoare triple {34790#(<= 100000 ~SIZE~0)} havoc ~i~1;havoc ~pos~0;~n~0 := 0;~found~0 := 0;call ~#set~0.base, ~#set~0.offset := #Ultimate.alloc(4 * ~SIZE~0);call ~#values~0.base, ~#values~0.offset := #Ultimate.alloc(4 * ~SIZE~0);havoc ~element~0;havoc ~v~0;~v~0 := 0; {34791#(and (= main_~v~0 0) (<= 100000 ~SIZE~0))} is VALID [2018-11-18 23:04:05,280 INFO L273 TraceCheckUtils]: 6: Hoare triple {34791#(and (= main_~v~0 0) (<= 100000 ~SIZE~0))} assume true; {34791#(and (= main_~v~0 0) (<= 100000 ~SIZE~0))} is VALID [2018-11-18 23:04:05,281 INFO L273 TraceCheckUtils]: 7: Hoare triple {34791#(and (= main_~v~0 0) (<= 100000 ~SIZE~0))} assume !!(~v~0 < ~SIZE~0);call #t~mem3 := read~int(~#values~0.base, ~#values~0.offset + 4 * ~v~0, 4); {34791#(and (= main_~v~0 0) (<= 100000 ~SIZE~0))} is VALID [2018-11-18 23:04:05,281 INFO L256 TraceCheckUtils]: 8: Hoare triple {34791#(and (= main_~v~0 0) (<= 100000 ~SIZE~0))} call #t~ret4 := elem_exists(~#set~0.base, ~#set~0.offset, ~n~0, #t~mem3); {34788#true} is VALID [2018-11-18 23:04:05,281 INFO L273 TraceCheckUtils]: 9: Hoare triple {34788#true} ~set.base, ~set.offset := #in~set.base, #in~set.offset;~size := #in~size;~value := #in~value;havoc ~i~0;~i~0 := 0; {34788#true} is VALID [2018-11-18 23:04:05,281 INFO L273 TraceCheckUtils]: 10: Hoare triple {34788#true} assume true; {34788#true} is VALID [2018-11-18 23:04:05,281 INFO L273 TraceCheckUtils]: 11: Hoare triple {34788#true} assume !(~i~0 < ~size); {34788#true} is VALID [2018-11-18 23:04:05,282 INFO L273 TraceCheckUtils]: 12: Hoare triple {34788#true} #res := 0; {34788#true} is VALID [2018-11-18 23:04:05,282 INFO L273 TraceCheckUtils]: 13: Hoare triple {34788#true} assume true; {34788#true} is VALID [2018-11-18 23:04:05,282 INFO L268 TraceCheckUtils]: 14: Hoare quadruple {34788#true} {34791#(and (= main_~v~0 0) (<= 100000 ~SIZE~0))} #132#return; {34791#(and (= main_~v~0 0) (<= 100000 ~SIZE~0))} is VALID [2018-11-18 23:04:05,283 INFO L273 TraceCheckUtils]: 15: Hoare triple {34791#(and (= main_~v~0 0) (<= 100000 ~SIZE~0))} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {34791#(and (= main_~v~0 0) (<= 100000 ~SIZE~0))} is VALID [2018-11-18 23:04:05,283 INFO L273 TraceCheckUtils]: 16: Hoare triple {34791#(and (= main_~v~0 0) (<= 100000 ~SIZE~0))} assume 1 != #t~ret4;havoc #t~mem3;havoc #t~ret4;call #t~mem5 := read~int(~#values~0.base, ~#values~0.offset + 4 * ~v~0, 4); {34791#(and (= main_~v~0 0) (<= 100000 ~SIZE~0))} is VALID [2018-11-18 23:04:05,284 INFO L256 TraceCheckUtils]: 17: Hoare triple {34791#(and (= main_~v~0 0) (<= 100000 ~SIZE~0))} call #t~ret6 := insert(~#set~0.base, ~#set~0.offset, ~n~0, #t~mem5); {34788#true} is VALID [2018-11-18 23:04:05,284 INFO L273 TraceCheckUtils]: 18: Hoare triple {34788#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; {34788#true} is VALID [2018-11-18 23:04:05,284 INFO L273 TraceCheckUtils]: 19: Hoare triple {34788#true} assume true; {34788#true} is VALID [2018-11-18 23:04:05,285 INFO L268 TraceCheckUtils]: 20: Hoare quadruple {34788#true} {34791#(and (= main_~v~0 0) (<= 100000 ~SIZE~0))} #134#return; {34791#(and (= main_~v~0 0) (<= 100000 ~SIZE~0))} is VALID [2018-11-18 23:04:05,286 INFO L273 TraceCheckUtils]: 21: Hoare triple {34791#(and (= main_~v~0 0) (<= 100000 ~SIZE~0))} assume -2147483648 <= #t~ret6 && #t~ret6 <= 2147483647;~n~0 := #t~ret6;havoc #t~ret6;havoc #t~mem5; {34791#(and (= main_~v~0 0) (<= 100000 ~SIZE~0))} is VALID [2018-11-18 23:04:05,287 INFO L273 TraceCheckUtils]: 22: Hoare triple {34791#(and (= main_~v~0 0) (<= 100000 ~SIZE~0))} #t~post2 := ~v~0;~v~0 := 1 + #t~post2;havoc #t~post2; {34792#(<= (+ main_~v~0 99999) ~SIZE~0)} is VALID [2018-11-18 23:04:05,287 INFO L273 TraceCheckUtils]: 23: Hoare triple {34792#(<= (+ main_~v~0 99999) ~SIZE~0)} assume true; {34792#(<= (+ main_~v~0 99999) ~SIZE~0)} is VALID [2018-11-18 23:04:05,288 INFO L273 TraceCheckUtils]: 24: Hoare triple {34792#(<= (+ main_~v~0 99999) ~SIZE~0)} assume !!(~v~0 < ~SIZE~0);call #t~mem3 := read~int(~#values~0.base, ~#values~0.offset + 4 * ~v~0, 4); {34792#(<= (+ main_~v~0 99999) ~SIZE~0)} is VALID [2018-11-18 23:04:05,288 INFO L256 TraceCheckUtils]: 25: Hoare triple {34792#(<= (+ main_~v~0 99999) ~SIZE~0)} call #t~ret4 := elem_exists(~#set~0.base, ~#set~0.offset, ~n~0, #t~mem3); {34788#true} is VALID [2018-11-18 23:04:05,288 INFO L273 TraceCheckUtils]: 26: Hoare triple {34788#true} ~set.base, ~set.offset := #in~set.base, #in~set.offset;~size := #in~size;~value := #in~value;havoc ~i~0;~i~0 := 0; {34788#true} is VALID [2018-11-18 23:04:05,288 INFO L273 TraceCheckUtils]: 27: Hoare triple {34788#true} assume true; {34788#true} is VALID [2018-11-18 23:04:05,288 INFO L273 TraceCheckUtils]: 28: Hoare triple {34788#true} assume !!(~i~0 < ~size);call #t~mem1 := read~int(~set.base, ~set.offset + 4 * ~i~0, 4); {34788#true} is VALID [2018-11-18 23:04:05,288 INFO L273 TraceCheckUtils]: 29: Hoare triple {34788#true} assume #t~mem1 == ~value;havoc #t~mem1;#res := 1; {34788#true} is VALID [2018-11-18 23:04:05,289 INFO L273 TraceCheckUtils]: 30: Hoare triple {34788#true} assume true; {34788#true} is VALID [2018-11-18 23:04:05,290 INFO L268 TraceCheckUtils]: 31: Hoare quadruple {34788#true} {34792#(<= (+ main_~v~0 99999) ~SIZE~0)} #132#return; {34792#(<= (+ main_~v~0 99999) ~SIZE~0)} is VALID [2018-11-18 23:04:05,290 INFO L273 TraceCheckUtils]: 32: Hoare triple {34792#(<= (+ main_~v~0 99999) ~SIZE~0)} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {34792#(<= (+ main_~v~0 99999) ~SIZE~0)} is VALID [2018-11-18 23:04:05,290 INFO L273 TraceCheckUtils]: 33: Hoare triple {34792#(<= (+ main_~v~0 99999) ~SIZE~0)} assume !(1 != #t~ret4);havoc #t~mem3;havoc #t~ret4; {34792#(<= (+ main_~v~0 99999) ~SIZE~0)} is VALID [2018-11-18 23:04:05,291 INFO L273 TraceCheckUtils]: 34: Hoare triple {34792#(<= (+ main_~v~0 99999) ~SIZE~0)} #t~post2 := ~v~0;~v~0 := 1 + #t~post2;havoc #t~post2; {34793#(<= (+ main_~v~0 99998) ~SIZE~0)} is VALID [2018-11-18 23:04:05,291 INFO L273 TraceCheckUtils]: 35: Hoare triple {34793#(<= (+ main_~v~0 99998) ~SIZE~0)} assume true; {34793#(<= (+ main_~v~0 99998) ~SIZE~0)} is VALID [2018-11-18 23:04:05,292 INFO L273 TraceCheckUtils]: 36: Hoare triple {34793#(<= (+ main_~v~0 99998) ~SIZE~0)} assume !!(~v~0 < ~SIZE~0);call #t~mem3 := read~int(~#values~0.base, ~#values~0.offset + 4 * ~v~0, 4); {34793#(<= (+ main_~v~0 99998) ~SIZE~0)} is VALID [2018-11-18 23:04:05,292 INFO L256 TraceCheckUtils]: 37: Hoare triple {34793#(<= (+ main_~v~0 99998) ~SIZE~0)} call #t~ret4 := elem_exists(~#set~0.base, ~#set~0.offset, ~n~0, #t~mem3); {34788#true} is VALID [2018-11-18 23:04:05,292 INFO L273 TraceCheckUtils]: 38: Hoare triple {34788#true} ~set.base, ~set.offset := #in~set.base, #in~set.offset;~size := #in~size;~value := #in~value;havoc ~i~0;~i~0 := 0; {34788#true} is VALID [2018-11-18 23:04:05,292 INFO L273 TraceCheckUtils]: 39: Hoare triple {34788#true} assume true; {34788#true} is VALID [2018-11-18 23:04:05,292 INFO L273 TraceCheckUtils]: 40: Hoare triple {34788#true} assume !!(~i~0 < ~size);call #t~mem1 := read~int(~set.base, ~set.offset + 4 * ~i~0, 4); {34788#true} is VALID [2018-11-18 23:04:05,292 INFO L273 TraceCheckUtils]: 41: Hoare triple {34788#true} assume #t~mem1 == ~value;havoc #t~mem1;#res := 1; {34788#true} is VALID [2018-11-18 23:04:05,293 INFO L273 TraceCheckUtils]: 42: Hoare triple {34788#true} assume true; {34788#true} is VALID [2018-11-18 23:04:05,294 INFO L268 TraceCheckUtils]: 43: Hoare quadruple {34788#true} {34793#(<= (+ main_~v~0 99998) ~SIZE~0)} #132#return; {34793#(<= (+ main_~v~0 99998) ~SIZE~0)} is VALID [2018-11-18 23:04:05,294 INFO L273 TraceCheckUtils]: 44: Hoare triple {34793#(<= (+ main_~v~0 99998) ~SIZE~0)} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {34793#(<= (+ main_~v~0 99998) ~SIZE~0)} is VALID [2018-11-18 23:04:05,295 INFO L273 TraceCheckUtils]: 45: Hoare triple {34793#(<= (+ main_~v~0 99998) ~SIZE~0)} assume !(1 != #t~ret4);havoc #t~mem3;havoc #t~ret4; {34793#(<= (+ main_~v~0 99998) ~SIZE~0)} is VALID [2018-11-18 23:04:05,295 INFO L273 TraceCheckUtils]: 46: Hoare triple {34793#(<= (+ main_~v~0 99998) ~SIZE~0)} #t~post2 := ~v~0;~v~0 := 1 + #t~post2;havoc #t~post2; {34794#(<= (+ main_~v~0 99997) ~SIZE~0)} is VALID [2018-11-18 23:04:05,296 INFO L273 TraceCheckUtils]: 47: Hoare triple {34794#(<= (+ main_~v~0 99997) ~SIZE~0)} assume true; {34794#(<= (+ main_~v~0 99997) ~SIZE~0)} is VALID [2018-11-18 23:04:05,297 INFO L273 TraceCheckUtils]: 48: Hoare triple {34794#(<= (+ main_~v~0 99997) ~SIZE~0)} assume !!(~v~0 < ~SIZE~0);call #t~mem3 := read~int(~#values~0.base, ~#values~0.offset + 4 * ~v~0, 4); {34794#(<= (+ main_~v~0 99997) ~SIZE~0)} is VALID [2018-11-18 23:04:05,297 INFO L256 TraceCheckUtils]: 49: Hoare triple {34794#(<= (+ main_~v~0 99997) ~SIZE~0)} call #t~ret4 := elem_exists(~#set~0.base, ~#set~0.offset, ~n~0, #t~mem3); {34788#true} is VALID [2018-11-18 23:04:05,297 INFO L273 TraceCheckUtils]: 50: Hoare triple {34788#true} ~set.base, ~set.offset := #in~set.base, #in~set.offset;~size := #in~size;~value := #in~value;havoc ~i~0;~i~0 := 0; {34788#true} is VALID [2018-11-18 23:04:05,297 INFO L273 TraceCheckUtils]: 51: Hoare triple {34788#true} assume true; {34788#true} is VALID [2018-11-18 23:04:05,297 INFO L273 TraceCheckUtils]: 52: Hoare triple {34788#true} assume !!(~i~0 < ~size);call #t~mem1 := read~int(~set.base, ~set.offset + 4 * ~i~0, 4); {34788#true} is VALID [2018-11-18 23:04:05,297 INFO L273 TraceCheckUtils]: 53: Hoare triple {34788#true} assume #t~mem1 == ~value;havoc #t~mem1;#res := 1; {34788#true} is VALID [2018-11-18 23:04:05,298 INFO L273 TraceCheckUtils]: 54: Hoare triple {34788#true} assume true; {34788#true} is VALID [2018-11-18 23:04:05,299 INFO L268 TraceCheckUtils]: 55: Hoare quadruple {34788#true} {34794#(<= (+ main_~v~0 99997) ~SIZE~0)} #132#return; {34794#(<= (+ main_~v~0 99997) ~SIZE~0)} is VALID [2018-11-18 23:04:05,299 INFO L273 TraceCheckUtils]: 56: Hoare triple {34794#(<= (+ main_~v~0 99997) ~SIZE~0)} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {34794#(<= (+ main_~v~0 99997) ~SIZE~0)} is VALID [2018-11-18 23:04:05,299 INFO L273 TraceCheckUtils]: 57: Hoare triple {34794#(<= (+ main_~v~0 99997) ~SIZE~0)} assume !(1 != #t~ret4);havoc #t~mem3;havoc #t~ret4; {34794#(<= (+ main_~v~0 99997) ~SIZE~0)} is VALID [2018-11-18 23:04:05,300 INFO L273 TraceCheckUtils]: 58: Hoare triple {34794#(<= (+ main_~v~0 99997) ~SIZE~0)} #t~post2 := ~v~0;~v~0 := 1 + #t~post2;havoc #t~post2; {34795#(<= (+ main_~v~0 99996) ~SIZE~0)} is VALID [2018-11-18 23:04:05,300 INFO L273 TraceCheckUtils]: 59: Hoare triple {34795#(<= (+ main_~v~0 99996) ~SIZE~0)} assume true; {34795#(<= (+ main_~v~0 99996) ~SIZE~0)} is VALID [2018-11-18 23:04:05,301 INFO L273 TraceCheckUtils]: 60: Hoare triple {34795#(<= (+ main_~v~0 99996) ~SIZE~0)} assume !!(~v~0 < ~SIZE~0);call #t~mem3 := read~int(~#values~0.base, ~#values~0.offset + 4 * ~v~0, 4); {34795#(<= (+ main_~v~0 99996) ~SIZE~0)} is VALID [2018-11-18 23:04:05,301 INFO L256 TraceCheckUtils]: 61: Hoare triple {34795#(<= (+ main_~v~0 99996) ~SIZE~0)} call #t~ret4 := elem_exists(~#set~0.base, ~#set~0.offset, ~n~0, #t~mem3); {34788#true} is VALID [2018-11-18 23:04:05,301 INFO L273 TraceCheckUtils]: 62: Hoare triple {34788#true} ~set.base, ~set.offset := #in~set.base, #in~set.offset;~size := #in~size;~value := #in~value;havoc ~i~0;~i~0 := 0; {34788#true} is VALID [2018-11-18 23:04:05,301 INFO L273 TraceCheckUtils]: 63: Hoare triple {34788#true} assume true; {34788#true} is VALID [2018-11-18 23:04:05,301 INFO L273 TraceCheckUtils]: 64: Hoare triple {34788#true} assume !!(~i~0 < ~size);call #t~mem1 := read~int(~set.base, ~set.offset + 4 * ~i~0, 4); {34788#true} is VALID [2018-11-18 23:04:05,301 INFO L273 TraceCheckUtils]: 65: Hoare triple {34788#true} assume #t~mem1 == ~value;havoc #t~mem1;#res := 1; {34788#true} is VALID [2018-11-18 23:04:05,301 INFO L273 TraceCheckUtils]: 66: Hoare triple {34788#true} assume true; {34788#true} is VALID [2018-11-18 23:04:05,302 INFO L268 TraceCheckUtils]: 67: Hoare quadruple {34788#true} {34795#(<= (+ main_~v~0 99996) ~SIZE~0)} #132#return; {34795#(<= (+ main_~v~0 99996) ~SIZE~0)} is VALID [2018-11-18 23:04:05,302 INFO L273 TraceCheckUtils]: 68: Hoare triple {34795#(<= (+ main_~v~0 99996) ~SIZE~0)} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {34795#(<= (+ main_~v~0 99996) ~SIZE~0)} is VALID [2018-11-18 23:04:05,303 INFO L273 TraceCheckUtils]: 69: Hoare triple {34795#(<= (+ main_~v~0 99996) ~SIZE~0)} assume !(1 != #t~ret4);havoc #t~mem3;havoc #t~ret4; {34795#(<= (+ main_~v~0 99996) ~SIZE~0)} is VALID [2018-11-18 23:04:05,304 INFO L273 TraceCheckUtils]: 70: Hoare triple {34795#(<= (+ main_~v~0 99996) ~SIZE~0)} #t~post2 := ~v~0;~v~0 := 1 + #t~post2;havoc #t~post2; {34796#(<= (+ main_~v~0 99995) ~SIZE~0)} is VALID [2018-11-18 23:04:05,304 INFO L273 TraceCheckUtils]: 71: Hoare triple {34796#(<= (+ main_~v~0 99995) ~SIZE~0)} assume true; {34796#(<= (+ main_~v~0 99995) ~SIZE~0)} is VALID [2018-11-18 23:04:05,305 INFO L273 TraceCheckUtils]: 72: Hoare triple {34796#(<= (+ main_~v~0 99995) ~SIZE~0)} assume !!(~v~0 < ~SIZE~0);call #t~mem3 := read~int(~#values~0.base, ~#values~0.offset + 4 * ~v~0, 4); {34796#(<= (+ main_~v~0 99995) ~SIZE~0)} is VALID [2018-11-18 23:04:05,305 INFO L256 TraceCheckUtils]: 73: Hoare triple {34796#(<= (+ main_~v~0 99995) ~SIZE~0)} call #t~ret4 := elem_exists(~#set~0.base, ~#set~0.offset, ~n~0, #t~mem3); {34788#true} is VALID [2018-11-18 23:04:05,305 INFO L273 TraceCheckUtils]: 74: Hoare triple {34788#true} ~set.base, ~set.offset := #in~set.base, #in~set.offset;~size := #in~size;~value := #in~value;havoc ~i~0;~i~0 := 0; {34788#true} is VALID [2018-11-18 23:04:05,305 INFO L273 TraceCheckUtils]: 75: Hoare triple {34788#true} assume true; {34788#true} is VALID [2018-11-18 23:04:05,306 INFO L273 TraceCheckUtils]: 76: Hoare triple {34788#true} assume !!(~i~0 < ~size);call #t~mem1 := read~int(~set.base, ~set.offset + 4 * ~i~0, 4); {34788#true} is VALID [2018-11-18 23:04:05,306 INFO L273 TraceCheckUtils]: 77: Hoare triple {34788#true} assume #t~mem1 == ~value;havoc #t~mem1;#res := 1; {34788#true} is VALID [2018-11-18 23:04:05,306 INFO L273 TraceCheckUtils]: 78: Hoare triple {34788#true} assume true; {34788#true} is VALID [2018-11-18 23:04:05,307 INFO L268 TraceCheckUtils]: 79: Hoare quadruple {34788#true} {34796#(<= (+ main_~v~0 99995) ~SIZE~0)} #132#return; {34796#(<= (+ main_~v~0 99995) ~SIZE~0)} is VALID [2018-11-18 23:04:05,308 INFO L273 TraceCheckUtils]: 80: Hoare triple {34796#(<= (+ main_~v~0 99995) ~SIZE~0)} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {34796#(<= (+ main_~v~0 99995) ~SIZE~0)} is VALID [2018-11-18 23:04:05,308 INFO L273 TraceCheckUtils]: 81: Hoare triple {34796#(<= (+ main_~v~0 99995) ~SIZE~0)} assume !(1 != #t~ret4);havoc #t~mem3;havoc #t~ret4; {34796#(<= (+ main_~v~0 99995) ~SIZE~0)} is VALID [2018-11-18 23:04:05,309 INFO L273 TraceCheckUtils]: 82: Hoare triple {34796#(<= (+ main_~v~0 99995) ~SIZE~0)} #t~post2 := ~v~0;~v~0 := 1 + #t~post2;havoc #t~post2; {34797#(<= (+ main_~v~0 99994) ~SIZE~0)} is VALID [2018-11-18 23:04:05,310 INFO L273 TraceCheckUtils]: 83: Hoare triple {34797#(<= (+ main_~v~0 99994) ~SIZE~0)} assume true; {34797#(<= (+ main_~v~0 99994) ~SIZE~0)} is VALID [2018-11-18 23:04:05,310 INFO L273 TraceCheckUtils]: 84: Hoare triple {34797#(<= (+ main_~v~0 99994) ~SIZE~0)} assume !!(~v~0 < ~SIZE~0);call #t~mem3 := read~int(~#values~0.base, ~#values~0.offset + 4 * ~v~0, 4); {34797#(<= (+ main_~v~0 99994) ~SIZE~0)} is VALID [2018-11-18 23:04:05,310 INFO L256 TraceCheckUtils]: 85: Hoare triple {34797#(<= (+ main_~v~0 99994) ~SIZE~0)} call #t~ret4 := elem_exists(~#set~0.base, ~#set~0.offset, ~n~0, #t~mem3); {34788#true} is VALID [2018-11-18 23:04:05,310 INFO L273 TraceCheckUtils]: 86: Hoare triple {34788#true} ~set.base, ~set.offset := #in~set.base, #in~set.offset;~size := #in~size;~value := #in~value;havoc ~i~0;~i~0 := 0; {34788#true} is VALID [2018-11-18 23:04:05,311 INFO L273 TraceCheckUtils]: 87: Hoare triple {34788#true} assume true; {34788#true} is VALID [2018-11-18 23:04:05,311 INFO L273 TraceCheckUtils]: 88: Hoare triple {34788#true} assume !!(~i~0 < ~size);call #t~mem1 := read~int(~set.base, ~set.offset + 4 * ~i~0, 4); {34788#true} is VALID [2018-11-18 23:04:05,311 INFO L273 TraceCheckUtils]: 89: Hoare triple {34788#true} assume #t~mem1 == ~value;havoc #t~mem1;#res := 1; {34788#true} is VALID [2018-11-18 23:04:05,311 INFO L273 TraceCheckUtils]: 90: Hoare triple {34788#true} assume true; {34788#true} is VALID [2018-11-18 23:04:05,312 INFO L268 TraceCheckUtils]: 91: Hoare quadruple {34788#true} {34797#(<= (+ main_~v~0 99994) ~SIZE~0)} #132#return; {34797#(<= (+ main_~v~0 99994) ~SIZE~0)} is VALID [2018-11-18 23:04:05,313 INFO L273 TraceCheckUtils]: 92: Hoare triple {34797#(<= (+ main_~v~0 99994) ~SIZE~0)} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {34797#(<= (+ main_~v~0 99994) ~SIZE~0)} is VALID [2018-11-18 23:04:05,313 INFO L273 TraceCheckUtils]: 93: Hoare triple {34797#(<= (+ main_~v~0 99994) ~SIZE~0)} assume !(1 != #t~ret4);havoc #t~mem3;havoc #t~ret4; {34797#(<= (+ main_~v~0 99994) ~SIZE~0)} is VALID [2018-11-18 23:04:05,314 INFO L273 TraceCheckUtils]: 94: Hoare triple {34797#(<= (+ main_~v~0 99994) ~SIZE~0)} #t~post2 := ~v~0;~v~0 := 1 + #t~post2;havoc #t~post2; {34798#(<= (+ main_~v~0 99993) ~SIZE~0)} is VALID [2018-11-18 23:04:05,314 INFO L273 TraceCheckUtils]: 95: Hoare triple {34798#(<= (+ main_~v~0 99993) ~SIZE~0)} assume true; {34798#(<= (+ main_~v~0 99993) ~SIZE~0)} is VALID [2018-11-18 23:04:05,315 INFO L273 TraceCheckUtils]: 96: Hoare triple {34798#(<= (+ main_~v~0 99993) ~SIZE~0)} assume !!(~v~0 < ~SIZE~0);call #t~mem3 := read~int(~#values~0.base, ~#values~0.offset + 4 * ~v~0, 4); {34798#(<= (+ main_~v~0 99993) ~SIZE~0)} is VALID [2018-11-18 23:04:05,315 INFO L256 TraceCheckUtils]: 97: Hoare triple {34798#(<= (+ main_~v~0 99993) ~SIZE~0)} call #t~ret4 := elem_exists(~#set~0.base, ~#set~0.offset, ~n~0, #t~mem3); {34788#true} is VALID [2018-11-18 23:04:05,315 INFO L273 TraceCheckUtils]: 98: Hoare triple {34788#true} ~set.base, ~set.offset := #in~set.base, #in~set.offset;~size := #in~size;~value := #in~value;havoc ~i~0;~i~0 := 0; {34788#true} is VALID [2018-11-18 23:04:05,315 INFO L273 TraceCheckUtils]: 99: Hoare triple {34788#true} assume true; {34788#true} is VALID [2018-11-18 23:04:05,315 INFO L273 TraceCheckUtils]: 100: Hoare triple {34788#true} assume !!(~i~0 < ~size);call #t~mem1 := read~int(~set.base, ~set.offset + 4 * ~i~0, 4); {34788#true} is VALID [2018-11-18 23:04:05,315 INFO L273 TraceCheckUtils]: 101: Hoare triple {34788#true} assume #t~mem1 == ~value;havoc #t~mem1;#res := 1; {34788#true} is VALID [2018-11-18 23:04:05,315 INFO L273 TraceCheckUtils]: 102: Hoare triple {34788#true} assume true; {34788#true} is VALID [2018-11-18 23:04:05,316 INFO L268 TraceCheckUtils]: 103: Hoare quadruple {34788#true} {34798#(<= (+ main_~v~0 99993) ~SIZE~0)} #132#return; {34798#(<= (+ main_~v~0 99993) ~SIZE~0)} is VALID [2018-11-18 23:04:05,316 INFO L273 TraceCheckUtils]: 104: Hoare triple {34798#(<= (+ main_~v~0 99993) ~SIZE~0)} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {34798#(<= (+ main_~v~0 99993) ~SIZE~0)} is VALID [2018-11-18 23:04:05,317 INFO L273 TraceCheckUtils]: 105: Hoare triple {34798#(<= (+ main_~v~0 99993) ~SIZE~0)} assume !(1 != #t~ret4);havoc #t~mem3;havoc #t~ret4; {34798#(<= (+ main_~v~0 99993) ~SIZE~0)} is VALID [2018-11-18 23:04:05,317 INFO L273 TraceCheckUtils]: 106: Hoare triple {34798#(<= (+ main_~v~0 99993) ~SIZE~0)} #t~post2 := ~v~0;~v~0 := 1 + #t~post2;havoc #t~post2; {34799#(<= (+ main_~v~0 99992) ~SIZE~0)} is VALID [2018-11-18 23:04:05,317 INFO L273 TraceCheckUtils]: 107: Hoare triple {34799#(<= (+ main_~v~0 99992) ~SIZE~0)} assume true; {34799#(<= (+ main_~v~0 99992) ~SIZE~0)} is VALID [2018-11-18 23:04:05,318 INFO L273 TraceCheckUtils]: 108: Hoare triple {34799#(<= (+ main_~v~0 99992) ~SIZE~0)} assume !!(~v~0 < ~SIZE~0);call #t~mem3 := read~int(~#values~0.base, ~#values~0.offset + 4 * ~v~0, 4); {34799#(<= (+ main_~v~0 99992) ~SIZE~0)} is VALID [2018-11-18 23:04:05,318 INFO L256 TraceCheckUtils]: 109: Hoare triple {34799#(<= (+ main_~v~0 99992) ~SIZE~0)} call #t~ret4 := elem_exists(~#set~0.base, ~#set~0.offset, ~n~0, #t~mem3); {34788#true} is VALID [2018-11-18 23:04:05,318 INFO L273 TraceCheckUtils]: 110: Hoare triple {34788#true} ~set.base, ~set.offset := #in~set.base, #in~set.offset;~size := #in~size;~value := #in~value;havoc ~i~0;~i~0 := 0; {34788#true} is VALID [2018-11-18 23:04:05,318 INFO L273 TraceCheckUtils]: 111: Hoare triple {34788#true} assume true; {34788#true} is VALID [2018-11-18 23:04:05,318 INFO L273 TraceCheckUtils]: 112: Hoare triple {34788#true} assume !!(~i~0 < ~size);call #t~mem1 := read~int(~set.base, ~set.offset + 4 * ~i~0, 4); {34788#true} is VALID [2018-11-18 23:04:05,318 INFO L273 TraceCheckUtils]: 113: Hoare triple {34788#true} assume #t~mem1 == ~value;havoc #t~mem1;#res := 1; {34788#true} is VALID [2018-11-18 23:04:05,318 INFO L273 TraceCheckUtils]: 114: Hoare triple {34788#true} assume true; {34788#true} is VALID [2018-11-18 23:04:05,319 INFO L268 TraceCheckUtils]: 115: Hoare quadruple {34788#true} {34799#(<= (+ main_~v~0 99992) ~SIZE~0)} #132#return; {34799#(<= (+ main_~v~0 99992) ~SIZE~0)} is VALID [2018-11-18 23:04:05,319 INFO L273 TraceCheckUtils]: 116: Hoare triple {34799#(<= (+ main_~v~0 99992) ~SIZE~0)} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {34799#(<= (+ main_~v~0 99992) ~SIZE~0)} is VALID [2018-11-18 23:04:05,320 INFO L273 TraceCheckUtils]: 117: Hoare triple {34799#(<= (+ main_~v~0 99992) ~SIZE~0)} assume !(1 != #t~ret4);havoc #t~mem3;havoc #t~ret4; {34799#(<= (+ main_~v~0 99992) ~SIZE~0)} is VALID [2018-11-18 23:04:05,320 INFO L273 TraceCheckUtils]: 118: Hoare triple {34799#(<= (+ main_~v~0 99992) ~SIZE~0)} #t~post2 := ~v~0;~v~0 := 1 + #t~post2;havoc #t~post2; {34800#(<= (+ main_~v~0 99991) ~SIZE~0)} is VALID [2018-11-18 23:04:05,321 INFO L273 TraceCheckUtils]: 119: Hoare triple {34800#(<= (+ main_~v~0 99991) ~SIZE~0)} assume true; {34800#(<= (+ main_~v~0 99991) ~SIZE~0)} is VALID [2018-11-18 23:04:05,321 INFO L273 TraceCheckUtils]: 120: Hoare triple {34800#(<= (+ main_~v~0 99991) ~SIZE~0)} assume !!(~v~0 < ~SIZE~0);call #t~mem3 := read~int(~#values~0.base, ~#values~0.offset + 4 * ~v~0, 4); {34800#(<= (+ main_~v~0 99991) ~SIZE~0)} is VALID [2018-11-18 23:04:05,322 INFO L256 TraceCheckUtils]: 121: Hoare triple {34800#(<= (+ main_~v~0 99991) ~SIZE~0)} call #t~ret4 := elem_exists(~#set~0.base, ~#set~0.offset, ~n~0, #t~mem3); {34788#true} is VALID [2018-11-18 23:04:05,322 INFO L273 TraceCheckUtils]: 122: Hoare triple {34788#true} ~set.base, ~set.offset := #in~set.base, #in~set.offset;~size := #in~size;~value := #in~value;havoc ~i~0;~i~0 := 0; {34788#true} is VALID [2018-11-18 23:04:05,322 INFO L273 TraceCheckUtils]: 123: Hoare triple {34788#true} assume true; {34788#true} is VALID [2018-11-18 23:04:05,322 INFO L273 TraceCheckUtils]: 124: Hoare triple {34788#true} assume !!(~i~0 < ~size);call #t~mem1 := read~int(~set.base, ~set.offset + 4 * ~i~0, 4); {34788#true} is VALID [2018-11-18 23:04:05,322 INFO L273 TraceCheckUtils]: 125: Hoare triple {34788#true} assume #t~mem1 == ~value;havoc #t~mem1;#res := 1; {34788#true} is VALID [2018-11-18 23:04:05,323 INFO L273 TraceCheckUtils]: 126: Hoare triple {34788#true} assume true; {34788#true} is VALID [2018-11-18 23:04:05,324 INFO L268 TraceCheckUtils]: 127: Hoare quadruple {34788#true} {34800#(<= (+ main_~v~0 99991) ~SIZE~0)} #132#return; {34800#(<= (+ main_~v~0 99991) ~SIZE~0)} is VALID [2018-11-18 23:04:05,324 INFO L273 TraceCheckUtils]: 128: Hoare triple {34800#(<= (+ main_~v~0 99991) ~SIZE~0)} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {34800#(<= (+ main_~v~0 99991) ~SIZE~0)} is VALID [2018-11-18 23:04:05,324 INFO L273 TraceCheckUtils]: 129: Hoare triple {34800#(<= (+ main_~v~0 99991) ~SIZE~0)} assume !(1 != #t~ret4);havoc #t~mem3;havoc #t~ret4; {34800#(<= (+ main_~v~0 99991) ~SIZE~0)} is VALID [2018-11-18 23:04:05,325 INFO L273 TraceCheckUtils]: 130: Hoare triple {34800#(<= (+ main_~v~0 99991) ~SIZE~0)} #t~post2 := ~v~0;~v~0 := 1 + #t~post2;havoc #t~post2; {34801#(<= (+ main_~v~0 99990) ~SIZE~0)} is VALID [2018-11-18 23:04:05,325 INFO L273 TraceCheckUtils]: 131: Hoare triple {34801#(<= (+ main_~v~0 99990) ~SIZE~0)} assume true; {34801#(<= (+ main_~v~0 99990) ~SIZE~0)} is VALID [2018-11-18 23:04:05,326 INFO L273 TraceCheckUtils]: 132: Hoare triple {34801#(<= (+ main_~v~0 99990) ~SIZE~0)} assume !!(~v~0 < ~SIZE~0);call #t~mem3 := read~int(~#values~0.base, ~#values~0.offset + 4 * ~v~0, 4); {34801#(<= (+ main_~v~0 99990) ~SIZE~0)} is VALID [2018-11-18 23:04:05,326 INFO L256 TraceCheckUtils]: 133: Hoare triple {34801#(<= (+ main_~v~0 99990) ~SIZE~0)} call #t~ret4 := elem_exists(~#set~0.base, ~#set~0.offset, ~n~0, #t~mem3); {34788#true} is VALID [2018-11-18 23:04:05,326 INFO L273 TraceCheckUtils]: 134: Hoare triple {34788#true} ~set.base, ~set.offset := #in~set.base, #in~set.offset;~size := #in~size;~value := #in~value;havoc ~i~0;~i~0 := 0; {34788#true} is VALID [2018-11-18 23:04:05,326 INFO L273 TraceCheckUtils]: 135: Hoare triple {34788#true} assume true; {34788#true} is VALID [2018-11-18 23:04:05,326 INFO L273 TraceCheckUtils]: 136: Hoare triple {34788#true} assume !!(~i~0 < ~size);call #t~mem1 := read~int(~set.base, ~set.offset + 4 * ~i~0, 4); {34788#true} is VALID [2018-11-18 23:04:05,326 INFO L273 TraceCheckUtils]: 137: Hoare triple {34788#true} assume #t~mem1 == ~value;havoc #t~mem1;#res := 1; {34788#true} is VALID [2018-11-18 23:04:05,326 INFO L273 TraceCheckUtils]: 138: Hoare triple {34788#true} assume true; {34788#true} is VALID [2018-11-18 23:04:05,328 INFO L268 TraceCheckUtils]: 139: Hoare quadruple {34788#true} {34801#(<= (+ main_~v~0 99990) ~SIZE~0)} #132#return; {34801#(<= (+ main_~v~0 99990) ~SIZE~0)} is VALID [2018-11-18 23:04:05,328 INFO L273 TraceCheckUtils]: 140: Hoare triple {34801#(<= (+ main_~v~0 99990) ~SIZE~0)} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {34801#(<= (+ main_~v~0 99990) ~SIZE~0)} is VALID [2018-11-18 23:04:05,329 INFO L273 TraceCheckUtils]: 141: Hoare triple {34801#(<= (+ main_~v~0 99990) ~SIZE~0)} assume !(1 != #t~ret4);havoc #t~mem3;havoc #t~ret4; {34801#(<= (+ main_~v~0 99990) ~SIZE~0)} is VALID [2018-11-18 23:04:05,329 INFO L273 TraceCheckUtils]: 142: Hoare triple {34801#(<= (+ main_~v~0 99990) ~SIZE~0)} #t~post2 := ~v~0;~v~0 := 1 + #t~post2;havoc #t~post2; {34802#(<= (+ main_~v~0 99989) ~SIZE~0)} is VALID [2018-11-18 23:04:05,330 INFO L273 TraceCheckUtils]: 143: Hoare triple {34802#(<= (+ main_~v~0 99989) ~SIZE~0)} assume true; {34802#(<= (+ main_~v~0 99989) ~SIZE~0)} is VALID [2018-11-18 23:04:05,330 INFO L273 TraceCheckUtils]: 144: Hoare triple {34802#(<= (+ main_~v~0 99989) ~SIZE~0)} assume !!(~v~0 < ~SIZE~0);call #t~mem3 := read~int(~#values~0.base, ~#values~0.offset + 4 * ~v~0, 4); {34802#(<= (+ main_~v~0 99989) ~SIZE~0)} is VALID [2018-11-18 23:04:05,331 INFO L256 TraceCheckUtils]: 145: Hoare triple {34802#(<= (+ main_~v~0 99989) ~SIZE~0)} call #t~ret4 := elem_exists(~#set~0.base, ~#set~0.offset, ~n~0, #t~mem3); {34788#true} is VALID [2018-11-18 23:04:05,331 INFO L273 TraceCheckUtils]: 146: Hoare triple {34788#true} ~set.base, ~set.offset := #in~set.base, #in~set.offset;~size := #in~size;~value := #in~value;havoc ~i~0;~i~0 := 0; {34788#true} is VALID [2018-11-18 23:04:05,331 INFO L273 TraceCheckUtils]: 147: Hoare triple {34788#true} assume true; {34788#true} is VALID [2018-11-18 23:04:05,331 INFO L273 TraceCheckUtils]: 148: Hoare triple {34788#true} assume !!(~i~0 < ~size);call #t~mem1 := read~int(~set.base, ~set.offset + 4 * ~i~0, 4); {34788#true} is VALID [2018-11-18 23:04:05,331 INFO L273 TraceCheckUtils]: 149: Hoare triple {34788#true} assume #t~mem1 == ~value;havoc #t~mem1;#res := 1; {34788#true} is VALID [2018-11-18 23:04:05,332 INFO L273 TraceCheckUtils]: 150: Hoare triple {34788#true} assume true; {34788#true} is VALID [2018-11-18 23:04:05,333 INFO L268 TraceCheckUtils]: 151: Hoare quadruple {34788#true} {34802#(<= (+ main_~v~0 99989) ~SIZE~0)} #132#return; {34802#(<= (+ main_~v~0 99989) ~SIZE~0)} is VALID [2018-11-18 23:04:05,333 INFO L273 TraceCheckUtils]: 152: Hoare triple {34802#(<= (+ main_~v~0 99989) ~SIZE~0)} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {34802#(<= (+ main_~v~0 99989) ~SIZE~0)} is VALID [2018-11-18 23:04:05,334 INFO L273 TraceCheckUtils]: 153: Hoare triple {34802#(<= (+ main_~v~0 99989) ~SIZE~0)} assume !(1 != #t~ret4);havoc #t~mem3;havoc #t~ret4; {34802#(<= (+ main_~v~0 99989) ~SIZE~0)} is VALID [2018-11-18 23:04:05,334 INFO L273 TraceCheckUtils]: 154: Hoare triple {34802#(<= (+ main_~v~0 99989) ~SIZE~0)} #t~post2 := ~v~0;~v~0 := 1 + #t~post2;havoc #t~post2; {34803#(<= (+ main_~v~0 99988) ~SIZE~0)} is VALID [2018-11-18 23:04:05,335 INFO L273 TraceCheckUtils]: 155: Hoare triple {34803#(<= (+ main_~v~0 99988) ~SIZE~0)} assume true; {34803#(<= (+ main_~v~0 99988) ~SIZE~0)} is VALID [2018-11-18 23:04:05,335 INFO L273 TraceCheckUtils]: 156: Hoare triple {34803#(<= (+ main_~v~0 99988) ~SIZE~0)} assume !!(~v~0 < ~SIZE~0);call #t~mem3 := read~int(~#values~0.base, ~#values~0.offset + 4 * ~v~0, 4); {34803#(<= (+ main_~v~0 99988) ~SIZE~0)} is VALID [2018-11-18 23:04:05,335 INFO L256 TraceCheckUtils]: 157: Hoare triple {34803#(<= (+ main_~v~0 99988) ~SIZE~0)} call #t~ret4 := elem_exists(~#set~0.base, ~#set~0.offset, ~n~0, #t~mem3); {34788#true} is VALID [2018-11-18 23:04:05,335 INFO L273 TraceCheckUtils]: 158: Hoare triple {34788#true} ~set.base, ~set.offset := #in~set.base, #in~set.offset;~size := #in~size;~value := #in~value;havoc ~i~0;~i~0 := 0; {34788#true} is VALID [2018-11-18 23:04:05,335 INFO L273 TraceCheckUtils]: 159: Hoare triple {34788#true} assume true; {34788#true} is VALID [2018-11-18 23:04:05,335 INFO L273 TraceCheckUtils]: 160: Hoare triple {34788#true} assume !!(~i~0 < ~size);call #t~mem1 := read~int(~set.base, ~set.offset + 4 * ~i~0, 4); {34788#true} is VALID [2018-11-18 23:04:05,336 INFO L273 TraceCheckUtils]: 161: Hoare triple {34788#true} assume #t~mem1 == ~value;havoc #t~mem1;#res := 1; {34788#true} is VALID [2018-11-18 23:04:05,336 INFO L273 TraceCheckUtils]: 162: Hoare triple {34788#true} assume true; {34788#true} is VALID [2018-11-18 23:04:05,337 INFO L268 TraceCheckUtils]: 163: Hoare quadruple {34788#true} {34803#(<= (+ main_~v~0 99988) ~SIZE~0)} #132#return; {34803#(<= (+ main_~v~0 99988) ~SIZE~0)} is VALID [2018-11-18 23:04:05,337 INFO L273 TraceCheckUtils]: 164: Hoare triple {34803#(<= (+ main_~v~0 99988) ~SIZE~0)} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {34803#(<= (+ main_~v~0 99988) ~SIZE~0)} is VALID [2018-11-18 23:04:05,338 INFO L273 TraceCheckUtils]: 165: Hoare triple {34803#(<= (+ main_~v~0 99988) ~SIZE~0)} assume !(1 != #t~ret4);havoc #t~mem3;havoc #t~ret4; {34803#(<= (+ main_~v~0 99988) ~SIZE~0)} is VALID [2018-11-18 23:04:05,339 INFO L273 TraceCheckUtils]: 166: Hoare triple {34803#(<= (+ main_~v~0 99988) ~SIZE~0)} #t~post2 := ~v~0;~v~0 := 1 + #t~post2;havoc #t~post2; {34804#(<= (+ main_~v~0 99987) ~SIZE~0)} is VALID [2018-11-18 23:04:05,339 INFO L273 TraceCheckUtils]: 167: Hoare triple {34804#(<= (+ main_~v~0 99987) ~SIZE~0)} assume true; {34804#(<= (+ main_~v~0 99987) ~SIZE~0)} is VALID [2018-11-18 23:04:05,340 INFO L273 TraceCheckUtils]: 168: Hoare triple {34804#(<= (+ main_~v~0 99987) ~SIZE~0)} assume !!(~v~0 < ~SIZE~0);call #t~mem3 := read~int(~#values~0.base, ~#values~0.offset + 4 * ~v~0, 4); {34804#(<= (+ main_~v~0 99987) ~SIZE~0)} is VALID [2018-11-18 23:04:05,340 INFO L256 TraceCheckUtils]: 169: Hoare triple {34804#(<= (+ main_~v~0 99987) ~SIZE~0)} call #t~ret4 := elem_exists(~#set~0.base, ~#set~0.offset, ~n~0, #t~mem3); {34788#true} is VALID [2018-11-18 23:04:05,340 INFO L273 TraceCheckUtils]: 170: Hoare triple {34788#true} ~set.base, ~set.offset := #in~set.base, #in~set.offset;~size := #in~size;~value := #in~value;havoc ~i~0;~i~0 := 0; {34788#true} is VALID [2018-11-18 23:04:05,340 INFO L273 TraceCheckUtils]: 171: Hoare triple {34788#true} assume true; {34788#true} is VALID [2018-11-18 23:04:05,340 INFO L273 TraceCheckUtils]: 172: Hoare triple {34788#true} assume !!(~i~0 < ~size);call #t~mem1 := read~int(~set.base, ~set.offset + 4 * ~i~0, 4); {34788#true} is VALID [2018-11-18 23:04:05,341 INFO L273 TraceCheckUtils]: 173: Hoare triple {34788#true} assume #t~mem1 == ~value;havoc #t~mem1;#res := 1; {34788#true} is VALID [2018-11-18 23:04:05,341 INFO L273 TraceCheckUtils]: 174: Hoare triple {34788#true} assume true; {34788#true} is VALID [2018-11-18 23:04:05,342 INFO L268 TraceCheckUtils]: 175: Hoare quadruple {34788#true} {34804#(<= (+ main_~v~0 99987) ~SIZE~0)} #132#return; {34804#(<= (+ main_~v~0 99987) ~SIZE~0)} is VALID [2018-11-18 23:04:05,342 INFO L273 TraceCheckUtils]: 176: Hoare triple {34804#(<= (+ main_~v~0 99987) ~SIZE~0)} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {34804#(<= (+ main_~v~0 99987) ~SIZE~0)} is VALID [2018-11-18 23:04:05,343 INFO L273 TraceCheckUtils]: 177: Hoare triple {34804#(<= (+ main_~v~0 99987) ~SIZE~0)} assume !(1 != #t~ret4);havoc #t~mem3;havoc #t~ret4; {34804#(<= (+ main_~v~0 99987) ~SIZE~0)} is VALID [2018-11-18 23:04:05,344 INFO L273 TraceCheckUtils]: 178: Hoare triple {34804#(<= (+ main_~v~0 99987) ~SIZE~0)} #t~post2 := ~v~0;~v~0 := 1 + #t~post2;havoc #t~post2; {34805#(<= (+ main_~v~0 99986) ~SIZE~0)} is VALID [2018-11-18 23:04:05,344 INFO L273 TraceCheckUtils]: 179: Hoare triple {34805#(<= (+ main_~v~0 99986) ~SIZE~0)} assume true; {34805#(<= (+ main_~v~0 99986) ~SIZE~0)} is VALID [2018-11-18 23:04:05,345 INFO L273 TraceCheckUtils]: 180: Hoare triple {34805#(<= (+ main_~v~0 99986) ~SIZE~0)} assume !!(~v~0 < ~SIZE~0);call #t~mem3 := read~int(~#values~0.base, ~#values~0.offset + 4 * ~v~0, 4); {34805#(<= (+ main_~v~0 99986) ~SIZE~0)} is VALID [2018-11-18 23:04:05,345 INFO L256 TraceCheckUtils]: 181: Hoare triple {34805#(<= (+ main_~v~0 99986) ~SIZE~0)} call #t~ret4 := elem_exists(~#set~0.base, ~#set~0.offset, ~n~0, #t~mem3); {34788#true} is VALID [2018-11-18 23:04:05,345 INFO L273 TraceCheckUtils]: 182: Hoare triple {34788#true} ~set.base, ~set.offset := #in~set.base, #in~set.offset;~size := #in~size;~value := #in~value;havoc ~i~0;~i~0 := 0; {34788#true} is VALID [2018-11-18 23:04:05,345 INFO L273 TraceCheckUtils]: 183: Hoare triple {34788#true} assume true; {34788#true} is VALID [2018-11-18 23:04:05,346 INFO L273 TraceCheckUtils]: 184: Hoare triple {34788#true} assume !!(~i~0 < ~size);call #t~mem1 := read~int(~set.base, ~set.offset + 4 * ~i~0, 4); {34788#true} is VALID [2018-11-18 23:04:05,346 INFO L273 TraceCheckUtils]: 185: Hoare triple {34788#true} assume #t~mem1 == ~value;havoc #t~mem1;#res := 1; {34788#true} is VALID [2018-11-18 23:04:05,346 INFO L273 TraceCheckUtils]: 186: Hoare triple {34788#true} assume true; {34788#true} is VALID [2018-11-18 23:04:05,347 INFO L268 TraceCheckUtils]: 187: Hoare quadruple {34788#true} {34805#(<= (+ main_~v~0 99986) ~SIZE~0)} #132#return; {34805#(<= (+ main_~v~0 99986) ~SIZE~0)} is VALID [2018-11-18 23:04:05,347 INFO L273 TraceCheckUtils]: 188: Hoare triple {34805#(<= (+ main_~v~0 99986) ~SIZE~0)} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {34805#(<= (+ main_~v~0 99986) ~SIZE~0)} is VALID [2018-11-18 23:04:05,348 INFO L273 TraceCheckUtils]: 189: Hoare triple {34805#(<= (+ main_~v~0 99986) ~SIZE~0)} assume !(1 != #t~ret4);havoc #t~mem3;havoc #t~ret4; {34805#(<= (+ main_~v~0 99986) ~SIZE~0)} is VALID [2018-11-18 23:04:05,348 INFO L273 TraceCheckUtils]: 190: Hoare triple {34805#(<= (+ main_~v~0 99986) ~SIZE~0)} #t~post2 := ~v~0;~v~0 := 1 + #t~post2;havoc #t~post2; {34806#(<= (+ main_~v~0 99985) ~SIZE~0)} is VALID [2018-11-18 23:04:05,349 INFO L273 TraceCheckUtils]: 191: Hoare triple {34806#(<= (+ main_~v~0 99985) ~SIZE~0)} assume true; {34806#(<= (+ main_~v~0 99985) ~SIZE~0)} is VALID [2018-11-18 23:04:05,349 INFO L273 TraceCheckUtils]: 192: Hoare triple {34806#(<= (+ main_~v~0 99985) ~SIZE~0)} assume !!(~v~0 < ~SIZE~0);call #t~mem3 := read~int(~#values~0.base, ~#values~0.offset + 4 * ~v~0, 4); {34806#(<= (+ main_~v~0 99985) ~SIZE~0)} is VALID [2018-11-18 23:04:05,349 INFO L256 TraceCheckUtils]: 193: Hoare triple {34806#(<= (+ main_~v~0 99985) ~SIZE~0)} call #t~ret4 := elem_exists(~#set~0.base, ~#set~0.offset, ~n~0, #t~mem3); {34788#true} is VALID [2018-11-18 23:04:05,349 INFO L273 TraceCheckUtils]: 194: Hoare triple {34788#true} ~set.base, ~set.offset := #in~set.base, #in~set.offset;~size := #in~size;~value := #in~value;havoc ~i~0;~i~0 := 0; {34788#true} is VALID [2018-11-18 23:04:05,349 INFO L273 TraceCheckUtils]: 195: Hoare triple {34788#true} assume true; {34788#true} is VALID [2018-11-18 23:04:05,350 INFO L273 TraceCheckUtils]: 196: Hoare triple {34788#true} assume !!(~i~0 < ~size);call #t~mem1 := read~int(~set.base, ~set.offset + 4 * ~i~0, 4); {34788#true} is VALID [2018-11-18 23:04:05,350 INFO L273 TraceCheckUtils]: 197: Hoare triple {34788#true} assume #t~mem1 == ~value;havoc #t~mem1;#res := 1; {34788#true} is VALID [2018-11-18 23:04:05,350 INFO L273 TraceCheckUtils]: 198: Hoare triple {34788#true} assume true; {34788#true} is VALID [2018-11-18 23:04:05,351 INFO L268 TraceCheckUtils]: 199: Hoare quadruple {34788#true} {34806#(<= (+ main_~v~0 99985) ~SIZE~0)} #132#return; {34806#(<= (+ main_~v~0 99985) ~SIZE~0)} is VALID [2018-11-18 23:04:05,352 INFO L273 TraceCheckUtils]: 200: Hoare triple {34806#(<= (+ main_~v~0 99985) ~SIZE~0)} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {34806#(<= (+ main_~v~0 99985) ~SIZE~0)} is VALID [2018-11-18 23:04:05,352 INFO L273 TraceCheckUtils]: 201: Hoare triple {34806#(<= (+ main_~v~0 99985) ~SIZE~0)} assume !(1 != #t~ret4);havoc #t~mem3;havoc #t~ret4; {34806#(<= (+ main_~v~0 99985) ~SIZE~0)} is VALID [2018-11-18 23:04:05,353 INFO L273 TraceCheckUtils]: 202: Hoare triple {34806#(<= (+ main_~v~0 99985) ~SIZE~0)} #t~post2 := ~v~0;~v~0 := 1 + #t~post2;havoc #t~post2; {34807#(<= (+ main_~v~0 99984) ~SIZE~0)} is VALID [2018-11-18 23:04:05,353 INFO L273 TraceCheckUtils]: 203: Hoare triple {34807#(<= (+ main_~v~0 99984) ~SIZE~0)} assume true; {34807#(<= (+ main_~v~0 99984) ~SIZE~0)} is VALID [2018-11-18 23:04:05,353 INFO L273 TraceCheckUtils]: 204: Hoare triple {34807#(<= (+ main_~v~0 99984) ~SIZE~0)} assume !!(~v~0 < ~SIZE~0);call #t~mem3 := read~int(~#values~0.base, ~#values~0.offset + 4 * ~v~0, 4); {34807#(<= (+ main_~v~0 99984) ~SIZE~0)} is VALID [2018-11-18 23:04:05,353 INFO L256 TraceCheckUtils]: 205: Hoare triple {34807#(<= (+ main_~v~0 99984) ~SIZE~0)} call #t~ret4 := elem_exists(~#set~0.base, ~#set~0.offset, ~n~0, #t~mem3); {34788#true} is VALID [2018-11-18 23:04:05,353 INFO L273 TraceCheckUtils]: 206: Hoare triple {34788#true} ~set.base, ~set.offset := #in~set.base, #in~set.offset;~size := #in~size;~value := #in~value;havoc ~i~0;~i~0 := 0; {34788#true} is VALID [2018-11-18 23:04:05,353 INFO L273 TraceCheckUtils]: 207: Hoare triple {34788#true} assume true; {34788#true} is VALID [2018-11-18 23:04:05,354 INFO L273 TraceCheckUtils]: 208: Hoare triple {34788#true} assume !!(~i~0 < ~size);call #t~mem1 := read~int(~set.base, ~set.offset + 4 * ~i~0, 4); {34788#true} is VALID [2018-11-18 23:04:05,354 INFO L273 TraceCheckUtils]: 209: Hoare triple {34788#true} assume #t~mem1 == ~value;havoc #t~mem1;#res := 1; {34788#true} is VALID [2018-11-18 23:04:05,354 INFO L273 TraceCheckUtils]: 210: Hoare triple {34788#true} assume true; {34788#true} is VALID [2018-11-18 23:04:05,354 INFO L268 TraceCheckUtils]: 211: Hoare quadruple {34788#true} {34807#(<= (+ main_~v~0 99984) ~SIZE~0)} #132#return; {34807#(<= (+ main_~v~0 99984) ~SIZE~0)} is VALID [2018-11-18 23:04:05,355 INFO L273 TraceCheckUtils]: 212: Hoare triple {34807#(<= (+ main_~v~0 99984) ~SIZE~0)} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {34807#(<= (+ main_~v~0 99984) ~SIZE~0)} is VALID [2018-11-18 23:04:05,355 INFO L273 TraceCheckUtils]: 213: Hoare triple {34807#(<= (+ main_~v~0 99984) ~SIZE~0)} assume !(1 != #t~ret4);havoc #t~mem3;havoc #t~ret4; {34807#(<= (+ main_~v~0 99984) ~SIZE~0)} is VALID [2018-11-18 23:04:05,356 INFO L273 TraceCheckUtils]: 214: Hoare triple {34807#(<= (+ main_~v~0 99984) ~SIZE~0)} #t~post2 := ~v~0;~v~0 := 1 + #t~post2;havoc #t~post2; {34808#(<= (+ main_~v~0 99983) ~SIZE~0)} is VALID [2018-11-18 23:04:05,357 INFO L273 TraceCheckUtils]: 215: Hoare triple {34808#(<= (+ main_~v~0 99983) ~SIZE~0)} assume true; {34808#(<= (+ main_~v~0 99983) ~SIZE~0)} is VALID [2018-11-18 23:04:05,357 INFO L273 TraceCheckUtils]: 216: Hoare triple {34808#(<= (+ main_~v~0 99983) ~SIZE~0)} assume !!(~v~0 < ~SIZE~0);call #t~mem3 := read~int(~#values~0.base, ~#values~0.offset + 4 * ~v~0, 4); {34808#(<= (+ main_~v~0 99983) ~SIZE~0)} is VALID [2018-11-18 23:04:05,358 INFO L256 TraceCheckUtils]: 217: Hoare triple {34808#(<= (+ main_~v~0 99983) ~SIZE~0)} call #t~ret4 := elem_exists(~#set~0.base, ~#set~0.offset, ~n~0, #t~mem3); {34788#true} is VALID [2018-11-18 23:04:05,358 INFO L273 TraceCheckUtils]: 218: Hoare triple {34788#true} ~set.base, ~set.offset := #in~set.base, #in~set.offset;~size := #in~size;~value := #in~value;havoc ~i~0;~i~0 := 0; {34788#true} is VALID [2018-11-18 23:04:05,358 INFO L273 TraceCheckUtils]: 219: Hoare triple {34788#true} assume true; {34788#true} is VALID [2018-11-18 23:04:05,358 INFO L273 TraceCheckUtils]: 220: Hoare triple {34788#true} assume !!(~i~0 < ~size);call #t~mem1 := read~int(~set.base, ~set.offset + 4 * ~i~0, 4); {34788#true} is VALID [2018-11-18 23:04:05,358 INFO L273 TraceCheckUtils]: 221: Hoare triple {34788#true} assume #t~mem1 == ~value;havoc #t~mem1;#res := 1; {34788#true} is VALID [2018-11-18 23:04:05,359 INFO L273 TraceCheckUtils]: 222: Hoare triple {34788#true} assume true; {34788#true} is VALID [2018-11-18 23:04:05,360 INFO L268 TraceCheckUtils]: 223: Hoare quadruple {34788#true} {34808#(<= (+ main_~v~0 99983) ~SIZE~0)} #132#return; {34808#(<= (+ main_~v~0 99983) ~SIZE~0)} is VALID [2018-11-18 23:04:05,360 INFO L273 TraceCheckUtils]: 224: Hoare triple {34808#(<= (+ main_~v~0 99983) ~SIZE~0)} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {34808#(<= (+ main_~v~0 99983) ~SIZE~0)} is VALID [2018-11-18 23:04:05,361 INFO L273 TraceCheckUtils]: 225: Hoare triple {34808#(<= (+ main_~v~0 99983) ~SIZE~0)} assume !(1 != #t~ret4);havoc #t~mem3;havoc #t~ret4; {34808#(<= (+ main_~v~0 99983) ~SIZE~0)} is VALID [2018-11-18 23:04:05,361 INFO L273 TraceCheckUtils]: 226: Hoare triple {34808#(<= (+ main_~v~0 99983) ~SIZE~0)} #t~post2 := ~v~0;~v~0 := 1 + #t~post2;havoc #t~post2; {34809#(<= (+ main_~v~0 99982) ~SIZE~0)} is VALID [2018-11-18 23:04:05,362 INFO L273 TraceCheckUtils]: 227: Hoare triple {34809#(<= (+ main_~v~0 99982) ~SIZE~0)} assume true; {34809#(<= (+ main_~v~0 99982) ~SIZE~0)} is VALID [2018-11-18 23:04:05,362 INFO L273 TraceCheckUtils]: 228: Hoare triple {34809#(<= (+ main_~v~0 99982) ~SIZE~0)} assume !!(~v~0 < ~SIZE~0);call #t~mem3 := read~int(~#values~0.base, ~#values~0.offset + 4 * ~v~0, 4); {34809#(<= (+ main_~v~0 99982) ~SIZE~0)} is VALID [2018-11-18 23:04:05,362 INFO L256 TraceCheckUtils]: 229: Hoare triple {34809#(<= (+ main_~v~0 99982) ~SIZE~0)} call #t~ret4 := elem_exists(~#set~0.base, ~#set~0.offset, ~n~0, #t~mem3); {34788#true} is VALID [2018-11-18 23:04:05,362 INFO L273 TraceCheckUtils]: 230: Hoare triple {34788#true} ~set.base, ~set.offset := #in~set.base, #in~set.offset;~size := #in~size;~value := #in~value;havoc ~i~0;~i~0 := 0; {34788#true} is VALID [2018-11-18 23:04:05,362 INFO L273 TraceCheckUtils]: 231: Hoare triple {34788#true} assume true; {34788#true} is VALID [2018-11-18 23:04:05,362 INFO L273 TraceCheckUtils]: 232: Hoare triple {34788#true} assume !!(~i~0 < ~size);call #t~mem1 := read~int(~set.base, ~set.offset + 4 * ~i~0, 4); {34788#true} is VALID [2018-11-18 23:04:05,363 INFO L273 TraceCheckUtils]: 233: Hoare triple {34788#true} assume #t~mem1 == ~value;havoc #t~mem1;#res := 1; {34788#true} is VALID [2018-11-18 23:04:05,363 INFO L273 TraceCheckUtils]: 234: Hoare triple {34788#true} assume true; {34788#true} is VALID [2018-11-18 23:04:05,363 INFO L268 TraceCheckUtils]: 235: Hoare quadruple {34788#true} {34809#(<= (+ main_~v~0 99982) ~SIZE~0)} #132#return; {34809#(<= (+ main_~v~0 99982) ~SIZE~0)} is VALID [2018-11-18 23:04:05,364 INFO L273 TraceCheckUtils]: 236: Hoare triple {34809#(<= (+ main_~v~0 99982) ~SIZE~0)} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {34809#(<= (+ main_~v~0 99982) ~SIZE~0)} is VALID [2018-11-18 23:04:05,364 INFO L273 TraceCheckUtils]: 237: Hoare triple {34809#(<= (+ main_~v~0 99982) ~SIZE~0)} assume !(1 != #t~ret4);havoc #t~mem3;havoc #t~ret4; {34809#(<= (+ main_~v~0 99982) ~SIZE~0)} is VALID [2018-11-18 23:04:05,365 INFO L273 TraceCheckUtils]: 238: Hoare triple {34809#(<= (+ main_~v~0 99982) ~SIZE~0)} #t~post2 := ~v~0;~v~0 := 1 + #t~post2;havoc #t~post2; {34810#(<= (+ main_~v~0 99981) ~SIZE~0)} is VALID [2018-11-18 23:04:05,366 INFO L273 TraceCheckUtils]: 239: Hoare triple {34810#(<= (+ main_~v~0 99981) ~SIZE~0)} assume true; {34810#(<= (+ main_~v~0 99981) ~SIZE~0)} is VALID [2018-11-18 23:04:05,366 INFO L273 TraceCheckUtils]: 240: Hoare triple {34810#(<= (+ main_~v~0 99981) ~SIZE~0)} assume !(~v~0 < ~SIZE~0); {34789#false} is VALID [2018-11-18 23:04:05,367 INFO L273 TraceCheckUtils]: 241: Hoare triple {34789#false} ~i~1 := 0; {34789#false} is VALID [2018-11-18 23:04:05,367 INFO L273 TraceCheckUtils]: 242: Hoare triple {34789#false} assume true; {34789#false} is VALID [2018-11-18 23:04:05,367 INFO L273 TraceCheckUtils]: 243: Hoare triple {34789#false} assume !!(~i~1 < ~SIZE~0 && 1 != ~found~0);call #t~mem8 := read~int(~#set~0.base, ~#set~0.offset + 4 * ~i~1, 4); {34789#false} is VALID [2018-11-18 23:04:05,367 INFO L273 TraceCheckUtils]: 244: Hoare triple {34789#false} assume !(#t~mem8 == ~element~0);havoc #t~mem8; {34789#false} is VALID [2018-11-18 23:04:05,367 INFO L273 TraceCheckUtils]: 245: Hoare triple {34789#false} #t~post7 := ~i~1;~i~1 := 1 + #t~post7;havoc #t~post7; {34789#false} is VALID [2018-11-18 23:04:05,368 INFO L273 TraceCheckUtils]: 246: Hoare triple {34789#false} assume true; {34789#false} is VALID [2018-11-18 23:04:05,368 INFO L273 TraceCheckUtils]: 247: Hoare triple {34789#false} assume !!(~i~1 < ~SIZE~0 && 1 != ~found~0);call #t~mem8 := read~int(~#set~0.base, ~#set~0.offset + 4 * ~i~1, 4); {34789#false} is VALID [2018-11-18 23:04:05,368 INFO L273 TraceCheckUtils]: 248: Hoare triple {34789#false} assume !(#t~mem8 == ~element~0);havoc #t~mem8; {34789#false} is VALID [2018-11-18 23:04:05,368 INFO L273 TraceCheckUtils]: 249: Hoare triple {34789#false} #t~post7 := ~i~1;~i~1 := 1 + #t~post7;havoc #t~post7; {34789#false} is VALID [2018-11-18 23:04:05,368 INFO L273 TraceCheckUtils]: 250: Hoare triple {34789#false} assume true; {34789#false} is VALID [2018-11-18 23:04:05,368 INFO L273 TraceCheckUtils]: 251: Hoare triple {34789#false} assume !!(~i~1 < ~SIZE~0 && 1 != ~found~0);call #t~mem8 := read~int(~#set~0.base, ~#set~0.offset + 4 * ~i~1, 4); {34789#false} is VALID [2018-11-18 23:04:05,369 INFO L273 TraceCheckUtils]: 252: Hoare triple {34789#false} assume !(#t~mem8 == ~element~0);havoc #t~mem8; {34789#false} is VALID [2018-11-18 23:04:05,369 INFO L273 TraceCheckUtils]: 253: Hoare triple {34789#false} #t~post7 := ~i~1;~i~1 := 1 + #t~post7;havoc #t~post7; {34789#false} is VALID [2018-11-18 23:04:05,369 INFO L273 TraceCheckUtils]: 254: Hoare triple {34789#false} assume true; {34789#false} is VALID [2018-11-18 23:04:05,369 INFO L273 TraceCheckUtils]: 255: Hoare triple {34789#false} assume !!(~i~1 < ~SIZE~0 && 1 != ~found~0);call #t~mem8 := read~int(~#set~0.base, ~#set~0.offset + 4 * ~i~1, 4); {34789#false} is VALID [2018-11-18 23:04:05,369 INFO L273 TraceCheckUtils]: 256: Hoare triple {34789#false} assume #t~mem8 == ~element~0;havoc #t~mem8;~found~0 := 1;~pos~0 := ~i~1; {34789#false} is VALID [2018-11-18 23:04:05,369 INFO L273 TraceCheckUtils]: 257: Hoare triple {34789#false} #t~post7 := ~i~1;~i~1 := 1 + #t~post7;havoc #t~post7; {34789#false} is VALID [2018-11-18 23:04:05,370 INFO L273 TraceCheckUtils]: 258: Hoare triple {34789#false} assume true; {34789#false} is VALID [2018-11-18 23:04:05,370 INFO L273 TraceCheckUtils]: 259: Hoare triple {34789#false} assume !(~i~1 < ~SIZE~0 && 1 != ~found~0); {34789#false} is VALID [2018-11-18 23:04:05,370 INFO L273 TraceCheckUtils]: 260: Hoare triple {34789#false} assume 1 == ~found~0;~i~1 := ~pos~0; {34789#false} is VALID [2018-11-18 23:04:05,370 INFO L273 TraceCheckUtils]: 261: Hoare triple {34789#false} assume true; {34789#false} is VALID [2018-11-18 23:04:05,370 INFO L273 TraceCheckUtils]: 262: Hoare triple {34789#false} assume !!(~i~1 < ~SIZE~0 - 1);call #t~mem10 := read~int(~#set~0.base, ~#set~0.offset + 4 * (1 + ~i~1), 4);call write~int(#t~mem10, ~#set~0.base, ~#set~0.offset + 4 * ~i~1, 4);havoc #t~mem10; {34789#false} is VALID [2018-11-18 23:04:05,370 INFO L273 TraceCheckUtils]: 263: Hoare triple {34789#false} #t~post9 := ~i~1;~i~1 := 1 + #t~post9;havoc #t~post9; {34789#false} is VALID [2018-11-18 23:04:05,370 INFO L273 TraceCheckUtils]: 264: Hoare triple {34789#false} assume true; {34789#false} is VALID [2018-11-18 23:04:05,371 INFO L273 TraceCheckUtils]: 265: Hoare triple {34789#false} assume !(~i~1 < ~SIZE~0 - 1); {34789#false} is VALID [2018-11-18 23:04:05,371 INFO L273 TraceCheckUtils]: 266: Hoare triple {34789#false} assume 1 == ~found~0;~i~1 := 0; {34789#false} is VALID [2018-11-18 23:04:05,371 INFO L273 TraceCheckUtils]: 267: Hoare triple {34789#false} assume true; {34789#false} is VALID [2018-11-18 23:04:05,371 INFO L273 TraceCheckUtils]: 268: Hoare triple {34789#false} assume !!(~i~1 < ~SIZE~0 - 1);call #t~mem12 := read~int(~#set~0.base, ~#set~0.offset + 4 * ~i~1, 4); {34789#false} is VALID [2018-11-18 23:04:05,371 INFO L256 TraceCheckUtils]: 269: Hoare triple {34789#false} call __VERIFIER_assert((if #t~mem12 != ~element~0 then 1 else 0)); {34789#false} is VALID [2018-11-18 23:04:05,371 INFO L273 TraceCheckUtils]: 270: Hoare triple {34789#false} ~cond := #in~cond; {34789#false} is VALID [2018-11-18 23:04:05,371 INFO L273 TraceCheckUtils]: 271: Hoare triple {34789#false} assume 0 == ~cond; {34789#false} is VALID [2018-11-18 23:04:05,371 INFO L273 TraceCheckUtils]: 272: Hoare triple {34789#false} assume !false; {34789#false} is VALID [2018-11-18 23:04:05,418 INFO L134 CoverageAnalysis]: Checked inductivity of 2106 backedges. 0 proven. 1064 refuted. 0 times theorem prover too weak. 1042 trivial. 0 not checked. [2018-11-18 23:04:05,418 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 23:04:05,418 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-18 23:04:05,428 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-18 23:04:05,542 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-18 23:04:05,543 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-18 23:04:05,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 23:04:05,591 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 23:04:06,666 INFO L256 TraceCheckUtils]: 0: Hoare triple {34788#true} call ULTIMATE.init(); {34788#true} is VALID [2018-11-18 23:04:06,667 INFO L273 TraceCheckUtils]: 1: Hoare triple {34788#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~SIZE~0 := 100000; {34788#true} is VALID [2018-11-18 23:04:06,667 INFO L273 TraceCheckUtils]: 2: Hoare triple {34788#true} assume true; {34788#true} is VALID [2018-11-18 23:04:06,667 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {34788#true} {34788#true} #128#return; {34788#true} is VALID [2018-11-18 23:04:06,667 INFO L256 TraceCheckUtils]: 4: Hoare triple {34788#true} call #t~ret13 := main(); {34788#true} is VALID [2018-11-18 23:04:06,668 INFO L273 TraceCheckUtils]: 5: Hoare triple {34788#true} havoc ~i~1;havoc ~pos~0;~n~0 := 0;~found~0 := 0;call ~#set~0.base, ~#set~0.offset := #Ultimate.alloc(4 * ~SIZE~0);call ~#values~0.base, ~#values~0.offset := #Ultimate.alloc(4 * ~SIZE~0);havoc ~element~0;havoc ~v~0;~v~0 := 0; {34829#(<= 0 main_~v~0)} is VALID [2018-11-18 23:04:06,669 INFO L273 TraceCheckUtils]: 6: Hoare triple {34829#(<= 0 main_~v~0)} assume true; {34829#(<= 0 main_~v~0)} is VALID [2018-11-18 23:04:06,669 INFO L273 TraceCheckUtils]: 7: Hoare triple {34829#(<= 0 main_~v~0)} assume !!(~v~0 < ~SIZE~0);call #t~mem3 := read~int(~#values~0.base, ~#values~0.offset + 4 * ~v~0, 4); {34829#(<= 0 main_~v~0)} is VALID [2018-11-18 23:04:06,669 INFO L256 TraceCheckUtils]: 8: Hoare triple {34829#(<= 0 main_~v~0)} call #t~ret4 := elem_exists(~#set~0.base, ~#set~0.offset, ~n~0, #t~mem3); {34788#true} is VALID [2018-11-18 23:04:06,669 INFO L273 TraceCheckUtils]: 9: Hoare triple {34788#true} ~set.base, ~set.offset := #in~set.base, #in~set.offset;~size := #in~size;~value := #in~value;havoc ~i~0;~i~0 := 0; {34788#true} is VALID [2018-11-18 23:04:06,669 INFO L273 TraceCheckUtils]: 10: Hoare triple {34788#true} assume true; {34788#true} is VALID [2018-11-18 23:04:06,669 INFO L273 TraceCheckUtils]: 11: Hoare triple {34788#true} assume !(~i~0 < ~size); {34788#true} is VALID [2018-11-18 23:04:06,669 INFO L273 TraceCheckUtils]: 12: Hoare triple {34788#true} #res := 0; {34788#true} is VALID [2018-11-18 23:04:06,670 INFO L273 TraceCheckUtils]: 13: Hoare triple {34788#true} assume true; {34788#true} is VALID [2018-11-18 23:04:06,670 INFO L268 TraceCheckUtils]: 14: Hoare quadruple {34788#true} {34829#(<= 0 main_~v~0)} #132#return; {34829#(<= 0 main_~v~0)} is VALID [2018-11-18 23:04:06,671 INFO L273 TraceCheckUtils]: 15: Hoare triple {34829#(<= 0 main_~v~0)} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {34829#(<= 0 main_~v~0)} is VALID [2018-11-18 23:04:06,671 INFO L273 TraceCheckUtils]: 16: Hoare triple {34829#(<= 0 main_~v~0)} assume 1 != #t~ret4;havoc #t~mem3;havoc #t~ret4;call #t~mem5 := read~int(~#values~0.base, ~#values~0.offset + 4 * ~v~0, 4); {34829#(<= 0 main_~v~0)} is VALID [2018-11-18 23:04:06,671 INFO L256 TraceCheckUtils]: 17: Hoare triple {34829#(<= 0 main_~v~0)} call #t~ret6 := insert(~#set~0.base, ~#set~0.offset, ~n~0, #t~mem5); {34788#true} is VALID [2018-11-18 23:04:06,671 INFO L273 TraceCheckUtils]: 18: Hoare triple {34788#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; {34788#true} is VALID [2018-11-18 23:04:06,671 INFO L273 TraceCheckUtils]: 19: Hoare triple {34788#true} assume true; {34788#true} is VALID [2018-11-18 23:04:06,672 INFO L268 TraceCheckUtils]: 20: Hoare quadruple {34788#true} {34829#(<= 0 main_~v~0)} #134#return; {34829#(<= 0 main_~v~0)} is VALID [2018-11-18 23:04:06,672 INFO L273 TraceCheckUtils]: 21: Hoare triple {34829#(<= 0 main_~v~0)} assume -2147483648 <= #t~ret6 && #t~ret6 <= 2147483647;~n~0 := #t~ret6;havoc #t~ret6;havoc #t~mem5; {34829#(<= 0 main_~v~0)} is VALID [2018-11-18 23:04:06,673 INFO L273 TraceCheckUtils]: 22: Hoare triple {34829#(<= 0 main_~v~0)} #t~post2 := ~v~0;~v~0 := 1 + #t~post2;havoc #t~post2; {34881#(<= 1 main_~v~0)} is VALID [2018-11-18 23:04:06,673 INFO L273 TraceCheckUtils]: 23: Hoare triple {34881#(<= 1 main_~v~0)} assume true; {34881#(<= 1 main_~v~0)} is VALID [2018-11-18 23:04:06,673 INFO L273 TraceCheckUtils]: 24: Hoare triple {34881#(<= 1 main_~v~0)} assume !!(~v~0 < ~SIZE~0);call #t~mem3 := read~int(~#values~0.base, ~#values~0.offset + 4 * ~v~0, 4); {34881#(<= 1 main_~v~0)} is VALID [2018-11-18 23:04:06,673 INFO L256 TraceCheckUtils]: 25: Hoare triple {34881#(<= 1 main_~v~0)} call #t~ret4 := elem_exists(~#set~0.base, ~#set~0.offset, ~n~0, #t~mem3); {34788#true} is VALID [2018-11-18 23:04:06,673 INFO L273 TraceCheckUtils]: 26: Hoare triple {34788#true} ~set.base, ~set.offset := #in~set.base, #in~set.offset;~size := #in~size;~value := #in~value;havoc ~i~0;~i~0 := 0; {34788#true} is VALID [2018-11-18 23:04:06,674 INFO L273 TraceCheckUtils]: 27: Hoare triple {34788#true} assume true; {34788#true} is VALID [2018-11-18 23:04:06,674 INFO L273 TraceCheckUtils]: 28: Hoare triple {34788#true} assume !!(~i~0 < ~size);call #t~mem1 := read~int(~set.base, ~set.offset + 4 * ~i~0, 4); {34788#true} is VALID [2018-11-18 23:04:06,674 INFO L273 TraceCheckUtils]: 29: Hoare triple {34788#true} assume #t~mem1 == ~value;havoc #t~mem1;#res := 1; {34788#true} is VALID [2018-11-18 23:04:06,674 INFO L273 TraceCheckUtils]: 30: Hoare triple {34788#true} assume true; {34788#true} is VALID [2018-11-18 23:04:06,675 INFO L268 TraceCheckUtils]: 31: Hoare quadruple {34788#true} {34881#(<= 1 main_~v~0)} #132#return; {34881#(<= 1 main_~v~0)} is VALID [2018-11-18 23:04:06,676 INFO L273 TraceCheckUtils]: 32: Hoare triple {34881#(<= 1 main_~v~0)} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {34881#(<= 1 main_~v~0)} is VALID [2018-11-18 23:04:06,676 INFO L273 TraceCheckUtils]: 33: Hoare triple {34881#(<= 1 main_~v~0)} assume !(1 != #t~ret4);havoc #t~mem3;havoc #t~ret4; {34881#(<= 1 main_~v~0)} is VALID [2018-11-18 23:04:06,677 INFO L273 TraceCheckUtils]: 34: Hoare triple {34881#(<= 1 main_~v~0)} #t~post2 := ~v~0;~v~0 := 1 + #t~post2;havoc #t~post2; {34918#(<= 2 main_~v~0)} is VALID [2018-11-18 23:04:06,677 INFO L273 TraceCheckUtils]: 35: Hoare triple {34918#(<= 2 main_~v~0)} assume true; {34918#(<= 2 main_~v~0)} is VALID [2018-11-18 23:04:06,678 INFO L273 TraceCheckUtils]: 36: Hoare triple {34918#(<= 2 main_~v~0)} assume !!(~v~0 < ~SIZE~0);call #t~mem3 := read~int(~#values~0.base, ~#values~0.offset + 4 * ~v~0, 4); {34918#(<= 2 main_~v~0)} is VALID [2018-11-18 23:04:06,678 INFO L256 TraceCheckUtils]: 37: Hoare triple {34918#(<= 2 main_~v~0)} call #t~ret4 := elem_exists(~#set~0.base, ~#set~0.offset, ~n~0, #t~mem3); {34788#true} is VALID [2018-11-18 23:04:06,678 INFO L273 TraceCheckUtils]: 38: Hoare triple {34788#true} ~set.base, ~set.offset := #in~set.base, #in~set.offset;~size := #in~size;~value := #in~value;havoc ~i~0;~i~0 := 0; {34788#true} is VALID [2018-11-18 23:04:06,679 INFO L273 TraceCheckUtils]: 39: Hoare triple {34788#true} assume true; {34788#true} is VALID [2018-11-18 23:04:06,679 INFO L273 TraceCheckUtils]: 40: Hoare triple {34788#true} assume !!(~i~0 < ~size);call #t~mem1 := read~int(~set.base, ~set.offset + 4 * ~i~0, 4); {34788#true} is VALID [2018-11-18 23:04:06,679 INFO L273 TraceCheckUtils]: 41: Hoare triple {34788#true} assume #t~mem1 == ~value;havoc #t~mem1;#res := 1; {34788#true} is VALID [2018-11-18 23:04:06,679 INFO L273 TraceCheckUtils]: 42: Hoare triple {34788#true} assume true; {34788#true} is VALID [2018-11-18 23:04:06,680 INFO L268 TraceCheckUtils]: 43: Hoare quadruple {34788#true} {34918#(<= 2 main_~v~0)} #132#return; {34918#(<= 2 main_~v~0)} is VALID [2018-11-18 23:04:06,681 INFO L273 TraceCheckUtils]: 44: Hoare triple {34918#(<= 2 main_~v~0)} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {34918#(<= 2 main_~v~0)} is VALID [2018-11-18 23:04:06,681 INFO L273 TraceCheckUtils]: 45: Hoare triple {34918#(<= 2 main_~v~0)} assume !(1 != #t~ret4);havoc #t~mem3;havoc #t~ret4; {34918#(<= 2 main_~v~0)} is VALID [2018-11-18 23:04:06,681 INFO L273 TraceCheckUtils]: 46: Hoare triple {34918#(<= 2 main_~v~0)} #t~post2 := ~v~0;~v~0 := 1 + #t~post2;havoc #t~post2; {34955#(<= 3 main_~v~0)} is VALID [2018-11-18 23:04:06,682 INFO L273 TraceCheckUtils]: 47: Hoare triple {34955#(<= 3 main_~v~0)} assume true; {34955#(<= 3 main_~v~0)} is VALID [2018-11-18 23:04:06,682 INFO L273 TraceCheckUtils]: 48: Hoare triple {34955#(<= 3 main_~v~0)} assume !!(~v~0 < ~SIZE~0);call #t~mem3 := read~int(~#values~0.base, ~#values~0.offset + 4 * ~v~0, 4); {34955#(<= 3 main_~v~0)} is VALID [2018-11-18 23:04:06,682 INFO L256 TraceCheckUtils]: 49: Hoare triple {34955#(<= 3 main_~v~0)} call #t~ret4 := elem_exists(~#set~0.base, ~#set~0.offset, ~n~0, #t~mem3); {34788#true} is VALID [2018-11-18 23:04:06,682 INFO L273 TraceCheckUtils]: 50: Hoare triple {34788#true} ~set.base, ~set.offset := #in~set.base, #in~set.offset;~size := #in~size;~value := #in~value;havoc ~i~0;~i~0 := 0; {34788#true} is VALID [2018-11-18 23:04:06,682 INFO L273 TraceCheckUtils]: 51: Hoare triple {34788#true} assume true; {34788#true} is VALID [2018-11-18 23:04:06,682 INFO L273 TraceCheckUtils]: 52: Hoare triple {34788#true} assume !!(~i~0 < ~size);call #t~mem1 := read~int(~set.base, ~set.offset + 4 * ~i~0, 4); {34788#true} is VALID [2018-11-18 23:04:06,683 INFO L273 TraceCheckUtils]: 53: Hoare triple {34788#true} assume #t~mem1 == ~value;havoc #t~mem1;#res := 1; {34788#true} is VALID [2018-11-18 23:04:06,683 INFO L273 TraceCheckUtils]: 54: Hoare triple {34788#true} assume true; {34788#true} is VALID [2018-11-18 23:04:06,683 INFO L268 TraceCheckUtils]: 55: Hoare quadruple {34788#true} {34955#(<= 3 main_~v~0)} #132#return; {34955#(<= 3 main_~v~0)} is VALID [2018-11-18 23:04:06,684 INFO L273 TraceCheckUtils]: 56: Hoare triple {34955#(<= 3 main_~v~0)} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {34955#(<= 3 main_~v~0)} is VALID [2018-11-18 23:04:06,684 INFO L273 TraceCheckUtils]: 57: Hoare triple {34955#(<= 3 main_~v~0)} assume !(1 != #t~ret4);havoc #t~mem3;havoc #t~ret4; {34955#(<= 3 main_~v~0)} is VALID [2018-11-18 23:04:06,684 INFO L273 TraceCheckUtils]: 58: Hoare triple {34955#(<= 3 main_~v~0)} #t~post2 := ~v~0;~v~0 := 1 + #t~post2;havoc #t~post2; {34992#(<= 4 main_~v~0)} is VALID [2018-11-18 23:04:06,685 INFO L273 TraceCheckUtils]: 59: Hoare triple {34992#(<= 4 main_~v~0)} assume true; {34992#(<= 4 main_~v~0)} is VALID [2018-11-18 23:04:06,685 INFO L273 TraceCheckUtils]: 60: Hoare triple {34992#(<= 4 main_~v~0)} assume !!(~v~0 < ~SIZE~0);call #t~mem3 := read~int(~#values~0.base, ~#values~0.offset + 4 * ~v~0, 4); {34992#(<= 4 main_~v~0)} is VALID [2018-11-18 23:04:06,686 INFO L256 TraceCheckUtils]: 61: Hoare triple {34992#(<= 4 main_~v~0)} call #t~ret4 := elem_exists(~#set~0.base, ~#set~0.offset, ~n~0, #t~mem3); {34788#true} is VALID [2018-11-18 23:04:06,686 INFO L273 TraceCheckUtils]: 62: Hoare triple {34788#true} ~set.base, ~set.offset := #in~set.base, #in~set.offset;~size := #in~size;~value := #in~value;havoc ~i~0;~i~0 := 0; {34788#true} is VALID [2018-11-18 23:04:06,686 INFO L273 TraceCheckUtils]: 63: Hoare triple {34788#true} assume true; {34788#true} is VALID [2018-11-18 23:04:06,686 INFO L273 TraceCheckUtils]: 64: Hoare triple {34788#true} assume !!(~i~0 < ~size);call #t~mem1 := read~int(~set.base, ~set.offset + 4 * ~i~0, 4); {34788#true} is VALID [2018-11-18 23:04:06,686 INFO L273 TraceCheckUtils]: 65: Hoare triple {34788#true} assume #t~mem1 == ~value;havoc #t~mem1;#res := 1; {34788#true} is VALID [2018-11-18 23:04:06,686 INFO L273 TraceCheckUtils]: 66: Hoare triple {34788#true} assume true; {34788#true} is VALID [2018-11-18 23:04:06,687 INFO L268 TraceCheckUtils]: 67: Hoare quadruple {34788#true} {34992#(<= 4 main_~v~0)} #132#return; {34992#(<= 4 main_~v~0)} is VALID [2018-11-18 23:04:06,688 INFO L273 TraceCheckUtils]: 68: Hoare triple {34992#(<= 4 main_~v~0)} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {34992#(<= 4 main_~v~0)} is VALID [2018-11-18 23:04:06,688 INFO L273 TraceCheckUtils]: 69: Hoare triple {34992#(<= 4 main_~v~0)} assume !(1 != #t~ret4);havoc #t~mem3;havoc #t~ret4; {34992#(<= 4 main_~v~0)} is VALID [2018-11-18 23:04:06,689 INFO L273 TraceCheckUtils]: 70: Hoare triple {34992#(<= 4 main_~v~0)} #t~post2 := ~v~0;~v~0 := 1 + #t~post2;havoc #t~post2; {35029#(<= 5 main_~v~0)} is VALID [2018-11-18 23:04:06,690 INFO L273 TraceCheckUtils]: 71: Hoare triple {35029#(<= 5 main_~v~0)} assume true; {35029#(<= 5 main_~v~0)} is VALID [2018-11-18 23:04:06,690 INFO L273 TraceCheckUtils]: 72: Hoare triple {35029#(<= 5 main_~v~0)} assume !!(~v~0 < ~SIZE~0);call #t~mem3 := read~int(~#values~0.base, ~#values~0.offset + 4 * ~v~0, 4); {35029#(<= 5 main_~v~0)} is VALID [2018-11-18 23:04:06,690 INFO L256 TraceCheckUtils]: 73: Hoare triple {35029#(<= 5 main_~v~0)} call #t~ret4 := elem_exists(~#set~0.base, ~#set~0.offset, ~n~0, #t~mem3); {34788#true} is VALID [2018-11-18 23:04:06,691 INFO L273 TraceCheckUtils]: 74: Hoare triple {34788#true} ~set.base, ~set.offset := #in~set.base, #in~set.offset;~size := #in~size;~value := #in~value;havoc ~i~0;~i~0 := 0; {34788#true} is VALID [2018-11-18 23:04:06,691 INFO L273 TraceCheckUtils]: 75: Hoare triple {34788#true} assume true; {34788#true} is VALID [2018-11-18 23:04:06,691 INFO L273 TraceCheckUtils]: 76: Hoare triple {34788#true} assume !!(~i~0 < ~size);call #t~mem1 := read~int(~set.base, ~set.offset + 4 * ~i~0, 4); {34788#true} is VALID [2018-11-18 23:04:06,691 INFO L273 TraceCheckUtils]: 77: Hoare triple {34788#true} assume #t~mem1 == ~value;havoc #t~mem1;#res := 1; {34788#true} is VALID [2018-11-18 23:04:06,691 INFO L273 TraceCheckUtils]: 78: Hoare triple {34788#true} assume true; {34788#true} is VALID [2018-11-18 23:04:06,692 INFO L268 TraceCheckUtils]: 79: Hoare quadruple {34788#true} {35029#(<= 5 main_~v~0)} #132#return; {35029#(<= 5 main_~v~0)} is VALID [2018-11-18 23:04:06,693 INFO L273 TraceCheckUtils]: 80: Hoare triple {35029#(<= 5 main_~v~0)} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {35029#(<= 5 main_~v~0)} is VALID [2018-11-18 23:04:06,693 INFO L273 TraceCheckUtils]: 81: Hoare triple {35029#(<= 5 main_~v~0)} assume !(1 != #t~ret4);havoc #t~mem3;havoc #t~ret4; {35029#(<= 5 main_~v~0)} is VALID [2018-11-18 23:04:06,694 INFO L273 TraceCheckUtils]: 82: Hoare triple {35029#(<= 5 main_~v~0)} #t~post2 := ~v~0;~v~0 := 1 + #t~post2;havoc #t~post2; {35066#(<= 6 main_~v~0)} is VALID [2018-11-18 23:04:06,694 INFO L273 TraceCheckUtils]: 83: Hoare triple {35066#(<= 6 main_~v~0)} assume true; {35066#(<= 6 main_~v~0)} is VALID [2018-11-18 23:04:06,694 INFO L273 TraceCheckUtils]: 84: Hoare triple {35066#(<= 6 main_~v~0)} assume !!(~v~0 < ~SIZE~0);call #t~mem3 := read~int(~#values~0.base, ~#values~0.offset + 4 * ~v~0, 4); {35066#(<= 6 main_~v~0)} is VALID [2018-11-18 23:04:06,694 INFO L256 TraceCheckUtils]: 85: Hoare triple {35066#(<= 6 main_~v~0)} call #t~ret4 := elem_exists(~#set~0.base, ~#set~0.offset, ~n~0, #t~mem3); {34788#true} is VALID [2018-11-18 23:04:06,694 INFO L273 TraceCheckUtils]: 86: Hoare triple {34788#true} ~set.base, ~set.offset := #in~set.base, #in~set.offset;~size := #in~size;~value := #in~value;havoc ~i~0;~i~0 := 0; {34788#true} is VALID [2018-11-18 23:04:06,695 INFO L273 TraceCheckUtils]: 87: Hoare triple {34788#true} assume true; {34788#true} is VALID [2018-11-18 23:04:06,695 INFO L273 TraceCheckUtils]: 88: Hoare triple {34788#true} assume !!(~i~0 < ~size);call #t~mem1 := read~int(~set.base, ~set.offset + 4 * ~i~0, 4); {34788#true} is VALID [2018-11-18 23:04:06,695 INFO L273 TraceCheckUtils]: 89: Hoare triple {34788#true} assume #t~mem1 == ~value;havoc #t~mem1;#res := 1; {34788#true} is VALID [2018-11-18 23:04:06,695 INFO L273 TraceCheckUtils]: 90: Hoare triple {34788#true} assume true; {34788#true} is VALID [2018-11-18 23:04:06,695 INFO L268 TraceCheckUtils]: 91: Hoare quadruple {34788#true} {35066#(<= 6 main_~v~0)} #132#return; {35066#(<= 6 main_~v~0)} is VALID [2018-11-18 23:04:06,696 INFO L273 TraceCheckUtils]: 92: Hoare triple {35066#(<= 6 main_~v~0)} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {35066#(<= 6 main_~v~0)} is VALID [2018-11-18 23:04:06,696 INFO L273 TraceCheckUtils]: 93: Hoare triple {35066#(<= 6 main_~v~0)} assume !(1 != #t~ret4);havoc #t~mem3;havoc #t~ret4; {35066#(<= 6 main_~v~0)} is VALID [2018-11-18 23:04:06,697 INFO L273 TraceCheckUtils]: 94: Hoare triple {35066#(<= 6 main_~v~0)} #t~post2 := ~v~0;~v~0 := 1 + #t~post2;havoc #t~post2; {35103#(<= 7 main_~v~0)} is VALID [2018-11-18 23:04:06,698 INFO L273 TraceCheckUtils]: 95: Hoare triple {35103#(<= 7 main_~v~0)} assume true; {35103#(<= 7 main_~v~0)} is VALID [2018-11-18 23:04:06,698 INFO L273 TraceCheckUtils]: 96: Hoare triple {35103#(<= 7 main_~v~0)} assume !!(~v~0 < ~SIZE~0);call #t~mem3 := read~int(~#values~0.base, ~#values~0.offset + 4 * ~v~0, 4); {35103#(<= 7 main_~v~0)} is VALID [2018-11-18 23:04:06,698 INFO L256 TraceCheckUtils]: 97: Hoare triple {35103#(<= 7 main_~v~0)} call #t~ret4 := elem_exists(~#set~0.base, ~#set~0.offset, ~n~0, #t~mem3); {34788#true} is VALID [2018-11-18 23:04:06,699 INFO L273 TraceCheckUtils]: 98: Hoare triple {34788#true} ~set.base, ~set.offset := #in~set.base, #in~set.offset;~size := #in~size;~value := #in~value;havoc ~i~0;~i~0 := 0; {34788#true} is VALID [2018-11-18 23:04:06,699 INFO L273 TraceCheckUtils]: 99: Hoare triple {34788#true} assume true; {34788#true} is VALID [2018-11-18 23:04:06,699 INFO L273 TraceCheckUtils]: 100: Hoare triple {34788#true} assume !!(~i~0 < ~size);call #t~mem1 := read~int(~set.base, ~set.offset + 4 * ~i~0, 4); {34788#true} is VALID [2018-11-18 23:04:06,699 INFO L273 TraceCheckUtils]: 101: Hoare triple {34788#true} assume #t~mem1 == ~value;havoc #t~mem1;#res := 1; {34788#true} is VALID [2018-11-18 23:04:06,699 INFO L273 TraceCheckUtils]: 102: Hoare triple {34788#true} assume true; {34788#true} is VALID [2018-11-18 23:04:06,700 INFO L268 TraceCheckUtils]: 103: Hoare quadruple {34788#true} {35103#(<= 7 main_~v~0)} #132#return; {35103#(<= 7 main_~v~0)} is VALID [2018-11-18 23:04:06,701 INFO L273 TraceCheckUtils]: 104: Hoare triple {35103#(<= 7 main_~v~0)} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {35103#(<= 7 main_~v~0)} is VALID [2018-11-18 23:04:06,701 INFO L273 TraceCheckUtils]: 105: Hoare triple {35103#(<= 7 main_~v~0)} assume !(1 != #t~ret4);havoc #t~mem3;havoc #t~ret4; {35103#(<= 7 main_~v~0)} is VALID [2018-11-18 23:04:06,702 INFO L273 TraceCheckUtils]: 106: Hoare triple {35103#(<= 7 main_~v~0)} #t~post2 := ~v~0;~v~0 := 1 + #t~post2;havoc #t~post2; {35140#(<= 8 main_~v~0)} is VALID [2018-11-18 23:04:06,702 INFO L273 TraceCheckUtils]: 107: Hoare triple {35140#(<= 8 main_~v~0)} assume true; {35140#(<= 8 main_~v~0)} is VALID [2018-11-18 23:04:06,702 INFO L273 TraceCheckUtils]: 108: Hoare triple {35140#(<= 8 main_~v~0)} assume !!(~v~0 < ~SIZE~0);call #t~mem3 := read~int(~#values~0.base, ~#values~0.offset + 4 * ~v~0, 4); {35140#(<= 8 main_~v~0)} is VALID [2018-11-18 23:04:06,702 INFO L256 TraceCheckUtils]: 109: Hoare triple {35140#(<= 8 main_~v~0)} call #t~ret4 := elem_exists(~#set~0.base, ~#set~0.offset, ~n~0, #t~mem3); {34788#true} is VALID [2018-11-18 23:04:06,702 INFO L273 TraceCheckUtils]: 110: Hoare triple {34788#true} ~set.base, ~set.offset := #in~set.base, #in~set.offset;~size := #in~size;~value := #in~value;havoc ~i~0;~i~0 := 0; {34788#true} is VALID [2018-11-18 23:04:06,703 INFO L273 TraceCheckUtils]: 111: Hoare triple {34788#true} assume true; {34788#true} is VALID [2018-11-18 23:04:06,703 INFO L273 TraceCheckUtils]: 112: Hoare triple {34788#true} assume !!(~i~0 < ~size);call #t~mem1 := read~int(~set.base, ~set.offset + 4 * ~i~0, 4); {34788#true} is VALID [2018-11-18 23:04:06,703 INFO L273 TraceCheckUtils]: 113: Hoare triple {34788#true} assume #t~mem1 == ~value;havoc #t~mem1;#res := 1; {34788#true} is VALID [2018-11-18 23:04:06,703 INFO L273 TraceCheckUtils]: 114: Hoare triple {34788#true} assume true; {34788#true} is VALID [2018-11-18 23:04:06,704 INFO L268 TraceCheckUtils]: 115: Hoare quadruple {34788#true} {35140#(<= 8 main_~v~0)} #132#return; {35140#(<= 8 main_~v~0)} is VALID [2018-11-18 23:04:06,705 INFO L273 TraceCheckUtils]: 116: Hoare triple {35140#(<= 8 main_~v~0)} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {35140#(<= 8 main_~v~0)} is VALID [2018-11-18 23:04:06,705 INFO L273 TraceCheckUtils]: 117: Hoare triple {35140#(<= 8 main_~v~0)} assume !(1 != #t~ret4);havoc #t~mem3;havoc #t~ret4; {35140#(<= 8 main_~v~0)} is VALID [2018-11-18 23:04:06,705 INFO L273 TraceCheckUtils]: 118: Hoare triple {35140#(<= 8 main_~v~0)} #t~post2 := ~v~0;~v~0 := 1 + #t~post2;havoc #t~post2; {35177#(<= 9 main_~v~0)} is VALID [2018-11-18 23:04:06,706 INFO L273 TraceCheckUtils]: 119: Hoare triple {35177#(<= 9 main_~v~0)} assume true; {35177#(<= 9 main_~v~0)} is VALID [2018-11-18 23:04:06,706 INFO L273 TraceCheckUtils]: 120: Hoare triple {35177#(<= 9 main_~v~0)} assume !!(~v~0 < ~SIZE~0);call #t~mem3 := read~int(~#values~0.base, ~#values~0.offset + 4 * ~v~0, 4); {35177#(<= 9 main_~v~0)} is VALID [2018-11-18 23:04:06,706 INFO L256 TraceCheckUtils]: 121: Hoare triple {35177#(<= 9 main_~v~0)} call #t~ret4 := elem_exists(~#set~0.base, ~#set~0.offset, ~n~0, #t~mem3); {34788#true} is VALID [2018-11-18 23:04:06,706 INFO L273 TraceCheckUtils]: 122: Hoare triple {34788#true} ~set.base, ~set.offset := #in~set.base, #in~set.offset;~size := #in~size;~value := #in~value;havoc ~i~0;~i~0 := 0; {34788#true} is VALID [2018-11-18 23:04:06,706 INFO L273 TraceCheckUtils]: 123: Hoare triple {34788#true} assume true; {34788#true} is VALID [2018-11-18 23:04:06,706 INFO L273 TraceCheckUtils]: 124: Hoare triple {34788#true} assume !!(~i~0 < ~size);call #t~mem1 := read~int(~set.base, ~set.offset + 4 * ~i~0, 4); {34788#true} is VALID [2018-11-18 23:04:06,707 INFO L273 TraceCheckUtils]: 125: Hoare triple {34788#true} assume #t~mem1 == ~value;havoc #t~mem1;#res := 1; {34788#true} is VALID [2018-11-18 23:04:06,707 INFO L273 TraceCheckUtils]: 126: Hoare triple {34788#true} assume true; {34788#true} is VALID [2018-11-18 23:04:06,707 INFO L268 TraceCheckUtils]: 127: Hoare quadruple {34788#true} {35177#(<= 9 main_~v~0)} #132#return; {35177#(<= 9 main_~v~0)} is VALID [2018-11-18 23:04:06,708 INFO L273 TraceCheckUtils]: 128: Hoare triple {35177#(<= 9 main_~v~0)} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {35177#(<= 9 main_~v~0)} is VALID [2018-11-18 23:04:06,708 INFO L273 TraceCheckUtils]: 129: Hoare triple {35177#(<= 9 main_~v~0)} assume !(1 != #t~ret4);havoc #t~mem3;havoc #t~ret4; {35177#(<= 9 main_~v~0)} is VALID [2018-11-18 23:04:06,709 INFO L273 TraceCheckUtils]: 130: Hoare triple {35177#(<= 9 main_~v~0)} #t~post2 := ~v~0;~v~0 := 1 + #t~post2;havoc #t~post2; {35214#(<= 10 main_~v~0)} is VALID [2018-11-18 23:04:06,709 INFO L273 TraceCheckUtils]: 131: Hoare triple {35214#(<= 10 main_~v~0)} assume true; {35214#(<= 10 main_~v~0)} is VALID [2018-11-18 23:04:06,710 INFO L273 TraceCheckUtils]: 132: Hoare triple {35214#(<= 10 main_~v~0)} assume !!(~v~0 < ~SIZE~0);call #t~mem3 := read~int(~#values~0.base, ~#values~0.offset + 4 * ~v~0, 4); {35214#(<= 10 main_~v~0)} is VALID [2018-11-18 23:04:06,710 INFO L256 TraceCheckUtils]: 133: Hoare triple {35214#(<= 10 main_~v~0)} call #t~ret4 := elem_exists(~#set~0.base, ~#set~0.offset, ~n~0, #t~mem3); {34788#true} is VALID [2018-11-18 23:04:06,710 INFO L273 TraceCheckUtils]: 134: Hoare triple {34788#true} ~set.base, ~set.offset := #in~set.base, #in~set.offset;~size := #in~size;~value := #in~value;havoc ~i~0;~i~0 := 0; {34788#true} is VALID [2018-11-18 23:04:06,710 INFO L273 TraceCheckUtils]: 135: Hoare triple {34788#true} assume true; {34788#true} is VALID [2018-11-18 23:04:06,711 INFO L273 TraceCheckUtils]: 136: Hoare triple {34788#true} assume !!(~i~0 < ~size);call #t~mem1 := read~int(~set.base, ~set.offset + 4 * ~i~0, 4); {34788#true} is VALID [2018-11-18 23:04:06,711 INFO L273 TraceCheckUtils]: 137: Hoare triple {34788#true} assume #t~mem1 == ~value;havoc #t~mem1;#res := 1; {34788#true} is VALID [2018-11-18 23:04:06,711 INFO L273 TraceCheckUtils]: 138: Hoare triple {34788#true} assume true; {34788#true} is VALID [2018-11-18 23:04:06,712 INFO L268 TraceCheckUtils]: 139: Hoare quadruple {34788#true} {35214#(<= 10 main_~v~0)} #132#return; {35214#(<= 10 main_~v~0)} is VALID [2018-11-18 23:04:06,713 INFO L273 TraceCheckUtils]: 140: Hoare triple {35214#(<= 10 main_~v~0)} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {35214#(<= 10 main_~v~0)} is VALID [2018-11-18 23:04:06,713 INFO L273 TraceCheckUtils]: 141: Hoare triple {35214#(<= 10 main_~v~0)} assume !(1 != #t~ret4);havoc #t~mem3;havoc #t~ret4; {35214#(<= 10 main_~v~0)} is VALID [2018-11-18 23:04:06,714 INFO L273 TraceCheckUtils]: 142: Hoare triple {35214#(<= 10 main_~v~0)} #t~post2 := ~v~0;~v~0 := 1 + #t~post2;havoc #t~post2; {35251#(<= 11 main_~v~0)} is VALID [2018-11-18 23:04:06,714 INFO L273 TraceCheckUtils]: 143: Hoare triple {35251#(<= 11 main_~v~0)} assume true; {35251#(<= 11 main_~v~0)} is VALID [2018-11-18 23:04:06,714 INFO L273 TraceCheckUtils]: 144: Hoare triple {35251#(<= 11 main_~v~0)} assume !!(~v~0 < ~SIZE~0);call #t~mem3 := read~int(~#values~0.base, ~#values~0.offset + 4 * ~v~0, 4); {35251#(<= 11 main_~v~0)} is VALID [2018-11-18 23:04:06,715 INFO L256 TraceCheckUtils]: 145: Hoare triple {35251#(<= 11 main_~v~0)} call #t~ret4 := elem_exists(~#set~0.base, ~#set~0.offset, ~n~0, #t~mem3); {34788#true} is VALID [2018-11-18 23:04:06,715 INFO L273 TraceCheckUtils]: 146: Hoare triple {34788#true} ~set.base, ~set.offset := #in~set.base, #in~set.offset;~size := #in~size;~value := #in~value;havoc ~i~0;~i~0 := 0; {34788#true} is VALID [2018-11-18 23:04:06,715 INFO L273 TraceCheckUtils]: 147: Hoare triple {34788#true} assume true; {34788#true} is VALID [2018-11-18 23:04:06,715 INFO L273 TraceCheckUtils]: 148: Hoare triple {34788#true} assume !!(~i~0 < ~size);call #t~mem1 := read~int(~set.base, ~set.offset + 4 * ~i~0, 4); {34788#true} is VALID [2018-11-18 23:04:06,715 INFO L273 TraceCheckUtils]: 149: Hoare triple {34788#true} assume #t~mem1 == ~value;havoc #t~mem1;#res := 1; {34788#true} is VALID [2018-11-18 23:04:06,715 INFO L273 TraceCheckUtils]: 150: Hoare triple {34788#true} assume true; {34788#true} is VALID [2018-11-18 23:04:06,716 INFO L268 TraceCheckUtils]: 151: Hoare quadruple {34788#true} {35251#(<= 11 main_~v~0)} #132#return; {35251#(<= 11 main_~v~0)} is VALID [2018-11-18 23:04:06,716 INFO L273 TraceCheckUtils]: 152: Hoare triple {35251#(<= 11 main_~v~0)} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {35251#(<= 11 main_~v~0)} is VALID [2018-11-18 23:04:06,716 INFO L273 TraceCheckUtils]: 153: Hoare triple {35251#(<= 11 main_~v~0)} assume !(1 != #t~ret4);havoc #t~mem3;havoc #t~ret4; {35251#(<= 11 main_~v~0)} is VALID [2018-11-18 23:04:06,717 INFO L273 TraceCheckUtils]: 154: Hoare triple {35251#(<= 11 main_~v~0)} #t~post2 := ~v~0;~v~0 := 1 + #t~post2;havoc #t~post2; {35288#(<= 12 main_~v~0)} is VALID [2018-11-18 23:04:06,717 INFO L273 TraceCheckUtils]: 155: Hoare triple {35288#(<= 12 main_~v~0)} assume true; {35288#(<= 12 main_~v~0)} is VALID [2018-11-18 23:04:06,718 INFO L273 TraceCheckUtils]: 156: Hoare triple {35288#(<= 12 main_~v~0)} assume !!(~v~0 < ~SIZE~0);call #t~mem3 := read~int(~#values~0.base, ~#values~0.offset + 4 * ~v~0, 4); {35288#(<= 12 main_~v~0)} is VALID [2018-11-18 23:04:06,718 INFO L256 TraceCheckUtils]: 157: Hoare triple {35288#(<= 12 main_~v~0)} call #t~ret4 := elem_exists(~#set~0.base, ~#set~0.offset, ~n~0, #t~mem3); {34788#true} is VALID [2018-11-18 23:04:06,718 INFO L273 TraceCheckUtils]: 158: Hoare triple {34788#true} ~set.base, ~set.offset := #in~set.base, #in~set.offset;~size := #in~size;~value := #in~value;havoc ~i~0;~i~0 := 0; {34788#true} is VALID [2018-11-18 23:04:06,719 INFO L273 TraceCheckUtils]: 159: Hoare triple {34788#true} assume true; {34788#true} is VALID [2018-11-18 23:04:06,719 INFO L273 TraceCheckUtils]: 160: Hoare triple {34788#true} assume !!(~i~0 < ~size);call #t~mem1 := read~int(~set.base, ~set.offset + 4 * ~i~0, 4); {34788#true} is VALID [2018-11-18 23:04:06,719 INFO L273 TraceCheckUtils]: 161: Hoare triple {34788#true} assume #t~mem1 == ~value;havoc #t~mem1;#res := 1; {34788#true} is VALID [2018-11-18 23:04:06,719 INFO L273 TraceCheckUtils]: 162: Hoare triple {34788#true} assume true; {34788#true} is VALID [2018-11-18 23:04:06,720 INFO L268 TraceCheckUtils]: 163: Hoare quadruple {34788#true} {35288#(<= 12 main_~v~0)} #132#return; {35288#(<= 12 main_~v~0)} is VALID [2018-11-18 23:04:06,721 INFO L273 TraceCheckUtils]: 164: Hoare triple {35288#(<= 12 main_~v~0)} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {35288#(<= 12 main_~v~0)} is VALID [2018-11-18 23:04:06,721 INFO L273 TraceCheckUtils]: 165: Hoare triple {35288#(<= 12 main_~v~0)} assume !(1 != #t~ret4);havoc #t~mem3;havoc #t~ret4; {35288#(<= 12 main_~v~0)} is VALID [2018-11-18 23:04:06,722 INFO L273 TraceCheckUtils]: 166: Hoare triple {35288#(<= 12 main_~v~0)} #t~post2 := ~v~0;~v~0 := 1 + #t~post2;havoc #t~post2; {35325#(<= 13 main_~v~0)} is VALID [2018-11-18 23:04:06,722 INFO L273 TraceCheckUtils]: 167: Hoare triple {35325#(<= 13 main_~v~0)} assume true; {35325#(<= 13 main_~v~0)} is VALID [2018-11-18 23:04:06,723 INFO L273 TraceCheckUtils]: 168: Hoare triple {35325#(<= 13 main_~v~0)} assume !!(~v~0 < ~SIZE~0);call #t~mem3 := read~int(~#values~0.base, ~#values~0.offset + 4 * ~v~0, 4); {35325#(<= 13 main_~v~0)} is VALID [2018-11-18 23:04:06,723 INFO L256 TraceCheckUtils]: 169: Hoare triple {35325#(<= 13 main_~v~0)} call #t~ret4 := elem_exists(~#set~0.base, ~#set~0.offset, ~n~0, #t~mem3); {34788#true} is VALID [2018-11-18 23:04:06,723 INFO L273 TraceCheckUtils]: 170: Hoare triple {34788#true} ~set.base, ~set.offset := #in~set.base, #in~set.offset;~size := #in~size;~value := #in~value;havoc ~i~0;~i~0 := 0; {34788#true} is VALID [2018-11-18 23:04:06,724 INFO L273 TraceCheckUtils]: 171: Hoare triple {34788#true} assume true; {34788#true} is VALID [2018-11-18 23:04:06,724 INFO L273 TraceCheckUtils]: 172: Hoare triple {34788#true} assume !!(~i~0 < ~size);call #t~mem1 := read~int(~set.base, ~set.offset + 4 * ~i~0, 4); {34788#true} is VALID [2018-11-18 23:04:06,724 INFO L273 TraceCheckUtils]: 173: Hoare triple {34788#true} assume #t~mem1 == ~value;havoc #t~mem1;#res := 1; {34788#true} is VALID [2018-11-18 23:04:06,724 INFO L273 TraceCheckUtils]: 174: Hoare triple {34788#true} assume true; {34788#true} is VALID [2018-11-18 23:04:06,725 INFO L268 TraceCheckUtils]: 175: Hoare quadruple {34788#true} {35325#(<= 13 main_~v~0)} #132#return; {35325#(<= 13 main_~v~0)} is VALID [2018-11-18 23:04:06,726 INFO L273 TraceCheckUtils]: 176: Hoare triple {35325#(<= 13 main_~v~0)} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {35325#(<= 13 main_~v~0)} is VALID [2018-11-18 23:04:06,726 INFO L273 TraceCheckUtils]: 177: Hoare triple {35325#(<= 13 main_~v~0)} assume !(1 != #t~ret4);havoc #t~mem3;havoc #t~ret4; {35325#(<= 13 main_~v~0)} is VALID [2018-11-18 23:04:06,726 INFO L273 TraceCheckUtils]: 178: Hoare triple {35325#(<= 13 main_~v~0)} #t~post2 := ~v~0;~v~0 := 1 + #t~post2;havoc #t~post2; {35362#(<= 14 main_~v~0)} is VALID [2018-11-18 23:04:06,727 INFO L273 TraceCheckUtils]: 179: Hoare triple {35362#(<= 14 main_~v~0)} assume true; {35362#(<= 14 main_~v~0)} is VALID [2018-11-18 23:04:06,727 INFO L273 TraceCheckUtils]: 180: Hoare triple {35362#(<= 14 main_~v~0)} assume !!(~v~0 < ~SIZE~0);call #t~mem3 := read~int(~#values~0.base, ~#values~0.offset + 4 * ~v~0, 4); {35362#(<= 14 main_~v~0)} is VALID [2018-11-18 23:04:06,727 INFO L256 TraceCheckUtils]: 181: Hoare triple {35362#(<= 14 main_~v~0)} call #t~ret4 := elem_exists(~#set~0.base, ~#set~0.offset, ~n~0, #t~mem3); {34788#true} is VALID [2018-11-18 23:04:06,727 INFO L273 TraceCheckUtils]: 182: Hoare triple {34788#true} ~set.base, ~set.offset := #in~set.base, #in~set.offset;~size := #in~size;~value := #in~value;havoc ~i~0;~i~0 := 0; {34788#true} is VALID [2018-11-18 23:04:06,727 INFO L273 TraceCheckUtils]: 183: Hoare triple {34788#true} assume true; {34788#true} is VALID [2018-11-18 23:04:06,727 INFO L273 TraceCheckUtils]: 184: Hoare triple {34788#true} assume !!(~i~0 < ~size);call #t~mem1 := read~int(~set.base, ~set.offset + 4 * ~i~0, 4); {34788#true} is VALID [2018-11-18 23:04:06,728 INFO L273 TraceCheckUtils]: 185: Hoare triple {34788#true} assume #t~mem1 == ~value;havoc #t~mem1;#res := 1; {34788#true} is VALID [2018-11-18 23:04:06,728 INFO L273 TraceCheckUtils]: 186: Hoare triple {34788#true} assume true; {34788#true} is VALID [2018-11-18 23:04:06,728 INFO L268 TraceCheckUtils]: 187: Hoare quadruple {34788#true} {35362#(<= 14 main_~v~0)} #132#return; {35362#(<= 14 main_~v~0)} is VALID [2018-11-18 23:04:06,729 INFO L273 TraceCheckUtils]: 188: Hoare triple {35362#(<= 14 main_~v~0)} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {35362#(<= 14 main_~v~0)} is VALID [2018-11-18 23:04:06,729 INFO L273 TraceCheckUtils]: 189: Hoare triple {35362#(<= 14 main_~v~0)} assume !(1 != #t~ret4);havoc #t~mem3;havoc #t~ret4; {35362#(<= 14 main_~v~0)} is VALID [2018-11-18 23:04:06,729 INFO L273 TraceCheckUtils]: 190: Hoare triple {35362#(<= 14 main_~v~0)} #t~post2 := ~v~0;~v~0 := 1 + #t~post2;havoc #t~post2; {35399#(<= 15 main_~v~0)} is VALID [2018-11-18 23:04:06,730 INFO L273 TraceCheckUtils]: 191: Hoare triple {35399#(<= 15 main_~v~0)} assume true; {35399#(<= 15 main_~v~0)} is VALID [2018-11-18 23:04:06,730 INFO L273 TraceCheckUtils]: 192: Hoare triple {35399#(<= 15 main_~v~0)} assume !!(~v~0 < ~SIZE~0);call #t~mem3 := read~int(~#values~0.base, ~#values~0.offset + 4 * ~v~0, 4); {35399#(<= 15 main_~v~0)} is VALID [2018-11-18 23:04:06,731 INFO L256 TraceCheckUtils]: 193: Hoare triple {35399#(<= 15 main_~v~0)} call #t~ret4 := elem_exists(~#set~0.base, ~#set~0.offset, ~n~0, #t~mem3); {34788#true} is VALID [2018-11-18 23:04:06,731 INFO L273 TraceCheckUtils]: 194: Hoare triple {34788#true} ~set.base, ~set.offset := #in~set.base, #in~set.offset;~size := #in~size;~value := #in~value;havoc ~i~0;~i~0 := 0; {34788#true} is VALID [2018-11-18 23:04:06,731 INFO L273 TraceCheckUtils]: 195: Hoare triple {34788#true} assume true; {34788#true} is VALID [2018-11-18 23:04:06,731 INFO L273 TraceCheckUtils]: 196: Hoare triple {34788#true} assume !!(~i~0 < ~size);call #t~mem1 := read~int(~set.base, ~set.offset + 4 * ~i~0, 4); {34788#true} is VALID [2018-11-18 23:04:06,731 INFO L273 TraceCheckUtils]: 197: Hoare triple {34788#true} assume #t~mem1 == ~value;havoc #t~mem1;#res := 1; {34788#true} is VALID [2018-11-18 23:04:06,732 INFO L273 TraceCheckUtils]: 198: Hoare triple {34788#true} assume true; {34788#true} is VALID [2018-11-18 23:04:06,733 INFO L268 TraceCheckUtils]: 199: Hoare quadruple {34788#true} {35399#(<= 15 main_~v~0)} #132#return; {35399#(<= 15 main_~v~0)} is VALID [2018-11-18 23:04:06,733 INFO L273 TraceCheckUtils]: 200: Hoare triple {35399#(<= 15 main_~v~0)} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {35399#(<= 15 main_~v~0)} is VALID [2018-11-18 23:04:06,734 INFO L273 TraceCheckUtils]: 201: Hoare triple {35399#(<= 15 main_~v~0)} assume !(1 != #t~ret4);havoc #t~mem3;havoc #t~ret4; {35399#(<= 15 main_~v~0)} is VALID [2018-11-18 23:04:06,735 INFO L273 TraceCheckUtils]: 202: Hoare triple {35399#(<= 15 main_~v~0)} #t~post2 := ~v~0;~v~0 := 1 + #t~post2;havoc #t~post2; {35436#(<= 16 main_~v~0)} is VALID [2018-11-18 23:04:06,735 INFO L273 TraceCheckUtils]: 203: Hoare triple {35436#(<= 16 main_~v~0)} assume true; {35436#(<= 16 main_~v~0)} is VALID [2018-11-18 23:04:06,736 INFO L273 TraceCheckUtils]: 204: Hoare triple {35436#(<= 16 main_~v~0)} assume !!(~v~0 < ~SIZE~0);call #t~mem3 := read~int(~#values~0.base, ~#values~0.offset + 4 * ~v~0, 4); {35436#(<= 16 main_~v~0)} is VALID [2018-11-18 23:04:06,736 INFO L256 TraceCheckUtils]: 205: Hoare triple {35436#(<= 16 main_~v~0)} call #t~ret4 := elem_exists(~#set~0.base, ~#set~0.offset, ~n~0, #t~mem3); {34788#true} is VALID [2018-11-18 23:04:06,736 INFO L273 TraceCheckUtils]: 206: Hoare triple {34788#true} ~set.base, ~set.offset := #in~set.base, #in~set.offset;~size := #in~size;~value := #in~value;havoc ~i~0;~i~0 := 0; {34788#true} is VALID [2018-11-18 23:04:06,736 INFO L273 TraceCheckUtils]: 207: Hoare triple {34788#true} assume true; {34788#true} is VALID [2018-11-18 23:04:06,736 INFO L273 TraceCheckUtils]: 208: Hoare triple {34788#true} assume !!(~i~0 < ~size);call #t~mem1 := read~int(~set.base, ~set.offset + 4 * ~i~0, 4); {34788#true} is VALID [2018-11-18 23:04:06,736 INFO L273 TraceCheckUtils]: 209: Hoare triple {34788#true} assume #t~mem1 == ~value;havoc #t~mem1;#res := 1; {34788#true} is VALID [2018-11-18 23:04:06,737 INFO L273 TraceCheckUtils]: 210: Hoare triple {34788#true} assume true; {34788#true} is VALID [2018-11-18 23:04:06,738 INFO L268 TraceCheckUtils]: 211: Hoare quadruple {34788#true} {35436#(<= 16 main_~v~0)} #132#return; {35436#(<= 16 main_~v~0)} is VALID [2018-11-18 23:04:06,738 INFO L273 TraceCheckUtils]: 212: Hoare triple {35436#(<= 16 main_~v~0)} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {35436#(<= 16 main_~v~0)} is VALID [2018-11-18 23:04:06,739 INFO L273 TraceCheckUtils]: 213: Hoare triple {35436#(<= 16 main_~v~0)} assume !(1 != #t~ret4);havoc #t~mem3;havoc #t~ret4; {35436#(<= 16 main_~v~0)} is VALID [2018-11-18 23:04:06,739 INFO L273 TraceCheckUtils]: 214: Hoare triple {35436#(<= 16 main_~v~0)} #t~post2 := ~v~0;~v~0 := 1 + #t~post2;havoc #t~post2; {35473#(<= 17 main_~v~0)} is VALID [2018-11-18 23:04:06,739 INFO L273 TraceCheckUtils]: 215: Hoare triple {35473#(<= 17 main_~v~0)} assume true; {35473#(<= 17 main_~v~0)} is VALID [2018-11-18 23:04:06,740 INFO L273 TraceCheckUtils]: 216: Hoare triple {35473#(<= 17 main_~v~0)} assume !!(~v~0 < ~SIZE~0);call #t~mem3 := read~int(~#values~0.base, ~#values~0.offset + 4 * ~v~0, 4); {35473#(<= 17 main_~v~0)} is VALID [2018-11-18 23:04:06,740 INFO L256 TraceCheckUtils]: 217: Hoare triple {35473#(<= 17 main_~v~0)} call #t~ret4 := elem_exists(~#set~0.base, ~#set~0.offset, ~n~0, #t~mem3); {34788#true} is VALID [2018-11-18 23:04:06,740 INFO L273 TraceCheckUtils]: 218: Hoare triple {34788#true} ~set.base, ~set.offset := #in~set.base, #in~set.offset;~size := #in~size;~value := #in~value;havoc ~i~0;~i~0 := 0; {34788#true} is VALID [2018-11-18 23:04:06,740 INFO L273 TraceCheckUtils]: 219: Hoare triple {34788#true} assume true; {34788#true} is VALID [2018-11-18 23:04:06,740 INFO L273 TraceCheckUtils]: 220: Hoare triple {34788#true} assume !!(~i~0 < ~size);call #t~mem1 := read~int(~set.base, ~set.offset + 4 * ~i~0, 4); {34788#true} is VALID [2018-11-18 23:04:06,740 INFO L273 TraceCheckUtils]: 221: Hoare triple {34788#true} assume #t~mem1 == ~value;havoc #t~mem1;#res := 1; {34788#true} is VALID [2018-11-18 23:04:06,740 INFO L273 TraceCheckUtils]: 222: Hoare triple {34788#true} assume true; {34788#true} is VALID [2018-11-18 23:04:06,741 INFO L268 TraceCheckUtils]: 223: Hoare quadruple {34788#true} {35473#(<= 17 main_~v~0)} #132#return; {35473#(<= 17 main_~v~0)} is VALID [2018-11-18 23:04:06,741 INFO L273 TraceCheckUtils]: 224: Hoare triple {35473#(<= 17 main_~v~0)} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {35473#(<= 17 main_~v~0)} is VALID [2018-11-18 23:04:06,742 INFO L273 TraceCheckUtils]: 225: Hoare triple {35473#(<= 17 main_~v~0)} assume !(1 != #t~ret4);havoc #t~mem3;havoc #t~ret4; {35473#(<= 17 main_~v~0)} is VALID [2018-11-18 23:04:06,742 INFO L273 TraceCheckUtils]: 226: Hoare triple {35473#(<= 17 main_~v~0)} #t~post2 := ~v~0;~v~0 := 1 + #t~post2;havoc #t~post2; {35510#(<= 18 main_~v~0)} is VALID [2018-11-18 23:04:06,742 INFO L273 TraceCheckUtils]: 227: Hoare triple {35510#(<= 18 main_~v~0)} assume true; {35510#(<= 18 main_~v~0)} is VALID [2018-11-18 23:04:06,743 INFO L273 TraceCheckUtils]: 228: Hoare triple {35510#(<= 18 main_~v~0)} assume !!(~v~0 < ~SIZE~0);call #t~mem3 := read~int(~#values~0.base, ~#values~0.offset + 4 * ~v~0, 4); {35517#(<= 19 ~SIZE~0)} is VALID [2018-11-18 23:04:06,744 INFO L256 TraceCheckUtils]: 229: Hoare triple {35517#(<= 19 ~SIZE~0)} call #t~ret4 := elem_exists(~#set~0.base, ~#set~0.offset, ~n~0, #t~mem3); {35517#(<= 19 ~SIZE~0)} is VALID [2018-11-18 23:04:06,745 INFO L273 TraceCheckUtils]: 230: Hoare triple {35517#(<= 19 ~SIZE~0)} ~set.base, ~set.offset := #in~set.base, #in~set.offset;~size := #in~size;~value := #in~value;havoc ~i~0;~i~0 := 0; {35517#(<= 19 ~SIZE~0)} is VALID [2018-11-18 23:04:06,745 INFO L273 TraceCheckUtils]: 231: Hoare triple {35517#(<= 19 ~SIZE~0)} assume true; {35517#(<= 19 ~SIZE~0)} is VALID [2018-11-18 23:04:06,746 INFO L273 TraceCheckUtils]: 232: Hoare triple {35517#(<= 19 ~SIZE~0)} assume !!(~i~0 < ~size);call #t~mem1 := read~int(~set.base, ~set.offset + 4 * ~i~0, 4); {35517#(<= 19 ~SIZE~0)} is VALID [2018-11-18 23:04:06,746 INFO L273 TraceCheckUtils]: 233: Hoare triple {35517#(<= 19 ~SIZE~0)} assume #t~mem1 == ~value;havoc #t~mem1;#res := 1; {35517#(<= 19 ~SIZE~0)} is VALID [2018-11-18 23:04:06,747 INFO L273 TraceCheckUtils]: 234: Hoare triple {35517#(<= 19 ~SIZE~0)} assume true; {35517#(<= 19 ~SIZE~0)} is VALID [2018-11-18 23:04:06,748 INFO L268 TraceCheckUtils]: 235: Hoare quadruple {35517#(<= 19 ~SIZE~0)} {35517#(<= 19 ~SIZE~0)} #132#return; {35517#(<= 19 ~SIZE~0)} is VALID [2018-11-18 23:04:06,748 INFO L273 TraceCheckUtils]: 236: Hoare triple {35517#(<= 19 ~SIZE~0)} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {35517#(<= 19 ~SIZE~0)} is VALID [2018-11-18 23:04:06,749 INFO L273 TraceCheckUtils]: 237: Hoare triple {35517#(<= 19 ~SIZE~0)} assume !(1 != #t~ret4);havoc #t~mem3;havoc #t~ret4; {35517#(<= 19 ~SIZE~0)} is VALID [2018-11-18 23:04:06,749 INFO L273 TraceCheckUtils]: 238: Hoare triple {35517#(<= 19 ~SIZE~0)} #t~post2 := ~v~0;~v~0 := 1 + #t~post2;havoc #t~post2; {35517#(<= 19 ~SIZE~0)} is VALID [2018-11-18 23:04:06,750 INFO L273 TraceCheckUtils]: 239: Hoare triple {35517#(<= 19 ~SIZE~0)} assume true; {35517#(<= 19 ~SIZE~0)} is VALID [2018-11-18 23:04:06,750 INFO L273 TraceCheckUtils]: 240: Hoare triple {35517#(<= 19 ~SIZE~0)} assume !(~v~0 < ~SIZE~0); {35517#(<= 19 ~SIZE~0)} is VALID [2018-11-18 23:04:06,751 INFO L273 TraceCheckUtils]: 241: Hoare triple {35517#(<= 19 ~SIZE~0)} ~i~1 := 0; {35557#(and (<= main_~i~1 0) (<= 19 ~SIZE~0))} is VALID [2018-11-18 23:04:06,752 INFO L273 TraceCheckUtils]: 242: Hoare triple {35557#(and (<= main_~i~1 0) (<= 19 ~SIZE~0))} assume true; {35557#(and (<= main_~i~1 0) (<= 19 ~SIZE~0))} is VALID [2018-11-18 23:04:06,752 INFO L273 TraceCheckUtils]: 243: Hoare triple {35557#(and (<= main_~i~1 0) (<= 19 ~SIZE~0))} assume !!(~i~1 < ~SIZE~0 && 1 != ~found~0);call #t~mem8 := read~int(~#set~0.base, ~#set~0.offset + 4 * ~i~1, 4); {35557#(and (<= main_~i~1 0) (<= 19 ~SIZE~0))} is VALID [2018-11-18 23:04:06,753 INFO L273 TraceCheckUtils]: 244: Hoare triple {35557#(and (<= main_~i~1 0) (<= 19 ~SIZE~0))} assume !(#t~mem8 == ~element~0);havoc #t~mem8; {35557#(and (<= main_~i~1 0) (<= 19 ~SIZE~0))} is VALID [2018-11-18 23:04:06,754 INFO L273 TraceCheckUtils]: 245: Hoare triple {35557#(and (<= main_~i~1 0) (<= 19 ~SIZE~0))} #t~post7 := ~i~1;~i~1 := 1 + #t~post7;havoc #t~post7; {35570#(and (<= main_~i~1 1) (<= 19 ~SIZE~0))} is VALID [2018-11-18 23:04:06,755 INFO L273 TraceCheckUtils]: 246: Hoare triple {35570#(and (<= main_~i~1 1) (<= 19 ~SIZE~0))} assume true; {35570#(and (<= main_~i~1 1) (<= 19 ~SIZE~0))} is VALID [2018-11-18 23:04:06,755 INFO L273 TraceCheckUtils]: 247: Hoare triple {35570#(and (<= main_~i~1 1) (<= 19 ~SIZE~0))} assume !!(~i~1 < ~SIZE~0 && 1 != ~found~0);call #t~mem8 := read~int(~#set~0.base, ~#set~0.offset + 4 * ~i~1, 4); {35570#(and (<= main_~i~1 1) (<= 19 ~SIZE~0))} is VALID [2018-11-18 23:04:06,756 INFO L273 TraceCheckUtils]: 248: Hoare triple {35570#(and (<= main_~i~1 1) (<= 19 ~SIZE~0))} assume !(#t~mem8 == ~element~0);havoc #t~mem8; {35570#(and (<= main_~i~1 1) (<= 19 ~SIZE~0))} is VALID [2018-11-18 23:04:06,757 INFO L273 TraceCheckUtils]: 249: Hoare triple {35570#(and (<= main_~i~1 1) (<= 19 ~SIZE~0))} #t~post7 := ~i~1;~i~1 := 1 + #t~post7;havoc #t~post7; {35583#(and (<= main_~i~1 2) (<= 19 ~SIZE~0))} is VALID [2018-11-18 23:04:06,757 INFO L273 TraceCheckUtils]: 250: Hoare triple {35583#(and (<= main_~i~1 2) (<= 19 ~SIZE~0))} assume true; {35583#(and (<= main_~i~1 2) (<= 19 ~SIZE~0))} is VALID [2018-11-18 23:04:06,758 INFO L273 TraceCheckUtils]: 251: Hoare triple {35583#(and (<= main_~i~1 2) (<= 19 ~SIZE~0))} assume !!(~i~1 < ~SIZE~0 && 1 != ~found~0);call #t~mem8 := read~int(~#set~0.base, ~#set~0.offset + 4 * ~i~1, 4); {35583#(and (<= main_~i~1 2) (<= 19 ~SIZE~0))} is VALID [2018-11-18 23:04:06,759 INFO L273 TraceCheckUtils]: 252: Hoare triple {35583#(and (<= main_~i~1 2) (<= 19 ~SIZE~0))} assume !(#t~mem8 == ~element~0);havoc #t~mem8; {35583#(and (<= main_~i~1 2) (<= 19 ~SIZE~0))} is VALID [2018-11-18 23:04:06,760 INFO L273 TraceCheckUtils]: 253: Hoare triple {35583#(and (<= main_~i~1 2) (<= 19 ~SIZE~0))} #t~post7 := ~i~1;~i~1 := 1 + #t~post7;havoc #t~post7; {35596#(and (<= main_~i~1 3) (<= 19 ~SIZE~0))} is VALID [2018-11-18 23:04:06,760 INFO L273 TraceCheckUtils]: 254: Hoare triple {35596#(and (<= main_~i~1 3) (<= 19 ~SIZE~0))} assume true; {35596#(and (<= main_~i~1 3) (<= 19 ~SIZE~0))} is VALID [2018-11-18 23:04:06,761 INFO L273 TraceCheckUtils]: 255: Hoare triple {35596#(and (<= main_~i~1 3) (<= 19 ~SIZE~0))} assume !!(~i~1 < ~SIZE~0 && 1 != ~found~0);call #t~mem8 := read~int(~#set~0.base, ~#set~0.offset + 4 * ~i~1, 4); {35596#(and (<= main_~i~1 3) (<= 19 ~SIZE~0))} is VALID [2018-11-18 23:04:06,762 INFO L273 TraceCheckUtils]: 256: Hoare triple {35596#(and (<= main_~i~1 3) (<= 19 ~SIZE~0))} assume #t~mem8 == ~element~0;havoc #t~mem8;~found~0 := 1;~pos~0 := ~i~1; {35606#(and (<= 19 ~SIZE~0) (<= main_~pos~0 3))} is VALID [2018-11-18 23:04:06,763 INFO L273 TraceCheckUtils]: 257: Hoare triple {35606#(and (<= 19 ~SIZE~0) (<= main_~pos~0 3))} #t~post7 := ~i~1;~i~1 := 1 + #t~post7;havoc #t~post7; {35606#(and (<= 19 ~SIZE~0) (<= main_~pos~0 3))} is VALID [2018-11-18 23:04:06,763 INFO L273 TraceCheckUtils]: 258: Hoare triple {35606#(and (<= 19 ~SIZE~0) (<= main_~pos~0 3))} assume true; {35606#(and (<= 19 ~SIZE~0) (<= main_~pos~0 3))} is VALID [2018-11-18 23:04:06,764 INFO L273 TraceCheckUtils]: 259: Hoare triple {35606#(and (<= 19 ~SIZE~0) (<= main_~pos~0 3))} assume !(~i~1 < ~SIZE~0 && 1 != ~found~0); {35606#(and (<= 19 ~SIZE~0) (<= main_~pos~0 3))} is VALID [2018-11-18 23:04:06,764 INFO L273 TraceCheckUtils]: 260: Hoare triple {35606#(and (<= 19 ~SIZE~0) (<= main_~pos~0 3))} assume 1 == ~found~0;~i~1 := ~pos~0; {35596#(and (<= main_~i~1 3) (<= 19 ~SIZE~0))} is VALID [2018-11-18 23:04:06,765 INFO L273 TraceCheckUtils]: 261: Hoare triple {35596#(and (<= main_~i~1 3) (<= 19 ~SIZE~0))} assume true; {35596#(and (<= main_~i~1 3) (<= 19 ~SIZE~0))} is VALID [2018-11-18 23:04:06,766 INFO L273 TraceCheckUtils]: 262: Hoare triple {35596#(and (<= main_~i~1 3) (<= 19 ~SIZE~0))} assume !!(~i~1 < ~SIZE~0 - 1);call #t~mem10 := read~int(~#set~0.base, ~#set~0.offset + 4 * (1 + ~i~1), 4);call write~int(#t~mem10, ~#set~0.base, ~#set~0.offset + 4 * ~i~1, 4);havoc #t~mem10; {35596#(and (<= main_~i~1 3) (<= 19 ~SIZE~0))} is VALID [2018-11-18 23:04:06,767 INFO L273 TraceCheckUtils]: 263: Hoare triple {35596#(and (<= main_~i~1 3) (<= 19 ~SIZE~0))} #t~post9 := ~i~1;~i~1 := 1 + #t~post9;havoc #t~post9; {35628#(and (<= main_~i~1 4) (<= 19 ~SIZE~0))} is VALID [2018-11-18 23:04:06,767 INFO L273 TraceCheckUtils]: 264: Hoare triple {35628#(and (<= main_~i~1 4) (<= 19 ~SIZE~0))} assume true; {35628#(and (<= main_~i~1 4) (<= 19 ~SIZE~0))} is VALID [2018-11-18 23:04:06,768 INFO L273 TraceCheckUtils]: 265: Hoare triple {35628#(and (<= main_~i~1 4) (<= 19 ~SIZE~0))} assume !(~i~1 < ~SIZE~0 - 1); {34789#false} is VALID [2018-11-18 23:04:06,768 INFO L273 TraceCheckUtils]: 266: Hoare triple {34789#false} assume 1 == ~found~0;~i~1 := 0; {34789#false} is VALID [2018-11-18 23:04:06,768 INFO L273 TraceCheckUtils]: 267: Hoare triple {34789#false} assume true; {34789#false} is VALID [2018-11-18 23:04:06,769 INFO L273 TraceCheckUtils]: 268: Hoare triple {34789#false} assume !!(~i~1 < ~SIZE~0 - 1);call #t~mem12 := read~int(~#set~0.base, ~#set~0.offset + 4 * ~i~1, 4); {34789#false} is VALID [2018-11-18 23:04:06,769 INFO L256 TraceCheckUtils]: 269: Hoare triple {34789#false} call __VERIFIER_assert((if #t~mem12 != ~element~0 then 1 else 0)); {34789#false} is VALID [2018-11-18 23:04:06,769 INFO L273 TraceCheckUtils]: 270: Hoare triple {34789#false} ~cond := #in~cond; {34789#false} is VALID [2018-11-18 23:04:06,769 INFO L273 TraceCheckUtils]: 271: Hoare triple {34789#false} assume 0 == ~cond; {34789#false} is VALID [2018-11-18 23:04:06,769 INFO L273 TraceCheckUtils]: 272: Hoare triple {34789#false} assume !false; {34789#false} is VALID [2018-11-18 23:04:06,810 INFO L134 CoverageAnalysis]: Checked inductivity of 2106 backedges. 1061 proven. 144 refuted. 0 times theorem prover too weak. 901 trivial. 0 not checked. [2018-11-18 23:04:06,830 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-18 23:04:06,830 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 28] total 49 [2018-11-18 23:04:06,831 INFO L78 Accepts]: Start accepts. Automaton has 49 states. Word has length 273 [2018-11-18 23:04:06,832 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-18 23:04:06,832 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 49 states. [2018-11-18 23:04:07,168 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 345 edges. 345 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 23:04:07,168 INFO L459 AbstractCegarLoop]: Interpolant automaton has 49 states [2018-11-18 23:04:07,168 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2018-11-18 23:04:07,169 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=476, Invalid=1876, Unknown=0, NotChecked=0, Total=2352 [2018-11-18 23:04:07,170 INFO L87 Difference]: Start difference. First operand 288 states and 386 transitions. Second operand 49 states.