/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/AutomizerCInline.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/loops/insertion_sort-2.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-6598664 [2019-11-23 22:13:50,447 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-23 22:13:50,450 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-23 22:13:50,466 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-23 22:13:50,466 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-23 22:13:50,467 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-23 22:13:50,469 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-23 22:13:50,470 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-23 22:13:50,472 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-23 22:13:50,472 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-23 22:13:50,473 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-23 22:13:50,474 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-23 22:13:50,475 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-23 22:13:50,476 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-23 22:13:50,476 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-23 22:13:50,478 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-23 22:13:50,478 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-23 22:13:50,479 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-23 22:13:50,481 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-23 22:13:50,483 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-23 22:13:50,484 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-23 22:13:50,487 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-23 22:13:50,488 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-23 22:13:50,489 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-23 22:13:50,491 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-23 22:13:50,494 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-23 22:13:50,494 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-23 22:13:50,495 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-23 22:13:50,495 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-23 22:13:50,496 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-23 22:13:50,497 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-23 22:13:50,500 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-23 22:13:50,500 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-23 22:13:50,501 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-23 22:13:50,505 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-23 22:13:50,505 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-23 22:13:50,506 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-23 22:13:50,506 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-23 22:13:50,506 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-23 22:13:50,508 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-23 22:13:50,510 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-23 22:13:50,511 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-23 22:13:50,524 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-23 22:13:50,524 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-23 22:13:50,525 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-23 22:13:50,526 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-23 22:13:50,526 INFO L138 SettingsManager]: * Use SBE=true [2019-11-23 22:13:50,527 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-23 22:13:50,527 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-23 22:13:50,527 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-23 22:13:50,527 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-23 22:13:50,527 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-23 22:13:50,527 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-23 22:13:50,528 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-23 22:13:50,528 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-23 22:13:50,528 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2019-11-23 22:13:50,528 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-23 22:13:50,528 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-23 22:13:50,529 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-23 22:13:50,530 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-23 22:13:50,530 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-23 22:13:50,530 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-23 22:13:50,530 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-23 22:13:50,531 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-23 22:13:50,531 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-23 22:13:50,531 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-23 22:13:50,531 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-23 22:13:50,532 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-23 22:13:50,532 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-23 22:13:50,532 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-23 22:13:50,532 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-23 22:13:50,532 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-11-23 22:13:50,788 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-23 22:13:50,801 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-23 22:13:50,804 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-23 22:13:50,806 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-23 22:13:50,806 INFO L275 PluginConnector]: CDTParser initialized [2019-11-23 22:13:50,807 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loops/insertion_sort-2.c [2019-11-23 22:13:50,877 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/04e4195d3/8abae3052caa491b851b2488a90c6920/FLAGab1c3d96f [2019-11-23 22:13:51,319 INFO L306 CDTParser]: Found 1 translation units. [2019-11-23 22:13:51,320 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loops/insertion_sort-2.c [2019-11-23 22:13:51,326 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/04e4195d3/8abae3052caa491b851b2488a90c6920/FLAGab1c3d96f [2019-11-23 22:13:51,716 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/04e4195d3/8abae3052caa491b851b2488a90c6920 [2019-11-23 22:13:51,727 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-23 22:13:51,729 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-11-23 22:13:51,731 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-23 22:13:51,731 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-23 22:13:51,735 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-23 22:13:51,736 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 10:13:51" (1/1) ... [2019-11-23 22:13:51,739 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@23bf5d37 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:13:51, skipping insertion in model container [2019-11-23 22:13:51,739 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 10:13:51" (1/1) ... [2019-11-23 22:13:51,747 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-23 22:13:51,764 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-11-23 22:13:51,975 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-23 22:13:51,978 INFO L203 MainTranslator]: Completed pre-run [2019-11-23 22:13:52,005 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-23 22:13:52,023 INFO L208 MainTranslator]: Completed translation [2019-11-23 22:13:52,024 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:13:52 WrapperNode [2019-11-23 22:13:52,024 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-23 22:13:52,025 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-23 22:13:52,025 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-23 22:13:52,025 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-23 22:13:52,031 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:13:52" (1/1) ... [2019-11-23 22:13:52,124 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:13:52" (1/1) ... [2019-11-23 22:13:52,148 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-23 22:13:52,148 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-23 22:13:52,148 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-23 22:13:52,148 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-23 22:13:52,156 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:13:52" (1/1) ... [2019-11-23 22:13:52,156 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:13:52" (1/1) ... [2019-11-23 22:13:52,158 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:13:52" (1/1) ... [2019-11-23 22:13:52,158 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:13:52" (1/1) ... [2019-11-23 22:13:52,164 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:13:52" (1/1) ... [2019-11-23 22:13:52,169 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:13:52" (1/1) ... [2019-11-23 22:13:52,170 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:13:52" (1/1) ... [2019-11-23 22:13:52,172 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-23 22:13:52,173 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-23 22:13:52,173 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-23 22:13:52,173 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-23 22:13:52,174 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:13:52" (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-23 22:13:52,245 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-11-23 22:13:52,245 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-23 22:13:52,245 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-23 22:13:52,246 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-11-23 22:13:52,246 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-23 22:13:52,246 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-23 22:13:52,489 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-23 22:13:52,489 INFO L284 CfgBuilder]: Removed 9 assume(true) statements. [2019-11-23 22:13:52,491 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 10:13:52 BoogieIcfgContainer [2019-11-23 22:13:52,491 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-23 22:13:52,492 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-23 22:13:52,492 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-23 22:13:52,495 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-23 22:13:52,496 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 10:13:51" (1/3) ... [2019-11-23 22:13:52,496 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2d3ac203 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 10:13:52, skipping insertion in model container [2019-11-23 22:13:52,497 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:13:52" (2/3) ... [2019-11-23 22:13:52,497 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2d3ac203 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 10:13:52, skipping insertion in model container [2019-11-23 22:13:52,497 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 10:13:52" (3/3) ... [2019-11-23 22:13:52,499 INFO L109 eAbstractionObserver]: Analyzing ICFG insertion_sort-2.c [2019-11-23 22:13:52,510 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-23 22:13:52,517 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-23 22:13:52,542 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-23 22:13:52,580 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-23 22:13:52,581 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-23 22:13:52,581 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-23 22:13:52,581 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-23 22:13:52,581 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-23 22:13:52,581 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-23 22:13:52,582 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-23 22:13:52,582 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-23 22:13:52,602 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states. [2019-11-23 22:13:52,610 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-11-23 22:13:52,610 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:13:52,611 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-11-23 22:13:52,612 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:13:52,624 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:13:52,625 INFO L82 PathProgramCache]: Analyzing trace with hash 1832584617, now seen corresponding path program 1 times [2019-11-23 22:13:52,634 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:13:52,634 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [543587110] [2019-11-23 22:13:52,635 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:13:52,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:13:52,758 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-23 22:13:52,759 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [543587110] [2019-11-23 22:13:52,760 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:13:52,760 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-23 22:13:52,761 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1079075969] [2019-11-23 22:13:52,766 INFO L442 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-11-23 22:13:52,766 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:13:52,778 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-11-23 22:13:52,779 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-11-23 22:13:52,781 INFO L87 Difference]: Start difference. First operand 19 states. Second operand 2 states. [2019-11-23 22:13:52,796 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:13:52,796 INFO L93 Difference]: Finished difference Result 36 states and 50 transitions. [2019-11-23 22:13:52,796 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-11-23 22:13:52,797 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 7 [2019-11-23 22:13:52,798 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:13:52,806 INFO L225 Difference]: With dead ends: 36 [2019-11-23 22:13:52,806 INFO L226 Difference]: Without dead ends: 15 [2019-11-23 22:13:52,809 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-11-23 22:13:52,827 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2019-11-23 22:13:52,841 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2019-11-23 22:13:52,842 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2019-11-23 22:13:52,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 18 transitions. [2019-11-23 22:13:52,844 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 18 transitions. Word has length 7 [2019-11-23 22:13:52,845 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:13:52,845 INFO L462 AbstractCegarLoop]: Abstraction has 15 states and 18 transitions. [2019-11-23 22:13:52,845 INFO L463 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-11-23 22:13:52,845 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 18 transitions. [2019-11-23 22:13:52,845 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-11-23 22:13:52,846 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:13:52,846 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-11-23 22:13:52,846 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:13:52,847 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:13:52,847 INFO L82 PathProgramCache]: Analyzing trace with hash 1808573071, now seen corresponding path program 1 times [2019-11-23 22:13:52,847 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:13:52,847 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [615797984] [2019-11-23 22:13:52,848 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:13:52,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:13:53,037 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-23 22:13:53,038 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [615797984] [2019-11-23 22:13:53,038 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:13:53,038 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-23 22:13:53,039 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [689510526] [2019-11-23 22:13:53,040 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-23 22:13:53,040 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:13:53,041 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-23 22:13:53,041 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-11-23 22:13:53,041 INFO L87 Difference]: Start difference. First operand 15 states and 18 transitions. Second operand 5 states. [2019-11-23 22:13:53,112 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:13:53,112 INFO L93 Difference]: Finished difference Result 29 states and 35 transitions. [2019-11-23 22:13:53,114 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-23 22:13:53,114 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 7 [2019-11-23 22:13:53,115 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:13:53,115 INFO L225 Difference]: With dead ends: 29 [2019-11-23 22:13:53,116 INFO L226 Difference]: Without dead ends: 21 [2019-11-23 22:13:53,117 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-11-23 22:13:53,118 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2019-11-23 22:13:53,124 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 16. [2019-11-23 22:13:53,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2019-11-23 22:13:53,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 19 transitions. [2019-11-23 22:13:53,127 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 19 transitions. Word has length 7 [2019-11-23 22:13:53,128 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:13:53,128 INFO L462 AbstractCegarLoop]: Abstraction has 16 states and 19 transitions. [2019-11-23 22:13:53,128 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-23 22:13:53,128 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 19 transitions. [2019-11-23 22:13:53,129 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-11-23 22:13:53,129 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:13:53,129 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 22:13:53,130 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:13:53,130 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:13:53,130 INFO L82 PathProgramCache]: Analyzing trace with hash -1501463134, now seen corresponding path program 1 times [2019-11-23 22:13:53,131 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:13:53,132 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1500496129] [2019-11-23 22:13:53,132 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:13:53,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:13:53,784 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 22:13:53,784 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1500496129] [2019-11-23 22:13:53,785 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1470350087] [2019-11-23 22:13:53,785 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-23 22:13:53,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:13:53,847 INFO L255 TraceCheckSpWp]: Trace formula consists of 49 conjuncts, 20 conjunts are in the unsatisfiable core [2019-11-23 22:13:53,854 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-23 22:13:53,973 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 22:13:54,103 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 22:13:54,107 INFO L377 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 28 treesize of output 27 [2019-11-23 22:13:54,108 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 22:13:54,121 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 22:13:54,122 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-23 22:13:54,123 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:37, output treesize:30 [2019-11-23 22:13:54,167 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 22:13:54,190 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 22:13:54,191 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-23 22:13:54,191 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10] total 17 [2019-11-23 22:13:54,191 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [647500959] [2019-11-23 22:13:54,192 INFO L442 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-11-23 22:13:54,192 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:13:54,192 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-11-23 22:13:54,193 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=218, Unknown=0, NotChecked=0, Total=272 [2019-11-23 22:13:54,193 INFO L87 Difference]: Start difference. First operand 16 states and 19 transitions. Second operand 17 states. [2019-11-23 22:13:55,036 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:13:55,036 INFO L93 Difference]: Finished difference Result 59 states and 72 transitions. [2019-11-23 22:13:55,038 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-11-23 22:13:55,038 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 13 [2019-11-23 22:13:55,038 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:13:55,042 INFO L225 Difference]: With dead ends: 59 [2019-11-23 22:13:55,042 INFO L226 Difference]: Without dead ends: 57 [2019-11-23 22:13:55,045 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 6 SyntacticMatches, 2 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 198 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=201, Invalid=729, Unknown=0, NotChecked=0, Total=930 [2019-11-23 22:13:55,046 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2019-11-23 22:13:55,056 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 26. [2019-11-23 22:13:55,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2019-11-23 22:13:55,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 33 transitions. [2019-11-23 22:13:55,057 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 33 transitions. Word has length 13 [2019-11-23 22:13:55,057 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:13:55,057 INFO L462 AbstractCegarLoop]: Abstraction has 26 states and 33 transitions. [2019-11-23 22:13:55,057 INFO L463 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-11-23 22:13:55,058 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 33 transitions. [2019-11-23 22:13:55,060 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-11-23 22:13:55,060 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:13:55,060 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 22:13:55,265 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 22:13:55,266 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:13:55,266 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:13:55,266 INFO L82 PathProgramCache]: Analyzing trace with hash -821404764, now seen corresponding path program 1 times [2019-11-23 22:13:55,267 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:13:55,267 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1728858624] [2019-11-23 22:13:55,268 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:13:55,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:13:55,321 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 22:13:55,322 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1728858624] [2019-11-23 22:13:55,322 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:13:55,322 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-23 22:13:55,323 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [745886004] [2019-11-23 22:13:55,323 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-23 22:13:55,324 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:13:55,324 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-23 22:13:55,324 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-23 22:13:55,324 INFO L87 Difference]: Start difference. First operand 26 states and 33 transitions. Second operand 5 states. [2019-11-23 22:13:55,379 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:13:55,379 INFO L93 Difference]: Finished difference Result 71 states and 91 transitions. [2019-11-23 22:13:55,380 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-23 22:13:55,380 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 13 [2019-11-23 22:13:55,380 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:13:55,381 INFO L225 Difference]: With dead ends: 71 [2019-11-23 22:13:55,381 INFO L226 Difference]: Without dead ends: 48 [2019-11-23 22:13:55,382 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-11-23 22:13:55,382 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2019-11-23 22:13:55,387 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 30. [2019-11-23 22:13:55,387 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2019-11-23 22:13:55,388 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 37 transitions. [2019-11-23 22:13:55,388 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 37 transitions. Word has length 13 [2019-11-23 22:13:55,388 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:13:55,389 INFO L462 AbstractCegarLoop]: Abstraction has 30 states and 37 transitions. [2019-11-23 22:13:55,389 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-23 22:13:55,389 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 37 transitions. [2019-11-23 22:13:55,389 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-11-23 22:13:55,390 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:13:55,390 INFO L410 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 22:13:55,390 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:13:55,390 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:13:55,390 INFO L82 PathProgramCache]: Analyzing trace with hash -2025191347, now seen corresponding path program 1 times [2019-11-23 22:13:55,391 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:13:55,391 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [55082578] [2019-11-23 22:13:55,391 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:13:55,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:13:55,906 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 22:13:55,907 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [55082578] [2019-11-23 22:13:55,907 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1166026277] [2019-11-23 22:13:55,908 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 22:13:55,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:13:55,978 INFO L255 TraceCheckSpWp]: Trace formula consists of 55 conjuncts, 22 conjunts are in the unsatisfiable core [2019-11-23 22:13:55,980 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-23 22:13:56,051 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 22:13:56,104 INFO L343 Elim1Store]: treesize reduction 39, result has 22.0 percent of original size [2019-11-23 22:13:56,104 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 38 treesize of output 29 [2019-11-23 22:13:56,105 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 22:13:56,126 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 22:13:56,128 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-23 22:13:56,128 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:49, output treesize:45 [2019-11-23 22:13:56,346 INFO L343 Elim1Store]: treesize reduction 17, result has 85.8 percent of original size [2019-11-23 22:13:56,346 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 50 treesize of output 123 [2019-11-23 22:13:56,348 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 22:13:56,348 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 22:13:56,350 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 22:13:56,388 INFO L567 ElimStorePlain]: treesize reduction 131, result has 22.0 percent of original size [2019-11-23 22:13:56,389 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-23 22:13:56,390 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:64, output treesize:29 [2019-11-23 22:13:56,454 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 22:13:56,488 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 22:13:56,488 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-23 22:13:56,488 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 22 [2019-11-23 22:13:56,489 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1056146003] [2019-11-23 22:13:56,489 INFO L442 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-11-23 22:13:56,490 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:13:56,490 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-11-23 22:13:56,490 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=389, Unknown=0, NotChecked=0, Total=462 [2019-11-23 22:13:56,490 INFO L87 Difference]: Start difference. First operand 30 states and 37 transitions. Second operand 22 states. [2019-11-23 22:13:57,166 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:13:57,167 INFO L93 Difference]: Finished difference Result 81 states and 98 transitions. [2019-11-23 22:13:57,167 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-11-23 22:13:57,167 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 16 [2019-11-23 22:13:57,167 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:13:57,168 INFO L225 Difference]: With dead ends: 81 [2019-11-23 22:13:57,168 INFO L226 Difference]: Without dead ends: 56 [2019-11-23 22:13:57,169 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 7 SyntacticMatches, 1 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 280 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=176, Invalid=880, Unknown=0, NotChecked=0, Total=1056 [2019-11-23 22:13:57,170 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2019-11-23 22:13:57,175 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 30. [2019-11-23 22:13:57,175 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2019-11-23 22:13:57,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 35 transitions. [2019-11-23 22:13:57,176 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 35 transitions. Word has length 16 [2019-11-23 22:13:57,177 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:13:57,177 INFO L462 AbstractCegarLoop]: Abstraction has 30 states and 35 transitions. [2019-11-23 22:13:57,177 INFO L463 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-11-23 22:13:57,177 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 35 transitions. [2019-11-23 22:13:57,178 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-11-23 22:13:57,178 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:13:57,178 INFO L410 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 22:13:57,384 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 22:13:57,384 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:13:57,385 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:13:57,385 INFO L82 PathProgramCache]: Analyzing trace with hash 1901934840, now seen corresponding path program 1 times [2019-11-23 22:13:57,385 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:13:57,386 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2041174685] [2019-11-23 22:13:57,386 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:13:57,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:13:57,576 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 22:13:57,576 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2041174685] [2019-11-23 22:13:57,576 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1550659943] [2019-11-23 22:13:57,577 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 22:13:57,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:13:57,631 INFO L255 TraceCheckSpWp]: Trace formula consists of 62 conjuncts, 10 conjunts are in the unsatisfiable core [2019-11-23 22:13:57,632 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-23 22:13:57,683 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 22:13:57,684 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-23 22:13:57,684 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7] total 10 [2019-11-23 22:13:57,684 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [514398154] [2019-11-23 22:13:57,685 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-11-23 22:13:57,685 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:13:57,685 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-11-23 22:13:57,685 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2019-11-23 22:13:57,685 INFO L87 Difference]: Start difference. First operand 30 states and 35 transitions. Second operand 10 states. [2019-11-23 22:13:57,855 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:13:57,855 INFO L93 Difference]: Finished difference Result 46 states and 53 transitions. [2019-11-23 22:13:57,856 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-23 22:13:57,856 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 17 [2019-11-23 22:13:57,856 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:13:57,856 INFO L225 Difference]: With dead ends: 46 [2019-11-23 22:13:57,856 INFO L226 Difference]: Without dead ends: 34 [2019-11-23 22:13:57,857 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 14 SyntacticMatches, 2 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=49, Invalid=133, Unknown=0, NotChecked=0, Total=182 [2019-11-23 22:13:57,857 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2019-11-23 22:13:57,862 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 27. [2019-11-23 22:13:57,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2019-11-23 22:13:57,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 31 transitions. [2019-11-23 22:13:57,863 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 31 transitions. Word has length 17 [2019-11-23 22:13:57,863 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:13:57,863 INFO L462 AbstractCegarLoop]: Abstraction has 27 states and 31 transitions. [2019-11-23 22:13:57,863 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-11-23 22:13:57,863 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 31 transitions. [2019-11-23 22:13:57,864 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-11-23 22:13:57,864 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:13:57,864 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 22:13:58,073 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 22:13:58,073 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:13:58,074 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:13:58,074 INFO L82 PathProgramCache]: Analyzing trace with hash -335774091, now seen corresponding path program 2 times [2019-11-23 22:13:58,074 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:13:58,074 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [293083687] [2019-11-23 22:13:58,074 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:13:58,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:13:58,631 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 22:13:58,632 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [293083687] [2019-11-23 22:13:58,632 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [381724816] [2019-11-23 22:13:58,632 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 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-23 22:13:58,689 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-11-23 22:13:58,690 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-23 22:13:58,691 INFO L255 TraceCheckSpWp]: Trace formula consists of 63 conjuncts, 26 conjunts are in the unsatisfiable core [2019-11-23 22:13:58,697 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-23 22:13:58,774 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 22:13:58,884 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 22:13:58,885 INFO L377 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 28 treesize of output 27 [2019-11-23 22:13:58,886 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 22:13:58,897 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 22:13:58,898 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-23 22:13:58,899 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:42, output treesize:35 [2019-11-23 22:13:58,975 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 22:13:58,977 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 22:13:58,980 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 22:13:58,982 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 22:13:58,982 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 32 treesize of output 34 [2019-11-23 22:13:58,983 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 22:13:58,993 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 22:13:58,994 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-23 22:13:58,994 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:46, output treesize:30 [2019-11-23 22:13:59,027 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 22:13:59,047 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 22:13:59,048 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-23 22:13:59,048 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 20 [2019-11-23 22:13:59,048 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2130711906] [2019-11-23 22:13:59,049 INFO L442 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-11-23 22:13:59,049 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:13:59,049 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-11-23 22:13:59,050 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=315, Unknown=0, NotChecked=0, Total=380 [2019-11-23 22:13:59,050 INFO L87 Difference]: Start difference. First operand 27 states and 31 transitions. Second operand 20 states. [2019-11-23 22:14:00,177 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:14:00,177 INFO L93 Difference]: Finished difference Result 77 states and 90 transitions. [2019-11-23 22:14:00,178 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-11-23 22:14:00,178 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 19 [2019-11-23 22:14:00,178 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:14:00,179 INFO L225 Difference]: With dead ends: 77 [2019-11-23 22:14:00,179 INFO L226 Difference]: Without dead ends: 75 [2019-11-23 22:14:00,180 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 9 SyntacticMatches, 4 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 361 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=210, Invalid=1122, Unknown=0, NotChecked=0, Total=1332 [2019-11-23 22:14:00,181 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2019-11-23 22:14:00,188 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 39. [2019-11-23 22:14:00,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2019-11-23 22:14:00,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 45 transitions. [2019-11-23 22:14:00,189 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 45 transitions. Word has length 19 [2019-11-23 22:14:00,189 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:14:00,189 INFO L462 AbstractCegarLoop]: Abstraction has 39 states and 45 transitions. [2019-11-23 22:14:00,189 INFO L463 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-11-23 22:14:00,190 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 45 transitions. [2019-11-23 22:14:00,190 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-11-23 22:14:00,190 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:14:00,191 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 22:14:00,394 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 22:14:00,395 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:14:00,395 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:14:00,395 INFO L82 PathProgramCache]: Analyzing trace with hash -473557864, now seen corresponding path program 1 times [2019-11-23 22:14:00,396 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:14:00,396 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1612600803] [2019-11-23 22:14:00,397 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:14:00,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:14:00,667 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 2 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 22:14:00,668 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1612600803] [2019-11-23 22:14:00,668 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [639116150] [2019-11-23 22:14:00,668 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 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-23 22:14:00,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:14:00,719 INFO L255 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 22 conjunts are in the unsatisfiable core [2019-11-23 22:14:00,722 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-23 22:14:00,775 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 22:14:00,809 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 22:14:00,811 INFO L377 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 32 treesize of output 31 [2019-11-23 22:14:00,811 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 22:14:00,825 INFO L567 ElimStorePlain]: treesize reduction 5, result has 86.1 percent of original size [2019-11-23 22:14:00,826 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-23 22:14:00,826 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:40, output treesize:28 [2019-11-23 22:14:00,850 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 22:14:00,867 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 3 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 22:14:00,868 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-23 22:14:00,868 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 15 [2019-11-23 22:14:00,868 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [231093614] [2019-11-23 22:14:00,869 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-11-23 22:14:00,869 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:14:00,869 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-11-23 22:14:00,869 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=167, Unknown=0, NotChecked=0, Total=210 [2019-11-23 22:14:00,870 INFO L87 Difference]: Start difference. First operand 39 states and 45 transitions. Second operand 15 states. [2019-11-23 22:14:01,681 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:14:01,681 INFO L93 Difference]: Finished difference Result 105 states and 124 transitions. [2019-11-23 22:14:01,681 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2019-11-23 22:14:01,682 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 22 [2019-11-23 22:14:01,682 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:14:01,683 INFO L225 Difference]: With dead ends: 105 [2019-11-23 22:14:01,683 INFO L226 Difference]: Without dead ends: 103 [2019-11-23 22:14:01,684 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 15 SyntacticMatches, 5 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 418 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=334, Invalid=1226, Unknown=0, NotChecked=0, Total=1560 [2019-11-23 22:14:01,685 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2019-11-23 22:14:01,693 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 51. [2019-11-23 22:14:01,693 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2019-11-23 22:14:01,694 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 62 transitions. [2019-11-23 22:14:01,694 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 62 transitions. Word has length 22 [2019-11-23 22:14:01,694 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:14:01,695 INFO L462 AbstractCegarLoop]: Abstraction has 51 states and 62 transitions. [2019-11-23 22:14:01,695 INFO L463 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-11-23 22:14:01,695 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 62 transitions. [2019-11-23 22:14:01,696 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-11-23 22:14:01,696 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:14:01,696 INFO L410 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 22:14:01,899 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 22:14:01,899 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:14:01,900 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:14:01,900 INFO L82 PathProgramCache]: Analyzing trace with hash 206500506, now seen corresponding path program 2 times [2019-11-23 22:14:01,900 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:14:01,901 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1514202192] [2019-11-23 22:14:01,901 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:14:01,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:14:01,943 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 7 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 22:14:01,943 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1514202192] [2019-11-23 22:14:01,943 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [434999712] [2019-11-23 22:14:01,943 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 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-23 22:14:01,989 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-11-23 22:14:01,989 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-23 22:14:01,990 INFO L255 TraceCheckSpWp]: Trace formula consists of 69 conjuncts, 6 conjunts are in the unsatisfiable core [2019-11-23 22:14:01,991 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-23 22:14:01,997 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 22:14:01,998 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 7 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 22:14:01,998 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-23 22:14:01,998 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 7 [2019-11-23 22:14:01,999 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [411060401] [2019-11-23 22:14:02,000 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-23 22:14:02,000 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:14:02,000 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-23 22:14:02,000 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-11-23 22:14:02,001 INFO L87 Difference]: Start difference. First operand 51 states and 62 transitions. Second operand 7 states. [2019-11-23 22:14:02,150 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:14:02,150 INFO L93 Difference]: Finished difference Result 113 states and 140 transitions. [2019-11-23 22:14:02,151 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-11-23 22:14:02,151 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 22 [2019-11-23 22:14:02,151 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:14:02,152 INFO L225 Difference]: With dead ends: 113 [2019-11-23 22:14:02,152 INFO L226 Difference]: Without dead ends: 88 [2019-11-23 22:14:02,153 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=58, Invalid=98, Unknown=0, NotChecked=0, Total=156 [2019-11-23 22:14:02,154 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2019-11-23 22:14:02,177 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 57. [2019-11-23 22:14:02,177 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2019-11-23 22:14:02,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 70 transitions. [2019-11-23 22:14:02,179 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 70 transitions. Word has length 22 [2019-11-23 22:14:02,179 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:14:02,180 INFO L462 AbstractCegarLoop]: Abstraction has 57 states and 70 transitions. [2019-11-23 22:14:02,180 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-23 22:14:02,180 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 70 transitions. [2019-11-23 22:14:02,184 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-11-23 22:14:02,184 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:14:02,184 INFO L410 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 22:14:02,390 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 22:14:02,391 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:14:02,391 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:14:02,391 INFO L82 PathProgramCache]: Analyzing trace with hash -2004935456, now seen corresponding path program 3 times [2019-11-23 22:14:02,391 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:14:02,391 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1133422053] [2019-11-23 22:14:02,392 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:14:02,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:14:02,909 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 22:14:02,910 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1133422053] [2019-11-23 22:14:02,910 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [188826072] [2019-11-23 22:14:02,910 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 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-23 22:14:02,951 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2019-11-23 22:14:02,951 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-23 22:14:02,952 INFO L255 TraceCheckSpWp]: Trace formula consists of 69 conjuncts, 29 conjunts are in the unsatisfiable core [2019-11-23 22:14:02,954 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-23 22:14:02,974 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 22:14:03,006 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 22:14:03,007 INFO L377 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 39 treesize of output 29 [2019-11-23 22:14:03,007 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 22:14:03,021 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 22:14:03,021 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-23 22:14:03,021 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:53, output treesize:49 [2019-11-23 22:14:03,178 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 22:14:03,179 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-23 22:14:03,180 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 22:14:03,181 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 51 treesize of output 44 [2019-11-23 22:14:03,181 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 22:14:03,206 INFO L567 ElimStorePlain]: treesize reduction 12, result has 76.9 percent of original size [2019-11-23 22:14:03,207 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-23 22:14:03,208 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:65, output treesize:32 [2019-11-23 22:14:03,335 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 22:14:03,336 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 22:14:03,337 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 22:14:03,338 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 22:14:03,339 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 32 treesize of output 34 [2019-11-23 22:14:03,339 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 22:14:03,348 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 22:14:03,349 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-23 22:14:03,349 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:38, output treesize:19 [2019-11-23 22:14:03,363 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 22:14:03,394 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 22:14:03,394 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-23 22:14:03,395 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 21 [2019-11-23 22:14:03,395 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1542568168] [2019-11-23 22:14:03,395 INFO L442 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-11-23 22:14:03,396 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:14:03,396 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-11-23 22:14:03,396 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=345, Unknown=0, NotChecked=0, Total=420 [2019-11-23 22:14:03,396 INFO L87 Difference]: Start difference. First operand 57 states and 70 transitions. Second operand 21 states. [2019-11-23 22:14:04,091 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:14:04,091 INFO L93 Difference]: Finished difference Result 88 states and 105 transitions. [2019-11-23 22:14:04,092 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-11-23 22:14:04,092 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 22 [2019-11-23 22:14:04,092 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:14:04,093 INFO L225 Difference]: With dead ends: 88 [2019-11-23 22:14:04,093 INFO L226 Difference]: Without dead ends: 86 [2019-11-23 22:14:04,094 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 11 SyntacticMatches, 6 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 304 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=191, Invalid=865, Unknown=0, NotChecked=0, Total=1056 [2019-11-23 22:14:04,094 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2019-11-23 22:14:04,109 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 51. [2019-11-23 22:14:04,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2019-11-23 22:14:04,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 63 transitions. [2019-11-23 22:14:04,112 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 63 transitions. Word has length 22 [2019-11-23 22:14:04,112 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:14:04,112 INFO L462 AbstractCegarLoop]: Abstraction has 51 states and 63 transitions. [2019-11-23 22:14:04,112 INFO L463 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-11-23 22:14:04,113 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 63 transitions. [2019-11-23 22:14:04,113 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-11-23 22:14:04,113 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:14:04,114 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 22:14:04,326 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 22:14:04,326 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:14:04,327 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:14:04,327 INFO L82 PathProgramCache]: Analyzing trace with hash -1930061749, now seen corresponding path program 2 times [2019-11-23 22:14:04,327 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:14:04,328 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1060984427] [2019-11-23 22:14:04,328 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:14:04,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:14:04,570 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 22:14:04,570 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1060984427] [2019-11-23 22:14:04,571 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [448826841] [2019-11-23 22:14:04,571 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 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-23 22:14:04,617 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-11-23 22:14:04,617 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-23 22:14:04,618 INFO L255 TraceCheckSpWp]: Trace formula consists of 76 conjuncts, 29 conjunts are in the unsatisfiable core [2019-11-23 22:14:04,620 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-23 22:14:04,688 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 22:14:04,763 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 22:14:04,764 INFO L377 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 23 treesize of output 22 [2019-11-23 22:14:04,764 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 22:14:04,770 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 22:14:04,771 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-23 22:14:04,771 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:26, output treesize:19 [2019-11-23 22:14:04,873 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 22:14:04,896 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 22:14:04,897 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-23 22:14:04,897 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12] total 23 [2019-11-23 22:14:04,897 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1211945567] [2019-11-23 22:14:04,898 INFO L442 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-11-23 22:14:04,898 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:14:04,898 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-11-23 22:14:04,898 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=434, Unknown=0, NotChecked=0, Total=506 [2019-11-23 22:14:04,899 INFO L87 Difference]: Start difference. First operand 51 states and 63 transitions. Second operand 23 states. [2019-11-23 22:14:05,443 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:14:05,443 INFO L93 Difference]: Finished difference Result 83 states and 98 transitions. [2019-11-23 22:14:05,444 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-11-23 22:14:05,444 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 23 [2019-11-23 22:14:05,444 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:14:05,445 INFO L225 Difference]: With dead ends: 83 [2019-11-23 22:14:05,445 INFO L226 Difference]: Without dead ends: 81 [2019-11-23 22:14:05,447 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 308 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=196, Invalid=994, Unknown=0, NotChecked=0, Total=1190 [2019-11-23 22:14:05,448 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2019-11-23 22:14:05,461 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 59. [2019-11-23 22:14:05,461 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2019-11-23 22:14:05,462 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 72 transitions. [2019-11-23 22:14:05,462 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 72 transitions. Word has length 23 [2019-11-23 22:14:05,462 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:14:05,462 INFO L462 AbstractCegarLoop]: Abstraction has 59 states and 72 transitions. [2019-11-23 22:14:05,463 INFO L463 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-11-23 22:14:05,464 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 72 transitions. [2019-11-23 22:14:05,465 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-11-23 22:14:05,467 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:14:05,467 INFO L410 BasicCegarLoop]: trace histogram [4, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 22:14:05,670 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 22:14:05,671 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:14:05,672 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:14:05,672 INFO L82 PathProgramCache]: Analyzing trace with hash 1478854039, now seen corresponding path program 4 times [2019-11-23 22:14:05,672 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:14:05,673 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1569272191] [2019-11-23 22:14:05,673 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:14:05,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:14:05,934 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 6 proven. 17 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 22:14:05,934 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1569272191] [2019-11-23 22:14:05,934 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [360421970] [2019-11-23 22:14:05,935 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 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-23 22:14:05,979 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-11-23 22:14:05,979 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-23 22:14:05,980 INFO L255 TraceCheckSpWp]: Trace formula consists of 78 conjuncts, 26 conjunts are in the unsatisfiable core [2019-11-23 22:14:05,983 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-23 22:14:06,042 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 22:14:06,098 INFO L343 Elim1Store]: treesize reduction 39, result has 22.0 percent of original size [2019-11-23 22:14:06,098 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 38 treesize of output 29 [2019-11-23 22:14:06,099 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 22:14:06,108 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 22:14:06,109 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-23 22:14:06,109 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:46, output treesize:43 [2019-11-23 22:14:06,265 INFO L343 Elim1Store]: treesize reduction 17, result has 85.8 percent of original size [2019-11-23 22:14:06,265 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 51 treesize of output 123 [2019-11-23 22:14:06,266 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 22:14:06,267 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 22:14:06,268 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 22:14:06,314 INFO L567 ElimStorePlain]: treesize reduction 129, result has 22.3 percent of original size [2019-11-23 22:14:06,316 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-23 22:14:06,316 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:62, output treesize:29 [2019-11-23 22:14:06,366 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 22:14:06,397 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 15 proven. 3 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-11-23 22:14:06,397 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-23 22:14:06,397 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 11] total 22 [2019-11-23 22:14:06,397 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1137425279] [2019-11-23 22:14:06,398 INFO L442 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-11-23 22:14:06,398 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:14:06,398 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-11-23 22:14:06,398 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=397, Unknown=0, NotChecked=0, Total=462 [2019-11-23 22:14:06,398 INFO L87 Difference]: Start difference. First operand 59 states and 72 transitions. Second operand 22 states. [2019-11-23 22:14:08,061 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:14:08,061 INFO L93 Difference]: Finished difference Result 152 states and 181 transitions. [2019-11-23 22:14:08,062 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2019-11-23 22:14:08,062 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 25 [2019-11-23 22:14:08,062 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:14:08,063 INFO L225 Difference]: With dead ends: 152 [2019-11-23 22:14:08,063 INFO L226 Difference]: Without dead ends: 124 [2019-11-23 22:14:08,065 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 965 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=420, Invalid=2886, Unknown=0, NotChecked=0, Total=3306 [2019-11-23 22:14:08,066 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2019-11-23 22:14:08,073 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 59. [2019-11-23 22:14:08,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2019-11-23 22:14:08,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 70 transitions. [2019-11-23 22:14:08,074 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 70 transitions. Word has length 25 [2019-11-23 22:14:08,074 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:14:08,074 INFO L462 AbstractCegarLoop]: Abstraction has 59 states and 70 transitions. [2019-11-23 22:14:08,075 INFO L463 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-11-23 22:14:08,075 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 70 transitions. [2019-11-23 22:14:08,075 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-11-23 22:14:08,075 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:14:08,076 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 22:14:08,278 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 22:14:08,279 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:14:08,280 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:14:08,280 INFO L82 PathProgramCache]: Analyzing trace with hash -1141807890, now seen corresponding path program 1 times [2019-11-23 22:14:08,280 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:14:08,281 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [468401344] [2019-11-23 22:14:08,281 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:14:08,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:14:08,501 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 22:14:08,502 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [468401344] [2019-11-23 22:14:08,502 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1240022698] [2019-11-23 22:14:08,502 INFO L94 rtionOrderModulation]: Keeping assertion order 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-23 22:14:08,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:14:08,540 INFO L255 TraceCheckSpWp]: Trace formula consists of 85 conjuncts, 33 conjunts are in the unsatisfiable core [2019-11-23 22:14:08,541 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-23 22:14:08,585 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 22:14:08,629 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 22:14:08,630 INFO L377 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 31 treesize of output 24 [2019-11-23 22:14:08,631 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 22:14:08,638 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 22:14:08,639 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-23 22:14:08,639 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:37, output treesize:33 [2019-11-23 22:14:08,742 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 22:14:08,743 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-23 22:14:08,744 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 22:14:08,745 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 43 treesize of output 39 [2019-11-23 22:14:08,745 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 22:14:08,766 INFO L567 ElimStorePlain]: treesize reduction 12, result has 71.4 percent of original size [2019-11-23 22:14:08,767 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-23 22:14:08,767 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:52, output treesize:21 [2019-11-23 22:14:08,873 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 22:14:08,900 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 22:14:08,901 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-23 22:14:08,901 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 26 [2019-11-23 22:14:08,901 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1546452957] [2019-11-23 22:14:08,901 INFO L442 AbstractCegarLoop]: Interpolant automaton has 26 states [2019-11-23 22:14:08,902 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:14:08,902 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2019-11-23 22:14:08,902 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=573, Unknown=0, NotChecked=0, Total=650 [2019-11-23 22:14:08,902 INFO L87 Difference]: Start difference. First operand 59 states and 70 transitions. Second operand 26 states. [2019-11-23 22:14:09,620 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:14:09,620 INFO L93 Difference]: Finished difference Result 96 states and 109 transitions. [2019-11-23 22:14:09,621 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-11-23 22:14:09,621 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 26 [2019-11-23 22:14:09,621 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:14:09,622 INFO L225 Difference]: With dead ends: 96 [2019-11-23 22:14:09,622 INFO L226 Difference]: Without dead ends: 94 [2019-11-23 22:14:09,625 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 369 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=177, Invalid=1229, Unknown=0, NotChecked=0, Total=1406 [2019-11-23 22:14:09,625 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2019-11-23 22:14:09,640 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 62. [2019-11-23 22:14:09,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2019-11-23 22:14:09,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 74 transitions. [2019-11-23 22:14:09,641 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 74 transitions. Word has length 26 [2019-11-23 22:14:09,642 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:14:09,642 INFO L462 AbstractCegarLoop]: Abstraction has 62 states and 74 transitions. [2019-11-23 22:14:09,642 INFO L463 AbstractCegarLoop]: Interpolant automaton has 26 states. [2019-11-23 22:14:09,642 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 74 transitions. [2019-11-23 22:14:09,645 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-11-23 22:14:09,645 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:14:09,646 INFO L410 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2019-11-23 22:14:09,850 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 22:14:09,851 INFO L410 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:14:09,851 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:14:09,851 INFO L82 PathProgramCache]: Analyzing trace with hash 1971443489, now seen corresponding path program 3 times [2019-11-23 22:14:09,852 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:14:09,852 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1185277457] [2019-11-23 22:14:09,852 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:14:09,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:14:10,032 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 2 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 22:14:10,033 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1185277457] [2019-11-23 22:14:10,033 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [677810478] [2019-11-23 22:14:10,033 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 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-23 22:14:10,093 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-11-23 22:14:10,093 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-23 22:14:10,094 INFO L255 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 14 conjunts are in the unsatisfiable core [2019-11-23 22:14:10,097 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-23 22:14:10,162 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 2 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 22:14:10,163 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-23 22:14:10,163 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 12 [2019-11-23 22:14:10,163 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2079760943] [2019-11-23 22:14:10,164 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-11-23 22:14:10,164 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:14:10,164 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-11-23 22:14:10,164 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2019-11-23 22:14:10,164 INFO L87 Difference]: Start difference. First operand 62 states and 74 transitions. Second operand 12 states. [2019-11-23 22:14:10,293 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:14:10,293 INFO L93 Difference]: Finished difference Result 104 states and 121 transitions. [2019-11-23 22:14:10,293 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-23 22:14:10,293 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 27 [2019-11-23 22:14:10,294 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:14:10,294 INFO L225 Difference]: With dead ends: 104 [2019-11-23 22:14:10,295 INFO L226 Difference]: Without dead ends: 88 [2019-11-23 22:14:10,295 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 23 SyntacticMatches, 2 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=58, Invalid=182, Unknown=0, NotChecked=0, Total=240 [2019-11-23 22:14:10,296 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2019-11-23 22:14:10,305 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 68. [2019-11-23 22:14:10,306 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2019-11-23 22:14:10,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 79 transitions. [2019-11-23 22:14:10,306 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 79 transitions. Word has length 27 [2019-11-23 22:14:10,306 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:14:10,307 INFO L462 AbstractCegarLoop]: Abstraction has 68 states and 79 transitions. [2019-11-23 22:14:10,307 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-11-23 22:14:10,307 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 79 transitions. [2019-11-23 22:14:10,307 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-11-23 22:14:10,307 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:14:10,307 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 22:14:10,510 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 22:14:10,511 INFO L410 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:14:10,511 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:14:10,511 INFO L82 PathProgramCache]: Analyzing trace with hash -248295131, now seen corresponding path program 2 times [2019-11-23 22:14:10,512 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:14:10,512 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [119158932] [2019-11-23 22:14:10,512 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:14:10,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:14:11,169 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 22:14:11,169 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [119158932] [2019-11-23 22:14:11,169 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [184978914] [2019-11-23 22:14:11,170 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 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-23 22:14:11,202 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-11-23 22:14:11,202 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-23 22:14:11,203 INFO L255 TraceCheckSpWp]: Trace formula consists of 86 conjuncts, 34 conjunts are in the unsatisfiable core [2019-11-23 22:14:11,205 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-23 22:14:11,264 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 22:14:11,365 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 22:14:11,366 INFO L377 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 28 treesize of output 27 [2019-11-23 22:14:11,366 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 22:14:11,378 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 22:14:11,379 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-23 22:14:11,379 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:42, output treesize:35 [2019-11-23 22:14:11,438 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 22:14:11,440 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 22:14:11,441 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 22:14:11,442 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 22:14:11,442 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 32 treesize of output 34 [2019-11-23 22:14:11,443 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 22:14:11,450 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 22:14:11,451 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-23 22:14:11,451 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:40, output treesize:25 [2019-11-23 22:14:11,481 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 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 75 treesize of output 62 [2019-11-23 22:14:11,485 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 22:14:11,486 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 22:14:11,486 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 22:14:11,487 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 22:14:11,488 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 22:14:11,489 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 22:14:11,491 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 22:14:11,493 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 22:14:11,495 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 22:14:11,496 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 22:14:11,498 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 22:14:11,499 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 22:14:11,500 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 22:14:11,501 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 22:14:11,504 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 46 [2019-11-23 22:14:11,505 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-23 22:14:11,511 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 22:14:11,511 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-23 22:14:11,519 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 22:14:11,520 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-23 22:14:11,520 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:83, output treesize:45 [2019-11-23 22:14:11,548 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 22:14:11,549 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 22:14:11,550 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 22:14:11,551 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 22:14:11,551 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 22:14:11,552 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 22:14:11,553 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 22:14:11,554 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 42 treesize of output 41 [2019-11-23 22:14:11,554 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 22:14:11,559 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 22:14:11,559 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-23 22:14:11,559 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:45, output treesize:17 [2019-11-23 22:14:11,575 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 22:14:11,597 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 22:14:11,597 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-23 22:14:11,597 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16] total 23 [2019-11-23 22:14:11,598 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [750947752] [2019-11-23 22:14:11,598 INFO L442 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-11-23 22:14:11,598 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:14:11,598 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-11-23 22:14:11,599 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=424, Unknown=0, NotChecked=0, Total=506 [2019-11-23 22:14:11,599 INFO L87 Difference]: Start difference. First operand 68 states and 79 transitions. Second operand 23 states. [2019-11-23 22:14:12,577 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:14:12,578 INFO L93 Difference]: Finished difference Result 134 states and 155 transitions. [2019-11-23 22:14:12,578 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-11-23 22:14:12,578 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 28 [2019-11-23 22:14:12,578 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:14:12,580 INFO L225 Difference]: With dead ends: 134 [2019-11-23 22:14:12,580 INFO L226 Difference]: Without dead ends: 132 [2019-11-23 22:14:12,581 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 17 SyntacticMatches, 6 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 473 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=190, Invalid=1292, Unknown=0, NotChecked=0, Total=1482 [2019-11-23 22:14:12,582 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2019-11-23 22:14:12,592 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 83. [2019-11-23 22:14:12,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. [2019-11-23 22:14:12,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 97 transitions. [2019-11-23 22:14:12,593 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 97 transitions. Word has length 28 [2019-11-23 22:14:12,593 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:14:12,593 INFO L462 AbstractCegarLoop]: Abstraction has 83 states and 97 transitions. [2019-11-23 22:14:12,593 INFO L463 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-11-23 22:14:12,593 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 97 transitions. [2019-11-23 22:14:12,594 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-11-23 22:14:12,594 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:14:12,594 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 22:14:12,802 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 22:14:12,802 INFO L410 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:14:12,802 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:14:12,802 INFO L82 PathProgramCache]: Analyzing trace with hash -499809045, now seen corresponding path program 3 times [2019-11-23 22:14:12,803 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:14:12,803 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [248484668] [2019-11-23 22:14:12,803 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:14:12,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:14:13,591 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 2 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 22:14:13,591 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [248484668] [2019-11-23 22:14:13,591 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1244019201] [2019-11-23 22:14:13,591 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 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 22:14:13,637 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2019-11-23 22:14:13,637 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-23 22:14:13,638 INFO L255 TraceCheckSpWp]: Trace formula consists of 86 conjuncts, 29 conjunts are in the unsatisfiable core [2019-11-23 22:14:13,640 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-23 22:14:13,707 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 22:14:13,820 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 22:14:13,821 INFO L377 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 29 treesize of output 28 [2019-11-23 22:14:13,822 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 22:14:13,833 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 22:14:13,833 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-23 22:14:13,833 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:38, output treesize:31 [2019-11-23 22:14:13,961 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 22:14:13,963 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 22:14:13,964 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 22:14:13,966 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 22:14:13,966 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 32 [2019-11-23 22:14:13,966 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 22:14:13,975 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 22:14:13,975 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-23 22:14:13,975 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:41, output treesize:17 [2019-11-23 22:14:14,012 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 22:14:14,033 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 22:14:14,033 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-23 22:14:14,034 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 15] total 27 [2019-11-23 22:14:14,034 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [490300294] [2019-11-23 22:14:14,034 INFO L442 AbstractCegarLoop]: Interpolant automaton has 27 states [2019-11-23 22:14:14,034 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:14:14,034 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2019-11-23 22:14:14,035 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=107, Invalid=595, Unknown=0, NotChecked=0, Total=702 [2019-11-23 22:14:14,035 INFO L87 Difference]: Start difference. First operand 83 states and 97 transitions. Second operand 27 states. [2019-11-23 22:14:15,389 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:14:15,389 INFO L93 Difference]: Finished difference Result 124 states and 142 transitions. [2019-11-23 22:14:15,389 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2019-11-23 22:14:15,390 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 28 [2019-11-23 22:14:15,390 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:14:15,391 INFO L225 Difference]: With dead ends: 124 [2019-11-23 22:14:15,391 INFO L226 Difference]: Without dead ends: 122 [2019-11-23 22:14:15,393 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 17 SyntacticMatches, 4 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 625 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=331, Invalid=1925, Unknown=0, NotChecked=0, Total=2256 [2019-11-23 22:14:15,393 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2019-11-23 22:14:15,402 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 92. [2019-11-23 22:14:15,403 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 92 states. [2019-11-23 22:14:15,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 109 transitions. [2019-11-23 22:14:15,403 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 109 transitions. Word has length 28 [2019-11-23 22:14:15,403 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:14:15,403 INFO L462 AbstractCegarLoop]: Abstraction has 92 states and 109 transitions. [2019-11-23 22:14:15,404 INFO L463 AbstractCegarLoop]: Interpolant automaton has 27 states. [2019-11-23 22:14:15,404 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 109 transitions. [2019-11-23 22:14:15,404 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-11-23 22:14:15,404 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:14:15,404 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 22:14:15,605 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 22:14:15,606 INFO L410 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:14:15,606 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:14:15,606 INFO L82 PathProgramCache]: Analyzing trace with hash 758115678, now seen corresponding path program 4 times [2019-11-23 22:14:15,607 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:14:15,607 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1175735840] [2019-11-23 22:14:15,607 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:14:15,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:14:15,895 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 23 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 22:14:15,895 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1175735840] [2019-11-23 22:14:15,895 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [31109622] [2019-11-23 22:14:15,895 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 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 22:14:15,935 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-11-23 22:14:15,935 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-23 22:14:15,936 INFO L255 TraceCheckSpWp]: Trace formula consists of 90 conjuncts, 35 conjunts are in the unsatisfiable core [2019-11-23 22:14:15,939 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-23 22:14:15,988 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2019-11-23 22:14:15,988 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 22:14:15,994 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 22:14:15,994 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-23 22:14:15,994 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:22, output treesize:7 [2019-11-23 22:14:16,044 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 22:14:16,129 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 22:14:16,130 INFO L377 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 28 treesize of output 27 [2019-11-23 22:14:16,130 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 22:14:16,137 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 22:14:16,138 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-23 22:14:16,138 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:34, output treesize:27 [2019-11-23 22:14:16,229 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 22:14:16,230 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 22:14:16,231 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 22:14:16,232 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 22:14:16,233 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 32 treesize of output 34 [2019-11-23 22:14:16,233 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 22:14:16,246 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 22:14:16,246 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-23 22:14:16,247 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:38, output treesize:19 [2019-11-23 22:14:16,356 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 22:14:16,383 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 23 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 22:14:16,383 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-23 22:14:16,383 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 16] total 29 [2019-11-23 22:14:16,383 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1911122622] [2019-11-23 22:14:16,384 INFO L442 AbstractCegarLoop]: Interpolant automaton has 29 states [2019-11-23 22:14:16,384 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:14:16,384 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2019-11-23 22:14:16,385 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=101, Invalid=711, Unknown=0, NotChecked=0, Total=812 [2019-11-23 22:14:16,385 INFO L87 Difference]: Start difference. First operand 92 states and 109 transitions. Second operand 29 states. [2019-11-23 22:14:17,233 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:14:17,233 INFO L93 Difference]: Finished difference Result 116 states and 134 transitions. [2019-11-23 22:14:17,233 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-11-23 22:14:17,233 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 29 [2019-11-23 22:14:17,233 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:14:17,234 INFO L225 Difference]: With dead ends: 116 [2019-11-23 22:14:17,234 INFO L226 Difference]: Without dead ends: 114 [2019-11-23 22:14:17,235 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 16 SyntacticMatches, 1 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 464 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=259, Invalid=1547, Unknown=0, NotChecked=0, Total=1806 [2019-11-23 22:14:17,236 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2019-11-23 22:14:17,253 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 97. [2019-11-23 22:14:17,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97 states. [2019-11-23 22:14:17,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 114 transitions. [2019-11-23 22:14:17,254 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 114 transitions. Word has length 29 [2019-11-23 22:14:17,254 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:14:17,254 INFO L462 AbstractCegarLoop]: Abstraction has 97 states and 114 transitions. [2019-11-23 22:14:17,254 INFO L463 AbstractCegarLoop]: Interpolant automaton has 29 states. [2019-11-23 22:14:17,255 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 114 transitions. [2019-11-23 22:14:17,255 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-11-23 22:14:17,255 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:14:17,255 INFO L410 BasicCegarLoop]: trace histogram [4, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 22:14:17,458 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 22:14:17,458 INFO L410 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:14:17,459 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:14:17,459 INFO L82 PathProgramCache]: Analyzing trace with hash 555892333, now seen corresponding path program 1 times [2019-11-23 22:14:17,459 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:14:17,460 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [871705099] [2019-11-23 22:14:17,460 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:14:17,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:14:18,362 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 2 proven. 23 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 22:14:18,362 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [871705099] [2019-11-23 22:14:18,363 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1538329237] [2019-11-23 22:14:18,363 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 22:14:18,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:14:18,397 INFO L255 TraceCheckSpWp]: Trace formula consists of 91 conjuncts, 40 conjunts are in the unsatisfiable core [2019-11-23 22:14:18,398 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-23 22:14:18,461 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 22:14:18,484 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 22:14:18,485 INFO L377 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 28 treesize of output 27 [2019-11-23 22:14:18,485 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 22:14:18,496 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 22:14:18,496 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-23 22:14:18,496 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:37, output treesize:30 [2019-11-23 22:14:18,566 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 22:14:18,573 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 22:14:18,574 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 22:14:18,577 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 22:14:18,578 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 40 treesize of output 34 [2019-11-23 22:14:18,578 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 22:14:18,589 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 22:14:18,590 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-23 22:14:18,590 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:54, output treesize:51 [2019-11-23 22:14:18,747 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 22:14:18,748 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 22:14:18,748 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-23 22:14:18,749 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 22:14:18,750 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 22:14:18,751 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 22:14:18,752 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-23 22:14:18,754 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 22:14:18,754 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 61 treesize of output 63 [2019-11-23 22:14:18,755 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 22:14:18,784 INFO L567 ElimStorePlain]: treesize reduction 42, result has 54.3 percent of original size [2019-11-23 22:14:18,785 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-23 22:14:18,785 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:78, output treesize:45 [2019-11-23 22:14:18,942 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 22:14:18,945 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 22:14:18,946 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 22:14:18,947 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 22:14:18,949 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 22:14:18,961 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 22:14:18,961 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 52 treesize of output 75 [2019-11-23 22:14:18,962 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 22:14:18,999 INFO L567 ElimStorePlain]: treesize reduction 17, result has 80.2 percent of original size [2019-11-23 22:14:19,000 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 22:14:19,002 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-11-23 22:14:19,002 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:64, output treesize:89 [2019-11-23 22:14:19,113 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 22:14:19,142 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 22:14:19,142 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-23 22:14:19,142 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21] total 34 [2019-11-23 22:14:19,142 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [982391038] [2019-11-23 22:14:19,142 INFO L442 AbstractCegarLoop]: Interpolant automaton has 34 states [2019-11-23 22:14:19,143 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:14:19,143 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2019-11-23 22:14:19,143 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=131, Invalid=991, Unknown=0, NotChecked=0, Total=1122 [2019-11-23 22:14:19,143 INFO L87 Difference]: Start difference. First operand 97 states and 114 transitions. Second operand 34 states. [2019-11-23 22:14:21,130 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:14:21,130 INFO L93 Difference]: Finished difference Result 125 states and 144 transitions. [2019-11-23 22:14:21,131 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2019-11-23 22:14:21,131 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 29 [2019-11-23 22:14:21,131 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:14:21,132 INFO L225 Difference]: With dead ends: 125 [2019-11-23 22:14:21,132 INFO L226 Difference]: Without dead ends: 116 [2019-11-23 22:14:21,133 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 12 SyntacticMatches, 5 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1008 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=383, Invalid=2697, Unknown=0, NotChecked=0, Total=3080 [2019-11-23 22:14:21,134 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2019-11-23 22:14:21,144 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 106. [2019-11-23 22:14:21,144 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 106 states. [2019-11-23 22:14:21,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 124 transitions. [2019-11-23 22:14:21,145 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 124 transitions. Word has length 29 [2019-11-23 22:14:21,145 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:14:21,145 INFO L462 AbstractCegarLoop]: Abstraction has 106 states and 124 transitions. [2019-11-23 22:14:21,145 INFO L463 AbstractCegarLoop]: Interpolant automaton has 34 states. [2019-11-23 22:14:21,145 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 124 transitions. [2019-11-23 22:14:21,145 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-11-23 22:14:21,145 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:14:21,146 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 22:14:21,346 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 22:14:21,346 INFO L410 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:14:21,347 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:14:21,347 INFO L82 PathProgramCache]: Analyzing trace with hash -1433009176, now seen corresponding path program 4 times [2019-11-23 22:14:21,347 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:14:21,348 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [856183853] [2019-11-23 22:14:21,348 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:14:21,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:14:21,711 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 22:14:21,711 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [856183853] [2019-11-23 22:14:21,712 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [868370764] [2019-11-23 22:14:21,712 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 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 22:14:21,746 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-11-23 22:14:21,746 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-23 22:14:21,747 INFO L255 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 30 conjunts are in the unsatisfiable core [2019-11-23 22:14:21,749 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-23 22:14:21,786 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 22:14:21,804 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 22:14:21,805 INFO L377 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 28 treesize of output 27 [2019-11-23 22:14:21,805 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 22:14:21,816 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 22:14:21,816 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-23 22:14:21,817 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:41, output treesize:34 [2019-11-23 22:14:21,857 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 22:14:21,880 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 22:14:21,880 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-23 22:14:21,881 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 13] total 16 [2019-11-23 22:14:21,881 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [741093332] [2019-11-23 22:14:21,882 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-11-23 22:14:21,883 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:14:21,883 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-11-23 22:14:21,883 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=200, Unknown=0, NotChecked=0, Total=240 [2019-11-23 22:14:21,884 INFO L87 Difference]: Start difference. First operand 106 states and 124 transitions. Second operand 16 states. [2019-11-23 22:14:23,718 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:14:23,718 INFO L93 Difference]: Finished difference Result 261 states and 301 transitions. [2019-11-23 22:14:23,718 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2019-11-23 22:14:23,718 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 31 [2019-11-23 22:14:23,719 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:14:23,720 INFO L225 Difference]: With dead ends: 261 [2019-11-23 22:14:23,720 INFO L226 Difference]: Without dead ends: 259 [2019-11-23 22:14:23,722 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 23 SyntacticMatches, 7 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1352 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=463, Invalid=3827, Unknown=0, NotChecked=0, Total=4290 [2019-11-23 22:14:23,723 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 259 states. [2019-11-23 22:14:23,736 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 259 to 123. [2019-11-23 22:14:23,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 123 states. [2019-11-23 22:14:23,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 147 transitions. [2019-11-23 22:14:23,737 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 147 transitions. Word has length 31 [2019-11-23 22:14:23,738 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:14:23,738 INFO L462 AbstractCegarLoop]: Abstraction has 123 states and 147 transitions. [2019-11-23 22:14:23,738 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-11-23 22:14:23,738 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 147 transitions. [2019-11-23 22:14:23,738 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-11-23 22:14:23,738 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:14:23,739 INFO L410 BasicCegarLoop]: trace histogram [5, 4, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 22:14:23,942 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 22:14:23,942 INFO L410 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:14:23,943 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:14:23,943 INFO L82 PathProgramCache]: Analyzing trace with hash -1097467222, now seen corresponding path program 5 times [2019-11-23 22:14:23,943 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:14:23,943 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1462568918] [2019-11-23 22:14:23,944 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:14:23,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:14:24,451 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 5 proven. 37 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 22:14:24,451 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1462568918] [2019-11-23 22:14:24,451 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [669994883] [2019-11-23 22:14:24,451 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 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 22:14:24,515 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2019-11-23 22:14:24,515 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-23 22:14:24,517 INFO L255 TraceCheckSpWp]: Trace formula consists of 92 conjuncts, 38 conjunts are in the unsatisfiable core [2019-11-23 22:14:24,518 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-23 22:14:24,554 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 22:14:24,739 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 22:14:24,794 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 22:14:24,794 INFO L377 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 40 treesize of output 30 [2019-11-23 22:14:24,795 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 22:14:24,804 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 22:14:24,804 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-23 22:14:24,805 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:51, output treesize:47 [2019-11-23 22:14:24,985 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 22:14:24,987 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 22:14:24,987 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 52 treesize of output 33 [2019-11-23 22:14:24,987 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 22:14:24,996 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 22:14:24,997 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-23 22:14:24,997 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:61, output treesize:33 [2019-11-23 22:14:25,108 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 22:14:25,110 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 22:14:25,111 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 22:14:25,112 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 22:14:25,113 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 40 treesize of output 42 [2019-11-23 22:14:25,113 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 22:14:25,124 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 22:14:25,124 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-23 22:14:25,125 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:49, output treesize:33 [2019-11-23 22:14:25,166 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 22:14:25,200 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 15 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 22:14:25,201 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-23 22:14:25,201 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 21] total 32 [2019-11-23 22:14:25,201 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [357173873] [2019-11-23 22:14:25,201 INFO L442 AbstractCegarLoop]: Interpolant automaton has 32 states [2019-11-23 22:14:25,202 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:14:25,202 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2019-11-23 22:14:25,202 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=182, Invalid=810, Unknown=0, NotChecked=0, Total=992 [2019-11-23 22:14:25,203 INFO L87 Difference]: Start difference. First operand 123 states and 147 transitions. Second operand 32 states. [2019-11-23 22:14:29,158 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:14:29,159 INFO L93 Difference]: Finished difference Result 322 states and 386 transitions. [2019-11-23 22:14:29,159 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 76 states. [2019-11-23 22:14:29,159 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 31 [2019-11-23 22:14:29,159 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:14:29,161 INFO L225 Difference]: With dead ends: 322 [2019-11-23 22:14:29,161 INFO L226 Difference]: Without dead ends: 294 [2019-11-23 22:14:29,164 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 12 SyntacticMatches, 5 SemanticMatches, 94 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2819 ImplicationChecksByTransitivity, 3.6s TimeCoverageRelationStatistics Valid=1361, Invalid=7759, Unknown=0, NotChecked=0, Total=9120 [2019-11-23 22:14:29,165 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 294 states. [2019-11-23 22:14:29,183 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 294 to 162. [2019-11-23 22:14:29,183 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 162 states. [2019-11-23 22:14:29,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 162 states and 199 transitions. [2019-11-23 22:14:29,184 INFO L78 Accepts]: Start accepts. Automaton has 162 states and 199 transitions. Word has length 31 [2019-11-23 22:14:29,184 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:14:29,184 INFO L462 AbstractCegarLoop]: Abstraction has 162 states and 199 transitions. [2019-11-23 22:14:29,184 INFO L463 AbstractCegarLoop]: Interpolant automaton has 32 states. [2019-11-23 22:14:29,184 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 199 transitions. [2019-11-23 22:14:29,184 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-11-23 22:14:29,184 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:14:29,185 INFO L410 BasicCegarLoop]: trace histogram [5, 4, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 22:14:29,388 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 22:14:29,388 INFO L410 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:14:29,388 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:14:29,389 INFO L82 PathProgramCache]: Analyzing trace with hash -1250641126, now seen corresponding path program 6 times [2019-11-23 22:14:29,389 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:14:29,389 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1475556104] [2019-11-23 22:14:29,390 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:14:29,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:14:30,026 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 3 proven. 39 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 22:14:30,027 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1475556104] [2019-11-23 22:14:30,027 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [443463490] [2019-11-23 22:14:30,027 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 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 22:14:30,071 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 6 check-sat command(s) [2019-11-23 22:14:30,072 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-23 22:14:30,073 INFO L255 TraceCheckSpWp]: Trace formula consists of 92 conjuncts, 40 conjunts are in the unsatisfiable core [2019-11-23 22:14:30,074 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-23 22:14:30,082 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 22:14:30,140 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 22:14:30,141 INFO L377 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 40 treesize of output 30 [2019-11-23 22:14:30,141 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 22:14:30,155 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 22:14:30,156 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-23 22:14:30,156 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:58, output treesize:54 [2019-11-23 22:14:30,269 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 22:14:30,270 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 22:14:30,270 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 32 [2019-11-23 22:14:30,270 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 22:14:30,280 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 22:14:30,281 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-23 22:14:30,282 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:59, output treesize:32 [2019-11-23 22:14:30,395 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 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 41 treesize of output 34 [2019-11-23 22:14:30,397 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 22:14:30,398 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 22:14:30,399 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 22:14:30,402 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 22:14:30,403 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 22:14:30,404 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 22:14:30,405 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 22:14:30,406 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 36 [2019-11-23 22:14:30,407 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-23 22:14:30,411 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 22:14:30,412 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-23 22:14:30,418 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 22:14:30,418 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-23 22:14:30,418 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:49, output treesize:27 [2019-11-23 22:14:30,438 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 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 57 treesize of output 44 [2019-11-23 22:14:30,446 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 22:14:30,447 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 22:14:30,448 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 22:14:30,448 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 22:14:30,449 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 22:14:30,449 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 22:14:30,451 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 22:14:30,452 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 22:14:30,454 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 22:14:30,456 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 22:14:30,457 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 22:14:30,458 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 22:14:30,459 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 22:14:30,460 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 22:14:30,461 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 40 [2019-11-23 22:14:30,462 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-23 22:14:30,468 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 22:14:30,468 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-23 22:14:30,477 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 22:14:30,477 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-23 22:14:30,477 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:63, output treesize:37 [2019-11-23 22:14:30,560 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 22:14:30,561 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 22:14:30,562 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 22:14:30,564 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 22:14:30,564 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 22:14:30,565 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 22:14:30,566 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 22:14:30,566 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 44 treesize of output 43 [2019-11-23 22:14:30,566 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 22:14:30,572 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 22:14:30,572 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-23 22:14:30,573 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:47, output treesize:19 [2019-11-23 22:14:30,589 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 22:14:30,619 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 22:14:30,620 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-23 22:14:30,620 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 17] total 24 [2019-11-23 22:14:30,620 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2091393855] [2019-11-23 22:14:30,620 INFO L442 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-11-23 22:14:30,620 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:14:30,621 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-11-23 22:14:30,621 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=462, Unknown=0, NotChecked=0, Total=552 [2019-11-23 22:14:30,621 INFO L87 Difference]: Start difference. First operand 162 states and 199 transitions. Second operand 24 states. [2019-11-23 22:14:31,876 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:14:31,877 INFO L93 Difference]: Finished difference Result 265 states and 323 transitions. [2019-11-23 22:14:31,877 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2019-11-23 22:14:31,877 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 31 [2019-11-23 22:14:31,877 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:14:31,878 INFO L225 Difference]: With dead ends: 265 [2019-11-23 22:14:31,878 INFO L226 Difference]: Without dead ends: 210 [2019-11-23 22:14:31,879 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 16 SyntacticMatches, 11 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 646 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=248, Invalid=1644, Unknown=0, NotChecked=0, Total=1892 [2019-11-23 22:14:31,880 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 210 states. [2019-11-23 22:14:31,901 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 210 to 164. [2019-11-23 22:14:31,901 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 164 states. [2019-11-23 22:14:31,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164 states to 164 states and 201 transitions. [2019-11-23 22:14:31,902 INFO L78 Accepts]: Start accepts. Automaton has 164 states and 201 transitions. Word has length 31 [2019-11-23 22:14:31,902 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:14:31,902 INFO L462 AbstractCegarLoop]: Abstraction has 164 states and 201 transitions. [2019-11-23 22:14:31,902 INFO L463 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-11-23 22:14:31,902 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 201 transitions. [2019-11-23 22:14:31,902 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-11-23 22:14:31,903 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:14:31,903 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 22:14:32,103 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 22:14:32,104 INFO L410 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:14:32,104 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:14:32,104 INFO L82 PathProgramCache]: Analyzing trace with hash -1608281349, now seen corresponding path program 2 times [2019-11-23 22:14:32,104 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:14:32,105 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1725435265] [2019-11-23 22:14:32,105 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:14:32,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:14:32,306 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 32 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 22:14:32,306 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1725435265] [2019-11-23 22:14:32,306 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1509540002] [2019-11-23 22:14:32,306 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 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 22:14:32,348 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-11-23 22:14:32,348 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-23 22:14:32,349 INFO L255 TraceCheckSpWp]: Trace formula consists of 99 conjuncts, 33 conjunts are in the unsatisfiable core [2019-11-23 22:14:32,351 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-23 22:14:32,445 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 22:14:32,518 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 22:14:32,519 INFO L377 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 23 treesize of output 22 [2019-11-23 22:14:32,519 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 22:14:32,524 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 22:14:32,525 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-23 22:14:32,525 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:26, output treesize:19 [2019-11-23 22:14:32,621 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 22:14:32,649 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 32 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 22:14:32,649 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-23 22:14:32,649 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 26 [2019-11-23 22:14:32,650 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1789113449] [2019-11-23 22:14:32,650 INFO L442 AbstractCegarLoop]: Interpolant automaton has 26 states [2019-11-23 22:14:32,650 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:14:32,650 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2019-11-23 22:14:32,650 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=570, Unknown=0, NotChecked=0, Total=650 [2019-11-23 22:14:32,650 INFO L87 Difference]: Start difference. First operand 164 states and 201 transitions. Second operand 26 states. [2019-11-23 22:14:33,813 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:14:33,813 INFO L93 Difference]: Finished difference Result 258 states and 305 transitions. [2019-11-23 22:14:33,814 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2019-11-23 22:14:33,815 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 32 [2019-11-23 22:14:33,815 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:14:33,817 INFO L225 Difference]: With dead ends: 258 [2019-11-23 22:14:33,817 INFO L226 Difference]: Without dead ends: 256 [2019-11-23 22:14:33,819 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 22 SyntacticMatches, 1 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 852 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=415, Invalid=2665, Unknown=0, NotChecked=0, Total=3080 [2019-11-23 22:14:33,819 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 256 states. [2019-11-23 22:14:33,841 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 256 to 173. [2019-11-23 22:14:33,842 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 173 states. [2019-11-23 22:14:33,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 173 states to 173 states and 213 transitions. [2019-11-23 22:14:33,842 INFO L78 Accepts]: Start accepts. Automaton has 173 states and 213 transitions. Word has length 32 [2019-11-23 22:14:33,843 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:14:33,843 INFO L462 AbstractCegarLoop]: Abstraction has 173 states and 213 transitions. [2019-11-23 22:14:33,843 INFO L463 AbstractCegarLoop]: Interpolant automaton has 26 states. [2019-11-23 22:14:33,843 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 213 transitions. [2019-11-23 22:14:33,843 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-11-23 22:14:33,844 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:14:33,844 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 22:14:34,047 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 22:14:34,048 INFO L410 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:14:34,048 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:14:34,048 INFO L82 PathProgramCache]: Analyzing trace with hash 431649729, now seen corresponding path program 3 times [2019-11-23 22:14:34,049 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:14:34,049 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1729546710] [2019-11-23 22:14:34,049 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:14:34,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:14:34,314 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 32 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 22:14:34,314 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1729546710] [2019-11-23 22:14:34,314 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [470033340] [2019-11-23 22:14:34,314 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 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 22:14:34,373 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2019-11-23 22:14:34,373 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-23 22:14:34,375 INFO L255 TraceCheckSpWp]: Trace formula consists of 99 conjuncts, 38 conjunts are in the unsatisfiable core [2019-11-23 22:14:34,376 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-23 22:14:34,445 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 22:14:34,505 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 22:14:34,506 INFO L377 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 39 treesize of output 29 [2019-11-23 22:14:34,506 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 22:14:34,518 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 22:14:34,518 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-23 22:14:34,518 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:50, output treesize:45 [2019-11-23 22:14:34,644 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 22:14:34,645 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-23 22:14:34,646 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 22:14:34,647 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 44 [2019-11-23 22:14:34,647 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 22:14:34,675 INFO L567 ElimStorePlain]: treesize reduction 12, result has 76.9 percent of original size [2019-11-23 22:14:34,676 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-23 22:14:34,676 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:64, output treesize:32 [2019-11-23 22:14:34,775 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 22:14:34,780 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 22:14:34,781 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 22:14:34,782 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 22:14:34,783 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 33 [2019-11-23 22:14:34,783 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 22:14:34,789 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 22:14:34,789 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-23 22:14:34,789 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:34, output treesize:21 [2019-11-23 22:14:34,913 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 22:14:34,945 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 32 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 22:14:34,945 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-23 22:14:34,946 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 17] total 29 [2019-11-23 22:14:34,946 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1376409675] [2019-11-23 22:14:34,955 INFO L442 AbstractCegarLoop]: Interpolant automaton has 29 states [2019-11-23 22:14:34,955 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:14:34,956 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2019-11-23 22:14:34,956 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=106, Invalid=706, Unknown=0, NotChecked=0, Total=812 [2019-11-23 22:14:34,956 INFO L87 Difference]: Start difference. First operand 173 states and 213 transitions. Second operand 29 states. [2019-11-23 22:14:35,557 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:14:35,557 INFO L93 Difference]: Finished difference Result 200 states and 242 transitions. [2019-11-23 22:14:35,557 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-11-23 22:14:35,557 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 32 [2019-11-23 22:14:35,557 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:14:35,559 INFO L225 Difference]: With dead ends: 200 [2019-11-23 22:14:35,559 INFO L226 Difference]: Without dead ends: 198 [2019-11-23 22:14:35,560 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 353 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=192, Invalid=1214, Unknown=0, NotChecked=0, Total=1406 [2019-11-23 22:14:35,561 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 198 states. [2019-11-23 22:14:35,582 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 198 to 173. [2019-11-23 22:14:35,582 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 173 states. [2019-11-23 22:14:35,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 173 states to 173 states and 213 transitions. [2019-11-23 22:14:35,583 INFO L78 Accepts]: Start accepts. Automaton has 173 states and 213 transitions. Word has length 32 [2019-11-23 22:14:35,583 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:14:35,583 INFO L462 AbstractCegarLoop]: Abstraction has 173 states and 213 transitions. [2019-11-23 22:14:35,583 INFO L463 AbstractCegarLoop]: Interpolant automaton has 29 states. [2019-11-23 22:14:35,583 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 213 transitions. [2019-11-23 22:14:35,584 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-11-23 22:14:35,584 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:14:35,584 INFO L410 BasicCegarLoop]: trace histogram [5, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 22:14:35,787 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 22:14:35,788 INFO L410 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:14:35,788 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:14:35,788 INFO L82 PathProgramCache]: Analyzing trace with hash -452062440, now seen corresponding path program 2 times [2019-11-23 22:14:35,789 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:14:35,789 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1054742736] [2019-11-23 22:14:35,789 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:14:35,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:14:36,715 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 0 proven. 37 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 22:14:36,716 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1054742736] [2019-11-23 22:14:36,716 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2101715644] [2019-11-23 22:14:36,716 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 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 22:14:36,755 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-11-23 22:14:36,755 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-23 22:14:36,757 INFO L255 TraceCheckSpWp]: Trace formula consists of 97 conjuncts, 46 conjunts are in the unsatisfiable core [2019-11-23 22:14:36,758 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-23 22:14:36,830 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 22:14:36,902 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 22:14:36,903 INFO L377 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 38 treesize of output 29 [2019-11-23 22:14:36,903 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 22:14:36,918 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 22:14:36,919 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-23 22:14:36,919 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:57, output treesize:54 [2019-11-23 22:14:37,110 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 22:14:37,111 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-23 22:14:37,113 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 22:14:37,113 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 51 treesize of output 44 [2019-11-23 22:14:37,114 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 22:14:37,150 INFO L567 ElimStorePlain]: treesize reduction 12, result has 80.0 percent of original size [2019-11-23 22:14:37,151 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-23 22:14:37,152 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:73, output treesize:40 [2019-11-23 22:14:37,213 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 22:14:37,215 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 22:14:37,216 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 22:14:37,216 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 22:14:37,217 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 36 [2019-11-23 22:14:37,217 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 22:14:37,231 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 22:14:37,232 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-23 22:14:37,232 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:56, output treesize:52 [2019-11-23 22:14:37,402 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 22:14:37,404 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 22:14:37,405 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-23 22:14:37,406 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 22:14:37,409 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 22:14:37,410 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 22:14:37,411 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-23 22:14:37,413 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 22:14:37,413 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 63 treesize of output 66 [2019-11-23 22:14:37,414 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 22:14:37,444 INFO L567 ElimStorePlain]: treesize reduction 43, result has 53.8 percent of original size [2019-11-23 22:14:37,445 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-23 22:14:37,446 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:82, output treesize:50 [2019-11-23 22:14:37,584 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 22:14:37,586 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 22:14:37,586 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-23 22:14:37,588 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 22:14:37,589 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 22:14:37,589 INFO L377 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 3 case distinctions, treesize of input 50 treesize of output 51 [2019-11-23 22:14:37,590 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 22:14:37,615 INFO L567 ElimStorePlain]: treesize reduction 12, result has 79.3 percent of original size [2019-11-23 22:14:37,616 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-23 22:14:37,617 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:66, output treesize:32 [2019-11-23 22:14:37,732 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 22:14:37,773 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 0 proven. 37 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 22:14:37,773 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-23 22:14:37,773 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 22] total 37 [2019-11-23 22:14:37,773 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [600622241] [2019-11-23 22:14:37,774 INFO L442 AbstractCegarLoop]: Interpolant automaton has 37 states [2019-11-23 22:14:37,774 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:14:37,774 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2019-11-23 22:14:37,775 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=128, Invalid=1204, Unknown=0, NotChecked=0, Total=1332 [2019-11-23 22:14:37,775 INFO L87 Difference]: Start difference. First operand 173 states and 213 transitions. Second operand 37 states. [2019-11-23 22:14:39,162 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:14:39,162 INFO L93 Difference]: Finished difference Result 184 states and 224 transitions. [2019-11-23 22:14:39,166 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-11-23 22:14:39,166 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 32 [2019-11-23 22:14:39,166 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:14:39,167 INFO L225 Difference]: With dead ends: 184 [2019-11-23 22:14:39,167 INFO L226 Difference]: Without dead ends: 175 [2019-11-23 22:14:39,168 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 15 SyntacticMatches, 5 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 716 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=242, Invalid=2110, Unknown=0, NotChecked=0, Total=2352 [2019-11-23 22:14:39,169 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 175 states. [2019-11-23 22:14:39,185 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 175 to 157. [2019-11-23 22:14:39,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 157 states. [2019-11-23 22:14:39,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 195 transitions. [2019-11-23 22:14:39,186 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 195 transitions. Word has length 32 [2019-11-23 22:14:39,186 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:14:39,186 INFO L462 AbstractCegarLoop]: Abstraction has 157 states and 195 transitions. [2019-11-23 22:14:39,186 INFO L463 AbstractCegarLoop]: Interpolant automaton has 37 states. [2019-11-23 22:14:39,186 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 195 transitions. [2019-11-23 22:14:39,187 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-11-23 22:14:39,187 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:14:39,187 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2019-11-23 22:14:39,390 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 22:14:39,391 INFO L410 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:14:39,391 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:14:39,391 INFO L82 PathProgramCache]: Analyzing trace with hash 395668148, now seen corresponding path program 5 times [2019-11-23 22:14:39,391 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:14:39,392 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1230756578] [2019-11-23 22:14:39,392 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:14:39,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:14:39,659 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 0 proven. 29 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 22:14:39,660 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1230756578] [2019-11-23 22:14:39,660 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1564922071] [2019-11-23 22:14:39,660 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 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 22:14:39,738 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2019-11-23 22:14:39,738 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-23 22:14:39,740 INFO L255 TraceCheckSpWp]: Trace formula consists of 103 conjuncts, 38 conjunts are in the unsatisfiable core [2019-11-23 22:14:39,740 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-23 22:14:39,771 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 22:14:39,875 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2019-11-23 22:14:39,875 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 22:14:39,883 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 22:14:39,883 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-23 22:14:39,883 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:25, output treesize:10 [2019-11-23 22:14:39,925 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 22:14:40,007 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 22:14:40,008 INFO L377 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 28 treesize of output 27 [2019-11-23 22:14:40,009 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 22:14:40,017 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 22:14:40,018 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-23 22:14:40,019 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:37, output treesize:30 [2019-11-23 22:14:40,190 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 22:14:40,231 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 22:14:40,267 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 0 proven. 29 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 22:14:40,267 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-23 22:14:40,267 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 18] total 31 [2019-11-23 22:14:40,267 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1164232390] [2019-11-23 22:14:40,268 INFO L442 AbstractCegarLoop]: Interpolant automaton has 31 states [2019-11-23 22:14:40,268 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:14:40,268 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2019-11-23 22:14:40,268 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=95, Invalid=835, Unknown=0, NotChecked=0, Total=930 [2019-11-23 22:14:40,268 INFO L87 Difference]: Start difference. First operand 157 states and 195 transitions. Second operand 31 states. [2019-11-23 22:14:41,389 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:14:41,389 INFO L93 Difference]: Finished difference Result 222 states and 266 transitions. [2019-11-23 22:14:41,390 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-11-23 22:14:41,390 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 33 [2019-11-23 22:14:41,390 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:14:41,391 INFO L225 Difference]: With dead ends: 222 [2019-11-23 22:14:41,391 INFO L226 Difference]: Without dead ends: 220 [2019-11-23 22:14:41,392 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 18 SyntacticMatches, 1 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 505 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=245, Invalid=1735, Unknown=0, NotChecked=0, Total=1980 [2019-11-23 22:14:41,392 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 220 states. [2019-11-23 22:14:41,420 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 220 to 178. [2019-11-23 22:14:41,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 178 states. [2019-11-23 22:14:41,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 178 states to 178 states and 220 transitions. [2019-11-23 22:14:41,421 INFO L78 Accepts]: Start accepts. Automaton has 178 states and 220 transitions. Word has length 33 [2019-11-23 22:14:41,421 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:14:41,421 INFO L462 AbstractCegarLoop]: Abstraction has 178 states and 220 transitions. [2019-11-23 22:14:41,421 INFO L463 AbstractCegarLoop]: Interpolant automaton has 31 states. [2019-11-23 22:14:41,421 INFO L276 IsEmpty]: Start isEmpty. Operand 178 states and 220 transitions. [2019-11-23 22:14:41,422 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-11-23 22:14:41,422 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:14:41,422 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 22:14:41,625 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 23 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 22:14:41,626 INFO L410 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:14:41,626 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:14:41,626 INFO L82 PathProgramCache]: Analyzing trace with hash -1852690446, now seen corresponding path program 5 times [2019-11-23 22:14:41,626 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:14:41,626 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [335857884] [2019-11-23 22:14:41,626 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:14:41,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:14:42,350 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 8 proven. 44 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 22:14:42,350 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [335857884] [2019-11-23 22:14:42,350 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [241854879] [2019-11-23 22:14:42,351 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 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 22:14:42,397 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2019-11-23 22:14:42,397 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-23 22:14:42,399 INFO L255 TraceCheckSpWp]: Trace formula consists of 100 conjuncts, 31 conjunts are in the unsatisfiable core [2019-11-23 22:14:42,400 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-23 22:14:42,475 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 22:14:42,534 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 22:14:42,535 INFO L377 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 32 treesize of output 31 [2019-11-23 22:14:42,536 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 22:14:42,556 INFO L567 ElimStorePlain]: treesize reduction 5, result has 89.1 percent of original size [2019-11-23 22:14:42,556 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-23 22:14:42,556 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:50, output treesize:38 [2019-11-23 22:14:42,604 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 22:14:42,605 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 22:14:42,605 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 22:14:42,606 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 22:14:42,606 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 32 [2019-11-23 22:14:42,607 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 22:14:42,616 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 22:14:42,616 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-23 22:14:42,617 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:41, output treesize:20 [2019-11-23 22:14:42,650 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 22:14:42,651 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 22:14:42,652 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 22:14:42,653 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 22:14:42,654 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 32 [2019-11-23 22:14:42,654 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 22:14:42,664 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 22:14:42,664 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-23 22:14:42,665 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:41, output treesize:20 [2019-11-23 22:14:42,680 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 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 70 treesize of output 57 [2019-11-23 22:14:42,682 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 22:14:42,684 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 22:14:42,685 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 22:14:42,686 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 22:14:42,687 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 22:14:42,688 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 22:14:42,690 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 22:14:42,692 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 22:14:42,694 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 22:14:42,695 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 22:14:42,696 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 22:14:42,698 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 22:14:42,699 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 22:14:42,700 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 22:14:42,701 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 43 [2019-11-23 22:14:42,702 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-23 22:14:42,708 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 22:14:42,708 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-23 22:14:42,720 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 22:14:42,721 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-23 22:14:42,721 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:86, output treesize:50 [2019-11-23 22:14:42,769 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 22:14:42,770 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 22:14:42,771 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 22:14:42,772 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 22:14:42,774 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 22:14:42,775 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 22:14:42,776 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 22:14:42,777 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 22:14:42,803 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 22:14:42,804 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 8 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 8 case distinctions, treesize of input 50 treesize of output 137 [2019-11-23 22:14:42,804 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 22:14:42,805 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 22:14:42,850 INFO L567 ElimStorePlain]: treesize reduction 52, result has 62.9 percent of original size [2019-11-23 22:14:42,851 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 22:14:42,852 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-23 22:14:42,852 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:66, output treesize:17 [2019-11-23 22:14:42,868 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 22:14:42,897 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 8 proven. 44 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 22:14:42,897 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-23 22:14:42,897 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18] total 26 [2019-11-23 22:14:42,898 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [929722362] [2019-11-23 22:14:42,898 INFO L442 AbstractCegarLoop]: Interpolant automaton has 26 states [2019-11-23 22:14:42,898 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:14:42,898 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2019-11-23 22:14:42,898 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=545, Unknown=0, NotChecked=0, Total=650 [2019-11-23 22:14:42,899 INFO L87 Difference]: Start difference. First operand 178 states and 220 transitions. Second operand 26 states. [2019-11-23 22:14:48,987 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:14:48,988 INFO L93 Difference]: Finished difference Result 296 states and 358 transitions. [2019-11-23 22:14:48,988 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-11-23 22:14:48,988 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 34 [2019-11-23 22:14:48,988 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:14:48,990 INFO L225 Difference]: With dead ends: 296 [2019-11-23 22:14:48,990 INFO L226 Difference]: Without dead ends: 294 [2019-11-23 22:14:48,991 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 24 SyntacticMatches, 5 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 575 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=361, Invalid=1619, Unknown=0, NotChecked=0, Total=1980 [2019-11-23 22:14:48,993 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 294 states. [2019-11-23 22:14:49,019 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 294 to 226. [2019-11-23 22:14:49,020 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 226 states. [2019-11-23 22:14:49,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 226 states to 226 states and 284 transitions. [2019-11-23 22:14:49,020 INFO L78 Accepts]: Start accepts. Automaton has 226 states and 284 transitions. Word has length 34 [2019-11-23 22:14:49,020 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:14:49,021 INFO L462 AbstractCegarLoop]: Abstraction has 226 states and 284 transitions. [2019-11-23 22:14:49,021 INFO L463 AbstractCegarLoop]: Interpolant automaton has 26 states. [2019-11-23 22:14:49,021 INFO L276 IsEmpty]: Start isEmpty. Operand 226 states and 284 transitions. [2019-11-23 22:14:49,021 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-11-23 22:14:49,021 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:14:49,021 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 22:14:49,223 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 24 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 22:14:49,223 INFO L410 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:14:49,223 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:14:49,224 INFO L82 PathProgramCache]: Analyzing trace with hash -1348916162, now seen corresponding path program 4 times [2019-11-23 22:14:49,224 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:14:49,224 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1280254134] [2019-11-23 22:14:49,224 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:14:49,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:14:49,385 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 22:14:49,385 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1280254134] [2019-11-23 22:14:49,385 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [974143547] [2019-11-23 22:14:49,385 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 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 22:14:49,434 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-11-23 22:14:49,434 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-23 22:14:49,436 INFO L255 TraceCheckSpWp]: Trace formula consists of 108 conjuncts, 38 conjunts are in the unsatisfiable core [2019-11-23 22:14:49,437 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-23 22:14:49,540 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 22:14:49,587 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 22:14:49,588 INFO L377 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 40 treesize of output 30 [2019-11-23 22:14:49,588 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 22:14:49,598 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 22:14:49,599 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-23 22:14:49,599 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:46, output treesize:42 [2019-11-23 22:14:49,637 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 22:14:49,638 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 22:14:49,639 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 40 treesize of output 27 [2019-11-23 22:14:49,639 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 22:14:49,648 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 22:14:49,648 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-23 22:14:49,648 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:43, output treesize:21 [2019-11-23 22:14:49,787 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 22:14:49,815 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 22:14:49,816 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-23 22:14:49,816 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 14] total 25 [2019-11-23 22:14:49,816 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [947700053] [2019-11-23 22:14:49,817 INFO L442 AbstractCegarLoop]: Interpolant automaton has 25 states [2019-11-23 22:14:49,817 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:14:49,818 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2019-11-23 22:14:49,819 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=530, Unknown=0, NotChecked=0, Total=600 [2019-11-23 22:14:49,819 INFO L87 Difference]: Start difference. First operand 226 states and 284 transitions. Second operand 25 states. [2019-11-23 22:14:51,017 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:14:51,017 INFO L93 Difference]: Finished difference Result 316 states and 380 transitions. [2019-11-23 22:14:51,017 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2019-11-23 22:14:51,018 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 35 [2019-11-23 22:14:51,018 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:14:51,019 INFO L225 Difference]: With dead ends: 316 [2019-11-23 22:14:51,019 INFO L226 Difference]: Without dead ends: 314 [2019-11-23 22:14:51,020 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 715 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=319, Invalid=2437, Unknown=0, NotChecked=0, Total=2756 [2019-11-23 22:14:51,020 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 314 states. [2019-11-23 22:14:51,061 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 314 to 231. [2019-11-23 22:14:51,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 231 states. [2019-11-23 22:14:51,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 231 states to 231 states and 291 transitions. [2019-11-23 22:14:51,062 INFO L78 Accepts]: Start accepts. Automaton has 231 states and 291 transitions. Word has length 35 [2019-11-23 22:14:51,063 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:14:51,063 INFO L462 AbstractCegarLoop]: Abstraction has 231 states and 291 transitions. [2019-11-23 22:14:51,063 INFO L463 AbstractCegarLoop]: Interpolant automaton has 25 states. [2019-11-23 22:14:51,063 INFO L276 IsEmpty]: Start isEmpty. Operand 231 states and 291 transitions. [2019-11-23 22:14:51,063 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-11-23 22:14:51,064 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:14:51,064 INFO L410 BasicCegarLoop]: trace histogram [5, 4, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 22:14:51,273 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 25 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 22:14:51,273 INFO L410 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:14:51,274 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:14:51,274 INFO L82 PathProgramCache]: Analyzing trace with hash 1096544768, now seen corresponding path program 3 times [2019-11-23 22:14:51,275 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:14:51,275 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [448630216] [2019-11-23 22:14:51,275 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:14:51,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:14:52,235 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 3 proven. 41 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 22:14:52,235 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [448630216] [2019-11-23 22:14:52,236 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [583939086] [2019-11-23 22:14:52,236 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 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 22:14:52,282 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2019-11-23 22:14:52,282 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-23 22:14:52,284 INFO L255 TraceCheckSpWp]: Trace formula consists of 105 conjuncts, 43 conjunts are in the unsatisfiable core [2019-11-23 22:14:52,285 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-23 22:14:52,315 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 22:14:52,400 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 22:14:52,400 INFO L377 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 32 treesize of output 31 [2019-11-23 22:14:52,401 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 22:14:52,423 INFO L567 ElimStorePlain]: treesize reduction 5, result has 89.1 percent of original size [2019-11-23 22:14:52,423 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-23 22:14:52,423 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:50, output treesize:38 [2019-11-23 22:14:52,526 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 22:14:52,527 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 22:14:52,529 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 22:14:52,530 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 22:14:52,530 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 41 treesize of output 34 [2019-11-23 22:14:52,531 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 22:14:52,540 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 22:14:52,540 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-23 22:14:52,541 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:55, output treesize:50 [2019-11-23 22:14:52,688 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 22:14:52,691 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 22:14:52,694 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 22:14:52,696 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 22:14:52,700 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 22:14:52,745 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 22:14:52,746 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 8 case distinctions, treesize of input 61 treesize of output 188 [2019-11-23 22:14:52,747 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 22:14:52,748 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 22:14:52,748 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 22:14:52,748 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 22:14:52,750 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 22:14:52,866 WARN L192 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 40 [2019-11-23 22:14:52,867 INFO L567 ElimStorePlain]: treesize reduction 323, result has 25.1 percent of original size [2019-11-23 22:14:52,867 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-23 22:14:52,868 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:80, output treesize:108 [2019-11-23 22:14:53,135 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 22:14:53,137 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-23 22:14:53,138 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 22:14:53,139 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 22:14:53,141 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 22:14:53,142 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 53 treesize of output 52 [2019-11-23 22:14:53,142 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 22:14:53,172 INFO L567 ElimStorePlain]: treesize reduction 12, result has 80.6 percent of original size [2019-11-23 22:14:53,172 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-23 22:14:53,173 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:75, output treesize:43 [2019-11-23 22:14:53,305 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 22:14:53,306 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 22:14:53,308 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 22:14:53,309 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 22:14:53,310 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 36 [2019-11-23 22:14:53,310 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 22:14:53,322 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 22:14:53,322 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-23 22:14:53,323 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:46, output treesize:27 [2019-11-23 22:14:53,439 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 22:14:53,479 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 22:14:53,479 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-23 22:14:53,479 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23] total 38 [2019-11-23 22:14:53,479 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1694318868] [2019-11-23 22:14:53,480 INFO L442 AbstractCegarLoop]: Interpolant automaton has 38 states [2019-11-23 22:14:53,480 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:14:53,480 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2019-11-23 22:14:53,480 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=162, Invalid=1244, Unknown=0, NotChecked=0, Total=1406 [2019-11-23 22:14:53,481 INFO L87 Difference]: Start difference. First operand 231 states and 291 transitions. Second operand 38 states. [2019-11-23 22:14:56,366 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:14:56,367 INFO L93 Difference]: Finished difference Result 341 states and 416 transitions. [2019-11-23 22:14:56,367 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2019-11-23 22:14:56,367 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 35 [2019-11-23 22:14:56,367 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:14:56,369 INFO L225 Difference]: With dead ends: 341 [2019-11-23 22:14:56,369 INFO L226 Difference]: Without dead ends: 339 [2019-11-23 22:14:56,370 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 17 SyntacticMatches, 5 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1824 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=584, Invalid=4966, Unknown=0, NotChecked=0, Total=5550 [2019-11-23 22:14:56,370 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 339 states. [2019-11-23 22:14:56,417 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 339 to 252. [2019-11-23 22:14:56,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 252 states. [2019-11-23 22:14:56,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 252 states to 252 states and 317 transitions. [2019-11-23 22:14:56,418 INFO L78 Accepts]: Start accepts. Automaton has 252 states and 317 transitions. Word has length 35 [2019-11-23 22:14:56,418 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:14:56,418 INFO L462 AbstractCegarLoop]: Abstraction has 252 states and 317 transitions. [2019-11-23 22:14:56,418 INFO L463 AbstractCegarLoop]: Interpolant automaton has 38 states. [2019-11-23 22:14:56,418 INFO L276 IsEmpty]: Start isEmpty. Operand 252 states and 317 transitions. [2019-11-23 22:14:56,419 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-11-23 22:14:56,419 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:14:56,419 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 22:14:56,622 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 26 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 22:14:56,623 INFO L410 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:14:56,623 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:14:56,623 INFO L82 PathProgramCache]: Analyzing trace with hash -153945647, now seen corresponding path program 5 times [2019-11-23 22:14:56,624 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:14:56,624 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2015254589] [2019-11-23 22:14:56,624 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:14:56,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:14:56,895 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 38 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 22:14:56,895 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2015254589] [2019-11-23 22:14:56,896 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1212274870] [2019-11-23 22:14:56,896 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 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 22:14:56,954 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 5 check-sat command(s) [2019-11-23 22:14:56,954 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-23 22:14:56,956 INFO L255 TraceCheckSpWp]: Trace formula consists of 112 conjuncts, 38 conjunts are in the unsatisfiable core [2019-11-23 22:14:56,957 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-23 22:14:57,037 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 22:14:57,087 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 22:14:57,088 INFO L377 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 31 treesize of output 24 [2019-11-23 22:14:57,089 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 22:14:57,098 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 22:14:57,098 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-23 22:14:57,098 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:37, output treesize:33 [2019-11-23 22:14:57,128 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 22:14:57,129 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 22:14:57,130 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 40 treesize of output 27 [2019-11-23 22:14:57,130 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 22:14:57,137 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 22:14:57,138 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-23 22:14:57,138 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:43, output treesize:21 [2019-11-23 22:14:57,293 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 22:14:57,318 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 38 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 22:14:57,318 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-23 22:14:57,319 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 14] total 27 [2019-11-23 22:14:57,319 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1962991057] [2019-11-23 22:14:57,319 INFO L442 AbstractCegarLoop]: Interpolant automaton has 27 states [2019-11-23 22:14:57,319 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:14:57,319 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2019-11-23 22:14:57,320 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=624, Unknown=0, NotChecked=0, Total=702 [2019-11-23 22:14:57,320 INFO L87 Difference]: Start difference. First operand 252 states and 317 transitions. Second operand 27 states. [2019-11-23 22:14:58,049 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:14:58,049 INFO L93 Difference]: Finished difference Result 315 states and 385 transitions. [2019-11-23 22:14:58,049 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-11-23 22:14:58,049 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 36 [2019-11-23 22:14:58,049 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:14:58,050 INFO L225 Difference]: With dead ends: 315 [2019-11-23 22:14:58,051 INFO L226 Difference]: Without dead ends: 313 [2019-11-23 22:14:58,051 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 368 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=166, Invalid=1316, Unknown=0, NotChecked=0, Total=1482 [2019-11-23 22:14:58,052 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 313 states. [2019-11-23 22:14:58,091 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 313 to 252. [2019-11-23 22:14:58,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 252 states. [2019-11-23 22:14:58,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 252 states to 252 states and 317 transitions. [2019-11-23 22:14:58,092 INFO L78 Accepts]: Start accepts. Automaton has 252 states and 317 transitions. Word has length 36 [2019-11-23 22:14:58,092 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:14:58,093 INFO L462 AbstractCegarLoop]: Abstraction has 252 states and 317 transitions. [2019-11-23 22:14:58,093 INFO L463 AbstractCegarLoop]: Interpolant automaton has 27 states. [2019-11-23 22:14:58,093 INFO L276 IsEmpty]: Start isEmpty. Operand 252 states and 317 transitions. [2019-11-23 22:14:58,093 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-11-23 22:14:58,094 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:14:58,094 INFO L410 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1] [2019-11-23 22:14:58,297 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 27 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 22:14:58,297 INFO L410 AbstractCegarLoop]: === Iteration 30 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:14:58,298 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:14:58,298 INFO L82 PathProgramCache]: Analyzing trace with hash 766528778, now seen corresponding path program 6 times [2019-11-23 22:14:58,298 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:14:58,298 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [114829284] [2019-11-23 22:14:58,299 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:14:58,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:14:58,442 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 3 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 22:14:58,442 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [114829284] [2019-11-23 22:14:58,443 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [582623823] [2019-11-23 22:14:58,443 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 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 22:14:58,498 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2019-11-23 22:14:58,498 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-23 22:14:58,499 INFO L255 TraceCheckSpWp]: Trace formula consists of 116 conjuncts, 18 conjunts are in the unsatisfiable core [2019-11-23 22:14:58,500 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-23 22:14:58,592 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 3 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 22:14:58,593 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-23 22:14:58,593 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 15 [2019-11-23 22:14:58,593 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [3567638] [2019-11-23 22:14:58,594 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-11-23 22:14:58,594 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:14:58,594 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-11-23 22:14:58,594 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=170, Unknown=0, NotChecked=0, Total=210 [2019-11-23 22:14:58,594 INFO L87 Difference]: Start difference. First operand 252 states and 317 transitions. Second operand 15 states. [2019-11-23 22:14:58,861 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:14:58,862 INFO L93 Difference]: Finished difference Result 377 states and 463 transitions. [2019-11-23 22:14:58,862 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-11-23 22:14:58,862 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 37 [2019-11-23 22:14:58,862 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:14:58,864 INFO L225 Difference]: With dead ends: 377 [2019-11-23 22:14:58,864 INFO L226 Difference]: Without dead ends: 357 [2019-11-23 22:14:58,864 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 32 SyntacticMatches, 2 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=76, Invalid=304, Unknown=0, NotChecked=0, Total=380 [2019-11-23 22:14:58,865 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 357 states. [2019-11-23 22:14:58,912 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 357 to 269. [2019-11-23 22:14:58,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 269 states. [2019-11-23 22:14:58,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 269 states to 269 states and 329 transitions. [2019-11-23 22:14:58,914 INFO L78 Accepts]: Start accepts. Automaton has 269 states and 329 transitions. Word has length 37 [2019-11-23 22:14:58,914 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:14:58,914 INFO L462 AbstractCegarLoop]: Abstraction has 269 states and 329 transitions. [2019-11-23 22:14:58,914 INFO L463 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-11-23 22:14:58,914 INFO L276 IsEmpty]: Start isEmpty. Operand 269 states and 329 transitions. [2019-11-23 22:14:58,915 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-11-23 22:14:58,915 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:14:58,915 INFO L410 BasicCegarLoop]: trace histogram [6, 6, 4, 4, 4, 4, 2, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 22:14:59,119 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 28 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 22:14:59,119 INFO L410 AbstractCegarLoop]: === Iteration 31 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:14:59,119 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:14:59,120 INFO L82 PathProgramCache]: Analyzing trace with hash -1962362821, now seen corresponding path program 6 times [2019-11-23 22:14:59,120 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:14:59,120 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1947965543] [2019-11-23 22:14:59,120 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:14:59,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:14:59,534 INFO L134 CoverageAnalysis]: Checked inductivity of 67 backedges. 0 proven. 67 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 22:14:59,535 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1947965543] [2019-11-23 22:14:59,535 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [909378424] [2019-11-23 22:14:59,535 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 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 22:14:59,602 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 6 check-sat command(s) [2019-11-23 22:14:59,603 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-23 22:14:59,604 INFO L255 TraceCheckSpWp]: Trace formula consists of 109 conjuncts, 31 conjunts are in the unsatisfiable core [2019-11-23 22:14:59,605 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-23 22:14:59,666 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 22:14:59,757 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 22:14:59,758 INFO L377 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 29 treesize of output 28 [2019-11-23 22:14:59,759 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 22:14:59,766 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 22:14:59,766 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-23 22:14:59,766 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:37, output treesize:30 [2019-11-23 22:14:59,832 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 22:14:59,833 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 22:14:59,834 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 22:14:59,835 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 22:14:59,836 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 32 [2019-11-23 22:14:59,837 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 22:14:59,845 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 22:14:59,846 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-23 22:14:59,846 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:36, output treesize:17 [2019-11-23 22:14:59,861 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 22:14:59,884 INFO L134 CoverageAnalysis]: Checked inductivity of 67 backedges. 0 proven. 67 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 22:14:59,884 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-23 22:14:59,884 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16] total 24 [2019-11-23 22:14:59,884 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [294920975] [2019-11-23 22:14:59,885 INFO L442 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-11-23 22:14:59,885 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:14:59,885 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-11-23 22:14:59,885 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=476, Unknown=0, NotChecked=0, Total=552 [2019-11-23 22:14:59,885 INFO L87 Difference]: Start difference. First operand 269 states and 329 transitions. Second operand 24 states. [2019-11-23 22:15:01,038 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:15:01,039 INFO L93 Difference]: Finished difference Result 355 states and 426 transitions. [2019-11-23 22:15:01,039 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2019-11-23 22:15:01,039 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 37 [2019-11-23 22:15:01,039 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:15:01,041 INFO L225 Difference]: With dead ends: 355 [2019-11-23 22:15:01,041 INFO L226 Difference]: Without dead ends: 353 [2019-11-23 22:15:01,042 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 25 SyntacticMatches, 6 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 368 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=274, Invalid=1366, Unknown=0, NotChecked=0, Total=1640 [2019-11-23 22:15:01,042 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 353 states. [2019-11-23 22:15:01,080 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 353 to 269. [2019-11-23 22:15:01,081 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 269 states. [2019-11-23 22:15:01,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 269 states to 269 states and 329 transitions. [2019-11-23 22:15:01,081 INFO L78 Accepts]: Start accepts. Automaton has 269 states and 329 transitions. Word has length 37 [2019-11-23 22:15:01,081 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:15:01,081 INFO L462 AbstractCegarLoop]: Abstraction has 269 states and 329 transitions. [2019-11-23 22:15:01,082 INFO L463 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-11-23 22:15:01,082 INFO L276 IsEmpty]: Start isEmpty. Operand 269 states and 329 transitions. [2019-11-23 22:15:01,082 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-11-23 22:15:01,082 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:15:01,082 INFO L410 BasicCegarLoop]: trace histogram [6, 5, 4, 4, 4, 4, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 22:15:01,284 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 29 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 22:15:01,284 INFO L410 AbstractCegarLoop]: === Iteration 32 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:15:01,285 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:15:01,285 INFO L82 PathProgramCache]: Analyzing trace with hash 1874300455, now seen corresponding path program 7 times [2019-11-23 22:15:01,285 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:15:01,285 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1541479130] [2019-11-23 22:15:01,285 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:15:01,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:15:01,991 INFO L134 CoverageAnalysis]: Checked inductivity of 67 backedges. 2 proven. 65 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 22:15:01,991 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1541479130] [2019-11-23 22:15:01,991 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [900030783] [2019-11-23 22:15:01,991 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 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 22:15:02,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:15:02,037 INFO L255 TraceCheckSpWp]: Trace formula consists of 106 conjuncts, 42 conjunts are in the unsatisfiable core [2019-11-23 22:15:02,039 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-23 22:15:02,078 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 22:15:02,136 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 22:15:02,137 INFO L377 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 38 treesize of output 29 [2019-11-23 22:15:02,137 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 22:15:02,152 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 22:15:02,153 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-23 22:15:02,153 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:55, output treesize:51 [2019-11-23 22:15:02,357 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-23 22:15:02,363 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 22:15:02,364 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 22:15:02,365 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 44 [2019-11-23 22:15:02,365 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 22:15:02,422 INFO L567 ElimStorePlain]: treesize reduction 12, result has 79.3 percent of original size [2019-11-23 22:15:02,423 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-23 22:15:02,423 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:70, output treesize:38 [2019-11-23 22:15:02,510 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 22:15:02,511 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 22:15:02,512 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 22:15:02,513 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 22:15:02,513 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 36 [2019-11-23 22:15:02,514 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 22:15:02,522 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 22:15:02,522 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-23 22:15:02,522 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:42, output treesize:27 [2019-11-23 22:15:02,606 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 22:15:02,607 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 22:15:02,608 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 22:15:02,609 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 22:15:02,610 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 33 [2019-11-23 22:15:02,610 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 22:15:02,618 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 22:15:02,619 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-23 22:15:02,619 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:37, output treesize:22 [2019-11-23 22:15:02,702 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 22:15:02,703 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 22:15:02,704 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 22:15:02,705 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 22:15:02,706 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 22:15:02,707 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 22:15:02,708 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 22:15:02,709 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 35 treesize of output 40 [2019-11-23 22:15:02,709 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 22:15:02,717 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 22:15:02,718 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-23 22:15:02,718 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:41, output treesize:37 [2019-11-23 22:15:02,769 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 22:15:02,770 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 22:15:02,771 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 22:15:02,780 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 22:15:02,781 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 22:15:02,781 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 22:15:02,782 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 22:15:02,783 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 44 treesize of output 43 [2019-11-23 22:15:02,784 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 22:15:02,793 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 22:15:02,793 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-23 22:15:02,794 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:47, output treesize:19 [2019-11-23 22:15:02,813 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 22:15:02,851 INFO L134 CoverageAnalysis]: Checked inductivity of 67 backedges. 2 proven. 65 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 22:15:02,851 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-23 22:15:02,851 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 19] total 32 [2019-11-23 22:15:02,851 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [501494170] [2019-11-23 22:15:02,851 INFO L442 AbstractCegarLoop]: Interpolant automaton has 32 states [2019-11-23 22:15:02,852 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:15:02,852 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2019-11-23 22:15:02,852 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=122, Invalid=870, Unknown=0, NotChecked=0, Total=992 [2019-11-23 22:15:02,852 INFO L87 Difference]: Start difference. First operand 269 states and 329 transitions. Second operand 32 states. [2019-11-23 22:15:05,727 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:15:05,728 INFO L93 Difference]: Finished difference Result 433 states and 526 transitions. [2019-11-23 22:15:05,728 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2019-11-23 22:15:05,728 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 37 [2019-11-23 22:15:05,728 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:15:05,730 INFO L225 Difference]: With dead ends: 433 [2019-11-23 22:15:05,730 INFO L226 Difference]: Without dead ends: 378 [2019-11-23 22:15:05,731 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 23 SyntacticMatches, 5 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1417 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=603, Invalid=4089, Unknown=0, NotChecked=0, Total=4692 [2019-11-23 22:15:05,732 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 378 states. [2019-11-23 22:15:05,771 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 378 to 281. [2019-11-23 22:15:05,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 281 states. [2019-11-23 22:15:05,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 281 states to 281 states and 345 transitions. [2019-11-23 22:15:05,772 INFO L78 Accepts]: Start accepts. Automaton has 281 states and 345 transitions. Word has length 37 [2019-11-23 22:15:05,772 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:15:05,772 INFO L462 AbstractCegarLoop]: Abstraction has 281 states and 345 transitions. [2019-11-23 22:15:05,772 INFO L463 AbstractCegarLoop]: Interpolant automaton has 32 states. [2019-11-23 22:15:05,772 INFO L276 IsEmpty]: Start isEmpty. Operand 281 states and 345 transitions. [2019-11-23 22:15:05,773 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2019-11-23 22:15:05,773 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:15:05,773 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 22:15:05,976 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 30 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 22:15:05,976 INFO L410 AbstractCegarLoop]: === Iteration 33 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:15:05,977 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:15:05,977 INFO L82 PathProgramCache]: Analyzing trace with hash 623657800, now seen corresponding path program 6 times [2019-11-23 22:15:05,977 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:15:05,977 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1318737425] [2019-11-23 22:15:05,978 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:15:05,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:15:06,358 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 0 proven. 54 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 22:15:06,358 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1318737425] [2019-11-23 22:15:06,358 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1012783202] [2019-11-23 22:15:06,359 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 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 22:15:06,408 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 6 check-sat command(s) [2019-11-23 22:15:06,409 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-23 22:15:06,410 INFO L255 TraceCheckSpWp]: Trace formula consists of 113 conjuncts, 45 conjunts are in the unsatisfiable core [2019-11-23 22:15:06,411 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-23 22:15:06,468 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2019-11-23 22:15:06,468 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 22:15:06,474 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 22:15:06,475 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-23 22:15:06,475 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:22, output treesize:7 [2019-11-23 22:15:06,514 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 22:15:06,604 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 22:15:06,604 INFO L377 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 28 treesize of output 27 [2019-11-23 22:15:06,605 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 22:15:06,613 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 22:15:06,613 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-23 22:15:06,613 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:34, output treesize:27 [2019-11-23 22:15:06,704 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 22:15:06,704 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 22:15:06,705 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 22:15:06,706 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 22:15:06,707 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 33 [2019-11-23 22:15:06,707 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 22:15:06,715 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 22:15:06,716 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-23 22:15:06,716 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:37, output treesize:22 [2019-11-23 22:15:06,782 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 22:15:06,783 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 22:15:06,784 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 22:15:06,785 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 22:15:06,786 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 22:15:06,787 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 22:15:06,788 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 22:15:06,789 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 41 treesize of output 46 [2019-11-23 22:15:06,789 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 22:15:06,797 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 22:15:06,798 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-23 22:15:06,798 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:47, output treesize:43 [2019-11-23 22:15:06,837 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 22:15:06,839 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 22:15:06,840 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 22:15:06,841 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 22:15:06,842 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 22:15:06,843 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 22:15:06,844 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 22:15:06,845 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 44 treesize of output 43 [2019-11-23 22:15:06,845 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 22:15:06,852 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 22:15:06,852 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-23 22:15:06,852 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:47, output treesize:19 [2019-11-23 22:15:06,979 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 22:15:07,008 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 0 proven. 54 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 22:15:07,008 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-23 22:15:07,008 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 19] total 34 [2019-11-23 22:15:07,009 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2016562716] [2019-11-23 22:15:07,009 INFO L442 AbstractCegarLoop]: Interpolant automaton has 34 states [2019-11-23 22:15:07,009 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:15:07,009 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2019-11-23 22:15:07,010 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=131, Invalid=991, Unknown=0, NotChecked=0, Total=1122 [2019-11-23 22:15:07,010 INFO L87 Difference]: Start difference. First operand 281 states and 345 transitions. Second operand 34 states. [2019-11-23 22:15:08,173 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:15:08,173 INFO L93 Difference]: Finished difference Result 365 states and 443 transitions. [2019-11-23 22:15:08,174 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2019-11-23 22:15:08,174 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 38 [2019-11-23 22:15:08,174 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:15:08,176 INFO L225 Difference]: With dead ends: 365 [2019-11-23 22:15:08,176 INFO L226 Difference]: Without dead ends: 363 [2019-11-23 22:15:08,177 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 22 SyntacticMatches, 1 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 828 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=317, Invalid=2439, Unknown=0, NotChecked=0, Total=2756 [2019-11-23 22:15:08,178 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 363 states. [2019-11-23 22:15:08,227 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 363 to 296. [2019-11-23 22:15:08,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 296 states. [2019-11-23 22:15:08,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 296 states to 296 states and 365 transitions. [2019-11-23 22:15:08,228 INFO L78 Accepts]: Start accepts. Automaton has 296 states and 365 transitions. Word has length 38 [2019-11-23 22:15:08,228 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:15:08,229 INFO L462 AbstractCegarLoop]: Abstraction has 296 states and 365 transitions. [2019-11-23 22:15:08,229 INFO L463 AbstractCegarLoop]: Interpolant automaton has 34 states. [2019-11-23 22:15:08,229 INFO L276 IsEmpty]: Start isEmpty. Operand 296 states and 365 transitions. [2019-11-23 22:15:08,230 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2019-11-23 22:15:08,230 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:15:08,230 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 22:15:08,434 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 31 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 22:15:08,434 INFO L410 AbstractCegarLoop]: === Iteration 34 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:15:08,435 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:15:08,435 INFO L82 PathProgramCache]: Analyzing trace with hash -1631378418, now seen corresponding path program 7 times [2019-11-23 22:15:08,435 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:15:08,435 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [398805491] [2019-11-23 22:15:08,436 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:15:08,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:15:08,737 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 0 proven. 54 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 22:15:08,738 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [398805491] [2019-11-23 22:15:08,739 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [44097633] [2019-11-23 22:15:08,739 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 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 22:15:08,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:15:08,805 INFO L255 TraceCheckSpWp]: Trace formula consists of 113 conjuncts, 36 conjunts are in the unsatisfiable core [2019-11-23 22:15:08,806 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-23 22:15:08,923 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 22:15:09,001 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 22:15:09,002 INFO L377 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 29 treesize of output 28 [2019-11-23 22:15:09,002 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 22:15:09,013 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 22:15:09,013 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-23 22:15:09,013 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:35, output treesize:28 [2019-11-23 22:15:09,102 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 22:15:09,103 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 22:15:09,104 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 22:15:09,105 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 22:15:09,105 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 32 treesize of output 34 [2019-11-23 22:15:09,106 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 22:15:09,116 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 22:15:09,116 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-23 22:15:09,117 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:38, output treesize:19 [2019-11-23 22:15:09,240 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 22:15:09,269 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 0 proven. 54 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 22:15:09,269 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-23 22:15:09,269 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17] total 32 [2019-11-23 22:15:09,270 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1148832590] [2019-11-23 22:15:09,270 INFO L442 AbstractCegarLoop]: Interpolant automaton has 32 states [2019-11-23 22:15:09,270 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:15:09,270 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2019-11-23 22:15:09,270 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=116, Invalid=876, Unknown=0, NotChecked=0, Total=992 [2019-11-23 22:15:09,271 INFO L87 Difference]: Start difference. First operand 296 states and 365 transitions. Second operand 32 states. [2019-11-23 22:15:10,518 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:15:10,518 INFO L93 Difference]: Finished difference Result 379 states and 460 transitions. [2019-11-23 22:15:10,518 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2019-11-23 22:15:10,518 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 38 [2019-11-23 22:15:10,519 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:15:10,520 INFO L225 Difference]: With dead ends: 379 [2019-11-23 22:15:10,520 INFO L226 Difference]: Without dead ends: 377 [2019-11-23 22:15:10,520 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 25 SyntacticMatches, 1 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 651 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=360, Invalid=2190, Unknown=0, NotChecked=0, Total=2550 [2019-11-23 22:15:10,521 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 377 states. [2019-11-23 22:15:10,564 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 377 to 326. [2019-11-23 22:15:10,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 326 states. [2019-11-23 22:15:10,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 326 states to 326 states and 404 transitions. [2019-11-23 22:15:10,565 INFO L78 Accepts]: Start accepts. Automaton has 326 states and 404 transitions. Word has length 38 [2019-11-23 22:15:10,565 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:15:10,565 INFO L462 AbstractCegarLoop]: Abstraction has 326 states and 404 transitions. [2019-11-23 22:15:10,566 INFO L463 AbstractCegarLoop]: Interpolant automaton has 32 states. [2019-11-23 22:15:10,566 INFO L276 IsEmpty]: Start isEmpty. Operand 326 states and 404 transitions. [2019-11-23 22:15:10,566 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2019-11-23 22:15:10,566 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:15:10,567 INFO L410 BasicCegarLoop]: trace histogram [6, 6, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 22:15:10,767 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 32 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 22:15:10,767 INFO L410 AbstractCegarLoop]: === Iteration 35 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:15:10,768 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:15:10,768 INFO L82 PathProgramCache]: Analyzing trace with hash -1246795749, now seen corresponding path program 8 times [2019-11-23 22:15:10,768 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:15:10,769 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1660944581] [2019-11-23 22:15:10,769 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:15:10,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:15:10,826 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 24 proven. 33 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-11-23 22:15:10,826 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1660944581] [2019-11-23 22:15:10,826 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1498161098] [2019-11-23 22:15:10,827 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 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 22:15:10,885 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-11-23 22:15:10,885 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-23 22:15:10,886 INFO L255 TraceCheckSpWp]: Trace formula consists of 117 conjuncts, 9 conjunts are in the unsatisfiable core [2019-11-23 22:15:10,886 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-23 22:15:10,888 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 22:15:10,890 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 24 proven. 33 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-11-23 22:15:10,890 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-23 22:15:10,890 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 10 [2019-11-23 22:15:10,890 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [928647974] [2019-11-23 22:15:10,891 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-11-23 22:15:10,891 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:15:10,891 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-11-23 22:15:10,891 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2019-11-23 22:15:10,891 INFO L87 Difference]: Start difference. First operand 326 states and 404 transitions. Second operand 10 states. [2019-11-23 22:15:11,296 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:15:11,296 INFO L93 Difference]: Finished difference Result 414 states and 506 transitions. [2019-11-23 22:15:11,297 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-11-23 22:15:11,297 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 38 [2019-11-23 22:15:11,297 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:15:11,299 INFO L225 Difference]: With dead ends: 414 [2019-11-23 22:15:11,299 INFO L226 Difference]: Without dead ends: 341 [2019-11-23 22:15:11,306 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 97 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=180, Invalid=326, Unknown=0, NotChecked=0, Total=506 [2019-11-23 22:15:11,307 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 341 states. [2019-11-23 22:15:11,384 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 341 to 325. [2019-11-23 22:15:11,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 325 states. [2019-11-23 22:15:11,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 325 states to 325 states and 401 transitions. [2019-11-23 22:15:11,385 INFO L78 Accepts]: Start accepts. Automaton has 325 states and 401 transitions. Word has length 38 [2019-11-23 22:15:11,385 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:15:11,386 INFO L462 AbstractCegarLoop]: Abstraction has 325 states and 401 transitions. [2019-11-23 22:15:11,386 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-11-23 22:15:11,386 INFO L276 IsEmpty]: Start isEmpty. Operand 325 states and 401 transitions. [2019-11-23 22:15:11,387 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2019-11-23 22:15:11,387 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:15:11,387 INFO L410 BasicCegarLoop]: trace histogram [6, 5, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 22:15:11,591 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 33 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 22:15:11,592 INFO L410 AbstractCegarLoop]: === Iteration 36 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:15:11,592 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:15:11,592 INFO L82 PathProgramCache]: Analyzing trace with hash -1833601763, now seen corresponding path program 4 times [2019-11-23 22:15:11,593 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:15:11,593 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [54144467] [2019-11-23 22:15:11,593 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:15:11,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:15:12,689 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 0 proven. 59 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 22:15:12,689 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [54144467] [2019-11-23 22:15:12,689 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [439265794] [2019-11-23 22:15:12,689 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 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 22:15:12,739 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-11-23 22:15:12,739 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-23 22:15:12,740 INFO L255 TraceCheckSpWp]: Trace formula consists of 114 conjuncts, 46 conjunts are in the unsatisfiable core [2019-11-23 22:15:12,743 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-23 22:15:12,781 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 22:15:12,873 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 22:15:12,874 INFO L377 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 28 treesize of output 27 [2019-11-23 22:15:12,874 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 22:15:12,885 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 22:15:12,886 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-23 22:15:12,886 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:37, output treesize:30 [2019-11-23 22:15:12,912 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 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 38 treesize of output 29 [2019-11-23 22:15:12,919 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 22:15:12,921 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 22:15:12,921 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 22:15:12,923 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 22:15:12,925 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 22:15:12,927 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 22:15:12,928 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 22:15:12,929 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 29 [2019-11-23 22:15:12,929 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-23 22:15:12,935 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 22:15:12,935 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-23 22:15:12,943 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 22:15:12,944 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-23 22:15:12,944 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:41, output treesize:17 [2019-11-23 22:15:12,972 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 22:15:13,056 INFO L343 Elim1Store]: treesize reduction 69, result has 55.8 percent of original size [2019-11-23 22:15:13,057 INFO L377 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 6 case distinctions, treesize of input 39 treesize of output 102 [2019-11-23 22:15:13,058 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 22:15:13,058 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 22:15:13,059 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 22:15:13,085 INFO L567 ElimStorePlain]: treesize reduction 66, result has 41.6 percent of original size [2019-11-23 22:15:13,086 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-23 22:15:13,086 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:42, output treesize:47 [2019-11-23 22:15:13,124 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 22:15:13,136 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 22:15:13,140 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 22:15:13,144 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 22:15:13,146 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 22:15:13,230 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 22:15:13,231 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 4 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 8 case distinctions, treesize of input 63 treesize of output 204 [2019-11-23 22:15:13,232 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 22:15:13,233 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 22:15:13,233 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 22:15:13,234 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 22:15:13,234 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 22:15:13,234 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 22:15:13,235 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 22:15:13,235 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 22:15:13,235 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 22:15:13,236 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 22:15:13,236 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 22:15:13,237 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 22:15:13,237 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 22:15:13,237 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 22:15:13,238 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 22:15:13,238 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 22:15:13,238 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 22:15:13,239 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 22:15:13,240 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 22:15:13,241 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 22:15:13,241 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 22:15:13,242 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 22:15:13,242 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 22:15:13,245 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 22:15:13,273 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 22:15:13,274 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 22:15:13,275 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 22:15:13,276 INFO L377 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 58 treesize of output 51 [2019-11-23 22:15:13,277 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-23 22:15:13,566 WARN L192 SmtUtils]: Spent 289.00 ms on a formula simplification. DAG size of input: 104 DAG size of output: 34 [2019-11-23 22:15:13,567 INFO L567 ElimStorePlain]: treesize reduction 1140, result has 9.9 percent of original size [2019-11-23 22:15:13,568 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2019-11-23 22:15:13,568 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:122, output treesize:125 [2019-11-23 22:15:13,816 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 22:15:13,817 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 22:15:13,819 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 22:15:13,821 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 22:15:13,825 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 22:15:13,827 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 22:15:13,828 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 22:15:13,859 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 22:15:13,859 INFO L377 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 11 case distinctions, treesize of input 60 treesize of output 134 [2019-11-23 22:15:13,860 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 22:15:13,861 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 22:15:13,861 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 22:15:13,862 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 22:15:13,920 INFO L567 ElimStorePlain]: treesize reduction 180, result has 31.6 percent of original size [2019-11-23 22:15:13,921 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-23 22:15:13,921 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:68, output treesize:83 [2019-11-23 22:15:14,144 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 22:15:14,146 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-23 22:15:14,147 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 22:15:14,148 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 22:15:14,150 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 22:15:14,150 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 54 treesize of output 53 [2019-11-23 22:15:14,150 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 22:15:14,174 INFO L567 ElimStorePlain]: treesize reduction 12, result has 76.9 percent of original size [2019-11-23 22:15:14,175 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-23 22:15:14,175 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:65, output treesize:33 [2019-11-23 22:15:14,308 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 22:15:14,346 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 10 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 22:15:14,347 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-23 22:15:14,347 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 22] total 36 [2019-11-23 22:15:14,347 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1987298352] [2019-11-23 22:15:14,347 INFO L442 AbstractCegarLoop]: Interpolant automaton has 36 states [2019-11-23 22:15:14,347 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:15:14,347 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2019-11-23 22:15:14,348 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=146, Invalid=1114, Unknown=0, NotChecked=0, Total=1260 [2019-11-23 22:15:14,348 INFO L87 Difference]: Start difference. First operand 325 states and 401 transitions. Second operand 36 states. [2019-11-23 22:15:17,683 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:15:17,683 INFO L93 Difference]: Finished difference Result 534 states and 648 transitions. [2019-11-23 22:15:17,684 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2019-11-23 22:15:17,684 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 38 [2019-11-23 22:15:17,684 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:15:17,685 INFO L225 Difference]: With dead ends: 534 [2019-11-23 22:15:17,686 INFO L226 Difference]: Without dead ends: 464 [2019-11-23 22:15:17,686 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 20 SyntacticMatches, 7 SemanticMatches, 75 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1869 ImplicationChecksByTransitivity, 3.8s TimeCoverageRelationStatistics Valid=673, Invalid=5179, Unknown=0, NotChecked=0, Total=5852 [2019-11-23 22:15:17,687 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 464 states. [2019-11-23 22:15:17,739 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 464 to 372. [2019-11-23 22:15:17,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 372 states. [2019-11-23 22:15:17,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 372 states to 372 states and 464 transitions. [2019-11-23 22:15:17,740 INFO L78 Accepts]: Start accepts. Automaton has 372 states and 464 transitions. Word has length 38 [2019-11-23 22:15:17,740 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:15:17,740 INFO L462 AbstractCegarLoop]: Abstraction has 372 states and 464 transitions. [2019-11-23 22:15:17,740 INFO L463 AbstractCegarLoop]: Interpolant automaton has 36 states. [2019-11-23 22:15:17,740 INFO L276 IsEmpty]: Start isEmpty. Operand 372 states and 464 transitions. [2019-11-23 22:15:17,741 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2019-11-23 22:15:17,741 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:15:17,741 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 22:15:17,942 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 34 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 22:15:17,942 INFO L410 AbstractCegarLoop]: === Iteration 37 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:15:17,943 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:15:17,943 INFO L82 PathProgramCache]: Analyzing trace with hash 1841551444, now seen corresponding path program 9 times [2019-11-23 22:15:17,943 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:15:17,943 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1637654684] [2019-11-23 22:15:17,944 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:15:17,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:15:18,422 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 1 proven. 53 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 22:15:18,423 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1637654684] [2019-11-23 22:15:18,423 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1192750181] [2019-11-23 22:15:18,423 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 35 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 35 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 22:15:18,503 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2019-11-23 22:15:18,504 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-23 22:15:18,506 INFO L255 TraceCheckSpWp]: Trace formula consists of 113 conjuncts, 39 conjunts are in the unsatisfiable core [2019-11-23 22:15:18,507 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-23 22:15:18,585 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 22:15:18,640 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 22:15:18,641 INFO L377 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 39 treesize of output 29 [2019-11-23 22:15:18,641 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 22:15:18,652 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 22:15:18,653 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-23 22:15:18,653 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:50, output treesize:46 [2019-11-23 22:15:18,786 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 22:15:18,786 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-23 22:15:18,788 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 22:15:18,788 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 51 treesize of output 44 [2019-11-23 22:15:18,788 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 22:15:18,815 INFO L567 ElimStorePlain]: treesize reduction 12, result has 76.9 percent of original size [2019-11-23 22:15:18,816 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-23 22:15:18,816 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:65, output treesize:32 [2019-11-23 22:15:18,920 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 22:15:18,921 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 22:15:18,922 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 22:15:18,923 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 22:15:18,924 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 36 [2019-11-23 22:15:18,924 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 22:15:18,934 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 22:15:18,935 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-23 22:15:18,935 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:45, output treesize:24 [2019-11-23 22:15:18,999 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 22:15:19,000 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 22:15:19,002 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 22:15:19,003 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 22:15:19,004 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 36 [2019-11-23 22:15:19,004 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 22:15:19,015 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 22:15:19,015 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-23 22:15:19,015 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:40, output treesize:21 [2019-11-23 22:15:19,141 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 22:15:19,171 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 1 proven. 53 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 22:15:19,172 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-23 22:15:19,172 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 19] total 35 [2019-11-23 22:15:19,172 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [613466974] [2019-11-23 22:15:19,172 INFO L442 AbstractCegarLoop]: Interpolant automaton has 35 states [2019-11-23 22:15:19,172 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:15:19,173 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2019-11-23 22:15:19,173 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=143, Invalid=1047, Unknown=0, NotChecked=0, Total=1190 [2019-11-23 22:15:19,173 INFO L87 Difference]: Start difference. First operand 372 states and 464 transitions. Second operand 35 states. [2019-11-23 22:15:20,651 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:15:20,651 INFO L93 Difference]: Finished difference Result 421 states and 518 transitions. [2019-11-23 22:15:20,651 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2019-11-23 22:15:20,651 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 38 [2019-11-23 22:15:20,651 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:15:20,653 INFO L225 Difference]: With dead ends: 421 [2019-11-23 22:15:20,653 INFO L226 Difference]: Without dead ends: 419 [2019-11-23 22:15:20,654 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 819 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=455, Invalid=2515, Unknown=0, NotChecked=0, Total=2970 [2019-11-23 22:15:20,654 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 419 states. [2019-11-23 22:15:20,712 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 419 to 369. [2019-11-23 22:15:20,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 369 states. [2019-11-23 22:15:20,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 369 states to 369 states and 461 transitions. [2019-11-23 22:15:20,713 INFO L78 Accepts]: Start accepts. Automaton has 369 states and 461 transitions. Word has length 38 [2019-11-23 22:15:20,714 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:15:20,714 INFO L462 AbstractCegarLoop]: Abstraction has 369 states and 461 transitions. [2019-11-23 22:15:20,714 INFO L463 AbstractCegarLoop]: Interpolant automaton has 35 states. [2019-11-23 22:15:20,714 INFO L276 IsEmpty]: Start isEmpty. Operand 369 states and 461 transitions. [2019-11-23 22:15:20,715 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2019-11-23 22:15:20,715 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:15:20,715 INFO L410 BasicCegarLoop]: trace histogram [6, 4, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 22:15:20,919 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 35 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 22:15:20,919 INFO L410 AbstractCegarLoop]: === Iteration 38 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:15:20,919 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:15:20,920 INFO L82 PathProgramCache]: Analyzing trace with hash 669145707, now seen corresponding path program 5 times [2019-11-23 22:15:20,920 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:15:20,920 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [448454141] [2019-11-23 22:15:20,921 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:15:20,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:15:21,845 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 0 proven. 59 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 22:15:21,845 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [448454141] [2019-11-23 22:15:21,845 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1214652372] [2019-11-23 22:15:21,845 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 36 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 36 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 22:15:21,901 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 7 check-sat command(s) [2019-11-23 22:15:21,901 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-23 22:15:21,902 INFO L255 TraceCheckSpWp]: Trace formula consists of 111 conjuncts, 52 conjunts are in the unsatisfiable core [2019-11-23 22:15:21,903 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-23 22:15:21,956 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 22:15:22,025 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 22:15:22,026 INFO L377 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 40 treesize of output 30 [2019-11-23 22:15:22,026 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 22:15:22,046 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 22:15:22,047 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-23 22:15:22,047 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:51, output treesize:47 [2019-11-23 22:15:22,234 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 22:15:22,236 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 22:15:22,236 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 52 treesize of output 33 [2019-11-23 22:15:22,237 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 22:15:22,260 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 22:15:22,261 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-23 22:15:22,261 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:66, output treesize:38 [2019-11-23 22:15:22,499 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 22:15:22,501 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 22:15:22,503 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 22:15:22,506 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 22:15:22,508 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 22:15:22,515 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 22:15:22,515 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 49 treesize of output 72 [2019-11-23 22:15:22,516 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 22:15:22,554 INFO L567 ElimStorePlain]: treesize reduction 36, result has 64.0 percent of original size [2019-11-23 22:15:22,555 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-23 22:15:22,556 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:68, output treesize:64 [2019-11-23 22:15:22,843 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 22:15:22,844 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 22:15:22,846 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 22:15:22,847 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 22:15:22,848 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 22:15:22,850 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 22:15:22,851 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 22:15:22,878 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 22:15:22,879 INFO L377 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 11 case distinctions, treesize of input 69 treesize of output 163 [2019-11-23 22:15:22,880 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 22:15:22,880 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 22:15:22,881 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 22:15:22,882 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 22:15:22,946 INFO L567 ElimStorePlain]: treesize reduction 234, result has 30.1 percent of original size [2019-11-23 22:15:22,946 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 22:15:22,947 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-23 22:15:22,947 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:88, output treesize:101 [2019-11-23 22:15:22,947 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 22:15:23,028 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 22:15:23,209 WARN L192 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 48 [2019-11-23 22:15:23,270 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 22:15:23,272 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 22:15:23,273 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 22:15:23,274 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 22:15:23,274 INFO L377 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 3 case distinctions, treesize of input 60 treesize of output 44 [2019-11-23 22:15:23,274 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 22:15:23,285 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 22:15:23,286 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-23 22:15:23,286 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:69, output treesize:32 [2019-11-23 22:15:23,364 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 22:15:23,365 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 22:15:23,366 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 22:15:23,368 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 22:15:23,368 INFO L377 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 3 case distinctions, treesize of input 37 treesize of output 33 [2019-11-23 22:15:23,369 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 22:15:23,374 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 22:15:23,374 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-23 22:15:23,374 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:40, output treesize:21 [2019-11-23 22:15:23,476 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 22:15:23,514 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 9 proven. 50 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 22:15:23,514 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-23 22:15:23,514 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 24] total 40 [2019-11-23 22:15:23,514 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [10998901] [2019-11-23 22:15:23,515 INFO L442 AbstractCegarLoop]: Interpolant automaton has 40 states [2019-11-23 22:15:23,515 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:15:23,515 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2019-11-23 22:15:23,515 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=164, Invalid=1396, Unknown=0, NotChecked=0, Total=1560 [2019-11-23 22:15:23,515 INFO L87 Difference]: Start difference. First operand 369 states and 461 transitions. Second operand 40 states.