/usr/bin/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 -i ../../../trunk/examples/svcomp/array-examples/standard_reverse_ground.i -------------------------------------------------------------------------------- This is Ultimate 0.1.24-fb55353 [2019-11-06 18:46:17,560 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-06 18:46:17,563 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-06 18:46:17,582 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-06 18:46:17,583 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-06 18:46:17,585 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-06 18:46:17,586 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-06 18:46:17,598 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-06 18:46:17,600 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-06 18:46:17,602 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-06 18:46:17,604 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-06 18:46:17,605 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-06 18:46:17,606 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-06 18:46:17,609 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-06 18:46:17,610 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-06 18:46:17,611 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-06 18:46:17,613 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-06 18:46:17,616 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-06 18:46:17,617 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-06 18:46:17,619 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-06 18:46:17,620 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-06 18:46:17,621 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-06 18:46:17,622 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-06 18:46:17,623 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-06 18:46:17,625 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-06 18:46:17,625 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-06 18:46:17,625 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-06 18:46:17,626 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-06 18:46:17,626 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-06 18:46:17,627 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-06 18:46:17,627 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-06 18:46:17,628 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-06 18:46:17,629 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-06 18:46:17,630 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-06 18:46:17,630 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-06 18:46:17,631 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-06 18:46:17,631 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-06 18:46:17,631 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-06 18:46:17,632 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-06 18:46:17,632 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-06 18:46:17,633 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-06 18:46:17,634 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-11-06 18:46:17,647 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-06 18:46:17,647 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-06 18:46:17,648 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-06 18:46:17,649 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-06 18:46:17,649 INFO L138 SettingsManager]: * Use SBE=true [2019-11-06 18:46:17,649 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-06 18:46:17,649 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-06 18:46:17,649 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-06 18:46:17,650 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-06 18:46:17,650 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-06 18:46:17,650 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-06 18:46:17,650 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-06 18:46:17,650 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-06 18:46:17,651 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-06 18:46:17,651 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-06 18:46:17,651 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-06 18:46:17,651 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-06 18:46:17,651 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-06 18:46:17,651 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-06 18:46:17,652 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-06 18:46:17,652 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-06 18:46:17,652 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-06 18:46:17,652 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-06 18:46:17,653 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-06 18:46:17,653 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-06 18:46:17,653 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-06 18:46:17,653 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-06 18:46:17,653 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-06 18:46:17,653 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-11-06 18:46:17,923 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-06 18:46:17,936 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-06 18:46:17,940 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-06 18:46:17,941 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-06 18:46:17,942 INFO L275 PluginConnector]: CDTParser initialized [2019-11-06 18:46:17,943 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-examples/standard_reverse_ground.i [2019-11-06 18:46:18,024 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d508bb74d/ee5f3551434d4af7afa072b92c4deb17/FLAGead6eadf4 [2019-11-06 18:46:18,514 INFO L306 CDTParser]: Found 1 translation units. [2019-11-06 18:46:18,517 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/array-examples/standard_reverse_ground.i [2019-11-06 18:46:18,524 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d508bb74d/ee5f3551434d4af7afa072b92c4deb17/FLAGead6eadf4 [2019-11-06 18:46:18,871 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d508bb74d/ee5f3551434d4af7afa072b92c4deb17 [2019-11-06 18:46:18,879 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-06 18:46:18,881 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-11-06 18:46:18,882 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-06 18:46:18,882 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-06 18:46:18,885 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-06 18:46:18,886 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 06:46:18" (1/1) ... [2019-11-06 18:46:18,889 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@37ce2aea and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 06:46:18, skipping insertion in model container [2019-11-06 18:46:18,889 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 06:46:18" (1/1) ... [2019-11-06 18:46:18,896 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-06 18:46:18,912 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-06 18:46:19,093 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-06 18:46:19,096 INFO L188 MainTranslator]: Completed pre-run [2019-11-06 18:46:19,119 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-06 18:46:19,139 INFO L192 MainTranslator]: Completed translation [2019-11-06 18:46:19,140 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 06:46:19 WrapperNode [2019-11-06 18:46:19,140 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-06 18:46:19,141 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-06 18:46:19,141 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-06 18:46:19,141 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-06 18:46:19,235 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 06:46:19" (1/1) ... [2019-11-06 18:46:19,235 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 06:46:19" (1/1) ... [2019-11-06 18:46:19,242 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 06:46:19" (1/1) ... [2019-11-06 18:46:19,244 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 06:46:19" (1/1) ... [2019-11-06 18:46:19,264 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 06:46:19" (1/1) ... [2019-11-06 18:46:19,270 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 06:46:19" (1/1) ... [2019-11-06 18:46:19,271 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 06:46:19" (1/1) ... [2019-11-06 18:46:19,273 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-06 18:46:19,273 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-06 18:46:19,273 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-06 18:46:19,274 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-06 18:46:19,275 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 06:46:19" (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-11-06 18:46:19,328 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-11-06 18:46:19,329 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-06 18:46:19,329 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2019-11-06 18:46:19,330 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-11-06 18:46:19,330 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-11-06 18:46:19,330 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2019-11-06 18:46:19,330 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-11-06 18:46:19,331 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-11-06 18:46:19,331 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-06 18:46:19,331 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-11-06 18:46:19,331 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-11-06 18:46:19,331 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-06 18:46:19,332 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-11-06 18:46:19,333 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-06 18:46:19,571 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-06 18:46:19,578 INFO L284 CfgBuilder]: Removed 3 assume(true) statements. [2019-11-06 18:46:19,583 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 06:46:19 BoogieIcfgContainer [2019-11-06 18:46:19,583 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-06 18:46:19,588 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-06 18:46:19,589 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-06 18:46:19,597 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-06 18:46:19,598 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.11 06:46:18" (1/3) ... [2019-11-06 18:46:19,602 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3853d087 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 06:46:19, skipping insertion in model container [2019-11-06 18:46:19,602 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 06:46:19" (2/3) ... [2019-11-06 18:46:19,603 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3853d087 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 06:46:19, skipping insertion in model container [2019-11-06 18:46:19,603 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 06:46:19" (3/3) ... [2019-11-06 18:46:19,609 INFO L109 eAbstractionObserver]: Analyzing ICFG standard_reverse_ground.i [2019-11-06 18:46:19,635 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-06 18:46:19,653 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-06 18:46:19,678 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-06 18:46:19,699 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-06 18:46:19,700 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-06 18:46:19,700 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-06 18:46:19,700 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-06 18:46:19,700 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-06 18:46:19,700 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-06 18:46:19,700 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-06 18:46:19,700 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-06 18:46:19,716 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states. [2019-11-06 18:46:19,721 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-11-06 18:46:19,721 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 18:46:19,722 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-06 18:46:19,724 INFO L410 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 18:46:19,728 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 18:46:19,729 INFO L82 PathProgramCache]: Analyzing trace with hash 1778002988, now seen corresponding path program 1 times [2019-11-06 18:46:19,736 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 18:46:19,736 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [575958398] [2019-11-06 18:46:19,736 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 18:46:19,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 18:46:19,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 18:46:19,907 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-06 18:46:19,907 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [575958398] [2019-11-06 18:46:19,908 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-06 18:46:19,908 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-06 18:46:19,909 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2071207496] [2019-11-06 18:46:19,914 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-06 18:46:19,914 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 18:46:19,928 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-06 18:46:19,929 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-06 18:46:19,931 INFO L87 Difference]: Start difference. First operand 27 states. Second operand 3 states. [2019-11-06 18:46:20,046 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 18:46:20,046 INFO L93 Difference]: Finished difference Result 46 states and 57 transitions. [2019-11-06 18:46:20,047 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-06 18:46:20,049 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 15 [2019-11-06 18:46:20,049 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 18:46:20,057 INFO L225 Difference]: With dead ends: 46 [2019-11-06 18:46:20,058 INFO L226 Difference]: Without dead ends: 22 [2019-11-06 18:46:20,061 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 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-11-06 18:46:20,079 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2019-11-06 18:46:20,096 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2019-11-06 18:46:20,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2019-11-06 18:46:20,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 24 transitions. [2019-11-06 18:46:20,101 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 24 transitions. Word has length 15 [2019-11-06 18:46:20,102 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 18:46:20,102 INFO L462 AbstractCegarLoop]: Abstraction has 22 states and 24 transitions. [2019-11-06 18:46:20,102 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-06 18:46:20,102 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 24 transitions. [2019-11-06 18:46:20,103 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-11-06 18:46:20,103 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 18:46:20,104 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-06 18:46:20,104 INFO L410 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 18:46:20,104 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 18:46:20,105 INFO L82 PathProgramCache]: Analyzing trace with hash -262172122, now seen corresponding path program 1 times [2019-11-06 18:46:20,105 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 18:46:20,105 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [896365773] [2019-11-06 18:46:20,106 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 18:46:20,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 18:46:20,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 18:46:20,175 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-06 18:46:20,176 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [896365773] [2019-11-06 18:46:20,176 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-06 18:46:20,176 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-06 18:46:20,176 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1468365015] [2019-11-06 18:46:20,178 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-06 18:46:20,178 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 18:46:20,179 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-06 18:46:20,179 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-06 18:46:20,179 INFO L87 Difference]: Start difference. First operand 22 states and 24 transitions. Second operand 4 states. [2019-11-06 18:46:20,256 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 18:46:20,257 INFO L93 Difference]: Finished difference Result 40 states and 45 transitions. [2019-11-06 18:46:20,257 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-06 18:46:20,257 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 15 [2019-11-06 18:46:20,258 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 18:46:20,259 INFO L225 Difference]: With dead ends: 40 [2019-11-06 18:46:20,259 INFO L226 Difference]: Without dead ends: 26 [2019-11-06 18:46:20,260 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-06 18:46:20,261 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2019-11-06 18:46:20,268 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 24. [2019-11-06 18:46:20,268 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2019-11-06 18:46:20,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 26 transitions. [2019-11-06 18:46:20,270 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 26 transitions. Word has length 15 [2019-11-06 18:46:20,270 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 18:46:20,270 INFO L462 AbstractCegarLoop]: Abstraction has 24 states and 26 transitions. [2019-11-06 18:46:20,270 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-06 18:46:20,270 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 26 transitions. [2019-11-06 18:46:20,271 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-11-06 18:46:20,271 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 18:46:20,271 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-06 18:46:20,272 INFO L410 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 18:46:20,272 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 18:46:20,273 INFO L82 PathProgramCache]: Analyzing trace with hash 1323409058, now seen corresponding path program 1 times [2019-11-06 18:46:20,273 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 18:46:20,273 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1324705379] [2019-11-06 18:46:20,273 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 18:46:20,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 18:46:20,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 18:46:20,383 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-06 18:46:20,386 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1324705379] [2019-11-06 18:46:20,386 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [952018257] [2019-11-06 18:46:20,387 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-06 18:46:20,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 18:46:20,452 INFO L256 TraceCheckSpWp]: Trace formula consists of 73 conjuncts, 3 conjunts are in the unsatisfiable core [2019-11-06 18:46:20,463 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-06 18:46:20,503 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-06 18:46:20,509 INFO L218 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-06 18:46:20,509 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4] total 6 [2019-11-06 18:46:20,509 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1352599081] [2019-11-06 18:46:20,510 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-06 18:46:20,510 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 18:46:20,510 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-06 18:46:20,511 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-11-06 18:46:20,511 INFO L87 Difference]: Start difference. First operand 24 states and 26 transitions. Second operand 6 states. [2019-11-06 18:46:20,644 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 18:46:20,644 INFO L93 Difference]: Finished difference Result 45 states and 50 transitions. [2019-11-06 18:46:20,646 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-06 18:46:20,646 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 19 [2019-11-06 18:46:20,647 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 18:46:20,647 INFO L225 Difference]: With dead ends: 45 [2019-11-06 18:46:20,647 INFO L226 Difference]: Without dead ends: 30 [2019-11-06 18:46:20,648 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-11-06 18:46:20,648 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2019-11-06 18:46:20,657 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 28. [2019-11-06 18:46:20,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2019-11-06 18:46:20,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 30 transitions. [2019-11-06 18:46:20,658 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 30 transitions. Word has length 19 [2019-11-06 18:46:20,659 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 18:46:20,661 INFO L462 AbstractCegarLoop]: Abstraction has 28 states and 30 transitions. [2019-11-06 18:46:20,661 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-06 18:46:20,661 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 30 transitions. [2019-11-06 18:46:20,662 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-11-06 18:46:20,662 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 18:46:20,663 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-06 18:46:20,876 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-06 18:46:20,876 INFO L410 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 18:46:20,877 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 18:46:20,877 INFO L82 PathProgramCache]: Analyzing trace with hash 1582955806, now seen corresponding path program 2 times [2019-11-06 18:46:20,877 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 18:46:20,877 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1977641745] [2019-11-06 18:46:20,878 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 18:46:20,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 18:46:20,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 18:46:20,983 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-11-06 18:46:20,983 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1977641745] [2019-11-06 18:46:20,984 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [84298668] [2019-11-06 18:46:20,984 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 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-11-06 18:46:21,052 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-11-06 18:46:21,052 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-06 18:46:21,053 INFO L256 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-06 18:46:21,055 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-06 18:46:21,067 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-11-06 18:46:21,068 INFO L218 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-06 18:46:21,068 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5] total 7 [2019-11-06 18:46:21,068 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2043561264] [2019-11-06 18:46:21,069 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-06 18:46:21,069 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 18:46:21,070 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-06 18:46:21,070 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-11-06 18:46:21,070 INFO L87 Difference]: Start difference. First operand 28 states and 30 transitions. Second operand 7 states. [2019-11-06 18:46:21,183 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 18:46:21,184 INFO L93 Difference]: Finished difference Result 51 states and 56 transitions. [2019-11-06 18:46:21,185 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-06 18:46:21,185 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 23 [2019-11-06 18:46:21,185 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 18:46:21,186 INFO L225 Difference]: With dead ends: 51 [2019-11-06 18:46:21,186 INFO L226 Difference]: Without dead ends: 34 [2019-11-06 18:46:21,187 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-11-06 18:46:21,187 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2019-11-06 18:46:21,196 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 32. [2019-11-06 18:46:21,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2019-11-06 18:46:21,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 34 transitions. [2019-11-06 18:46:21,198 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 34 transitions. Word has length 23 [2019-11-06 18:46:21,198 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 18:46:21,199 INFO L462 AbstractCegarLoop]: Abstraction has 32 states and 34 transitions. [2019-11-06 18:46:21,200 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-06 18:46:21,201 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 34 transitions. [2019-11-06 18:46:21,201 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-11-06 18:46:21,202 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 18:46:21,202 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-06 18:46:21,402 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-06 18:46:21,403 INFO L410 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 18:46:21,404 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 18:46:21,404 INFO L82 PathProgramCache]: Analyzing trace with hash -657216102, now seen corresponding path program 3 times [2019-11-06 18:46:21,405 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 18:46:21,405 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [361341650] [2019-11-06 18:46:21,405 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 18:46:21,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 18:46:21,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 18:46:21,533 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2019-11-06 18:46:21,536 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [361341650] [2019-11-06 18:46:21,536 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2021481584] [2019-11-06 18:46:21,537 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-11-06 18:46:21,593 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-11-06 18:46:21,593 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-06 18:46:21,594 INFO L256 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 24 conjunts are in the unsatisfiable core [2019-11-06 18:46:21,598 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-06 18:46:21,640 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2019-11-06 18:46:21,640 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-06 18:46:21,646 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 18:46:21,646 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-06 18:46:21,647 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:11 [2019-11-06 18:46:21,682 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 24 [2019-11-06 18:46:21,683 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-06 18:46:21,694 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 18:46:21,695 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-06 18:46:21,695 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:38, output treesize:34 [2019-11-06 18:46:21,889 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-06 18:46:21,890 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-06 18:46:21,894 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 10 [2019-11-06 18:46:21,897 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-06 18:46:21,906 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 18:46:21,907 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-06 18:46:21,907 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:42, output treesize:3 [2019-11-06 18:46:21,956 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2019-11-06 18:46:21,957 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-06 18:46:21,958 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [7] total 15 [2019-11-06 18:46:21,958 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [665234326] [2019-11-06 18:46:21,959 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-11-06 18:46:21,959 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 18:46:21,959 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-11-06 18:46:21,961 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=171, Unknown=0, NotChecked=0, Total=210 [2019-11-06 18:46:21,961 INFO L87 Difference]: Start difference. First operand 32 states and 34 transitions. Second operand 10 states. [2019-11-06 18:46:22,216 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 18:46:22,216 INFO L93 Difference]: Finished difference Result 42 states and 44 transitions. [2019-11-06 18:46:22,217 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-11-06 18:46:22,217 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 27 [2019-11-06 18:46:22,218 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 18:46:22,219 INFO L225 Difference]: With dead ends: 42 [2019-11-06 18:46:22,219 INFO L226 Difference]: Without dead ends: 40 [2019-11-06 18:46:22,220 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=64, Invalid=278, Unknown=0, NotChecked=0, Total=342 [2019-11-06 18:46:22,220 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2019-11-06 18:46:22,230 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 38. [2019-11-06 18:46:22,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2019-11-06 18:46:22,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 40 transitions. [2019-11-06 18:46:22,233 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 40 transitions. Word has length 27 [2019-11-06 18:46:22,233 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 18:46:22,233 INFO L462 AbstractCegarLoop]: Abstraction has 38 states and 40 transitions. [2019-11-06 18:46:22,233 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-11-06 18:46:22,233 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 40 transitions. [2019-11-06 18:46:22,236 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-11-06 18:46:22,236 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 18:46:22,237 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-06 18:46:22,440 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-06 18:46:22,441 INFO L410 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 18:46:22,441 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 18:46:22,442 INFO L82 PathProgramCache]: Analyzing trace with hash -762567471, now seen corresponding path program 1 times [2019-11-06 18:46:22,442 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 18:46:22,443 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2023824194] [2019-11-06 18:46:22,443 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 18:46:22,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 18:46:22,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 18:46:22,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 18:46:22,567 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 2 proven. 9 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-11-06 18:46:22,567 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2023824194] [2019-11-06 18:46:22,567 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [687559799] [2019-11-06 18:46:22,568 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-06 18:46:22,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 18:46:22,623 INFO L256 TraceCheckSpWp]: Trace formula consists of 110 conjuncts, 5 conjunts are in the unsatisfiable core [2019-11-06 18:46:22,625 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-06 18:46:22,639 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2019-11-06 18:46:22,640 INFO L218 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-06 18:46:22,640 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6] total 8 [2019-11-06 18:46:22,640 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1131219251] [2019-11-06 18:46:22,641 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-06 18:46:22,641 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 18:46:22,641 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-06 18:46:22,642 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2019-11-06 18:46:22,642 INFO L87 Difference]: Start difference. First operand 38 states and 40 transitions. Second operand 8 states. [2019-11-06 18:46:22,765 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 18:46:22,765 INFO L93 Difference]: Finished difference Result 69 states and 74 transitions. [2019-11-06 18:46:22,766 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-06 18:46:22,766 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 35 [2019-11-06 18:46:22,766 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 18:46:22,769 INFO L225 Difference]: With dead ends: 69 [2019-11-06 18:46:22,770 INFO L226 Difference]: Without dead ends: 44 [2019-11-06 18:46:22,771 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2019-11-06 18:46:22,771 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2019-11-06 18:46:22,778 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 42. [2019-11-06 18:46:22,778 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2019-11-06 18:46:22,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 44 transitions. [2019-11-06 18:46:22,779 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 44 transitions. Word has length 35 [2019-11-06 18:46:22,779 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 18:46:22,780 INFO L462 AbstractCegarLoop]: Abstraction has 42 states and 44 transitions. [2019-11-06 18:46:22,780 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-06 18:46:22,780 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 44 transitions. [2019-11-06 18:46:22,781 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-11-06 18:46:22,781 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 18:46:22,781 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-06 18:46:22,992 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-06 18:46:22,992 INFO L410 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 18:46:22,993 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 18:46:22,993 INFO L82 PathProgramCache]: Analyzing trace with hash 395701069, now seen corresponding path program 2 times [2019-11-06 18:46:22,994 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 18:46:22,994 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [266063115] [2019-11-06 18:46:22,994 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 18:46:23,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 18:46:23,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 18:46:23,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 18:46:23,108 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 2 proven. 16 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-11-06 18:46:23,109 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [266063115] [2019-11-06 18:46:23,109 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1713704668] [2019-11-06 18:46:23,109 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 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-11-06 18:46:23,157 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-11-06 18:46:23,157 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-06 18:46:23,158 INFO L256 TraceCheckSpWp]: Trace formula consists of 120 conjuncts, 6 conjunts are in the unsatisfiable core [2019-11-06 18:46:23,163 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-06 18:46:23,176 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2019-11-06 18:46:23,177 INFO L218 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-06 18:46:23,177 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7] total 9 [2019-11-06 18:46:23,178 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2020311594] [2019-11-06 18:46:23,179 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-11-06 18:46:23,180 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 18:46:23,180 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-11-06 18:46:23,181 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2019-11-06 18:46:23,181 INFO L87 Difference]: Start difference. First operand 42 states and 44 transitions. Second operand 9 states. [2019-11-06 18:46:23,292 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 18:46:23,292 INFO L93 Difference]: Finished difference Result 75 states and 80 transitions. [2019-11-06 18:46:23,293 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-06 18:46:23,293 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 39 [2019-11-06 18:46:23,293 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 18:46:23,294 INFO L225 Difference]: With dead ends: 75 [2019-11-06 18:46:23,294 INFO L226 Difference]: Without dead ends: 48 [2019-11-06 18:46:23,295 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2019-11-06 18:46:23,296 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2019-11-06 18:46:23,303 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 46. [2019-11-06 18:46:23,303 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2019-11-06 18:46:23,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 48 transitions. [2019-11-06 18:46:23,304 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 48 transitions. Word has length 39 [2019-11-06 18:46:23,304 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 18:46:23,304 INFO L462 AbstractCegarLoop]: Abstraction has 46 states and 48 transitions. [2019-11-06 18:46:23,304 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-11-06 18:46:23,305 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 48 transitions. [2019-11-06 18:46:23,306 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2019-11-06 18:46:23,306 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 18:46:23,306 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-06 18:46:23,509 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-06 18:46:23,509 INFO L410 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 18:46:23,510 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 18:46:23,510 INFO L82 PathProgramCache]: Analyzing trace with hash 885326793, now seen corresponding path program 3 times [2019-11-06 18:46:23,510 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 18:46:23,511 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1686439634] [2019-11-06 18:46:23,511 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 18:46:23,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 18:46:23,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 18:46:23,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 18:46:23,626 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 2 proven. 25 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2019-11-06 18:46:23,627 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1686439634] [2019-11-06 18:46:23,627 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1590132329] [2019-11-06 18:46:23,627 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-11-06 18:46:23,685 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2019-11-06 18:46:23,686 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-06 18:46:23,687 INFO L256 TraceCheckSpWp]: Trace formula consists of 120 conjuncts, 36 conjunts are in the unsatisfiable core [2019-11-06 18:46:23,698 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-06 18:46:23,719 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2019-11-06 18:46:23,719 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-06 18:46:23,737 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 18:46:23,738 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-06 18:46:23,738 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:11 [2019-11-06 18:46:23,783 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 24 [2019-11-06 18:46:23,784 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-06 18:46:23,793 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 18:46:23,793 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-06 18:46:23,794 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:35, output treesize:31 [2019-11-06 18:46:23,843 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-06 18:46:23,845 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-06 18:46:23,846 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 51 [2019-11-06 18:46:23,847 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-06 18:46:23,858 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 18:46:23,858 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-06 18:46:23,858 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:59, output treesize:55 [2019-11-06 18:46:26,063 WARN L860 $PredicateComparison]: unable to prove that (exists ((|v_main_~#b~0.base_BEFORE_CALL_1| Int) (v_main_~i~0_25 Int) (|v_main_~#a~0.base_BEFORE_CALL_1| Int)) (let ((.cse2 (select |c_#memory_int| |v_main_~#a~0.base_BEFORE_CALL_1|)) (.cse3 (* v_main_~i~0_25 (- 4))) (.cse0 (select |c_#memory_int| |v_main_~#b~0.base_BEFORE_CALL_1|)) (.cse1 (* v_main_~i~0_25 4))) (and (not (= |v_main_~#b~0.base_BEFORE_CALL_1| |v_main_~#a~0.base_BEFORE_CALL_1|)) (<= 99999 v_main_~i~0_25) (= (select .cse0 (+ .cse1 (- 4))) (select .cse2 (+ .cse3 400000))) (= (select .cse2 (+ .cse3 399996)) (select .cse0 .cse1)) (< v_main_~i~0_25 100000)))) is different from true [2019-11-06 18:46:28,095 WARN L191 SmtUtils]: Spent 2.01 s on a formula simplification that was a NOOP. DAG size: 33 [2019-11-06 18:46:30,148 WARN L191 SmtUtils]: Spent 2.03 s on a formula simplification that was a NOOP. DAG size: 34 [2019-11-06 18:46:30,298 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-06 18:46:30,299 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-06 18:46:30,300 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-06 18:46:30,301 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-06 18:46:30,302 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-06 18:46:30,304 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 3 disjoint index pairs (out of 15 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 13 [2019-11-06 18:46:30,304 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-06 18:46:30,311 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 18:46:30,312 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-06 18:46:30,312 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:61, output treesize:3 [2019-11-06 18:46:32,378 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 11 proven. 13 refuted. 0 times theorem prover too weak. 29 trivial. 1 not checked. [2019-11-06 18:46:32,379 INFO L218 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-06 18:46:32,379 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 17] total 24 [2019-11-06 18:46:32,379 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1718507133] [2019-11-06 18:46:32,380 INFO L442 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-11-06 18:46:32,380 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 18:46:32,380 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-11-06 18:46:32,381 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=429, Unknown=2, NotChecked=42, Total=552 [2019-11-06 18:46:32,381 INFO L87 Difference]: Start difference. First operand 46 states and 48 transitions. Second operand 24 states. [2019-11-06 18:46:37,583 WARN L191 SmtUtils]: Spent 4.05 s on a formula simplification. DAG size of input: 45 DAG size of output: 42 [2019-11-06 18:46:41,633 WARN L191 SmtUtils]: Spent 4.03 s on a formula simplification. DAG size of input: 48 DAG size of output: 44 [2019-11-06 18:46:43,949 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 18:46:43,950 INFO L93 Difference]: Finished difference Result 91 states and 97 transitions. [2019-11-06 18:46:43,950 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2019-11-06 18:46:43,951 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 43 [2019-11-06 18:46:43,951 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 18:46:43,952 INFO L225 Difference]: With dead ends: 91 [2019-11-06 18:46:43,952 INFO L226 Difference]: Without dead ends: 62 [2019-11-06 18:46:43,954 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 32 SyntacticMatches, 1 SemanticMatches, 46 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 488 ImplicationChecksByTransitivity, 17.6s TimeCoverageRelationStatistics Valid=365, Invalid=1799, Unknown=2, NotChecked=90, Total=2256 [2019-11-06 18:46:43,954 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2019-11-06 18:46:43,963 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 58. [2019-11-06 18:46:43,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2019-11-06 18:46:43,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 60 transitions. [2019-11-06 18:46:43,964 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 60 transitions. Word has length 43 [2019-11-06 18:46:43,964 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 18:46:43,964 INFO L462 AbstractCegarLoop]: Abstraction has 58 states and 60 transitions. [2019-11-06 18:46:43,964 INFO L463 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-11-06 18:46:43,965 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 60 transitions. [2019-11-06 18:46:43,966 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-11-06 18:46:43,966 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 18:46:43,966 INFO L410 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-06 18:46:44,167 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-06 18:46:44,167 INFO L410 AbstractCegarLoop]: === Iteration 9 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 18:46:44,168 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 18:46:44,168 INFO L82 PathProgramCache]: Analyzing trace with hash 1146292860, now seen corresponding path program 4 times [2019-11-06 18:46:44,168 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 18:46:44,169 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [729553015] [2019-11-06 18:46:44,169 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 18:46:44,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 18:46:44,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 18:46:44,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 18:46:44,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 18:46:44,289 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 4 proven. 36 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2019-11-06 18:46:44,290 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [729553015] [2019-11-06 18:46:44,290 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [250746783] [2019-11-06 18:46:44,290 INFO L92 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 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-11-06 18:46:44,344 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-11-06 18:46:44,344 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-06 18:46:44,345 INFO L256 TraceCheckSpWp]: Trace formula consists of 157 conjuncts, 8 conjunts are in the unsatisfiable core [2019-11-06 18:46:44,347 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-06 18:46:44,364 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 52 trivial. 0 not checked. [2019-11-06 18:46:44,364 INFO L218 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-06 18:46:44,364 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9] total 11 [2019-11-06 18:46:44,365 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2099472310] [2019-11-06 18:46:44,365 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-11-06 18:46:44,365 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 18:46:44,366 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-11-06 18:46:44,366 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2019-11-06 18:46:44,366 INFO L87 Difference]: Start difference. First operand 58 states and 60 transitions. Second operand 11 states. [2019-11-06 18:46:44,497 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 18:46:44,497 INFO L93 Difference]: Finished difference Result 103 states and 108 transitions. [2019-11-06 18:46:44,498 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-11-06 18:46:44,498 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 55 [2019-11-06 18:46:44,498 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 18:46:44,499 INFO L225 Difference]: With dead ends: 103 [2019-11-06 18:46:44,499 INFO L226 Difference]: Without dead ends: 64 [2019-11-06 18:46:44,500 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 60 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2019-11-06 18:46:44,501 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2019-11-06 18:46:44,510 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 62. [2019-11-06 18:46:44,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2019-11-06 18:46:44,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 64 transitions. [2019-11-06 18:46:44,511 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 64 transitions. Word has length 55 [2019-11-06 18:46:44,511 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 18:46:44,512 INFO L462 AbstractCegarLoop]: Abstraction has 62 states and 64 transitions. [2019-11-06 18:46:44,512 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-11-06 18:46:44,512 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 64 transitions. [2019-11-06 18:46:44,513 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-11-06 18:46:44,513 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 18:46:44,513 INFO L410 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-06 18:46:44,724 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-06 18:46:44,725 INFO L410 AbstractCegarLoop]: === Iteration 10 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 18:46:44,725 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 18:46:44,726 INFO L82 PathProgramCache]: Analyzing trace with hash 1452772088, now seen corresponding path program 5 times [2019-11-06 18:46:44,726 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 18:46:44,726 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [308427330] [2019-11-06 18:46:44,727 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 18:46:44,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 18:46:44,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 18:46:44,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 18:46:44,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 18:46:44,859 INFO L134 CoverageAnalysis]: Checked inductivity of 114 backedges. 4 proven. 49 refuted. 0 times theorem prover too weak. 61 trivial. 0 not checked. [2019-11-06 18:46:44,862 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [308427330] [2019-11-06 18:46:44,862 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1346615595] [2019-11-06 18:46:44,863 INFO L92 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 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-11-06 18:46:45,258 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 8 check-sat command(s) [2019-11-06 18:46:45,258 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-06 18:46:45,260 INFO L256 TraceCheckSpWp]: Trace formula consists of 167 conjuncts, 9 conjunts are in the unsatisfiable core [2019-11-06 18:46:45,262 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-06 18:46:45,285 INFO L134 CoverageAnalysis]: Checked inductivity of 114 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 65 trivial. 0 not checked. [2019-11-06 18:46:45,286 INFO L218 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-06 18:46:45,286 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10] total 12 [2019-11-06 18:46:45,286 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1096391109] [2019-11-06 18:46:45,287 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-11-06 18:46:45,287 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 18:46:45,287 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-11-06 18:46:45,287 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2019-11-06 18:46:45,288 INFO L87 Difference]: Start difference. First operand 62 states and 64 transitions. Second operand 12 states. [2019-11-06 18:46:45,429 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 18:46:45,429 INFO L93 Difference]: Finished difference Result 109 states and 114 transitions. [2019-11-06 18:46:45,430 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-11-06 18:46:45,430 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 59 [2019-11-06 18:46:45,430 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 18:46:45,431 INFO L225 Difference]: With dead ends: 109 [2019-11-06 18:46:45,431 INFO L226 Difference]: Without dead ends: 68 [2019-11-06 18:46:45,432 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 64 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2019-11-06 18:46:45,432 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2019-11-06 18:46:45,441 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 66. [2019-11-06 18:46:45,441 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2019-11-06 18:46:45,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 68 transitions. [2019-11-06 18:46:45,442 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 68 transitions. Word has length 59 [2019-11-06 18:46:45,443 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 18:46:45,443 INFO L462 AbstractCegarLoop]: Abstraction has 66 states and 68 transitions. [2019-11-06 18:46:45,443 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-11-06 18:46:45,443 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 68 transitions. [2019-11-06 18:46:45,444 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-11-06 18:46:45,444 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 18:46:45,444 INFO L410 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-06 18:46:45,656 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-06 18:46:45,657 INFO L410 AbstractCegarLoop]: === Iteration 11 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 18:46:45,657 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 18:46:45,657 INFO L82 PathProgramCache]: Analyzing trace with hash -709862028, now seen corresponding path program 6 times [2019-11-06 18:46:45,658 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 18:46:45,658 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [477506977] [2019-11-06 18:46:45,658 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 18:46:45,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 18:46:45,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 18:46:45,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 18:46:45,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 18:46:45,803 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 4 proven. 64 refuted. 0 times theorem prover too weak. 76 trivial. 0 not checked. [2019-11-06 18:46:45,803 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [477506977] [2019-11-06 18:46:45,804 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [598407089] [2019-11-06 18:46:45,804 INFO L92 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE 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-11-06 18:46:45,976 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 9 check-sat command(s) [2019-11-06 18:46:45,976 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-06 18:46:45,978 INFO L256 TraceCheckSpWp]: Trace formula consists of 177 conjuncts, 12 conjunts are in the unsatisfiable core [2019-11-06 18:46:45,979 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-06 18:46:45,995 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 80 trivial. 0 not checked. [2019-11-06 18:46:45,995 INFO L218 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-06 18:46:45,995 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11] total 13 [2019-11-06 18:46:45,996 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [813467125] [2019-11-06 18:46:45,996 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-11-06 18:46:45,996 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 18:46:45,997 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-11-06 18:46:45,997 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=88, Unknown=0, NotChecked=0, Total=156 [2019-11-06 18:46:45,997 INFO L87 Difference]: Start difference. First operand 66 states and 68 transitions. Second operand 13 states. [2019-11-06 18:46:46,149 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 18:46:46,150 INFO L93 Difference]: Finished difference Result 115 states and 120 transitions. [2019-11-06 18:46:46,150 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-11-06 18:46:46,150 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 63 [2019-11-06 18:46:46,151 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 18:46:46,151 INFO L225 Difference]: With dead ends: 115 [2019-11-06 18:46:46,151 INFO L226 Difference]: Without dead ends: 72 [2019-11-06 18:46:46,152 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 68 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=68, Invalid=88, Unknown=0, NotChecked=0, Total=156 [2019-11-06 18:46:46,152 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2019-11-06 18:46:46,161 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 70. [2019-11-06 18:46:46,161 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2019-11-06 18:46:46,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 72 transitions. [2019-11-06 18:46:46,163 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 72 transitions. Word has length 63 [2019-11-06 18:46:46,163 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 18:46:46,163 INFO L462 AbstractCegarLoop]: Abstraction has 70 states and 72 transitions. [2019-11-06 18:46:46,163 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-11-06 18:46:46,163 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 72 transitions. [2019-11-06 18:46:46,164 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-11-06 18:46:46,164 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 18:46:46,164 INFO L410 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-06 18:46:46,374 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-06 18:46:46,375 INFO L410 AbstractCegarLoop]: === Iteration 12 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 18:46:46,375 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 18:46:46,376 INFO L82 PathProgramCache]: Analyzing trace with hash -1364688400, now seen corresponding path program 7 times [2019-11-06 18:46:46,376 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 18:46:46,376 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2141560712] [2019-11-06 18:46:46,376 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 18:46:46,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 18:46:46,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 18:46:46,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 18:46:46,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 18:46:46,513 INFO L134 CoverageAnalysis]: Checked inductivity of 178 backedges. 4 proven. 81 refuted. 0 times theorem prover too weak. 93 trivial. 0 not checked. [2019-11-06 18:46:46,513 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2141560712] [2019-11-06 18:46:46,514 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1461176493] [2019-11-06 18:46:46,514 INFO L92 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-11-06 18:46:46,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 18:46:46,590 INFO L256 TraceCheckSpWp]: Trace formula consists of 187 conjuncts, 11 conjunts are in the unsatisfiable core [2019-11-06 18:46:46,592 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-06 18:46:46,624 INFO L134 CoverageAnalysis]: Checked inductivity of 178 backedges. 0 proven. 81 refuted. 0 times theorem prover too weak. 97 trivial. 0 not checked. [2019-11-06 18:46:46,625 INFO L218 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-06 18:46:46,625 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12] total 14 [2019-11-06 18:46:46,625 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1061705919] [2019-11-06 18:46:46,626 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-11-06 18:46:46,626 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 18:46:46,626 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-11-06 18:46:46,626 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=102, Unknown=0, NotChecked=0, Total=182 [2019-11-06 18:46:46,627 INFO L87 Difference]: Start difference. First operand 70 states and 72 transitions. Second operand 14 states. [2019-11-06 18:46:46,790 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 18:46:46,790 INFO L93 Difference]: Finished difference Result 121 states and 126 transitions. [2019-11-06 18:46:46,791 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-11-06 18:46:46,791 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 67 [2019-11-06 18:46:46,791 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 18:46:46,791 INFO L225 Difference]: With dead ends: 121 [2019-11-06 18:46:46,792 INFO L226 Difference]: Without dead ends: 76 [2019-11-06 18:46:46,792 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 72 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=80, Invalid=102, Unknown=0, NotChecked=0, Total=182 [2019-11-06 18:46:46,792 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2019-11-06 18:46:46,801 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 74. [2019-11-06 18:46:46,802 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2019-11-06 18:46:46,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 76 transitions. [2019-11-06 18:46:46,803 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 76 transitions. Word has length 67 [2019-11-06 18:46:46,803 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 18:46:46,803 INFO L462 AbstractCegarLoop]: Abstraction has 74 states and 76 transitions. [2019-11-06 18:46:46,803 INFO L463 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-11-06 18:46:46,803 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 76 transitions. [2019-11-06 18:46:46,804 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2019-11-06 18:46:46,804 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 18:46:46,805 INFO L410 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-06 18:46:47,009 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-06 18:46:47,009 INFO L410 AbstractCegarLoop]: === Iteration 13 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 18:46:47,009 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 18:46:47,010 INFO L82 PathProgramCache]: Analyzing trace with hash -2146764692, now seen corresponding path program 8 times [2019-11-06 18:46:47,010 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 18:46:47,010 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1000455401] [2019-11-06 18:46:47,010 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 18:46:47,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 18:46:47,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 18:46:47,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 18:46:47,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 18:46:47,165 INFO L134 CoverageAnalysis]: Checked inductivity of 216 backedges. 4 proven. 100 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2019-11-06 18:46:47,165 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1000455401] [2019-11-06 18:46:47,165 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1019074170] [2019-11-06 18:46:47,166 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-06 18:46:47,245 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-11-06 18:46:47,245 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-06 18:46:47,247 INFO L256 TraceCheckSpWp]: Trace formula consists of 197 conjuncts, 12 conjunts are in the unsatisfiable core [2019-11-06 18:46:47,251 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-06 18:46:47,280 INFO L134 CoverageAnalysis]: Checked inductivity of 216 backedges. 0 proven. 100 refuted. 0 times theorem prover too weak. 116 trivial. 0 not checked. [2019-11-06 18:46:47,281 INFO L218 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-06 18:46:47,281 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 13] total 15 [2019-11-06 18:46:47,283 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1553953561] [2019-11-06 18:46:47,284 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-11-06 18:46:47,285 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 18:46:47,285 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-11-06 18:46:47,287 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=117, Unknown=0, NotChecked=0, Total=210 [2019-11-06 18:46:47,287 INFO L87 Difference]: Start difference. First operand 74 states and 76 transitions. Second operand 15 states. [2019-11-06 18:46:47,450 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 18:46:47,451 INFO L93 Difference]: Finished difference Result 127 states and 132 transitions. [2019-11-06 18:46:47,451 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-11-06 18:46:47,451 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 71 [2019-11-06 18:46:47,451 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 18:46:47,452 INFO L225 Difference]: With dead ends: 127 [2019-11-06 18:46:47,452 INFO L226 Difference]: Without dead ends: 80 [2019-11-06 18:46:47,454 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 76 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=93, Invalid=117, Unknown=0, NotChecked=0, Total=210 [2019-11-06 18:46:47,457 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2019-11-06 18:46:47,470 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 78. [2019-11-06 18:46:47,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2019-11-06 18:46:47,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 80 transitions. [2019-11-06 18:46:47,471 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 80 transitions. Word has length 71 [2019-11-06 18:46:47,471 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 18:46:47,471 INFO L462 AbstractCegarLoop]: Abstraction has 78 states and 80 transitions. [2019-11-06 18:46:47,471 INFO L463 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-11-06 18:46:47,471 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 80 transitions. [2019-11-06 18:46:47,474 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2019-11-06 18:46:47,474 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 18:46:47,475 INFO L410 BasicCegarLoop]: trace histogram [11, 11, 11, 11, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-06 18:46:47,678 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-06 18:46:47,679 INFO L410 AbstractCegarLoop]: === Iteration 14 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 18:46:47,679 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 18:46:47,679 INFO L82 PathProgramCache]: Analyzing trace with hash 434290920, now seen corresponding path program 9 times [2019-11-06 18:46:47,679 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 18:46:47,680 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [875379523] [2019-11-06 18:46:47,680 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 18:46:47,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 18:46:47,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 18:46:47,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 18:46:47,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 18:46:47,839 INFO L134 CoverageAnalysis]: Checked inductivity of 258 backedges. 4 proven. 121 refuted. 0 times theorem prover too weak. 133 trivial. 0 not checked. [2019-11-06 18:46:47,839 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [875379523] [2019-11-06 18:46:47,840 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1624294576] [2019-11-06 18:46:47,840 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-06 18:46:47,925 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) [2019-11-06 18:46:47,925 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-06 18:46:47,927 INFO L256 TraceCheckSpWp]: Trace formula consists of 157 conjuncts, 39 conjunts are in the unsatisfiable core [2019-11-06 18:46:47,930 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-06 18:46:47,943 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2019-11-06 18:46:47,943 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-06 18:46:47,948 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 18:46:47,949 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-06 18:46:47,949 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:11 [2019-11-06 18:46:47,984 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 24 [2019-11-06 18:46:47,984 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-06 18:46:47,994 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 18:46:47,994 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-06 18:46:47,994 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:35, output treesize:31 [2019-11-06 18:46:48,056 INFO L341 Elim1Store]: treesize reduction 58, result has 17.1 percent of original size [2019-11-06 18:46:48,057 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 46 treesize of output 51 [2019-11-06 18:46:48,058 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-06 18:46:48,068 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 18:46:48,068 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-06 18:46:48,069 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:56, output treesize:52 [2019-11-06 18:46:48,167 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-06 18:46:48,169 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-06 18:46:48,170 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-06 18:46:48,176 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-06 18:46:48,177 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-06 18:46:48,179 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-06 18:46:48,181 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 7 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 67 treesize of output 78 [2019-11-06 18:46:48,182 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-06 18:46:48,199 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 18:46:48,199 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-06 18:46:48,199 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:80, output treesize:76 [2019-11-06 18:46:50,399 WARN L860 $PredicateComparison]: unable to prove that (exists ((|v_main_~#a~0.base_BEFORE_CALL_2| Int) (|v_main_~#b~0.base_BEFORE_CALL_2| Int) (v_main_~i~0_68 Int)) (let ((.cse0 (select |c_#memory_int| |v_main_~#a~0.base_BEFORE_CALL_2|)) (.cse1 (* v_main_~i~0_68 (- 4))) (.cse2 (select |c_#memory_int| |v_main_~#b~0.base_BEFORE_CALL_2|)) (.cse3 (* v_main_~i~0_68 4))) (and (<= 99999 v_main_~i~0_68) (= (select .cse0 (+ .cse1 400000)) (select .cse2 (+ .cse3 (- 4)))) (= (select .cse2 .cse3) (select .cse0 (+ .cse1 399996))) (not (= |v_main_~#b~0.base_BEFORE_CALL_2| |v_main_~#a~0.base_BEFORE_CALL_2|)) (= (select .cse0 (+ .cse1 400004)) (select .cse2 (+ .cse3 (- 8)))) (< v_main_~i~0_68 100000)))) is different from true [2019-11-06 18:46:52,522 WARN L860 $PredicateComparison]: unable to prove that (exists ((|v_main_~#a~0.base_BEFORE_CALL_3| Int) (v_main_~i~0_68 Int) (|v_main_~#b~0.base_BEFORE_CALL_3| Int)) (let ((.cse0 (select |c_#memory_int| |v_main_~#b~0.base_BEFORE_CALL_3|)) (.cse1 (* v_main_~i~0_68 4)) (.cse2 (select |c_#memory_int| |v_main_~#a~0.base_BEFORE_CALL_3|)) (.cse3 (* v_main_~i~0_68 (- 4)))) (and (<= 99999 v_main_~i~0_68) (= (select .cse0 (+ .cse1 (- 8))) (select .cse2 (+ .cse3 400004))) (= (select .cse2 (+ .cse3 400000)) (select .cse0 (+ .cse1 (- 4)))) (= (select .cse0 .cse1) (select .cse2 (+ .cse3 399996))) (not (= |v_main_~#b~0.base_BEFORE_CALL_3| |v_main_~#a~0.base_BEFORE_CALL_3|)) (< v_main_~i~0_68 100000)))) is different from true [2019-11-06 18:46:54,597 WARN L191 SmtUtils]: Spent 2.02 s on a formula simplification that was a NOOP. DAG size: 40 [2019-11-06 18:46:56,633 WARN L191 SmtUtils]: Spent 2.01 s on a formula simplification that was a NOOP. DAG size: 41 [2019-11-06 18:46:56,816 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-06 18:46:56,817 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-06 18:46:56,817 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-06 18:46:56,818 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-06 18:46:56,819 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-06 18:46:56,820 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-06 18:46:56,821 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-06 18:46:56,822 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-06 18:46:56,823 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-06 18:46:56,825 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 8 select indices, 8 select index equivalence classes, 7 disjoint index pairs (out of 28 index pairs), introduced 6 new quantified variables, introduced 0 case distinctions, treesize of input 70 treesize of output 16 [2019-11-06 18:46:56,825 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-06 18:46:56,832 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 18:46:56,833 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-06 18:46:56,833 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:80, output treesize:3 [2019-11-06 18:46:58,924 INFO L134 CoverageAnalysis]: Checked inductivity of 258 backedges. 55 proven. 11 refuted. 0 times theorem prover too weak. 185 trivial. 7 not checked. [2019-11-06 18:46:58,925 INFO L218 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-06 18:46:58,925 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 20] total 33 [2019-11-06 18:46:58,925 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [392817995] [2019-11-06 18:46:58,925 INFO L442 AbstractCegarLoop]: Interpolant automaton has 33 states [2019-11-06 18:46:58,926 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 18:46:58,926 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2019-11-06 18:46:58,926 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=150, Invalid=785, Unknown=3, NotChecked=118, Total=1056 [2019-11-06 18:46:58,926 INFO L87 Difference]: Start difference. First operand 78 states and 80 transitions. Second operand 33 states. [2019-11-06 18:47:05,326 WARN L191 SmtUtils]: Spent 4.03 s on a formula simplification. DAG size of input: 69 DAG size of output: 49 [2019-11-06 18:47:09,408 WARN L191 SmtUtils]: Spent 4.04 s on a formula simplification. DAG size of input: 72 DAG size of output: 51