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_copy1_ground-2.i -------------------------------------------------------------------------------- This is Ultimate 0.1.24-36ac518-m [2019-10-06 23:30:24,975 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-06 23:30:24,978 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-06 23:30:25,002 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-06 23:30:25,002 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-06 23:30:25,004 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-06 23:30:25,006 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-06 23:30:25,009 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-06 23:30:25,011 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-06 23:30:25,012 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-06 23:30:25,013 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-06 23:30:25,014 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-06 23:30:25,014 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-06 23:30:25,015 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-06 23:30:25,016 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-06 23:30:25,017 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-06 23:30:25,018 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-06 23:30:25,019 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-06 23:30:25,021 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-06 23:30:25,022 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-06 23:30:25,024 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-06 23:30:25,025 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-06 23:30:25,026 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-06 23:30:25,027 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-06 23:30:25,030 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-06 23:30:25,030 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-06 23:30:25,030 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-06 23:30:25,032 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-06 23:30:25,033 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-06 23:30:25,034 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-06 23:30:25,034 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-06 23:30:25,035 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-06 23:30:25,035 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-06 23:30:25,036 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-06 23:30:25,037 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-06 23:30:25,037 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-06 23:30:25,038 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-06 23:30:25,038 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-06 23:30:25,038 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-06 23:30:25,039 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-06 23:30:25,040 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-06 23:30:25,041 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:30:25,058 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-06 23:30:25,059 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-06 23:30:25,060 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-06 23:30:25,060 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-06 23:30:25,060 INFO L138 SettingsManager]: * Use SBE=true [2019-10-06 23:30:25,061 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-06 23:30:25,061 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-06 23:30:25,061 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-06 23:30:25,061 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-06 23:30:25,061 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-06 23:30:25,062 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-06 23:30:25,062 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-06 23:30:25,062 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-06 23:30:25,062 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-06 23:30:25,062 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-06 23:30:25,063 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-06 23:30:25,063 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-06 23:30:25,063 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-06 23:30:25,063 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-06 23:30:25,063 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-06 23:30:25,064 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-06 23:30:25,064 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-06 23:30:25,064 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-06 23:30:25,064 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-06 23:30:25,064 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-06 23:30:25,065 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-06 23:30:25,065 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-06 23:30:25,065 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-06 23:30:25,065 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:30:25,335 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-06 23:30:25,349 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-06 23:30:25,353 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-06 23:30:25,354 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-06 23:30:25,355 INFO L275 PluginConnector]: CDTParser initialized [2019-10-06 23:30:25,356 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-examples/standard_copy1_ground-2.i [2019-10-06 23:30:25,419 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/147831f07/c5f59f579a414181ab11fb60171a4afb/FLAGe2d8aa6f1 [2019-10-06 23:30:25,883 INFO L306 CDTParser]: Found 1 translation units. [2019-10-06 23:30:25,884 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/array-examples/standard_copy1_ground-2.i [2019-10-06 23:30:25,890 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/147831f07/c5f59f579a414181ab11fb60171a4afb/FLAGe2d8aa6f1 [2019-10-06 23:30:26,294 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/147831f07/c5f59f579a414181ab11fb60171a4afb [2019-10-06 23:30:26,306 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-06 23:30:26,307 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-06 23:30:26,308 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-06 23:30:26,308 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-06 23:30:26,312 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-06 23:30:26,313 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.10 11:30:26" (1/1) ... [2019-10-06 23:30:26,316 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@287e3a05 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.10 11:30:26, skipping insertion in model container [2019-10-06 23:30:26,316 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.10 11:30:26" (1/1) ... [2019-10-06 23:30:26,323 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-06 23:30:26,338 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-06 23:30:26,540 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-06 23:30:26,545 INFO L188 MainTranslator]: Completed pre-run [2019-10-06 23:30:26,567 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-06 23:30:26,588 INFO L192 MainTranslator]: Completed translation [2019-10-06 23:30:26,589 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.10 11:30:26 WrapperNode [2019-10-06 23:30:26,589 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-06 23:30:26,590 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-06 23:30:26,590 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-06 23:30:26,590 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-06 23:30:26,680 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.10 11:30:26" (1/1) ... [2019-10-06 23:30:26,681 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.10 11:30:26" (1/1) ... [2019-10-06 23:30:26,689 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.10 11:30:26" (1/1) ... [2019-10-06 23:30:26,690 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.10 11:30:26" (1/1) ... [2019-10-06 23:30:26,698 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.10 11:30:26" (1/1) ... [2019-10-06 23:30:26,704 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.10 11:30:26" (1/1) ... [2019-10-06 23:30:26,706 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.10 11:30:26" (1/1) ... [2019-10-06 23:30:26,715 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-06 23:30:26,716 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-06 23:30:26,717 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-06 23:30:26,717 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-06 23:30:26,718 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.10 11:30:26" (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:30:26,776 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-06 23:30:26,776 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-06 23:30:26,776 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2019-10-06 23:30:26,777 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-06 23:30:26,777 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-06 23:30:26,777 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2019-10-06 23:30:26,777 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-10-06 23:30:26,777 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-06 23:30:26,777 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-10-06 23:30:26,778 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-10-06 23:30:26,778 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-10-06 23:30:26,778 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-10-06 23:30:26,778 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-06 23:30:26,778 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-06 23:30:27,129 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-06 23:30:27,129 INFO L284 CfgBuilder]: Removed 3 assume(true) statements. [2019-10-06 23:30:27,130 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.10 11:30:27 BoogieIcfgContainer [2019-10-06 23:30:27,131 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-06 23:30:27,132 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-06 23:30:27,132 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-06 23:30:27,135 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-06 23:30:27,136 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.10 11:30:26" (1/3) ... [2019-10-06 23:30:27,137 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@448fb6cb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.10 11:30:27, skipping insertion in model container [2019-10-06 23:30:27,137 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.10 11:30:26" (2/3) ... [2019-10-06 23:30:27,137 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@448fb6cb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.10 11:30:27, skipping insertion in model container [2019-10-06 23:30:27,137 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.10 11:30:27" (3/3) ... [2019-10-06 23:30:27,139 INFO L109 eAbstractionObserver]: Analyzing ICFG standard_copy1_ground-2.i [2019-10-06 23:30:27,148 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-06 23:30:27,158 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-06 23:30:27,169 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-06 23:30:27,193 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-10-06 23:30:27,193 INFO L374 AbstractCegarLoop]: Hoare is true [2019-10-06 23:30:27,193 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-06 23:30:27,194 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-06 23:30:27,194 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-06 23:30:27,194 INFO L378 AbstractCegarLoop]: Difference is false [2019-10-06 23:30:27,194 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-06 23:30:27,194 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-06 23:30:27,209 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states. [2019-10-06 23:30:27,214 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-10-06 23:30:27,214 INFO L377 BasicCegarLoop]: Found error trace [2019-10-06 23:30:27,215 INFO L385 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-06 23:30:27,217 INFO L410 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-06 23:30:27,222 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-06 23:30:27,222 INFO L82 PathProgramCache]: Analyzing trace with hash 1524454115, now seen corresponding path program 1 times [2019-10-06 23:30:27,229 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-06 23:30:27,229 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-06 23:30:27,229 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-06 23:30:27,229 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-06 23:30:27,229 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-06 23:30:27,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-06 23:30:27,401 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:30:27,402 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-06 23:30:27,402 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-06 23:30:27,402 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-06 23:30:27,406 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-06 23:30:27,421 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-06 23:30:27,422 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-06 23:30:27,424 INFO L87 Difference]: Start difference. First operand 19 states. Second operand 3 states. [2019-10-06 23:30:27,468 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-06 23:30:27,469 INFO L93 Difference]: Finished difference Result 33 states and 40 transitions. [2019-10-06 23:30:27,470 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-06 23:30:27,473 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 12 [2019-10-06 23:30:27,474 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-06 23:30:27,484 INFO L225 Difference]: With dead ends: 33 [2019-10-06 23:30:27,485 INFO L226 Difference]: Without dead ends: 17 [2019-10-06 23:30:27,489 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:30:27,504 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2019-10-06 23:30:27,520 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2019-10-06 23:30:27,522 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2019-10-06 23:30:27,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 19 transitions. [2019-10-06 23:30:27,525 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 19 transitions. Word has length 12 [2019-10-06 23:30:27,525 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-06 23:30:27,525 INFO L462 AbstractCegarLoop]: Abstraction has 17 states and 19 transitions. [2019-10-06 23:30:27,526 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-06 23:30:27,526 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 19 transitions. [2019-10-06 23:30:27,527 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-10-06 23:30:27,527 INFO L377 BasicCegarLoop]: Found error trace [2019-10-06 23:30:27,527 INFO L385 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-06 23:30:27,528 INFO L410 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-06 23:30:27,528 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-06 23:30:27,528 INFO L82 PathProgramCache]: Analyzing trace with hash -32570220, now seen corresponding path program 1 times [2019-10-06 23:30:27,529 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-06 23:30:27,529 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-06 23:30:27,529 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-06 23:30:27,529 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-06 23:30:27,530 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-06 23:30:27,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-06 23:30:27,594 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:30:27,594 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-06 23:30:27,595 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-06 23:30:27,595 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-06 23:30:27,597 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-06 23:30:27,597 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-06 23:30:27,598 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-06 23:30:27,598 INFO L87 Difference]: Start difference. First operand 17 states and 19 transitions. Second operand 3 states. [2019-10-06 23:30:27,607 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-06 23:30:27,608 INFO L93 Difference]: Finished difference Result 27 states and 30 transitions. [2019-10-06 23:30:27,608 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-06 23:30:27,609 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2019-10-06 23:30:27,609 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-06 23:30:27,610 INFO L225 Difference]: With dead ends: 27 [2019-10-06 23:30:27,610 INFO L226 Difference]: Without dead ends: 18 [2019-10-06 23:30:27,611 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:30:27,612 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2019-10-06 23:30:27,615 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2019-10-06 23:30:27,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2019-10-06 23:30:27,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 20 transitions. [2019-10-06 23:30:27,617 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 20 transitions. Word has length 13 [2019-10-06 23:30:27,617 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-06 23:30:27,617 INFO L462 AbstractCegarLoop]: Abstraction has 18 states and 20 transitions. [2019-10-06 23:30:27,618 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-06 23:30:27,618 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 20 transitions. [2019-10-06 23:30:27,618 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-10-06 23:30:27,619 INFO L377 BasicCegarLoop]: Found error trace [2019-10-06 23:30:27,619 INFO L385 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-06 23:30:27,619 INFO L410 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-06 23:30:27,619 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-06 23:30:27,620 INFO L82 PathProgramCache]: Analyzing trace with hash 1459604560, now seen corresponding path program 1 times [2019-10-06 23:30:27,620 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-06 23:30:27,620 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-06 23:30:27,620 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-06 23:30:27,621 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-06 23:30:27,621 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-06 23:30:27,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-06 23:30:27,710 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-10-06 23:30:27,711 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-06 23:30:27,711 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2019-10-06 23:30:27,711 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:30:27,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-06 23:30:27,773 INFO L256 TraceCheckSpWp]: Trace formula consists of 74 conjuncts, 3 conjunts are in the unsatisfiable core [2019-10-06 23:30:27,779 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-06 23:30:27,821 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-10-06 23:30:27,824 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-06 23:30:27,861 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-10-06 23:30:27,862 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2019-10-06 23:30:27,889 INFO L162 IcfgInterpreter]: Started Sifa with 13 locations of interest [2019-10-06 23:30:27,889 INFO L169 IcfgInterpreter]: Building call graph [2019-10-06 23:30:27,896 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-06 23:30:27,905 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-06 23:30:27,906 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-06 23:30:28,129 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 21 for LOIs [2019-10-06 23:30:28,543 INFO L199 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 29 for LOIs [2019-10-06 23:30:28,559 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 10 for LOIs [2019-10-06 23:30:28,566 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-06 23:30:28,566 INFO L191 IcfgInterpreter]: Final predicates for locations of interest are: [2019-10-06 23:30:28,567 INFO L193 IcfgInterpreter]: Reachable states at location L2 satisfy 130#(and (exists ((v_prenex_4 Int) (|v_main_~#a1~0.base_BEFORE_CALL_1| Int) (|v_main_~#a1~0.offset_BEFORE_CALL_1| Int) (|v_main_~#a2~0.base_BEFORE_CALL_1| Int) (v_prenex_2 Int) (v_prenex_3 Int) (v_prenex_1 Int) (|v_main_~#a2~0.offset_BEFORE_CALL_1| Int)) (or (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| v_prenex_1) v_prenex_2) (select (select |#memory_int| v_prenex_3) v_prenex_4))) (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_~#a2~0.base_BEFORE_CALL_1|) |v_main_~#a2~0.offset_BEFORE_CALL_1|)))))) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-06 23:30:28,567 INFO L193 IcfgInterpreter]: Reachable states at location L2-1 satisfy 135#(and (<= __VERIFIER_assert_~cond 0) (exists ((v_prenex_4 Int) (|v_main_~#a1~0.base_BEFORE_CALL_1| Int) (|v_main_~#a1~0.offset_BEFORE_CALL_1| Int) (|v_main_~#a2~0.base_BEFORE_CALL_1| Int) (v_prenex_2 Int) (v_prenex_3 Int) (v_prenex_1 Int) (|v_main_~#a2~0.offset_BEFORE_CALL_1| Int)) (or (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| v_prenex_1) v_prenex_2) (select (select |#memory_int| v_prenex_3) v_prenex_4))) (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_~#a2~0.base_BEFORE_CALL_1|) |v_main_~#a2~0.offset_BEFORE_CALL_1|)))))) (<= 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:30:28,567 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initENTRY satisfy 144#(and (= |old(#NULL.base)| |#NULL.base|) (= |#valid| |old(#valid)|) (= |#NULL.offset| |old(#NULL.offset)|)) [2019-10-06 23:30:28,568 INFO L193 IcfgInterpreter]: Reachable states at location L17-3 satisfy 115#(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:30:28,568 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION satisfy 140#(and (<= __VERIFIER_assert_~cond 0) (exists ((v_prenex_4 Int) (|v_main_~#a1~0.base_BEFORE_CALL_1| Int) (|v_main_~#a1~0.offset_BEFORE_CALL_1| Int) (|v_main_~#a2~0.base_BEFORE_CALL_1| Int) (v_prenex_2 Int) (v_prenex_3 Int) (v_prenex_1 Int) (|v_main_~#a2~0.offset_BEFORE_CALL_1| Int)) (or (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| v_prenex_1) v_prenex_2) (select (select |#memory_int| v_prenex_3) v_prenex_4))) (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_~#a2~0.base_BEFORE_CALL_1|) |v_main_~#a2~0.offset_BEFORE_CALL_1|)))))) (<= 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:30:28,568 INFO L193 IcfgInterpreter]: Reachable states at location L8-3 satisfy 72#true [2019-10-06 23:30:28,569 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:30:28,569 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:30:28,569 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initEXIT satisfy 149#(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:30:28,569 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.startENTRY satisfy 6#true [2019-10-06 23:30:28,570 INFO L193 IcfgInterpreter]: Reachable states at location L18 satisfy 120#(and (<= 100000 main_~a~0) (< main_~x~0 100000) (<= 0 main_~i~0) (= main_~x~0 0) (<= 100000 main_~i~0) (not (< main_~i~0 100000)) (= |main_#t~mem7| (select (select |#memory_int| |main_~#a2~0.base|) (+ (* 4 main_~x~0) |main_~#a2~0.offset|))) (<= main_~x~0 0) (<= 0 main_~x~0) (= (select (select |#memory_int| |main_~#a1~0.base|) (+ (* 4 main_~x~0) |main_~#a1~0.offset|)) |main_#t~mem6|)) [2019-10-06 23:30:28,570 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertENTRY satisfy 125#(exists ((v_prenex_4 Int) (|v_main_~#a1~0.base_BEFORE_CALL_1| Int) (|v_main_~#a1~0.offset_BEFORE_CALL_1| Int) (|v_main_~#a2~0.base_BEFORE_CALL_1| Int) (v_prenex_2 Int) (v_prenex_3 Int) (v_prenex_1 Int) (|v_main_~#a2~0.offset_BEFORE_CALL_1| Int)) (or (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| v_prenex_1) v_prenex_2) (select (select |#memory_int| v_prenex_3) v_prenex_4))) (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_~#a2~0.base_BEFORE_CALL_1|) |v_main_~#a2~0.offset_BEFORE_CALL_1|)))))) [2019-10-06 23:30:28,570 INFO L193 IcfgInterpreter]: Reachable states at location L13-3 satisfy 110#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-06 23:30:28,897 INFO L211 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-06 23:30:28,897 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4, 11] total 17 [2019-10-06 23:30:28,899 INFO L442 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-10-06 23:30:28,899 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-10-06 23:30:28,900 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=222, Unknown=0, NotChecked=0, Total=272 [2019-10-06 23:30:28,900 INFO L87 Difference]: Start difference. First operand 18 states and 20 transitions. Second operand 17 states. [2019-10-06 23:30:29,467 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-06 23:30:29,468 INFO L93 Difference]: Finished difference Result 41 states and 47 transitions. [2019-10-06 23:30:29,469 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-10-06 23:30:29,469 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 14 [2019-10-06 23:30:29,469 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-06 23:30:29,470 INFO L225 Difference]: With dead ends: 41 [2019-10-06 23:30:29,471 INFO L226 Difference]: Without dead ends: 30 [2019-10-06 23:30:29,472 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 174 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=133, Invalid=623, Unknown=0, NotChecked=0, Total=756 [2019-10-06 23:30:29,474 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2019-10-06 23:30:29,485 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 21. [2019-10-06 23:30:29,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2019-10-06 23:30:29,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 23 transitions. [2019-10-06 23:30:29,487 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 23 transitions. Word has length 14 [2019-10-06 23:30:29,487 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-06 23:30:29,487 INFO L462 AbstractCegarLoop]: Abstraction has 21 states and 23 transitions. [2019-10-06 23:30:29,488 INFO L463 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-10-06 23:30:29,488 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 23 transitions. [2019-10-06 23:30:29,489 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-10-06 23:30:29,489 INFO L377 BasicCegarLoop]: Found error trace [2019-10-06 23:30:29,489 INFO L385 BasicCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-06 23:30:29,692 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-06 23:30:29,693 INFO L410 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-06 23:30:29,693 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-06 23:30:29,693 INFO L82 PathProgramCache]: Analyzing trace with hash 1932553121, now seen corresponding path program 2 times [2019-10-06 23:30:29,694 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-06 23:30:29,694 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-06 23:30:29,694 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-06 23:30:29,694 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-06 23:30:29,694 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-06 23:30:29,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-06 23:30:29,781 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-10-06 23:30:29,781 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-06 23:30:29,782 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2019-10-06 23:30:29,782 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:30:29,843 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2019-10-06 23:30:29,844 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-06 23:30:29,845 INFO L256 TraceCheckSpWp]: Trace formula consists of 82 conjuncts, 3 conjunts are in the unsatisfiable core [2019-10-06 23:30:29,846 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-06 23:30:29,856 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-10-06 23:30:29,856 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-06 23:30:29,879 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-10-06 23:30:29,879 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2019-10-06 23:30:29,881 INFO L162 IcfgInterpreter]: Started Sifa with 13 locations of interest [2019-10-06 23:30:29,881 INFO L169 IcfgInterpreter]: Building call graph [2019-10-06 23:30:29,882 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-06 23:30:29,882 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-06 23:30:29,882 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-06 23:30:29,940 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 21 for LOIs [2019-10-06 23:30:30,202 INFO L199 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 29 for LOIs [2019-10-06 23:30:30,228 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 10 for LOIs [2019-10-06 23:30:30,236 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-06 23:30:30,237 INFO L191 IcfgInterpreter]: Final predicates for locations of interest are: [2019-10-06 23:30:30,237 INFO L193 IcfgInterpreter]: Reachable states at location L2 satisfy 130#(and (exists ((v_prenex_6 Int) (v_prenex_7 Int) (v_prenex_5 Int) (|v_main_~#a1~0.base_BEFORE_CALL_2| Int) (|v_main_~#a1~0.offset_BEFORE_CALL_2| Int) (|v_main_~#a2~0.base_BEFORE_CALL_2| Int) (|v_main_~#a2~0.offset_BEFORE_CALL_2| Int) (v_prenex_8 Int)) (or (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| v_prenex_5) v_prenex_6) (select (select |#memory_int| v_prenex_7) v_prenex_8))) (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (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_~#a2~0.base_BEFORE_CALL_2|) |v_main_~#a2~0.offset_BEFORE_CALL_2|)))))) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-06 23:30:30,238 INFO L193 IcfgInterpreter]: Reachable states at location L2-1 satisfy 135#(and (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (exists ((v_prenex_6 Int) (v_prenex_7 Int) (v_prenex_5 Int) (|v_main_~#a1~0.base_BEFORE_CALL_2| Int) (|v_main_~#a1~0.offset_BEFORE_CALL_2| Int) (|v_main_~#a2~0.base_BEFORE_CALL_2| Int) (|v_main_~#a2~0.offset_BEFORE_CALL_2| Int) (v_prenex_8 Int)) (or (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| v_prenex_5) v_prenex_6) (select (select |#memory_int| v_prenex_7) v_prenex_8))) (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (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_~#a2~0.base_BEFORE_CALL_2|) |v_main_~#a2~0.offset_BEFORE_CALL_2|)))))) (<= 0 __VERIFIER_assert_~cond) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-06 23:30:30,242 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initENTRY satisfy 144#(and (= |old(#NULL.base)| |#NULL.base|) (= |#valid| |old(#valid)|) (= |#NULL.offset| |old(#NULL.offset)|)) [2019-10-06 23:30:30,243 INFO L193 IcfgInterpreter]: Reachable states at location L17-3 satisfy 115#(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:30:30,243 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION satisfy 140#(and (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (exists ((v_prenex_6 Int) (v_prenex_7 Int) (v_prenex_5 Int) (|v_main_~#a1~0.base_BEFORE_CALL_2| Int) (|v_main_~#a1~0.offset_BEFORE_CALL_2| Int) (|v_main_~#a2~0.base_BEFORE_CALL_2| Int) (|v_main_~#a2~0.offset_BEFORE_CALL_2| Int) (v_prenex_8 Int)) (or (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| v_prenex_5) v_prenex_6) (select (select |#memory_int| v_prenex_7) v_prenex_8))) (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (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_~#a2~0.base_BEFORE_CALL_2|) |v_main_~#a2~0.offset_BEFORE_CALL_2|)))))) (<= 0 __VERIFIER_assert_~cond) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-06 23:30:30,243 INFO L193 IcfgInterpreter]: Reachable states at location L8-3 satisfy 72#true [2019-10-06 23:30:30,244 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:30:30,244 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:30:30,245 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initEXIT satisfy 149#(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:30:30,246 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.startENTRY satisfy 6#true [2019-10-06 23:30:30,246 INFO L193 IcfgInterpreter]: Reachable states at location L18 satisfy 120#(and (<= 100000 main_~a~0) (< main_~x~0 100000) (<= 0 main_~i~0) (= main_~x~0 0) (<= 100000 main_~i~0) (not (< main_~i~0 100000)) (= |main_#t~mem7| (select (select |#memory_int| |main_~#a2~0.base|) (+ (* 4 main_~x~0) |main_~#a2~0.offset|))) (<= main_~x~0 0) (<= 0 main_~x~0) (= (select (select |#memory_int| |main_~#a1~0.base|) (+ (* 4 main_~x~0) |main_~#a1~0.offset|)) |main_#t~mem6|)) [2019-10-06 23:30:30,246 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertENTRY satisfy 125#(exists ((v_prenex_6 Int) (v_prenex_7 Int) (v_prenex_5 Int) (|v_main_~#a1~0.base_BEFORE_CALL_2| Int) (|v_main_~#a1~0.offset_BEFORE_CALL_2| Int) (|v_main_~#a2~0.base_BEFORE_CALL_2| Int) (|v_main_~#a2~0.offset_BEFORE_CALL_2| Int) (v_prenex_8 Int)) (or (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| v_prenex_5) v_prenex_6) (select (select |#memory_int| v_prenex_7) v_prenex_8))) (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (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_~#a2~0.base_BEFORE_CALL_2|) |v_main_~#a2~0.offset_BEFORE_CALL_2|)))))) [2019-10-06 23:30:30,247 INFO L193 IcfgInterpreter]: Reachable states at location L13-3 satisfy 110#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-06 23:30:30,562 INFO L211 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-06 23:30:30,563 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4, 11] total 17 [2019-10-06 23:30:30,564 INFO L442 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-10-06 23:30:30,564 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-10-06 23:30:30,565 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=222, Unknown=0, NotChecked=0, Total=272 [2019-10-06 23:30:30,565 INFO L87 Difference]: Start difference. First operand 21 states and 23 transitions. Second operand 17 states. [2019-10-06 23:30:31,110 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-06 23:30:31,110 INFO L93 Difference]: Finished difference Result 42 states and 47 transitions. [2019-10-06 23:30:31,111 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-10-06 23:30:31,111 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 17 [2019-10-06 23:30:31,111 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-06 23:30:31,112 INFO L225 Difference]: With dead ends: 42 [2019-10-06 23:30:31,112 INFO L226 Difference]: Without dead ends: 33 [2019-10-06 23:30:31,113 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 170 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=141, Invalid=615, Unknown=0, NotChecked=0, Total=756 [2019-10-06 23:30:31,113 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2019-10-06 23:30:31,118 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 24. [2019-10-06 23:30:31,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2019-10-06 23:30:31,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 26 transitions. [2019-10-06 23:30:31,119 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 26 transitions. Word has length 17 [2019-10-06 23:30:31,120 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-06 23:30:31,120 INFO L462 AbstractCegarLoop]: Abstraction has 24 states and 26 transitions. [2019-10-06 23:30:31,120 INFO L463 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-10-06 23:30:31,120 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 26 transitions. [2019-10-06 23:30:31,121 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-10-06 23:30:31,121 INFO L377 BasicCegarLoop]: Found error trace [2019-10-06 23:30:31,121 INFO L385 BasicCegarLoop]: trace histogram [4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-06 23:30:31,322 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-06 23:30:31,322 INFO L410 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-06 23:30:31,323 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-06 23:30:31,323 INFO L82 PathProgramCache]: Analyzing trace with hash -1776490845, now seen corresponding path program 3 times [2019-10-06 23:30:31,323 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-06 23:30:31,324 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-06 23:30:31,324 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-06 23:30:31,324 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-06 23:30:31,325 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-06 23:30:31,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-06 23:30:31,446 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-10-06 23:30:31,446 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-06 23:30:31,447 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2019-10-06 23:30:31,447 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:30:31,498 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-10-06 23:30:31,498 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-06 23:30:31,499 INFO L256 TraceCheckSpWp]: Trace formula consists of 110 conjuncts, 6 conjunts are in the unsatisfiable core [2019-10-06 23:30:31,501 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-06 23:30:31,546 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-10-06 23:30:31,546 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-06 23:30:31,614 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-10-06 23:30:31,615 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2019-10-06 23:30:31,616 INFO L162 IcfgInterpreter]: Started Sifa with 13 locations of interest [2019-10-06 23:30:31,616 INFO L169 IcfgInterpreter]: Building call graph [2019-10-06 23:30:31,617 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-06 23:30:31,617 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-06 23:30:31,617 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-06 23:30:31,647 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 21 for LOIs [2019-10-06 23:30:31,843 INFO L199 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 29 for LOIs [2019-10-06 23:30:31,857 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 10 for LOIs [2019-10-06 23:30:31,863 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-06 23:30:31,863 INFO L191 IcfgInterpreter]: Final predicates for locations of interest are: [2019-10-06 23:30:31,864 INFO L193 IcfgInterpreter]: Reachable states at location L2 satisfy 130#(and (exists ((|v_main_~#a1~0.base_BEFORE_CALL_3| Int) (v_prenex_12 Int) (|v_main_~#a2~0.base_BEFORE_CALL_3| Int) (|v_main_~#a2~0.offset_BEFORE_CALL_3| Int) (v_prenex_11 Int) (v_prenex_10 Int) (|v_main_~#a1~0.offset_BEFORE_CALL_3| Int) (v_prenex_9 Int)) (or (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| |v_main_~#a2~0.base_BEFORE_CALL_3|) |v_main_~#a2~0.offset_BEFORE_CALL_3|) (select (select |#memory_int| |v_main_~#a1~0.base_BEFORE_CALL_3|) |v_main_~#a1~0.offset_BEFORE_CALL_3|)))) (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| v_prenex_10) v_prenex_11) (select (select |#memory_int| v_prenex_9) v_prenex_12))))) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-06 23:30:31,865 INFO L193 IcfgInterpreter]: Reachable states at location L2-1 satisfy 135#(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_main_~#a2~0.base_BEFORE_CALL_3| Int) (|v_main_~#a2~0.offset_BEFORE_CALL_3| Int) (v_prenex_11 Int) (v_prenex_10 Int) (|v_main_~#a1~0.offset_BEFORE_CALL_3| Int) (v_prenex_9 Int)) (or (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| |v_main_~#a2~0.base_BEFORE_CALL_3|) |v_main_~#a2~0.offset_BEFORE_CALL_3|) (select (select |#memory_int| |v_main_~#a1~0.base_BEFORE_CALL_3|) |v_main_~#a1~0.offset_BEFORE_CALL_3|)))) (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| v_prenex_10) v_prenex_11) (select (select |#memory_int| v_prenex_9) v_prenex_12))))) (<= 0 __VERIFIER_assert_~cond) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-06 23:30:31,865 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initENTRY satisfy 144#(and (= |old(#NULL.base)| |#NULL.base|) (= |#valid| |old(#valid)|) (= |#NULL.offset| |old(#NULL.offset)|)) [2019-10-06 23:30:31,865 INFO L193 IcfgInterpreter]: Reachable states at location L17-3 satisfy 115#(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:30:31,868 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION satisfy 140#(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_main_~#a2~0.base_BEFORE_CALL_3| Int) (|v_main_~#a2~0.offset_BEFORE_CALL_3| Int) (v_prenex_11 Int) (v_prenex_10 Int) (|v_main_~#a1~0.offset_BEFORE_CALL_3| Int) (v_prenex_9 Int)) (or (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| |v_main_~#a2~0.base_BEFORE_CALL_3|) |v_main_~#a2~0.offset_BEFORE_CALL_3|) (select (select |#memory_int| |v_main_~#a1~0.base_BEFORE_CALL_3|) |v_main_~#a1~0.offset_BEFORE_CALL_3|)))) (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| v_prenex_10) v_prenex_11) (select (select |#memory_int| v_prenex_9) v_prenex_12))))) (<= 0 __VERIFIER_assert_~cond) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-06 23:30:31,868 INFO L193 IcfgInterpreter]: Reachable states at location L8-3 satisfy 72#true [2019-10-06 23:30:31,869 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:30:31,869 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:30:31,869 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initEXIT satisfy 149#(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:30:31,869 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.startENTRY satisfy 6#true [2019-10-06 23:30:31,869 INFO L193 IcfgInterpreter]: Reachable states at location L18 satisfy 120#(and (<= 100000 main_~a~0) (< main_~x~0 100000) (<= 0 main_~i~0) (= main_~x~0 0) (<= 100000 main_~i~0) (not (< main_~i~0 100000)) (= |main_#t~mem7| (select (select |#memory_int| |main_~#a2~0.base|) (+ (* 4 main_~x~0) |main_~#a2~0.offset|))) (<= main_~x~0 0) (<= 0 main_~x~0) (= (select (select |#memory_int| |main_~#a1~0.base|) (+ (* 4 main_~x~0) |main_~#a1~0.offset|)) |main_#t~mem6|)) [2019-10-06 23:30:31,870 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertENTRY satisfy 125#(exists ((|v_main_~#a1~0.base_BEFORE_CALL_3| Int) (v_prenex_12 Int) (|v_main_~#a2~0.base_BEFORE_CALL_3| Int) (|v_main_~#a2~0.offset_BEFORE_CALL_3| Int) (v_prenex_11 Int) (v_prenex_10 Int) (|v_main_~#a1~0.offset_BEFORE_CALL_3| Int) (v_prenex_9 Int)) (or (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| |v_main_~#a2~0.base_BEFORE_CALL_3|) |v_main_~#a2~0.offset_BEFORE_CALL_3|) (select (select |#memory_int| |v_main_~#a1~0.base_BEFORE_CALL_3|) |v_main_~#a1~0.offset_BEFORE_CALL_3|)))) (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| v_prenex_10) v_prenex_11) (select (select |#memory_int| v_prenex_9) v_prenex_12))))) [2019-10-06 23:30:31,870 INFO L193 IcfgInterpreter]: Reachable states at location L13-3 satisfy 110#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-06 23:30:32,192 INFO L211 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-06 23:30:32,192 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7, 11] total 27 [2019-10-06 23:30:32,193 INFO L442 AbstractCegarLoop]: Interpolant automaton has 27 states [2019-10-06 23:30:32,194 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2019-10-06 23:30:32,194 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=115, Invalid=587, Unknown=0, NotChecked=0, Total=702 [2019-10-06 23:30:32,195 INFO L87 Difference]: Start difference. First operand 24 states and 26 transitions. Second operand 27 states. [2019-10-06 23:30:33,153 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-06 23:30:33,153 INFO L93 Difference]: Finished difference Result 54 states and 64 transitions. [2019-10-06 23:30:33,155 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-10-06 23:30:33,156 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 20 [2019-10-06 23:30:33,156 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-06 23:30:33,157 INFO L225 Difference]: With dead ends: 54 [2019-10-06 23:30:33,157 INFO L226 Difference]: Without dead ends: 40 [2019-10-06 23:30:33,160 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 573 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=349, Invalid=2003, Unknown=0, NotChecked=0, Total=2352 [2019-10-06 23:30:33,161 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2019-10-06 23:30:33,168 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 31. [2019-10-06 23:30:33,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2019-10-06 23:30:33,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 33 transitions. [2019-10-06 23:30:33,171 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 33 transitions. Word has length 20 [2019-10-06 23:30:33,171 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-06 23:30:33,171 INFO L462 AbstractCegarLoop]: Abstraction has 31 states and 33 transitions. [2019-10-06 23:30:33,172 INFO L463 AbstractCegarLoop]: Interpolant automaton has 27 states. [2019-10-06 23:30:33,172 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 33 transitions. [2019-10-06 23:30:33,173 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-10-06 23:30:33,173 INFO L377 BasicCegarLoop]: Found error trace [2019-10-06 23:30:33,173 INFO L385 BasicCegarLoop]: trace histogram [10, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-06 23:30:33,376 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-06 23:30:33,377 INFO L410 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-06 23:30:33,377 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-06 23:30:33,378 INFO L82 PathProgramCache]: Analyzing trace with hash 254692801, now seen corresponding path program 4 times [2019-10-06 23:30:33,378 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-06 23:30:33,378 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-06 23:30:33,379 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-06 23:30:33,379 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-06 23:30:33,379 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-06 23:30:33,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-06 23:30:33,503 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2019-10-06 23:30:33,504 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-06 23:30:33,504 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2019-10-06 23:30:33,504 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:30:33,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-06 23:30:33,601 INFO L256 TraceCheckSpWp]: Trace formula consists of 162 conjuncts, 12 conjunts are in the unsatisfiable core [2019-10-06 23:30:33,603 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-06 23:30:33,713 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2019-10-06 23:30:33,713 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-06 23:30:33,921 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2019-10-06 23:30:33,921 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2019-10-06 23:30:33,923 INFO L162 IcfgInterpreter]: Started Sifa with 13 locations of interest [2019-10-06 23:30:33,923 INFO L169 IcfgInterpreter]: Building call graph [2019-10-06 23:30:33,924 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-06 23:30:33,924 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-06 23:30:33,924 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-06 23:30:33,948 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 21 for LOIs [2019-10-06 23:30:34,153 INFO L199 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 29 for LOIs [2019-10-06 23:30:34,164 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 10 for LOIs [2019-10-06 23:30:34,173 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-06 23:30:34,173 INFO L191 IcfgInterpreter]: Final predicates for locations of interest are: [2019-10-06 23:30:34,174 INFO L193 IcfgInterpreter]: Reachable states at location L2 satisfy 130#(and (exists ((v_prenex_16 Int) (v_prenex_15 Int) (|v_main_~#a1~0.base_BEFORE_CALL_4| Int) (v_prenex_14 Int) (|v_main_~#a2~0.base_BEFORE_CALL_4| Int) (v_prenex_13 Int) (|v_main_~#a2~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_13) v_prenex_16) (select (select |#memory_int| v_prenex_14) v_prenex_15)))) (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| |v_main_~#a1~0.base_BEFORE_CALL_4|) |v_main_~#a1~0.offset_BEFORE_CALL_4|) (select (select |#memory_int| |v_main_~#a2~0.base_BEFORE_CALL_4|) |v_main_~#a2~0.offset_BEFORE_CALL_4|))))) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-06 23:30:34,174 INFO L193 IcfgInterpreter]: Reachable states at location L2-1 satisfy 135#(and (exists ((v_prenex_16 Int) (v_prenex_15 Int) (|v_main_~#a1~0.base_BEFORE_CALL_4| Int) (v_prenex_14 Int) (|v_main_~#a2~0.base_BEFORE_CALL_4| Int) (v_prenex_13 Int) (|v_main_~#a2~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_13) v_prenex_16) (select (select |#memory_int| v_prenex_14) v_prenex_15)))) (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| |v_main_~#a1~0.base_BEFORE_CALL_4|) |v_main_~#a1~0.offset_BEFORE_CALL_4|) (select (select |#memory_int| |v_main_~#a2~0.base_BEFORE_CALL_4|) |v_main_~#a2~0.offset_BEFORE_CALL_4|))))) (<= __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:30:34,174 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initENTRY satisfy 144#(and (= |old(#NULL.base)| |#NULL.base|) (= |#valid| |old(#valid)|) (= |#NULL.offset| |old(#NULL.offset)|)) [2019-10-06 23:30:34,175 INFO L193 IcfgInterpreter]: Reachable states at location L17-3 satisfy 115#(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:30:34,175 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION satisfy 140#(and (exists ((v_prenex_16 Int) (v_prenex_15 Int) (|v_main_~#a1~0.base_BEFORE_CALL_4| Int) (v_prenex_14 Int) (|v_main_~#a2~0.base_BEFORE_CALL_4| Int) (v_prenex_13 Int) (|v_main_~#a2~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_13) v_prenex_16) (select (select |#memory_int| v_prenex_14) v_prenex_15)))) (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| |v_main_~#a1~0.base_BEFORE_CALL_4|) |v_main_~#a1~0.offset_BEFORE_CALL_4|) (select (select |#memory_int| |v_main_~#a2~0.base_BEFORE_CALL_4|) |v_main_~#a2~0.offset_BEFORE_CALL_4|))))) (<= __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:30:34,176 INFO L193 IcfgInterpreter]: Reachable states at location L8-3 satisfy 72#true [2019-10-06 23:30:34,176 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:30:34,176 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:30:34,176 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initEXIT satisfy 149#(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:30:34,176 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.startENTRY satisfy 6#true [2019-10-06 23:30:34,177 INFO L193 IcfgInterpreter]: Reachable states at location L18 satisfy 120#(and (<= 100000 main_~a~0) (< main_~x~0 100000) (<= 0 main_~i~0) (= main_~x~0 0) (<= 100000 main_~i~0) (not (< main_~i~0 100000)) (= |main_#t~mem7| (select (select |#memory_int| |main_~#a2~0.base|) (+ (* 4 main_~x~0) |main_~#a2~0.offset|))) (<= main_~x~0 0) (<= 0 main_~x~0) (= (select (select |#memory_int| |main_~#a1~0.base|) (+ (* 4 main_~x~0) |main_~#a1~0.offset|)) |main_#t~mem6|)) [2019-10-06 23:30:34,177 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertENTRY satisfy 125#(exists ((v_prenex_16 Int) (v_prenex_15 Int) (|v_main_~#a1~0.base_BEFORE_CALL_4| Int) (v_prenex_14 Int) (|v_main_~#a2~0.base_BEFORE_CALL_4| Int) (v_prenex_13 Int) (|v_main_~#a2~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_13) v_prenex_16) (select (select |#memory_int| v_prenex_14) v_prenex_15)))) (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| |v_main_~#a1~0.base_BEFORE_CALL_4|) |v_main_~#a1~0.offset_BEFORE_CALL_4|) (select (select |#memory_int| |v_main_~#a2~0.base_BEFORE_CALL_4|) |v_main_~#a2~0.offset_BEFORE_CALL_4|))))) [2019-10-06 23:30:34,177 INFO L193 IcfgInterpreter]: Reachable states at location L13-3 satisfy 110#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-06 23:30:34,714 INFO L211 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-06 23:30:34,715 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 13, 13, 11] total 40 [2019-10-06 23:30:34,716 INFO L442 AbstractCegarLoop]: Interpolant automaton has 40 states [2019-10-06 23:30:34,717 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2019-10-06 23:30:34,718 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=332, Invalid=1228, Unknown=0, NotChecked=0, Total=1560 [2019-10-06 23:30:34,722 INFO L87 Difference]: Start difference. First operand 31 states and 33 transitions. Second operand 40 states. [2019-10-06 23:30:36,536 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-06 23:30:36,537 INFO L93 Difference]: Finished difference Result 68 states and 84 transitions. [2019-10-06 23:30:36,541 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2019-10-06 23:30:36,541 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 27 [2019-10-06 23:30:36,542 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-06 23:30:36,542 INFO L225 Difference]: With dead ends: 68 [2019-10-06 23:30:36,542 INFO L226 Difference]: Without dead ends: 53 [2019-10-06 23:30:36,545 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 124 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1369 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=1002, Invalid=4548, Unknown=0, NotChecked=0, Total=5550 [2019-10-06 23:30:36,545 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2019-10-06 23:30:36,553 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 44. [2019-10-06 23:30:36,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2019-10-06 23:30:36,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 46 transitions. [2019-10-06 23:30:36,555 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 46 transitions. Word has length 27 [2019-10-06 23:30:36,555 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-06 23:30:36,555 INFO L462 AbstractCegarLoop]: Abstraction has 44 states and 46 transitions. [2019-10-06 23:30:36,555 INFO L463 AbstractCegarLoop]: Interpolant automaton has 40 states. [2019-10-06 23:30:36,556 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 46 transitions. [2019-10-06 23:30:36,557 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-10-06 23:30:36,557 INFO L377 BasicCegarLoop]: Found error trace [2019-10-06 23:30:36,557 INFO L385 BasicCegarLoop]: trace histogram [22, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-06 23:30:36,778 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-06 23:30:36,779 INFO L410 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-06 23:30:36,780 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-06 23:30:36,780 INFO L82 PathProgramCache]: Analyzing trace with hash -1041631869, now seen corresponding path program 5 times [2019-10-06 23:30:36,781 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-06 23:30:36,781 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-06 23:30:36,781 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-06 23:30:36,782 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-06 23:30:36,782 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-06 23:30:36,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-06 23:30:37,190 INFO L134 CoverageAnalysis]: Checked inductivity of 274 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2019-10-06 23:30:37,190 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-06 23:30:37,190 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2019-10-06 23:30:37,190 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:30:37,285 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2019-10-06 23:30:37,286 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-06 23:30:37,287 INFO L256 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 8 conjunts are in the unsatisfiable core [2019-10-06 23:30:37,290 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-06 23:30:37,422 INFO L134 CoverageAnalysis]: Checked inductivity of 274 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 253 trivial. 0 not checked. [2019-10-06 23:30:37,422 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-06 23:30:37,580 INFO L134 CoverageAnalysis]: Checked inductivity of 274 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 253 trivial. 0 not checked. [2019-10-06 23:30:37,580 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2019-10-06 23:30:37,582 INFO L162 IcfgInterpreter]: Started Sifa with 13 locations of interest [2019-10-06 23:30:37,582 INFO L169 IcfgInterpreter]: Building call graph [2019-10-06 23:30:37,582 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-06 23:30:37,582 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-06 23:30:37,583 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-06 23:30:37,603 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 21 for LOIs [2019-10-06 23:30:37,736 INFO L199 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 29 for LOIs [2019-10-06 23:30:37,746 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 10 for LOIs [2019-10-06 23:30:37,749 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-06 23:30:37,749 INFO L191 IcfgInterpreter]: Final predicates for locations of interest are: [2019-10-06 23:30:37,750 INFO L193 IcfgInterpreter]: Reachable states at location L2 satisfy 130#(and (exists ((v_prenex_18 Int) (v_prenex_17 Int) (|v_main_~#a2~0.base_BEFORE_CALL_5| Int) (v_prenex_20 Int) (|v_main_~#a2~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| 1) (= (select (select |#memory_int| v_prenex_19) v_prenex_20) (select (select |#memory_int| v_prenex_17) v_prenex_18))) (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| |v_main_~#a1~0.base_BEFORE_CALL_5|) |v_main_~#a1~0.offset_BEFORE_CALL_5|) (select (select |#memory_int| |v_main_~#a2~0.base_BEFORE_CALL_5|) |v_main_~#a2~0.offset_BEFORE_CALL_5|)))))) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-06 23:30:37,750 INFO L193 IcfgInterpreter]: Reachable states at location L2-1 satisfy 135#(and (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (exists ((v_prenex_18 Int) (v_prenex_17 Int) (|v_main_~#a2~0.base_BEFORE_CALL_5| Int) (v_prenex_20 Int) (|v_main_~#a2~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| 1) (= (select (select |#memory_int| v_prenex_19) v_prenex_20) (select (select |#memory_int| v_prenex_17) v_prenex_18))) (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| |v_main_~#a1~0.base_BEFORE_CALL_5|) |v_main_~#a1~0.offset_BEFORE_CALL_5|) (select (select |#memory_int| |v_main_~#a2~0.base_BEFORE_CALL_5|) |v_main_~#a2~0.offset_BEFORE_CALL_5|)))))) (<= 0 __VERIFIER_assert_~cond) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-06 23:30:37,750 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initENTRY satisfy 144#(and (= |old(#NULL.base)| |#NULL.base|) (= |#valid| |old(#valid)|) (= |#NULL.offset| |old(#NULL.offset)|)) [2019-10-06 23:30:37,750 INFO L193 IcfgInterpreter]: Reachable states at location L17-3 satisfy 115#(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:30:37,751 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION satisfy 140#(and (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (exists ((v_prenex_18 Int) (v_prenex_17 Int) (|v_main_~#a2~0.base_BEFORE_CALL_5| Int) (v_prenex_20 Int) (|v_main_~#a2~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| 1) (= (select (select |#memory_int| v_prenex_19) v_prenex_20) (select (select |#memory_int| v_prenex_17) v_prenex_18))) (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| |v_main_~#a1~0.base_BEFORE_CALL_5|) |v_main_~#a1~0.offset_BEFORE_CALL_5|) (select (select |#memory_int| |v_main_~#a2~0.base_BEFORE_CALL_5|) |v_main_~#a2~0.offset_BEFORE_CALL_5|)))))) (<= 0 __VERIFIER_assert_~cond) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-06 23:30:37,751 INFO L193 IcfgInterpreter]: Reachable states at location L8-3 satisfy 72#true [2019-10-06 23:30:37,751 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:30:37,751 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:30:37,751 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initEXIT satisfy 149#(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:30:37,751 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.startENTRY satisfy 6#true [2019-10-06 23:30:37,752 INFO L193 IcfgInterpreter]: Reachable states at location L18 satisfy 120#(and (<= 100000 main_~a~0) (< main_~x~0 100000) (<= 0 main_~i~0) (= main_~x~0 0) (<= 100000 main_~i~0) (not (< main_~i~0 100000)) (= |main_#t~mem7| (select (select |#memory_int| |main_~#a2~0.base|) (+ (* 4 main_~x~0) |main_~#a2~0.offset|))) (<= main_~x~0 0) (<= 0 main_~x~0) (= (select (select |#memory_int| |main_~#a1~0.base|) (+ (* 4 main_~x~0) |main_~#a1~0.offset|)) |main_#t~mem6|)) [2019-10-06 23:30:37,752 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertENTRY satisfy 125#(exists ((v_prenex_18 Int) (v_prenex_17 Int) (|v_main_~#a2~0.base_BEFORE_CALL_5| Int) (v_prenex_20 Int) (|v_main_~#a2~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| 1) (= (select (select |#memory_int| v_prenex_19) v_prenex_20) (select (select |#memory_int| v_prenex_17) v_prenex_18))) (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| |v_main_~#a1~0.base_BEFORE_CALL_5|) |v_main_~#a1~0.offset_BEFORE_CALL_5|) (select (select |#memory_int| |v_main_~#a2~0.base_BEFORE_CALL_5|) |v_main_~#a2~0.offset_BEFORE_CALL_5|)))))) [2019-10-06 23:30:37,752 INFO L193 IcfgInterpreter]: Reachable states at location L13-3 satisfy 110#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-06 23:30:38,185 INFO L211 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-06 23:30:38,185 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 9, 9, 11] total 49 [2019-10-06 23:30:38,186 INFO L442 AbstractCegarLoop]: Interpolant automaton has 49 states [2019-10-06 23:30:38,187 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2019-10-06 23:30:38,188 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=448, Invalid=1904, Unknown=0, NotChecked=0, Total=2352 [2019-10-06 23:30:38,188 INFO L87 Difference]: Start difference. First operand 44 states and 46 transitions. Second operand 49 states. [2019-10-06 23:30:40,358 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-06 23:30:40,359 INFO L93 Difference]: Finished difference Result 78 states and 90 transitions. [2019-10-06 23:30:40,359 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2019-10-06 23:30:40,359 INFO L78 Accepts]: Start accepts. Automaton has 49 states. Word has length 40 [2019-10-06 23:30:40,360 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-06 23:30:40,361 INFO L225 Difference]: With dead ends: 78 [2019-10-06 23:30:40,361 INFO L226 Difference]: Without dead ends: 62 [2019-10-06 23:30:40,365 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 189 GetRequests, 98 SyntacticMatches, 0 SemanticMatches, 91 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2016 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=1366, Invalid=7190, Unknown=0, NotChecked=0, Total=8556 [2019-10-06 23:30:40,365 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2019-10-06 23:30:40,373 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 53. [2019-10-06 23:30:40,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2019-10-06 23:30:40,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 55 transitions. [2019-10-06 23:30:40,374 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 55 transitions. Word has length 40 [2019-10-06 23:30:40,375 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-06 23:30:40,375 INFO L462 AbstractCegarLoop]: Abstraction has 53 states and 55 transitions. [2019-10-06 23:30:40,375 INFO L463 AbstractCegarLoop]: Interpolant automaton has 49 states. [2019-10-06 23:30:40,375 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 55 transitions. [2019-10-06 23:30:40,376 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2019-10-06 23:30:40,376 INFO L377 BasicCegarLoop]: Found error trace [2019-10-06 23:30:40,376 INFO L385 BasicCegarLoop]: trace histogram [23, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-06 23:30:40,584 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-06 23:30:40,584 INFO L410 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-06 23:30:40,585 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-06 23:30:40,585 INFO L82 PathProgramCache]: Analyzing trace with hash -388456012, now seen corresponding path program 6 times [2019-10-06 23:30:40,585 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-06 23:30:40,585 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-06 23:30:40,586 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-06 23:30:40,586 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-06 23:30:40,586 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-06 23:30:40,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-06 23:30:40,804 INFO L134 CoverageAnalysis]: Checked inductivity of 381 backedges. 0 proven. 105 refuted. 0 times theorem prover too weak. 276 trivial. 0 not checked. [2019-10-06 23:30:40,804 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-06 23:30:40,805 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2019-10-06 23:30:40,805 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:30:40,907 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-10-06 23:30:40,907 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-06 23:30:40,908 INFO L256 TraceCheckSpWp]: Trace formula consists of 302 conjuncts, 25 conjunts are in the unsatisfiable core [2019-10-06 23:30:40,911 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-06 23:30:41,327 INFO L134 CoverageAnalysis]: Checked inductivity of 381 backedges. 0 proven. 276 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [2019-10-06 23:30:41,327 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-06 23:30:42,325 INFO L134 CoverageAnalysis]: Checked inductivity of 381 backedges. 0 proven. 276 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [2019-10-06 23:30:42,325 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2019-10-06 23:30:42,326 INFO L162 IcfgInterpreter]: Started Sifa with 13 locations of interest [2019-10-06 23:30:42,326 INFO L169 IcfgInterpreter]: Building call graph [2019-10-06 23:30:42,326 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-06 23:30:42,326 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-06 23:30:42,327 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-06 23:30:42,351 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 21 for LOIs [2019-10-06 23:30:42,491 INFO L199 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 29 for LOIs [2019-10-06 23:30:42,497 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 10 for LOIs [2019-10-06 23:30:42,500 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-06 23:30:42,500 INFO L191 IcfgInterpreter]: Final predicates for locations of interest are: [2019-10-06 23:30:42,500 INFO L193 IcfgInterpreter]: Reachable states at location L2 satisfy 130#(and (exists ((v_prenex_23 Int) (v_prenex_22 Int) (v_prenex_24 Int) (|v_main_~#a2~0.base_BEFORE_CALL_6| Int) (|v_main_~#a2~0.offset_BEFORE_CALL_6| Int) (v_prenex_21 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_main_~#a1~0.base_BEFORE_CALL_6|) |v_main_~#a1~0.offset_BEFORE_CALL_6|) (select (select |#memory_int| |v_main_~#a2~0.base_BEFORE_CALL_6|) |v_main_~#a2~0.offset_BEFORE_CALL_6|))) (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| v_prenex_23) v_prenex_24) (select (select |#memory_int| v_prenex_21) v_prenex_22)))))) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-06 23:30:42,500 INFO L193 IcfgInterpreter]: Reachable states at location L2-1 satisfy 135#(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_prenex_24 Int) (|v_main_~#a2~0.base_BEFORE_CALL_6| Int) (|v_main_~#a2~0.offset_BEFORE_CALL_6| Int) (v_prenex_21 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_main_~#a1~0.base_BEFORE_CALL_6|) |v_main_~#a1~0.offset_BEFORE_CALL_6|) (select (select |#memory_int| |v_main_~#a2~0.base_BEFORE_CALL_6|) |v_main_~#a2~0.offset_BEFORE_CALL_6|))) (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| v_prenex_23) v_prenex_24) (select (select |#memory_int| v_prenex_21) v_prenex_22)))))) (<= 0 __VERIFIER_assert_~cond) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-06 23:30:42,501 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initENTRY satisfy 144#(and (= |old(#NULL.base)| |#NULL.base|) (= |#valid| |old(#valid)|) (= |#NULL.offset| |old(#NULL.offset)|)) [2019-10-06 23:30:42,501 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION satisfy 140#(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_prenex_24 Int) (|v_main_~#a2~0.base_BEFORE_CALL_6| Int) (|v_main_~#a2~0.offset_BEFORE_CALL_6| Int) (v_prenex_21 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_main_~#a1~0.base_BEFORE_CALL_6|) |v_main_~#a1~0.offset_BEFORE_CALL_6|) (select (select |#memory_int| |v_main_~#a2~0.base_BEFORE_CALL_6|) |v_main_~#a2~0.offset_BEFORE_CALL_6|))) (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| v_prenex_23) v_prenex_24) (select (select |#memory_int| v_prenex_21) v_prenex_22)))))) (<= 0 __VERIFIER_assert_~cond) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-06 23:30:42,501 INFO L193 IcfgInterpreter]: Reachable states at location L17-3 satisfy 115#(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:30:42,501 INFO L193 IcfgInterpreter]: Reachable states at location L8-3 satisfy 72#true [2019-10-06 23:30:42,501 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:30:42,502 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:30:42,502 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initEXIT satisfy 149#(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:30:42,502 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.startENTRY satisfy 6#true [2019-10-06 23:30:42,502 INFO L193 IcfgInterpreter]: Reachable states at location L18 satisfy 120#(and (<= 100000 main_~a~0) (< main_~x~0 100000) (<= 0 main_~i~0) (= main_~x~0 0) (<= 100000 main_~i~0) (not (< main_~i~0 100000)) (= |main_#t~mem7| (select (select |#memory_int| |main_~#a2~0.base|) (+ (* 4 main_~x~0) |main_~#a2~0.offset|))) (<= main_~x~0 0) (<= 0 main_~x~0) (= (select (select |#memory_int| |main_~#a1~0.base|) (+ (* 4 main_~x~0) |main_~#a1~0.offset|)) |main_#t~mem6|)) [2019-10-06 23:30:42,502 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertENTRY satisfy 125#(exists ((v_prenex_23 Int) (v_prenex_22 Int) (v_prenex_24 Int) (|v_main_~#a2~0.base_BEFORE_CALL_6| Int) (|v_main_~#a2~0.offset_BEFORE_CALL_6| Int) (v_prenex_21 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_main_~#a1~0.base_BEFORE_CALL_6|) |v_main_~#a1~0.offset_BEFORE_CALL_6|) (select (select |#memory_int| |v_main_~#a2~0.base_BEFORE_CALL_6|) |v_main_~#a2~0.offset_BEFORE_CALL_6|))) (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| v_prenex_23) v_prenex_24) (select (select |#memory_int| v_prenex_21) v_prenex_22)))))) [2019-10-06 23:30:42,503 INFO L193 IcfgInterpreter]: Reachable states at location L13-3 satisfy 110#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-06 23:30:43,020 INFO L211 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-06 23:30:43,021 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 26, 26, 11] total 75 [2019-10-06 23:30:43,022 INFO L442 AbstractCegarLoop]: Interpolant automaton has 75 states [2019-10-06 23:30:43,023 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 75 interpolants. [2019-10-06 23:30:43,024 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1389, Invalid=4161, Unknown=0, NotChecked=0, Total=5550 [2019-10-06 23:30:43,024 INFO L87 Difference]: Start difference. First operand 53 states and 55 transitions. Second operand 75 states. [2019-10-06 23:30:46,770 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-06 23:30:46,770 INFO L93 Difference]: Finished difference Result 112 states and 141 transitions. [2019-10-06 23:30:46,770 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 75 states. [2019-10-06 23:30:46,771 INFO L78 Accepts]: Start accepts. Automaton has 75 states. Word has length 49 [2019-10-06 23:30:46,771 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-06 23:30:46,772 INFO L225 Difference]: With dead ends: 112 [2019-10-06 23:30:46,772 INFO L226 Difference]: Without dead ends: 88 [2019-10-06 23:30:46,778 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 234 GetRequests, 91 SyntacticMatches, 0 SemanticMatches, 143 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4946 ImplicationChecksByTransitivity, 5.2s TimeCoverageRelationStatistics Valid=4191, Invalid=16689, Unknown=0, NotChecked=0, Total=20880 [2019-10-06 23:30:46,778 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2019-10-06 23:30:46,788 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 79. [2019-10-06 23:30:46,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2019-10-06 23:30:46,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 81 transitions. [2019-10-06 23:30:46,790 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 81 transitions. Word has length 49 [2019-10-06 23:30:46,790 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-06 23:30:46,790 INFO L462 AbstractCegarLoop]: Abstraction has 79 states and 81 transitions. [2019-10-06 23:30:46,790 INFO L463 AbstractCegarLoop]: Interpolant automaton has 75 states. [2019-10-06 23:30:46,791 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 81 transitions. [2019-10-06 23:30:46,793 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2019-10-06 23:30:46,793 INFO L377 BasicCegarLoop]: Found error trace [2019-10-06 23:30:46,793 INFO L385 BasicCegarLoop]: trace histogram [48, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-06 23:30:46,996 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-06 23:30:46,997 INFO L410 AbstractCegarLoop]: === Iteration 9 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-06 23:30:46,997 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-06 23:30:46,997 INFO L82 PathProgramCache]: Analyzing trace with hash -1007317343, now seen corresponding path program 7 times [2019-10-06 23:30:46,998 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-06 23:30:46,998 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-06 23:30:46,998 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-06 23:30:46,998 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-06 23:30:46,999 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-06 23:30:47,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-06 23:30:47,366 INFO L134 CoverageAnalysis]: Checked inductivity of 1296 backedges. 0 proven. 120 refuted. 0 times theorem prover too weak. 1176 trivial. 0 not checked. [2019-10-06 23:30:47,366 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-06 23:30:47,366 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2019-10-06 23:30:47,366 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:30:47,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-06 23:30:47,550 INFO L256 TraceCheckSpWp]: Trace formula consists of 506 conjuncts, 50 conjunts are in the unsatisfiable core [2019-10-06 23:30:47,555 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-06 23:30:48,993 INFO L134 CoverageAnalysis]: Checked inductivity of 1296 backedges. 0 proven. 1176 refuted. 0 times theorem prover too weak. 120 trivial. 0 not checked. [2019-10-06 23:30:48,993 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-06 23:30:51,922 INFO L134 CoverageAnalysis]: Checked inductivity of 1296 backedges. 0 proven. 1176 refuted. 0 times theorem prover too weak. 120 trivial. 0 not checked. [2019-10-06 23:30:51,923 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2019-10-06 23:30:51,924 INFO L162 IcfgInterpreter]: Started Sifa with 13 locations of interest [2019-10-06 23:30:51,924 INFO L169 IcfgInterpreter]: Building call graph [2019-10-06 23:30:51,925 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-06 23:30:51,925 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-06 23:30:51,925 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-06 23:30:51,971 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 21 for LOIs [2019-10-06 23:30:52,152 INFO L199 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 29 for LOIs [2019-10-06 23:30:52,160 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 10 for LOIs [2019-10-06 23:30:52,163 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-06 23:30:52,164 INFO L191 IcfgInterpreter]: Final predicates for locations of interest are: [2019-10-06 23:30:52,164 INFO L193 IcfgInterpreter]: Reachable states at location L2 satisfy 130#(and (exists ((v_prenex_27 Int) (v_prenex_26 Int) (v_prenex_28 Int) (v_prenex_25 Int) (|v_main_~#a1~0.offset_BEFORE_CALL_7| Int) (|v_main_~#a2~0.base_BEFORE_CALL_7| Int) (|v_main_~#a2~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_main_~#a2~0.base_BEFORE_CALL_7|) |v_main_~#a2~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|)))) (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| v_prenex_26) v_prenex_27) (select (select |#memory_int| v_prenex_28) v_prenex_25))))) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-06 23:30:52,164 INFO L193 IcfgInterpreter]: Reachable states at location L2-1 satisfy 135#(and (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond) (= 0 __VERIFIER_assert_~cond) (exists ((v_prenex_27 Int) (v_prenex_26 Int) (v_prenex_28 Int) (v_prenex_25 Int) (|v_main_~#a1~0.offset_BEFORE_CALL_7| Int) (|v_main_~#a2~0.base_BEFORE_CALL_7| Int) (|v_main_~#a2~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_main_~#a2~0.base_BEFORE_CALL_7|) |v_main_~#a2~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|)))) (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| v_prenex_26) v_prenex_27) (select (select |#memory_int| v_prenex_28) v_prenex_25))))) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-06 23:30:52,165 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initENTRY satisfy 144#(and (= |old(#NULL.base)| |#NULL.base|) (= |#valid| |old(#valid)|) (= |#NULL.offset| |old(#NULL.offset)|)) [2019-10-06 23:30:52,165 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION satisfy 140#(and (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond) (= 0 __VERIFIER_assert_~cond) (exists ((v_prenex_27 Int) (v_prenex_26 Int) (v_prenex_28 Int) (v_prenex_25 Int) (|v_main_~#a1~0.offset_BEFORE_CALL_7| Int) (|v_main_~#a2~0.base_BEFORE_CALL_7| Int) (|v_main_~#a2~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_main_~#a2~0.base_BEFORE_CALL_7|) |v_main_~#a2~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|)))) (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| v_prenex_26) v_prenex_27) (select (select |#memory_int| v_prenex_28) v_prenex_25))))) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-06 23:30:52,165 INFO L193 IcfgInterpreter]: Reachable states at location L17-3 satisfy 115#(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:30:52,166 INFO L193 IcfgInterpreter]: Reachable states at location L8-3 satisfy 72#true [2019-10-06 23:30:52,166 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:30:52,166 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:30:52,167 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initEXIT satisfy 149#(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:30:52,167 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.startENTRY satisfy 6#true [2019-10-06 23:30:52,167 INFO L193 IcfgInterpreter]: Reachable states at location L18 satisfy 120#(and (<= 100000 main_~a~0) (< main_~x~0 100000) (<= 0 main_~i~0) (= main_~x~0 0) (<= 100000 main_~i~0) (not (< main_~i~0 100000)) (= |main_#t~mem7| (select (select |#memory_int| |main_~#a2~0.base|) (+ (* 4 main_~x~0) |main_~#a2~0.offset|))) (<= main_~x~0 0) (<= 0 main_~x~0) (= (select (select |#memory_int| |main_~#a1~0.base|) (+ (* 4 main_~x~0) |main_~#a1~0.offset|)) |main_#t~mem6|)) [2019-10-06 23:30:52,168 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertENTRY satisfy 125#(exists ((v_prenex_27 Int) (v_prenex_26 Int) (v_prenex_28 Int) (v_prenex_25 Int) (|v_main_~#a1~0.offset_BEFORE_CALL_7| Int) (|v_main_~#a2~0.base_BEFORE_CALL_7| Int) (|v_main_~#a2~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_main_~#a2~0.base_BEFORE_CALL_7|) |v_main_~#a2~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|)))) (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| v_prenex_26) v_prenex_27) (select (select |#memory_int| v_prenex_28) v_prenex_25))))) [2019-10-06 23:30:52,168 INFO L193 IcfgInterpreter]: Reachable states at location L13-3 satisfy 110#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-06 23:30:53,165 INFO L211 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-06 23:30:53,166 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 51, 51, 11] total 126 [2019-10-06 23:30:53,167 INFO L442 AbstractCegarLoop]: Interpolant automaton has 126 states [2019-10-06 23:30:53,173 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 126 interpolants. [2019-10-06 23:30:53,181 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5131, Invalid=10619, Unknown=0, NotChecked=0, Total=15750 [2019-10-06 23:30:53,181 INFO L87 Difference]: Start difference. First operand 79 states and 81 transitions. Second operand 126 states. [2019-10-06 23:31:02,599 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-06 23:31:02,599 INFO L93 Difference]: Finished difference Result 164 states and 218 transitions. [2019-10-06 23:31:02,599 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 126 states. [2019-10-06 23:31:02,600 INFO L78 Accepts]: Start accepts. Automaton has 126 states. Word has length 75 [2019-10-06 23:31:02,600 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-06 23:31:02,603 INFO L225 Difference]: With dead ends: 164 [2019-10-06 23:31:02,604 INFO L226 Difference]: Without dead ends: 139 [2019-10-06 23:31:02,608 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 364 GetRequests, 119 SyntacticMatches, 0 SemanticMatches, 245 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13025 ImplicationChecksByTransitivity, 14.0s TimeCoverageRelationStatistics Valid=15419, Invalid=45343, Unknown=0, NotChecked=0, Total=60762 [2019-10-06 23:31:02,608 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2019-10-06 23:31:02,622 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 130. [2019-10-06 23:31:02,623 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 130 states. [2019-10-06 23:31:02,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 132 transitions. [2019-10-06 23:31:02,625 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 132 transitions. Word has length 75 [2019-10-06 23:31:02,625 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-06 23:31:02,625 INFO L462 AbstractCegarLoop]: Abstraction has 130 states and 132 transitions. [2019-10-06 23:31:02,625 INFO L463 AbstractCegarLoop]: Interpolant automaton has 126 states. [2019-10-06 23:31:02,625 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 132 transitions. [2019-10-06 23:31:02,629 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2019-10-06 23:31:02,629 INFO L377 BasicCegarLoop]: Found error trace [2019-10-06 23:31:02,629 INFO L385 BasicCegarLoop]: trace histogram [98, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-06 23:31:02,840 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-06 23:31:02,841 INFO L410 AbstractCegarLoop]: === Iteration 10 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-06 23:31:02,841 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-06 23:31:02,842 INFO L82 PathProgramCache]: Analyzing trace with hash -240161533, now seen corresponding path program 8 times [2019-10-06 23:31:02,842 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-06 23:31:02,842 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-06 23:31:02,843 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-06 23:31:02,843 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-06 23:31:02,843 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-06 23:31:03,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-06 23:31:03,541 INFO L134 CoverageAnalysis]: Checked inductivity of 4987 backedges. 0 proven. 136 refuted. 0 times theorem prover too weak. 4851 trivial. 0 not checked. [2019-10-06 23:31:03,542 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-06 23:31:03,542 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2019-10-06 23:31:03,542 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 [2019-10-06 23:31:06,041 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 9 check-sat command(s) [2019-10-06 23:31:06,041 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-06 23:31:06,045 INFO L256 TraceCheckSpWp]: Trace formula consists of 254 conjuncts, 18 conjunts are in the unsatisfiable core [2019-10-06 23:31:06,050 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-06 23:31:06,075 INFO L134 CoverageAnalysis]: Checked inductivity of 4987 backedges. 0 proven. 136 refuted. 0 times theorem prover too weak. 4851 trivial. 0 not checked. [2019-10-06 23:31:06,076 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-06 23:31:06,527 INFO L134 CoverageAnalysis]: Checked inductivity of 4987 backedges. 0 proven. 136 refuted. 0 times theorem prover too weak. 4851 trivial. 0 not checked. [2019-10-06 23:31:06,527 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2019-10-06 23:31:06,529 INFO L162 IcfgInterpreter]: Started Sifa with 13 locations of interest [2019-10-06 23:31:06,529 INFO L169 IcfgInterpreter]: Building call graph [2019-10-06 23:31:06,530 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-06 23:31:06,530 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-06 23:31:06,530 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-06 23:31:06,550 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 21 for LOIs [2019-10-06 23:31:06,671 INFO L199 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 29 for LOIs [2019-10-06 23:31:06,676 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 10 for LOIs [2019-10-06 23:31:06,683 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-06 23:31:06,683 INFO L191 IcfgInterpreter]: Final predicates for locations of interest are: [2019-10-06 23:31:06,683 INFO L193 IcfgInterpreter]: Reachable states at location L2 satisfy 130#(and (exists ((v_prenex_29 Int) (v_prenex_30 Int) (|v_main_~#a1~0.offset_BEFORE_CALL_8| Int) (v_prenex_32 Int) (|v_main_~#a2~0.base_BEFORE_CALL_8| Int) (v_prenex_31 Int) (|v_main_~#a1~0.base_BEFORE_CALL_8| Int) (|v_main_~#a2~0.offset_BEFORE_CALL_8| Int)) (or (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| v_prenex_30) v_prenex_32) (select (select |#memory_int| v_prenex_31) v_prenex_29))) (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| |v_main_~#a2~0.base_BEFORE_CALL_8|) |v_main_~#a2~0.offset_BEFORE_CALL_8|) (select (select |#memory_int| |v_main_~#a1~0.base_BEFORE_CALL_8|) |v_main_~#a1~0.offset_BEFORE_CALL_8|)))))) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-06 23:31:06,684 INFO L193 IcfgInterpreter]: Reachable states at location L2-1 satisfy 135#(and (<= __VERIFIER_assert_~cond 0) (exists ((v_prenex_29 Int) (v_prenex_30 Int) (|v_main_~#a1~0.offset_BEFORE_CALL_8| Int) (v_prenex_32 Int) (|v_main_~#a2~0.base_BEFORE_CALL_8| Int) (v_prenex_31 Int) (|v_main_~#a1~0.base_BEFORE_CALL_8| Int) (|v_main_~#a2~0.offset_BEFORE_CALL_8| Int)) (or (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| v_prenex_30) v_prenex_32) (select (select |#memory_int| v_prenex_31) v_prenex_29))) (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| |v_main_~#a2~0.base_BEFORE_CALL_8|) |v_main_~#a2~0.offset_BEFORE_CALL_8|) (select (select |#memory_int| |v_main_~#a1~0.base_BEFORE_CALL_8|) |v_main_~#a1~0.offset_BEFORE_CALL_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:31:06,684 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initENTRY satisfy 144#(and (= |old(#NULL.base)| |#NULL.base|) (= |#valid| |old(#valid)|) (= |#NULL.offset| |old(#NULL.offset)|)) [2019-10-06 23:31:06,684 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION satisfy 140#(and (<= __VERIFIER_assert_~cond 0) (exists ((v_prenex_29 Int) (v_prenex_30 Int) (|v_main_~#a1~0.offset_BEFORE_CALL_8| Int) (v_prenex_32 Int) (|v_main_~#a2~0.base_BEFORE_CALL_8| Int) (v_prenex_31 Int) (|v_main_~#a1~0.base_BEFORE_CALL_8| Int) (|v_main_~#a2~0.offset_BEFORE_CALL_8| Int)) (or (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| v_prenex_30) v_prenex_32) (select (select |#memory_int| v_prenex_31) v_prenex_29))) (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| |v_main_~#a2~0.base_BEFORE_CALL_8|) |v_main_~#a2~0.offset_BEFORE_CALL_8|) (select (select |#memory_int| |v_main_~#a1~0.base_BEFORE_CALL_8|) |v_main_~#a1~0.offset_BEFORE_CALL_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:31:06,684 INFO L193 IcfgInterpreter]: Reachable states at location L17-3 satisfy 115#(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:31:06,684 INFO L193 IcfgInterpreter]: Reachable states at location L8-3 satisfy 72#true [2019-10-06 23:31:06,685 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:31:06,685 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:31:06,685 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initEXIT satisfy 149#(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:31:06,685 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.startENTRY satisfy 6#true [2019-10-06 23:31:06,685 INFO L193 IcfgInterpreter]: Reachable states at location L18 satisfy 120#(and (<= 100000 main_~a~0) (< main_~x~0 100000) (<= 0 main_~i~0) (= main_~x~0 0) (<= 100000 main_~i~0) (not (< main_~i~0 100000)) (= |main_#t~mem7| (select (select |#memory_int| |main_~#a2~0.base|) (+ (* 4 main_~x~0) |main_~#a2~0.offset|))) (<= main_~x~0 0) (<= 0 main_~x~0) (= (select (select |#memory_int| |main_~#a1~0.base|) (+ (* 4 main_~x~0) |main_~#a1~0.offset|)) |main_#t~mem6|)) [2019-10-06 23:31:06,685 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertENTRY satisfy 125#(exists ((v_prenex_29 Int) (v_prenex_30 Int) (|v_main_~#a1~0.offset_BEFORE_CALL_8| Int) (v_prenex_32 Int) (|v_main_~#a2~0.base_BEFORE_CALL_8| Int) (v_prenex_31 Int) (|v_main_~#a1~0.base_BEFORE_CALL_8| Int) (|v_main_~#a2~0.offset_BEFORE_CALL_8| Int)) (or (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| v_prenex_30) v_prenex_32) (select (select |#memory_int| v_prenex_31) v_prenex_29))) (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| |v_main_~#a2~0.base_BEFORE_CALL_8|) |v_main_~#a2~0.offset_BEFORE_CALL_8|) (select (select |#memory_int| |v_main_~#a1~0.base_BEFORE_CALL_8|) |v_main_~#a1~0.offset_BEFORE_CALL_8|)))))) [2019-10-06 23:31:06,686 INFO L193 IcfgInterpreter]: Reachable states at location L13-3 satisfy 110#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-06 23:31:07,005 INFO L211 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-06 23:31:07,005 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19, 19, 11] total 47 [2019-10-06 23:31:07,007 INFO L442 AbstractCegarLoop]: Interpolant automaton has 47 states [2019-10-06 23:31:07,007 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2019-10-06 23:31:07,007 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=695, Invalid=1467, Unknown=0, NotChecked=0, Total=2162 [2019-10-06 23:31:07,008 INFO L87 Difference]: Start difference. First operand 130 states and 132 transitions. Second operand 47 states. [2019-10-06 23:31:08,905 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-06 23:31:08,905 INFO L93 Difference]: Finished difference Result 166 states and 186 transitions. [2019-10-06 23:31:08,906 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2019-10-06 23:31:08,906 INFO L78 Accepts]: Start accepts. Automaton has 47 states. Word has length 126 [2019-10-06 23:31:08,907 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-06 23:31:08,908 INFO L225 Difference]: With dead ends: 166 [2019-10-06 23:31:08,909 INFO L226 Difference]: Without dead ends: 157 [2019-10-06 23:31:08,910 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 438 GetRequests, 352 SyntacticMatches, 0 SemanticMatches, 86 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1790 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=2076, Invalid=5580, Unknown=0, NotChecked=0, Total=7656 [2019-10-06 23:31:08,910 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states. [2019-10-06 23:31:08,926 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 148. [2019-10-06 23:31:08,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 148 states. [2019-10-06 23:31:08,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 150 transitions. [2019-10-06 23:31:08,929 INFO L78 Accepts]: Start accepts. Automaton has 148 states and 150 transitions. Word has length 126 [2019-10-06 23:31:08,929 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-06 23:31:08,929 INFO L462 AbstractCegarLoop]: Abstraction has 148 states and 150 transitions. [2019-10-06 23:31:08,930 INFO L463 AbstractCegarLoop]: Interpolant automaton has 47 states. [2019-10-06 23:31:08,930 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 150 transitions. [2019-10-06 23:31:08,932 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2019-10-06 23:31:08,932 INFO L377 BasicCegarLoop]: Found error trace [2019-10-06 23:31:08,932 INFO L385 BasicCegarLoop]: trace histogram [98, 34, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-06 23:31:09,143 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-06 23:31:09,144 INFO L410 AbstractCegarLoop]: === Iteration 11 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-06 23:31:09,145 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-06 23:31:09,145 INFO L82 PathProgramCache]: Analyzing trace with hash 1795883715, now seen corresponding path program 9 times [2019-10-06 23:31:09,145 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-06 23:31:09,145 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-06 23:31:09,145 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-06 23:31:09,146 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-06 23:31:09,146 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-06 23:31:09,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-06 23:31:10,084 INFO L134 CoverageAnalysis]: Checked inductivity of 5446 backedges. 0 proven. 595 refuted. 0 times theorem prover too weak. 4851 trivial. 0 not checked. [2019-10-06 23:31:10,085 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-06 23:31:10,085 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2019-10-06 23:31:10,085 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 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-06 23:31:10,331 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-10-06 23:31:10,331 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-06 23:31:10,336 INFO L256 TraceCheckSpWp]: Trace formula consists of 982 conjuncts, 100 conjunts are in the unsatisfiable core [2019-10-06 23:31:10,340 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-06 23:31:15,171 INFO L134 CoverageAnalysis]: Checked inductivity of 5446 backedges. 0 proven. 4851 refuted. 0 times theorem prover too weak. 595 trivial. 0 not checked. [2019-10-06 23:31:15,171 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-06 23:31:26,912 INFO L134 CoverageAnalysis]: Checked inductivity of 5446 backedges. 0 proven. 4851 refuted. 0 times theorem prover too weak. 595 trivial. 0 not checked. [2019-10-06 23:31:26,912 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2019-10-06 23:31:26,914 INFO L162 IcfgInterpreter]: Started Sifa with 13 locations of interest [2019-10-06 23:31:26,914 INFO L169 IcfgInterpreter]: Building call graph [2019-10-06 23:31:26,914 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-06 23:31:26,915 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-06 23:31:26,915 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-06 23:31:26,934 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 21 for LOIs [2019-10-06 23:31:27,051 INFO L199 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 29 for LOIs [2019-10-06 23:31:27,057 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 10 for LOIs [2019-10-06 23:31:27,061 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-06 23:31:27,061 INFO L191 IcfgInterpreter]: Final predicates for locations of interest are: [2019-10-06 23:31:27,062 INFO L193 IcfgInterpreter]: Reachable states at location L2 satisfy 130#(and (exists ((v_prenex_34 Int) (v_prenex_33 Int) (v_prenex_36 Int) (v_prenex_35 Int) (|v_main_~#a1~0.base_BEFORE_CALL_9| Int) (|v_main_~#a1~0.offset_BEFORE_CALL_9| Int) (|v_main_~#a2~0.base_BEFORE_CALL_9| Int) (|v_main_~#a2~0.offset_BEFORE_CALL_9| Int)) (or (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| |v_main_~#a2~0.base_BEFORE_CALL_9|) |v_main_~#a2~0.offset_BEFORE_CALL_9|) (select (select |#memory_int| |v_main_~#a1~0.base_BEFORE_CALL_9|) |v_main_~#a1~0.offset_BEFORE_CALL_9|))) (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| v_prenex_35) v_prenex_36) (select (select |#memory_int| v_prenex_33) v_prenex_34)))))) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-06 23:31:27,062 INFO L193 IcfgInterpreter]: Reachable states at location L2-1 satisfy 135#(and (<= __VERIFIER_assert_~cond 0) (exists ((v_prenex_34 Int) (v_prenex_33 Int) (v_prenex_36 Int) (v_prenex_35 Int) (|v_main_~#a1~0.base_BEFORE_CALL_9| Int) (|v_main_~#a1~0.offset_BEFORE_CALL_9| Int) (|v_main_~#a2~0.base_BEFORE_CALL_9| Int) (|v_main_~#a2~0.offset_BEFORE_CALL_9| Int)) (or (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| |v_main_~#a2~0.base_BEFORE_CALL_9|) |v_main_~#a2~0.offset_BEFORE_CALL_9|) (select (select |#memory_int| |v_main_~#a1~0.base_BEFORE_CALL_9|) |v_main_~#a1~0.offset_BEFORE_CALL_9|))) (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| v_prenex_35) v_prenex_36) (select (select |#memory_int| v_prenex_33) v_prenex_34)))))) (<= 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:31:27,062 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initENTRY satisfy 144#(and (= |old(#NULL.base)| |#NULL.base|) (= |#valid| |old(#valid)|) (= |#NULL.offset| |old(#NULL.offset)|)) [2019-10-06 23:31:27,062 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION satisfy 140#(and (<= __VERIFIER_assert_~cond 0) (exists ((v_prenex_34 Int) (v_prenex_33 Int) (v_prenex_36 Int) (v_prenex_35 Int) (|v_main_~#a1~0.base_BEFORE_CALL_9| Int) (|v_main_~#a1~0.offset_BEFORE_CALL_9| Int) (|v_main_~#a2~0.base_BEFORE_CALL_9| Int) (|v_main_~#a2~0.offset_BEFORE_CALL_9| Int)) (or (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| |v_main_~#a2~0.base_BEFORE_CALL_9|) |v_main_~#a2~0.offset_BEFORE_CALL_9|) (select (select |#memory_int| |v_main_~#a1~0.base_BEFORE_CALL_9|) |v_main_~#a1~0.offset_BEFORE_CALL_9|))) (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| v_prenex_35) v_prenex_36) (select (select |#memory_int| v_prenex_33) v_prenex_34)))))) (<= 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:31:27,062 INFO L193 IcfgInterpreter]: Reachable states at location L17-3 satisfy 115#(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:31:27,063 INFO L193 IcfgInterpreter]: Reachable states at location L8-3 satisfy 72#true [2019-10-06 23:31:27,063 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:31:27,063 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:31:27,063 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initEXIT satisfy 149#(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:31:27,063 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.startENTRY satisfy 6#true [2019-10-06 23:31:27,063 INFO L193 IcfgInterpreter]: Reachable states at location L18 satisfy 120#(and (<= 100000 main_~a~0) (< main_~x~0 100000) (<= 0 main_~i~0) (= main_~x~0 0) (<= 100000 main_~i~0) (not (< main_~i~0 100000)) (= |main_#t~mem7| (select (select |#memory_int| |main_~#a2~0.base|) (+ (* 4 main_~x~0) |main_~#a2~0.offset|))) (<= main_~x~0 0) (<= 0 main_~x~0) (= (select (select |#memory_int| |main_~#a1~0.base|) (+ (* 4 main_~x~0) |main_~#a1~0.offset|)) |main_#t~mem6|)) [2019-10-06 23:31:27,064 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertENTRY satisfy 125#(exists ((v_prenex_34 Int) (v_prenex_33 Int) (v_prenex_36 Int) (v_prenex_35 Int) (|v_main_~#a1~0.base_BEFORE_CALL_9| Int) (|v_main_~#a1~0.offset_BEFORE_CALL_9| Int) (|v_main_~#a2~0.base_BEFORE_CALL_9| Int) (|v_main_~#a2~0.offset_BEFORE_CALL_9| Int)) (or (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| |v_main_~#a2~0.base_BEFORE_CALL_9|) |v_main_~#a2~0.offset_BEFORE_CALL_9|) (select (select |#memory_int| |v_main_~#a1~0.base_BEFORE_CALL_9|) |v_main_~#a1~0.offset_BEFORE_CALL_9|))) (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| v_prenex_35) v_prenex_36) (select (select |#memory_int| v_prenex_33) v_prenex_34)))))) [2019-10-06 23:31:27,064 INFO L193 IcfgInterpreter]: Reachable states at location L13-3 satisfy 110#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-06 23:31:28,045 INFO L211 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-06 23:31:28,046 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [37, 101, 101, 11] total 245 [2019-10-06 23:31:28,047 INFO L442 AbstractCegarLoop]: Interpolant automaton has 245 states [2019-10-06 23:31:28,051 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 245 interpolants. [2019-10-06 23:31:28,053 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20594, Invalid=39186, Unknown=0, NotChecked=0, Total=59780 [2019-10-06 23:31:28,053 INFO L87 Difference]: Start difference. First operand 148 states and 150 transitions. Second operand 245 states. [2019-10-06 23:32:00,009 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-06 23:32:00,009 INFO L93 Difference]: Finished difference Result 302 states and 406 transitions. [2019-10-06 23:32:00,010 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 245 states. [2019-10-06 23:32:00,010 INFO L78 Accepts]: Start accepts. Automaton has 245 states. Word has length 144 [2019-10-06 23:32:00,011 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-06 23:32:00,013 INFO L225 Difference]: With dead ends: 302 [2019-10-06 23:32:00,013 INFO L226 Difference]: Without dead ends: 258 [2019-10-06 23:32:00,020 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 709 GetRequests, 226 SyntacticMatches, 0 SemanticMatches, 483 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48491 ImplicationChecksByTransitivity, 48.1s TimeCoverageRelationStatistics Valid=61846, Invalid=172894, Unknown=0, NotChecked=0, Total=234740 [2019-10-06 23:32:00,020 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 258 states. [2019-10-06 23:32:00,043 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 258 to 249. [2019-10-06 23:32:00,044 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 249 states. [2019-10-06 23:32:00,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 249 states to 249 states and 251 transitions. [2019-10-06 23:32:00,047 INFO L78 Accepts]: Start accepts. Automaton has 249 states and 251 transitions. Word has length 144 [2019-10-06 23:32:00,048 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-06 23:32:00,048 INFO L462 AbstractCegarLoop]: Abstraction has 249 states and 251 transitions. [2019-10-06 23:32:00,048 INFO L463 AbstractCegarLoop]: Interpolant automaton has 245 states. [2019-10-06 23:32:00,048 INFO L276 IsEmpty]: Start isEmpty. Operand 249 states and 251 transitions. [2019-10-06 23:32:00,052 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 246 [2019-10-06 23:32:00,053 INFO L377 BasicCegarLoop]: Found error trace [2019-10-06 23:32:00,053 INFO L385 BasicCegarLoop]: trace histogram [198, 35, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-06 23:32:00,258 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-06 23:32:00,259 INFO L410 AbstractCegarLoop]: === Iteration 12 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-06 23:32:00,259 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-06 23:32:00,259 INFO L82 PathProgramCache]: Analyzing trace with hash 1613279681, now seen corresponding path program 10 times [2019-10-06 23:32:00,259 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-06 23:32:00,260 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-06 23:32:00,260 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-06 23:32:00,260 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-06 23:32:00,260 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-06 23:32:01,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-06 23:32:02,200 INFO L134 CoverageAnalysis]: Checked inductivity of 20331 backedges. 0 proven. 630 refuted. 0 times theorem prover too weak. 19701 trivial. 0 not checked. [2019-10-06 23:32:02,201 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-06 23:32:02,201 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2019-10-06 23:32:02,201 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 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-06 23:32:02,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-06 23:32:02,658 INFO L256 TraceCheckSpWp]: Trace formula consists of 1786 conjuncts, 200 conjunts are in the unsatisfiable core [2019-10-06 23:32:02,664 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-06 23:32:19,129 INFO L134 CoverageAnalysis]: Checked inductivity of 20331 backedges. 0 proven. 19701 refuted. 0 times theorem prover too weak. 630 trivial. 0 not checked. [2019-10-06 23:32:19,129 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-06 23:33:03,650 INFO L134 CoverageAnalysis]: Checked inductivity of 20331 backedges. 0 proven. 19701 refuted. 0 times theorem prover too weak. 630 trivial. 0 not checked. [2019-10-06 23:33:03,651 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2019-10-06 23:33:03,652 INFO L162 IcfgInterpreter]: Started Sifa with 13 locations of interest [2019-10-06 23:33:03,652 INFO L169 IcfgInterpreter]: Building call graph [2019-10-06 23:33:03,653 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-06 23:33:03,653 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-06 23:33:03,653 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-06 23:33:03,681 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 21 for LOIs [2019-10-06 23:33:03,790 INFO L199 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 29 for LOIs [2019-10-06 23:33:03,795 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 10 for LOIs [2019-10-06 23:33:03,798 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-06 23:33:03,798 INFO L191 IcfgInterpreter]: Final predicates for locations of interest are: [2019-10-06 23:33:03,798 INFO L193 IcfgInterpreter]: Reachable states at location L2 satisfy 130#(and (exists ((|v_main_~#a2~0.offset_BEFORE_CALL_10| Int) (v_prenex_38 Int) (|v_main_~#a1~0.offset_BEFORE_CALL_10| Int) (v_prenex_37 Int) (v_prenex_39 Int) (|v_main_~#a2~0.base_BEFORE_CALL_10| Int) (|v_main_~#a1~0.base_BEFORE_CALL_10| Int) (v_prenex_40 Int)) (or (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| |v_main_~#a2~0.base_BEFORE_CALL_10|) |v_main_~#a2~0.offset_BEFORE_CALL_10|) (select (select |#memory_int| |v_main_~#a1~0.base_BEFORE_CALL_10|) |v_main_~#a1~0.offset_BEFORE_CALL_10|)))) (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| v_prenex_39) v_prenex_37) (select (select |#memory_int| v_prenex_40) v_prenex_38))))) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-06 23:33:03,798 INFO L193 IcfgInterpreter]: Reachable states at location L2-1 satisfy 135#(and (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond) (= 0 __VERIFIER_assert_~cond) (exists ((|v_main_~#a2~0.offset_BEFORE_CALL_10| Int) (v_prenex_38 Int) (|v_main_~#a1~0.offset_BEFORE_CALL_10| Int) (v_prenex_37 Int) (v_prenex_39 Int) (|v_main_~#a2~0.base_BEFORE_CALL_10| Int) (|v_main_~#a1~0.base_BEFORE_CALL_10| Int) (v_prenex_40 Int)) (or (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| |v_main_~#a2~0.base_BEFORE_CALL_10|) |v_main_~#a2~0.offset_BEFORE_CALL_10|) (select (select |#memory_int| |v_main_~#a1~0.base_BEFORE_CALL_10|) |v_main_~#a1~0.offset_BEFORE_CALL_10|)))) (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| v_prenex_39) v_prenex_37) (select (select |#memory_int| v_prenex_40) v_prenex_38))))) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-06 23:33:03,798 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initENTRY satisfy 144#(and (= |old(#NULL.base)| |#NULL.base|) (= |#valid| |old(#valid)|) (= |#NULL.offset| |old(#NULL.offset)|)) [2019-10-06 23:33:03,799 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION satisfy 140#(and (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond) (= 0 __VERIFIER_assert_~cond) (exists ((|v_main_~#a2~0.offset_BEFORE_CALL_10| Int) (v_prenex_38 Int) (|v_main_~#a1~0.offset_BEFORE_CALL_10| Int) (v_prenex_37 Int) (v_prenex_39 Int) (|v_main_~#a2~0.base_BEFORE_CALL_10| Int) (|v_main_~#a1~0.base_BEFORE_CALL_10| Int) (v_prenex_40 Int)) (or (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| |v_main_~#a2~0.base_BEFORE_CALL_10|) |v_main_~#a2~0.offset_BEFORE_CALL_10|) (select (select |#memory_int| |v_main_~#a1~0.base_BEFORE_CALL_10|) |v_main_~#a1~0.offset_BEFORE_CALL_10|)))) (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| v_prenex_39) v_prenex_37) (select (select |#memory_int| v_prenex_40) v_prenex_38))))) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-06 23:33:03,799 INFO L193 IcfgInterpreter]: Reachable states at location L17-3 satisfy 115#(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:33:03,799 INFO L193 IcfgInterpreter]: Reachable states at location L8-3 satisfy 72#true [2019-10-06 23:33:03,799 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:33:03,799 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:33:03,799 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initEXIT satisfy 149#(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:33:03,799 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.startENTRY satisfy 6#true [2019-10-06 23:33:03,800 INFO L193 IcfgInterpreter]: Reachable states at location L18 satisfy 120#(and (<= 100000 main_~a~0) (< main_~x~0 100000) (<= 0 main_~i~0) (= main_~x~0 0) (<= 100000 main_~i~0) (not (< main_~i~0 100000)) (= |main_#t~mem7| (select (select |#memory_int| |main_~#a2~0.base|) (+ (* 4 main_~x~0) |main_~#a2~0.offset|))) (<= main_~x~0 0) (<= 0 main_~x~0) (= (select (select |#memory_int| |main_~#a1~0.base|) (+ (* 4 main_~x~0) |main_~#a1~0.offset|)) |main_#t~mem6|)) [2019-10-06 23:33:03,800 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertENTRY satisfy 125#(exists ((|v_main_~#a2~0.offset_BEFORE_CALL_10| Int) (v_prenex_38 Int) (|v_main_~#a1~0.offset_BEFORE_CALL_10| Int) (v_prenex_37 Int) (v_prenex_39 Int) (|v_main_~#a2~0.base_BEFORE_CALL_10| Int) (|v_main_~#a1~0.base_BEFORE_CALL_10| Int) (v_prenex_40 Int)) (or (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| |v_main_~#a2~0.base_BEFORE_CALL_10|) |v_main_~#a2~0.offset_BEFORE_CALL_10|) (select (select |#memory_int| |v_main_~#a1~0.base_BEFORE_CALL_10|) |v_main_~#a1~0.offset_BEFORE_CALL_10|)))) (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| v_prenex_39) v_prenex_37) (select (select |#memory_int| v_prenex_40) v_prenex_38))))) [2019-10-06 23:33:03,800 INFO L193 IcfgInterpreter]: Reachable states at location L13-3 satisfy 110#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-06 23:33:05,262 INFO L211 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-06 23:33:05,263 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [38, 201, 201, 11] total 446 [2019-10-06 23:33:05,265 INFO L442 AbstractCegarLoop]: Interpolant automaton has 446 states [2019-10-06 23:33:05,273 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 446 interpolants. [2019-10-06 23:33:05,276 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=80531, Invalid=117939, Unknown=0, NotChecked=0, Total=198470 [2019-10-06 23:33:05,277 INFO L87 Difference]: Start difference. First operand 249 states and 251 transitions. Second operand 446 states. [2019-10-06 23:34:52,591 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-06 23:34:52,591 INFO L93 Difference]: Finished difference Result 504 states and 708 transitions. [2019-10-06 23:34:52,592 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 446 states. [2019-10-06 23:34:52,592 INFO L78 Accepts]: Start accepts. Automaton has 446 states. Word has length 245 [2019-10-06 23:34:52,593 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-06 23:34:52,596 INFO L225 Difference]: With dead ends: 504 [2019-10-06 23:34:52,596 INFO L226 Difference]: Without dead ends: 459 [2019-10-06 23:34:52,634 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 1214 GetRequests, 329 SyntacticMatches, 0 SemanticMatches, 885 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 146990 ImplicationChecksByTransitivity, 163.9s TimeCoverageRelationStatistics Valid=241659, Invalid=544223, Unknown=0, NotChecked=0, Total=785882 [2019-10-06 23:34:52,635 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 459 states. [2019-10-06 23:34:52,696 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 459 to 450. [2019-10-06 23:34:52,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 450 states. [2019-10-06 23:34:52,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 450 states to 450 states and 452 transitions. [2019-10-06 23:34:52,713 INFO L78 Accepts]: Start accepts. Automaton has 450 states and 452 transitions. Word has length 245 [2019-10-06 23:34:52,714 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-06 23:34:52,714 INFO L462 AbstractCegarLoop]: Abstraction has 450 states and 452 transitions. [2019-10-06 23:34:52,715 INFO L463 AbstractCegarLoop]: Interpolant automaton has 446 states. [2019-10-06 23:34:52,715 INFO L276 IsEmpty]: Start isEmpty. Operand 450 states and 452 transitions. [2019-10-06 23:34:52,746 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 447 [2019-10-06 23:34:52,746 INFO L377 BasicCegarLoop]: Found error trace [2019-10-06 23:34:52,746 INFO L385 BasicCegarLoop]: trace histogram [398, 36, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-06 23:34:52,962 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-06 23:34:52,963 INFO L410 AbstractCegarLoop]: === Iteration 13 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-06 23:34:52,963 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-06 23:34:52,963 INFO L82 PathProgramCache]: Analyzing trace with hash -110978749, now seen corresponding path program 11 times [2019-10-06 23:34:52,963 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-06 23:34:52,963 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-06 23:34:52,963 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-06 23:34:52,964 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-06 23:34:52,964 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-06 23:35:01,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-06 23:35:57,008 INFO L134 CoverageAnalysis]: Checked inductivity of 80067 backedges. 0 proven. 79401 refuted. 0 times theorem prover too weak. 666 trivial. 0 not checked. [2019-10-06 23:35:57,009 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-06 23:35:57,009 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2019-10-06 23:35:57,009 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 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-06 23:37:26,233 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 19 check-sat command(s) [2019-10-06 23:37:26,233 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-06 23:37:26,252 INFO L256 TraceCheckSpWp]: Trace formula consists of 494 conjuncts, 38 conjunts are in the unsatisfiable core [2019-10-06 23:37:26,261 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-06 23:37:33,158 INFO L134 CoverageAnalysis]: Checked inductivity of 80067 backedges. 0 proven. 666 refuted. 0 times theorem prover too weak. 79401 trivial. 0 not checked. [2019-10-06 23:37:33,158 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-06 23:37:40,471 INFO L134 CoverageAnalysis]: Checked inductivity of 80067 backedges. 0 proven. 666 refuted. 0 times theorem prover too weak. 79401 trivial. 0 not checked. [2019-10-06 23:37:40,471 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2019-10-06 23:37:40,473 INFO L162 IcfgInterpreter]: Started Sifa with 13 locations of interest [2019-10-06 23:37:40,473 INFO L169 IcfgInterpreter]: Building call graph [2019-10-06 23:37:40,473 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-06 23:37:40,474 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-06 23:37:40,474 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-06 23:37:40,489 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 21 for LOIs [2019-10-06 23:37:40,603 INFO L199 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 29 for LOIs [2019-10-06 23:37:40,608 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 10 for LOIs [2019-10-06 23:37:40,612 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-06 23:37:40,612 INFO L191 IcfgInterpreter]: Final predicates for locations of interest are: [2019-10-06 23:37:40,612 INFO L193 IcfgInterpreter]: Reachable states at location L2 satisfy 130#(and (exists ((|v_main_~#a1~0.offset_BEFORE_CALL_11| Int) (v_prenex_44 Int) (|v_main_~#a2~0.base_BEFORE_CALL_11| Int) (|v_main_~#a1~0.base_BEFORE_CALL_11| Int) (|v_main_~#a2~0.offset_BEFORE_CALL_11| Int) (v_prenex_41 Int) (v_prenex_43 Int) (v_prenex_42 Int)) (or (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| v_prenex_42) v_prenex_44) (select (select |#memory_int| v_prenex_43) v_prenex_41))) (and (not (= (select (select |#memory_int| |v_main_~#a2~0.base_BEFORE_CALL_11|) |v_main_~#a2~0.offset_BEFORE_CALL_11|) (select (select |#memory_int| |v_main_~#a1~0.base_BEFORE_CALL_11|) |v_main_~#a1~0.offset_BEFORE_CALL_11|))) (= |__VERIFIER_assert_#in~cond| 0)))) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-06 23:37:40,612 INFO L193 IcfgInterpreter]: Reachable states at location L2-1 satisfy 135#(and (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond) (exists ((|v_main_~#a1~0.offset_BEFORE_CALL_11| Int) (v_prenex_44 Int) (|v_main_~#a2~0.base_BEFORE_CALL_11| Int) (|v_main_~#a1~0.base_BEFORE_CALL_11| Int) (|v_main_~#a2~0.offset_BEFORE_CALL_11| Int) (v_prenex_41 Int) (v_prenex_43 Int) (v_prenex_42 Int)) (or (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| v_prenex_42) v_prenex_44) (select (select |#memory_int| v_prenex_43) v_prenex_41))) (and (not (= (select (select |#memory_int| |v_main_~#a2~0.base_BEFORE_CALL_11|) |v_main_~#a2~0.offset_BEFORE_CALL_11|) (select (select |#memory_int| |v_main_~#a1~0.base_BEFORE_CALL_11|) |v_main_~#a1~0.offset_BEFORE_CALL_11|))) (= |__VERIFIER_assert_#in~cond| 0)))) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-06 23:37:40,613 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initENTRY satisfy 144#(and (= |old(#NULL.base)| |#NULL.base|) (= |#valid| |old(#valid)|) (= |#NULL.offset| |old(#NULL.offset)|)) [2019-10-06 23:37:40,613 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION satisfy 140#(and (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond) (exists ((|v_main_~#a1~0.offset_BEFORE_CALL_11| Int) (v_prenex_44 Int) (|v_main_~#a2~0.base_BEFORE_CALL_11| Int) (|v_main_~#a1~0.base_BEFORE_CALL_11| Int) (|v_main_~#a2~0.offset_BEFORE_CALL_11| Int) (v_prenex_41 Int) (v_prenex_43 Int) (v_prenex_42 Int)) (or (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| v_prenex_42) v_prenex_44) (select (select |#memory_int| v_prenex_43) v_prenex_41))) (and (not (= (select (select |#memory_int| |v_main_~#a2~0.base_BEFORE_CALL_11|) |v_main_~#a2~0.offset_BEFORE_CALL_11|) (select (select |#memory_int| |v_main_~#a1~0.base_BEFORE_CALL_11|) |v_main_~#a1~0.offset_BEFORE_CALL_11|))) (= |__VERIFIER_assert_#in~cond| 0)))) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-06 23:37:40,613 INFO L193 IcfgInterpreter]: Reachable states at location L17-3 satisfy 115#(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:37:40,613 INFO L193 IcfgInterpreter]: Reachable states at location L8-3 satisfy 72#true [2019-10-06 23:37:40,613 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:37:40,614 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:37:40,614 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initEXIT satisfy 149#(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:37:40,614 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.startENTRY satisfy 6#true [2019-10-06 23:37:40,614 INFO L193 IcfgInterpreter]: Reachable states at location L18 satisfy 120#(and (<= 100000 main_~a~0) (< main_~x~0 100000) (<= 0 main_~i~0) (= main_~x~0 0) (<= 100000 main_~i~0) (not (< main_~i~0 100000)) (= |main_#t~mem7| (select (select |#memory_int| |main_~#a2~0.base|) (+ (* 4 main_~x~0) |main_~#a2~0.offset|))) (<= main_~x~0 0) (<= 0 main_~x~0) (= (select (select |#memory_int| |main_~#a1~0.base|) (+ (* 4 main_~x~0) |main_~#a1~0.offset|)) |main_#t~mem6|)) [2019-10-06 23:37:40,614 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertENTRY satisfy 125#(exists ((|v_main_~#a1~0.offset_BEFORE_CALL_11| Int) (v_prenex_44 Int) (|v_main_~#a2~0.base_BEFORE_CALL_11| Int) (|v_main_~#a1~0.base_BEFORE_CALL_11| Int) (|v_main_~#a2~0.offset_BEFORE_CALL_11| Int) (v_prenex_41 Int) (v_prenex_43 Int) (v_prenex_42 Int)) (or (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| v_prenex_42) v_prenex_44) (select (select |#memory_int| v_prenex_43) v_prenex_41))) (and (not (= (select (select |#memory_int| |v_main_~#a2~0.base_BEFORE_CALL_11|) |v_main_~#a2~0.offset_BEFORE_CALL_11|) (select (select |#memory_int| |v_main_~#a1~0.base_BEFORE_CALL_11|) |v_main_~#a1~0.offset_BEFORE_CALL_11|))) (= |__VERIFIER_assert_#in~cond| 0)))) [2019-10-06 23:37:40,614 INFO L193 IcfgInterpreter]: Reachable states at location L13-3 satisfy 110#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-06 23:37:43,170 INFO L211 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-06 23:37:43,171 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [401, 39, 39, 11] total 485 [2019-10-06 23:37:43,172 INFO L442 AbstractCegarLoop]: Interpolant automaton has 485 states [2019-10-06 23:37:43,179 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 485 interpolants. [2019-10-06 23:37:43,183 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=83078, Invalid=151662, Unknown=0, NotChecked=0, Total=234740 [2019-10-06 23:37:43,184 INFO L87 Difference]: Start difference. First operand 450 states and 452 transitions. Second operand 485 states. [2019-10-06 23:37:45,667 WARN L191 SmtUtils]: Spent 106.00 ms on a formula simplification that was a NOOP. DAG size: 14 [2019-10-06 23:39:58,282 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-06 23:39:58,282 INFO L93 Difference]: Finished difference Result 544 states and 586 transitions. [2019-10-06 23:39:58,283 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 485 states. [2019-10-06 23:39:58,283 INFO L78 Accepts]: Start accepts. Automaton has 485 states. Word has length 446 [2019-10-06 23:39:58,284 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-06 23:39:58,286 INFO L225 Difference]: With dead ends: 544 [2019-10-06 23:39:58,286 INFO L226 Difference]: Without dead ends: 498 [2019-10-06 23:39:58,310 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 2219 GetRequests, 1256 SyntacticMatches, 0 SemanticMatches, 963 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 166569 ImplicationChecksByTransitivity, 197.2s TimeCoverageRelationStatistics Valid=249376, Invalid=680884, Unknown=0, NotChecked=0, Total=930260 [2019-10-06 23:39:58,310 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 498 states. [2019-10-06 23:39:58,339 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 498 to 489. [2019-10-06 23:39:58,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 489 states. [2019-10-06 23:39:58,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 489 states to 489 states and 491 transitions. [2019-10-06 23:39:58,342 INFO L78 Accepts]: Start accepts. Automaton has 489 states and 491 transitions. Word has length 446 [2019-10-06 23:39:58,343 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-06 23:39:58,343 INFO L462 AbstractCegarLoop]: Abstraction has 489 states and 491 transitions. [2019-10-06 23:39:58,343 INFO L463 AbstractCegarLoop]: Interpolant automaton has 485 states. [2019-10-06 23:39:58,343 INFO L276 IsEmpty]: Start isEmpty. Operand 489 states and 491 transitions. [2019-10-06 23:39:58,352 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 486 [2019-10-06 23:39:58,352 INFO L377 BasicCegarLoop]: Found error trace [2019-10-06 23:39:58,353 INFO L385 BasicCegarLoop]: trace histogram [399, 74, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-06 23:39:58,567 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-06 23:39:58,568 INFO L410 AbstractCegarLoop]: === Iteration 14 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-06 23:39:58,568 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-06 23:39:58,569 INFO L82 PathProgramCache]: Analyzing trace with hash 1719014196, now seen corresponding path program 12 times [2019-10-06 23:39:58,569 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-06 23:39:58,569 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-06 23:39:58,569 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-06 23:39:58,570 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-06 23:39:58,570 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-06 23:40:04,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-06 23:40:07,277 INFO L134 CoverageAnalysis]: Checked inductivity of 82575 backedges. 0 proven. 2775 refuted. 0 times theorem prover too weak. 79800 trivial. 0 not checked. [2019-10-06 23:40:07,277 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-06 23:40:07,277 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2019-10-06 23:40:07,277 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 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-06 23:40:08,087 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-10-06 23:40:08,088 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-06 23:40:08,114 INFO L256 TraceCheckSpWp]: Trace formula consists of 3550 conjuncts, 401 conjunts are in the unsatisfiable core [2019-10-06 23:40:08,125 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-06 23:41:15,623 INFO L134 CoverageAnalysis]: Checked inductivity of 82575 backedges. 0 proven. 79800 refuted. 0 times theorem prover too weak. 2775 trivial. 0 not checked. [2019-10-06 23:41:15,623 INFO L322 TraceCheckSpWp]: Computing backward predicates...