java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf --traceabstraction.trace.refinement.strategy SIFA_TAIPAN --sifa.abstract.domain CompoundDomain --rcfgbuilder.size.of.a.code.block LoopFreeBlock --sifa.call.summarizer TopInputCallSummarizer --sifa.fluid SizeLimitFluid --sifa.simplification.technique SIMPLIFY_QUICK -i ../../../trunk/examples/svcomp/array-industry-pattern/check_removal_from_set_after_insertion.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-f4eb214f-m [2019-10-13 21:37:18,182 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-13 21:37:18,184 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-13 21:37:18,202 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-13 21:37:18,203 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-13 21:37:18,205 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-13 21:37:18,207 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-13 21:37:18,212 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-13 21:37:18,214 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-13 21:37:18,215 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-13 21:37:18,216 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-13 21:37:18,217 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-13 21:37:18,218 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-13 21:37:18,219 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-13 21:37:18,220 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-13 21:37:18,223 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-13 21:37:18,224 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-13 21:37:18,227 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-13 21:37:18,229 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-13 21:37:18,234 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-13 21:37:18,237 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-13 21:37:18,242 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-13 21:37:18,246 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-13 21:37:18,247 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-13 21:37:18,251 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-13 21:37:18,252 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-13 21:37:18,252 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-13 21:37:18,254 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-13 21:37:18,256 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-13 21:37:18,258 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-13 21:37:18,258 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-13 21:37:18,260 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-13 21:37:18,262 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-13 21:37:18,262 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-13 21:37:18,267 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-13 21:37:18,267 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-13 21:37:18,268 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-13 21:37:18,268 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-13 21:37:18,268 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-13 21:37:18,269 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-13 21:37:18,271 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-13 21:37:18,272 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-10-13 21:37:18,298 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-13 21:37:18,298 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-13 21:37:18,301 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-13 21:37:18,301 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-13 21:37:18,301 INFO L138 SettingsManager]: * Use SBE=true [2019-10-13 21:37:18,302 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-13 21:37:18,302 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-13 21:37:18,302 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-13 21:37:18,302 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-13 21:37:18,302 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-13 21:37:18,304 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-13 21:37:18,304 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-13 21:37:18,304 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-13 21:37:18,304 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-13 21:37:18,305 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-13 21:37:18,305 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-13 21:37:18,305 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-13 21:37:18,305 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-13 21:37:18,306 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-13 21:37:18,306 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-13 21:37:18,306 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-13 21:37:18,306 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-13 21:37:18,307 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-13 21:37:18,307 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-13 21:37:18,307 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-13 21:37:18,307 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-13 21:37:18,307 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-13 21:37:18,308 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-13 21:37:18,308 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Trace refinement strategy -> SIFA_TAIPAN Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.sifa: Abstract Domain -> CompoundDomain Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder: Size of a code block -> LoopFreeBlock Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.sifa: Call Summarizer -> TopInputCallSummarizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.sifa: Fluid -> SizeLimitFluid Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.sifa: Simplification Technique -> SIMPLIFY_QUICK [2019-10-13 21:37:18,642 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-13 21:37:18,656 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-13 21:37:18,661 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-13 21:37:18,662 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-13 21:37:18,663 INFO L275 PluginConnector]: CDTParser initialized [2019-10-13 21:37:18,664 INFO L428 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.c [2019-10-13 21:37:18,730 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4cd0a2e6e/2248ee8ced9645b9b366962f912056da/FLAGfb16d66f9 [2019-10-13 21:37:19,187 INFO L306 CDTParser]: Found 1 translation units. [2019-10-13 21:37:19,188 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/array-industry-pattern/check_removal_from_set_after_insertion.c [2019-10-13 21:37:19,195 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4cd0a2e6e/2248ee8ced9645b9b366962f912056da/FLAGfb16d66f9 [2019-10-13 21:37:19,528 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4cd0a2e6e/2248ee8ced9645b9b366962f912056da [2019-10-13 21:37:19,538 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-13 21:37:19,540 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-13 21:37:19,542 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-13 21:37:19,542 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-13 21:37:19,545 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-13 21:37:19,546 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 09:37:19" (1/1) ... [2019-10-13 21:37:19,549 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7c8bf277 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:37:19, skipping insertion in model container [2019-10-13 21:37:19,549 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 09:37:19" (1/1) ... [2019-10-13 21:37:19,557 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-13 21:37:19,577 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-13 21:37:19,846 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-13 21:37:19,863 INFO L188 MainTranslator]: Completed pre-run [2019-10-13 21:37:20,058 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-13 21:37:20,086 INFO L192 MainTranslator]: Completed translation [2019-10-13 21:37:20,086 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:37:20 WrapperNode [2019-10-13 21:37:20,087 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-13 21:37:20,088 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-13 21:37:20,088 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-13 21:37:20,089 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-13 21:37:20,104 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:37:20" (1/1) ... [2019-10-13 21:37:20,104 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:37:20" (1/1) ... [2019-10-13 21:37:20,113 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:37:20" (1/1) ... [2019-10-13 21:37:20,114 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:37:20" (1/1) ... [2019-10-13 21:37:20,124 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:37:20" (1/1) ... [2019-10-13 21:37:20,132 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:37:20" (1/1) ... [2019-10-13 21:37:20,134 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:37:20" (1/1) ... [2019-10-13 21:37:20,138 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-13 21:37:20,139 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-13 21:37:20,139 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-13 21:37:20,139 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-13 21:37:20,140 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:37:20" (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 [2019-10-13 21:37:20,201 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-13 21:37:20,202 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-13 21:37:20,202 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2019-10-13 21:37:20,202 INFO L138 BoogieDeclarations]: Found implementation of procedure insert [2019-10-13 21:37:20,202 INFO L138 BoogieDeclarations]: Found implementation of procedure elem_exists [2019-10-13 21:37:20,202 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-13 21:37:20,203 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-13 21:37:20,203 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2019-10-13 21:37:20,203 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-10-13 21:37:20,203 INFO L130 BoogieDeclarations]: Found specification of procedure insert [2019-10-13 21:37:20,203 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-10-13 21:37:20,203 INFO L130 BoogieDeclarations]: Found specification of procedure elem_exists [2019-10-13 21:37:20,204 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-10-13 21:37:20,204 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-13 21:37:20,204 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-10-13 21:37:20,204 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-10-13 21:37:20,204 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-13 21:37:20,204 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-13 21:37:20,765 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-13 21:37:20,766 INFO L284 CfgBuilder]: Removed 6 assume(true) statements. [2019-10-13 21:37:20,767 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 09:37:20 BoogieIcfgContainer [2019-10-13 21:37:20,768 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-13 21:37:20,770 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-13 21:37:20,770 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-13 21:37:20,774 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-13 21:37:20,774 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.10 09:37:19" (1/3) ... [2019-10-13 21:37:20,776 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@245adf77 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 09:37:20, skipping insertion in model container [2019-10-13 21:37:20,776 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:37:20" (2/3) ... [2019-10-13 21:37:20,777 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@245adf77 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 09:37:20, skipping insertion in model container [2019-10-13 21:37:20,777 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 09:37:20" (3/3) ... [2019-10-13 21:37:20,779 INFO L109 eAbstractionObserver]: Analyzing ICFG check_removal_from_set_after_insertion.c [2019-10-13 21:37:20,790 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-13 21:37:20,801 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-13 21:37:20,814 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-13 21:37:20,851 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-10-13 21:37:20,851 INFO L374 AbstractCegarLoop]: Hoare is true [2019-10-13 21:37:20,852 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-13 21:37:20,852 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-13 21:37:20,852 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-13 21:37:20,852 INFO L378 AbstractCegarLoop]: Difference is false [2019-10-13 21:37:20,853 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-13 21:37:20,853 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-13 21:37:20,883 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states. [2019-10-13 21:37:20,891 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-10-13 21:37:20,892 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:37:20,893 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:37:20,896 INFO L410 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:37:20,902 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:37:20,903 INFO L82 PathProgramCache]: Analyzing trace with hash -1837632078, now seen corresponding path program 1 times [2019-10-13 21:37:20,913 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 21:37:20,914 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [184075725] [2019-10-13 21:37:20,915 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:37:20,915 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:37:20,915 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:37:21,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:37:21,087 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 21:37:21,088 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [184075725] [2019-10-13 21:37:21,089 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:37:21,089 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 21:37:21,089 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [929119214] [2019-10-13 21:37:21,095 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 21:37:21,095 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 21:37:21,110 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 21:37:21,111 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 21:37:21,113 INFO L87 Difference]: Start difference. First operand 37 states. Second operand 3 states. [2019-10-13 21:37:21,179 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:37:21,180 INFO L93 Difference]: Finished difference Result 57 states and 74 transitions. [2019-10-13 21:37:21,181 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 21:37:21,183 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 15 [2019-10-13 21:37:21,183 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:37:21,192 INFO L225 Difference]: With dead ends: 57 [2019-10-13 21:37:21,192 INFO L226 Difference]: Without dead ends: 34 [2019-10-13 21:37:21,196 INFO L600 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 [2019-10-13 21:37:21,215 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2019-10-13 21:37:21,233 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2019-10-13 21:37:21,235 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2019-10-13 21:37:21,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 41 transitions. [2019-10-13 21:37:21,238 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 41 transitions. Word has length 15 [2019-10-13 21:37:21,239 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:37:21,239 INFO L462 AbstractCegarLoop]: Abstraction has 34 states and 41 transitions. [2019-10-13 21:37:21,239 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 21:37:21,239 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 41 transitions. [2019-10-13 21:37:21,240 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-10-13 21:37:21,240 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:37:21,241 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:37:21,241 INFO L410 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:37:21,241 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:37:21,242 INFO L82 PathProgramCache]: Analyzing trace with hash -659682392, now seen corresponding path program 1 times [2019-10-13 21:37:21,242 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 21:37:21,242 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1965514922] [2019-10-13 21:37:21,243 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:37:21,243 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:37:21,243 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:37:21,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:37:21,376 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 21:37:21,376 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1965514922] [2019-10-13 21:37:21,376 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1987295323] [2019-10-13 21:37:21,377 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 21:37:21,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:37:21,444 INFO L256 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 3 conjunts are in the unsatisfiable core [2019-10-13 21:37:21,451 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-13 21:37:21,491 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-10-13 21:37:21,492 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-13 21:37:21,536 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-10-13 21:37:21,536 INFO L223 tionRefinementEngine]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2019-10-13 21:37:21,536 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [5] total 8 [2019-10-13 21:37:21,537 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [917802096] [2019-10-13 21:37:21,538 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-13 21:37:21,539 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 21:37:21,539 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-13 21:37:21,540 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2019-10-13 21:37:21,540 INFO L87 Difference]: Start difference. First operand 34 states and 41 transitions. Second operand 6 states. [2019-10-13 21:37:21,702 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:37:21,702 INFO L93 Difference]: Finished difference Result 72 states and 90 transitions. [2019-10-13 21:37:21,703 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-13 21:37:21,716 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 17 [2019-10-13 21:37:21,717 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:37:21,719 INFO L225 Difference]: With dead ends: 72 [2019-10-13 21:37:21,719 INFO L226 Difference]: Without dead ends: 44 [2019-10-13 21:37:21,721 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2019-10-13 21:37:21,721 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2019-10-13 21:37:21,734 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 36. [2019-10-13 21:37:21,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2019-10-13 21:37:21,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 43 transitions. [2019-10-13 21:37:21,736 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 43 transitions. Word has length 17 [2019-10-13 21:37:21,737 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:37:21,737 INFO L462 AbstractCegarLoop]: Abstraction has 36 states and 43 transitions. [2019-10-13 21:37:21,737 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-13 21:37:21,737 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 43 transitions. [2019-10-13 21:37:21,738 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-10-13 21:37:21,738 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:37:21,739 INFO L380 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:37:21,943 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 21:37:21,943 INFO L410 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:37:21,944 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:37:21,944 INFO L82 PathProgramCache]: Analyzing trace with hash -2055252280, now seen corresponding path program 1 times [2019-10-13 21:37:21,944 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 21:37:21,944 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1434283288] [2019-10-13 21:37:21,945 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:37:21,945 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:37:21,945 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:37:22,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:37:22,089 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-10-13 21:37:22,090 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1434283288] [2019-10-13 21:37:22,090 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [359286143] [2019-10-13 21:37:22,091 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 21:37:22,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:37:22,145 INFO L256 TraceCheckSpWp]: Trace formula consists of 105 conjuncts, 5 conjunts are in the unsatisfiable core [2019-10-13 21:37:22,147 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-13 21:37:22,205 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-10-13 21:37:22,206 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-13 21:37:22,250 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-10-13 21:37:22,250 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1694339839] [2019-10-13 21:37:22,277 INFO L162 IcfgInterpreter]: Started Sifa with 17 locations of interest [2019-10-13 21:37:22,277 INFO L169 IcfgInterpreter]: Building call graph [2019-10-13 21:37:22,283 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-13 21:37:22,290 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-13 21:37:22,291 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-13 21:37:22,454 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 26 for LOIs [2019-10-13 21:37:24,863 INFO L199 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 35 for LOIs [2019-10-13 21:37:24,891 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 13 for LOIs [2019-10-13 21:37:24,904 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-13 21:37:24,904 INFO L191 IcfgInterpreter]: Final predicates for locations of interest are: [2019-10-13 21:37:24,905 INFO L193 IcfgInterpreter]: Reachable states at location L46-3 satisfy 93#(and (<= main_~v~0 0) (<= main_~i~1 0) (= main_~v~0 0) (not (< main_~v~0 ~SIZE~0)) (<= main_~element~0 2147483647) (<= 0 main_~i~1) (<= 0 main_~v~0) (= main_~i~1 0) (<= ~SIZE~0 0) (<= 0 (+ main_~element~0 2147483648))) [2019-10-13 21:37:24,906 INFO L193 IcfgInterpreter]: Reachable states at location L2 satisfy 128#(and (exists ((v_prenex_4 Int) (v_prenex_2 Int) (v_prenex_3 Int) (v_prenex_1 Int) (|v_main_~#set~0.base_BEFORE_CALL_1| Int) (|v_main_~#set~0.offset_BEFORE_CALL_1| Int)) (or (and (= |__VERIFIER_assert_#in~cond| 1) (<= 0 (+ (select (select |#memory_int| v_prenex_1) v_prenex_2) 2147483647)) (< 1 ~SIZE~0) (<= ~SIZE~0 0)) (and (<= (select (select |#memory_int| |v_main_~#set~0.base_BEFORE_CALL_1|) |v_main_~#set~0.offset_BEFORE_CALL_1|) 2147483647) (= |__VERIFIER_assert_#in~cond| 0) (<= 0 (+ (select (select |#memory_int| |v_main_~#set~0.base_BEFORE_CALL_1|) |v_main_~#set~0.offset_BEFORE_CALL_1|) 2147483648)) (< 1 ~SIZE~0) (<= ~SIZE~0 0)) (and (= |__VERIFIER_assert_#in~cond| 1) (< 1 ~SIZE~0) (<= (select (select |#memory_int| v_prenex_3) v_prenex_4) 2147483646) (<= ~SIZE~0 0)))) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-13 21:37:24,906 INFO L193 IcfgInterpreter]: Reachable states at location L65 satisfy 118#false [2019-10-13 21:37:24,907 INFO L193 IcfgInterpreter]: Reachable states at location L2-1 satisfy 133#(and (<= __VERIFIER_assert_~cond 0) (exists ((v_prenex_4 Int) (v_prenex_2 Int) (v_prenex_3 Int) (v_prenex_1 Int) (|v_main_~#set~0.base_BEFORE_CALL_1| Int) (|v_main_~#set~0.offset_BEFORE_CALL_1| Int)) (or (and (= |__VERIFIER_assert_#in~cond| 1) (<= 0 (+ (select (select |#memory_int| v_prenex_1) v_prenex_2) 2147483647)) (< 1 ~SIZE~0) (<= ~SIZE~0 0)) (and (<= (select (select |#memory_int| |v_main_~#set~0.base_BEFORE_CALL_1|) |v_main_~#set~0.offset_BEFORE_CALL_1|) 2147483647) (= |__VERIFIER_assert_#in~cond| 0) (<= 0 (+ (select (select |#memory_int| |v_main_~#set~0.base_BEFORE_CALL_1|) |v_main_~#set~0.offset_BEFORE_CALL_1|) 2147483648)) (< 1 ~SIZE~0) (<= ~SIZE~0 0)) (and (= |__VERIFIER_assert_#in~cond| 1) (< 1 ~SIZE~0) (<= (select (select |#memory_int| v_prenex_3) v_prenex_4) 2147483646) (<= ~SIZE~0 0)))) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-13 21:37:24,907 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initENTRY satisfy 142#(and (= |old(#NULL.base)| |#NULL.base|) (= |#valid| |old(#valid)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(~SIZE~0)| ~SIZE~0)) [2019-10-13 21:37:24,907 INFO L193 IcfgInterpreter]: Reachable states at location L38-3 satisfy 79#(and (<= main_~v~0 0) (= main_~v~0 0) (not (< main_~i~1 ~SIZE~0)) (<= main_~element~0 2147483647) (<= 0 main_~v~0) (<= 0 (+ main_~element~0 2147483648))) [2019-10-13 21:37:24,908 INFO L193 IcfgInterpreter]: Reachable states at location L-1 satisfy 23#(and (<= ~SIZE~0 100000) (= 0 |#NULL.base|) (<= |#NULL.base| 0) (= 0 (select |#valid| 0)) (<= 0 |#NULL.base|) (= ~SIZE~0 100000) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (<= 100000 ~SIZE~0)) [2019-10-13 21:37:24,908 INFO L193 IcfgInterpreter]: Reachable states at location mainENTRY satisfy 33#(and (<= ~SIZE~0 100000) (= 0 |#NULL.base|) (<= |#NULL.base| 0) (<= 0 |#NULL.base|) (= ~SIZE~0 100000) (= 0 (select |old(#valid)| 0)) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (<= 100000 ~SIZE~0) (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |#NULL.offset| 0) (= |old(#length)| |#length|)) [2019-10-13 21:37:24,908 INFO L193 IcfgInterpreter]: Reachable states at location L30-3 satisfy 74#true [2019-10-13 21:37:24,909 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initEXIT satisfy 147#(and (= |#valid| (store |old(#valid)| 0 0)) (<= ~SIZE~0 100000) (= 0 |#NULL.base|) (<= |#NULL.base| 0) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (= ~SIZE~0 100000) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (<= 100000 ~SIZE~0)) [2019-10-13 21:37:24,909 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.startENTRY satisfy 6#true [2019-10-13 21:37:24,909 INFO L193 IcfgInterpreter]: Reachable states at location L63-3 satisfy 113#(and (<= main_~v~0 0) (not (< main_~v~0 ~SIZE~0)) (<= 0 main_~i~1) (<= 0 main_~v~0) (= main_~i~1 0) (<= main_~found~0 1) (<= main_~i~1 0) (= 1 main_~found~0) (= main_~v~0 0) (<= main_~element~0 2147483647) (<= ~SIZE~0 (+ main_~pos~0 1)) (<= 1 main_~found~0) (<= ~SIZE~0 0) (<= 0 (+ main_~element~0 2147483648))) [2019-10-13 21:37:24,910 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION satisfy 138#(and (<= __VERIFIER_assert_~cond 0) (exists ((v_prenex_4 Int) (v_prenex_2 Int) (v_prenex_3 Int) (v_prenex_1 Int) (|v_main_~#set~0.base_BEFORE_CALL_1| Int) (|v_main_~#set~0.offset_BEFORE_CALL_1| Int)) (or (and (= |__VERIFIER_assert_#in~cond| 1) (<= 0 (+ (select (select |#memory_int| v_prenex_1) v_prenex_2) 2147483647)) (< 1 ~SIZE~0) (<= ~SIZE~0 0)) (and (<= (select (select |#memory_int| |v_main_~#set~0.base_BEFORE_CALL_1|) |v_main_~#set~0.offset_BEFORE_CALL_1|) 2147483647) (= |__VERIFIER_assert_#in~cond| 0) (<= 0 (+ (select (select |#memory_int| |v_main_~#set~0.base_BEFORE_CALL_1|) |v_main_~#set~0.offset_BEFORE_CALL_1|) 2147483648)) (< 1 ~SIZE~0) (<= ~SIZE~0 0)) (and (= |__VERIFIER_assert_#in~cond| 1) (< 1 ~SIZE~0) (<= (select (select |#memory_int| v_prenex_3) v_prenex_4) 2147483646) (<= ~SIZE~0 0)))) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-13 21:37:24,910 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertENTRY satisfy 123#(exists ((v_prenex_4 Int) (v_prenex_2 Int) (v_prenex_3 Int) (v_prenex_1 Int) (|v_main_~#set~0.base_BEFORE_CALL_1| Int) (|v_main_~#set~0.offset_BEFORE_CALL_1| Int)) (or (and (= |__VERIFIER_assert_#in~cond| 1) (<= 0 (+ (select (select |#memory_int| v_prenex_1) v_prenex_2) 2147483647)) (< 1 ~SIZE~0) (<= ~SIZE~0 0)) (and (<= (select (select |#memory_int| |v_main_~#set~0.base_BEFORE_CALL_1|) |v_main_~#set~0.offset_BEFORE_CALL_1|) 2147483647) (= |__VERIFIER_assert_#in~cond| 0) (<= 0 (+ (select (select |#memory_int| |v_main_~#set~0.base_BEFORE_CALL_1|) |v_main_~#set~0.offset_BEFORE_CALL_1|) 2147483648)) (< 1 ~SIZE~0) (<= ~SIZE~0 0)) (and (= |__VERIFIER_assert_#in~cond| 1) (< 1 ~SIZE~0) (<= (select (select |#memory_int| v_prenex_3) v_prenex_4) 2147483646) (<= ~SIZE~0 0)))) [2019-10-13 21:37:24,911 INFO L193 IcfgInterpreter]: Reachable states at location L55-3 satisfy 103#(and (<= main_~v~0 0) (= 1 main_~found~0) (= main_~v~0 0) (not (< main_~v~0 ~SIZE~0)) (<= main_~element~0 2147483647) (= main_~pos~0 main_~i~1) (<= 1 main_~found~0) (<= 0 main_~v~0) (<= main_~found~0 1) (<= ~SIZE~0 0) (<= 0 (+ main_~element~0 2147483648))) [2019-10-13 21:37:24,911 INFO L193 IcfgInterpreter]: Reachable states at location L46-4 satisfy 98#(and (<= main_~v~0 0) (<= main_~i~1 0) (or (and (= main_~v~0 0) (= 1 main_~found~0) (not (< main_~v~0 ~SIZE~0)) (= main_~i~1 0)) (and (= main_~v~0 0) (not (< main_~v~0 ~SIZE~0)) (not (< main_~i~1 ~SIZE~0)) (= main_~i~1 0))) (<= 0 main_~i~1) (<= main_~element~0 2147483647) (<= 0 main_~v~0) (<= ~SIZE~0 0) (<= 0 (+ main_~element~0 2147483648))) [2019-10-13 21:37:24,911 INFO L193 IcfgInterpreter]: Reachable states at location L53 satisfy 108#(and (<= main_~v~0 0) (= 1 main_~found~0) (= main_~v~0 0) (not (< main_~v~0 ~SIZE~0)) (<= main_~element~0 2147483647) (= main_~pos~0 main_~i~1) (not (< (+ main_~i~1 1) ~SIZE~0)) (<= 1 main_~found~0) (<= 0 main_~v~0) (<= main_~found~0 1) (<= ~SIZE~0 0) (<= 0 (+ main_~element~0 2147483648))) [2019-10-13 21:37:25,491 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 3 imperfect interpolant sequences. [2019-10-13 21:37:25,492 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [5, 6, 6] total 21 [2019-10-13 21:37:25,492 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1494561133] [2019-10-13 21:37:25,494 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-10-13 21:37:25,494 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 21:37:25,494 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-10-13 21:37:25,496 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=336, Unknown=0, NotChecked=0, Total=420 [2019-10-13 21:37:25,496 INFO L87 Difference]: Start difference. First operand 36 states and 43 transitions. Second operand 11 states. [2019-10-13 21:37:25,872 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:37:25,873 INFO L93 Difference]: Finished difference Result 57 states and 70 transitions. [2019-10-13 21:37:25,874 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-10-13 21:37:25,874 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 19 [2019-10-13 21:37:25,874 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:37:25,875 INFO L225 Difference]: With dead ends: 57 [2019-10-13 21:37:25,875 INFO L226 Difference]: Without dead ends: 43 [2019-10-13 21:37:25,878 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 38 SyntacticMatches, 5 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 202 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=106, Invalid=446, Unknown=0, NotChecked=0, Total=552 [2019-10-13 21:37:25,878 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2019-10-13 21:37:25,893 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 37. [2019-10-13 21:37:25,894 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2019-10-13 21:37:25,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 44 transitions. [2019-10-13 21:37:25,896 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 44 transitions. Word has length 19 [2019-10-13 21:37:25,896 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:37:25,897 INFO L462 AbstractCegarLoop]: Abstraction has 37 states and 44 transitions. [2019-10-13 21:37:25,897 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-10-13 21:37:25,897 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 44 transitions. [2019-10-13 21:37:25,898 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-10-13 21:37:25,898 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:37:25,899 INFO L380 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:37:26,102 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 21:37:26,103 INFO L410 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:37:26,103 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:37:26,104 INFO L82 PathProgramCache]: Analyzing trace with hash 1072893512, now seen corresponding path program 1 times [2019-10-13 21:37:26,105 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 21:37:26,105 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1140303601] [2019-10-13 21:37:26,105 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:37:26,106 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:37:26,106 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:37:26,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:37:26,190 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-10-13 21:37:26,191 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1140303601] [2019-10-13 21:37:26,191 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:37:26,191 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-13 21:37:26,192 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1262741386] [2019-10-13 21:37:26,192 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-13 21:37:26,192 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 21:37:26,193 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-13 21:37:26,193 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-13 21:37:26,194 INFO L87 Difference]: Start difference. First operand 37 states and 44 transitions. Second operand 4 states. [2019-10-13 21:37:26,216 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:37:26,217 INFO L93 Difference]: Finished difference Result 69 states and 83 transitions. [2019-10-13 21:37:26,218 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-13 21:37:26,218 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 28 [2019-10-13 21:37:26,219 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:37:26,219 INFO L225 Difference]: With dead ends: 69 [2019-10-13 21:37:26,220 INFO L226 Difference]: Without dead ends: 41 [2019-10-13 21:37:26,221 INFO L600 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 [2019-10-13 21:37:26,221 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2019-10-13 21:37:26,228 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2019-10-13 21:37:26,229 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2019-10-13 21:37:26,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 48 transitions. [2019-10-13 21:37:26,230 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 48 transitions. Word has length 28 [2019-10-13 21:37:26,230 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:37:26,231 INFO L462 AbstractCegarLoop]: Abstraction has 41 states and 48 transitions. [2019-10-13 21:37:26,231 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-13 21:37:26,231 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 48 transitions. [2019-10-13 21:37:26,232 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-10-13 21:37:26,232 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:37:26,232 INFO L380 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:37:26,233 INFO L410 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:37:26,233 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:37:26,233 INFO L82 PathProgramCache]: Analyzing trace with hash 2012221557, now seen corresponding path program 1 times [2019-10-13 21:37:26,233 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 21:37:26,234 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1757235394] [2019-10-13 21:37:26,234 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:37:26,234 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:37:26,234 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:37:26,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:37:26,307 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-10-13 21:37:26,308 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1757235394] [2019-10-13 21:37:26,308 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [510824275] [2019-10-13 21:37:26,308 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 21:37:26,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:37:26,382 INFO L256 TraceCheckSpWp]: Trace formula consists of 144 conjuncts, 5 conjunts are in the unsatisfiable core [2019-10-13 21:37:26,384 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-13 21:37:26,419 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-10-13 21:37:26,420 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-13 21:37:26,473 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-10-13 21:37:26,473 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [51037787] [2019-10-13 21:37:26,475 INFO L162 IcfgInterpreter]: Started Sifa with 26 locations of interest [2019-10-13 21:37:26,476 INFO L169 IcfgInterpreter]: Building call graph [2019-10-13 21:37:26,476 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-13 21:37:26,476 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-13 21:37:26,477 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-13 21:37:26,550 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 26 for LOIs [2019-10-13 21:37:27,727 INFO L199 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 34 for LOIs [2019-10-13 21:37:27,736 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 13 for LOIs [2019-10-13 21:37:27,742 INFO L199 IcfgInterpreter]: Interpreting procedure elem_exists with input of size 3 for LOIs [2019-10-13 21:37:27,758 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-13 21:37:27,758 INFO L191 IcfgInterpreter]: Final predicates for locations of interest are: [2019-10-13 21:37:27,759 INFO L193 IcfgInterpreter]: Reachable states at location L2 satisfy 849#(and (exists ((v_prenex_12 Int) (|v_main_~#set~0.base_BEFORE_CALL_10| Int) (v_prenex_11 Int) (v_prenex_10 Int) (|v_main_~#set~0.offset_BEFORE_CALL_10| Int) (v_prenex_9 Int)) (or (and (= |__VERIFIER_assert_#in~cond| 1) (< 1 ~SIZE~0) (<= (select (select |#memory_int| v_prenex_9) v_prenex_10) 2147483646)) (and (= |__VERIFIER_assert_#in~cond| 1) (<= 0 (+ (select (select |#memory_int| |v_main_~#set~0.base_BEFORE_CALL_10|) |v_main_~#set~0.offset_BEFORE_CALL_10|) 2147483647)) (< 1 ~SIZE~0)) (and (= |__VERIFIER_assert_#in~cond| 0) (<= 0 (+ (select (select |#memory_int| v_prenex_11) v_prenex_12) 2147483648)) (< 1 ~SIZE~0) (<= (select (select |#memory_int| v_prenex_11) v_prenex_12) 2147483647)))) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-13 21:37:27,759 INFO L193 IcfgInterpreter]: Reachable states at location L65 satisfy 422#(and (<= 1 ~SIZE~0) (<= 0 main_~pos~0) (<= 0 main_~i~1) (<= 0 main_~v~0) (= main_~i~1 0) (<= main_~found~0 1) (<= main_~i~1 0) (= 1 main_~found~0) (= (select (select |#memory_int| |main_~#set~0.base|) (+ |main_~#set~0.offset| (* main_~i~1 4))) |main_#t~mem16|) (<= main_~element~0 2147483647) (<= ~SIZE~0 (+ main_~pos~0 1)) (<= 1 main_~found~0) (<= 0 (+ main_~element~0 2147483648)) (< (+ main_~i~1 1) ~SIZE~0)) [2019-10-13 21:37:27,759 INFO L193 IcfgInterpreter]: Reachable states at location L2-1 satisfy 854#(and (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (exists ((v_prenex_12 Int) (|v_main_~#set~0.base_BEFORE_CALL_10| Int) (v_prenex_11 Int) (v_prenex_10 Int) (|v_main_~#set~0.offset_BEFORE_CALL_10| Int) (v_prenex_9 Int)) (or (and (= |__VERIFIER_assert_#in~cond| 1) (< 1 ~SIZE~0) (<= (select (select |#memory_int| v_prenex_9) v_prenex_10) 2147483646)) (and (= |__VERIFIER_assert_#in~cond| 1) (<= 0 (+ (select (select |#memory_int| |v_main_~#set~0.base_BEFORE_CALL_10|) |v_main_~#set~0.offset_BEFORE_CALL_10|) 2147483647)) (< 1 ~SIZE~0)) (and (= |__VERIFIER_assert_#in~cond| 0) (<= 0 (+ (select (select |#memory_int| v_prenex_11) v_prenex_12) 2147483648)) (< 1 ~SIZE~0) (<= (select (select |#memory_int| v_prenex_11) v_prenex_12) 2147483647)))) (<= 0 __VERIFIER_assert_~cond) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-13 21:37:27,760 INFO L193 IcfgInterpreter]: Reachable states at location L38-3 satisfy 824#(and (or (and (<= main_~v~0 0) (= main_~v~0 0) (not (< main_~i~1 ~SIZE~0))) (and (<= 0 main_~n~0) (< 0 main_~n~0) (<= 1 main_~v~0) (<= 0 main_~i~1) (<= 0 ~SIZE~0))) (<= main_~element~0 2147483647) (<= 0 main_~v~0) (<= 0 (+ main_~element~0 2147483648))) [2019-10-13 21:37:27,760 INFO L193 IcfgInterpreter]: Reachable states at location elem_existsFINAL satisfy 887#(and (< elem_exists_~i~0 elem_exists_~size) (= elem_exists_~value (select (select |#memory_int| elem_exists_~set.base) (+ (* elem_exists_~i~0 4) elem_exists_~set.offset))) (= elem_exists_~size |elem_exists_#in~size|) (<= 0 elem_exists_~size) (= elem_exists_~set.base |elem_exists_#in~set.base|) (= elem_exists_~value |elem_exists_#in~value|) (= |elem_exists_#in~set.offset| elem_exists_~set.offset) (= |elem_exists_#res| 1) (<= 0 elem_exists_~i~0) (<= elem_exists_~i~0 0) (= elem_exists_~i~0 0) (<= 0 ~SIZE~0) (<= |elem_exists_#res| 1) (<= 0 |elem_exists_#in~size|) (<= 1 |elem_exists_#res|)) [2019-10-13 21:37:27,760 INFO L193 IcfgInterpreter]: Reachable states at location L38-2 satisfy 834#(and (<= 0 main_~n~0) (< 0 main_~n~0) (<= 0 main_~i~1) (<= main_~element~0 2147483647) (<= 0 ~SIZE~0) (<= 0 main_~v~0) (<= 0 (+ main_~element~0 2147483648))) [2019-10-13 21:37:27,761 INFO L193 IcfgInterpreter]: Reachable states at location L18-3 satisfy 877#(and (= |elem_exists_#in~set.offset| elem_exists_~set.offset) (<= 0 elem_exists_~i~0) (= elem_exists_~size |elem_exists_#in~size|) (<= elem_exists_~i~0 0) (= elem_exists_~i~0 0) (<= 0 ~SIZE~0) (= elem_exists_~set.base |elem_exists_#in~set.base|) (= elem_exists_~value |elem_exists_#in~value|)) [2019-10-13 21:37:27,761 INFO L193 IcfgInterpreter]: Reachable states at location L-1 satisfy 23#(and (<= ~SIZE~0 100000) (= 0 |#NULL.base|) (<= |#NULL.base| 0) (= 0 (select |#valid| 0)) (<= 0 |#NULL.base|) (= ~SIZE~0 100000) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (<= 100000 ~SIZE~0)) [2019-10-13 21:37:27,761 INFO L193 IcfgInterpreter]: Reachable states at location mainENTRY satisfy 33#(and (<= ~SIZE~0 100000) (= 0 |#NULL.base|) (<= |#NULL.base| 0) (<= 0 |#NULL.base|) (= ~SIZE~0 100000) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (= 0 (select |old(#valid)| 0)) (<= 100000 ~SIZE~0) (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |#NULL.offset| 0) (= |old(#length)| |#length|)) [2019-10-13 21:37:27,761 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION satisfy 859#(and (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (exists ((v_prenex_12 Int) (|v_main_~#set~0.base_BEFORE_CALL_10| Int) (v_prenex_11 Int) (v_prenex_10 Int) (|v_main_~#set~0.offset_BEFORE_CALL_10| Int) (v_prenex_9 Int)) (or (and (= |__VERIFIER_assert_#in~cond| 1) (< 1 ~SIZE~0) (<= (select (select |#memory_int| v_prenex_9) v_prenex_10) 2147483646)) (and (= |__VERIFIER_assert_#in~cond| 1) (<= 0 (+ (select (select |#memory_int| |v_main_~#set~0.base_BEFORE_CALL_10|) |v_main_~#set~0.offset_BEFORE_CALL_10|) 2147483647)) (< 1 ~SIZE~0)) (and (= |__VERIFIER_assert_#in~cond| 0) (<= 0 (+ (select (select |#memory_int| v_prenex_11) v_prenex_12) 2147483648)) (< 1 ~SIZE~0) (<= (select (select |#memory_int| v_prenex_11) v_prenex_12) 2147483647)))) (<= 0 __VERIFIER_assert_~cond) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-13 21:37:27,762 INFO L193 IcfgInterpreter]: Reachable states at location L55-3 satisfy 680#(and (= 1 main_~found~0) (<= main_~element~0 2147483647) (= main_~pos~0 main_~i~1) (<= 1 main_~found~0) (<= 0 main_~v~0) (<= main_~found~0 1) (<= 0 (+ main_~element~0 2147483648))) [2019-10-13 21:37:27,762 INFO L193 IcfgInterpreter]: Reachable states at location L46-4 satisfy 748#(and (<= 0 main_~i~1) (<= main_~element~0 2147483647) (<= 0 main_~v~0) (<= 0 (+ main_~element~0 2147483648))) [2019-10-13 21:37:27,762 INFO L193 IcfgInterpreter]: Reachable states at location L53 satisfy 599#(and (= 1 main_~found~0) (<= main_~element~0 2147483647) (= main_~pos~0 main_~i~1) (not (< (+ main_~i~1 1) ~SIZE~0)) (<= 1 main_~found~0) (<= 0 main_~v~0) (<= main_~found~0 1) (<= 0 (+ main_~element~0 2147483648))) [2019-10-13 21:37:27,763 INFO L193 IcfgInterpreter]: Reachable states at location L46-3 satisfy 809#(and (<= 0 main_~i~1) (<= main_~element~0 2147483647) (<= 0 main_~v~0) (<= 0 (+ main_~element~0 2147483648))) [2019-10-13 21:37:27,763 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initENTRY satisfy 863#(and (= |old(#NULL.base)| |#NULL.base|) (= |#valid| |old(#valid)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(~SIZE~0)| ~SIZE~0)) [2019-10-13 21:37:27,763 INFO L193 IcfgInterpreter]: Reachable states at location elem_existsENTRY satisfy 872#(<= 0 ~SIZE~0) [2019-10-13 21:37:27,763 INFO L193 IcfgInterpreter]: Reachable states at location L39-2 satisfy 839#(and (<= 0 main_~n~0) (< 0 main_~n~0) (<= |main_#t~ret8| 2147483647) (<= |main_#t~ret8| 1) (<= 0 main_~i~1) (<= 0 main_~v~0) (<= 1 |main_#t~ret8|) (= 1 |main_#t~ret8|) (<= 0 (+ |main_#t~ret8| 2147483648)) (<= main_~element~0 2147483647) (<= 0 ~SIZE~0) (= (select (select |#memory_int| |main_~#set~0.base|) |main_~#set~0.offset|) |main_#t~mem7|) (<= 0 (+ main_~element~0 2147483648))) [2019-10-13 21:37:27,763 INFO L193 IcfgInterpreter]: Reachable states at location L30-3 satisfy 72#true [2019-10-13 21:37:27,764 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initEXIT satisfy 868#(and (= |#valid| (store |old(#valid)| 0 0)) (<= ~SIZE~0 100000) (= 0 |#NULL.base|) (<= |#NULL.base| 0) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (= ~SIZE~0 100000) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (<= 100000 ~SIZE~0)) [2019-10-13 21:37:27,764 INFO L193 IcfgInterpreter]: Reachable states at location L39-1 satisfy 191#(and (<= 0 main_~n~0) (< 0 main_~n~0) (<= 1 |main_#t~ret8|) (= 1 |main_#t~ret8|) (<= |main_#t~ret8| 1) (<= 0 main_~i~1) (<= main_~element~0 2147483647) (<= 0 ~SIZE~0) (<= 0 main_~v~0) (= (select (select |#memory_int| |main_~#set~0.base|) |main_~#set~0.offset|) |main_#t~mem7|) (<= 0 (+ main_~element~0 2147483648))) [2019-10-13 21:37:27,764 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.startENTRY satisfy 6#true [2019-10-13 21:37:27,764 INFO L193 IcfgInterpreter]: Reachable states at location L63-3 satisfy 513#(and (<= main_~i~1 0) (= 1 main_~found~0) (<= main_~element~0 2147483647) (<= 0 main_~i~1) (<= ~SIZE~0 (+ main_~pos~0 1)) (<= 1 main_~found~0) (<= 0 main_~v~0) (= main_~i~1 0) (<= main_~found~0 1) (<= 0 (+ main_~element~0 2147483648))) [2019-10-13 21:37:27,765 INFO L193 IcfgInterpreter]: Reachable states at location L39 satisfy 179#(and (<= 0 main_~i~1) (<= main_~element~0 2147483647) (<= 0 ~SIZE~0) (<= 0 main_~v~0) (<= 0 (+ main_~element~0 2147483648))) [2019-10-13 21:37:27,765 INFO L193 IcfgInterpreter]: Reachable states at location elem_existsEXIT satisfy 892#(and (< elem_exists_~i~0 elem_exists_~size) (= elem_exists_~value (select (select |#memory_int| elem_exists_~set.base) (+ (* elem_exists_~i~0 4) elem_exists_~set.offset))) (= elem_exists_~size |elem_exists_#in~size|) (<= 0 elem_exists_~size) (= elem_exists_~set.base |elem_exists_#in~set.base|) (= elem_exists_~value |elem_exists_#in~value|) (= |elem_exists_#in~set.offset| elem_exists_~set.offset) (= |elem_exists_#res| 1) (<= 0 elem_exists_~i~0) (<= elem_exists_~i~0 0) (= elem_exists_~i~0 0) (<= 0 ~SIZE~0) (<= |elem_exists_#res| 1) (<= 0 |elem_exists_#in~size|) (<= 1 |elem_exists_#res|)) [2019-10-13 21:37:27,765 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertENTRY satisfy 844#(exists ((v_prenex_12 Int) (|v_main_~#set~0.base_BEFORE_CALL_10| Int) (v_prenex_11 Int) (v_prenex_10 Int) (|v_main_~#set~0.offset_BEFORE_CALL_10| Int) (v_prenex_9 Int)) (or (and (= |__VERIFIER_assert_#in~cond| 1) (< 1 ~SIZE~0) (<= (select (select |#memory_int| v_prenex_9) v_prenex_10) 2147483646)) (and (= |__VERIFIER_assert_#in~cond| 1) (<= 0 (+ (select (select |#memory_int| |v_main_~#set~0.base_BEFORE_CALL_10|) |v_main_~#set~0.offset_BEFORE_CALL_10|) 2147483647)) (< 1 ~SIZE~0)) (and (= |__VERIFIER_assert_#in~cond| 0) (<= 0 (+ (select (select |#memory_int| v_prenex_11) v_prenex_12) 2147483648)) (< 1 ~SIZE~0) (<= (select (select |#memory_int| v_prenex_11) v_prenex_12) 2147483647)))) [2019-10-13 21:37:27,765 INFO L193 IcfgInterpreter]: Reachable states at location L19 satisfy 882#(and (= |elem_exists_#in~set.offset| elem_exists_~set.offset) (< elem_exists_~i~0 elem_exists_~size) (= |elem_exists_#t~mem1| (select (select |#memory_int| elem_exists_~set.base) (+ (* elem_exists_~i~0 4) elem_exists_~set.offset))) (<= 0 elem_exists_~i~0) (= elem_exists_~size |elem_exists_#in~size|) (<= elem_exists_~i~0 0) (<= 0 elem_exists_~size) (= elem_exists_~i~0 0) (<= 0 ~SIZE~0) (= elem_exists_~set.base |elem_exists_#in~set.base|) (<= 0 |elem_exists_#in~size|) (= elem_exists_~value |elem_exists_#in~value|)) [2019-10-13 21:37:28,915 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-13 21:37:28,915 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 6, 6, 21] total 32 [2019-10-13 21:37:28,916 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1756504117] [2019-10-13 21:37:28,917 INFO L442 AbstractCegarLoop]: Interpolant automaton has 32 states [2019-10-13 21:37:28,917 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 21:37:28,917 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2019-10-13 21:37:28,918 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=140, Invalid=852, Unknown=0, NotChecked=0, Total=992 [2019-10-13 21:37:28,918 INFO L87 Difference]: Start difference. First operand 41 states and 48 transitions. Second operand 32 states. [2019-10-13 21:37:35,090 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:37:35,090 INFO L93 Difference]: Finished difference Result 212 states and 288 transitions. [2019-10-13 21:37:35,090 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2019-10-13 21:37:35,091 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 29 [2019-10-13 21:37:35,091 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:37:35,095 INFO L225 Difference]: With dead ends: 212 [2019-10-13 21:37:35,095 INFO L226 Difference]: Without dead ends: 179 [2019-10-13 21:37:35,099 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 150 GetRequests, 63 SyntacticMatches, 1 SemanticMatches, 86 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2447 ImplicationChecksByTransitivity, 5.6s TimeCoverageRelationStatistics Valid=1302, Invalid=6354, Unknown=0, NotChecked=0, Total=7656 [2019-10-13 21:37:35,100 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 179 states. [2019-10-13 21:37:35,120 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 179 to 58. [2019-10-13 21:37:35,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2019-10-13 21:37:35,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 68 transitions. [2019-10-13 21:37:35,122 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 68 transitions. Word has length 29 [2019-10-13 21:37:35,122 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:37:35,122 INFO L462 AbstractCegarLoop]: Abstraction has 58 states and 68 transitions. [2019-10-13 21:37:35,122 INFO L463 AbstractCegarLoop]: Interpolant automaton has 32 states. [2019-10-13 21:37:35,123 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 68 transitions. [2019-10-13 21:37:35,124 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-10-13 21:37:35,124 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:37:35,124 INFO L380 BasicCegarLoop]: trace histogram [6, 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] [2019-10-13 21:37:35,327 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 21:37:35,328 INFO L410 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:37:35,329 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:37:35,329 INFO L82 PathProgramCache]: Analyzing trace with hash 1337455549, now seen corresponding path program 2 times [2019-10-13 21:37:35,330 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 21:37:35,331 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [235041766] [2019-10-13 21:37:35,331 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:37:35,331 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:37:35,331 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:37:35,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:37:35,406 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2019-10-13 21:37:35,406 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [235041766] [2019-10-13 21:37:35,407 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:37:35,407 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-13 21:37:35,407 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1270403577] [2019-10-13 21:37:35,407 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-13 21:37:35,408 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 21:37:35,408 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-13 21:37:35,408 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-13 21:37:35,408 INFO L87 Difference]: Start difference. First operand 58 states and 68 transitions. Second operand 5 states. [2019-10-13 21:37:35,494 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:37:35,495 INFO L93 Difference]: Finished difference Result 110 states and 134 transitions. [2019-10-13 21:37:35,495 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-13 21:37:35,496 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 34 [2019-10-13 21:37:35,496 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:37:35,497 INFO L225 Difference]: With dead ends: 110 [2019-10-13 21:37:35,497 INFO L226 Difference]: Without dead ends: 65 [2019-10-13 21:37:35,498 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-13 21:37:35,498 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2019-10-13 21:37:35,520 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 61. [2019-10-13 21:37:35,522 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2019-10-13 21:37:35,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 72 transitions. [2019-10-13 21:37:35,524 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 72 transitions. Word has length 34 [2019-10-13 21:37:35,525 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:37:35,525 INFO L462 AbstractCegarLoop]: Abstraction has 61 states and 72 transitions. [2019-10-13 21:37:35,525 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-13 21:37:35,525 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 72 transitions. [2019-10-13 21:37:35,530 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-10-13 21:37:35,530 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:37:35,531 INFO L380 BasicCegarLoop]: trace histogram [6, 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] [2019-10-13 21:37:35,531 INFO L410 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:37:35,531 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:37:35,531 INFO L82 PathProgramCache]: Analyzing trace with hash -783299171, now seen corresponding path program 1 times [2019-10-13 21:37:35,533 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 21:37:35,533 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [239632308] [2019-10-13 21:37:35,533 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:37:35,533 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:37:35,534 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:37:35,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:37:35,678 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-10-13 21:37:35,678 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [239632308] [2019-10-13 21:37:35,679 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1762420071] [2019-10-13 21:37:35,679 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 21:37:35,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:37:35,824 INFO L256 TraceCheckSpWp]: Trace formula consists of 205 conjuncts, 9 conjunts are in the unsatisfiable core [2019-10-13 21:37:35,834 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-13 21:37:35,952 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-10-13 21:37:35,952 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-13 21:37:36,091 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-10-13 21:37:36,092 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [59272238] [2019-10-13 21:37:36,094 INFO L162 IcfgInterpreter]: Started Sifa with 29 locations of interest [2019-10-13 21:37:36,094 INFO L169 IcfgInterpreter]: Building call graph [2019-10-13 21:37:36,095 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-13 21:37:36,095 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-13 21:37:36,095 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-13 21:37:36,126 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 26 for LOIs [2019-10-13 21:37:40,480 INFO L199 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 34 for LOIs [2019-10-13 21:37:40,486 INFO L199 IcfgInterpreter]: Interpreting procedure insert with input of size 9 for LOIs [2019-10-13 21:37:40,491 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 13 for LOIs [2019-10-13 21:37:40,494 INFO L199 IcfgInterpreter]: Interpreting procedure elem_exists with input of size 48 for LOIs [2019-10-13 21:37:40,505 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-13 21:37:40,506 INFO L191 IcfgInterpreter]: Final predicates for locations of interest are: [2019-10-13 21:37:40,523 INFO L193 IcfgInterpreter]: Reachable states at location L2 satisfy 2752#(and (exists ((v_prenex_26 Int) (v_prenex_23 Int) (v_prenex_25 Int) (v_prenex_24 Int) (|v_main_~#set~0.offset_BEFORE_CALL_28| Int) (|v_main_~#set~0.base_BEFORE_CALL_28| Int)) (or (and (= |__VERIFIER_assert_#in~cond| 1) (<= (select (select |#memory_int| |v_main_~#set~0.base_BEFORE_CALL_28|) |v_main_~#set~0.offset_BEFORE_CALL_28|) 2147483646) (< 1 ~SIZE~0)) (and (= |__VERIFIER_assert_#in~cond| 0) (<= 0 (+ (select (select |#memory_int| v_prenex_26) v_prenex_25) 2147483648)) (<= (select (select |#memory_int| v_prenex_26) v_prenex_25) 2147483647) (< 1 ~SIZE~0)) (and (= |__VERIFIER_assert_#in~cond| 1) (< 1 ~SIZE~0) (<= 0 (+ (select (select |#memory_int| v_prenex_24) v_prenex_23) 2147483647))))) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-13 21:37:40,523 INFO L193 IcfgInterpreter]: Reachable states at location L65 satisfy 580#(and (<= 1 ~SIZE~0) (<= 0 main_~pos~0) (<= 0 main_~i~1) (<= 0 main_~v~0) (= main_~i~1 0) (<= main_~found~0 1) (<= main_~i~1 0) (= 1 main_~found~0) (= (select (select |#memory_int| |main_~#set~0.base|) (+ |main_~#set~0.offset| (* main_~i~1 4))) |main_#t~mem16|) (<= main_~element~0 2147483647) (<= ~SIZE~0 (+ main_~pos~0 1)) (<= 1 main_~found~0) (<= 0 (+ main_~element~0 2147483648)) (< (+ main_~i~1 1) ~SIZE~0)) [2019-10-13 21:37:40,523 INFO L193 IcfgInterpreter]: Reachable states at location L2-1 satisfy 2757#(and (exists ((v_prenex_26 Int) (v_prenex_23 Int) (v_prenex_25 Int) (v_prenex_24 Int) (|v_main_~#set~0.offset_BEFORE_CALL_28| Int) (|v_main_~#set~0.base_BEFORE_CALL_28| Int)) (or (and (= |__VERIFIER_assert_#in~cond| 1) (<= (select (select |#memory_int| |v_main_~#set~0.base_BEFORE_CALL_28|) |v_main_~#set~0.offset_BEFORE_CALL_28|) 2147483646) (< 1 ~SIZE~0)) (and (= |__VERIFIER_assert_#in~cond| 0) (<= 0 (+ (select (select |#memory_int| v_prenex_26) v_prenex_25) 2147483648)) (<= (select (select |#memory_int| v_prenex_26) v_prenex_25) 2147483647) (< 1 ~SIZE~0)) (and (= |__VERIFIER_assert_#in~cond| 1) (< 1 ~SIZE~0) (<= 0 (+ (select (select |#memory_int| v_prenex_24) v_prenex_23) 2147483647))))) (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-13 21:37:40,523 INFO L193 IcfgInterpreter]: Reachable states at location L38-3 satisfy 2227#(and (or (and (<= main_~v~0 0) (= main_~v~0 0) (not (< main_~i~1 ~SIZE~0))) (and (<= main_~n~0 2147483647) (<= 1 main_~v~0) (<= 0 (+ main_~n~0 2147483648)) (<= 0 main_~i~1) (<= 0 ~SIZE~0) (<= main_~n~0 1))) (<= main_~element~0 2147483647) (<= 0 main_~v~0) (<= 0 (+ main_~element~0 2147483648))) [2019-10-13 21:37:40,524 INFO L193 IcfgInterpreter]: Reachable states at location elem_existsFINAL satisfy 2794#(and (<= |elem_exists_#res| 0) (<= elem_exists_~size 0) (= elem_exists_~size |elem_exists_#in~size|) (not (< elem_exists_~i~0 elem_exists_~size)) (= elem_exists_~set.base |elem_exists_#in~set.base|) (= elem_exists_~value |elem_exists_#in~value|) (exists ((v_prenex_99 Int) (v_prenex_96 Int) (v_prenex_95 Int) (v_prenex_98 Int) (v_prenex_97 Int) (|v_main_~#values~0.base_BEFORE_CALL_97| Int) (v_main_~v~0_BEFORE_CALL_141 Int) (|v_main_~#values~0.offset_BEFORE_CALL_97| Int)) (or (and (<= 0 ~SIZE~0) (< 0 ~SIZE~0) (= |elem_exists_#in~value| (select (select |#memory_int| v_prenex_95) v_prenex_96))) (and (= |elem_exists_#in~value| (select (select |#memory_int| v_prenex_97) (+ (* v_prenex_98 4) v_prenex_99))) (<= |elem_exists_#in~size| 1) (<= 0 v_prenex_98) (<= 1 v_prenex_98) (<= |elem_exists_#in~size| 2147483647) (<= 0 ~SIZE~0) (< v_prenex_98 ~SIZE~0) (<= v_prenex_98 0) (<= 0 (+ |elem_exists_#in~size| 2147483648))) (and (<= |elem_exists_#in~size| 1) (< v_main_~v~0_BEFORE_CALL_141 ~SIZE~0) (<= 1 v_main_~v~0_BEFORE_CALL_141) (<= 1 ~SIZE~0) (<= |elem_exists_#in~size| 2147483647) (<= 0 ~SIZE~0) (= |elem_exists_#in~value| (select (select |#memory_int| |v_main_~#values~0.base_BEFORE_CALL_97|) (+ (* v_main_~v~0_BEFORE_CALL_141 4) |v_main_~#values~0.offset_BEFORE_CALL_97|))) (<= 0 (+ |elem_exists_#in~size| 2147483648))))) (= |elem_exists_#in~set.offset| elem_exists_~set.offset) (<= |elem_exists_#in~size| 0) (= |elem_exists_#res| 0) (<= 0 elem_exists_~i~0) (<= elem_exists_~i~0 0) (= elem_exists_~i~0 0) (<= 0 |elem_exists_#res|)) [2019-10-13 21:37:40,524 INFO L193 IcfgInterpreter]: Reachable states at location L38-2 satisfy 2352#(and (<= main_~n~0 2147483647) (<= 0 main_~i~1) (<= main_~element~0 2147483647) (<= 0 ~SIZE~0) (<= 0 (+ main_~n~0 2147483648)) (<= 0 main_~v~0) (<= main_~n~0 1) (<= 0 (+ main_~element~0 2147483648))) [2019-10-13 21:37:40,524 INFO L193 IcfgInterpreter]: Reachable states at location L18-3 satisfy 2789#(and (exists ((v_prenex_99 Int) (v_prenex_96 Int) (v_prenex_95 Int) (v_prenex_98 Int) (v_prenex_97 Int) (|v_main_~#values~0.base_BEFORE_CALL_97| Int) (v_main_~v~0_BEFORE_CALL_141 Int) (|v_main_~#values~0.offset_BEFORE_CALL_97| Int)) (or (and (<= 0 ~SIZE~0) (< 0 ~SIZE~0) (= |elem_exists_#in~value| (select (select |#memory_int| v_prenex_95) v_prenex_96))) (and (= |elem_exists_#in~value| (select (select |#memory_int| v_prenex_97) (+ (* v_prenex_98 4) v_prenex_99))) (<= |elem_exists_#in~size| 1) (<= 0 v_prenex_98) (<= 1 v_prenex_98) (<= |elem_exists_#in~size| 2147483647) (<= 0 ~SIZE~0) (< v_prenex_98 ~SIZE~0) (<= v_prenex_98 0) (<= 0 (+ |elem_exists_#in~size| 2147483648))) (and (<= |elem_exists_#in~size| 1) (< v_main_~v~0_BEFORE_CALL_141 ~SIZE~0) (<= 1 v_main_~v~0_BEFORE_CALL_141) (<= 1 ~SIZE~0) (<= |elem_exists_#in~size| 2147483647) (<= 0 ~SIZE~0) (= |elem_exists_#in~value| (select (select |#memory_int| |v_main_~#values~0.base_BEFORE_CALL_97|) (+ (* v_main_~v~0_BEFORE_CALL_141 4) |v_main_~#values~0.offset_BEFORE_CALL_97|))) (<= 0 (+ |elem_exists_#in~size| 2147483648))))) (= |elem_exists_#in~set.offset| elem_exists_~set.offset) (<= 0 elem_exists_~i~0) (= elem_exists_~size |elem_exists_#in~size|) (<= elem_exists_~i~0 0) (= elem_exists_~i~0 0) (= elem_exists_~set.base |elem_exists_#in~set.base|) (= elem_exists_~value |elem_exists_#in~value|)) [2019-10-13 21:37:40,524 INFO L193 IcfgInterpreter]: Reachable states at location L-1 satisfy 23#(and (<= ~SIZE~0 100000) (= 0 |#NULL.base|) (<= |#NULL.base| 0) (= 0 (select |#valid| 0)) (<= 0 |#NULL.base|) (= ~SIZE~0 100000) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (<= 100000 ~SIZE~0)) [2019-10-13 21:37:40,524 INFO L193 IcfgInterpreter]: Reachable states at location mainENTRY satisfy 33#(and (<= ~SIZE~0 100000) (= 0 |#NULL.base|) (<= |#NULL.base| 0) (<= 0 |#NULL.base|) (= ~SIZE~0 100000) (= 0 (select |old(#valid)| 0)) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (<= 100000 ~SIZE~0) (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |#NULL.offset| 0) (= |old(#length)| |#length|)) [2019-10-13 21:37:40,525 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION satisfy 2762#(and (exists ((v_prenex_26 Int) (v_prenex_23 Int) (v_prenex_25 Int) (v_prenex_24 Int) (|v_main_~#set~0.offset_BEFORE_CALL_28| Int) (|v_main_~#set~0.base_BEFORE_CALL_28| Int)) (or (and (= |__VERIFIER_assert_#in~cond| 1) (<= (select (select |#memory_int| |v_main_~#set~0.base_BEFORE_CALL_28|) |v_main_~#set~0.offset_BEFORE_CALL_28|) 2147483646) (< 1 ~SIZE~0)) (and (= |__VERIFIER_assert_#in~cond| 0) (<= 0 (+ (select (select |#memory_int| v_prenex_26) v_prenex_25) 2147483648)) (<= (select (select |#memory_int| v_prenex_26) v_prenex_25) 2147483647) (< 1 ~SIZE~0)) (and (= |__VERIFIER_assert_#in~cond| 1) (< 1 ~SIZE~0) (<= 0 (+ (select (select |#memory_int| v_prenex_24) v_prenex_23) 2147483647))))) (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-13 21:37:40,525 INFO L193 IcfgInterpreter]: Reachable states at location L55-3 satisfy 1183#(and (= 1 main_~found~0) (<= main_~element~0 2147483647) (= main_~pos~0 main_~i~1) (<= 1 main_~found~0) (<= 0 main_~v~0) (<= main_~found~0 1) (<= 0 (+ main_~element~0 2147483648))) [2019-10-13 21:37:40,525 INFO L193 IcfgInterpreter]: Reachable states at location L46-4 satisfy 1511#(and (<= 0 main_~i~1) (<= main_~element~0 2147483647) (<= 0 main_~v~0) (<= 0 (+ main_~element~0 2147483648))) [2019-10-13 21:37:40,525 INFO L193 IcfgInterpreter]: Reachable states at location L53 satisfy 987#(and (= 1 main_~found~0) (<= main_~element~0 2147483647) (= main_~pos~0 main_~i~1) (not (< (+ main_~i~1 1) ~SIZE~0)) (<= 1 main_~found~0) (<= 0 main_~v~0) (<= main_~found~0 1) (<= 0 (+ main_~element~0 2147483648))) [2019-10-13 21:37:40,526 INFO L193 IcfgInterpreter]: Reachable states at location L46-3 satisfy 1962#(and (<= 0 main_~i~1) (<= main_~element~0 2147483647) (<= 0 main_~v~0) (<= 0 (+ main_~element~0 2147483648))) [2019-10-13 21:37:40,526 INFO L193 IcfgInterpreter]: Reachable states at location insertEXIT satisfy 2771#(and (= insert_~set.base |insert_#in~set.base|) (<= insert_~size 0) (<= |insert_#in~size| 0) (= |insert_#in~value| insert_~value) (= |insert_#in~set.offset| insert_~set.offset) (= |#memory_int| (store |old(#memory_int)| insert_~set.base (store (select |old(#memory_int)| insert_~set.base) (+ insert_~set.offset (* insert_~size 4)) insert_~value))) (<= 0 ~SIZE~0) (<= |insert_#res| 1) (= |insert_#res| (+ insert_~size 1)) (= |insert_#in~size| insert_~size)) [2019-10-13 21:37:40,526 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initENTRY satisfy 2775#(and (= |old(#NULL.base)| |#NULL.base|) (= |#valid| |old(#valid)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(~SIZE~0)| ~SIZE~0)) [2019-10-13 21:37:40,526 INFO L193 IcfgInterpreter]: Reachable states at location elem_existsENTRY satisfy 2784#(exists ((v_prenex_99 Int) (v_prenex_96 Int) (v_prenex_95 Int) (v_prenex_98 Int) (v_prenex_97 Int) (|v_main_~#values~0.base_BEFORE_CALL_97| Int) (v_main_~v~0_BEFORE_CALL_141 Int) (|v_main_~#values~0.offset_BEFORE_CALL_97| Int)) (or (and (<= 0 ~SIZE~0) (< 0 ~SIZE~0) (= |elem_exists_#in~value| (select (select |#memory_int| v_prenex_95) v_prenex_96))) (and (= |elem_exists_#in~value| (select (select |#memory_int| v_prenex_97) (+ (* v_prenex_98 4) v_prenex_99))) (<= |elem_exists_#in~size| 1) (<= 0 v_prenex_98) (<= 1 v_prenex_98) (<= |elem_exists_#in~size| 2147483647) (<= 0 ~SIZE~0) (< v_prenex_98 ~SIZE~0) (<= v_prenex_98 0) (<= 0 (+ |elem_exists_#in~size| 2147483648))) (and (<= |elem_exists_#in~size| 1) (< v_main_~v~0_BEFORE_CALL_141 ~SIZE~0) (<= 1 v_main_~v~0_BEFORE_CALL_141) (<= 1 ~SIZE~0) (<= |elem_exists_#in~size| 2147483647) (<= 0 ~SIZE~0) (= |elem_exists_#in~value| (select (select |#memory_int| |v_main_~#values~0.base_BEFORE_CALL_97|) (+ (* v_main_~v~0_BEFORE_CALL_141 4) |v_main_~#values~0.offset_BEFORE_CALL_97|))) (<= 0 (+ |elem_exists_#in~size| 2147483648))))) [2019-10-13 21:37:40,526 INFO L193 IcfgInterpreter]: Reachable states at location L39-2 satisfy 2743#(and (or (and (<= main_~v~0 0) (not (< main_~i~1 ~SIZE~0)) (<= |main_#t~ret8| 2147483647) (= 0 |main_#t~ret8|) (= (select (select |#memory_int| |main_~#values~0.base|) (+ (* main_~v~0 4) |main_~#values~0.offset|)) |main_#t~mem7|) (= main_~v~0 0) (<= 0 (+ |main_#t~ret8| 2147483648)) (< main_~v~0 ~SIZE~0)) (and (= |main_#t~ret8| 0) (<= 0 (+ |main_#t~ret8| 2147483648)) (<= |main_#t~ret8| 2147483647))) (<= main_~n~0 0) (<= 0 |main_#t~ret8|) (<= |main_#t~ret8| 0) (<= 0 main_~i~1) (<= main_~element~0 2147483647) (<= 0 ~SIZE~0) (<= 0 main_~v~0) (<= 0 (+ main_~element~0 2147483648))) [2019-10-13 21:37:40,527 INFO L193 IcfgInterpreter]: Reachable states at location L30-3 satisfy 72#true [2019-10-13 21:37:40,527 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initEXIT satisfy 2780#(and (= |#valid| (store |old(#valid)| 0 0)) (<= ~SIZE~0 100000) (= 0 |#NULL.base|) (<= |#NULL.base| 0) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (= ~SIZE~0 100000) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (<= 100000 ~SIZE~0)) [2019-10-13 21:37:40,527 INFO L193 IcfgInterpreter]: Reachable states at location L39-1 satisfy 2726#(and (<= main_~n~0 0) (= |main_#t~ret8| 0) (<= 0 |main_#t~ret8|) (<= |main_#t~ret8| 0) (<= 0 main_~i~1) (<= main_~element~0 2147483647) (<= 0 ~SIZE~0) (<= 0 main_~v~0) (<= 0 (+ main_~element~0 2147483648))) [2019-10-13 21:37:40,527 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.startENTRY satisfy 6#true [2019-10-13 21:37:40,527 INFO L193 IcfgInterpreter]: Reachable states at location L63-3 satisfy 786#(and (<= main_~i~1 0) (= 1 main_~found~0) (<= main_~element~0 2147483647) (<= 0 main_~i~1) (<= ~SIZE~0 (+ main_~pos~0 1)) (<= 1 main_~found~0) (<= 0 main_~v~0) (= main_~i~1 0) (<= main_~found~0 1) (<= 0 (+ main_~element~0 2147483648))) [2019-10-13 21:37:40,528 INFO L193 IcfgInterpreter]: Reachable states at location L39 satisfy 2097#(and (or (and (<= main_~n~0 2147483647) (= (select (select |#memory_int| |main_~#values~0.base|) (+ (* main_~v~0 4) |main_~#values~0.offset|)) |main_#t~mem7|) (<= 1 main_~v~0) (< main_~v~0 ~SIZE~0) (<= 0 (+ main_~n~0 2147483648)) (<= main_~n~0 1)) (and (<= main_~v~0 0) (= (select (select |#memory_int| |main_~#values~0.base|) (+ (* main_~v~0 4) |main_~#values~0.offset|)) |main_#t~mem7|) (= main_~v~0 0) (not (< main_~i~1 ~SIZE~0)) (< main_~v~0 ~SIZE~0))) (<= 0 main_~i~1) (<= main_~element~0 2147483647) (<= 0 ~SIZE~0) (<= 0 main_~v~0) (<= 0 (+ main_~element~0 2147483648))) [2019-10-13 21:37:40,528 INFO L193 IcfgInterpreter]: Reachable states at location insertENTRY satisfy 2766#(and (<= |insert_#in~size| 0) (<= 0 ~SIZE~0) (= |#memory_int| |old(#memory_int)|)) [2019-10-13 21:37:40,528 INFO L193 IcfgInterpreter]: Reachable states at location elem_existsEXIT satisfy 2799#(and (<= |elem_exists_#res| 0) (<= elem_exists_~size 0) (= elem_exists_~size |elem_exists_#in~size|) (not (< elem_exists_~i~0 elem_exists_~size)) (= elem_exists_~set.base |elem_exists_#in~set.base|) (= elem_exists_~value |elem_exists_#in~value|) (exists ((v_prenex_99 Int) (v_prenex_96 Int) (v_prenex_95 Int) (v_prenex_98 Int) (v_prenex_97 Int) (|v_main_~#values~0.base_BEFORE_CALL_97| Int) (v_main_~v~0_BEFORE_CALL_141 Int) (|v_main_~#values~0.offset_BEFORE_CALL_97| Int)) (or (and (<= 0 ~SIZE~0) (< 0 ~SIZE~0) (= |elem_exists_#in~value| (select (select |#memory_int| v_prenex_95) v_prenex_96))) (and (= |elem_exists_#in~value| (select (select |#memory_int| v_prenex_97) (+ (* v_prenex_98 4) v_prenex_99))) (<= |elem_exists_#in~size| 1) (<= 0 v_prenex_98) (<= 1 v_prenex_98) (<= |elem_exists_#in~size| 2147483647) (<= 0 ~SIZE~0) (< v_prenex_98 ~SIZE~0) (<= v_prenex_98 0) (<= 0 (+ |elem_exists_#in~size| 2147483648))) (and (<= |elem_exists_#in~size| 1) (< v_main_~v~0_BEFORE_CALL_141 ~SIZE~0) (<= 1 v_main_~v~0_BEFORE_CALL_141) (<= 1 ~SIZE~0) (<= |elem_exists_#in~size| 2147483647) (<= 0 ~SIZE~0) (= |elem_exists_#in~value| (select (select |#memory_int| |v_main_~#values~0.base_BEFORE_CALL_97|) (+ (* v_main_~v~0_BEFORE_CALL_141 4) |v_main_~#values~0.offset_BEFORE_CALL_97|))) (<= 0 (+ |elem_exists_#in~size| 2147483648))))) (= |elem_exists_#in~set.offset| elem_exists_~set.offset) (<= |elem_exists_#in~size| 0) (= |elem_exists_#res| 0) (<= 0 elem_exists_~i~0) (<= elem_exists_~i~0 0) (= elem_exists_~i~0 0) (<= 0 |elem_exists_#res|)) [2019-10-13 21:37:40,528 INFO L193 IcfgInterpreter]: Reachable states at location L41-1 satisfy 2579#(and (or (and (<= main_~n~0 0) (= (+ main_~n~0 1) |main_#t~ret10|) (= (select (select |#memory_int| |main_~#set~0.base|) (+ |main_~#set~0.offset| (* main_~n~0 4))) |main_#t~mem9|)) (and (<= main_~n~0 0) (= (+ main_~n~0 1) |main_#t~ret10|) (= (select (select |#memory_int| |main_~#set~0.base|) (+ |main_~#set~0.offset| (* |main_#t~ret10| 4) (- 4))) |main_#t~mem9|))) (<= 0 main_~i~1) (<= main_~element~0 2147483647) (<= 0 ~SIZE~0) (<= 0 main_~v~0) (<= |main_#t~ret10| 1) (<= 0 (+ main_~element~0 2147483648))) [2019-10-13 21:37:40,528 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertENTRY satisfy 2747#(exists ((v_prenex_26 Int) (v_prenex_23 Int) (v_prenex_25 Int) (v_prenex_24 Int) (|v_main_~#set~0.offset_BEFORE_CALL_28| Int) (|v_main_~#set~0.base_BEFORE_CALL_28| Int)) (or (and (= |__VERIFIER_assert_#in~cond| 1) (<= (select (select |#memory_int| |v_main_~#set~0.base_BEFORE_CALL_28|) |v_main_~#set~0.offset_BEFORE_CALL_28|) 2147483646) (< 1 ~SIZE~0)) (and (= |__VERIFIER_assert_#in~cond| 0) (<= 0 (+ (select (select |#memory_int| v_prenex_26) v_prenex_25) 2147483648)) (<= (select (select |#memory_int| v_prenex_26) v_prenex_25) 2147483647) (< 1 ~SIZE~0)) (and (= |__VERIFIER_assert_#in~cond| 1) (< 1 ~SIZE~0) (<= 0 (+ (select (select |#memory_int| v_prenex_24) v_prenex_23) 2147483647))))) [2019-10-13 21:37:40,529 INFO L193 IcfgInterpreter]: Reachable states at location L41 satisfy 2683#(and (<= main_~n~0 0) (<= 0 main_~i~1) (<= main_~element~0 2147483647) (<= 0 ~SIZE~0) (<= 0 main_~v~0) (<= 0 (+ main_~element~0 2147483648))) [2019-10-13 21:37:42,168 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-13 21:37:42,169 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10, 24] total 48 [2019-10-13 21:37:42,169 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1149919313] [2019-10-13 21:37:42,170 INFO L442 AbstractCegarLoop]: Interpolant automaton has 48 states [2019-10-13 21:37:42,170 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 21:37:42,170 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2019-10-13 21:37:42,172 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=334, Invalid=1922, Unknown=0, NotChecked=0, Total=2256 [2019-10-13 21:37:42,172 INFO L87 Difference]: Start difference. First operand 61 states and 72 transitions. Second operand 48 states. [2019-10-13 21:37:44,160 WARN L191 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 48 [2019-10-13 21:37:44,787 WARN L191 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 47 [2019-10-13 21:37:45,149 WARN L191 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 45 [2019-10-13 21:37:48,341 WARN L191 SmtUtils]: Spent 145.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 48 [2019-10-13 21:37:48,863 WARN L191 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 47 [2019-10-13 21:37:51,132 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:37:51,132 INFO L93 Difference]: Finished difference Result 290 states and 378 transitions. [2019-10-13 21:37:51,133 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 72 states. [2019-10-13 21:37:51,133 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 37 [2019-10-13 21:37:51,133 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:37:51,138 INFO L225 Difference]: With dead ends: 290 [2019-10-13 21:37:51,138 INFO L226 Difference]: Without dead ends: 241 [2019-10-13 21:37:51,142 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 204 GetRequests, 90 SyntacticMatches, 1 SemanticMatches, 113 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4433 ImplicationChecksByTransitivity, 8.0s TimeCoverageRelationStatistics Valid=2020, Invalid=11090, Unknown=0, NotChecked=0, Total=13110 [2019-10-13 21:37:51,143 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 241 states. [2019-10-13 21:37:51,168 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 241 to 93. [2019-10-13 21:37:51,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2019-10-13 21:37:51,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 110 transitions. [2019-10-13 21:37:51,169 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 110 transitions. Word has length 37 [2019-10-13 21:37:51,169 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:37:51,170 INFO L462 AbstractCegarLoop]: Abstraction has 93 states and 110 transitions. [2019-10-13 21:37:51,170 INFO L463 AbstractCegarLoop]: Interpolant automaton has 48 states. [2019-10-13 21:37:51,170 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 110 transitions. [2019-10-13 21:37:51,171 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-10-13 21:37:51,171 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:37:51,172 INFO L380 BasicCegarLoop]: trace histogram [14, 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] [2019-10-13 21:37:51,379 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 21:37:51,379 INFO L410 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:37:51,380 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:37:51,380 INFO L82 PathProgramCache]: Analyzing trace with hash 1625033245, now seen corresponding path program 2 times [2019-10-13 21:37:51,380 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 21:37:51,381 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1286541876] [2019-10-13 21:37:51,381 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:37:51,381 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:37:51,381 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:37:51,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:37:51,638 INFO L134 CoverageAnalysis]: Checked inductivity of 109 backedges. 0 proven. 105 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-10-13 21:37:51,639 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1286541876] [2019-10-13 21:37:51,639 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2075851096] [2019-10-13 21:37:51,639 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 21:37:51,831 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2019-10-13 21:37:51,831 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-13 21:37:51,832 INFO L256 TraceCheckSpWp]: Trace formula consists of 173 conjuncts, 4 conjunts are in the unsatisfiable core [2019-10-13 21:37:51,835 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-13 21:37:51,908 INFO L134 CoverageAnalysis]: Checked inductivity of 109 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 108 trivial. 0 not checked. [2019-10-13 21:37:51,909 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-13 21:37:51,981 INFO L134 CoverageAnalysis]: Checked inductivity of 109 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 108 trivial. 0 not checked. [2019-10-13 21:37:51,982 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [557779360] [2019-10-13 21:37:51,984 INFO L162 IcfgInterpreter]: Started Sifa with 29 locations of interest [2019-10-13 21:37:51,984 INFO L169 IcfgInterpreter]: Building call graph [2019-10-13 21:37:51,985 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-13 21:37:51,985 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-13 21:37:51,985 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-13 21:37:52,013 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 26 for LOIs [2019-10-13 21:37:56,213 INFO L199 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 34 for LOIs [2019-10-13 21:37:56,220 INFO L199 IcfgInterpreter]: Interpreting procedure insert with input of size 9 for LOIs [2019-10-13 21:37:56,223 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 13 for LOIs [2019-10-13 21:37:56,226 INFO L199 IcfgInterpreter]: Interpreting procedure elem_exists with input of size 48 for LOIs [2019-10-13 21:37:56,233 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-13 21:37:56,234 INFO L191 IcfgInterpreter]: Final predicates for locations of interest are: [2019-10-13 21:37:56,234 INFO L193 IcfgInterpreter]: Reachable states at location L2 satisfy 2730#(and (exists ((|v_main_~#set~0.base_BEFORE_CALL_257| Int) (v_prenex_194 Int) (|v_main_~#set~0.offset_BEFORE_CALL_257| Int) (v_prenex_195 Int) (v_prenex_192 Int) (v_prenex_193 Int)) (or (and (= |__VERIFIER_assert_#in~cond| 0) (<= 0 (+ (select (select |#memory_int| v_prenex_194) v_prenex_195) 2147483648)) (<= (select (select |#memory_int| v_prenex_194) v_prenex_195) 2147483647) (< 1 ~SIZE~0)) (and (= |__VERIFIER_assert_#in~cond| 1) (< 1 ~SIZE~0) (<= (select (select |#memory_int| |v_main_~#set~0.base_BEFORE_CALL_257|) |v_main_~#set~0.offset_BEFORE_CALL_257|) 2147483646)) (and (= |__VERIFIER_assert_#in~cond| 1) (<= 0 (+ (select (select |#memory_int| v_prenex_192) v_prenex_193) 2147483647)) (< 1 ~SIZE~0)))) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-13 21:37:56,234 INFO L193 IcfgInterpreter]: Reachable states at location L65 satisfy 594#(and (<= 1 ~SIZE~0) (<= 0 main_~pos~0) (<= 0 main_~i~1) (<= 0 main_~v~0) (= main_~i~1 0) (<= main_~found~0 1) (<= main_~i~1 0) (= 1 main_~found~0) (= (select (select |#memory_int| |main_~#set~0.base|) (+ |main_~#set~0.offset| (* main_~i~1 4))) |main_#t~mem16|) (<= main_~element~0 2147483647) (<= ~SIZE~0 (+ main_~pos~0 1)) (<= 1 main_~found~0) (<= 0 (+ main_~element~0 2147483648)) (< (+ main_~i~1 1) ~SIZE~0)) [2019-10-13 21:37:56,235 INFO L193 IcfgInterpreter]: Reachable states at location L2-1 satisfy 2735#(and (exists ((|v_main_~#set~0.base_BEFORE_CALL_257| Int) (v_prenex_194 Int) (|v_main_~#set~0.offset_BEFORE_CALL_257| Int) (v_prenex_195 Int) (v_prenex_192 Int) (v_prenex_193 Int)) (or (and (= |__VERIFIER_assert_#in~cond| 0) (<= 0 (+ (select (select |#memory_int| v_prenex_194) v_prenex_195) 2147483648)) (<= (select (select |#memory_int| v_prenex_194) v_prenex_195) 2147483647) (< 1 ~SIZE~0)) (and (= |__VERIFIER_assert_#in~cond| 1) (< 1 ~SIZE~0) (<= (select (select |#memory_int| |v_main_~#set~0.base_BEFORE_CALL_257|) |v_main_~#set~0.offset_BEFORE_CALL_257|) 2147483646)) (and (= |__VERIFIER_assert_#in~cond| 1) (<= 0 (+ (select (select |#memory_int| v_prenex_192) v_prenex_193) 2147483647)) (< 1 ~SIZE~0)))) (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-13 21:37:56,235 INFO L193 IcfgInterpreter]: Reachable states at location L38-3 satisfy 2212#(and (or (and (<= main_~v~0 0) (= main_~v~0 0) (not (< main_~i~1 ~SIZE~0))) (and (<= main_~n~0 2147483647) (<= 1 main_~v~0) (<= 0 main_~i~1) (<= 0 ~SIZE~0) (<= 0 (+ main_~n~0 2147483648)) (<= main_~n~0 1))) (<= main_~element~0 2147483647) (<= 0 main_~v~0) (<= 0 (+ main_~element~0 2147483648))) [2019-10-13 21:37:56,236 INFO L193 IcfgInterpreter]: Reachable states at location elem_existsFINAL satisfy 2772#(and (<= |elem_exists_#res| 0) (<= elem_exists_~size 0) (= elem_exists_~size |elem_exists_#in~size|) (not (< elem_exists_~i~0 elem_exists_~size)) (= elem_exists_~set.base |elem_exists_#in~set.base|) (exists ((|v_main_~#values~0.offset_BEFORE_CALL_264| Int) (v_prenex_268 Int) (v_prenex_266 Int) (v_prenex_267 Int) (v_prenex_264 Int) (v_prenex_265 Int) (|v_main_~#values~0.base_BEFORE_CALL_264| Int) (v_main_~v~0_BEFORE_CALL_374 Int)) (or (and (<= v_prenex_266 0) (<= |elem_exists_#in~size| 1) (= |elem_exists_#in~value| (select (select |#memory_int| v_prenex_265) (+ v_prenex_264 (* v_prenex_266 4)))) (<= |elem_exists_#in~size| 2147483647) (< v_prenex_266 ~SIZE~0) (<= 0 ~SIZE~0) (<= 0 v_prenex_266) (<= 0 (+ |elem_exists_#in~size| 2147483648)) (<= 1 v_prenex_266)) (and (<= |elem_exists_#in~size| 1) (<= 1 ~SIZE~0) (< v_main_~v~0_BEFORE_CALL_374 ~SIZE~0) (<= |elem_exists_#in~size| 2147483647) (<= 1 v_main_~v~0_BEFORE_CALL_374) (<= 0 ~SIZE~0) (<= 0 (+ |elem_exists_#in~size| 2147483648)) (= |elem_exists_#in~value| (select (select |#memory_int| |v_main_~#values~0.base_BEFORE_CALL_264|) (+ |v_main_~#values~0.offset_BEFORE_CALL_264| (* v_main_~v~0_BEFORE_CALL_374 4))))) (and (<= 0 ~SIZE~0) (< 0 ~SIZE~0) (= (select (select |#memory_int| v_prenex_268) v_prenex_267) |elem_exists_#in~value|)))) (= elem_exists_~value |elem_exists_#in~value|) (= |elem_exists_#in~set.offset| elem_exists_~set.offset) (<= |elem_exists_#in~size| 0) (= |elem_exists_#res| 0) (<= 0 elem_exists_~i~0) (<= elem_exists_~i~0 0) (= elem_exists_~i~0 0) (<= 0 |elem_exists_#res|)) [2019-10-13 21:37:56,236 INFO L193 IcfgInterpreter]: Reachable states at location L38-2 satisfy 2337#(and (<= main_~n~0 2147483647) (<= 0 main_~i~1) (<= main_~element~0 2147483647) (<= 0 ~SIZE~0) (<= 0 (+ main_~n~0 2147483648)) (<= 0 main_~v~0) (<= main_~n~0 1) (<= 0 (+ main_~element~0 2147483648))) [2019-10-13 21:37:56,236 INFO L193 IcfgInterpreter]: Reachable states at location L18-3 satisfy 2767#(and (= |elem_exists_#in~set.offset| elem_exists_~set.offset) (<= 0 elem_exists_~i~0) (= elem_exists_~size |elem_exists_#in~size|) (<= elem_exists_~i~0 0) (= elem_exists_~i~0 0) (= elem_exists_~set.base |elem_exists_#in~set.base|) (exists ((|v_main_~#values~0.offset_BEFORE_CALL_264| Int) (v_prenex_268 Int) (v_prenex_266 Int) (v_prenex_267 Int) (v_prenex_264 Int) (v_prenex_265 Int) (|v_main_~#values~0.base_BEFORE_CALL_264| Int) (v_main_~v~0_BEFORE_CALL_374 Int)) (or (and (<= v_prenex_266 0) (<= |elem_exists_#in~size| 1) (= |elem_exists_#in~value| (select (select |#memory_int| v_prenex_265) (+ v_prenex_264 (* v_prenex_266 4)))) (<= |elem_exists_#in~size| 2147483647) (< v_prenex_266 ~SIZE~0) (<= 0 ~SIZE~0) (<= 0 v_prenex_266) (<= 0 (+ |elem_exists_#in~size| 2147483648)) (<= 1 v_prenex_266)) (and (<= |elem_exists_#in~size| 1) (<= 1 ~SIZE~0) (< v_main_~v~0_BEFORE_CALL_374 ~SIZE~0) (<= |elem_exists_#in~size| 2147483647) (<= 1 v_main_~v~0_BEFORE_CALL_374) (<= 0 ~SIZE~0) (<= 0 (+ |elem_exists_#in~size| 2147483648)) (= |elem_exists_#in~value| (select (select |#memory_int| |v_main_~#values~0.base_BEFORE_CALL_264|) (+ |v_main_~#values~0.offset_BEFORE_CALL_264| (* v_main_~v~0_BEFORE_CALL_374 4))))) (and (<= 0 ~SIZE~0) (< 0 ~SIZE~0) (= (select (select |#memory_int| v_prenex_268) v_prenex_267) |elem_exists_#in~value|)))) (= elem_exists_~value |elem_exists_#in~value|)) [2019-10-13 21:37:56,236 INFO L193 IcfgInterpreter]: Reachable states at location L-1 satisfy 23#(and (<= ~SIZE~0 100000) (= 0 |#NULL.base|) (<= |#NULL.base| 0) (= 0 (select |#valid| 0)) (<= 0 |#NULL.base|) (= ~SIZE~0 100000) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (<= 100000 ~SIZE~0)) [2019-10-13 21:37:56,236 INFO L193 IcfgInterpreter]: Reachable states at location mainENTRY satisfy 33#(and (<= ~SIZE~0 100000) (= 0 |#NULL.base|) (<= |#NULL.base| 0) (<= 0 |#NULL.base|) (= ~SIZE~0 100000) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (= 0 (select |old(#valid)| 0)) (<= 100000 ~SIZE~0) (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |#NULL.offset| 0) (= |old(#length)| |#length|)) [2019-10-13 21:37:56,237 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION satisfy 2740#(and (exists ((|v_main_~#set~0.base_BEFORE_CALL_257| Int) (v_prenex_194 Int) (|v_main_~#set~0.offset_BEFORE_CALL_257| Int) (v_prenex_195 Int) (v_prenex_192 Int) (v_prenex_193 Int)) (or (and (= |__VERIFIER_assert_#in~cond| 0) (<= 0 (+ (select (select |#memory_int| v_prenex_194) v_prenex_195) 2147483648)) (<= (select (select |#memory_int| v_prenex_194) v_prenex_195) 2147483647) (< 1 ~SIZE~0)) (and (= |__VERIFIER_assert_#in~cond| 1) (< 1 ~SIZE~0) (<= (select (select |#memory_int| |v_main_~#set~0.base_BEFORE_CALL_257|) |v_main_~#set~0.offset_BEFORE_CALL_257|) 2147483646)) (and (= |__VERIFIER_assert_#in~cond| 1) (<= 0 (+ (select (select |#memory_int| v_prenex_192) v_prenex_193) 2147483647)) (< 1 ~SIZE~0)))) (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-13 21:37:56,237 INFO L193 IcfgInterpreter]: Reachable states at location L55-3 satisfy 1170#(and (= 1 main_~found~0) (<= main_~element~0 2147483647) (= main_~pos~0 main_~i~1) (<= 1 main_~found~0) (<= 0 main_~v~0) (<= main_~found~0 1) (<= 0 (+ main_~element~0 2147483648))) [2019-10-13 21:37:56,237 INFO L193 IcfgInterpreter]: Reachable states at location L46-4 satisfy 1492#(and (<= 0 main_~i~1) (<= main_~element~0 2147483647) (<= 0 main_~v~0) (<= 0 (+ main_~element~0 2147483648))) [2019-10-13 21:37:56,237 INFO L193 IcfgInterpreter]: Reachable states at location L53 satisfy 971#(and (= 1 main_~found~0) (<= main_~element~0 2147483647) (= main_~pos~0 main_~i~1) (not (< (+ main_~i~1 1) ~SIZE~0)) (<= 1 main_~found~0) (<= 0 main_~v~0) (<= main_~found~0 1) (<= 0 (+ main_~element~0 2147483648))) [2019-10-13 21:37:56,237 INFO L193 IcfgInterpreter]: Reachable states at location L46-3 satisfy 1946#(and (<= 0 main_~i~1) (<= main_~element~0 2147483647) (<= 0 main_~v~0) (<= 0 (+ main_~element~0 2147483648))) [2019-10-13 21:37:56,238 INFO L193 IcfgInterpreter]: Reachable states at location insertEXIT satisfy 2749#(and (= insert_~set.base |insert_#in~set.base|) (<= insert_~size 0) (<= |insert_#in~size| 0) (= |insert_#in~value| insert_~value) (= |insert_#in~set.offset| insert_~set.offset) (= |#memory_int| (store |old(#memory_int)| insert_~set.base (store (select |old(#memory_int)| insert_~set.base) (+ insert_~set.offset (* insert_~size 4)) insert_~value))) (<= 0 ~SIZE~0) (<= |insert_#res| 1) (= |insert_#res| (+ insert_~size 1)) (= |insert_#in~size| insert_~size)) [2019-10-13 21:37:56,238 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initENTRY satisfy 2753#(and (= |old(#NULL.base)| |#NULL.base|) (= |#valid| |old(#valid)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(~SIZE~0)| ~SIZE~0)) [2019-10-13 21:37:56,238 INFO L193 IcfgInterpreter]: Reachable states at location elem_existsENTRY satisfy 2762#(exists ((|v_main_~#values~0.offset_BEFORE_CALL_264| Int) (v_prenex_268 Int) (v_prenex_266 Int) (v_prenex_267 Int) (v_prenex_264 Int) (v_prenex_265 Int) (|v_main_~#values~0.base_BEFORE_CALL_264| Int) (v_main_~v~0_BEFORE_CALL_374 Int)) (or (and (<= v_prenex_266 0) (<= |elem_exists_#in~size| 1) (= |elem_exists_#in~value| (select (select |#memory_int| v_prenex_265) (+ v_prenex_264 (* v_prenex_266 4)))) (<= |elem_exists_#in~size| 2147483647) (< v_prenex_266 ~SIZE~0) (<= 0 ~SIZE~0) (<= 0 v_prenex_266) (<= 0 (+ |elem_exists_#in~size| 2147483648)) (<= 1 v_prenex_266)) (and (<= |elem_exists_#in~size| 1) (<= 1 ~SIZE~0) (< v_main_~v~0_BEFORE_CALL_374 ~SIZE~0) (<= |elem_exists_#in~size| 2147483647) (<= 1 v_main_~v~0_BEFORE_CALL_374) (<= 0 ~SIZE~0) (<= 0 (+ |elem_exists_#in~size| 2147483648)) (= |elem_exists_#in~value| (select (select |#memory_int| |v_main_~#values~0.base_BEFORE_CALL_264|) (+ |v_main_~#values~0.offset_BEFORE_CALL_264| (* v_main_~v~0_BEFORE_CALL_374 4))))) (and (<= 0 ~SIZE~0) (< 0 ~SIZE~0) (= (select (select |#memory_int| v_prenex_268) v_prenex_267) |elem_exists_#in~value|)))) [2019-10-13 21:37:56,238 INFO L193 IcfgInterpreter]: Reachable states at location L39-2 satisfy 2721#(and (or (and (<= main_~v~0 0) (not (< main_~i~1 ~SIZE~0)) (<= |main_#t~ret8| 2147483647) (= 0 |main_#t~ret8|) (= (select (select |#memory_int| |main_~#values~0.base|) (+ (* main_~v~0 4) |main_~#values~0.offset|)) |main_#t~mem7|) (= main_~v~0 0) (<= 0 (+ |main_#t~ret8| 2147483648)) (< main_~v~0 ~SIZE~0)) (and (= |main_#t~ret8| 0) (<= 0 (+ |main_#t~ret8| 2147483648)) (<= |main_#t~ret8| 2147483647))) (<= main_~n~0 0) (<= 0 |main_#t~ret8|) (<= |main_#t~ret8| 0) (<= 0 main_~i~1) (<= main_~element~0 2147483647) (<= 0 ~SIZE~0) (<= 0 main_~v~0) (<= 0 (+ main_~element~0 2147483648))) [2019-10-13 21:37:56,238 INFO L193 IcfgInterpreter]: Reachable states at location L30-3 satisfy 72#true [2019-10-13 21:37:56,239 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initEXIT satisfy 2758#(and (= |#valid| (store |old(#valid)| 0 0)) (<= ~SIZE~0 100000) (= 0 |#NULL.base|) (<= |#NULL.base| 0) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (= ~SIZE~0 100000) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (<= 100000 ~SIZE~0)) [2019-10-13 21:37:56,239 INFO L193 IcfgInterpreter]: Reachable states at location L39-1 satisfy 2708#(and (<= main_~n~0 0) (= |main_#t~ret8| 0) (<= 0 |main_#t~ret8|) (<= |main_#t~ret8| 0) (<= 0 main_~i~1) (<= main_~element~0 2147483647) (<= 0 ~SIZE~0) (<= 0 main_~v~0) (<= 0 (+ main_~element~0 2147483648))) [2019-10-13 21:37:56,239 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.startENTRY satisfy 6#true [2019-10-13 21:37:56,239 INFO L193 IcfgInterpreter]: Reachable states at location L63-3 satisfy 787#(and (<= main_~i~1 0) (= 1 main_~found~0) (<= main_~element~0 2147483647) (<= 0 main_~i~1) (<= ~SIZE~0 (+ main_~pos~0 1)) (<= 1 main_~found~0) (<= 0 main_~v~0) (= main_~i~1 0) (<= main_~found~0 1) (<= 0 (+ main_~element~0 2147483648))) [2019-10-13 21:37:56,239 INFO L193 IcfgInterpreter]: Reachable states at location L39 satisfy 2083#(and (<= 0 main_~i~1) (<= main_~element~0 2147483647) (<= 0 ~SIZE~0) (<= 0 main_~v~0) (<= 0 (+ main_~element~0 2147483648))) [2019-10-13 21:37:56,240 INFO L193 IcfgInterpreter]: Reachable states at location insertENTRY satisfy 2744#(and (<= |insert_#in~size| 0) (<= 0 ~SIZE~0) (= |#memory_int| |old(#memory_int)|)) [2019-10-13 21:37:56,240 INFO L193 IcfgInterpreter]: Reachable states at location elem_existsEXIT satisfy 2777#(and (<= |elem_exists_#res| 0) (<= elem_exists_~size 0) (= elem_exists_~size |elem_exists_#in~size|) (not (< elem_exists_~i~0 elem_exists_~size)) (= elem_exists_~set.base |elem_exists_#in~set.base|) (exists ((|v_main_~#values~0.offset_BEFORE_CALL_264| Int) (v_prenex_268 Int) (v_prenex_266 Int) (v_prenex_267 Int) (v_prenex_264 Int) (v_prenex_265 Int) (|v_main_~#values~0.base_BEFORE_CALL_264| Int) (v_main_~v~0_BEFORE_CALL_374 Int)) (or (and (<= v_prenex_266 0) (<= |elem_exists_#in~size| 1) (= |elem_exists_#in~value| (select (select |#memory_int| v_prenex_265) (+ v_prenex_264 (* v_prenex_266 4)))) (<= |elem_exists_#in~size| 2147483647) (< v_prenex_266 ~SIZE~0) (<= 0 ~SIZE~0) (<= 0 v_prenex_266) (<= 0 (+ |elem_exists_#in~size| 2147483648)) (<= 1 v_prenex_266)) (and (<= |elem_exists_#in~size| 1) (<= 1 ~SIZE~0) (< v_main_~v~0_BEFORE_CALL_374 ~SIZE~0) (<= |elem_exists_#in~size| 2147483647) (<= 1 v_main_~v~0_BEFORE_CALL_374) (<= 0 ~SIZE~0) (<= 0 (+ |elem_exists_#in~size| 2147483648)) (= |elem_exists_#in~value| (select (select |#memory_int| |v_main_~#values~0.base_BEFORE_CALL_264|) (+ |v_main_~#values~0.offset_BEFORE_CALL_264| (* v_main_~v~0_BEFORE_CALL_374 4))))) (and (<= 0 ~SIZE~0) (< 0 ~SIZE~0) (= (select (select |#memory_int| v_prenex_268) v_prenex_267) |elem_exists_#in~value|)))) (= elem_exists_~value |elem_exists_#in~value|) (= |elem_exists_#in~set.offset| elem_exists_~set.offset) (<= |elem_exists_#in~size| 0) (= |elem_exists_#res| 0) (<= 0 elem_exists_~i~0) (<= elem_exists_~i~0 0) (= elem_exists_~i~0 0) (<= 0 |elem_exists_#res|)) [2019-10-13 21:37:56,240 INFO L193 IcfgInterpreter]: Reachable states at location L41-1 satisfy 2561#(and (or (and (<= main_~n~0 0) (= (+ main_~n~0 1) |main_#t~ret10|) (= (select (select |#memory_int| |main_~#set~0.base|) (+ |main_~#set~0.offset| (* main_~n~0 4))) |main_#t~mem9|)) (and (<= main_~n~0 0) (= (+ main_~n~0 1) |main_#t~ret10|) (= (select (select |#memory_int| |main_~#set~0.base|) (+ |main_~#set~0.offset| (* |main_#t~ret10| 4) (- 4))) |main_#t~mem9|))) (<= 0 main_~i~1) (<= main_~element~0 2147483647) (<= 0 ~SIZE~0) (<= 0 main_~v~0) (<= |main_#t~ret10| 1) (<= 0 (+ main_~element~0 2147483648))) [2019-10-13 21:37:56,241 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertENTRY satisfy 2725#(exists ((|v_main_~#set~0.base_BEFORE_CALL_257| Int) (v_prenex_194 Int) (|v_main_~#set~0.offset_BEFORE_CALL_257| Int) (v_prenex_195 Int) (v_prenex_192 Int) (v_prenex_193 Int)) (or (and (= |__VERIFIER_assert_#in~cond| 0) (<= 0 (+ (select (select |#memory_int| v_prenex_194) v_prenex_195) 2147483648)) (<= (select (select |#memory_int| v_prenex_194) v_prenex_195) 2147483647) (< 1 ~SIZE~0)) (and (= |__VERIFIER_assert_#in~cond| 1) (< 1 ~SIZE~0) (<= (select (select |#memory_int| |v_main_~#set~0.base_BEFORE_CALL_257|) |v_main_~#set~0.offset_BEFORE_CALL_257|) 2147483646)) (and (= |__VERIFIER_assert_#in~cond| 1) (<= 0 (+ (select (select |#memory_int| v_prenex_192) v_prenex_193) 2147483647)) (< 1 ~SIZE~0)))) [2019-10-13 21:37:56,241 INFO L193 IcfgInterpreter]: Reachable states at location L41 satisfy 2665#(and (<= main_~n~0 0) (<= 0 main_~i~1) (<= main_~element~0 2147483647) (<= 0 ~SIZE~0) (<= 0 main_~v~0) (<= 0 (+ main_~element~0 2147483648)))