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_copy6_ground-2.i -------------------------------------------------------------------------------- This is Ultimate 0.1.24-36ac518-m [2019-10-06 23:40:09,642 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-06 23:40:09,646 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-06 23:40:09,658 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-06 23:40:09,659 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-06 23:40:09,660 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-06 23:40:09,661 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-06 23:40:09,663 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-06 23:40:09,665 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-06 23:40:09,666 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-06 23:40:09,667 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-06 23:40:09,668 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-06 23:40:09,669 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-06 23:40:09,670 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-06 23:40:09,671 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-06 23:40:09,672 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-06 23:40:09,673 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-06 23:40:09,674 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-06 23:40:09,676 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-06 23:40:09,679 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-06 23:40:09,681 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-06 23:40:09,682 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-06 23:40:09,683 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-06 23:40:09,684 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-06 23:40:09,687 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-06 23:40:09,687 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-06 23:40:09,687 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-06 23:40:09,688 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-06 23:40:09,689 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-06 23:40:09,690 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-06 23:40:09,690 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-06 23:40:09,691 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-06 23:40:09,694 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-06 23:40:09,695 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-06 23:40:09,696 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-06 23:40:09,697 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-06 23:40:09,698 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-06 23:40:09,698 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-06 23:40:09,699 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-06 23:40:09,700 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-06 23:40:09,701 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-06 23:40:09,702 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:40:09,721 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-06 23:40:09,721 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-06 23:40:09,724 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-06 23:40:09,724 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-06 23:40:09,725 INFO L138 SettingsManager]: * Use SBE=true [2019-10-06 23:40:09,725 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-06 23:40:09,725 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-06 23:40:09,726 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-06 23:40:09,726 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-06 23:40:09,726 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-06 23:40:09,726 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-06 23:40:09,726 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-06 23:40:09,727 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-06 23:40:09,727 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-06 23:40:09,727 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-06 23:40:09,728 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-06 23:40:09,729 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-06 23:40:09,729 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-06 23:40:09,729 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-06 23:40:09,729 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-06 23:40:09,729 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-06 23:40:09,730 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-06 23:40:09,730 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-06 23:40:09,730 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-06 23:40:09,730 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-06 23:40:09,730 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-06 23:40:09,731 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-06 23:40:09,731 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-06 23:40:09,731 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:40:10,000 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-06 23:40:10,014 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-06 23:40:10,018 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-06 23:40:10,019 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-06 23:40:10,020 INFO L275 PluginConnector]: CDTParser initialized [2019-10-06 23:40:10,020 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-examples/standard_copy6_ground-2.i [2019-10-06 23:40:10,084 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d4ee6f4dc/70380392ef7e4fee84baa90c236a8109/FLAG49660935b [2019-10-06 23:40:10,579 INFO L306 CDTParser]: Found 1 translation units. [2019-10-06 23:40:10,580 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/array-examples/standard_copy6_ground-2.i [2019-10-06 23:40:10,587 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d4ee6f4dc/70380392ef7e4fee84baa90c236a8109/FLAG49660935b [2019-10-06 23:40:10,964 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d4ee6f4dc/70380392ef7e4fee84baa90c236a8109 [2019-10-06 23:40:10,975 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-06 23:40:10,977 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-06 23:40:10,978 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-06 23:40:10,978 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-06 23:40:10,982 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-06 23:40:10,983 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.10 11:40:10" (1/1) ... [2019-10-06 23:40:10,986 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2be43138 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.10 11:40:10, skipping insertion in model container [2019-10-06 23:40:10,986 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.10 11:40:10" (1/1) ... [2019-10-06 23:40:10,995 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-06 23:40:11,018 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-06 23:40:11,212 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-06 23:40:11,217 INFO L188 MainTranslator]: Completed pre-run [2019-10-06 23:40:11,250 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-06 23:40:11,352 INFO L192 MainTranslator]: Completed translation [2019-10-06 23:40:11,353 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.10 11:40:11 WrapperNode [2019-10-06 23:40:11,353 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-06 23:40:11,354 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-06 23:40:11,354 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-06 23:40:11,354 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-06 23:40:11,367 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.10 11:40:11" (1/1) ... [2019-10-06 23:40:11,367 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.10 11:40:11" (1/1) ... [2019-10-06 23:40:11,376 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.10 11:40:11" (1/1) ... [2019-10-06 23:40:11,377 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.10 11:40:11" (1/1) ... [2019-10-06 23:40:11,388 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.10 11:40:11" (1/1) ... [2019-10-06 23:40:11,396 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.10 11:40:11" (1/1) ... [2019-10-06 23:40:11,399 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.10 11:40:11" (1/1) ... [2019-10-06 23:40:11,404 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-06 23:40:11,404 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-06 23:40:11,405 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-06 23:40:11,405 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-06 23:40:11,406 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.10 11:40:11" (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:40:11,474 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-06 23:40:11,474 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-06 23:40:11,474 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2019-10-06 23:40:11,474 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-06 23:40:11,474 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-06 23:40:11,475 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2019-10-06 23:40:11,475 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-10-06 23:40:11,475 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-06 23:40:11,475 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-10-06 23:40:11,475 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-10-06 23:40:11,475 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-10-06 23:40:11,476 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-10-06 23:40:11,476 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-06 23:40:11,476 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-06 23:40:12,057 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-06 23:40:12,058 INFO L284 CfgBuilder]: Removed 8 assume(true) statements. [2019-10-06 23:40:12,059 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.10 11:40:12 BoogieIcfgContainer [2019-10-06 23:40:12,060 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-06 23:40:12,061 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-06 23:40:12,061 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-06 23:40:12,064 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-06 23:40:12,065 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.10 11:40:10" (1/3) ... [2019-10-06 23:40:12,066 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6bcdce09 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.10 11:40:12, skipping insertion in model container [2019-10-06 23:40:12,066 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.10 11:40:11" (2/3) ... [2019-10-06 23:40:12,066 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6bcdce09 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.10 11:40:12, skipping insertion in model container [2019-10-06 23:40:12,066 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.10 11:40:12" (3/3) ... [2019-10-06 23:40:12,068 INFO L109 eAbstractionObserver]: Analyzing ICFG standard_copy6_ground-2.i [2019-10-06 23:40:12,079 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-06 23:40:12,087 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-06 23:40:12,098 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-06 23:40:12,127 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-10-06 23:40:12,127 INFO L374 AbstractCegarLoop]: Hoare is true [2019-10-06 23:40:12,127 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-06 23:40:12,127 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-06 23:40:12,128 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-06 23:40:12,128 INFO L378 AbstractCegarLoop]: Difference is false [2019-10-06 23:40:12,129 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-06 23:40:12,129 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-06 23:40:12,148 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states. [2019-10-06 23:40:12,155 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-10-06 23:40:12,156 INFO L377 BasicCegarLoop]: Found error trace [2019-10-06 23:40:12,157 INFO L385 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-06 23:40:12,159 INFO L410 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-06 23:40:12,164 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-06 23:40:12,165 INFO L82 PathProgramCache]: Analyzing trace with hash 385694572, now seen corresponding path program 1 times [2019-10-06 23:40:12,172 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-06 23:40:12,172 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-06 23:40:12,173 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-06 23:40:12,173 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-06 23:40:12,173 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-06 23:40:12,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-06 23:40:12,354 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:40:12,355 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-06 23:40:12,355 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-06 23:40:12,356 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-06 23:40:12,360 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-06 23:40:12,376 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-06 23:40:12,377 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-06 23:40:12,380 INFO L87 Difference]: Start difference. First operand 24 states. Second operand 3 states. [2019-10-06 23:40:12,430 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-06 23:40:12,430 INFO L93 Difference]: Finished difference Result 43 states and 60 transitions. [2019-10-06 23:40:12,432 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-06 23:40:12,433 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 17 [2019-10-06 23:40:12,434 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-06 23:40:12,443 INFO L225 Difference]: With dead ends: 43 [2019-10-06 23:40:12,443 INFO L226 Difference]: Without dead ends: 22 [2019-10-06 23:40:12,446 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:40:12,461 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2019-10-06 23:40:12,478 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2019-10-06 23:40:12,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2019-10-06 23:40:12,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 29 transitions. [2019-10-06 23:40:12,485 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 29 transitions. Word has length 17 [2019-10-06 23:40:12,486 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-06 23:40:12,486 INFO L462 AbstractCegarLoop]: Abstraction has 22 states and 29 transitions. [2019-10-06 23:40:12,486 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-06 23:40:12,486 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 29 transitions. [2019-10-06 23:40:12,487 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-10-06 23:40:12,487 INFO L377 BasicCegarLoop]: Found error trace [2019-10-06 23:40:12,487 INFO L385 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-06 23:40:12,488 INFO L410 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-06 23:40:12,488 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-06 23:40:12,489 INFO L82 PathProgramCache]: Analyzing trace with hash 927885985, now seen corresponding path program 1 times [2019-10-06 23:40:12,489 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-06 23:40:12,489 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-06 23:40:12,489 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-06 23:40:12,490 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-06 23:40:12,490 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-06 23:40:12,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-06 23:40:12,570 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:40:12,570 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-06 23:40:12,571 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-06 23:40:12,572 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-06 23:40:12,574 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-06 23:40:12,575 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-06 23:40:12,575 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-06 23:40:12,575 INFO L87 Difference]: Start difference. First operand 22 states and 29 transitions. Second operand 3 states. [2019-10-06 23:40:12,659 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-06 23:40:12,659 INFO L93 Difference]: Finished difference Result 42 states and 60 transitions. [2019-10-06 23:40:12,660 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-06 23:40:12,660 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2019-10-06 23:40:12,660 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-06 23:40:12,661 INFO L225 Difference]: With dead ends: 42 [2019-10-06 23:40:12,661 INFO L226 Difference]: Without dead ends: 28 [2019-10-06 23:40:12,662 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:40:12,663 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2019-10-06 23:40:12,668 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2019-10-06 23:40:12,668 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2019-10-06 23:40:12,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 35 transitions. [2019-10-06 23:40:12,670 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 35 transitions. Word has length 18 [2019-10-06 23:40:12,670 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-06 23:40:12,670 INFO L462 AbstractCegarLoop]: Abstraction has 28 states and 35 transitions. [2019-10-06 23:40:12,670 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-06 23:40:12,670 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 35 transitions. [2019-10-06 23:40:12,671 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-10-06 23:40:12,671 INFO L377 BasicCegarLoop]: Found error trace [2019-10-06 23:40:12,672 INFO L385 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-06 23:40:12,672 INFO L410 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-06 23:40:12,672 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-06 23:40:12,673 INFO L82 PathProgramCache]: Analyzing trace with hash 1980665252, now seen corresponding path program 1 times [2019-10-06 23:40:12,673 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-06 23:40:12,673 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-06 23:40:12,673 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-06 23:40:12,673 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-06 23:40:12,674 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-06 23:40:12,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-06 23:40:12,797 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-10-06 23:40:12,798 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-06 23:40:12,798 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2019-10-06 23:40:12,798 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:40:12,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-06 23:40:12,878 INFO L256 TraceCheckSpWp]: Trace formula consists of 137 conjuncts, 3 conjunts are in the unsatisfiable core [2019-10-06 23:40:12,886 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-06 23:40:12,933 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-10-06 23:40:12,933 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-06 23:40:12,988 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-10-06 23:40:12,989 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2019-10-06 23:40:13,027 INFO L162 IcfgInterpreter]: Started Sifa with 18 locations of interest [2019-10-06 23:40:13,027 INFO L169 IcfgInterpreter]: Building call graph [2019-10-06 23:40:13,043 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-06 23:40:13,052 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-06 23:40:13,053 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-06 23:40:13,229 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 21 for LOIs [2019-10-06 23:40:13,712 WARN L191 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 41 [2019-10-06 23:40:14,343 WARN L191 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 41 [2019-10-06 23:40:15,130 WARN L191 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 38 [2019-10-06 23:40:15,223 INFO L199 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 29 for LOIs [2019-10-06 23:40:15,255 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 10 for LOIs [2019-10-06 23:40:15,270 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-06 23:40:15,270 INFO L191 IcfgInterpreter]: Final predicates for locations of interest are: [2019-10-06 23:40:15,271 INFO L193 IcfgInterpreter]: Reachable states at location L2 satisfy 346#(and (exists ((|v_main_~#a1~0.base_BEFORE_CALL_1| Int) (|v_main_~#a1~0.offset_BEFORE_CALL_1| Int) (v_prenex_4 Int) (v_prenex_2 Int) (v_prenex_3 Int) (v_prenex_1 Int) (|v_main_~#a7~0.base_BEFORE_CALL_1| Int) (|v_main_~#a7~0.offset_BEFORE_CALL_1| Int)) (or (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| |v_main_~#a7~0.base_BEFORE_CALL_1|) |v_main_~#a7~0.offset_BEFORE_CALL_1|) (select (select |#memory_int| |v_main_~#a1~0.base_BEFORE_CALL_1|) |v_main_~#a1~0.offset_BEFORE_CALL_1|))) (and (not (= (select (select |#memory_int| v_prenex_3) v_prenex_4) (select (select |#memory_int| v_prenex_1) v_prenex_2))) (= |__VERIFIER_assert_#in~cond| 0)))) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-06 23:40:15,271 INFO L193 IcfgInterpreter]: Reachable states at location L36-3 satisfy 331#(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:40:15,271 INFO L193 IcfgInterpreter]: Reachable states at location L2-1 satisfy 351#(and (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (exists ((|v_main_~#a1~0.base_BEFORE_CALL_1| Int) (|v_main_~#a1~0.offset_BEFORE_CALL_1| Int) (v_prenex_4 Int) (v_prenex_2 Int) (v_prenex_3 Int) (v_prenex_1 Int) (|v_main_~#a7~0.base_BEFORE_CALL_1| Int) (|v_main_~#a7~0.offset_BEFORE_CALL_1| Int)) (or (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| |v_main_~#a7~0.base_BEFORE_CALL_1|) |v_main_~#a7~0.offset_BEFORE_CALL_1|) (select (select |#memory_int| |v_main_~#a1~0.base_BEFORE_CALL_1|) |v_main_~#a1~0.offset_BEFORE_CALL_1|))) (and (not (= (select (select |#memory_int| v_prenex_3) v_prenex_4) (select (select |#memory_int| v_prenex_1) v_prenex_2))) (= |__VERIFIER_assert_#in~cond| 0)))) (<= 0 __VERIFIER_assert_~cond) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-06 23:40:15,272 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initENTRY satisfy 360#(and (= |old(#NULL.base)| |#NULL.base|) (= |#valid| |old(#valid)|) (= |#NULL.offset| |old(#NULL.offset)|)) [2019-10-06 23:40:15,272 INFO L193 IcfgInterpreter]: Reachable states at location L26-3 satisfy 240#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-06 23:40:15,273 INFO L193 IcfgInterpreter]: Reachable states at location L17-3 satisfy 111#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-06 23:40:15,273 INFO L193 IcfgInterpreter]: Reachable states at location L29-3 satisfy 283#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-06 23:40:15,274 INFO L193 IcfgInterpreter]: Reachable states at location L37 satisfy 336#(and (<= 100000 main_~a~0) (< main_~x~0 100000) (<= 0 main_~i~0) (= main_~x~0 0) (<= 100000 main_~i~0) (= |main_#t~mem16| (select (select |#memory_int| |main_~#a7~0.base|) (+ (* 4 main_~x~0) |main_~#a7~0.offset|))) (not (< main_~i~0 100000)) (<= main_~x~0 0) (= |main_#t~mem15| (select (select |#memory_int| |main_~#a1~0.base|) (+ (* 4 main_~x~0) |main_~#a1~0.offset|))) (<= 0 main_~x~0)) [2019-10-06 23:40:15,274 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:40:15,274 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:40:15,274 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initEXIT satisfy 365#(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:40:15,275 INFO L193 IcfgInterpreter]: Reachable states at location L20-3 satisfy 154#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-06 23:40:15,275 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.startENTRY satisfy 6#true [2019-10-06 23:40:15,275 INFO L193 IcfgInterpreter]: Reachable states at location L32-3 satisfy 326#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-06 23:40:15,275 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION satisfy 356#(and (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (exists ((|v_main_~#a1~0.base_BEFORE_CALL_1| Int) (|v_main_~#a1~0.offset_BEFORE_CALL_1| Int) (v_prenex_4 Int) (v_prenex_2 Int) (v_prenex_3 Int) (v_prenex_1 Int) (|v_main_~#a7~0.base_BEFORE_CALL_1| Int) (|v_main_~#a7~0.offset_BEFORE_CALL_1| Int)) (or (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| |v_main_~#a7~0.base_BEFORE_CALL_1|) |v_main_~#a7~0.offset_BEFORE_CALL_1|) (select (select |#memory_int| |v_main_~#a1~0.base_BEFORE_CALL_1|) |v_main_~#a1~0.offset_BEFORE_CALL_1|))) (and (not (= (select (select |#memory_int| v_prenex_3) v_prenex_4) (select (select |#memory_int| v_prenex_1) v_prenex_2))) (= |__VERIFIER_assert_#in~cond| 0)))) (<= 0 __VERIFIER_assert_~cond) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-06 23:40:15,276 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertENTRY satisfy 341#(exists ((|v_main_~#a1~0.base_BEFORE_CALL_1| Int) (|v_main_~#a1~0.offset_BEFORE_CALL_1| Int) (v_prenex_4 Int) (v_prenex_2 Int) (v_prenex_3 Int) (v_prenex_1 Int) (|v_main_~#a7~0.base_BEFORE_CALL_1| Int) (|v_main_~#a7~0.offset_BEFORE_CALL_1| Int)) (or (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| |v_main_~#a7~0.base_BEFORE_CALL_1|) |v_main_~#a7~0.offset_BEFORE_CALL_1|) (select (select |#memory_int| |v_main_~#a1~0.base_BEFORE_CALL_1|) |v_main_~#a1~0.offset_BEFORE_CALL_1|))) (and (not (= (select (select |#memory_int| v_prenex_3) v_prenex_4) (select (select |#memory_int| v_prenex_1) v_prenex_2))) (= |__VERIFIER_assert_#in~cond| 0)))) [2019-10-06 23:40:15,276 INFO L193 IcfgInterpreter]: Reachable states at location L23-3 satisfy 197#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-06 23:40:15,276 INFO L193 IcfgInterpreter]: Reachable states at location L13-3 satisfy 68#true [2019-10-06 23:40:15,647 INFO L211 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-06 23:40:15,647 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4, 11] total 18 [2019-10-06 23:40:15,649 INFO L442 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-10-06 23:40:15,649 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-10-06 23:40:15,650 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=257, Unknown=0, NotChecked=0, Total=306 [2019-10-06 23:40:15,650 INFO L87 Difference]: Start difference. First operand 28 states and 35 transitions. Second operand 18 states. [2019-10-06 23:40:16,494 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-06 23:40:16,494 INFO L93 Difference]: Finished difference Result 67 states and 89 transitions. [2019-10-06 23:40:16,495 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-10-06 23:40:16,496 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 24 [2019-10-06 23:40:16,496 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-06 23:40:16,497 INFO L225 Difference]: With dead ends: 67 [2019-10-06 23:40:16,497 INFO L226 Difference]: Without dead ends: 46 [2019-10-06 23:40:16,499 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 63 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 186 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=145, Invalid=785, Unknown=0, NotChecked=0, Total=930 [2019-10-06 23:40:16,500 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2019-10-06 23:40:16,507 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 37. [2019-10-06 23:40:16,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2019-10-06 23:40:16,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 44 transitions. [2019-10-06 23:40:16,509 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 44 transitions. Word has length 24 [2019-10-06 23:40:16,509 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-06 23:40:16,509 INFO L462 AbstractCegarLoop]: Abstraction has 37 states and 44 transitions. [2019-10-06 23:40:16,509 INFO L463 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-10-06 23:40:16,510 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 44 transitions. [2019-10-06 23:40:16,511 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-10-06 23:40:16,511 INFO L377 BasicCegarLoop]: Found error trace [2019-10-06 23:40:16,511 INFO L385 BasicCegarLoop]: trace histogram [4, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-06 23:40:16,716 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-06 23:40:16,716 INFO L410 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-06 23:40:16,717 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-06 23:40:16,717 INFO L82 PathProgramCache]: Analyzing trace with hash -1231684532, now seen corresponding path program 2 times [2019-10-06 23:40:16,717 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-06 23:40:16,717 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-06 23:40:16,717 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-06 23:40:16,718 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-06 23:40:16,718 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-06 23:40:16,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-06 23:40:16,877 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-10-06 23:40:16,878 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-06 23:40:16,878 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2019-10-06 23:40:16,878 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:40:16,959 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2019-10-06 23:40:16,960 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-06 23:40:16,961 INFO L256 TraceCheckSpWp]: Trace formula consists of 167 conjuncts, 4 conjunts are in the unsatisfiable core [2019-10-06 23:40:16,964 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-06 23:40:16,992 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2019-10-06 23:40:16,992 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-06 23:40:17,030 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2019-10-06 23:40:17,030 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2019-10-06 23:40:17,032 INFO L162 IcfgInterpreter]: Started Sifa with 18 locations of interest [2019-10-06 23:40:17,033 INFO L169 IcfgInterpreter]: Building call graph [2019-10-06 23:40:17,033 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-06 23:40:17,033 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-06 23:40:17,034 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-06 23:40:17,066 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 21 for LOIs [2019-10-06 23:40:18,459 INFO L199 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 29 for LOIs [2019-10-06 23:40:18,470 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 10 for LOIs [2019-10-06 23:40:18,473 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-06 23:40:18,473 INFO L191 IcfgInterpreter]: Final predicates for locations of interest are: [2019-10-06 23:40:18,473 INFO L193 IcfgInterpreter]: Reachable states at location L2 satisfy 346#(and (exists ((v_prenex_6 Int) (v_prenex_7 Int) (|v_main_~#a1~0.base_BEFORE_CALL_2| Int) (|v_main_~#a1~0.offset_BEFORE_CALL_2| Int) (v_prenex_5 Int) (|v_main_~#a7~0.base_BEFORE_CALL_2| Int) (|v_main_~#a7~0.offset_BEFORE_CALL_2| Int) (v_prenex_8 Int)) (or (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_~#a7~0.base_BEFORE_CALL_2|) |v_main_~#a7~0.offset_BEFORE_CALL_2|)))) (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))))) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-06 23:40:18,474 INFO L193 IcfgInterpreter]: Reachable states at location L36-3 satisfy 331#(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:40:18,474 INFO L193 IcfgInterpreter]: Reachable states at location L2-1 satisfy 351#(and (exists ((v_prenex_6 Int) (v_prenex_7 Int) (|v_main_~#a1~0.base_BEFORE_CALL_2| Int) (|v_main_~#a1~0.offset_BEFORE_CALL_2| Int) (v_prenex_5 Int) (|v_main_~#a7~0.base_BEFORE_CALL_2| Int) (|v_main_~#a7~0.offset_BEFORE_CALL_2| Int) (v_prenex_8 Int)) (or (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_~#a7~0.base_BEFORE_CALL_2|) |v_main_~#a7~0.offset_BEFORE_CALL_2|)))) (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))))) (<= __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:40:18,474 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initENTRY satisfy 360#(and (= |old(#NULL.base)| |#NULL.base|) (= |#valid| |old(#valid)|) (= |#NULL.offset| |old(#NULL.offset)|)) [2019-10-06 23:40:18,474 INFO L193 IcfgInterpreter]: Reachable states at location L26-3 satisfy 240#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-06 23:40:18,474 INFO L193 IcfgInterpreter]: Reachable states at location L17-3 satisfy 111#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-06 23:40:18,475 INFO L193 IcfgInterpreter]: Reachable states at location L29-3 satisfy 283#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-06 23:40:18,475 INFO L193 IcfgInterpreter]: Reachable states at location L37 satisfy 336#(and (<= 100000 main_~a~0) (< main_~x~0 100000) (<= 0 main_~i~0) (= main_~x~0 0) (<= 100000 main_~i~0) (= |main_#t~mem16| (select (select |#memory_int| |main_~#a7~0.base|) (+ (* 4 main_~x~0) |main_~#a7~0.offset|))) (not (< main_~i~0 100000)) (<= main_~x~0 0) (= |main_#t~mem15| (select (select |#memory_int| |main_~#a1~0.base|) (+ (* 4 main_~x~0) |main_~#a1~0.offset|))) (<= 0 main_~x~0)) [2019-10-06 23:40:18,475 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:40:18,475 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:40:18,475 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initEXIT satisfy 365#(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:40:18,476 INFO L193 IcfgInterpreter]: Reachable states at location L20-3 satisfy 154#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-06 23:40:18,476 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.startENTRY satisfy 6#true [2019-10-06 23:40:18,476 INFO L193 IcfgInterpreter]: Reachable states at location L32-3 satisfy 326#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-06 23:40:18,476 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION satisfy 356#(and (exists ((v_prenex_6 Int) (v_prenex_7 Int) (|v_main_~#a1~0.base_BEFORE_CALL_2| Int) (|v_main_~#a1~0.offset_BEFORE_CALL_2| Int) (v_prenex_5 Int) (|v_main_~#a7~0.base_BEFORE_CALL_2| Int) (|v_main_~#a7~0.offset_BEFORE_CALL_2| Int) (v_prenex_8 Int)) (or (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_~#a7~0.base_BEFORE_CALL_2|) |v_main_~#a7~0.offset_BEFORE_CALL_2|)))) (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))))) (<= __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:40:18,476 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertENTRY satisfy 341#(exists ((v_prenex_6 Int) (v_prenex_7 Int) (|v_main_~#a1~0.base_BEFORE_CALL_2| Int) (|v_main_~#a1~0.offset_BEFORE_CALL_2| Int) (v_prenex_5 Int) (|v_main_~#a7~0.base_BEFORE_CALL_2| Int) (|v_main_~#a7~0.offset_BEFORE_CALL_2| Int) (v_prenex_8 Int)) (or (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_~#a7~0.base_BEFORE_CALL_2|) |v_main_~#a7~0.offset_BEFORE_CALL_2|)))) (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))))) [2019-10-06 23:40:18,477 INFO L193 IcfgInterpreter]: Reachable states at location L23-3 satisfy 197#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-06 23:40:18,477 INFO L193 IcfgInterpreter]: Reachable states at location L13-3 satisfy 68#true [2019-10-06 23:40:18,805 INFO L211 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-06 23:40:18,805 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 5, 5, 11] total 23 [2019-10-06 23:40:18,807 INFO L442 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-10-06 23:40:18,807 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-10-06 23:40:18,808 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=429, Unknown=0, NotChecked=0, Total=506 [2019-10-06 23:40:18,808 INFO L87 Difference]: Start difference. First operand 37 states and 44 transitions. Second operand 23 states. [2019-10-06 23:40:19,948 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-06 23:40:19,948 INFO L93 Difference]: Finished difference Result 98 states and 136 transitions. [2019-10-06 23:40:19,949 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-10-06 23:40:19,949 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 33 [2019-10-06 23:40:19,949 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-06 23:40:19,951 INFO L225 Difference]: With dead ends: 98 [2019-10-06 23:40:19,952 INFO L226 Difference]: Without dead ends: 71 [2019-10-06 23:40:19,953 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 124 GetRequests, 85 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 373 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=237, Invalid=1403, Unknown=0, NotChecked=0, Total=1640 [2019-10-06 23:40:19,953 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2019-10-06 23:40:19,971 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 62. [2019-10-06 23:40:19,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2019-10-06 23:40:19,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 69 transitions. [2019-10-06 23:40:19,973 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 69 transitions. Word has length 33 [2019-10-06 23:40:19,973 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-06 23:40:19,973 INFO L462 AbstractCegarLoop]: Abstraction has 62 states and 69 transitions. [2019-10-06 23:40:19,974 INFO L463 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-10-06 23:40:19,974 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 69 transitions. [2019-10-06 23:40:19,975 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-10-06 23:40:19,976 INFO L377 BasicCegarLoop]: Found error trace [2019-10-06 23:40:19,976 INFO L385 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-06 23:40:20,188 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-06 23:40:20,188 INFO L410 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-06 23:40:20,189 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-06 23:40:20,189 INFO L82 PathProgramCache]: Analyzing trace with hash -652484159, now seen corresponding path program 3 times [2019-10-06 23:40:20,189 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-06 23:40:20,189 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-06 23:40:20,189 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-06 23:40:20,189 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-06 23:40:20,190 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-06 23:40:20,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-06 23:40:20,331 INFO L134 CoverageAnalysis]: Checked inductivity of 141 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 126 trivial. 0 not checked. [2019-10-06 23:40:20,331 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-06 23:40:20,331 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2019-10-06 23:40:20,331 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:40:20,435 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-10-06 23:40:20,435 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-06 23:40:20,436 INFO L256 TraceCheckSpWp]: Trace formula consists of 281 conjuncts, 7 conjunts are in the unsatisfiable core [2019-10-06 23:40:20,440 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-06 23:40:20,459 INFO L134 CoverageAnalysis]: Checked inductivity of 141 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 126 trivial. 0 not checked. [2019-10-06 23:40:20,459 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-06 23:40:20,553 INFO L134 CoverageAnalysis]: Checked inductivity of 141 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 126 trivial. 0 not checked. [2019-10-06 23:40:20,554 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2019-10-06 23:40:20,555 INFO L162 IcfgInterpreter]: Started Sifa with 18 locations of interest [2019-10-06 23:40:20,556 INFO L169 IcfgInterpreter]: Building call graph [2019-10-06 23:40:20,556 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-06 23:40:20,556 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-06 23:40:20,556 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-06 23:40:20,600 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 21 for LOIs [2019-10-06 23:40:21,925 INFO L199 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 29 for LOIs [2019-10-06 23:40:21,933 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 10 for LOIs [2019-10-06 23:40:21,937 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-06 23:40:21,937 INFO L191 IcfgInterpreter]: Final predicates for locations of interest are: [2019-10-06 23:40:21,938 INFO L193 IcfgInterpreter]: Reachable states at location L2 satisfy 346#(and (exists ((|v_main_~#a1~0.base_BEFORE_CALL_3| Int) (|v_main_~#a7~0.base_BEFORE_CALL_3| Int) (v_prenex_12 Int) (v_prenex_11 Int) (v_prenex_10 Int) (|v_main_~#a1~0.offset_BEFORE_CALL_3| Int) (|v_main_~#a7~0.offset_BEFORE_CALL_3| Int) (v_prenex_9 Int)) (or (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| |v_main_~#a7~0.base_BEFORE_CALL_3|) |v_main_~#a7~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_12) (select (select |#memory_int| v_prenex_9) v_prenex_11))))) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-06 23:40:21,938 INFO L193 IcfgInterpreter]: Reachable states at location L36-3 satisfy 331#(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:40:21,938 INFO L193 IcfgInterpreter]: Reachable states at location L2-1 satisfy 351#(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_main_~#a7~0.base_BEFORE_CALL_3| Int) (v_prenex_12 Int) (v_prenex_11 Int) (v_prenex_10 Int) (|v_main_~#a1~0.offset_BEFORE_CALL_3| Int) (|v_main_~#a7~0.offset_BEFORE_CALL_3| Int) (v_prenex_9 Int)) (or (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| |v_main_~#a7~0.base_BEFORE_CALL_3|) |v_main_~#a7~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_12) (select (select |#memory_int| v_prenex_9) v_prenex_11))))) (<= 0 __VERIFIER_assert_~cond) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-06 23:40:21,938 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initENTRY satisfy 360#(and (= |old(#NULL.base)| |#NULL.base|) (= |#valid| |old(#valid)|) (= |#NULL.offset| |old(#NULL.offset)|)) [2019-10-06 23:40:21,939 INFO L193 IcfgInterpreter]: Reachable states at location L26-3 satisfy 240#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-06 23:40:21,939 INFO L193 IcfgInterpreter]: Reachable states at location L17-3 satisfy 111#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-06 23:40:21,939 INFO L193 IcfgInterpreter]: Reachable states at location L29-3 satisfy 283#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-06 23:40:21,939 INFO L193 IcfgInterpreter]: Reachable states at location L37 satisfy 336#(and (<= 100000 main_~a~0) (< main_~x~0 100000) (<= 0 main_~i~0) (= main_~x~0 0) (<= 100000 main_~i~0) (= |main_#t~mem16| (select (select |#memory_int| |main_~#a7~0.base|) (+ (* 4 main_~x~0) |main_~#a7~0.offset|))) (not (< main_~i~0 100000)) (<= main_~x~0 0) (= |main_#t~mem15| (select (select |#memory_int| |main_~#a1~0.base|) (+ (* 4 main_~x~0) |main_~#a1~0.offset|))) (<= 0 main_~x~0)) [2019-10-06 23:40:21,939 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:40:21,940 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:40:21,940 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initEXIT satisfy 365#(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:40:21,940 INFO L193 IcfgInterpreter]: Reachable states at location L20-3 satisfy 154#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-06 23:40:21,940 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.startENTRY satisfy 6#true [2019-10-06 23:40:21,940 INFO L193 IcfgInterpreter]: Reachable states at location L32-3 satisfy 326#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-06 23:40:21,941 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION satisfy 356#(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_main_~#a7~0.base_BEFORE_CALL_3| Int) (v_prenex_12 Int) (v_prenex_11 Int) (v_prenex_10 Int) (|v_main_~#a1~0.offset_BEFORE_CALL_3| Int) (|v_main_~#a7~0.offset_BEFORE_CALL_3| Int) (v_prenex_9 Int)) (or (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| |v_main_~#a7~0.base_BEFORE_CALL_3|) |v_main_~#a7~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_12) (select (select |#memory_int| v_prenex_9) v_prenex_11))))) (<= 0 __VERIFIER_assert_~cond) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-06 23:40:21,941 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertENTRY satisfy 341#(exists ((|v_main_~#a1~0.base_BEFORE_CALL_3| Int) (|v_main_~#a7~0.base_BEFORE_CALL_3| Int) (v_prenex_12 Int) (v_prenex_11 Int) (v_prenex_10 Int) (|v_main_~#a1~0.offset_BEFORE_CALL_3| Int) (|v_main_~#a7~0.offset_BEFORE_CALL_3| Int) (v_prenex_9 Int)) (or (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| |v_main_~#a7~0.base_BEFORE_CALL_3|) |v_main_~#a7~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_12) (select (select |#memory_int| v_prenex_9) v_prenex_11))))) [2019-10-06 23:40:21,941 INFO L193 IcfgInterpreter]: Reachable states at location L23-3 satisfy 197#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-06 23:40:21,941 INFO L193 IcfgInterpreter]: Reachable states at location L13-3 satisfy 68#true [2019-10-06 23:40:22,226 INFO L211 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-06 23:40:22,227 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8, 11] total 25 [2019-10-06 23:40:22,228 INFO L442 AbstractCegarLoop]: Interpolant automaton has 25 states [2019-10-06 23:40:22,228 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2019-10-06 23:40:22,229 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=134, Invalid=466, Unknown=0, NotChecked=0, Total=600 [2019-10-06 23:40:22,229 INFO L87 Difference]: Start difference. First operand 62 states and 69 transitions. Second operand 25 states. [2019-10-06 23:40:23,098 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-06 23:40:23,099 INFO L93 Difference]: Finished difference Result 129 states and 149 transitions. [2019-10-06 23:40:23,099 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-10-06 23:40:23,099 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 58 [2019-10-06 23:40:23,099 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-06 23:40:23,100 INFO L225 Difference]: With dead ends: 129 [2019-10-06 23:40:23,100 INFO L226 Difference]: Without dead ends: 78 [2019-10-06 23:40:23,102 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 201 GetRequests, 159 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 504 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=369, Invalid=1523, Unknown=0, NotChecked=0, Total=1892 [2019-10-06 23:40:23,102 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2019-10-06 23:40:23,112 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 69. [2019-10-06 23:40:23,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2019-10-06 23:40:23,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 76 transitions. [2019-10-06 23:40:23,114 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 76 transitions. Word has length 58 [2019-10-06 23:40:23,114 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-06 23:40:23,115 INFO L462 AbstractCegarLoop]: Abstraction has 69 states and 76 transitions. [2019-10-06 23:40:23,115 INFO L463 AbstractCegarLoop]: Interpolant automaton has 25 states. [2019-10-06 23:40:23,115 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 76 transitions. [2019-10-06 23:40:23,116 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-10-06 23:40:23,116 INFO L377 BasicCegarLoop]: Found error trace [2019-10-06 23:40:23,117 INFO L385 BasicCegarLoop]: trace histogram [12, 6, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-06 23:40:23,320 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-06 23:40:23,321 INFO L410 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-06 23:40:23,322 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-06 23:40:23,322 INFO L82 PathProgramCache]: Analyzing trace with hash -1192954356, now seen corresponding path program 4 times [2019-10-06 23:40:23,322 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-06 23:40:23,323 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-06 23:40:23,323 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-06 23:40:23,323 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-06 23:40:23,324 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-06 23:40:23,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-06 23:40:23,578 INFO L134 CoverageAnalysis]: Checked inductivity of 204 backedges. 0 proven. 78 refuted. 0 times theorem prover too weak. 126 trivial. 0 not checked. [2019-10-06 23:40:23,578 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-06 23:40:23,578 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2019-10-06 23:40:23,579 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:40:23,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-06 23:40:23,695 INFO L256 TraceCheckSpWp]: Trace formula consists of 323 conjuncts, 14 conjunts are in the unsatisfiable core [2019-10-06 23:40:23,700 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-06 23:40:23,710 INFO L134 CoverageAnalysis]: Checked inductivity of 204 backedges. 0 proven. 78 refuted. 0 times theorem prover too weak. 126 trivial. 0 not checked. [2019-10-06 23:40:23,711 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-06 23:40:23,965 INFO L134 CoverageAnalysis]: Checked inductivity of 204 backedges. 0 proven. 78 refuted. 0 times theorem prover too weak. 126 trivial. 0 not checked. [2019-10-06 23:40:23,965 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2019-10-06 23:40:23,967 INFO L162 IcfgInterpreter]: Started Sifa with 18 locations of interest [2019-10-06 23:40:23,967 INFO L169 IcfgInterpreter]: Building call graph [2019-10-06 23:40:23,967 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-06 23:40:23,968 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-06 23:40:23,968 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-06 23:40:23,993 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 21 for LOIs [2019-10-06 23:40:24,636 WARN L191 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 38 [2019-10-06 23:40:25,273 INFO L199 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 29 for LOIs [2019-10-06 23:40:25,282 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 10 for LOIs [2019-10-06 23:40:25,286 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-06 23:40:25,286 INFO L191 IcfgInterpreter]: Final predicates for locations of interest are: [2019-10-06 23:40:25,287 INFO L193 IcfgInterpreter]: Reachable states at location L2 satisfy 346#(and (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond) (exists ((v_prenex_16 Int) (v_prenex_15 Int) (|v_main_~#a1~0.base_BEFORE_CALL_4| Int) (|v_main_~#a7~0.base_BEFORE_CALL_4| Int) (v_prenex_14 Int) (v_prenex_13 Int) (|v_main_~#a1~0.offset_BEFORE_CALL_4| Int) (|v_main_~#a7~0.offset_BEFORE_CALL_4| Int)) (or (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| v_prenex_14) v_prenex_16) (select (select |#memory_int| v_prenex_13) v_prenex_15)))) (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| |v_main_~#a7~0.base_BEFORE_CALL_4|) |v_main_~#a7~0.offset_BEFORE_CALL_4|) (select (select |#memory_int| |v_main_~#a1~0.base_BEFORE_CALL_4|) |v_main_~#a1~0.offset_BEFORE_CALL_4|)))))) [2019-10-06 23:40:25,287 INFO L193 IcfgInterpreter]: Reachable states at location L36-3 satisfy 331#(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:40:25,288 INFO L193 IcfgInterpreter]: Reachable states at location L2-1 satisfy 351#(and (<= __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) (exists ((v_prenex_16 Int) (v_prenex_15 Int) (|v_main_~#a1~0.base_BEFORE_CALL_4| Int) (|v_main_~#a7~0.base_BEFORE_CALL_4| Int) (v_prenex_14 Int) (v_prenex_13 Int) (|v_main_~#a1~0.offset_BEFORE_CALL_4| Int) (|v_main_~#a7~0.offset_BEFORE_CALL_4| Int)) (or (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| v_prenex_14) v_prenex_16) (select (select |#memory_int| v_prenex_13) v_prenex_15)))) (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| |v_main_~#a7~0.base_BEFORE_CALL_4|) |v_main_~#a7~0.offset_BEFORE_CALL_4|) (select (select |#memory_int| |v_main_~#a1~0.base_BEFORE_CALL_4|) |v_main_~#a1~0.offset_BEFORE_CALL_4|)))))) [2019-10-06 23:40:25,288 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initENTRY satisfy 360#(and (= |old(#NULL.base)| |#NULL.base|) (= |#valid| |old(#valid)|) (= |#NULL.offset| |old(#NULL.offset)|)) [2019-10-06 23:40:25,288 INFO L193 IcfgInterpreter]: Reachable states at location L26-3 satisfy 240#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-06 23:40:25,289 INFO L193 IcfgInterpreter]: Reachable states at location L17-3 satisfy 111#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-06 23:40:25,289 INFO L193 IcfgInterpreter]: Reachable states at location L29-3 satisfy 283#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-06 23:40:25,289 INFO L193 IcfgInterpreter]: Reachable states at location L37 satisfy 336#(and (<= 100000 main_~a~0) (< main_~x~0 100000) (<= 0 main_~i~0) (= main_~x~0 0) (<= 100000 main_~i~0) (= |main_#t~mem16| (select (select |#memory_int| |main_~#a7~0.base|) (+ (* 4 main_~x~0) |main_~#a7~0.offset|))) (not (< main_~i~0 100000)) (<= main_~x~0 0) (= |main_#t~mem15| (select (select |#memory_int| |main_~#a1~0.base|) (+ (* 4 main_~x~0) |main_~#a1~0.offset|))) (<= 0 main_~x~0)) [2019-10-06 23:40:25,289 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:40:25,289 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:40:25,290 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initEXIT satisfy 365#(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:40:25,290 INFO L193 IcfgInterpreter]: Reachable states at location L20-3 satisfy 154#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-06 23:40:25,290 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.startENTRY satisfy 6#true [2019-10-06 23:40:25,290 INFO L193 IcfgInterpreter]: Reachable states at location L32-3 satisfy 326#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-06 23:40:25,290 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION satisfy 356#(and (<= __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) (exists ((v_prenex_16 Int) (v_prenex_15 Int) (|v_main_~#a1~0.base_BEFORE_CALL_4| Int) (|v_main_~#a7~0.base_BEFORE_CALL_4| Int) (v_prenex_14 Int) (v_prenex_13 Int) (|v_main_~#a1~0.offset_BEFORE_CALL_4| Int) (|v_main_~#a7~0.offset_BEFORE_CALL_4| Int)) (or (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| v_prenex_14) v_prenex_16) (select (select |#memory_int| v_prenex_13) v_prenex_15)))) (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| |v_main_~#a7~0.base_BEFORE_CALL_4|) |v_main_~#a7~0.offset_BEFORE_CALL_4|) (select (select |#memory_int| |v_main_~#a1~0.base_BEFORE_CALL_4|) |v_main_~#a1~0.offset_BEFORE_CALL_4|)))))) [2019-10-06 23:40:25,291 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertENTRY satisfy 341#(exists ((v_prenex_16 Int) (v_prenex_15 Int) (|v_main_~#a1~0.base_BEFORE_CALL_4| Int) (|v_main_~#a7~0.base_BEFORE_CALL_4| Int) (v_prenex_14 Int) (v_prenex_13 Int) (|v_main_~#a1~0.offset_BEFORE_CALL_4| Int) (|v_main_~#a7~0.offset_BEFORE_CALL_4| Int)) (or (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| v_prenex_14) v_prenex_16) (select (select |#memory_int| v_prenex_13) v_prenex_15)))) (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| |v_main_~#a7~0.base_BEFORE_CALL_4|) |v_main_~#a7~0.offset_BEFORE_CALL_4|) (select (select |#memory_int| |v_main_~#a1~0.base_BEFORE_CALL_4|) |v_main_~#a1~0.offset_BEFORE_CALL_4|))))) [2019-10-06 23:40:25,291 INFO L193 IcfgInterpreter]: Reachable states at location L23-3 satisfy 197#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-06 23:40:25,291 INFO L193 IcfgInterpreter]: Reachable states at location L13-3 satisfy 68#true [2019-10-06 23:40:25,632 INFO L211 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-06 23:40:25,633 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15, 15, 11] total 39 [2019-10-06 23:40:25,635 INFO L442 AbstractCegarLoop]: Interpolant automaton has 39 states [2019-10-06 23:40:25,635 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2019-10-06 23:40:25,636 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=435, Invalid=1047, Unknown=0, NotChecked=0, Total=1482 [2019-10-06 23:40:25,636 INFO L87 Difference]: Start difference. First operand 69 states and 76 transitions. Second operand 39 states. [2019-10-06 23:40:27,053 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-06 23:40:27,053 INFO L93 Difference]: Finished difference Result 143 states and 170 transitions. [2019-10-06 23:40:27,054 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2019-10-06 23:40:27,054 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 65 [2019-10-06 23:40:27,054 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-06 23:40:27,055 INFO L225 Difference]: With dead ends: 143 [2019-10-06 23:40:27,055 INFO L226 Difference]: Without dead ends: 92 [2019-10-06 23:40:27,063 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 243 GetRequests, 173 SyntacticMatches, 0 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1274 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=1244, Invalid=3868, Unknown=0, NotChecked=0, Total=5112 [2019-10-06 23:40:27,064 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2019-10-06 23:40:27,084 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 83. [2019-10-06 23:40:27,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. [2019-10-06 23:40:27,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 90 transitions. [2019-10-06 23:40:27,087 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 90 transitions. Word has length 65 [2019-10-06 23:40:27,087 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-06 23:40:27,087 INFO L462 AbstractCegarLoop]: Abstraction has 83 states and 90 transitions. [2019-10-06 23:40:27,087 INFO L463 AbstractCegarLoop]: Interpolant automaton has 39 states. [2019-10-06 23:40:27,090 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 90 transitions. [2019-10-06 23:40:27,092 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2019-10-06 23:40:27,092 INFO L377 BasicCegarLoop]: Found error trace [2019-10-06 23:40:27,092 INFO L385 BasicCegarLoop]: trace histogram [26, 6, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-06 23:40:27,297 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-06 23:40:27,298 INFO L410 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-06 23:40:27,298 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-06 23:40:27,298 INFO L82 PathProgramCache]: Analyzing trace with hash -1089225620, now seen corresponding path program 5 times [2019-10-06 23:40:27,298 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-06 23:40:27,299 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-06 23:40:27,299 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-06 23:40:27,299 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-06 23:40:27,299 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-06 23:40:27,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-06 23:40:27,760 INFO L134 CoverageAnalysis]: Checked inductivity of 477 backedges. 0 proven. 351 refuted. 0 times theorem prover too weak. 126 trivial. 0 not checked. [2019-10-06 23:40:27,761 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-06 23:40:27,761 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2019-10-06 23:40:27,761 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:40:29,075 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2019-10-06 23:40:29,075 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-06 23:40:29,078 INFO L256 TraceCheckSpWp]: Trace formula consists of 287 conjuncts, 15 conjunts are in the unsatisfiable core [2019-10-06 23:40:29,081 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-06 23:40:29,211 INFO L134 CoverageAnalysis]: Checked inductivity of 477 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 456 trivial. 0 not checked. [2019-10-06 23:40:29,211 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-06 23:40:29,370 INFO L134 CoverageAnalysis]: Checked inductivity of 477 backedges. 0 proven. 27 refuted. 0 times theorem prover too weak. 450 trivial. 0 not checked. [2019-10-06 23:40:29,370 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2019-10-06 23:40:29,371 INFO L162 IcfgInterpreter]: Started Sifa with 18 locations of interest [2019-10-06 23:40:29,371 INFO L169 IcfgInterpreter]: Building call graph [2019-10-06 23:40:29,372 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-06 23:40:29,372 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-06 23:40:29,372 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-06 23:40:29,387 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 21 for LOIs [2019-10-06 23:40:30,384 WARN L191 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 38 [2019-10-06 23:40:30,625 INFO L199 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 29 for LOIs [2019-10-06 23:40:30,638 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 10 for LOIs [2019-10-06 23:40:30,642 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-06 23:40:30,643 INFO L191 IcfgInterpreter]: Final predicates for locations of interest are: [2019-10-06 23:40:30,643 INFO L193 IcfgInterpreter]: Reachable states at location L2 satisfy 346#(and (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond) (exists ((v_prenex_18 Int) (v_prenex_17 Int) (|v_main_~#a7~0.base_BEFORE_CALL_5| Int) (|v_main_~#a7~0.offset_BEFORE_CALL_5| Int) (v_prenex_20 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_17) v_prenex_18) (select (select |#memory_int| v_prenex_19) v_prenex_20))) (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| |v_main_~#a7~0.base_BEFORE_CALL_5|) |v_main_~#a7~0.offset_BEFORE_CALL_5|) (select (select |#memory_int| |v_main_~#a1~0.base_BEFORE_CALL_5|) |v_main_~#a1~0.offset_BEFORE_CALL_5|))))))) [2019-10-06 23:40:30,644 INFO L193 IcfgInterpreter]: Reachable states at location L36-3 satisfy 331#(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:40:30,644 INFO L193 IcfgInterpreter]: Reachable states at location L2-1 satisfy 351#(and (<= __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) (exists ((v_prenex_18 Int) (v_prenex_17 Int) (|v_main_~#a7~0.base_BEFORE_CALL_5| Int) (|v_main_~#a7~0.offset_BEFORE_CALL_5| Int) (v_prenex_20 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_17) v_prenex_18) (select (select |#memory_int| v_prenex_19) v_prenex_20))) (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| |v_main_~#a7~0.base_BEFORE_CALL_5|) |v_main_~#a7~0.offset_BEFORE_CALL_5|) (select (select |#memory_int| |v_main_~#a1~0.base_BEFORE_CALL_5|) |v_main_~#a1~0.offset_BEFORE_CALL_5|))))))) [2019-10-06 23:40:30,644 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initENTRY satisfy 360#(and (= |old(#NULL.base)| |#NULL.base|) (= |#valid| |old(#valid)|) (= |#NULL.offset| |old(#NULL.offset)|)) [2019-10-06 23:40:30,645 INFO L193 IcfgInterpreter]: Reachable states at location L26-3 satisfy 240#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-06 23:40:30,645 INFO L193 IcfgInterpreter]: Reachable states at location L17-3 satisfy 111#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-06 23:40:30,645 INFO L193 IcfgInterpreter]: Reachable states at location L29-3 satisfy 283#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-06 23:40:30,646 INFO L193 IcfgInterpreter]: Reachable states at location L37 satisfy 336#(and (<= 100000 main_~a~0) (< main_~x~0 100000) (<= 0 main_~i~0) (= main_~x~0 0) (<= 100000 main_~i~0) (= |main_#t~mem16| (select (select |#memory_int| |main_~#a7~0.base|) (+ (* 4 main_~x~0) |main_~#a7~0.offset|))) (not (< main_~i~0 100000)) (<= main_~x~0 0) (= |main_#t~mem15| (select (select |#memory_int| |main_~#a1~0.base|) (+ (* 4 main_~x~0) |main_~#a1~0.offset|))) (<= 0 main_~x~0)) [2019-10-06 23:40:30,646 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:40:30,646 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:40:30,647 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initEXIT satisfy 365#(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:40:30,647 INFO L193 IcfgInterpreter]: Reachable states at location L20-3 satisfy 154#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-06 23:40:30,647 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.startENTRY satisfy 6#true [2019-10-06 23:40:30,647 INFO L193 IcfgInterpreter]: Reachable states at location L32-3 satisfy 326#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-06 23:40:30,648 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION satisfy 356#(and (<= __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) (exists ((v_prenex_18 Int) (v_prenex_17 Int) (|v_main_~#a7~0.base_BEFORE_CALL_5| Int) (|v_main_~#a7~0.offset_BEFORE_CALL_5| Int) (v_prenex_20 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_17) v_prenex_18) (select (select |#memory_int| v_prenex_19) v_prenex_20))) (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| |v_main_~#a7~0.base_BEFORE_CALL_5|) |v_main_~#a7~0.offset_BEFORE_CALL_5|) (select (select |#memory_int| |v_main_~#a1~0.base_BEFORE_CALL_5|) |v_main_~#a1~0.offset_BEFORE_CALL_5|))))))) [2019-10-06 23:40:30,648 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertENTRY satisfy 341#(exists ((v_prenex_18 Int) (v_prenex_17 Int) (|v_main_~#a7~0.base_BEFORE_CALL_5| Int) (|v_main_~#a7~0.offset_BEFORE_CALL_5| Int) (v_prenex_20 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_17) v_prenex_18) (select (select |#memory_int| v_prenex_19) v_prenex_20))) (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| |v_main_~#a7~0.base_BEFORE_CALL_5|) |v_main_~#a7~0.offset_BEFORE_CALL_5|) (select (select |#memory_int| |v_main_~#a1~0.base_BEFORE_CALL_5|) |v_main_~#a1~0.offset_BEFORE_CALL_5|)))))) [2019-10-06 23:40:30,649 INFO L193 IcfgInterpreter]: Reachable states at location L23-3 satisfy 197#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-06 23:40:30,649 INFO L193 IcfgInterpreter]: Reachable states at location L13-3 satisfy 68#true [2019-10-06 23:40:31,299 INFO L211 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-06 23:40:31,299 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 9, 9, 11] total 53 [2019-10-06 23:40:31,300 INFO L442 AbstractCegarLoop]: Interpolant automaton has 53 states [2019-10-06 23:40:31,301 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2019-10-06 23:40:31,302 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=554, Invalid=2202, Unknown=0, NotChecked=0, Total=2756 [2019-10-06 23:40:31,302 INFO L87 Difference]: Start difference. First operand 83 states and 90 transitions. Second operand 53 states. [2019-10-06 23:40:34,691 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-06 23:40:34,691 INFO L93 Difference]: Finished difference Result 192 states and 254 transitions. [2019-10-06 23:40:34,692 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2019-10-06 23:40:34,692 INFO L78 Accepts]: Start accepts. Automaton has 53 states. Word has length 79 [2019-10-06 23:40:34,693 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-06 23:40:34,694 INFO L225 Difference]: With dead ends: 192 [2019-10-06 23:40:34,695 INFO L226 Difference]: Without dead ends: 141 [2019-10-06 23:40:34,698 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 314 GetRequests, 215 SyntacticMatches, 0 SemanticMatches, 99 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2334 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=1684, Invalid=8416, Unknown=0, NotChecked=0, Total=10100 [2019-10-06 23:40:34,699 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2019-10-06 23:40:34,713 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 132. [2019-10-06 23:40:34,713 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 132 states. [2019-10-06 23:40:34,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 139 transitions. [2019-10-06 23:40:34,715 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 139 transitions. Word has length 79 [2019-10-06 23:40:34,716 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-06 23:40:34,716 INFO L462 AbstractCegarLoop]: Abstraction has 132 states and 139 transitions. [2019-10-06 23:40:34,716 INFO L463 AbstractCegarLoop]: Interpolant automaton has 53 states. [2019-10-06 23:40:34,716 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 139 transitions. [2019-10-06 23:40:34,720 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2019-10-06 23:40:34,721 INFO L377 BasicCegarLoop]: Found error trace [2019-10-06 23:40:34,721 INFO L385 BasicCegarLoop]: trace histogram [27, 14, 14, 14, 14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-06 23:40:34,928 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-06 23:40:34,929 INFO L410 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-06 23:40:34,929 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-06 23:40:34,930 INFO L82 PathProgramCache]: Analyzing trace with hash 1390226785, now seen corresponding path program 6 times [2019-10-06 23:40:34,930 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-06 23:40:34,930 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-06 23:40:34,930 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-06 23:40:34,931 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-06 23:40:34,931 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-06 23:40:35,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-06 23:40:35,401 INFO L134 CoverageAnalysis]: Checked inductivity of 1008 backedges. 0 proven. 378 refuted. 0 times theorem prover too weak. 630 trivial. 0 not checked. [2019-10-06 23:40:35,401 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-06 23:40:35,401 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2019-10-06 23:40:35,401 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:40:35,615 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-10-06 23:40:35,615 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-06 23:40:35,617 INFO L256 TraceCheckSpWp]: Trace formula consists of 605 conjuncts, 29 conjunts are in the unsatisfiable core [2019-10-06 23:40:35,622 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-06 23:40:35,650 INFO L134 CoverageAnalysis]: Checked inductivity of 1008 backedges. 0 proven. 378 refuted. 0 times theorem prover too weak. 630 trivial. 0 not checked. [2019-10-06 23:40:35,650 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-06 23:40:36,561 INFO L134 CoverageAnalysis]: Checked inductivity of 1008 backedges. 0 proven. 378 refuted. 0 times theorem prover too weak. 630 trivial. 0 not checked. [2019-10-06 23:40:36,561 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2019-10-06 23:40:36,563 INFO L162 IcfgInterpreter]: Started Sifa with 18 locations of interest [2019-10-06 23:40:36,563 INFO L169 IcfgInterpreter]: Building call graph [2019-10-06 23:40:36,564 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-06 23:40:36,564 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-06 23:40:36,564 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-06 23:40:36,587 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 21 for LOIs [2019-10-06 23:40:37,029 WARN L191 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 38 [2019-10-06 23:40:37,635 WARN L191 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 38 [2019-10-06 23:40:37,877 INFO L199 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 29 for LOIs [2019-10-06 23:40:37,882 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 10 for LOIs [2019-10-06 23:40:37,885 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-06 23:40:37,885 INFO L191 IcfgInterpreter]: Final predicates for locations of interest are: [2019-10-06 23:40:37,885 INFO L193 IcfgInterpreter]: Reachable states at location L2 satisfy 346#(and (exists ((v_prenex_23 Int) (v_prenex_22 Int) (v_prenex_24 Int) (|v_main_~#a7~0.base_BEFORE_CALL_6| Int) (|v_main_~#a7~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| 0) (not (= (select (select |#memory_int| v_prenex_23) v_prenex_24) (select (select |#memory_int| v_prenex_21) v_prenex_22)))) (and (= (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_~#a7~0.base_BEFORE_CALL_6|) |v_main_~#a7~0.offset_BEFORE_CALL_6|)) (= |__VERIFIER_assert_#in~cond| 1)))) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-06 23:40:37,886 INFO L193 IcfgInterpreter]: Reachable states at location L36-3 satisfy 331#(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:40:37,886 INFO L193 IcfgInterpreter]: Reachable states at location L2-1 satisfy 351#(and (<= __VERIFIER_assert_~cond 0) (exists ((v_prenex_23 Int) (v_prenex_22 Int) (v_prenex_24 Int) (|v_main_~#a7~0.base_BEFORE_CALL_6| Int) (|v_main_~#a7~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| 0) (not (= (select (select |#memory_int| v_prenex_23) v_prenex_24) (select (select |#memory_int| v_prenex_21) v_prenex_22)))) (and (= (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_~#a7~0.base_BEFORE_CALL_6|) |v_main_~#a7~0.offset_BEFORE_CALL_6|)) (= |__VERIFIER_assert_#in~cond| 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:40:37,886 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initENTRY satisfy 360#(and (= |old(#NULL.base)| |#NULL.base|) (= |#valid| |old(#valid)|) (= |#NULL.offset| |old(#NULL.offset)|)) [2019-10-06 23:40:37,886 INFO L193 IcfgInterpreter]: Reachable states at location L26-3 satisfy 240#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-06 23:40:37,886 INFO L193 IcfgInterpreter]: Reachable states at location L17-3 satisfy 111#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-06 23:40:37,886 INFO L193 IcfgInterpreter]: Reachable states at location L29-3 satisfy 283#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-06 23:40:37,887 INFO L193 IcfgInterpreter]: Reachable states at location L37 satisfy 336#(and (<= 100000 main_~a~0) (< main_~x~0 100000) (<= 0 main_~i~0) (= main_~x~0 0) (<= 100000 main_~i~0) (= |main_#t~mem16| (select (select |#memory_int| |main_~#a7~0.base|) (+ (* 4 main_~x~0) |main_~#a7~0.offset|))) (not (< main_~i~0 100000)) (<= main_~x~0 0) (= |main_#t~mem15| (select (select |#memory_int| |main_~#a1~0.base|) (+ (* 4 main_~x~0) |main_~#a1~0.offset|))) (<= 0 main_~x~0)) [2019-10-06 23:40:37,887 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:40:37,887 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:40:37,887 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initEXIT satisfy 365#(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:40:37,887 INFO L193 IcfgInterpreter]: Reachable states at location L20-3 satisfy 154#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-06 23:40:37,887 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.startENTRY satisfy 6#true [2019-10-06 23:40:37,888 INFO L193 IcfgInterpreter]: Reachable states at location L32-3 satisfy 326#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-06 23:40:37,888 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION satisfy 356#(and (<= __VERIFIER_assert_~cond 0) (exists ((v_prenex_23 Int) (v_prenex_22 Int) (v_prenex_24 Int) (|v_main_~#a7~0.base_BEFORE_CALL_6| Int) (|v_main_~#a7~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| 0) (not (= (select (select |#memory_int| v_prenex_23) v_prenex_24) (select (select |#memory_int| v_prenex_21) v_prenex_22)))) (and (= (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_~#a7~0.base_BEFORE_CALL_6|) |v_main_~#a7~0.offset_BEFORE_CALL_6|)) (= |__VERIFIER_assert_#in~cond| 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:40:37,888 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertENTRY satisfy 341#(exists ((v_prenex_23 Int) (v_prenex_22 Int) (v_prenex_24 Int) (|v_main_~#a7~0.base_BEFORE_CALL_6| Int) (|v_main_~#a7~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| 0) (not (= (select (select |#memory_int| v_prenex_23) v_prenex_24) (select (select |#memory_int| v_prenex_21) v_prenex_22)))) (and (= (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_~#a7~0.base_BEFORE_CALL_6|) |v_main_~#a7~0.offset_BEFORE_CALL_6|)) (= |__VERIFIER_assert_#in~cond| 1)))) [2019-10-06 23:40:37,888 INFO L193 IcfgInterpreter]: Reachable states at location L23-3 satisfy 197#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-06 23:40:37,888 INFO L193 IcfgInterpreter]: Reachable states at location L13-3 satisfy 68#true [2019-10-06 23:40:38,266 INFO L211 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-06 23:40:38,267 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 30, 30, 11] total 69 [2019-10-06 23:40:38,268 INFO L442 AbstractCegarLoop]: Interpolant automaton has 69 states [2019-10-06 23:40:38,269 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 69 interpolants. [2019-10-06 23:40:38,270 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1740, Invalid=2952, Unknown=0, NotChecked=0, Total=4692 [2019-10-06 23:40:38,270 INFO L87 Difference]: Start difference. First operand 132 states and 139 transitions. Second operand 69 states. [2019-10-06 23:40:41,614 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-06 23:40:41,614 INFO L93 Difference]: Finished difference Result 269 states and 311 transitions. [2019-10-06 23:40:41,615 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 68 states. [2019-10-06 23:40:41,615 INFO L78 Accepts]: Start accepts. Automaton has 69 states. Word has length 128 [2019-10-06 23:40:41,615 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-06 23:40:41,617 INFO L225 Difference]: With dead ends: 269 [2019-10-06 23:40:41,617 INFO L226 Difference]: Without dead ends: 170 [2019-10-06 23:40:41,623 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 477 GetRequests, 347 SyntacticMatches, 0 SemanticMatches, 130 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3749 ImplicationChecksByTransitivity, 4.4s TimeCoverageRelationStatistics Valid=5099, Invalid=12193, Unknown=0, NotChecked=0, Total=17292 [2019-10-06 23:40:41,623 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 170 states. [2019-10-06 23:40:41,641 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 170 to 161. [2019-10-06 23:40:41,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 161 states. [2019-10-06 23:40:41,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161 states to 161 states and 168 transitions. [2019-10-06 23:40:41,643 INFO L78 Accepts]: Start accepts. Automaton has 161 states and 168 transitions. Word has length 128 [2019-10-06 23:40:41,643 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-06 23:40:41,644 INFO L462 AbstractCegarLoop]: Abstraction has 161 states and 168 transitions. [2019-10-06 23:40:41,644 INFO L463 AbstractCegarLoop]: Interpolant automaton has 69 states. [2019-10-06 23:40:41,644 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 168 transitions. [2019-10-06 23:40:41,646 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2019-10-06 23:40:41,647 INFO L377 BasicCegarLoop]: Found error trace [2019-10-06 23:40:41,647 INFO L385 BasicCegarLoop]: trace histogram [56, 14, 14, 14, 14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-06 23:40:41,852 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-06 23:40:41,852 INFO L410 AbstractCegarLoop]: === Iteration 9 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-06 23:40:41,853 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-06 23:40:41,853 INFO L82 PathProgramCache]: Analyzing trace with hash -412242356, now seen corresponding path program 7 times [2019-10-06 23:40:41,853 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-06 23:40:41,853 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-06 23:40:41,854 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-06 23:40:41,854 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-06 23:40:41,854 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-06 23:40:41,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-06 23:40:43,387 INFO L134 CoverageAnalysis]: Checked inductivity of 2226 backedges. 0 proven. 1596 refuted. 0 times theorem prover too weak. 630 trivial. 0 not checked. [2019-10-06 23:40:43,387 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-06 23:40:43,387 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2019-10-06 23:40:43,388 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:40:43,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-06 23:40:43,657 INFO L256 TraceCheckSpWp]: Trace formula consists of 779 conjuncts, 58 conjunts are in the unsatisfiable core [2019-10-06 23:40:43,662 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-06 23:40:43,698 INFO L134 CoverageAnalysis]: Checked inductivity of 2226 backedges. 0 proven. 1596 refuted. 0 times theorem prover too weak. 630 trivial. 0 not checked. [2019-10-06 23:40:43,699 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-06 23:40:47,319 INFO L134 CoverageAnalysis]: Checked inductivity of 2226 backedges. 0 proven. 1596 refuted. 0 times theorem prover too weak. 630 trivial. 0 not checked. [2019-10-06 23:40:47,319 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2019-10-06 23:40:47,321 INFO L162 IcfgInterpreter]: Started Sifa with 18 locations of interest [2019-10-06 23:40:47,321 INFO L169 IcfgInterpreter]: Building call graph [2019-10-06 23:40:47,321 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-06 23:40:47,322 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-06 23:40:47,322 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-06 23:40:47,340 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 21 for LOIs [2019-10-06 23:40:47,972 WARN L191 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 41 [2019-10-06 23:40:48,198 WARN L191 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 38 [2019-10-06 23:40:48,464 WARN L191 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 38 [2019-10-06 23:40:48,752 WARN L191 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 41 [2019-10-06 23:40:48,811 INFO L199 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 29 for LOIs [2019-10-06 23:40:48,824 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 10 for LOIs [2019-10-06 23:40:48,827 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-06 23:40:48,827 INFO L191 IcfgInterpreter]: Final predicates for locations of interest are: [2019-10-06 23:40:48,827 INFO L193 IcfgInterpreter]: Reachable states at location L2 satisfy 346#(and (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond) (exists ((v_prenex_27 Int) (|v_main_~#a7~0.base_BEFORE_CALL_7| Int) (v_prenex_26 Int) (v_prenex_28 Int) (v_prenex_25 Int) (|v_main_~#a1~0.offset_BEFORE_CALL_7| Int) (|v_main_~#a7~0.offset_BEFORE_CALL_7| Int) (|v_main_~#a1~0.base_BEFORE_CALL_7| Int)) (or (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| v_prenex_25) v_prenex_27) (select (select |#memory_int| v_prenex_28) v_prenex_26))) (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| |v_main_~#a7~0.base_BEFORE_CALL_7|) |v_main_~#a7~0.offset_BEFORE_CALL_7|) (select (select |#memory_int| |v_main_~#a1~0.base_BEFORE_CALL_7|) |v_main_~#a1~0.offset_BEFORE_CALL_7|))))))) [2019-10-06 23:40:48,827 INFO L193 IcfgInterpreter]: Reachable states at location L36-3 satisfy 331#(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:40:48,828 INFO L193 IcfgInterpreter]: Reachable states at location L2-1 satisfy 351#(and (<= __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) (exists ((v_prenex_27 Int) (|v_main_~#a7~0.base_BEFORE_CALL_7| Int) (v_prenex_26 Int) (v_prenex_28 Int) (v_prenex_25 Int) (|v_main_~#a1~0.offset_BEFORE_CALL_7| Int) (|v_main_~#a7~0.offset_BEFORE_CALL_7| Int) (|v_main_~#a1~0.base_BEFORE_CALL_7| Int)) (or (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| v_prenex_25) v_prenex_27) (select (select |#memory_int| v_prenex_28) v_prenex_26))) (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| |v_main_~#a7~0.base_BEFORE_CALL_7|) |v_main_~#a7~0.offset_BEFORE_CALL_7|) (select (select |#memory_int| |v_main_~#a1~0.base_BEFORE_CALL_7|) |v_main_~#a1~0.offset_BEFORE_CALL_7|))))))) [2019-10-06 23:40:48,828 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initENTRY satisfy 360#(and (= |old(#NULL.base)| |#NULL.base|) (= |#valid| |old(#valid)|) (= |#NULL.offset| |old(#NULL.offset)|)) [2019-10-06 23:40:48,828 INFO L193 IcfgInterpreter]: Reachable states at location L26-3 satisfy 240#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-06 23:40:48,828 INFO L193 IcfgInterpreter]: Reachable states at location L17-3 satisfy 111#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-06 23:40:48,828 INFO L193 IcfgInterpreter]: Reachable states at location L29-3 satisfy 283#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-06 23:40:48,828 INFO L193 IcfgInterpreter]: Reachable states at location L37 satisfy 336#(and (<= 100000 main_~a~0) (< main_~x~0 100000) (<= 0 main_~i~0) (= main_~x~0 0) (<= 100000 main_~i~0) (= |main_#t~mem16| (select (select |#memory_int| |main_~#a7~0.base|) (+ (* 4 main_~x~0) |main_~#a7~0.offset|))) (not (< main_~i~0 100000)) (<= main_~x~0 0) (= |main_#t~mem15| (select (select |#memory_int| |main_~#a1~0.base|) (+ (* 4 main_~x~0) |main_~#a1~0.offset|))) (<= 0 main_~x~0)) [2019-10-06 23:40:48,829 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:40:48,829 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:40:48,829 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initEXIT satisfy 365#(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:40:48,829 INFO L193 IcfgInterpreter]: Reachable states at location L20-3 satisfy 154#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-06 23:40:48,829 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.startENTRY satisfy 6#true [2019-10-06 23:40:48,829 INFO L193 IcfgInterpreter]: Reachable states at location L32-3 satisfy 326#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-06 23:40:48,830 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION satisfy 356#(and (<= __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) (exists ((v_prenex_27 Int) (|v_main_~#a7~0.base_BEFORE_CALL_7| Int) (v_prenex_26 Int) (v_prenex_28 Int) (v_prenex_25 Int) (|v_main_~#a1~0.offset_BEFORE_CALL_7| Int) (|v_main_~#a7~0.offset_BEFORE_CALL_7| Int) (|v_main_~#a1~0.base_BEFORE_CALL_7| Int)) (or (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| v_prenex_25) v_prenex_27) (select (select |#memory_int| v_prenex_28) v_prenex_26))) (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| |v_main_~#a7~0.base_BEFORE_CALL_7|) |v_main_~#a7~0.offset_BEFORE_CALL_7|) (select (select |#memory_int| |v_main_~#a1~0.base_BEFORE_CALL_7|) |v_main_~#a1~0.offset_BEFORE_CALL_7|))))))) [2019-10-06 23:40:48,830 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertENTRY satisfy 341#(exists ((v_prenex_27 Int) (|v_main_~#a7~0.base_BEFORE_CALL_7| Int) (v_prenex_26 Int) (v_prenex_28 Int) (v_prenex_25 Int) (|v_main_~#a1~0.offset_BEFORE_CALL_7| Int) (|v_main_~#a7~0.offset_BEFORE_CALL_7| Int) (|v_main_~#a1~0.base_BEFORE_CALL_7| Int)) (or (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| v_prenex_25) v_prenex_27) (select (select |#memory_int| v_prenex_28) v_prenex_26))) (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| |v_main_~#a7~0.base_BEFORE_CALL_7|) |v_main_~#a7~0.offset_BEFORE_CALL_7|) (select (select |#memory_int| |v_main_~#a1~0.base_BEFORE_CALL_7|) |v_main_~#a1~0.offset_BEFORE_CALL_7|)))))) [2019-10-06 23:40:48,830 INFO L193 IcfgInterpreter]: Reachable states at location L23-3 satisfy 197#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-06 23:40:48,830 INFO L193 IcfgInterpreter]: Reachable states at location L13-3 satisfy 68#true [2019-10-06 23:40:49,379 INFO L211 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-06 23:40:49,380 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [59, 59, 59, 11] total 127 [2019-10-06 23:40:49,382 INFO L442 AbstractCegarLoop]: Interpolant automaton has 127 states [2019-10-06 23:40:49,383 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 127 interpolants. [2019-10-06 23:40:49,387 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6815, Invalid=9187, Unknown=0, NotChecked=0, Total=16002 [2019-10-06 23:40:49,387 INFO L87 Difference]: Start difference. First operand 161 states and 168 transitions. Second operand 127 states. [2019-10-06 23:40:59,378 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-06 23:40:59,379 INFO L93 Difference]: Finished difference Result 327 states and 398 transitions. [2019-10-06 23:40:59,380 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 126 states. [2019-10-06 23:40:59,380 INFO L78 Accepts]: Start accepts. Automaton has 127 states. Word has length 157 [2019-10-06 23:40:59,381 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-06 23:40:59,382 INFO L225 Difference]: With dead ends: 327 [2019-10-06 23:40:59,382 INFO L226 Difference]: Without dead ends: 228 [2019-10-06 23:40:59,387 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 651 GetRequests, 405 SyntacticMatches, 0 SemanticMatches, 246 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11724 ImplicationChecksByTransitivity, 14.6s TimeCoverageRelationStatistics Valid=20208, Invalid=41048, Unknown=0, NotChecked=0, Total=61256 [2019-10-06 23:40:59,388 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 228 states. [2019-10-06 23:40:59,407 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 228 to 219. [2019-10-06 23:40:59,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 219 states. [2019-10-06 23:40:59,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 219 states to 219 states and 226 transitions. [2019-10-06 23:40:59,409 INFO L78 Accepts]: Start accepts. Automaton has 219 states and 226 transitions. Word has length 157 [2019-10-06 23:40:59,409 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-06 23:40:59,410 INFO L462 AbstractCegarLoop]: Abstraction has 219 states and 226 transitions. [2019-10-06 23:40:59,410 INFO L463 AbstractCegarLoop]: Interpolant automaton has 127 states. [2019-10-06 23:40:59,410 INFO L276 IsEmpty]: Start isEmpty. Operand 219 states and 226 transitions. [2019-10-06 23:40:59,413 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 216 [2019-10-06 23:40:59,413 INFO L377 BasicCegarLoop]: Found error trace [2019-10-06 23:40:59,413 INFO L385 BasicCegarLoop]: trace histogram [114, 14, 14, 14, 14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-06 23:40:59,626 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-06 23:40:59,627 INFO L410 AbstractCegarLoop]: === Iteration 10 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-06 23:40:59,627 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-06 23:40:59,627 INFO L82 PathProgramCache]: Analyzing trace with hash 1325543020, now seen corresponding path program 8 times [2019-10-06 23:40:59,627 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-06 23:40:59,627 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-06 23:40:59,628 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-06 23:40:59,628 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-06 23:40:59,628 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-06 23:40:59,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-06 23:41:04,855 INFO L134 CoverageAnalysis]: Checked inductivity of 7185 backedges. 0 proven. 6555 refuted. 0 times theorem prover too weak. 630 trivial. 0 not checked. [2019-10-06 23:41:04,856 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-06 23:41:04,856 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2019-10-06 23:41:04,856 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:46:29,117 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s) [2019-10-06 23:46:29,117 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-06 23:46:29,151 INFO L256 TraceCheckSpWp]: Trace formula consists of 527 conjuncts, 44 conjunts are in the unsatisfiable core [2019-10-06 23:46:29,155 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-06 23:46:30,093 INFO L134 CoverageAnalysis]: Checked inductivity of 7185 backedges. 156 proven. 105 refuted. 0 times theorem prover too weak. 6924 trivial. 0 not checked. [2019-10-06 23:46:30,094 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-06 23:46:31,033 INFO L134 CoverageAnalysis]: Checked inductivity of 7185 backedges. 0 proven. 105 refuted. 0 times theorem prover too weak. 7080 trivial. 0 not checked. [2019-10-06 23:46:31,034 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2019-10-06 23:46:31,035 INFO L162 IcfgInterpreter]: Started Sifa with 18 locations of interest [2019-10-06 23:46:31,035 INFO L169 IcfgInterpreter]: Building call graph [2019-10-06 23:46:31,036 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-06 23:46:31,036 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-06 23:46:31,037 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-06 23:46:31,053 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 21 for LOIs [2019-10-06 23:46:32,055 WARN L191 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 41 [2019-10-06 23:46:32,315 INFO L199 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 29 for LOIs [2019-10-06 23:46:32,323 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 10 for LOIs [2019-10-06 23:46:32,327 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-06 23:46:32,327 INFO L191 IcfgInterpreter]: Final predicates for locations of interest are: [2019-10-06 23:46:32,327 INFO L193 IcfgInterpreter]: Reachable states at location L2 satisfy 346#(and (exists ((|v_main_~#a7~0.base_BEFORE_CALL_8| Int) (v_prenex_29 Int) (v_prenex_30 Int) (|v_main_~#a1~0.offset_BEFORE_CALL_8| Int) (v_prenex_32 Int) (|v_main_~#a7~0.offset_BEFORE_CALL_8| Int) (v_prenex_31 Int) (|v_main_~#a1~0.base_BEFORE_CALL_8| Int)) (or (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| v_prenex_29) v_prenex_31) (select (select |#memory_int| v_prenex_32) v_prenex_30)))) (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| |v_main_~#a7~0.base_BEFORE_CALL_8|) |v_main_~#a7~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:46:32,328 INFO L193 IcfgInterpreter]: Reachable states at location L36-3 satisfy 331#(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:46:32,328 INFO L193 IcfgInterpreter]: Reachable states at location L2-1 satisfy 351#(and (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (exists ((|v_main_~#a7~0.base_BEFORE_CALL_8| Int) (v_prenex_29 Int) (v_prenex_30 Int) (|v_main_~#a1~0.offset_BEFORE_CALL_8| Int) (v_prenex_32 Int) (|v_main_~#a7~0.offset_BEFORE_CALL_8| Int) (v_prenex_31 Int) (|v_main_~#a1~0.base_BEFORE_CALL_8| Int)) (or (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| v_prenex_29) v_prenex_31) (select (select |#memory_int| v_prenex_32) v_prenex_30)))) (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| |v_main_~#a7~0.base_BEFORE_CALL_8|) |v_main_~#a7~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_~cond) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-06 23:46:32,328 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initENTRY satisfy 360#(and (= |old(#NULL.base)| |#NULL.base|) (= |#valid| |old(#valid)|) (= |#NULL.offset| |old(#NULL.offset)|)) [2019-10-06 23:46:32,328 INFO L193 IcfgInterpreter]: Reachable states at location L26-3 satisfy 240#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-06 23:46:32,328 INFO L193 IcfgInterpreter]: Reachable states at location L17-3 satisfy 111#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-06 23:46:32,328 INFO L193 IcfgInterpreter]: Reachable states at location L29-3 satisfy 283#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-06 23:46:32,329 INFO L193 IcfgInterpreter]: Reachable states at location L37 satisfy 336#(and (<= 100000 main_~a~0) (< main_~x~0 100000) (<= 0 main_~i~0) (= main_~x~0 0) (<= 100000 main_~i~0) (= |main_#t~mem16| (select (select |#memory_int| |main_~#a7~0.base|) (+ (* 4 main_~x~0) |main_~#a7~0.offset|))) (not (< main_~i~0 100000)) (<= main_~x~0 0) (= |main_#t~mem15| (select (select |#memory_int| |main_~#a1~0.base|) (+ (* 4 main_~x~0) |main_~#a1~0.offset|))) (<= 0 main_~x~0)) [2019-10-06 23:46:32,329 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:46:32,329 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:46:32,329 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initEXIT satisfy 365#(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:46:32,329 INFO L193 IcfgInterpreter]: Reachable states at location L20-3 satisfy 154#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-06 23:46:32,329 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.startENTRY satisfy 6#true [2019-10-06 23:46:32,330 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION satisfy 356#(and (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (exists ((|v_main_~#a7~0.base_BEFORE_CALL_8| Int) (v_prenex_29 Int) (v_prenex_30 Int) (|v_main_~#a1~0.offset_BEFORE_CALL_8| Int) (v_prenex_32 Int) (|v_main_~#a7~0.offset_BEFORE_CALL_8| Int) (v_prenex_31 Int) (|v_main_~#a1~0.base_BEFORE_CALL_8| Int)) (or (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| v_prenex_29) v_prenex_31) (select (select |#memory_int| v_prenex_32) v_prenex_30)))) (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| |v_main_~#a7~0.base_BEFORE_CALL_8|) |v_main_~#a7~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_~cond) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-06 23:46:32,330 INFO L193 IcfgInterpreter]: Reachable states at location L32-3 satisfy 326#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-06 23:46:32,330 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertENTRY satisfy 341#(exists ((|v_main_~#a7~0.base_BEFORE_CALL_8| Int) (v_prenex_29 Int) (v_prenex_30 Int) (|v_main_~#a1~0.offset_BEFORE_CALL_8| Int) (v_prenex_32 Int) (|v_main_~#a7~0.offset_BEFORE_CALL_8| Int) (v_prenex_31 Int) (|v_main_~#a1~0.base_BEFORE_CALL_8| Int)) (or (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| v_prenex_29) v_prenex_31) (select (select |#memory_int| v_prenex_32) v_prenex_30)))) (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| |v_main_~#a7~0.base_BEFORE_CALL_8|) |v_main_~#a7~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:46:32,330 INFO L193 IcfgInterpreter]: Reachable states at location L23-3 satisfy 197#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-06 23:46:32,330 INFO L193 IcfgInterpreter]: Reachable states at location L13-3 satisfy 68#true [2019-10-06 23:46:33,535 INFO L211 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-06 23:46:33,535 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [117, 19, 17, 11] total 159 [2019-10-06 23:46:33,537 INFO L442 AbstractCegarLoop]: Interpolant automaton has 159 states [2019-10-06 23:46:33,538 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 159 interpolants. [2019-10-06 23:46:33,539 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7459, Invalid=17663, Unknown=0, NotChecked=0, Total=25122 [2019-10-06 23:46:33,540 INFO L87 Difference]: Start difference. First operand 219 states and 226 transitions. Second operand 159 states. [2019-10-06 23:46:50,152 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-06 23:46:50,152 INFO L93 Difference]: Finished difference Result 424 states and 534 transitions. [2019-10-06 23:46:50,153 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 158 states. [2019-10-06 23:46:50,153 INFO L78 Accepts]: Start accepts. Automaton has 159 states. Word has length 215 [2019-10-06 23:46:50,154 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-06 23:46:50,159 INFO L225 Difference]: With dead ends: 424 [2019-10-06 23:46:50,159 INFO L226 Difference]: Without dead ends: 325 [2019-10-06 23:46:50,162 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 946 GetRequests, 636 SyntacticMatches, 0 SemanticMatches, 310 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21210 ImplicationChecksByTransitivity, 21.3s TimeCoverageRelationStatistics Valid=22466, Invalid=74566, Unknown=0, NotChecked=0, Total=97032 [2019-10-06 23:46:50,163 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 325 states. [2019-10-06 23:46:50,185 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 325 to 316. [2019-10-06 23:46:50,186 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 316 states. [2019-10-06 23:46:50,187 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 316 states to 316 states and 323 transitions. [2019-10-06 23:46:50,188 INFO L78 Accepts]: Start accepts. Automaton has 316 states and 323 transitions. Word has length 215 [2019-10-06 23:46:50,188 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-06 23:46:50,188 INFO L462 AbstractCegarLoop]: Abstraction has 316 states and 323 transitions. [2019-10-06 23:46:50,188 INFO L463 AbstractCegarLoop]: Interpolant automaton has 159 states. [2019-10-06 23:46:50,188 INFO L276 IsEmpty]: Start isEmpty. Operand 316 states and 323 transitions. [2019-10-06 23:46:50,193 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 313 [2019-10-06 23:46:50,194 INFO L377 BasicCegarLoop]: Found error trace [2019-10-06 23:46:50,194 INFO L385 BasicCegarLoop]: trace histogram [115, 30, 30, 30, 30, 30, 30, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-06 23:46:50,407 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-06 23:46:50,408 INFO L410 AbstractCegarLoop]: === Iteration 11 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-06 23:46:50,408 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-06 23:46:50,409 INFO L82 PathProgramCache]: Analyzing trace with hash -1702909215, now seen corresponding path program 9 times [2019-10-06 23:46:50,409 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-06 23:46:50,409 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-06 23:46:50,409 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-06 23:46:50,410 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-06 23:46:50,410 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-06 23:46:50,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-06 23:46:55,883 INFO L134 CoverageAnalysis]: Checked inductivity of 9460 backedges. 0 proven. 6670 refuted. 0 times theorem prover too weak. 2790 trivial. 0 not checked. [2019-10-06 23:46:55,883 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-06 23:46:55,883 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2019-10-06 23:46:55,883 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:46:56,337 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-10-06 23:46:56,337 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-06 23:46:56,342 INFO L256 TraceCheckSpWp]: Trace formula consists of 1517 conjuncts, 117 conjunts are in the unsatisfiable core [2019-10-06 23:46:56,348 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-06 23:46:56,470 INFO L134 CoverageAnalysis]: Checked inductivity of 9460 backedges. 0 proven. 6670 refuted. 0 times theorem prover too weak. 2790 trivial. 0 not checked. [2019-10-06 23:46:56,470 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-06 23:47:11,061 INFO L134 CoverageAnalysis]: Checked inductivity of 9460 backedges. 0 proven. 6670 refuted. 0 times theorem prover too weak. 2790 trivial. 0 not checked. [2019-10-06 23:47:11,061 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2019-10-06 23:47:11,063 INFO L162 IcfgInterpreter]: Started Sifa with 18 locations of interest [2019-10-06 23:47:11,063 INFO L169 IcfgInterpreter]: Building call graph [2019-10-06 23:47:11,063 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-06 23:47:11,063 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-06 23:47:11,064 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-06 23:47:11,086 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 21 for LOIs [2019-10-06 23:47:12,348 INFO L199 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 29 for LOIs [2019-10-06 23:47:12,353 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 10 for LOIs [2019-10-06 23:47:12,356 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-06 23:47:12,356 INFO L191 IcfgInterpreter]: Final predicates for locations of interest are: [2019-10-06 23:47:12,357 INFO L193 IcfgInterpreter]: Reachable states at location L2 satisfy 346#(and (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond) (exists ((|v_main_~#a7~0.base_BEFORE_CALL_9| Int) (v_prenex_34 Int) (|v_main_~#a7~0.offset_BEFORE_CALL_9| 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)) (or (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| |v_main_~#a1~0.base_BEFORE_CALL_9|) |v_main_~#a1~0.offset_BEFORE_CALL_9|) (select (select |#memory_int| |v_main_~#a7~0.base_BEFORE_CALL_9|) |v_main_~#a7~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:47:12,357 INFO L193 IcfgInterpreter]: Reachable states at location L36-3 satisfy 331#(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:47:12,357 INFO L193 IcfgInterpreter]: Reachable states at location L2-1 satisfy 351#(and (<= __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) (exists ((|v_main_~#a7~0.base_BEFORE_CALL_9| Int) (v_prenex_34 Int) (|v_main_~#a7~0.offset_BEFORE_CALL_9| 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)) (or (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| |v_main_~#a1~0.base_BEFORE_CALL_9|) |v_main_~#a1~0.offset_BEFORE_CALL_9|) (select (select |#memory_int| |v_main_~#a7~0.base_BEFORE_CALL_9|) |v_main_~#a7~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:47:12,358 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initENTRY satisfy 360#(and (= |old(#NULL.base)| |#NULL.base|) (= |#valid| |old(#valid)|) (= |#NULL.offset| |old(#NULL.offset)|)) [2019-10-06 23:47:12,358 INFO L193 IcfgInterpreter]: Reachable states at location L26-3 satisfy 240#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-06 23:47:12,358 INFO L193 IcfgInterpreter]: Reachable states at location L17-3 satisfy 111#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-06 23:47:12,358 INFO L193 IcfgInterpreter]: Reachable states at location L29-3 satisfy 283#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-06 23:47:12,359 INFO L193 IcfgInterpreter]: Reachable states at location L37 satisfy 336#(and (<= 100000 main_~a~0) (< main_~x~0 100000) (<= 0 main_~i~0) (= main_~x~0 0) (<= 100000 main_~i~0) (= |main_#t~mem16| (select (select |#memory_int| |main_~#a7~0.base|) (+ (* 4 main_~x~0) |main_~#a7~0.offset|))) (not (< main_~i~0 100000)) (<= main_~x~0 0) (= |main_#t~mem15| (select (select |#memory_int| |main_~#a1~0.base|) (+ (* 4 main_~x~0) |main_~#a1~0.offset|))) (<= 0 main_~x~0)) [2019-10-06 23:47:12,359 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:47:12,359 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:47:12,359 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initEXIT satisfy 365#(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:47:12,359 INFO L193 IcfgInterpreter]: Reachable states at location L20-3 satisfy 154#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-06 23:47:12,360 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.startENTRY satisfy 6#true [2019-10-06 23:47:12,360 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION satisfy 356#(and (<= __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) (exists ((|v_main_~#a7~0.base_BEFORE_CALL_9| Int) (v_prenex_34 Int) (|v_main_~#a7~0.offset_BEFORE_CALL_9| 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)) (or (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| |v_main_~#a1~0.base_BEFORE_CALL_9|) |v_main_~#a1~0.offset_BEFORE_CALL_9|) (select (select |#memory_int| |v_main_~#a7~0.base_BEFORE_CALL_9|) |v_main_~#a7~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:47:12,360 INFO L193 IcfgInterpreter]: Reachable states at location L32-3 satisfy 326#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-06 23:47:12,360 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertENTRY satisfy 341#(exists ((|v_main_~#a7~0.base_BEFORE_CALL_9| Int) (v_prenex_34 Int) (|v_main_~#a7~0.offset_BEFORE_CALL_9| 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)) (or (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| |v_main_~#a1~0.base_BEFORE_CALL_9|) |v_main_~#a1~0.offset_BEFORE_CALL_9|) (select (select |#memory_int| |v_main_~#a7~0.base_BEFORE_CALL_9|) |v_main_~#a7~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:47:12,360 INFO L193 IcfgInterpreter]: Reachable states at location L23-3 satisfy 197#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-06 23:47:12,360 INFO L193 IcfgInterpreter]: Reachable states at location L13-3 satisfy 68#true [2019-10-06 23:47:13,281 INFO L211 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-06 23:47:13,281 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [118, 118, 118, 11] total 245 [2019-10-06 23:47:13,283 INFO L442 AbstractCegarLoop]: Interpolant automaton has 245 states [2019-10-06 23:47:13,286 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 245 interpolants. [2019-10-06 23:47:13,287 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27524, Invalid=32256, Unknown=0, NotChecked=0, Total=59780 [2019-10-06 23:47:13,287 INFO L87 Difference]: Start difference. First operand 316 states and 323 transitions. Second operand 245 states. [2019-10-06 23:47:48,242 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-06 23:47:48,242 INFO L93 Difference]: Finished difference Result 637 states and 767 transitions. [2019-10-06 23:47:48,242 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 244 states. [2019-10-06 23:47:48,243 INFO L78 Accepts]: Start accepts. Automaton has 245 states. Word has length 312 [2019-10-06 23:47:48,243 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-06 23:47:48,246 INFO L225 Difference]: With dead ends: 637 [2019-10-06 23:47:48,247 INFO L226 Difference]: Without dead ends: 442 [2019-10-06 23:47:48,252 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 1293 GetRequests, 811 SyntacticMatches, 0 SemanticMatches, 482 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40929 ImplicationChecksByTransitivity, 53.3s TimeCoverageRelationStatistics Valid=82099, Invalid=151673, Unknown=0, NotChecked=0, Total=233772 [2019-10-06 23:47:48,253 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 442 states. [2019-10-06 23:47:48,275 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 442 to 433. [2019-10-06 23:47:48,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 433 states. [2019-10-06 23:47:48,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 433 states to 433 states and 440 transitions. [2019-10-06 23:47:48,278 INFO L78 Accepts]: Start accepts. Automaton has 433 states and 440 transitions. Word has length 312 [2019-10-06 23:47:48,279 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-06 23:47:48,279 INFO L462 AbstractCegarLoop]: Abstraction has 433 states and 440 transitions. [2019-10-06 23:47:48,279 INFO L463 AbstractCegarLoop]: Interpolant automaton has 245 states. [2019-10-06 23:47:48,279 INFO L276 IsEmpty]: Start isEmpty. Operand 433 states and 440 transitions. [2019-10-06 23:47:48,287 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 430 [2019-10-06 23:47:48,287 INFO L377 BasicCegarLoop]: Found error trace [2019-10-06 23:47:48,287 INFO L385 BasicCegarLoop]: trace histogram [232, 30, 30, 30, 30, 30, 30, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-06 23:47:48,493 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-06 23:47:48,493 INFO L410 AbstractCegarLoop]: === Iteration 12 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-06 23:47:48,494 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-06 23:47:48,494 INFO L82 PathProgramCache]: Analyzing trace with hash 585290316, now seen corresponding path program 10 times [2019-10-06 23:47:48,494 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-06 23:47:48,494 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-06 23:47:48,494 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-06 23:47:48,494 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-06 23:47:48,494 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-06 23:47:49,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-06 23:48:08,428 INFO L134 CoverageAnalysis]: Checked inductivity of 29818 backedges. 0 proven. 27028 refuted. 0 times theorem prover too weak. 2790 trivial. 0 not checked. [2019-10-06 23:48:08,428 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-06 23:48:08,429 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2019-10-06 23:48:08,429 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:48:09,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-06 23:48:09,093 INFO L256 TraceCheckSpWp]: Trace formula consists of 2219 conjuncts, 234 conjunts are in the unsatisfiable core [2019-10-06 23:48:09,103 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-06 23:48:09,348 INFO L134 CoverageAnalysis]: Checked inductivity of 29818 backedges. 0 proven. 27028 refuted. 0 times theorem prover too weak. 2790 trivial. 0 not checked. [2019-10-06 23:48:09,348 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-06 23:49:09,029 INFO L134 CoverageAnalysis]: Checked inductivity of 29818 backedges. 0 proven. 27028 refuted. 0 times theorem prover too weak. 2790 trivial. 0 not checked. [2019-10-06 23:49:09,029 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2019-10-06 23:49:09,031 INFO L162 IcfgInterpreter]: Started Sifa with 18 locations of interest [2019-10-06 23:49:09,031 INFO L169 IcfgInterpreter]: Building call graph [2019-10-06 23:49:09,031 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-06 23:49:09,032 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-06 23:49:09,032 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-06 23:49:09,057 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 21 for LOIs [2019-10-06 23:49:10,239 INFO L199 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 29 for LOIs [2019-10-06 23:49:10,246 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 10 for LOIs [2019-10-06 23:49:10,249 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-06 23:49:10,249 INFO L191 IcfgInterpreter]: Final predicates for locations of interest are: [2019-10-06 23:49:10,249 INFO L193 IcfgInterpreter]: Reachable states at location L2 satisfy 346#(and (exists ((v_prenex_38 Int) (v_prenex_37 Int) (|v_main_~#a1~0.offset_BEFORE_CALL_10| Int) (|v_main_~#a7~0.base_BEFORE_CALL_10| Int) (v_prenex_39 Int) (|v_main_~#a1~0.base_BEFORE_CALL_10| Int) (|v_main_~#a7~0.offset_BEFORE_CALL_10| Int) (v_prenex_40 Int)) (or (and (= (select (select |#memory_int| v_prenex_39) v_prenex_37) (select (select |#memory_int| v_prenex_38) v_prenex_40)) (= |__VERIFIER_assert_#in~cond| 1)) (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| |v_main_~#a1~0.base_BEFORE_CALL_10|) |v_main_~#a1~0.offset_BEFORE_CALL_10|) (select (select |#memory_int| |v_main_~#a7~0.base_BEFORE_CALL_10|) |v_main_~#a7~0.offset_BEFORE_CALL_10|)))))) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-06 23:49:10,250 INFO L193 IcfgInterpreter]: Reachable states at location L36-3 satisfy 331#(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:49:10,250 INFO L193 IcfgInterpreter]: Reachable states at location L2-1 satisfy 351#(and (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (exists ((v_prenex_38 Int) (v_prenex_37 Int) (|v_main_~#a1~0.offset_BEFORE_CALL_10| Int) (|v_main_~#a7~0.base_BEFORE_CALL_10| Int) (v_prenex_39 Int) (|v_main_~#a1~0.base_BEFORE_CALL_10| Int) (|v_main_~#a7~0.offset_BEFORE_CALL_10| Int) (v_prenex_40 Int)) (or (and (= (select (select |#memory_int| v_prenex_39) v_prenex_37) (select (select |#memory_int| v_prenex_38) v_prenex_40)) (= |__VERIFIER_assert_#in~cond| 1)) (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| |v_main_~#a1~0.base_BEFORE_CALL_10|) |v_main_~#a1~0.offset_BEFORE_CALL_10|) (select (select |#memory_int| |v_main_~#a7~0.base_BEFORE_CALL_10|) |v_main_~#a7~0.offset_BEFORE_CALL_10|)))))) (<= 0 __VERIFIER_assert_~cond) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-06 23:49:10,250 INFO L193 IcfgInterpreter]: Reachable states at location L26-3 satisfy 240#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-06 23:49:10,250 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initENTRY satisfy 360#(and (= |old(#NULL.base)| |#NULL.base|) (= |#valid| |old(#valid)|) (= |#NULL.offset| |old(#NULL.offset)|)) [2019-10-06 23:49:10,250 INFO L193 IcfgInterpreter]: Reachable states at location L17-3 satisfy 111#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-06 23:49:10,251 INFO L193 IcfgInterpreter]: Reachable states at location L29-3 satisfy 283#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-06 23:49:10,251 INFO L193 IcfgInterpreter]: Reachable states at location L37 satisfy 336#(and (<= 100000 main_~a~0) (< main_~x~0 100000) (<= 0 main_~i~0) (= main_~x~0 0) (<= 100000 main_~i~0) (= |main_#t~mem16| (select (select |#memory_int| |main_~#a7~0.base|) (+ (* 4 main_~x~0) |main_~#a7~0.offset|))) (not (< main_~i~0 100000)) (<= main_~x~0 0) (= |main_#t~mem15| (select (select |#memory_int| |main_~#a1~0.base|) (+ (* 4 main_~x~0) |main_~#a1~0.offset|))) (<= 0 main_~x~0)) [2019-10-06 23:49:10,251 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:49:10,251 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:49:10,251 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initEXIT satisfy 365#(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:49:10,251 INFO L193 IcfgInterpreter]: Reachable states at location L20-3 satisfy 154#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-06 23:49:10,252 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.startENTRY satisfy 6#true [2019-10-06 23:49:10,252 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION satisfy 356#(and (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (exists ((v_prenex_38 Int) (v_prenex_37 Int) (|v_main_~#a1~0.offset_BEFORE_CALL_10| Int) (|v_main_~#a7~0.base_BEFORE_CALL_10| Int) (v_prenex_39 Int) (|v_main_~#a1~0.base_BEFORE_CALL_10| Int) (|v_main_~#a7~0.offset_BEFORE_CALL_10| Int) (v_prenex_40 Int)) (or (and (= (select (select |#memory_int| v_prenex_39) v_prenex_37) (select (select |#memory_int| v_prenex_38) v_prenex_40)) (= |__VERIFIER_assert_#in~cond| 1)) (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| |v_main_~#a1~0.base_BEFORE_CALL_10|) |v_main_~#a1~0.offset_BEFORE_CALL_10|) (select (select |#memory_int| |v_main_~#a7~0.base_BEFORE_CALL_10|) |v_main_~#a7~0.offset_BEFORE_CALL_10|)))))) (<= 0 __VERIFIER_assert_~cond) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-06 23:49:10,252 INFO L193 IcfgInterpreter]: Reachable states at location L32-3 satisfy 326#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-06 23:49:10,252 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertENTRY satisfy 341#(exists ((v_prenex_38 Int) (v_prenex_37 Int) (|v_main_~#a1~0.offset_BEFORE_CALL_10| Int) (|v_main_~#a7~0.base_BEFORE_CALL_10| Int) (v_prenex_39 Int) (|v_main_~#a1~0.base_BEFORE_CALL_10| Int) (|v_main_~#a7~0.offset_BEFORE_CALL_10| Int) (v_prenex_40 Int)) (or (and (= (select (select |#memory_int| v_prenex_39) v_prenex_37) (select (select |#memory_int| v_prenex_38) v_prenex_40)) (= |__VERIFIER_assert_#in~cond| 1)) (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| |v_main_~#a1~0.base_BEFORE_CALL_10|) |v_main_~#a1~0.offset_BEFORE_CALL_10|) (select (select |#memory_int| |v_main_~#a7~0.base_BEFORE_CALL_10|) |v_main_~#a7~0.offset_BEFORE_CALL_10|)))))) [2019-10-06 23:49:10,252 INFO L193 IcfgInterpreter]: Reachable states at location L23-3 satisfy 197#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-06 23:49:10,252 INFO L193 IcfgInterpreter]: Reachable states at location L13-3 satisfy 68#true [2019-10-06 23:49:11,717 INFO L211 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-06 23:49:11,718 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [235, 235, 235, 11] total 479 [2019-10-06 23:49:11,720 INFO L442 AbstractCegarLoop]: Interpolant automaton has 479 states [2019-10-06 23:49:11,731 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 479 interpolants. [2019-10-06 23:49:11,736 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=109775, Invalid=119187, Unknown=0, NotChecked=0, Total=228962 [2019-10-06 23:49:11,737 INFO L87 Difference]: Start difference. First operand 433 states and 440 transitions. Second operand 479 states. [2019-10-06 23:51:23,092 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-06 23:51:23,092 INFO L93 Difference]: Finished difference Result 871 states and 1118 transitions. [2019-10-06 23:51:23,092 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 478 states. [2019-10-06 23:51:23,093 INFO L78 Accepts]: Start accepts. Automaton has 479 states. Word has length 429 [2019-10-06 23:51:23,093 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-06 23:51:23,096 INFO L225 Difference]: With dead ends: 871 [2019-10-06 23:51:23,096 INFO L226 Difference]: Without dead ends: 676 [2019-10-06 23:51:23,112 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 1995 GetRequests, 1045 SyntacticMatches, 0 SemanticMatches, 950 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 150324 ImplicationChecksByTransitivity, 201.7s TimeCoverageRelationStatistics Valid=328384, Invalid=576968, Unknown=0, NotChecked=0, Total=905352 [2019-10-06 23:51:23,113 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 676 states. [2019-10-06 23:51:23,142 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 676 to 667. [2019-10-06 23:51:23,142 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 667 states. [2019-10-06 23:51:23,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 667 states to 667 states and 674 transitions. [2019-10-06 23:51:23,145 INFO L78 Accepts]: Start accepts. Automaton has 667 states and 674 transitions. Word has length 429 [2019-10-06 23:51:23,146 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-06 23:51:23,146 INFO L462 AbstractCegarLoop]: Abstraction has 667 states and 674 transitions. [2019-10-06 23:51:23,146 INFO L463 AbstractCegarLoop]: Interpolant automaton has 479 states. [2019-10-06 23:51:23,146 INFO L276 IsEmpty]: Start isEmpty. Operand 667 states and 674 transitions. [2019-10-06 23:51:23,151 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 664 [2019-10-06 23:51:23,152 INFO L377 BasicCegarLoop]: Found error trace [2019-10-06 23:51:23,152 INFO L385 BasicCegarLoop]: trace histogram [466, 30, 30, 30, 30, 30, 30, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-06 23:51:23,359 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-06 23:51:23,360 INFO L410 AbstractCegarLoop]: === Iteration 13 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-06 23:51:23,360 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-06 23:51:23,360 INFO L82 PathProgramCache]: Analyzing trace with hash -759891604, now seen corresponding path program 11 times [2019-10-06 23:51:23,361 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-06 23:51:23,361 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-06 23:51:23,361 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-06 23:51:23,361 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-06 23:51:23,361 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-06 23:51:25,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-06 23:51:26,304 WARN L191 SmtUtils]: Spent 150.00 ms on a formula simplification that was a NOOP. DAG size: 3 [2019-10-06 23:52:43,413 INFO L134 CoverageAnalysis]: Checked inductivity of 111601 backedges. 0 proven. 108811 refuted. 0 times theorem prover too weak. 2790 trivial. 0 not checked. [2019-10-06 23:52:43,413 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-06 23:52:43,413 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2019-10-06 23:52:43,414 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