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-examples/standard_copy9_ground-1.i -------------------------------------------------------------------------------- This is Ultimate 0.1.24-36ac518-m [2019-10-06 23:43:25,229 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-06 23:43:25,231 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-06 23:43:25,252 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-06 23:43:25,252 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-06 23:43:25,255 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-06 23:43:25,257 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-06 23:43:25,267 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-06 23:43:25,273 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-06 23:43:25,276 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-06 23:43:25,277 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-06 23:43:25,279 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-06 23:43:25,279 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-06 23:43:25,281 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-06 23:43:25,284 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-06 23:43:25,286 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-06 23:43:25,288 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-06 23:43:25,289 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-06 23:43:25,290 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-06 23:43:25,296 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-06 23:43:25,300 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-06 23:43:25,303 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-06 23:43:25,306 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-06 23:43:25,307 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-06 23:43:25,310 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-06 23:43:25,310 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-06 23:43:25,310 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-06 23:43:25,312 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-06 23:43:25,313 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-06 23:43:25,314 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-06 23:43:25,315 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-06 23:43:25,316 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-06 23:43:25,317 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-06 23:43:25,318 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-06 23:43:25,320 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-06 23:43:25,320 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-06 23:43:25,321 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-06 23:43:25,321 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-06 23:43:25,321 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-06 23:43:25,322 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-06 23:43:25,324 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-06 23:43:25,325 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-06 23:43:25,358 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-06 23:43:25,359 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-06 23:43:25,360 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-06 23:43:25,360 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-06 23:43:25,361 INFO L138 SettingsManager]: * Use SBE=true [2019-10-06 23:43:25,361 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-06 23:43:25,361 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-06 23:43:25,361 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-06 23:43:25,361 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-06 23:43:25,362 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-06 23:43:25,362 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-06 23:43:25,362 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-06 23:43:25,362 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-06 23:43:25,363 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-06 23:43:25,363 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-06 23:43:25,363 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-06 23:43:25,363 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-06 23:43:25,364 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-06 23:43:25,364 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-06 23:43:25,364 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-06 23:43:25,364 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-06 23:43:25,364 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-06 23:43:25,365 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-06 23:43:25,365 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-06 23:43:25,365 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-06 23:43:25,365 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-06 23:43:25,365 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-06 23:43:25,366 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-06 23:43:25,366 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-06 23:43:25,706 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-06 23:43:25,730 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-06 23:43:25,737 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-06 23:43:25,738 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-06 23:43:25,739 INFO L275 PluginConnector]: CDTParser initialized [2019-10-06 23:43:25,740 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-examples/standard_copy9_ground-1.i [2019-10-06 23:43:25,816 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/79b970cb1/be07c9af2a1145b0b6b5666f5b3d8834/FLAGeaa0d1b07 [2019-10-06 23:43:26,272 INFO L306 CDTParser]: Found 1 translation units. [2019-10-06 23:43:26,273 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/array-examples/standard_copy9_ground-1.i [2019-10-06 23:43:26,279 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/79b970cb1/be07c9af2a1145b0b6b5666f5b3d8834/FLAGeaa0d1b07 [2019-10-06 23:43:26,652 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/79b970cb1/be07c9af2a1145b0b6b5666f5b3d8834 [2019-10-06 23:43:26,663 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-06 23:43:26,665 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-06 23:43:26,666 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-06 23:43:26,666 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-06 23:43:26,671 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-06 23:43:26,672 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.10 11:43:26" (1/1) ... [2019-10-06 23:43:26,675 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5611840f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.10 11:43:26, skipping insertion in model container [2019-10-06 23:43:26,676 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.10 11:43:26" (1/1) ... [2019-10-06 23:43:26,684 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-06 23:43:26,704 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-06 23:43:26,976 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-06 23:43:26,981 INFO L188 MainTranslator]: Completed pre-run [2019-10-06 23:43:27,013 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-06 23:43:27,128 INFO L192 MainTranslator]: Completed translation [2019-10-06 23:43:27,129 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.10 11:43:27 WrapperNode [2019-10-06 23:43:27,129 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-06 23:43:27,129 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-06 23:43:27,130 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-06 23:43:27,130 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-06 23:43:27,143 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.10 11:43:27" (1/1) ... [2019-10-06 23:43:27,143 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.10 11:43:27" (1/1) ... [2019-10-06 23:43:27,169 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.10 11:43:27" (1/1) ... [2019-10-06 23:43:27,169 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.10 11:43:27" (1/1) ... [2019-10-06 23:43:27,200 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.10 11:43:27" (1/1) ... [2019-10-06 23:43:27,215 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.10 11:43:27" (1/1) ... [2019-10-06 23:43:27,219 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.10 11:43:27" (1/1) ... [2019-10-06 23:43:27,224 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-06 23:43:27,225 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-06 23:43:27,226 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-06 23:43:27,226 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-06 23:43:27,228 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.10 11:43:27" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-06 23:43:27,297 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-06 23:43:27,297 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-06 23:43:27,297 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2019-10-06 23:43:27,298 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-06 23:43:27,299 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-06 23:43:27,300 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2019-10-06 23:43:27,301 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-10-06 23:43:27,301 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-06 23:43:27,301 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-10-06 23:43:27,302 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-10-06 23:43:27,302 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-10-06 23:43:27,303 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-10-06 23:43:27,303 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-06 23:43:27,303 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-06 23:43:27,978 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-06 23:43:27,978 INFO L284 CfgBuilder]: Removed 11 assume(true) statements. [2019-10-06 23:43:27,979 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.10 11:43:27 BoogieIcfgContainer [2019-10-06 23:43:27,980 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-06 23:43:27,981 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-06 23:43:27,982 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-06 23:43:27,985 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-06 23:43:27,986 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.10 11:43:26" (1/3) ... [2019-10-06 23:43:27,987 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@26ea354 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.10 11:43:27, skipping insertion in model container [2019-10-06 23:43:27,987 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.10 11:43:27" (2/3) ... [2019-10-06 23:43:27,987 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@26ea354 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.10 11:43:27, skipping insertion in model container [2019-10-06 23:43:27,988 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.10 11:43:27" (3/3) ... [2019-10-06 23:43:27,989 INFO L109 eAbstractionObserver]: Analyzing ICFG standard_copy9_ground-1.i [2019-10-06 23:43:28,000 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-06 23:43:28,009 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-06 23:43:28,021 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-06 23:43:28,049 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-10-06 23:43:28,049 INFO L374 AbstractCegarLoop]: Hoare is true [2019-10-06 23:43:28,049 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-06 23:43:28,050 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-06 23:43:28,050 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-06 23:43:28,050 INFO L378 AbstractCegarLoop]: Difference is false [2019-10-06 23:43:28,050 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-06 23:43:28,051 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-06 23:43:28,070 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states. [2019-10-06 23:43:28,077 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-10-06 23:43:28,078 INFO L377 BasicCegarLoop]: Found error trace [2019-10-06 23:43:28,079 INFO L385 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-06 23:43:28,081 INFO L410 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-06 23:43:28,087 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-06 23:43:28,088 INFO L82 PathProgramCache]: Analyzing trace with hash 943724403, now seen corresponding path program 1 times [2019-10-06 23:43:28,098 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-06 23:43:28,099 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-06 23:43:28,099 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-06 23:43:28,099 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-06 23:43:28,100 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-06 23:43:28,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-06 23:43:28,307 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-06 23:43:28,307 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-06 23:43:28,308 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-06 23:43:28,309 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-06 23:43:28,313 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-06 23:43:28,328 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-06 23:43:28,329 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-06 23:43:28,332 INFO L87 Difference]: Start difference. First operand 27 states. Second operand 3 states. [2019-10-06 23:43:28,374 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-06 23:43:28,374 INFO L93 Difference]: Finished difference Result 49 states and 72 transitions. [2019-10-06 23:43:28,375 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-06 23:43:28,377 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2019-10-06 23:43:28,377 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-06 23:43:28,388 INFO L225 Difference]: With dead ends: 49 [2019-10-06 23:43:28,388 INFO L226 Difference]: Without dead ends: 25 [2019-10-06 23:43:28,392 INFO L606 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-06 23:43:28,415 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2019-10-06 23:43:28,435 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2019-10-06 23:43:28,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2019-10-06 23:43:28,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 35 transitions. [2019-10-06 23:43:28,440 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 35 transitions. Word has length 20 [2019-10-06 23:43:28,440 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-06 23:43:28,441 INFO L462 AbstractCegarLoop]: Abstraction has 25 states and 35 transitions. [2019-10-06 23:43:28,441 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-06 23:43:28,441 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 35 transitions. [2019-10-06 23:43:28,442 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-10-06 23:43:28,442 INFO L377 BasicCegarLoop]: Found error trace [2019-10-06 23:43:28,442 INFO L385 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-06 23:43:28,443 INFO L410 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-06 23:43:28,443 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-06 23:43:28,443 INFO L82 PathProgramCache]: Analyzing trace with hash 1563711792, now seen corresponding path program 1 times [2019-10-06 23:43:28,444 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-06 23:43:28,444 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-06 23:43:28,444 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-06 23:43:28,444 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-06 23:43:28,445 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-06 23:43:28,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-06 23:43:28,532 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-06 23:43:28,534 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-06 23:43:28,535 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-06 23:43:28,535 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-06 23:43:28,537 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-06 23:43:28,537 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-06 23:43:28,539 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-06 23:43:28,540 INFO L87 Difference]: Start difference. First operand 25 states and 35 transitions. Second operand 3 states. [2019-10-06 23:43:28,636 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-06 23:43:28,636 INFO L93 Difference]: Finished difference Result 51 states and 78 transitions. [2019-10-06 23:43:28,638 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-06 23:43:28,639 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2019-10-06 23:43:28,639 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-06 23:43:28,640 INFO L225 Difference]: With dead ends: 51 [2019-10-06 23:43:28,641 INFO L226 Difference]: Without dead ends: 34 [2019-10-06 23:43:28,642 INFO L606 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-06 23:43:28,643 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2019-10-06 23:43:28,659 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2019-10-06 23:43:28,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2019-10-06 23:43:28,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 44 transitions. [2019-10-06 23:43:28,662 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 44 transitions. Word has length 21 [2019-10-06 23:43:28,662 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-06 23:43:28,663 INFO L462 AbstractCegarLoop]: Abstraction has 34 states and 44 transitions. [2019-10-06 23:43:28,663 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-06 23:43:28,664 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 44 transitions. [2019-10-06 23:43:28,666 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-10-06 23:43:28,667 INFO L377 BasicCegarLoop]: Found error trace [2019-10-06 23:43:28,667 INFO L385 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-06 23:43:28,668 INFO L410 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-06 23:43:28,668 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-06 23:43:28,668 INFO L82 PathProgramCache]: Analyzing trace with hash -168556700, now seen corresponding path program 1 times [2019-10-06 23:43:28,669 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-06 23:43:28,669 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-06 23:43:28,670 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-06 23:43:28,670 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-06 23:43:28,671 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-06 23:43:28,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-06 23:43:28,824 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2019-10-06 23:43:28,825 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-06 23:43:28,825 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2019-10-06 23:43:28,825 INFO L95 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-06 23:43:28,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-06 23:43:28,944 INFO L256 TraceCheckSpWp]: Trace formula consists of 178 conjuncts, 3 conjunts are in the unsatisfiable core [2019-10-06 23:43:28,951 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-06 23:43:28,999 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2019-10-06 23:43:29,000 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-06 23:43:29,043 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2019-10-06 23:43:29,044 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2019-10-06 23:43:29,106 INFO L162 IcfgInterpreter]: Started Sifa with 21 locations of interest [2019-10-06 23:43:29,106 INFO L169 IcfgInterpreter]: Building call graph [2019-10-06 23:43:29,117 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-06 23:43:29,123 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-06 23:43:29,124 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-06 23:43:29,275 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 21 for LOIs [2019-10-06 23:43:29,833 WARN L191 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 41 [2019-10-06 23:43:30,212 WARN L191 SmtUtils]: Spent 154.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 41 [2019-10-06 23:43:30,504 WARN L191 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 41 [2019-10-06 23:43:30,792 WARN L191 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 41 [2019-10-06 23:43:31,054 WARN L191 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 38 [2019-10-06 23:43:32,104 INFO L199 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 29 for LOIs [2019-10-06 23:43:32,118 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 10 for LOIs [2019-10-06 23:43:32,127 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-06 23:43:32,128 INFO L191 IcfgInterpreter]: Final predicates for locations of interest are: [2019-10-06 23:43:32,128 INFO L193 IcfgInterpreter]: Reachable states at location L2 satisfy 479#(and (exists ((|v_main_~#a0~0.offset_BEFORE_CALL_1| Int) (v_prenex_4 Int) (|v_main_~#a1~0.base_BEFORE_CALL_1| Int) (|v_main_~#a1~0.offset_BEFORE_CALL_1| Int) (v_prenex_2 Int) (v_prenex_3 Int) (v_prenex_1 Int) (|v_main_~#a0~0.base_BEFORE_CALL_1| Int)) (or (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| v_prenex_2) v_prenex_3) (select (select |#memory_int| v_prenex_4) v_prenex_1))) (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| |v_main_~#a1~0.base_BEFORE_CALL_1|) |v_main_~#a1~0.offset_BEFORE_CALL_1|) (select (select |#memory_int| |v_main_~#a0~0.base_BEFORE_CALL_1|) |v_main_~#a0~0.offset_BEFORE_CALL_1|)))))) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-06 23:43:32,129 INFO L193 IcfgInterpreter]: Reachable states at location L36-3 satisfy 330#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-06 23:43:32,130 INFO L193 IcfgInterpreter]: Reachable states at location L2-1 satisfy 484#(and (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (exists ((|v_main_~#a0~0.offset_BEFORE_CALL_1| Int) (v_prenex_4 Int) (|v_main_~#a1~0.base_BEFORE_CALL_1| Int) (|v_main_~#a1~0.offset_BEFORE_CALL_1| Int) (v_prenex_2 Int) (v_prenex_3 Int) (v_prenex_1 Int) (|v_main_~#a0~0.base_BEFORE_CALL_1| Int)) (or (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| v_prenex_2) v_prenex_3) (select (select |#memory_int| v_prenex_4) v_prenex_1))) (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| |v_main_~#a1~0.base_BEFORE_CALL_1|) |v_main_~#a1~0.offset_BEFORE_CALL_1|) (select (select |#memory_int| |v_main_~#a0~0.base_BEFORE_CALL_1|) |v_main_~#a0~0.offset_BEFORE_CALL_1|)))))) (<= 0 __VERIFIER_assert_~cond) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-06 23:43:32,130 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initENTRY satisfy 493#(and (= |old(#NULL.base)| |#NULL.base|) (= |#valid| |old(#valid)|) (= |#NULL.offset| |old(#NULL.offset)|)) [2019-10-06 23:43:32,130 INFO L193 IcfgInterpreter]: Reachable states at location L16-3 satisfy 72#true [2019-10-06 23:43:32,130 INFO L193 IcfgInterpreter]: Reachable states at location L27-3 satisfy 201#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-06 23:43:32,131 INFO L193 IcfgInterpreter]: Reachable states at location L49-3 satisfy 464#(and (<= 100000 main_~a~0) (<= 0 main_~i~0) (= main_~x~0 0) (<= 100000 main_~i~0) (not (< main_~i~0 100000)) (<= main_~x~0 0) (<= 0 main_~x~0)) [2019-10-06 23:43:32,131 INFO L193 IcfgInterpreter]: Reachable states at location L39-3 satisfy 373#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-06 23:43:32,132 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION satisfy 489#(and (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (exists ((|v_main_~#a0~0.offset_BEFORE_CALL_1| Int) (v_prenex_4 Int) (|v_main_~#a1~0.base_BEFORE_CALL_1| Int) (|v_main_~#a1~0.offset_BEFORE_CALL_1| Int) (v_prenex_2 Int) (v_prenex_3 Int) (v_prenex_1 Int) (|v_main_~#a0~0.base_BEFORE_CALL_1| Int)) (or (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| v_prenex_2) v_prenex_3) (select (select |#memory_int| v_prenex_4) v_prenex_1))) (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| |v_main_~#a1~0.base_BEFORE_CALL_1|) |v_main_~#a1~0.offset_BEFORE_CALL_1|) (select (select |#memory_int| |v_main_~#a0~0.base_BEFORE_CALL_1|) |v_main_~#a0~0.offset_BEFORE_CALL_1|)))))) (<= 0 __VERIFIER_assert_~cond) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-06 23:43:32,132 INFO L193 IcfgInterpreter]: Reachable states at location L-1 satisfy 23#(and (= 0 |#NULL.base|) (<= |#NULL.base| 0) (= 0 (select |#valid| 0)) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-06 23:43:32,132 INFO L193 IcfgInterpreter]: Reachable states at location mainENTRY satisfy 33#(and (= 0 |#NULL.base|) (<= |#NULL.base| 0) (= |#valid| |old(#valid)|) (<= 0 |#NULL.base|) (= |#memory_int| |old(#memory_int)|) (= |#NULL.offset| 0) (= |old(#length)| |#length|) (= 0 (select |old(#valid)| 0)) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-06 23:43:32,132 INFO L193 IcfgInterpreter]: Reachable states at location L30-3 satisfy 244#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-06 23:43:32,133 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initEXIT satisfy 498#(and (= |#valid| (store |old(#valid)| 0 0)) (= 0 |#NULL.base|) (<= |#NULL.base| 0) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-06 23:43:32,133 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.startENTRY satisfy 6#true [2019-10-06 23:43:32,133 INFO L193 IcfgInterpreter]: Reachable states at location L42-3 satisfy 416#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-06 23:43:32,133 INFO L193 IcfgInterpreter]: Reachable states at location L21-3 satisfy 115#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-06 23:43:32,134 INFO L193 IcfgInterpreter]: Reachable states at location L50 satisfy 469#(and (<= 100000 main_~a~0) (< main_~x~0 100000) (= |main_#t~mem23| (select (select |#memory_int| |main_~#a0~0.base|) (+ (* 4 main_~x~0) |main_~#a0~0.offset|))) (<= 0 main_~i~0) (= main_~x~0 0) (<= 100000 main_~i~0) (= |main_#t~mem22| (select (select |#memory_int| |main_~#a1~0.base|) (+ (* 4 main_~x~0) |main_~#a1~0.offset|))) (not (< main_~i~0 100000)) (<= main_~x~0 0) (<= 0 main_~x~0)) [2019-10-06 23:43:32,134 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertENTRY satisfy 474#(exists ((|v_main_~#a0~0.offset_BEFORE_CALL_1| Int) (v_prenex_4 Int) (|v_main_~#a1~0.base_BEFORE_CALL_1| Int) (|v_main_~#a1~0.offset_BEFORE_CALL_1| Int) (v_prenex_2 Int) (v_prenex_3 Int) (v_prenex_1 Int) (|v_main_~#a0~0.base_BEFORE_CALL_1| Int)) (or (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| v_prenex_2) v_prenex_3) (select (select |#memory_int| v_prenex_4) v_prenex_1))) (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| |v_main_~#a1~0.base_BEFORE_CALL_1|) |v_main_~#a1~0.offset_BEFORE_CALL_1|) (select (select |#memory_int| |v_main_~#a0~0.base_BEFORE_CALL_1|) |v_main_~#a0~0.offset_BEFORE_CALL_1|)))))) [2019-10-06 23:43:32,134 INFO L193 IcfgInterpreter]: Reachable states at location L33-3 satisfy 287#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-06 23:43:32,134 INFO L193 IcfgInterpreter]: Reachable states at location L45-3 satisfy 459#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-06 23:43:32,135 INFO L193 IcfgInterpreter]: Reachable states at location L24-3 satisfy 158#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-06 23:43:32,428 INFO L211 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-06 23:43:32,429 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4, 10] total 17 [2019-10-06 23:43:32,430 INFO L442 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-10-06 23:43:32,431 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-10-06 23:43:32,432 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=225, Unknown=0, NotChecked=0, Total=272 [2019-10-06 23:43:32,432 INFO L87 Difference]: Start difference. First operand 34 states and 44 transitions. Second operand 17 states. [2019-10-06 23:43:33,127 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-06 23:43:33,127 INFO L93 Difference]: Finished difference Result 76 states and 108 transitions. [2019-10-06 23:43:33,128 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-10-06 23:43:33,128 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 30 [2019-10-06 23:43:33,128 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-06 23:43:33,131 INFO L225 Difference]: With dead ends: 76 [2019-10-06 23:43:33,131 INFO L226 Difference]: Without dead ends: 49 [2019-10-06 23:43:33,134 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 78 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 144 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=115, Invalid=587, Unknown=0, NotChecked=0, Total=702 [2019-10-06 23:43:33,137 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2019-10-06 23:43:33,159 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 46. [2019-10-06 23:43:33,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2019-10-06 23:43:33,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 56 transitions. [2019-10-06 23:43:33,167 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 56 transitions. Word has length 30 [2019-10-06 23:43:33,167 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-06 23:43:33,167 INFO L462 AbstractCegarLoop]: Abstraction has 46 states and 56 transitions. [2019-10-06 23:43:33,167 INFO L463 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-10-06 23:43:33,167 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 56 transitions. [2019-10-06 23:43:33,171 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-10-06 23:43:33,172 INFO L377 BasicCegarLoop]: Found error trace [2019-10-06 23:43:33,172 INFO L385 BasicCegarLoop]: trace histogram [4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-06 23:43:33,373 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-06 23:43:33,373 INFO L410 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-06 23:43:33,374 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-06 23:43:33,374 INFO L82 PathProgramCache]: Analyzing trace with hash 1772657331, now seen corresponding path program 2 times [2019-10-06 23:43:33,375 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-06 23:43:33,375 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-06 23:43:33,376 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-06 23:43:33,376 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-06 23:43:33,376 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-06 23:43:33,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-06 23:43:33,545 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2019-10-06 23:43:33,545 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-06 23:43:33,546 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2019-10-06 23:43:33,546 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 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-06 23:43:33,647 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2019-10-06 23:43:33,649 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-06 23:43:33,651 INFO L256 TraceCheckSpWp]: Trace formula consists of 222 conjuncts, 4 conjunts are in the unsatisfiable core [2019-10-06 23:43:33,657 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-06 23:43:33,672 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2019-10-06 23:43:33,673 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-06 23:43:33,714 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2019-10-06 23:43:33,715 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2019-10-06 23:43:33,717 INFO L162 IcfgInterpreter]: Started Sifa with 21 locations of interest [2019-10-06 23:43:33,717 INFO L169 IcfgInterpreter]: Building call graph [2019-10-06 23:43:33,718 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-06 23:43:33,719 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-06 23:43:33,719 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-06 23:43:33,774 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 21 for LOIs [2019-10-06 23:43:35,853 INFO L199 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 29 for LOIs [2019-10-06 23:43:35,861 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 10 for LOIs [2019-10-06 23:43:35,864 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-06 23:43:35,864 INFO L191 IcfgInterpreter]: Final predicates for locations of interest are: [2019-10-06 23:43:35,865 INFO L193 IcfgInterpreter]: Reachable states at location L2 satisfy 479#(and (exists ((v_prenex_6 Int) (v_prenex_7 Int) (|v_main_~#a1~0.base_BEFORE_CALL_2| Int) (|v_main_~#a1~0.offset_BEFORE_CALL_2| Int) (v_prenex_5 Int) (|v_main_~#a0~0.base_BEFORE_CALL_2| Int) (|v_main_~#a0~0.offset_BEFORE_CALL_2| Int) (v_prenex_8 Int)) (or (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| |v_main_~#a1~0.base_BEFORE_CALL_2|) |v_main_~#a1~0.offset_BEFORE_CALL_2|) (select (select |#memory_int| |v_main_~#a0~0.base_BEFORE_CALL_2|) |v_main_~#a0~0.offset_BEFORE_CALL_2|))) (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| v_prenex_5) v_prenex_6) (select (select |#memory_int| v_prenex_7) v_prenex_8)))))) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-06 23:43:35,865 INFO L193 IcfgInterpreter]: Reachable states at location L36-3 satisfy 330#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-06 23:43:35,865 INFO L193 IcfgInterpreter]: Reachable states at location L2-1 satisfy 484#(and (<= __VERIFIER_assert_~cond 0) (exists ((v_prenex_6 Int) (v_prenex_7 Int) (|v_main_~#a1~0.base_BEFORE_CALL_2| Int) (|v_main_~#a1~0.offset_BEFORE_CALL_2| Int) (v_prenex_5 Int) (|v_main_~#a0~0.base_BEFORE_CALL_2| Int) (|v_main_~#a0~0.offset_BEFORE_CALL_2| Int) (v_prenex_8 Int)) (or (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| |v_main_~#a1~0.base_BEFORE_CALL_2|) |v_main_~#a1~0.offset_BEFORE_CALL_2|) (select (select |#memory_int| |v_main_~#a0~0.base_BEFORE_CALL_2|) |v_main_~#a0~0.offset_BEFORE_CALL_2|))) (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| v_prenex_5) v_prenex_6) (select (select |#memory_int| v_prenex_7) v_prenex_8)))))) (<= 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-06 23:43:35,865 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initENTRY satisfy 493#(and (= |old(#NULL.base)| |#NULL.base|) (= |#valid| |old(#valid)|) (= |#NULL.offset| |old(#NULL.offset)|)) [2019-10-06 23:43:35,866 INFO L193 IcfgInterpreter]: Reachable states at location L16-3 satisfy 72#true [2019-10-06 23:43:35,866 INFO L193 IcfgInterpreter]: Reachable states at location L27-3 satisfy 201#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-06 23:43:35,866 INFO L193 IcfgInterpreter]: Reachable states at location L49-3 satisfy 464#(and (<= 100000 main_~a~0) (<= 0 main_~i~0) (= main_~x~0 0) (<= 100000 main_~i~0) (not (< main_~i~0 100000)) (<= main_~x~0 0) (<= 0 main_~x~0)) [2019-10-06 23:43:35,866 INFO L193 IcfgInterpreter]: Reachable states at location L39-3 satisfy 373#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-06 23:43:35,866 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION satisfy 489#(and (<= __VERIFIER_assert_~cond 0) (exists ((v_prenex_6 Int) (v_prenex_7 Int) (|v_main_~#a1~0.base_BEFORE_CALL_2| Int) (|v_main_~#a1~0.offset_BEFORE_CALL_2| Int) (v_prenex_5 Int) (|v_main_~#a0~0.base_BEFORE_CALL_2| Int) (|v_main_~#a0~0.offset_BEFORE_CALL_2| Int) (v_prenex_8 Int)) (or (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| |v_main_~#a1~0.base_BEFORE_CALL_2|) |v_main_~#a1~0.offset_BEFORE_CALL_2|) (select (select |#memory_int| |v_main_~#a0~0.base_BEFORE_CALL_2|) |v_main_~#a0~0.offset_BEFORE_CALL_2|))) (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| v_prenex_5) v_prenex_6) (select (select |#memory_int| v_prenex_7) v_prenex_8)))))) (<= 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-06 23:43:35,867 INFO L193 IcfgInterpreter]: Reachable states at location L-1 satisfy 23#(and (= 0 |#NULL.base|) (<= |#NULL.base| 0) (= 0 (select |#valid| 0)) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-06 23:43:35,867 INFO L193 IcfgInterpreter]: Reachable states at location mainENTRY satisfy 33#(and (= 0 |#NULL.base|) (<= |#NULL.base| 0) (= |#valid| |old(#valid)|) (<= 0 |#NULL.base|) (= |#memory_int| |old(#memory_int)|) (= |#NULL.offset| 0) (= |old(#length)| |#length|) (= 0 (select |old(#valid)| 0)) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-06 23:43:35,867 INFO L193 IcfgInterpreter]: Reachable states at location L30-3 satisfy 244#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-06 23:43:35,867 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initEXIT satisfy 498#(and (= |#valid| (store |old(#valid)| 0 0)) (= 0 |#NULL.base|) (<= |#NULL.base| 0) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-06 23:43:35,867 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.startENTRY satisfy 6#true [2019-10-06 23:43:35,868 INFO L193 IcfgInterpreter]: Reachable states at location L42-3 satisfy 416#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-06 23:43:35,868 INFO L193 IcfgInterpreter]: Reachable states at location L21-3 satisfy 115#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-06 23:43:35,868 INFO L193 IcfgInterpreter]: Reachable states at location L50 satisfy 469#(and (<= 100000 main_~a~0) (< main_~x~0 100000) (= |main_#t~mem23| (select (select |#memory_int| |main_~#a0~0.base|) (+ (* 4 main_~x~0) |main_~#a0~0.offset|))) (<= 0 main_~i~0) (= main_~x~0 0) (<= 100000 main_~i~0) (= |main_#t~mem22| (select (select |#memory_int| |main_~#a1~0.base|) (+ (* 4 main_~x~0) |main_~#a1~0.offset|))) (not (< main_~i~0 100000)) (<= main_~x~0 0) (<= 0 main_~x~0)) [2019-10-06 23:43:35,868 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertENTRY satisfy 474#(exists ((v_prenex_6 Int) (v_prenex_7 Int) (|v_main_~#a1~0.base_BEFORE_CALL_2| Int) (|v_main_~#a1~0.offset_BEFORE_CALL_2| Int) (v_prenex_5 Int) (|v_main_~#a0~0.base_BEFORE_CALL_2| Int) (|v_main_~#a0~0.offset_BEFORE_CALL_2| Int) (v_prenex_8 Int)) (or (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| |v_main_~#a1~0.base_BEFORE_CALL_2|) |v_main_~#a1~0.offset_BEFORE_CALL_2|) (select (select |#memory_int| |v_main_~#a0~0.base_BEFORE_CALL_2|) |v_main_~#a0~0.offset_BEFORE_CALL_2|))) (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| v_prenex_5) v_prenex_6) (select (select |#memory_int| v_prenex_7) v_prenex_8)))))) [2019-10-06 23:43:35,868 INFO L193 IcfgInterpreter]: Reachable states at location L33-3 satisfy 287#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-06 23:43:35,869 INFO L193 IcfgInterpreter]: Reachable states at location L45-3 satisfy 459#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-06 23:43:35,869 INFO L193 IcfgInterpreter]: Reachable states at location L24-3 satisfy 158#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-06 23:43:36,132 INFO L211 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-06 23:43:36,133 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5, 11] total 19 [2019-10-06 23:43:36,134 INFO L442 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-10-06 23:43:36,135 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-10-06 23:43:36,137 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=277, Unknown=0, NotChecked=0, Total=342 [2019-10-06 23:43:36,137 INFO L87 Difference]: Start difference. First operand 46 states and 56 transitions. Second operand 19 states. [2019-10-06 23:43:37,172 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-06 23:43:37,172 INFO L93 Difference]: Finished difference Result 124 states and 178 transitions. [2019-10-06 23:43:37,173 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-10-06 23:43:37,173 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 42 [2019-10-06 23:43:37,173 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-06 23:43:37,176 INFO L225 Difference]: With dead ends: 124 [2019-10-06 23:43:37,177 INFO L226 Difference]: Without dead ends: 91 [2019-10-06 23:43:37,180 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 151 GetRequests, 121 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 243 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=186, Invalid=806, Unknown=0, NotChecked=0, Total=992 [2019-10-06 23:43:37,181 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2019-10-06 23:43:37,204 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 82. [2019-10-06 23:43:37,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82 states. [2019-10-06 23:43:37,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 92 transitions. [2019-10-06 23:43:37,207 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 92 transitions. Word has length 42 [2019-10-06 23:43:37,208 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-06 23:43:37,208 INFO L462 AbstractCegarLoop]: Abstraction has 82 states and 92 transitions. [2019-10-06 23:43:37,208 INFO L463 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-10-06 23:43:37,208 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 92 transitions. [2019-10-06 23:43:37,210 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2019-10-06 23:43:37,211 INFO L377 BasicCegarLoop]: Found error trace [2019-10-06 23:43:37,211 INFO L385 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-06 23:43:37,418 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-06 23:43:37,418 INFO L410 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-06 23:43:37,419 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-06 23:43:37,419 INFO L82 PathProgramCache]: Analyzing trace with hash -1801051469, now seen corresponding path program 3 times [2019-10-06 23:43:37,419 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-06 23:43:37,419 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-06 23:43:37,419 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-06 23:43:37,419 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-06 23:43:37,420 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-06 23:43:37,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-06 23:43:37,699 INFO L134 CoverageAnalysis]: Checked inductivity of 199 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 178 trivial. 0 not checked. [2019-10-06 23:43:37,700 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-06 23:43:37,700 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2019-10-06 23:43:37,700 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST 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-06 23:43:37,834 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-10-06 23:43:37,834 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-06 23:43:37,836 INFO L256 TraceCheckSpWp]: Trace formula consists of 382 conjuncts, 6 conjunts are in the unsatisfiable core [2019-10-06 23:43:37,841 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-06 23:43:37,896 INFO L134 CoverageAnalysis]: Checked inductivity of 199 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 189 trivial. 0 not checked. [2019-10-06 23:43:37,896 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-06 23:43:37,997 INFO L134 CoverageAnalysis]: Checked inductivity of 199 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 189 trivial. 0 not checked. [2019-10-06 23:43:37,998 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2019-10-06 23:43:38,000 INFO L162 IcfgInterpreter]: Started Sifa with 21 locations of interest [2019-10-06 23:43:38,000 INFO L169 IcfgInterpreter]: Building call graph [2019-10-06 23:43:38,000 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-06 23:43:38,001 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-06 23:43:38,001 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-06 23:43:38,025 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 21 for LOIs [2019-10-06 23:43:38,757 WARN L191 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 41 [2019-10-06 23:43:40,085 INFO L199 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 29 for LOIs [2019-10-06 23:43:40,092 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 10 for LOIs [2019-10-06 23:43:40,095 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-06 23:43:40,096 INFO L191 IcfgInterpreter]: Final predicates for locations of interest are: [2019-10-06 23:43:40,096 INFO L193 IcfgInterpreter]: Reachable states at location L2 satisfy 479#(and (exists ((|v_main_~#a1~0.base_BEFORE_CALL_3| Int) (v_prenex_12 Int) (v_prenex_11 Int) (v_prenex_10 Int) (|v_main_~#a0~0.base_BEFORE_CALL_3| Int) (|v_main_~#a1~0.offset_BEFORE_CALL_3| Int) (|v_main_~#a0~0.offset_BEFORE_CALL_3| Int) (v_prenex_9 Int)) (or (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| |v_main_~#a1~0.base_BEFORE_CALL_3|) |v_main_~#a1~0.offset_BEFORE_CALL_3|) (select (select |#memory_int| |v_main_~#a0~0.base_BEFORE_CALL_3|) |v_main_~#a0~0.offset_BEFORE_CALL_3|))) (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| v_prenex_9) v_prenex_11) (select (select |#memory_int| v_prenex_10) v_prenex_12)))))) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-06 23:43:40,096 INFO L193 IcfgInterpreter]: Reachable states at location L36-3 satisfy 330#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-06 23:43:40,096 INFO L193 IcfgInterpreter]: Reachable states at location L2-1 satisfy 484#(and (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (exists ((|v_main_~#a1~0.base_BEFORE_CALL_3| Int) (v_prenex_12 Int) (v_prenex_11 Int) (v_prenex_10 Int) (|v_main_~#a0~0.base_BEFORE_CALL_3| Int) (|v_main_~#a1~0.offset_BEFORE_CALL_3| Int) (|v_main_~#a0~0.offset_BEFORE_CALL_3| Int) (v_prenex_9 Int)) (or (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| |v_main_~#a1~0.base_BEFORE_CALL_3|) |v_main_~#a1~0.offset_BEFORE_CALL_3|) (select (select |#memory_int| |v_main_~#a0~0.base_BEFORE_CALL_3|) |v_main_~#a0~0.offset_BEFORE_CALL_3|))) (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| v_prenex_9) v_prenex_11) (select (select |#memory_int| v_prenex_10) v_prenex_12)))))) (<= 0 __VERIFIER_assert_~cond) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-06 23:43:40,097 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initENTRY satisfy 493#(and (= |old(#NULL.base)| |#NULL.base|) (= |#valid| |old(#valid)|) (= |#NULL.offset| |old(#NULL.offset)|)) [2019-10-06 23:43:40,097 INFO L193 IcfgInterpreter]: Reachable states at location L16-3 satisfy 72#true [2019-10-06 23:43:40,097 INFO L193 IcfgInterpreter]: Reachable states at location L27-3 satisfy 201#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-06 23:43:40,097 INFO L193 IcfgInterpreter]: Reachable states at location L49-3 satisfy 464#(and (<= 100000 main_~a~0) (<= 0 main_~i~0) (= main_~x~0 0) (<= 100000 main_~i~0) (not (< main_~i~0 100000)) (<= main_~x~0 0) (<= 0 main_~x~0)) [2019-10-06 23:43:40,097 INFO L193 IcfgInterpreter]: Reachable states at location L39-3 satisfy 373#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-06 23:43:40,098 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION satisfy 489#(and (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (exists ((|v_main_~#a1~0.base_BEFORE_CALL_3| Int) (v_prenex_12 Int) (v_prenex_11 Int) (v_prenex_10 Int) (|v_main_~#a0~0.base_BEFORE_CALL_3| Int) (|v_main_~#a1~0.offset_BEFORE_CALL_3| Int) (|v_main_~#a0~0.offset_BEFORE_CALL_3| Int) (v_prenex_9 Int)) (or (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| |v_main_~#a1~0.base_BEFORE_CALL_3|) |v_main_~#a1~0.offset_BEFORE_CALL_3|) (select (select |#memory_int| |v_main_~#a0~0.base_BEFORE_CALL_3|) |v_main_~#a0~0.offset_BEFORE_CALL_3|))) (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| v_prenex_9) v_prenex_11) (select (select |#memory_int| v_prenex_10) v_prenex_12)))))) (<= 0 __VERIFIER_assert_~cond) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-06 23:43:40,098 INFO L193 IcfgInterpreter]: Reachable states at location L-1 satisfy 23#(and (= 0 |#NULL.base|) (<= |#NULL.base| 0) (= 0 (select |#valid| 0)) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-06 23:43:40,098 INFO L193 IcfgInterpreter]: Reachable states at location L30-3 satisfy 244#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-06 23:43:40,098 INFO L193 IcfgInterpreter]: Reachable states at location mainENTRY satisfy 33#(and (= 0 |#NULL.base|) (<= |#NULL.base| 0) (= |#valid| |old(#valid)|) (<= 0 |#NULL.base|) (= |#memory_int| |old(#memory_int)|) (= |#NULL.offset| 0) (= |old(#length)| |#length|) (= 0 (select |old(#valid)| 0)) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-06 23:43:40,098 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initEXIT satisfy 498#(and (= |#valid| (store |old(#valid)| 0 0)) (= 0 |#NULL.base|) (<= |#NULL.base| 0) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-06 23:43:40,098 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.startENTRY satisfy 6#true [2019-10-06 23:43:40,098 INFO L193 IcfgInterpreter]: Reachable states at location L42-3 satisfy 416#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-06 23:43:40,098 INFO L193 IcfgInterpreter]: Reachable states at location L21-3 satisfy 115#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-06 23:43:40,099 INFO L193 IcfgInterpreter]: Reachable states at location L50 satisfy 469#(and (<= 100000 main_~a~0) (< main_~x~0 100000) (= |main_#t~mem23| (select (select |#memory_int| |main_~#a0~0.base|) (+ (* 4 main_~x~0) |main_~#a0~0.offset|))) (<= 0 main_~i~0) (= main_~x~0 0) (<= 100000 main_~i~0) (= |main_#t~mem22| (select (select |#memory_int| |main_~#a1~0.base|) (+ (* 4 main_~x~0) |main_~#a1~0.offset|))) (not (< main_~i~0 100000)) (<= main_~x~0 0) (<= 0 main_~x~0)) [2019-10-06 23:43:40,099 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertENTRY satisfy 474#(exists ((|v_main_~#a1~0.base_BEFORE_CALL_3| Int) (v_prenex_12 Int) (v_prenex_11 Int) (v_prenex_10 Int) (|v_main_~#a0~0.base_BEFORE_CALL_3| Int) (|v_main_~#a1~0.offset_BEFORE_CALL_3| Int) (|v_main_~#a0~0.offset_BEFORE_CALL_3| Int) (v_prenex_9 Int)) (or (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| |v_main_~#a1~0.base_BEFORE_CALL_3|) |v_main_~#a1~0.offset_BEFORE_CALL_3|) (select (select |#memory_int| |v_main_~#a0~0.base_BEFORE_CALL_3|) |v_main_~#a0~0.offset_BEFORE_CALL_3|))) (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| v_prenex_9) v_prenex_11) (select (select |#memory_int| v_prenex_10) v_prenex_12)))))) [2019-10-06 23:43:40,099 INFO L193 IcfgInterpreter]: Reachable states at location L33-3 satisfy 287#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-06 23:43:40,099 INFO L193 IcfgInterpreter]: Reachable states at location L45-3 satisfy 459#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-06 23:43:40,099 INFO L193 IcfgInterpreter]: Reachable states at location L24-3 satisfy 158#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-06 23:43:40,415 INFO L211 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-06 23:43:40,416 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 7, 7, 11] total 29 [2019-10-06 23:43:40,417 INFO L442 AbstractCegarLoop]: Interpolant automaton has 29 states [2019-10-06 23:43:40,418 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2019-10-06 23:43:40,419 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=130, Invalid=682, Unknown=0, NotChecked=0, Total=812 [2019-10-06 23:43:40,419 INFO L87 Difference]: Start difference. First operand 82 states and 92 transitions. Second operand 29 states. [2019-10-06 23:43:41,821 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-06 23:43:41,821 INFO L93 Difference]: Finished difference Result 178 states and 212 transitions. [2019-10-06 23:43:41,822 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-10-06 23:43:41,822 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 78 [2019-10-06 23:43:41,822 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-06 23:43:41,825 INFO L225 Difference]: With dead ends: 178 [2019-10-06 23:43:41,825 INFO L226 Difference]: Without dead ends: 106 [2019-10-06 23:43:41,827 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 275 GetRequests, 224 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 672 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=398, Invalid=2358, Unknown=0, NotChecked=0, Total=2756 [2019-10-06 23:43:41,828 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2019-10-06 23:43:41,856 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 97. [2019-10-06 23:43:41,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97 states. [2019-10-06 23:43:41,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 107 transitions. [2019-10-06 23:43:41,859 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 107 transitions. Word has length 78 [2019-10-06 23:43:41,861 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-06 23:43:41,861 INFO L462 AbstractCegarLoop]: Abstraction has 97 states and 107 transitions. [2019-10-06 23:43:41,861 INFO L463 AbstractCegarLoop]: Interpolant automaton has 29 states. [2019-10-06 23:43:41,862 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 107 transitions. [2019-10-06 23:43:41,865 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2019-10-06 23:43:41,866 INFO L377 BasicCegarLoop]: Found error trace [2019-10-06 23:43:41,866 INFO L385 BasicCegarLoop]: trace histogram [10, 7, 7, 7, 7, 7, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-06 23:43:42,080 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-06 23:43:42,081 INFO L410 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-06 23:43:42,081 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-06 23:43:42,081 INFO L82 PathProgramCache]: Analyzing trace with hash -1475201823, now seen corresponding path program 4 times [2019-10-06 23:43:42,082 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-06 23:43:42,082 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-06 23:43:42,082 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-06 23:43:42,082 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-06 23:43:42,082 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-06 23:43:42,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-06 23:43:42,402 INFO L134 CoverageAnalysis]: Checked inductivity of 307 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 279 trivial. 0 not checked. [2019-10-06 23:43:42,404 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-06 23:43:42,404 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2019-10-06 23:43:42,404 INFO L93 rtionOrderModulation]: Changing assertion order to 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-06 23:43:42,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-06 23:43:42,580 INFO L256 TraceCheckSpWp]: Trace formula consists of 466 conjuncts, 12 conjunts are in the unsatisfiable core [2019-10-06 23:43:42,586 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-06 23:43:42,751 INFO L134 CoverageAnalysis]: Checked inductivity of 307 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 252 trivial. 0 not checked. [2019-10-06 23:43:42,751 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-06 23:43:42,976 INFO L134 CoverageAnalysis]: Checked inductivity of 307 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 252 trivial. 0 not checked. [2019-10-06 23:43:42,976 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2019-10-06 23:43:42,978 INFO L162 IcfgInterpreter]: Started Sifa with 21 locations of interest [2019-10-06 23:43:42,978 INFO L169 IcfgInterpreter]: Building call graph [2019-10-06 23:43:42,979 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-06 23:43:42,979 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-06 23:43:42,979 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-06 23:43:43,006 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 21 for LOIs [2019-10-06 23:43:44,857 INFO L199 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 29 for LOIs [2019-10-06 23:43:44,867 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 10 for LOIs [2019-10-06 23:43:44,875 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-06 23:43:44,876 INFO L191 IcfgInterpreter]: Final predicates for locations of interest are: [2019-10-06 23:43:44,876 INFO L193 IcfgInterpreter]: Reachable states at location L2 satisfy 479#(and (exists ((v_prenex_16 Int) (v_prenex_15 Int) (|v_main_~#a1~0.base_BEFORE_CALL_4| Int) (|v_main_~#a0~0.base_BEFORE_CALL_4| Int) (v_prenex_14 Int) (v_prenex_13 Int) (|v_main_~#a0~0.offset_BEFORE_CALL_4| Int) (|v_main_~#a1~0.offset_BEFORE_CALL_4| Int)) (or (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| v_prenex_14) v_prenex_15) (select (select |#memory_int| v_prenex_13) v_prenex_16)))) (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| |v_main_~#a0~0.base_BEFORE_CALL_4|) |v_main_~#a0~0.offset_BEFORE_CALL_4|) (select (select |#memory_int| |v_main_~#a1~0.base_BEFORE_CALL_4|) |v_main_~#a1~0.offset_BEFORE_CALL_4|))))) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-06 23:43:44,876 INFO L193 IcfgInterpreter]: Reachable states at location L36-3 satisfy 330#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-06 23:43:44,876 INFO L193 IcfgInterpreter]: Reachable states at location L2-1 satisfy 484#(and (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (exists ((v_prenex_16 Int) (v_prenex_15 Int) (|v_main_~#a1~0.base_BEFORE_CALL_4| Int) (|v_main_~#a0~0.base_BEFORE_CALL_4| Int) (v_prenex_14 Int) (v_prenex_13 Int) (|v_main_~#a0~0.offset_BEFORE_CALL_4| Int) (|v_main_~#a1~0.offset_BEFORE_CALL_4| Int)) (or (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| v_prenex_14) v_prenex_15) (select (select |#memory_int| v_prenex_13) v_prenex_16)))) (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| |v_main_~#a0~0.base_BEFORE_CALL_4|) |v_main_~#a0~0.offset_BEFORE_CALL_4|) (select (select |#memory_int| |v_main_~#a1~0.base_BEFORE_CALL_4|) |v_main_~#a1~0.offset_BEFORE_CALL_4|))))) (<= 0 __VERIFIER_assert_~cond) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-06 23:43:44,877 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initENTRY satisfy 493#(and (= |old(#NULL.base)| |#NULL.base|) (= |#valid| |old(#valid)|) (= |#NULL.offset| |old(#NULL.offset)|)) [2019-10-06 23:43:44,877 INFO L193 IcfgInterpreter]: Reachable states at location L16-3 satisfy 72#true [2019-10-06 23:43:44,877 INFO L193 IcfgInterpreter]: Reachable states at location L27-3 satisfy 201#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-06 23:43:44,877 INFO L193 IcfgInterpreter]: Reachable states at location L49-3 satisfy 464#(and (<= 100000 main_~a~0) (<= 0 main_~i~0) (= main_~x~0 0) (<= 100000 main_~i~0) (not (< main_~i~0 100000)) (<= main_~x~0 0) (<= 0 main_~x~0)) [2019-10-06 23:43:44,877 INFO L193 IcfgInterpreter]: Reachable states at location L39-3 satisfy 373#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-06 23:43:44,878 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION satisfy 489#(and (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (exists ((v_prenex_16 Int) (v_prenex_15 Int) (|v_main_~#a1~0.base_BEFORE_CALL_4| Int) (|v_main_~#a0~0.base_BEFORE_CALL_4| Int) (v_prenex_14 Int) (v_prenex_13 Int) (|v_main_~#a0~0.offset_BEFORE_CALL_4| Int) (|v_main_~#a1~0.offset_BEFORE_CALL_4| Int)) (or (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| v_prenex_14) v_prenex_15) (select (select |#memory_int| v_prenex_13) v_prenex_16)))) (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| |v_main_~#a0~0.base_BEFORE_CALL_4|) |v_main_~#a0~0.offset_BEFORE_CALL_4|) (select (select |#memory_int| |v_main_~#a1~0.base_BEFORE_CALL_4|) |v_main_~#a1~0.offset_BEFORE_CALL_4|))))) (<= 0 __VERIFIER_assert_~cond) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-06 23:43:44,878 INFO L193 IcfgInterpreter]: Reachable states at location L-1 satisfy 23#(and (= 0 |#NULL.base|) (<= |#NULL.base| 0) (= 0 (select |#valid| 0)) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-06 23:43:44,878 INFO L193 IcfgInterpreter]: Reachable states at location L30-3 satisfy 244#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-06 23:43:44,878 INFO L193 IcfgInterpreter]: Reachable states at location mainENTRY satisfy 33#(and (= 0 |#NULL.base|) (<= |#NULL.base| 0) (= |#valid| |old(#valid)|) (<= 0 |#NULL.base|) (= |#memory_int| |old(#memory_int)|) (= |#NULL.offset| 0) (= |old(#length)| |#length|) (= 0 (select |old(#valid)| 0)) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-06 23:43:44,881 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initEXIT satisfy 498#(and (= |#valid| (store |old(#valid)| 0 0)) (= 0 |#NULL.base|) (<= |#NULL.base| 0) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-06 23:43:44,882 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.startENTRY satisfy 6#true [2019-10-06 23:43:44,882 INFO L193 IcfgInterpreter]: Reachable states at location L42-3 satisfy 416#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-06 23:43:44,882 INFO L193 IcfgInterpreter]: Reachable states at location L21-3 satisfy 115#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-06 23:43:44,882 INFO L193 IcfgInterpreter]: Reachable states at location L50 satisfy 469#(and (<= 100000 main_~a~0) (< main_~x~0 100000) (= |main_#t~mem23| (select (select |#memory_int| |main_~#a0~0.base|) (+ (* 4 main_~x~0) |main_~#a0~0.offset|))) (<= 0 main_~i~0) (= main_~x~0 0) (<= 100000 main_~i~0) (= |main_#t~mem22| (select (select |#memory_int| |main_~#a1~0.base|) (+ (* 4 main_~x~0) |main_~#a1~0.offset|))) (not (< main_~i~0 100000)) (<= main_~x~0 0) (<= 0 main_~x~0)) [2019-10-06 23:43:44,882 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertENTRY satisfy 474#(exists ((v_prenex_16 Int) (v_prenex_15 Int) (|v_main_~#a1~0.base_BEFORE_CALL_4| Int) (|v_main_~#a0~0.base_BEFORE_CALL_4| Int) (v_prenex_14 Int) (v_prenex_13 Int) (|v_main_~#a0~0.offset_BEFORE_CALL_4| Int) (|v_main_~#a1~0.offset_BEFORE_CALL_4| Int)) (or (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| v_prenex_14) v_prenex_15) (select (select |#memory_int| v_prenex_13) v_prenex_16)))) (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| |v_main_~#a0~0.base_BEFORE_CALL_4|) |v_main_~#a0~0.offset_BEFORE_CALL_4|) (select (select |#memory_int| |v_main_~#a1~0.base_BEFORE_CALL_4|) |v_main_~#a1~0.offset_BEFORE_CALL_4|))))) [2019-10-06 23:43:44,883 INFO L193 IcfgInterpreter]: Reachable states at location L33-3 satisfy 287#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-06 23:43:44,883 INFO L193 IcfgInterpreter]: Reachable states at location L45-3 satisfy 459#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-06 23:43:44,884 INFO L193 IcfgInterpreter]: Reachable states at location L24-3 satisfy 158#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-06 23:43:45,247 INFO L211 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-06 23:43:45,248 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 13, 13, 11] total 42 [2019-10-06 23:43:45,250 INFO L442 AbstractCegarLoop]: Interpolant automaton has 42 states [2019-10-06 23:43:45,250 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2019-10-06 23:43:45,251 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=349, Invalid=1373, Unknown=0, NotChecked=0, Total=1722 [2019-10-06 23:43:45,252 INFO L87 Difference]: Start difference. First operand 97 states and 107 transitions. Second operand 42 states. [2019-10-06 23:43:47,326 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-06 23:43:47,326 INFO L93 Difference]: Finished difference Result 208 states and 248 transitions. [2019-10-06 23:43:47,327 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2019-10-06 23:43:47,327 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 93 [2019-10-06 23:43:47,327 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-06 23:43:47,329 INFO L225 Difference]: With dead ends: 208 [2019-10-06 23:43:47,329 INFO L226 Difference]: Without dead ends: 127 [2019-10-06 23:43:47,332 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 335 GetRequests, 258 SyntacticMatches, 0 SemanticMatches, 77 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1530 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=1057, Invalid=5105, Unknown=0, NotChecked=0, Total=6162 [2019-10-06 23:43:47,332 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2019-10-06 23:43:47,344 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 118. [2019-10-06 23:43:47,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 118 states. [2019-10-06 23:43:47,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 128 transitions. [2019-10-06 23:43:47,346 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 128 transitions. Word has length 93 [2019-10-06 23:43:47,346 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-06 23:43:47,346 INFO L462 AbstractCegarLoop]: Abstraction has 118 states and 128 transitions. [2019-10-06 23:43:47,346 INFO L463 AbstractCegarLoop]: Interpolant automaton has 42 states. [2019-10-06 23:43:47,347 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 128 transitions. [2019-10-06 23:43:47,348 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2019-10-06 23:43:47,349 INFO L377 BasicCegarLoop]: Found error trace [2019-10-06 23:43:47,349 INFO L385 BasicCegarLoop]: trace histogram [22, 8, 8, 8, 8, 8, 8, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-06 23:43:47,553 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-06 23:43:47,553 INFO L410 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-06 23:43:47,554 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-06 23:43:47,554 INFO L82 PathProgramCache]: Analyzing trace with hash -486763693, now seen corresponding path program 5 times [2019-10-06 23:43:47,554 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-06 23:43:47,554 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-06 23:43:47,555 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-06 23:43:47,555 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-06 23:43:47,555 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-06 23:43:47,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-06 23:43:47,792 INFO L134 CoverageAnalysis]: Checked inductivity of 577 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 541 trivial. 0 not checked. [2019-10-06 23:43:47,793 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-06 23:43:47,793 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2019-10-06 23:43:47,793 INFO L93 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-06 23:44:15,911 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2019-10-06 23:44:15,911 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-06 23:44:15,926 INFO L256 TraceCheckSpWp]: Trace formula consists of 486 conjuncts, 35 conjunts are in the unsatisfiable core [2019-10-06 23:44:15,938 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-06 23:44:16,059 INFO L134 CoverageAnalysis]: Checked inductivity of 577 backedges. 38 proven. 36 refuted. 0 times theorem prover too weak. 503 trivial. 0 not checked. [2019-10-06 23:44:16,059 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-06 23:44:16,187 INFO L134 CoverageAnalysis]: Checked inductivity of 577 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 533 trivial. 0 not checked. [2019-10-06 23:44:16,187 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2019-10-06 23:44:16,189 INFO L162 IcfgInterpreter]: Started Sifa with 21 locations of interest [2019-10-06 23:44:16,189 INFO L169 IcfgInterpreter]: Building call graph [2019-10-06 23:44:16,190 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-06 23:44:16,190 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-06 23:44:16,190 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-06 23:44:16,210 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 21 for LOIs [2019-10-06 23:44:17,836 WARN L191 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 38 [2019-10-06 23:44:18,090 INFO L199 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 29 for LOIs [2019-10-06 23:44:18,098 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 10 for LOIs [2019-10-06 23:44:18,102 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-06 23:44:18,102 INFO L191 IcfgInterpreter]: Final predicates for locations of interest are: [2019-10-06 23:44:18,103 INFO L193 IcfgInterpreter]: Reachable states at location L2 satisfy 479#(and (exists ((v_prenex_18 Int) (v_prenex_17 Int) (|v_main_~#a0~0.base_BEFORE_CALL_5| Int) (v_prenex_20 Int) (|v_main_~#a0~0.offset_BEFORE_CALL_5| Int) (v_prenex_19 Int) (|v_main_~#a1~0.base_BEFORE_CALL_5| Int) (|v_main_~#a1~0.offset_BEFORE_CALL_5| Int)) (or (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| |v_main_~#a0~0.base_BEFORE_CALL_5|) |v_main_~#a0~0.offset_BEFORE_CALL_5|) (select (select |#memory_int| |v_main_~#a1~0.base_BEFORE_CALL_5|) |v_main_~#a1~0.offset_BEFORE_CALL_5|)))) (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| v_prenex_17) v_prenex_18) (select (select |#memory_int| v_prenex_19) v_prenex_20))))) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-06 23:44:18,103 INFO L193 IcfgInterpreter]: Reachable states at location L36-3 satisfy 330#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-06 23:44:18,103 INFO L193 IcfgInterpreter]: Reachable states at location L2-1 satisfy 484#(and (exists ((v_prenex_18 Int) (v_prenex_17 Int) (|v_main_~#a0~0.base_BEFORE_CALL_5| Int) (v_prenex_20 Int) (|v_main_~#a0~0.offset_BEFORE_CALL_5| Int) (v_prenex_19 Int) (|v_main_~#a1~0.base_BEFORE_CALL_5| Int) (|v_main_~#a1~0.offset_BEFORE_CALL_5| Int)) (or (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| |v_main_~#a0~0.base_BEFORE_CALL_5|) |v_main_~#a0~0.offset_BEFORE_CALL_5|) (select (select |#memory_int| |v_main_~#a1~0.base_BEFORE_CALL_5|) |v_main_~#a1~0.offset_BEFORE_CALL_5|)))) (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| v_prenex_17) v_prenex_18) (select (select |#memory_int| v_prenex_19) v_prenex_20))))) (<= __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-06 23:44:18,103 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initENTRY satisfy 493#(and (= |old(#NULL.base)| |#NULL.base|) (= |#valid| |old(#valid)|) (= |#NULL.offset| |old(#NULL.offset)|)) [2019-10-06 23:44:18,103 INFO L193 IcfgInterpreter]: Reachable states at location L16-3 satisfy 72#true [2019-10-06 23:44:18,103 INFO L193 IcfgInterpreter]: Reachable states at location L27-3 satisfy 201#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-06 23:44:18,104 INFO L193 IcfgInterpreter]: Reachable states at location L49-3 satisfy 464#(and (<= 100000 main_~a~0) (<= 0 main_~i~0) (= main_~x~0 0) (<= 100000 main_~i~0) (not (< main_~i~0 100000)) (<= main_~x~0 0) (<= 0 main_~x~0)) [2019-10-06 23:44:18,104 INFO L193 IcfgInterpreter]: Reachable states at location L39-3 satisfy 373#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-06 23:44:18,104 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION satisfy 489#(and (exists ((v_prenex_18 Int) (v_prenex_17 Int) (|v_main_~#a0~0.base_BEFORE_CALL_5| Int) (v_prenex_20 Int) (|v_main_~#a0~0.offset_BEFORE_CALL_5| Int) (v_prenex_19 Int) (|v_main_~#a1~0.base_BEFORE_CALL_5| Int) (|v_main_~#a1~0.offset_BEFORE_CALL_5| Int)) (or (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| |v_main_~#a0~0.base_BEFORE_CALL_5|) |v_main_~#a0~0.offset_BEFORE_CALL_5|) (select (select |#memory_int| |v_main_~#a1~0.base_BEFORE_CALL_5|) |v_main_~#a1~0.offset_BEFORE_CALL_5|)))) (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| v_prenex_17) v_prenex_18) (select (select |#memory_int| v_prenex_19) v_prenex_20))))) (<= __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-06 23:44:18,104 INFO L193 IcfgInterpreter]: Reachable states at location L-1 satisfy 23#(and (= 0 |#NULL.base|) (<= |#NULL.base| 0) (= 0 (select |#valid| 0)) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-06 23:44:18,104 INFO L193 IcfgInterpreter]: Reachable states at location L30-3 satisfy 244#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-06 23:44:18,105 INFO L193 IcfgInterpreter]: Reachable states at location mainENTRY satisfy 33#(and (= 0 |#NULL.base|) (<= |#NULL.base| 0) (= |#valid| |old(#valid)|) (<= 0 |#NULL.base|) (= |#memory_int| |old(#memory_int)|) (= |#NULL.offset| 0) (= |old(#length)| |#length|) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (= 0 (select |old(#valid)| 0))) [2019-10-06 23:44:18,105 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initEXIT satisfy 498#(and (= |#valid| (store |old(#valid)| 0 0)) (= 0 |#NULL.base|) (<= |#NULL.base| 0) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-06 23:44:18,105 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.startENTRY satisfy 6#true [2019-10-06 23:44:18,105 INFO L193 IcfgInterpreter]: Reachable states at location L42-3 satisfy 416#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-06 23:44:18,105 INFO L193 IcfgInterpreter]: Reachable states at location L21-3 satisfy 115#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-06 23:44:18,106 INFO L193 IcfgInterpreter]: Reachable states at location L50 satisfy 469#(and (<= 100000 main_~a~0) (< main_~x~0 100000) (= |main_#t~mem23| (select (select |#memory_int| |main_~#a0~0.base|) (+ (* 4 main_~x~0) |main_~#a0~0.offset|))) (<= 0 main_~i~0) (= main_~x~0 0) (<= 100000 main_~i~0) (= |main_#t~mem22| (select (select |#memory_int| |main_~#a1~0.base|) (+ (* 4 main_~x~0) |main_~#a1~0.offset|))) (not (< main_~i~0 100000)) (<= main_~x~0 0) (<= 0 main_~x~0)) [2019-10-06 23:44:18,106 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertENTRY satisfy 474#(exists ((v_prenex_18 Int) (v_prenex_17 Int) (|v_main_~#a0~0.base_BEFORE_CALL_5| Int) (v_prenex_20 Int) (|v_main_~#a0~0.offset_BEFORE_CALL_5| Int) (v_prenex_19 Int) (|v_main_~#a1~0.base_BEFORE_CALL_5| Int) (|v_main_~#a1~0.offset_BEFORE_CALL_5| Int)) (or (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| |v_main_~#a0~0.base_BEFORE_CALL_5|) |v_main_~#a0~0.offset_BEFORE_CALL_5|) (select (select |#memory_int| |v_main_~#a1~0.base_BEFORE_CALL_5|) |v_main_~#a1~0.offset_BEFORE_CALL_5|)))) (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| v_prenex_17) v_prenex_18) (select (select |#memory_int| v_prenex_19) v_prenex_20))))) [2019-10-06 23:44:18,106 INFO L193 IcfgInterpreter]: Reachable states at location L33-3 satisfy 287#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-06 23:44:18,106 INFO L193 IcfgInterpreter]: Reachable states at location L45-3 satisfy 459#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-06 23:44:18,106 INFO L193 IcfgInterpreter]: Reachable states at location L24-3 satisfy 158#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-06 23:44:18,421 INFO L211 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-06 23:44:18,422 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 13, 11, 11] total 33 [2019-10-06 23:44:18,423 INFO L442 AbstractCegarLoop]: Interpolant automaton has 33 states [2019-10-06 23:44:18,424 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2019-10-06 23:44:18,425 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=262, Invalid=794, Unknown=0, NotChecked=0, Total=1056 [2019-10-06 23:44:18,425 INFO L87 Difference]: Start difference. First operand 118 states and 128 transitions. Second operand 33 states. [2019-10-06 23:44:20,902 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-06 23:44:20,902 INFO L93 Difference]: Finished difference Result 298 states and 406 transitions. [2019-10-06 23:44:20,903 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2019-10-06 23:44:20,903 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 114 [2019-10-06 23:44:20,904 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-06 23:44:20,906 INFO L225 Difference]: With dead ends: 298 [2019-10-06 23:44:20,906 INFO L226 Difference]: Without dead ends: 217 [2019-10-06 23:44:20,908 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 399 GetRequests, 340 SyntacticMatches, 1 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 862 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=828, Invalid=2712, Unknown=0, NotChecked=0, Total=3540 [2019-10-06 23:44:20,908 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 217 states. [2019-10-06 23:44:20,930 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 217 to 208. [2019-10-06 23:44:20,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 208 states. [2019-10-06 23:44:20,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 208 states to 208 states and 218 transitions. [2019-10-06 23:44:20,933 INFO L78 Accepts]: Start accepts. Automaton has 208 states and 218 transitions. Word has length 114 [2019-10-06 23:44:20,933 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-06 23:44:20,933 INFO L462 AbstractCegarLoop]: Abstraction has 208 states and 218 transitions. [2019-10-06 23:44:20,933 INFO L463 AbstractCegarLoop]: Interpolant automaton has 33 states. [2019-10-06 23:44:20,934 INFO L276 IsEmpty]: Start isEmpty. Operand 208 states and 218 transitions. [2019-10-06 23:44:20,936 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 205 [2019-10-06 23:44:20,937 INFO L377 BasicCegarLoop]: Found error trace [2019-10-06 23:44:20,937 INFO L385 BasicCegarLoop]: trace histogram [22, 18, 18, 18, 18, 18, 18, 18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-06 23:44:21,137 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-06 23:44:21,138 INFO L410 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-06 23:44:21,139 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-06 23:44:21,139 INFO L82 PathProgramCache]: Analyzing trace with hash -252962989, now seen corresponding path program 6 times [2019-10-06 23:44:21,139 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-06 23:44:21,139 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-06 23:44:21,140 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-06 23:44:21,140 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-06 23:44:21,140 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-06 23:44:22,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-06 23:44:22,438 INFO L134 CoverageAnalysis]: Checked inductivity of 1792 backedges. 0 proven. 171 refuted. 0 times theorem prover too weak. 1621 trivial. 0 not checked. [2019-10-06 23:44:22,439 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-06 23:44:22,439 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2019-10-06 23:44:22,439 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-06 23:44:22,714 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-10-06 23:44:22,715 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-06 23:44:22,720 INFO L256 TraceCheckSpWp]: Trace formula consists of 958 conjuncts, 24 conjunts are in the unsatisfiable core [2019-10-06 23:44:22,726 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-06 23:44:23,262 INFO L134 CoverageAnalysis]: Checked inductivity of 1792 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 1539 trivial. 0 not checked. [2019-10-06 23:44:23,262 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-06 23:44:24,318 INFO L134 CoverageAnalysis]: Checked inductivity of 1792 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 1539 trivial. 0 not checked. [2019-10-06 23:44:24,318 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2019-10-06 23:44:24,320 INFO L162 IcfgInterpreter]: Started Sifa with 21 locations of interest [2019-10-06 23:44:24,320 INFO L169 IcfgInterpreter]: Building call graph [2019-10-06 23:44:24,321 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-06 23:44:24,321 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-06 23:44:24,321 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-06 23:44:24,337 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 21 for LOIs [2019-10-06 23:44:25,163 WARN L191 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 38 [2019-10-06 23:44:25,807 WARN L191 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 41 [2019-10-06 23:44:26,066 WARN L191 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 41 [2019-10-06 23:44:26,312 WARN L191 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 38 [2019-10-06 23:44:26,401 INFO L199 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 29 for LOIs [2019-10-06 23:44:26,414 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 10 for LOIs [2019-10-06 23:44:26,424 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-06 23:44:26,425 INFO L191 IcfgInterpreter]: Final predicates for locations of interest are: [2019-10-06 23:44:26,425 INFO L193 IcfgInterpreter]: Reachable states at location L2 satisfy 479#(and (exists ((v_prenex_23 Int) (v_prenex_22 Int) (|v_main_~#a0~0.base_BEFORE_CALL_6| Int) (v_prenex_24 Int) (v_prenex_21 Int) (|v_main_~#a0~0.offset_BEFORE_CALL_6| Int) (|v_main_~#a1~0.base_BEFORE_CALL_6| Int) (|v_main_~#a1~0.offset_BEFORE_CALL_6| Int)) (or (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| v_prenex_23) v_prenex_24) (select (select |#memory_int| v_prenex_21) v_prenex_22))) (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| |v_main_~#a1~0.base_BEFORE_CALL_6|) |v_main_~#a1~0.offset_BEFORE_CALL_6|) (select (select |#memory_int| |v_main_~#a0~0.base_BEFORE_CALL_6|) |v_main_~#a0~0.offset_BEFORE_CALL_6|)))))) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-06 23:44:26,425 INFO L193 IcfgInterpreter]: Reachable states at location L36-3 satisfy 330#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-06 23:44:26,426 INFO L193 IcfgInterpreter]: Reachable states at location L2-1 satisfy 484#(and (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (exists ((v_prenex_23 Int) (v_prenex_22 Int) (|v_main_~#a0~0.base_BEFORE_CALL_6| Int) (v_prenex_24 Int) (v_prenex_21 Int) (|v_main_~#a0~0.offset_BEFORE_CALL_6| Int) (|v_main_~#a1~0.base_BEFORE_CALL_6| Int) (|v_main_~#a1~0.offset_BEFORE_CALL_6| Int)) (or (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| v_prenex_23) v_prenex_24) (select (select |#memory_int| v_prenex_21) v_prenex_22))) (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| |v_main_~#a1~0.base_BEFORE_CALL_6|) |v_main_~#a1~0.offset_BEFORE_CALL_6|) (select (select |#memory_int| |v_main_~#a0~0.base_BEFORE_CALL_6|) |v_main_~#a0~0.offset_BEFORE_CALL_6|)))))) (<= 0 __VERIFIER_assert_~cond) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-06 23:44:26,426 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initENTRY satisfy 493#(and (= |old(#NULL.base)| |#NULL.base|) (= |#valid| |old(#valid)|) (= |#NULL.offset| |old(#NULL.offset)|)) [2019-10-06 23:44:26,426 INFO L193 IcfgInterpreter]: Reachable states at location L16-3 satisfy 72#true [2019-10-06 23:44:26,426 INFO L193 IcfgInterpreter]: Reachable states at location L27-3 satisfy 201#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-06 23:44:26,427 INFO L193 IcfgInterpreter]: Reachable states at location L49-3 satisfy 464#(and (<= 100000 main_~a~0) (<= 0 main_~i~0) (= main_~x~0 0) (<= 100000 main_~i~0) (not (< main_~i~0 100000)) (<= main_~x~0 0) (<= 0 main_~x~0)) [2019-10-06 23:44:26,427 INFO L193 IcfgInterpreter]: Reachable states at location L39-3 satisfy 373#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-06 23:44:26,428 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION satisfy 489#(and (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (exists ((v_prenex_23 Int) (v_prenex_22 Int) (|v_main_~#a0~0.base_BEFORE_CALL_6| Int) (v_prenex_24 Int) (v_prenex_21 Int) (|v_main_~#a0~0.offset_BEFORE_CALL_6| Int) (|v_main_~#a1~0.base_BEFORE_CALL_6| Int) (|v_main_~#a1~0.offset_BEFORE_CALL_6| Int)) (or (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| v_prenex_23) v_prenex_24) (select (select |#memory_int| v_prenex_21) v_prenex_22))) (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| |v_main_~#a1~0.base_BEFORE_CALL_6|) |v_main_~#a1~0.offset_BEFORE_CALL_6|) (select (select |#memory_int| |v_main_~#a0~0.base_BEFORE_CALL_6|) |v_main_~#a0~0.offset_BEFORE_CALL_6|)))))) (<= 0 __VERIFIER_assert_~cond) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-06 23:44:26,428 INFO L193 IcfgInterpreter]: Reachable states at location L-1 satisfy 23#(and (= 0 |#NULL.base|) (<= |#NULL.base| 0) (= 0 (select |#valid| 0)) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-06 23:44:26,428 INFO L193 IcfgInterpreter]: Reachable states at location L30-3 satisfy 244#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-06 23:44:26,428 INFO L193 IcfgInterpreter]: Reachable states at location mainENTRY satisfy 33#(and (= 0 |#NULL.base|) (<= |#NULL.base| 0) (= |#valid| |old(#valid)|) (<= 0 |#NULL.base|) (= |#memory_int| |old(#memory_int)|) (= |#NULL.offset| 0) (= |old(#length)| |#length|) (= 0 (select |old(#valid)| 0)) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-06 23:44:26,429 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initEXIT satisfy 498#(and (= |#valid| (store |old(#valid)| 0 0)) (= 0 |#NULL.base|) (<= |#NULL.base| 0) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-06 23:44:26,429 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.startENTRY satisfy 6#true [2019-10-06 23:44:26,429 INFO L193 IcfgInterpreter]: Reachable states at location L42-3 satisfy 416#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-06 23:44:26,430 INFO L193 IcfgInterpreter]: Reachable states at location L50 satisfy 469#(and (<= 100000 main_~a~0) (< main_~x~0 100000) (= |main_#t~mem23| (select (select |#memory_int| |main_~#a0~0.base|) (+ (* 4 main_~x~0) |main_~#a0~0.offset|))) (<= 0 main_~i~0) (= main_~x~0 0) (<= 100000 main_~i~0) (= |main_#t~mem22| (select (select |#memory_int| |main_~#a1~0.base|) (+ (* 4 main_~x~0) |main_~#a1~0.offset|))) (not (< main_~i~0 100000)) (<= main_~x~0 0) (<= 0 main_~x~0)) [2019-10-06 23:44:26,430 INFO L193 IcfgInterpreter]: Reachable states at location L21-3 satisfy 115#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-06 23:44:26,430 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertENTRY satisfy 474#(exists ((v_prenex_23 Int) (v_prenex_22 Int) (|v_main_~#a0~0.base_BEFORE_CALL_6| Int) (v_prenex_24 Int) (v_prenex_21 Int) (|v_main_~#a0~0.offset_BEFORE_CALL_6| Int) (|v_main_~#a1~0.base_BEFORE_CALL_6| Int) (|v_main_~#a1~0.offset_BEFORE_CALL_6| Int)) (or (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| v_prenex_23) v_prenex_24) (select (select |#memory_int| v_prenex_21) v_prenex_22))) (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| |v_main_~#a1~0.base_BEFORE_CALL_6|) |v_main_~#a1~0.offset_BEFORE_CALL_6|) (select (select |#memory_int| |v_main_~#a0~0.base_BEFORE_CALL_6|) |v_main_~#a0~0.offset_BEFORE_CALL_6|)))))) [2019-10-06 23:44:26,431 INFO L193 IcfgInterpreter]: Reachable states at location L33-3 satisfy 287#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-06 23:44:26,431 INFO L193 IcfgInterpreter]: Reachable states at location L45-3 satisfy 459#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-06 23:44:26,431 INFO L193 IcfgInterpreter]: Reachable states at location L24-3 satisfy 158#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-06 23:44:27,267 INFO L211 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-06 23:44:27,267 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 25, 25, 11] total 77 [2019-10-06 23:44:27,268 INFO L442 AbstractCegarLoop]: Interpolant automaton has 77 states [2019-10-06 23:44:27,269 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 77 interpolants. [2019-10-06 23:44:27,271 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1366, Invalid=4486, Unknown=0, NotChecked=0, Total=5852 [2019-10-06 23:44:27,271 INFO L87 Difference]: Start difference. First operand 208 states and 218 transitions. Second operand 77 states. [2019-10-06 23:44:32,066 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-06 23:44:32,067 INFO L93 Difference]: Finished difference Result 430 states and 482 transitions. [2019-10-06 23:44:32,067 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 77 states. [2019-10-06 23:44:32,067 INFO L78 Accepts]: Start accepts. Automaton has 77 states. Word has length 204 [2019-10-06 23:44:32,067 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-06 23:44:32,069 INFO L225 Difference]: With dead ends: 430 [2019-10-06 23:44:32,069 INFO L226 Difference]: Without dead ends: 250 [2019-10-06 23:44:32,076 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 725 GetRequests, 578 SyntacticMatches, 0 SemanticMatches, 147 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5301 ImplicationChecksByTransitivity, 6.1s TimeCoverageRelationStatistics Valid=4130, Invalid=17922, Unknown=0, NotChecked=0, Total=22052 [2019-10-06 23:44:32,076 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 250 states. [2019-10-06 23:44:32,097 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 250 to 241. [2019-10-06 23:44:32,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 241 states. [2019-10-06 23:44:32,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 241 states to 241 states and 251 transitions. [2019-10-06 23:44:32,099 INFO L78 Accepts]: Start accepts. Automaton has 241 states and 251 transitions. Word has length 204 [2019-10-06 23:44:32,099 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-06 23:44:32,100 INFO L462 AbstractCegarLoop]: Abstraction has 241 states and 251 transitions. [2019-10-06 23:44:32,100 INFO L463 AbstractCegarLoop]: Interpolant automaton has 77 states. [2019-10-06 23:44:32,100 INFO L276 IsEmpty]: Start isEmpty. Operand 241 states and 251 transitions. [2019-10-06 23:44:32,103 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 238 [2019-10-06 23:44:32,103 INFO L377 BasicCegarLoop]: Found error trace [2019-10-06 23:44:32,103 INFO L385 BasicCegarLoop]: trace histogram [46, 19, 19, 19, 19, 19, 19, 19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-06 23:44:32,308 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-06 23:44:32,309 INFO L410 AbstractCegarLoop]: === Iteration 9 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-06 23:44:32,309 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-06 23:44:32,309 INFO L82 PathProgramCache]: Analyzing trace with hash -1883320159, now seen corresponding path program 7 times [2019-10-06 23:44:32,310 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-06 23:44:32,310 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-06 23:44:32,310 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-06 23:44:32,310 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-06 23:44:32,310 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-06 23:44:34,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-06 23:44:35,338 INFO L134 CoverageAnalysis]: Checked inductivity of 2791 backedges. 0 proven. 190 refuted. 0 times theorem prover too weak. 2601 trivial. 0 not checked. [2019-10-06 23:44:35,339 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-06 23:44:35,339 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2019-10-06 23:44:35,339 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-06 23:44:35,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-06 23:44:35,716 INFO L256 TraceCheckSpWp]: Trace formula consists of 1186 conjuncts, 48 conjunts are in the unsatisfiable core [2019-10-06 23:44:35,720 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-06 23:44:36,921 INFO L134 CoverageAnalysis]: Checked inductivity of 2791 backedges. 0 proven. 1081 refuted. 0 times theorem prover too weak. 1710 trivial. 0 not checked. [2019-10-06 23:44:36,921 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-06 23:44:39,779 INFO L134 CoverageAnalysis]: Checked inductivity of 2791 backedges. 0 proven. 1081 refuted. 0 times theorem prover too weak. 1710 trivial. 0 not checked. [2019-10-06 23:44:39,780 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2019-10-06 23:44:39,781 INFO L162 IcfgInterpreter]: Started Sifa with 21 locations of interest [2019-10-06 23:44:39,782 INFO L169 IcfgInterpreter]: Building call graph [2019-10-06 23:44:39,782 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-06 23:44:39,782 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-06 23:44:39,783 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-06 23:44:39,809 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 21 for LOIs [2019-10-06 23:44:41,750 INFO L199 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 29 for LOIs [2019-10-06 23:44:41,757 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 10 for LOIs [2019-10-06 23:44:41,760 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-06 23:44:41,760 INFO L191 IcfgInterpreter]: Final predicates for locations of interest are: [2019-10-06 23:44:41,761 INFO L193 IcfgInterpreter]: Reachable states at location L2 satisfy 479#(and (exists ((v_prenex_27 Int) (v_prenex_26 Int) (v_prenex_28 Int) (v_prenex_25 Int) (|v_main_~#a0~0.base_BEFORE_CALL_7| Int) (|v_main_~#a1~0.offset_BEFORE_CALL_7| Int) (|v_main_~#a0~0.offset_BEFORE_CALL_7| Int) (|v_main_~#a1~0.base_BEFORE_CALL_7| Int)) (or (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| v_prenex_25) v_prenex_27) (select (select |#memory_int| v_prenex_28) v_prenex_26)))) (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| |v_main_~#a0~0.base_BEFORE_CALL_7|) |v_main_~#a0~0.offset_BEFORE_CALL_7|) (select (select |#memory_int| |v_main_~#a1~0.base_BEFORE_CALL_7|) |v_main_~#a1~0.offset_BEFORE_CALL_7|))))) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-06 23:44:41,761 INFO L193 IcfgInterpreter]: Reachable states at location L36-3 satisfy 330#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-06 23:44:41,761 INFO L193 IcfgInterpreter]: Reachable states at location L2-1 satisfy 484#(and (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (exists ((v_prenex_27 Int) (v_prenex_26 Int) (v_prenex_28 Int) (v_prenex_25 Int) (|v_main_~#a0~0.base_BEFORE_CALL_7| Int) (|v_main_~#a1~0.offset_BEFORE_CALL_7| Int) (|v_main_~#a0~0.offset_BEFORE_CALL_7| Int) (|v_main_~#a1~0.base_BEFORE_CALL_7| Int)) (or (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| v_prenex_25) v_prenex_27) (select (select |#memory_int| v_prenex_28) v_prenex_26)))) (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| |v_main_~#a0~0.base_BEFORE_CALL_7|) |v_main_~#a0~0.offset_BEFORE_CALL_7|) (select (select |#memory_int| |v_main_~#a1~0.base_BEFORE_CALL_7|) |v_main_~#a1~0.offset_BEFORE_CALL_7|))))) (<= 0 __VERIFIER_assert_~cond) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-06 23:44:41,761 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initENTRY satisfy 493#(and (= |old(#NULL.base)| |#NULL.base|) (= |#valid| |old(#valid)|) (= |#NULL.offset| |old(#NULL.offset)|)) [2019-10-06 23:44:41,761 INFO L193 IcfgInterpreter]: Reachable states at location L16-3 satisfy 72#true [2019-10-06 23:44:41,762 INFO L193 IcfgInterpreter]: Reachable states at location L27-3 satisfy 201#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-06 23:44:41,762 INFO L193 IcfgInterpreter]: Reachable states at location L49-3 satisfy 464#(and (<= 100000 main_~a~0) (<= 0 main_~i~0) (= main_~x~0 0) (<= 100000 main_~i~0) (not (< main_~i~0 100000)) (<= main_~x~0 0) (<= 0 main_~x~0)) [2019-10-06 23:44:41,762 INFO L193 IcfgInterpreter]: Reachable states at location L39-3 satisfy 373#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-06 23:44:41,762 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION satisfy 489#(and (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (exists ((v_prenex_27 Int) (v_prenex_26 Int) (v_prenex_28 Int) (v_prenex_25 Int) (|v_main_~#a0~0.base_BEFORE_CALL_7| Int) (|v_main_~#a1~0.offset_BEFORE_CALL_7| Int) (|v_main_~#a0~0.offset_BEFORE_CALL_7| Int) (|v_main_~#a1~0.base_BEFORE_CALL_7| Int)) (or (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| v_prenex_25) v_prenex_27) (select (select |#memory_int| v_prenex_28) v_prenex_26)))) (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| |v_main_~#a0~0.base_BEFORE_CALL_7|) |v_main_~#a0~0.offset_BEFORE_CALL_7|) (select (select |#memory_int| |v_main_~#a1~0.base_BEFORE_CALL_7|) |v_main_~#a1~0.offset_BEFORE_CALL_7|))))) (<= 0 __VERIFIER_assert_~cond) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-06 23:44:41,763 INFO L193 IcfgInterpreter]: Reachable states at location L-1 satisfy 23#(and (= 0 |#NULL.base|) (<= |#NULL.base| 0) (= 0 (select |#valid| 0)) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-06 23:44:41,763 INFO L193 IcfgInterpreter]: Reachable states at location L30-3 satisfy 244#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-06 23:44:41,763 INFO L193 IcfgInterpreter]: Reachable states at location mainENTRY satisfy 33#(and (= 0 |#NULL.base|) (<= |#NULL.base| 0) (= |#valid| |old(#valid)|) (<= 0 |#NULL.base|) (= |#memory_int| |old(#memory_int)|) (= |#NULL.offset| 0) (= |old(#length)| |#length|) (= 0 (select |old(#valid)| 0)) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-06 23:44:41,763 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initEXIT satisfy 498#(and (= |#valid| (store |old(#valid)| 0 0)) (= 0 |#NULL.base|) (<= |#NULL.base| 0) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-06 23:44:41,763 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.startENTRY satisfy 6#true [2019-10-06 23:44:41,764 INFO L193 IcfgInterpreter]: Reachable states at location L42-3 satisfy 416#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-06 23:44:41,764 INFO L193 IcfgInterpreter]: Reachable states at location L50 satisfy 469#(and (<= 100000 main_~a~0) (< main_~x~0 100000) (= |main_#t~mem23| (select (select |#memory_int| |main_~#a0~0.base|) (+ (* 4 main_~x~0) |main_~#a0~0.offset|))) (<= 0 main_~i~0) (= main_~x~0 0) (<= 100000 main_~i~0) (= |main_#t~mem22| (select (select |#memory_int| |main_~#a1~0.base|) (+ (* 4 main_~x~0) |main_~#a1~0.offset|))) (not (< main_~i~0 100000)) (<= main_~x~0 0) (<= 0 main_~x~0)) [2019-10-06 23:44:41,764 INFO L193 IcfgInterpreter]: Reachable states at location L21-3 satisfy 115#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-06 23:44:41,764 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertENTRY satisfy 474#(exists ((v_prenex_27 Int) (v_prenex_26 Int) (v_prenex_28 Int) (v_prenex_25 Int) (|v_main_~#a0~0.base_BEFORE_CALL_7| Int) (|v_main_~#a1~0.offset_BEFORE_CALL_7| Int) (|v_main_~#a0~0.offset_BEFORE_CALL_7| Int) (|v_main_~#a1~0.base_BEFORE_CALL_7| Int)) (or (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| v_prenex_25) v_prenex_27) (select (select |#memory_int| v_prenex_28) v_prenex_26)))) (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| |v_main_~#a0~0.base_BEFORE_CALL_7|) |v_main_~#a0~0.offset_BEFORE_CALL_7|) (select (select |#memory_int| |v_main_~#a1~0.base_BEFORE_CALL_7|) |v_main_~#a1~0.offset_BEFORE_CALL_7|))))) [2019-10-06 23:44:41,764 INFO L193 IcfgInterpreter]: Reachable states at location L33-3 satisfy 287#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-06 23:44:41,764 INFO L193 IcfgInterpreter]: Reachable states at location L45-3 satisfy 459#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-06 23:44:41,765 INFO L193 IcfgInterpreter]: Reachable states at location L24-3 satisfy 158#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-06 23:44:42,431 INFO L211 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-06 23:44:42,431 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 49, 49, 11] total 126 [2019-10-06 23:44:42,433 INFO L442 AbstractCegarLoop]: Interpolant automaton has 126 states [2019-10-06 23:44:42,434 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 126 interpolants. [2019-10-06 23:44:42,444 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4819, Invalid=10931, Unknown=0, NotChecked=0, Total=15750 [2019-10-06 23:44:42,444 INFO L87 Difference]: Start difference. First operand 241 states and 251 transitions. Second operand 126 states. [2019-10-06 23:44:52,859 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-06 23:44:52,859 INFO L93 Difference]: Finished difference Result 496 states and 572 transitions. [2019-10-06 23:44:52,860 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 126 states. [2019-10-06 23:44:52,860 INFO L78 Accepts]: Start accepts. Automaton has 126 states. Word has length 237 [2019-10-06 23:44:52,861 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-06 23:44:52,862 INFO L225 Difference]: With dead ends: 496 [2019-10-06 23:44:52,862 INFO L226 Difference]: Without dead ends: 307 [2019-10-06 23:44:52,867 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 875 GetRequests, 630 SyntacticMatches, 0 SemanticMatches, 245 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13362 ImplicationChecksByTransitivity, 13.7s TimeCoverageRelationStatistics Valid=14491, Invalid=46271, Unknown=0, NotChecked=0, Total=60762 [2019-10-06 23:44:52,868 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 307 states. [2019-10-06 23:44:52,885 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 307 to 298. [2019-10-06 23:44:52,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 298 states. [2019-10-06 23:44:52,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 298 states to 298 states and 308 transitions. [2019-10-06 23:44:52,886 INFO L78 Accepts]: Start accepts. Automaton has 298 states and 308 transitions. Word has length 237 [2019-10-06 23:44:52,887 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-06 23:44:52,887 INFO L462 AbstractCegarLoop]: Abstraction has 298 states and 308 transitions. [2019-10-06 23:44:52,887 INFO L463 AbstractCegarLoop]: Interpolant automaton has 126 states. [2019-10-06 23:44:52,887 INFO L276 IsEmpty]: Start isEmpty. Operand 298 states and 308 transitions. [2019-10-06 23:44:52,890 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 295 [2019-10-06 23:44:52,890 INFO L377 BasicCegarLoop]: Found error trace [2019-10-06 23:44:52,891 INFO L385 BasicCegarLoop]: trace histogram [94, 20, 20, 20, 20, 20, 20, 20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-06 23:44:53,097 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-06 23:44:53,098 INFO L410 AbstractCegarLoop]: === Iteration 10 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-06 23:44:53,098 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-06 23:44:53,098 INFO L82 PathProgramCache]: Analyzing trace with hash 1285692883, now seen corresponding path program 8 times [2019-10-06 23:44:53,099 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-06 23:44:53,099 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-06 23:44:53,099 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-06 23:44:53,100 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-06 23:44:53,100 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-06 23:44:55,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-06 23:44:55,811 INFO L134 CoverageAnalysis]: Checked inductivity of 6355 backedges. 0 proven. 210 refuted. 0 times theorem prover too weak. 6145 trivial. 0 not checked. [2019-10-06 23:44:55,811 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-06 23:44:55,811 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2019-10-06 23:44:55,812 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true