/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/array-tiling/pr5.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-6598664 [2019-11-23 20:48:15,353 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-23 20:48:15,356 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-23 20:48:15,375 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-23 20:48:15,375 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-23 20:48:15,377 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-23 20:48:15,379 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-23 20:48:15,388 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-23 20:48:15,392 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-23 20:48:15,395 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-23 20:48:15,396 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-23 20:48:15,398 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-23 20:48:15,398 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-23 20:48:15,400 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-23 20:48:15,402 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-23 20:48:15,404 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-23 20:48:15,405 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-23 20:48:15,406 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-23 20:48:15,407 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-23 20:48:15,412 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-23 20:48:15,416 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-23 20:48:15,420 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-23 20:48:15,421 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-23 20:48:15,422 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-23 20:48:15,424 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-23 20:48:15,424 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-23 20:48:15,424 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-23 20:48:15,426 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-23 20:48:15,428 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-23 20:48:15,429 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-23 20:48:15,429 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-23 20:48:15,431 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-23 20:48:15,431 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-23 20:48:15,432 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-23 20:48:15,433 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-23 20:48:15,434 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-23 20:48:15,434 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-23 20:48:15,434 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-23 20:48:15,435 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-23 20:48:15,435 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-23 20:48:15,437 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-23 20:48:15,437 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 20:48:15,464 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-23 20:48:15,464 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-23 20:48:15,465 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-23 20:48:15,465 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-23 20:48:15,465 INFO L138 SettingsManager]: * Use SBE=true [2019-11-23 20:48:15,466 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-23 20:48:15,466 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-23 20:48:15,466 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-23 20:48:15,466 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-23 20:48:15,466 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-23 20:48:15,467 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-23 20:48:15,467 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-23 20:48:15,467 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-23 20:48:15,467 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2019-11-23 20:48:15,467 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-23 20:48:15,468 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-23 20:48:15,468 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-23 20:48:15,468 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-23 20:48:15,468 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-23 20:48:15,468 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-23 20:48:15,469 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-23 20:48:15,469 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-23 20:48:15,469 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-23 20:48:15,469 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-23 20:48:15,469 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-23 20:48:15,470 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-23 20:48:15,470 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-23 20:48:15,470 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-23 20:48:15,470 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-23 20:48:15,470 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-11-23 20:48:15,744 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-23 20:48:15,761 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-23 20:48:15,764 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-23 20:48:15,765 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-23 20:48:15,766 INFO L275 PluginConnector]: CDTParser initialized [2019-11-23 20:48:15,767 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-tiling/pr5.c [2019-11-23 20:48:15,843 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6c3ac46aa/44818221b32648f69e030ee49d1ac6b6/FLAGe4966a431 [2019-11-23 20:48:16,312 INFO L306 CDTParser]: Found 1 translation units. [2019-11-23 20:48:16,313 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/array-tiling/pr5.c [2019-11-23 20:48:16,320 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6c3ac46aa/44818221b32648f69e030ee49d1ac6b6/FLAGe4966a431 [2019-11-23 20:48:16,734 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6c3ac46aa/44818221b32648f69e030ee49d1ac6b6 [2019-11-23 20:48:16,745 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-23 20:48:16,747 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-11-23 20:48:16,748 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-23 20:48:16,748 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-23 20:48:16,751 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-23 20:48:16,753 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 08:48:16" (1/1) ... [2019-11-23 20:48:16,755 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7ed2e8b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:48:16, skipping insertion in model container [2019-11-23 20:48:16,756 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 08:48:16" (1/1) ... [2019-11-23 20:48:16,764 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-23 20:48:16,787 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-11-23 20:48:16,983 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-23 20:48:16,988 INFO L203 MainTranslator]: Completed pre-run [2019-11-23 20:48:17,016 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-23 20:48:17,115 INFO L208 MainTranslator]: Completed translation [2019-11-23 20:48:17,115 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:48:17 WrapperNode [2019-11-23 20:48:17,116 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-23 20:48:17,116 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-23 20:48:17,116 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-23 20:48:17,117 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-23 20:48:17,123 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:48:17" (1/1) ... [2019-11-23 20:48:17,131 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:48:17" (1/1) ... [2019-11-23 20:48:17,155 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-23 20:48:17,156 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-23 20:48:17,156 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-23 20:48:17,156 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-23 20:48:17,168 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:48:17" (1/1) ... [2019-11-23 20:48:17,169 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:48:17" (1/1) ... [2019-11-23 20:48:17,171 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:48:17" (1/1) ... [2019-11-23 20:48:17,171 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:48:17" (1/1) ... [2019-11-23 20:48:17,189 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:48:17" (1/1) ... [2019-11-23 20:48:17,199 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:48:17" (1/1) ... [2019-11-23 20:48:17,204 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:48:17" (1/1) ... [2019-11-23 20:48:17,207 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-23 20:48:17,208 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-23 20:48:17,208 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-23 20:48:17,208 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-23 20:48:17,209 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:48:17" (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 20:48:17,263 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-11-23 20:48:17,263 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-23 20:48:17,263 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-23 20:48:17,263 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-11-23 20:48:17,263 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-23 20:48:17,264 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-23 20:48:17,581 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-23 20:48:17,581 INFO L284 CfgBuilder]: Removed 8 assume(true) statements. [2019-11-23 20:48:17,582 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 08:48:17 BoogieIcfgContainer [2019-11-23 20:48:17,582 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-23 20:48:17,583 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-23 20:48:17,584 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-23 20:48:17,587 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-23 20:48:17,587 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 08:48:16" (1/3) ... [2019-11-23 20:48:17,587 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@66c52891 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 08:48:17, skipping insertion in model container [2019-11-23 20:48:17,588 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:48:17" (2/3) ... [2019-11-23 20:48:17,588 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@66c52891 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 08:48:17, skipping insertion in model container [2019-11-23 20:48:17,588 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 08:48:17" (3/3) ... [2019-11-23 20:48:17,590 INFO L109 eAbstractionObserver]: Analyzing ICFG pr5.c [2019-11-23 20:48:17,597 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-23 20:48:17,602 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-23 20:48:17,612 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-23 20:48:17,631 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-23 20:48:17,632 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-23 20:48:17,632 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-23 20:48:17,632 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-23 20:48:17,632 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-23 20:48:17,632 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-23 20:48:17,632 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-23 20:48:17,633 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-23 20:48:17,645 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states. [2019-11-23 20:48:17,650 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-11-23 20:48:17,651 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 20:48:17,652 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 20:48:17,652 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 20:48:17,658 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 20:48:17,658 INFO L82 PathProgramCache]: Analyzing trace with hash -1867204106, now seen corresponding path program 1 times [2019-11-23 20:48:17,667 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 20:48:17,667 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1623905515] [2019-11-23 20:48:17,668 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 20:48:17,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 20:48:17,850 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 20:48:17,851 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1623905515] [2019-11-23 20:48:17,852 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 20:48:17,852 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-23 20:48:17,853 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [773085572] [2019-11-23 20:48:17,858 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-23 20:48:17,858 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 20:48:17,870 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-23 20:48:17,870 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-23 20:48:17,872 INFO L87 Difference]: Start difference. First operand 25 states. Second operand 4 states. [2019-11-23 20:48:17,957 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 20:48:17,958 INFO L93 Difference]: Finished difference Result 51 states and 69 transitions. [2019-11-23 20:48:17,959 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-23 20:48:17,960 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-11-23 20:48:17,961 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 20:48:17,969 INFO L225 Difference]: With dead ends: 51 [2019-11-23 20:48:17,969 INFO L226 Difference]: Without dead ends: 27 [2019-11-23 20:48:17,972 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-23 20:48:17,987 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2019-11-23 20:48:18,000 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 22. [2019-11-23 20:48:18,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2019-11-23 20:48:18,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 29 transitions. [2019-11-23 20:48:18,004 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 29 transitions. Word has length 11 [2019-11-23 20:48:18,004 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 20:48:18,005 INFO L462 AbstractCegarLoop]: Abstraction has 22 states and 29 transitions. [2019-11-23 20:48:18,005 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-23 20:48:18,005 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 29 transitions. [2019-11-23 20:48:18,006 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-11-23 20:48:18,006 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 20:48:18,006 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 20:48:18,007 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 20:48:18,007 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 20:48:18,007 INFO L82 PathProgramCache]: Analyzing trace with hash -1867144524, now seen corresponding path program 1 times [2019-11-23 20:48:18,007 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 20:48:18,008 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [546577606] [2019-11-23 20:48:18,008 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 20:48:18,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 20:48:18,202 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 20:48:18,203 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [546577606] [2019-11-23 20:48:18,205 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 20:48:18,205 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-23 20:48:18,206 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1343217173] [2019-11-23 20:48:18,207 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-23 20:48:18,208 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 20:48:18,208 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-23 20:48:18,208 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-23 20:48:18,209 INFO L87 Difference]: Start difference. First operand 22 states and 29 transitions. Second operand 4 states. [2019-11-23 20:48:18,320 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 20:48:18,321 INFO L93 Difference]: Finished difference Result 40 states and 54 transitions. [2019-11-23 20:48:18,321 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-23 20:48:18,321 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-11-23 20:48:18,322 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 20:48:18,322 INFO L225 Difference]: With dead ends: 40 [2019-11-23 20:48:18,323 INFO L226 Difference]: Without dead ends: 29 [2019-11-23 20:48:18,324 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-23 20:48:18,325 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2019-11-23 20:48:18,335 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 23. [2019-11-23 20:48:18,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2019-11-23 20:48:18,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 30 transitions. [2019-11-23 20:48:18,336 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 30 transitions. Word has length 11 [2019-11-23 20:48:18,336 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 20:48:18,337 INFO L462 AbstractCegarLoop]: Abstraction has 23 states and 30 transitions. [2019-11-23 20:48:18,337 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-23 20:48:18,337 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 30 transitions. [2019-11-23 20:48:18,339 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-11-23 20:48:18,339 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 20:48:18,339 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 20:48:18,339 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 20:48:18,340 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 20:48:18,340 INFO L82 PathProgramCache]: Analyzing trace with hash -1567010750, now seen corresponding path program 1 times [2019-11-23 20:48:18,340 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 20:48:18,340 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [94962351] [2019-11-23 20:48:18,341 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 20:48:18,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 20:48:18,829 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 20:48:18,829 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [94962351] [2019-11-23 20:48:18,829 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1457694945] [2019-11-23 20:48:18,830 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 20:48:18,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 20:48:18,901 INFO L255 TraceCheckSpWp]: Trace formula consists of 69 conjuncts, 15 conjunts are in the unsatisfiable core [2019-11-23 20:48:18,908 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-23 20:48:19,002 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 16 treesize of output 12 [2019-11-23 20:48:19,002 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 20:48:19,012 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 20:48:19,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 20:48:19,013 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:26, output treesize:19 [2019-11-23 20:48:19,052 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:48:19,054 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 20:48:19,055 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 20:48:19,064 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 20:48:19,065 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 20:48:19,066 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:35, output treesize:19 [2019-11-23 20:48:19,073 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:48:19,074 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 20:48:19,075 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 20:48:19,083 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 20:48:19,084 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 20:48:19,085 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:35, output treesize:19 [2019-11-23 20:48:19,092 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:48:19,093 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 20:48:19,094 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 20:48:19,103 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 20:48:19,104 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 20:48:19,104 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:35, output treesize:19 [2019-11-23 20:48:19,111 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:48:19,112 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 21 treesize of output 20 [2019-11-23 20:48:19,113 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 20:48:19,120 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 20:48:19,121 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 20:48:19,121 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:24, output treesize:11 [2019-11-23 20:48:19,158 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:48:19,177 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 20:48:19,178 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-23 20:48:19,178 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 15 [2019-11-23 20:48:19,178 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1775284919] [2019-11-23 20:48:19,179 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-11-23 20:48:19,179 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 20:48:19,179 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-11-23 20:48:19,180 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=157, Unknown=0, NotChecked=0, Total=210 [2019-11-23 20:48:19,180 INFO L87 Difference]: Start difference. First operand 23 states and 30 transitions. Second operand 15 states. [2019-11-23 20:48:19,894 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 20:48:19,894 INFO L93 Difference]: Finished difference Result 113 states and 144 transitions. [2019-11-23 20:48:19,895 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-11-23 20:48:19,895 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 18 [2019-11-23 20:48:19,895 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 20:48:19,901 INFO L225 Difference]: With dead ends: 113 [2019-11-23 20:48:19,902 INFO L226 Difference]: Without dead ends: 103 [2019-11-23 20:48:19,905 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 13 SyntacticMatches, 3 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 154 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=218, Invalid=652, Unknown=0, NotChecked=0, Total=870 [2019-11-23 20:48:19,906 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2019-11-23 20:48:19,926 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 33. [2019-11-23 20:48:19,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2019-11-23 20:48:19,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 46 transitions. [2019-11-23 20:48:19,927 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 46 transitions. Word has length 18 [2019-11-23 20:48:19,927 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 20:48:19,927 INFO L462 AbstractCegarLoop]: Abstraction has 33 states and 46 transitions. [2019-11-23 20:48:19,928 INFO L463 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-11-23 20:48:19,928 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 46 transitions. [2019-11-23 20:48:19,928 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-11-23 20:48:19,929 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 20:48:19,929 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 20:48:20,134 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 20:48:20,135 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 20:48:20,135 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 20:48:20,135 INFO L82 PathProgramCache]: Analyzing trace with hash 2141150532, now seen corresponding path program 1 times [2019-11-23 20:48:20,135 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 20:48:20,136 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [158520918] [2019-11-23 20:48:20,136 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 20:48:20,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 20:48:20,224 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 20:48:20,225 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [158520918] [2019-11-23 20:48:20,225 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 20:48:20,225 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-23 20:48:20,226 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1619585097] [2019-11-23 20:48:20,226 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-23 20:48:20,226 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 20:48:20,227 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-23 20:48:20,227 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-23 20:48:20,227 INFO L87 Difference]: Start difference. First operand 33 states and 46 transitions. Second operand 4 states. [2019-11-23 20:48:20,291 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 20:48:20,293 INFO L93 Difference]: Finished difference Result 61 states and 82 transitions. [2019-11-23 20:48:20,294 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-23 20:48:20,294 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 18 [2019-11-23 20:48:20,295 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 20:48:20,297 INFO L225 Difference]: With dead ends: 61 [2019-11-23 20:48:20,297 INFO L226 Difference]: Without dead ends: 43 [2019-11-23 20:48:20,300 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-23 20:48:20,301 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2019-11-23 20:48:20,307 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 33. [2019-11-23 20:48:20,308 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2019-11-23 20:48:20,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 45 transitions. [2019-11-23 20:48:20,310 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 45 transitions. Word has length 18 [2019-11-23 20:48:20,310 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 20:48:20,310 INFO L462 AbstractCegarLoop]: Abstraction has 33 states and 45 transitions. [2019-11-23 20:48:20,310 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-23 20:48:20,311 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 45 transitions. [2019-11-23 20:48:20,311 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-11-23 20:48:20,311 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 20:48:20,312 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 20:48:20,312 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 20:48:20,312 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 20:48:20,312 INFO L82 PathProgramCache]: Analyzing trace with hash -1473758394, now seen corresponding path program 1 times [2019-11-23 20:48:20,312 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 20:48:20,313 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [706867913] [2019-11-23 20:48:20,313 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 20:48:20,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 20:48:20,601 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 20:48:20,602 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [706867913] [2019-11-23 20:48:20,602 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [861154812] [2019-11-23 20:48:20,602 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 20:48:20,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 20:48:20,650 INFO L255 TraceCheckSpWp]: Trace formula consists of 69 conjuncts, 21 conjunts are in the unsatisfiable core [2019-11-23 20:48:20,654 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-23 20:48:20,668 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 16 treesize of output 12 [2019-11-23 20:48:20,668 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 20:48:20,674 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 20:48:20,674 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-23 20:48:20,674 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:27, output treesize:23 [2019-11-23 20:48:20,692 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 37 treesize of output 32 [2019-11-23 20:48:20,699 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:48:20,703 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:48:20,708 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:48:20,710 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 28 [2019-11-23 20:48:20,710 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-23 20:48:20,716 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 20:48:20,717 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-23 20:48:20,725 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 20:48:20,726 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 20:48:20,726 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:47, output treesize:23 [2019-11-23 20:48:20,738 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 37 treesize of output 32 [2019-11-23 20:48:20,744 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:48:20,748 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:48:20,752 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:48:20,768 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:48:20,769 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 28 [2019-11-23 20:48:20,770 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-23 20:48:20,778 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 20:48:20,778 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-23 20:48:20,785 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 20:48:20,786 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 20:48:20,786 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:47, output treesize:23 [2019-11-23 20:48:20,796 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 37 treesize of output 32 [2019-11-23 20:48:20,799 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:48:20,800 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:48:20,803 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:48:20,812 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:48:20,815 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 28 [2019-11-23 20:48:20,815 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-23 20:48:20,820 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 20:48:20,821 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-23 20:48:20,829 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 20:48:20,830 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 20:48:20,830 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:47, output treesize:23 [2019-11-23 20:48:20,846 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 49 treesize of output 44 [2019-11-23 20:48:20,849 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:48:20,850 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:48:20,852 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:48:20,855 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:48:20,856 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 36 [2019-11-23 20:48:20,857 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-23 20:48:20,863 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 20:48:20,864 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-23 20:48:20,879 INFO L567 ElimStorePlain]: treesize reduction 5, result has 87.8 percent of original size [2019-11-23 20:48:20,879 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 20:48:20,880 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:57, output treesize:36 [2019-11-23 20:48:20,920 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:48:20,934 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 20:48:20,934 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-23 20:48:20,934 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 12 [2019-11-23 20:48:20,934 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [907210425] [2019-11-23 20:48:20,935 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-11-23 20:48:20,935 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 20:48:20,935 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-11-23 20:48:20,936 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2019-11-23 20:48:20,936 INFO L87 Difference]: Start difference. First operand 33 states and 45 transitions. Second operand 12 states. [2019-11-23 20:48:21,634 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 20:48:21,634 INFO L93 Difference]: Finished difference Result 100 states and 131 transitions. [2019-11-23 20:48:21,635 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-11-23 20:48:21,635 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 18 [2019-11-23 20:48:21,635 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 20:48:21,636 INFO L225 Difference]: With dead ends: 100 [2019-11-23 20:48:21,636 INFO L226 Difference]: Without dead ends: 98 [2019-11-23 20:48:21,637 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 11 SyntacticMatches, 9 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 172 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=208, Invalid=548, Unknown=0, NotChecked=0, Total=756 [2019-11-23 20:48:21,638 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2019-11-23 20:48:21,646 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 44. [2019-11-23 20:48:21,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2019-11-23 20:48:21,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 63 transitions. [2019-11-23 20:48:21,648 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 63 transitions. Word has length 18 [2019-11-23 20:48:21,648 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 20:48:21,648 INFO L462 AbstractCegarLoop]: Abstraction has 44 states and 63 transitions. [2019-11-23 20:48:21,648 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-11-23 20:48:21,648 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 63 transitions. [2019-11-23 20:48:21,649 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-11-23 20:48:21,649 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 20:48:21,649 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 20:48:21,851 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 20:48:21,852 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 20:48:21,853 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 20:48:21,853 INFO L82 PathProgramCache]: Analyzing trace with hash -720826059, now seen corresponding path program 1 times [2019-11-23 20:48:21,853 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 20:48:21,854 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [836213314] [2019-11-23 20:48:21,854 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 20:48:21,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 20:48:22,023 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 20:48:22,023 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [836213314] [2019-11-23 20:48:22,023 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [378253772] [2019-11-23 20:48:22,023 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 20:48:22,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 20:48:22,067 INFO L255 TraceCheckSpWp]: Trace formula consists of 82 conjuncts, 18 conjunts are in the unsatisfiable core [2019-11-23 20:48:22,069 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-23 20:48:22,127 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 16 treesize of output 12 [2019-11-23 20:48:22,127 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 20:48:22,138 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 20:48:22,139 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 20:48:22,139 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:29, output treesize:22 [2019-11-23 20:48:22,167 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:48:22,168 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 20:48:22,169 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 20:48:22,180 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 20:48:22,180 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 20:48:22,181 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:38, output treesize:22 [2019-11-23 20:48:22,189 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:48:22,190 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 20:48:22,191 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 20:48:22,199 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 20:48:22,200 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 20:48:22,201 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:38, output treesize:22 [2019-11-23 20:48:22,230 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:48:22,231 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 20:48:22,232 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 20:48:22,240 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 20:48:22,241 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 20:48:22,241 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:29, output treesize:16 [2019-11-23 20:48:22,311 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:48:22,321 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 20:48:22,321 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-23 20:48:22,321 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9] total 16 [2019-11-23 20:48:22,322 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1895733212] [2019-11-23 20:48:22,322 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-11-23 20:48:22,322 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 20:48:22,323 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-11-23 20:48:22,323 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=204, Unknown=0, NotChecked=0, Total=240 [2019-11-23 20:48:22,323 INFO L87 Difference]: Start difference. First operand 44 states and 63 transitions. Second operand 16 states. [2019-11-23 20:48:23,208 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 20:48:23,208 INFO L93 Difference]: Finished difference Result 155 states and 209 transitions. [2019-11-23 20:48:23,208 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-11-23 20:48:23,208 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 24 [2019-11-23 20:48:23,209 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 20:48:23,210 INFO L225 Difference]: With dead ends: 155 [2019-11-23 20:48:23,211 INFO L226 Difference]: Without dead ends: 127 [2019-11-23 20:48:23,212 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 18 SyntacticMatches, 3 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 159 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=236, Invalid=820, Unknown=0, NotChecked=0, Total=1056 [2019-11-23 20:48:23,213 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2019-11-23 20:48:23,221 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 62. [2019-11-23 20:48:23,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2019-11-23 20:48:23,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 86 transitions. [2019-11-23 20:48:23,222 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 86 transitions. Word has length 24 [2019-11-23 20:48:23,222 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 20:48:23,223 INFO L462 AbstractCegarLoop]: Abstraction has 62 states and 86 transitions. [2019-11-23 20:48:23,223 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-11-23 20:48:23,223 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 86 transitions. [2019-11-23 20:48:23,224 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-11-23 20:48:23,224 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 20:48:23,224 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 20:48:23,428 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 20:48:23,429 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 20:48:23,429 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 20:48:23,430 INFO L82 PathProgramCache]: Analyzing trace with hash 605333817, now seen corresponding path program 1 times [2019-11-23 20:48:23,430 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 20:48:23,431 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [128932505] [2019-11-23 20:48:23,431 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 20:48:23,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 20:48:23,562 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 20:48:23,562 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [128932505] [2019-11-23 20:48:23,563 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1053994641] [2019-11-23 20:48:23,563 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 20:48:23,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 20:48:23,598 INFO L255 TraceCheckSpWp]: Trace formula consists of 82 conjuncts, 16 conjunts are in the unsatisfiable core [2019-11-23 20:48:23,600 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-23 20:48:23,635 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 16 treesize of output 12 [2019-11-23 20:48:23,635 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 20:48:23,642 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 20:48:23,643 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 20:48:23,643 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:26, output treesize:19 [2019-11-23 20:48:23,666 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:48:23,669 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 20:48:23,669 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 20:48:23,677 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 20:48:23,678 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 20:48:23,678 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:35, output treesize:19 [2019-11-23 20:48:23,684 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:48:23,685 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 20:48:23,685 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 20:48:23,693 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 20:48:23,693 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 20:48:23,694 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:35, output treesize:19 [2019-11-23 20:48:23,698 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:48:23,699 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 20:48:23,700 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 20:48:23,707 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 20:48:23,708 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-23 20:48:23,708 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:26, output treesize:22 [2019-11-23 20:48:23,778 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:48:23,783 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 20:48:23,783 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-23 20:48:23,783 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9] total 16 [2019-11-23 20:48:23,783 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1451270198] [2019-11-23 20:48:23,784 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-11-23 20:48:23,784 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 20:48:23,784 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-11-23 20:48:23,784 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=197, Unknown=0, NotChecked=0, Total=240 [2019-11-23 20:48:23,784 INFO L87 Difference]: Start difference. First operand 62 states and 86 transitions. Second operand 16 states. [2019-11-23 20:48:24,974 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 20:48:24,974 INFO L93 Difference]: Finished difference Result 245 states and 316 transitions. [2019-11-23 20:48:24,974 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-11-23 20:48:24,974 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 24 [2019-11-23 20:48:24,975 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 20:48:24,976 INFO L225 Difference]: With dead ends: 245 [2019-11-23 20:48:24,976 INFO L226 Difference]: Without dead ends: 235 [2019-11-23 20:48:24,977 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 19 SyntacticMatches, 2 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 320 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=358, Invalid=1282, Unknown=0, NotChecked=0, Total=1640 [2019-11-23 20:48:24,978 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 235 states. [2019-11-23 20:48:24,988 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 235 to 79. [2019-11-23 20:48:24,988 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2019-11-23 20:48:24,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 114 transitions. [2019-11-23 20:48:24,990 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 114 transitions. Word has length 24 [2019-11-23 20:48:24,990 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 20:48:24,990 INFO L462 AbstractCegarLoop]: Abstraction has 79 states and 114 transitions. [2019-11-23 20:48:24,990 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-11-23 20:48:24,990 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 114 transitions. [2019-11-23 20:48:24,991 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-11-23 20:48:24,991 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 20:48:24,992 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 20:48:25,197 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 20:48:25,203 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 20:48:25,203 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 20:48:25,203 INFO L82 PathProgramCache]: Analyzing trace with hash -1388810889, now seen corresponding path program 1 times [2019-11-23 20:48:25,203 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 20:48:25,203 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1980302896] [2019-11-23 20:48:25,203 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 20:48:25,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 20:48:25,235 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-11-23 20:48:25,239 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1980302896] [2019-11-23 20:48:25,239 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 20:48:25,239 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-23 20:48:25,240 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1746601200] [2019-11-23 20:48:25,240 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-23 20:48:25,240 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 20:48:25,240 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-23 20:48:25,241 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-23 20:48:25,241 INFO L87 Difference]: Start difference. First operand 79 states and 114 transitions. Second operand 4 states. [2019-11-23 20:48:25,279 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 20:48:25,280 INFO L93 Difference]: Finished difference Result 117 states and 165 transitions. [2019-11-23 20:48:25,280 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-23 20:48:25,280 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 24 [2019-11-23 20:48:25,280 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 20:48:25,281 INFO L225 Difference]: With dead ends: 117 [2019-11-23 20:48:25,281 INFO L226 Difference]: Without dead ends: 89 [2019-11-23 20:48:25,282 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-23 20:48:25,282 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2019-11-23 20:48:25,289 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 79. [2019-11-23 20:48:25,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2019-11-23 20:48:25,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 112 transitions. [2019-11-23 20:48:25,290 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 112 transitions. Word has length 24 [2019-11-23 20:48:25,291 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 20:48:25,291 INFO L462 AbstractCegarLoop]: Abstraction has 79 states and 112 transitions. [2019-11-23 20:48:25,291 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-23 20:48:25,291 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 112 transitions. [2019-11-23 20:48:25,292 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-11-23 20:48:25,292 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 20:48:25,292 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 20:48:25,293 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 20:48:25,293 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 20:48:25,293 INFO L82 PathProgramCache]: Analyzing trace with hash 1885088053, now seen corresponding path program 1 times [2019-11-23 20:48:25,293 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 20:48:25,293 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [767401729] [2019-11-23 20:48:25,294 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 20:48:25,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 20:48:25,405 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 20:48:25,406 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [767401729] [2019-11-23 20:48:25,406 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [175779123] [2019-11-23 20:48:25,406 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 20:48:25,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 20:48:25,444 INFO L255 TraceCheckSpWp]: Trace formula consists of 82 conjuncts, 22 conjunts are in the unsatisfiable core [2019-11-23 20:48:25,450 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-23 20:48:25,483 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 16 treesize of output 12 [2019-11-23 20:48:25,483 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 20:48:25,490 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 20:48:25,490 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-23 20:48:25,491 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:23, output treesize:19 [2019-11-23 20:48:25,514 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:48:25,515 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 20:48:25,515 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 20:48:25,524 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 20:48:25,524 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 20:48:25,525 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:35, output treesize:19 [2019-11-23 20:48:25,529 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:48:25,530 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 20:48:25,530 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 20:48:25,539 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 20:48:25,540 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-23 20:48:25,540 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:35, output treesize:31 [2019-11-23 20:48:25,571 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:48:25,572 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:48:25,573 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:48:25,574 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 20:48:25,575 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 20:48:25,575 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 20:48:25,589 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 20:48:25,589 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-23 20:48:25,589 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:35, output treesize:31 [2019-11-23 20:48:25,668 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:48:25,689 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 20:48:25,690 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-23 20:48:25,690 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 11] total 17 [2019-11-23 20:48:25,690 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1378518246] [2019-11-23 20:48:25,690 INFO L442 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-11-23 20:48:25,691 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 20:48:25,691 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-11-23 20:48:25,691 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=206, Unknown=0, NotChecked=0, Total=272 [2019-11-23 20:48:25,691 INFO L87 Difference]: Start difference. First operand 79 states and 112 transitions. Second operand 17 states. [2019-11-23 20:48:26,320 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 20:48:26,320 INFO L93 Difference]: Finished difference Result 173 states and 229 transitions. [2019-11-23 20:48:26,321 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-11-23 20:48:26,321 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 24 [2019-11-23 20:48:26,321 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 20:48:26,323 INFO L225 Difference]: With dead ends: 173 [2019-11-23 20:48:26,323 INFO L226 Difference]: Without dead ends: 171 [2019-11-23 20:48:26,324 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 17 SyntacticMatches, 3 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 257 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=277, Invalid=845, Unknown=0, NotChecked=0, Total=1122 [2019-11-23 20:48:26,325 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171 states. [2019-11-23 20:48:26,334 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171 to 106. [2019-11-23 20:48:26,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 106 states. [2019-11-23 20:48:26,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 151 transitions. [2019-11-23 20:48:26,336 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 151 transitions. Word has length 24 [2019-11-23 20:48:26,336 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 20:48:26,336 INFO L462 AbstractCegarLoop]: Abstraction has 106 states and 151 transitions. [2019-11-23 20:48:26,336 INFO L463 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-11-23 20:48:26,336 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 151 transitions. [2019-11-23 20:48:26,338 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-11-23 20:48:26,338 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 20:48:26,338 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 20:48:26,542 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 20:48:26,542 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 20:48:26,542 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 20:48:26,542 INFO L82 PathProgramCache]: Analyzing trace with hash 186569208, now seen corresponding path program 1 times [2019-11-23 20:48:26,543 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 20:48:26,543 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1096893788] [2019-11-23 20:48:26,543 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 20:48:26,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 20:48:26,564 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 20:48:26,564 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1096893788] [2019-11-23 20:48:26,564 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 20:48:26,564 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 20:48:26,565 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1971312388] [2019-11-23 20:48:26,565 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 20:48:26,565 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 20:48:26,565 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 20:48:26,566 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 20:48:26,566 INFO L87 Difference]: Start difference. First operand 106 states and 151 transitions. Second operand 3 states. [2019-11-23 20:48:26,594 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 20:48:26,594 INFO L93 Difference]: Finished difference Result 182 states and 248 transitions. [2019-11-23 20:48:26,594 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 20:48:26,595 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2019-11-23 20:48:26,595 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 20:48:26,596 INFO L225 Difference]: With dead ends: 182 [2019-11-23 20:48:26,596 INFO L226 Difference]: Without dead ends: 121 [2019-11-23 20:48:26,596 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 20:48:26,597 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2019-11-23 20:48:26,604 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 99. [2019-11-23 20:48:26,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99 states. [2019-11-23 20:48:26,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 136 transitions. [2019-11-23 20:48:26,606 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 136 transitions. Word has length 25 [2019-11-23 20:48:26,606 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 20:48:26,606 INFO L462 AbstractCegarLoop]: Abstraction has 99 states and 136 transitions. [2019-11-23 20:48:26,606 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 20:48:26,606 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 136 transitions. [2019-11-23 20:48:26,607 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-11-23 20:48:26,607 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 20:48:26,608 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 20:48:26,608 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 20:48:26,608 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 20:48:26,608 INFO L82 PathProgramCache]: Analyzing trace with hash -1065341582, now seen corresponding path program 1 times [2019-11-23 20:48:26,608 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 20:48:26,609 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [528116643] [2019-11-23 20:48:26,609 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 20:48:26,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 20:48:26,631 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 20:48:26,631 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [528116643] [2019-11-23 20:48:26,631 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 20:48:26,632 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 20:48:26,632 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [672220869] [2019-11-23 20:48:26,632 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 20:48:26,632 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 20:48:26,633 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 20:48:26,633 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 20:48:26,633 INFO L87 Difference]: Start difference. First operand 99 states and 136 transitions. Second operand 3 states. [2019-11-23 20:48:26,663 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 20:48:26,663 INFO L93 Difference]: Finished difference Result 137 states and 177 transitions. [2019-11-23 20:48:26,663 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 20:48:26,664 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2019-11-23 20:48:26,664 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 20:48:26,664 INFO L225 Difference]: With dead ends: 137 [2019-11-23 20:48:26,664 INFO L226 Difference]: Without dead ends: 83 [2019-11-23 20:48:26,665 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 20:48:26,665 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2019-11-23 20:48:26,670 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 67. [2019-11-23 20:48:26,671 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2019-11-23 20:48:26,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 87 transitions. [2019-11-23 20:48:26,671 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 87 transitions. Word has length 25 [2019-11-23 20:48:26,671 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 20:48:26,671 INFO L462 AbstractCegarLoop]: Abstraction has 67 states and 87 transitions. [2019-11-23 20:48:26,672 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 20:48:26,672 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 87 transitions. [2019-11-23 20:48:26,672 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-11-23 20:48:26,673 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 20:48:26,673 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 20:48:26,673 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 20:48:26,673 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 20:48:26,673 INFO L82 PathProgramCache]: Analyzing trace with hash 456331240, now seen corresponding path program 2 times [2019-11-23 20:48:26,673 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 20:48:26,674 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1162994438] [2019-11-23 20:48:26,674 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 20:48:26,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 20:48:26,812 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 4 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 20:48:26,813 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1162994438] [2019-11-23 20:48:26,813 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1734334639] [2019-11-23 20:48:26,813 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 20:48:26,871 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-11-23 20:48:26,871 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-23 20:48:26,873 INFO L255 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 21 conjunts are in the unsatisfiable core [2019-11-23 20:48:26,875 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-23 20:48:26,929 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 16 treesize of output 12 [2019-11-23 20:48:26,929 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 20:48:26,943 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 20:48:26,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 20:48:26,944 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:29, output treesize:22 [2019-11-23 20:48:26,989 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:48:26,990 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 20:48:26,991 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 20:48:27,001 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 20:48:27,001 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 20:48:27,002 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:38, output treesize:22 [2019-11-23 20:48:27,009 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:48:27,011 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 20:48:27,012 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 20:48:27,028 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 20:48:27,029 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 20:48:27,029 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:32, output treesize:31 [2019-11-23 20:48:27,146 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:48:27,196 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 4 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 20:48:27,196 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-23 20:48:27,196 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10] total 19 [2019-11-23 20:48:27,197 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [316020465] [2019-11-23 20:48:27,198 INFO L442 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-11-23 20:48:27,198 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 20:48:27,198 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-11-23 20:48:27,199 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=290, Unknown=0, NotChecked=0, Total=342 [2019-11-23 20:48:27,199 INFO L87 Difference]: Start difference. First operand 67 states and 87 transitions. Second operand 19 states. [2019-11-23 20:48:28,069 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 20:48:28,070 INFO L93 Difference]: Finished difference Result 170 states and 214 transitions. [2019-11-23 20:48:28,070 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-11-23 20:48:28,070 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 30 [2019-11-23 20:48:28,071 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 20:48:28,072 INFO L225 Difference]: With dead ends: 170 [2019-11-23 20:48:28,072 INFO L226 Difference]: Without dead ends: 144 [2019-11-23 20:48:28,073 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 23 SyntacticMatches, 1 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 148 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=183, Invalid=747, Unknown=0, NotChecked=0, Total=930 [2019-11-23 20:48:28,074 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states. [2019-11-23 20:48:28,079 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 85. [2019-11-23 20:48:28,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2019-11-23 20:48:28,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 110 transitions. [2019-11-23 20:48:28,080 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 110 transitions. Word has length 30 [2019-11-23 20:48:28,081 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 20:48:28,081 INFO L462 AbstractCegarLoop]: Abstraction has 85 states and 110 transitions. [2019-11-23 20:48:28,081 INFO L463 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-11-23 20:48:28,081 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 110 transitions. [2019-11-23 20:48:28,082 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-11-23 20:48:28,082 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 20:48:28,082 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 20:48:28,293 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 20:48:28,294 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 20:48:28,294 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 20:48:28,295 INFO L82 PathProgramCache]: Analyzing trace with hash 879033066, now seen corresponding path program 1 times [2019-11-23 20:48:28,295 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 20:48:28,295 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1869190438] [2019-11-23 20:48:28,295 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 20:48:28,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 20:48:28,454 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 4 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 20:48:28,454 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1869190438] [2019-11-23 20:48:28,455 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [789378759] [2019-11-23 20:48:28,455 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 20:48:28,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 20:48:28,498 INFO L255 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 19 conjunts are in the unsatisfiable core [2019-11-23 20:48:28,500 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-23 20:48:28,557 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 16 treesize of output 12 [2019-11-23 20:48:28,557 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 20:48:28,566 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 20:48:28,567 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 20:48:28,567 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:29, output treesize:22 [2019-11-23 20:48:28,596 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:48:28,597 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 20:48:28,597 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 20:48:28,606 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 20:48:28,607 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 20:48:28,607 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:38, output treesize:22 [2019-11-23 20:48:28,613 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:48:28,614 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 20:48:28,614 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 20:48:28,623 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 20:48:28,624 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-23 20:48:28,624 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:29, output treesize:25 [2019-11-23 20:48:28,756 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:48:28,766 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 4 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 20:48:28,767 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-23 20:48:28,767 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 19 [2019-11-23 20:48:28,767 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [279489038] [2019-11-23 20:48:28,768 INFO L442 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-11-23 20:48:28,768 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 20:48:28,768 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-11-23 20:48:28,769 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=283, Unknown=0, NotChecked=0, Total=342 [2019-11-23 20:48:28,769 INFO L87 Difference]: Start difference. First operand 85 states and 110 transitions. Second operand 19 states. [2019-11-23 20:48:29,746 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 20:48:29,746 INFO L93 Difference]: Finished difference Result 229 states and 277 transitions. [2019-11-23 20:48:29,746 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-11-23 20:48:29,746 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 30 [2019-11-23 20:48:29,746 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 20:48:29,747 INFO L225 Difference]: With dead ends: 229 [2019-11-23 20:48:29,747 INFO L226 Difference]: Without dead ends: 203 [2019-11-23 20:48:29,748 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 23 SyntacticMatches, 2 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 315 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=278, Invalid=1128, Unknown=0, NotChecked=0, Total=1406 [2019-11-23 20:48:29,749 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 203 states. [2019-11-23 20:48:29,756 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 203 to 101. [2019-11-23 20:48:29,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 101 states. [2019-11-23 20:48:29,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 132 transitions. [2019-11-23 20:48:29,757 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 132 transitions. Word has length 30 [2019-11-23 20:48:29,758 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 20:48:29,758 INFO L462 AbstractCegarLoop]: Abstraction has 101 states and 132 transitions. [2019-11-23 20:48:29,758 INFO L463 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-11-23 20:48:29,758 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 132 transitions. [2019-11-23 20:48:29,758 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-11-23 20:48:29,759 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 20:48:29,759 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 20:48:29,962 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 20:48:29,963 INFO L410 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 20:48:29,963 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 20:48:29,963 INFO L82 PathProgramCache]: Analyzing trace with hash 1019581676, now seen corresponding path program 2 times [2019-11-23 20:48:29,964 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 20:48:29,964 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1675768522] [2019-11-23 20:48:29,964 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 20:48:29,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 20:48:30,106 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 4 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 20:48:30,107 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1675768522] [2019-11-23 20:48:30,107 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [212500890] [2019-11-23 20:48:30,107 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 20:48:30,148 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-11-23 20:48:30,148 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-23 20:48:30,149 INFO L255 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 19 conjunts are in the unsatisfiable core [2019-11-23 20:48:30,151 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-23 20:48:30,252 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 16 treesize of output 12 [2019-11-23 20:48:30,252 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 20:48:30,262 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 20:48:30,263 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 20:48:30,263 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:29, output treesize:22 [2019-11-23 20:48:30,293 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:48:30,295 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 20:48:30,296 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 20:48:30,309 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 20:48:30,309 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 20:48:30,310 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:38, output treesize:22 [2019-11-23 20:48:30,321 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:48:30,322 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 20:48:30,322 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 20:48:30,331 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 20:48:30,331 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-23 20:48:30,332 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:29, output treesize:25 [2019-11-23 20:48:30,451 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:48:30,461 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 4 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 20:48:30,461 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-23 20:48:30,462 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 19 [2019-11-23 20:48:30,462 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [849706123] [2019-11-23 20:48:30,462 INFO L442 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-11-23 20:48:30,462 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 20:48:30,463 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-11-23 20:48:30,463 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=298, Unknown=0, NotChecked=0, Total=342 [2019-11-23 20:48:30,463 INFO L87 Difference]: Start difference. First operand 101 states and 132 transitions. Second operand 19 states. [2019-11-23 20:48:32,223 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 20:48:32,223 INFO L93 Difference]: Finished difference Result 374 states and 453 transitions. [2019-11-23 20:48:32,224 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2019-11-23 20:48:32,224 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 30 [2019-11-23 20:48:32,224 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 20:48:32,225 INFO L225 Difference]: With dead ends: 374 [2019-11-23 20:48:32,225 INFO L226 Difference]: Without dead ends: 338 [2019-11-23 20:48:32,227 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 23 SyntacticMatches, 1 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 568 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=471, Invalid=2181, Unknown=0, NotChecked=0, Total=2652 [2019-11-23 20:48:32,227 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 338 states. [2019-11-23 20:48:32,236 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 338 to 119. [2019-11-23 20:48:32,236 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 119 states. [2019-11-23 20:48:32,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 154 transitions. [2019-11-23 20:48:32,237 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 154 transitions. Word has length 30 [2019-11-23 20:48:32,237 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 20:48:32,237 INFO L462 AbstractCegarLoop]: Abstraction has 119 states and 154 transitions. [2019-11-23 20:48:32,237 INFO L463 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-11-23 20:48:32,238 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 154 transitions. [2019-11-23 20:48:32,238 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-11-23 20:48:32,238 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 20:48:32,238 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 20:48:32,440 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 20:48:32,441 INFO L410 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 20:48:32,441 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 20:48:32,442 INFO L82 PathProgramCache]: Analyzing trace with hash 1104422888, now seen corresponding path program 2 times [2019-11-23 20:48:32,442 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 20:48:32,442 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1686802972] [2019-11-23 20:48:32,442 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 20:48:32,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 20:48:32,524 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 4 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 20:48:32,524 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1686802972] [2019-11-23 20:48:32,524 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1876887303] [2019-11-23 20:48:32,525 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 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 20:48:32,554 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-11-23 20:48:32,554 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-23 20:48:32,554 INFO L255 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 17 conjunts are in the unsatisfiable core [2019-11-23 20:48:32,556 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-23 20:48:32,581 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 16 treesize of output 12 [2019-11-23 20:48:32,581 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 20:48:32,589 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 20:48:32,589 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 20:48:32,589 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:26, output treesize:19 [2019-11-23 20:48:32,610 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:48:32,611 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 20:48:32,612 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 20:48:32,623 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 20:48:32,624 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-23 20:48:32,624 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:35, output treesize:31 [2019-11-23 20:48:32,652 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:48:32,653 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:48:32,657 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:48:32,658 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 20:48:32,658 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 20:48:32,658 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 20:48:32,668 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 20:48:32,669 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-23 20:48:32,669 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:35, output treesize:31 [2019-11-23 20:48:32,772 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:48:32,778 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 4 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 20:48:32,778 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-23 20:48:32,778 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 11] total 17 [2019-11-23 20:48:32,778 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1893161303] [2019-11-23 20:48:32,779 INFO L442 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-11-23 20:48:32,779 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 20:48:32,779 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-11-23 20:48:32,779 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=203, Unknown=0, NotChecked=0, Total=272 [2019-11-23 20:48:32,779 INFO L87 Difference]: Start difference. First operand 119 states and 154 transitions. Second operand 17 states. [2019-11-23 20:48:33,530 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 20:48:33,530 INFO L93 Difference]: Finished difference Result 378 states and 461 transitions. [2019-11-23 20:48:33,530 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-11-23 20:48:33,530 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 30 [2019-11-23 20:48:33,531 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 20:48:33,532 INFO L225 Difference]: With dead ends: 378 [2019-11-23 20:48:33,533 INFO L226 Difference]: Without dead ends: 368 [2019-11-23 20:48:33,533 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 23 SyntacticMatches, 2 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 249 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=244, Invalid=812, Unknown=0, NotChecked=0, Total=1056 [2019-11-23 20:48:33,534 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 368 states. [2019-11-23 20:48:33,546 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 368 to 156. [2019-11-23 20:48:33,546 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 156 states. [2019-11-23 20:48:33,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156 states to 156 states and 207 transitions. [2019-11-23 20:48:33,547 INFO L78 Accepts]: Start accepts. Automaton has 156 states and 207 transitions. Word has length 30 [2019-11-23 20:48:33,547 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 20:48:33,547 INFO L462 AbstractCegarLoop]: Abstraction has 156 states and 207 transitions. [2019-11-23 20:48:33,547 INFO L463 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-11-23 20:48:33,547 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 207 transitions. [2019-11-23 20:48:33,548 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-11-23 20:48:33,548 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 20:48:33,548 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 20:48:33,751 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 20:48:33,752 INFO L410 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 20:48:33,752 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 20:48:33,752 INFO L82 PathProgramCache]: Analyzing trace with hash -701015446, now seen corresponding path program 1 times [2019-11-23 20:48:33,752 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 20:48:33,752 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1310295371] [2019-11-23 20:48:33,753 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 20:48:33,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 20:48:33,849 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 20:48:33,849 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1310295371] [2019-11-23 20:48:33,849 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1992820014] [2019-11-23 20:48:33,849 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 20:48:33,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 20:48:33,895 INFO L255 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 23 conjunts are in the unsatisfiable core [2019-11-23 20:48:33,897 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-23 20:48:33,941 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 16 treesize of output 12 [2019-11-23 20:48:33,942 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 20:48:33,950 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 20:48:33,950 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-23 20:48:33,950 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:23, output treesize:19 [2019-11-23 20:48:33,975 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:48:33,976 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 20:48:33,976 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 20:48:33,988 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 20:48:33,988 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-23 20:48:33,988 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:35, output treesize:31 [2019-11-23 20:48:34,023 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:48:34,024 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:48:34,025 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:48:34,026 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 20:48:34,027 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 20:48:34,027 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 20:48:34,036 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 20:48:34,037 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-23 20:48:34,037 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:35, output treesize:31 [2019-11-23 20:48:34,174 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:48:34,201 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 20:48:34,201 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-23 20:48:34,201 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 12] total 19 [2019-11-23 20:48:34,201 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1834475930] [2019-11-23 20:48:34,202 INFO L442 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-11-23 20:48:34,202 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 20:48:34,203 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-11-23 20:48:34,203 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=267, Unknown=0, NotChecked=0, Total=342 [2019-11-23 20:48:34,203 INFO L87 Difference]: Start difference. First operand 156 states and 207 transitions. Second operand 19 states. [2019-11-23 20:48:35,347 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 20:48:35,348 INFO L93 Difference]: Finished difference Result 372 states and 466 transitions. [2019-11-23 20:48:35,348 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2019-11-23 20:48:35,348 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 30 [2019-11-23 20:48:35,348 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 20:48:35,351 INFO L225 Difference]: With dead ends: 372 [2019-11-23 20:48:35,351 INFO L226 Difference]: Without dead ends: 370 [2019-11-23 20:48:35,353 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 22 SyntacticMatches, 2 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 753 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=541, Invalid=2111, Unknown=0, NotChecked=0, Total=2652 [2019-11-23 20:48:35,353 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 370 states. [2019-11-23 20:48:35,367 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 370 to 208. [2019-11-23 20:48:35,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 208 states. [2019-11-23 20:48:35,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 208 states to 208 states and 275 transitions. [2019-11-23 20:48:35,368 INFO L78 Accepts]: Start accepts. Automaton has 208 states and 275 transitions. Word has length 30 [2019-11-23 20:48:35,368 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 20:48:35,368 INFO L462 AbstractCegarLoop]: Abstraction has 208 states and 275 transitions. [2019-11-23 20:48:35,368 INFO L463 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-11-23 20:48:35,369 INFO L276 IsEmpty]: Start isEmpty. Operand 208 states and 275 transitions. [2019-11-23 20:48:35,369 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-11-23 20:48:35,369 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 20:48:35,369 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 20:48:35,572 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 20:48:35,573 INFO L410 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 20:48:35,573 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 20:48:35,574 INFO L82 PathProgramCache]: Analyzing trace with hash 39685603, now seen corresponding path program 1 times [2019-11-23 20:48:35,574 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 20:48:35,574 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [546651698] [2019-11-23 20:48:35,575 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 20:48:35,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 20:48:35,598 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-11-23 20:48:35,598 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [546651698] [2019-11-23 20:48:35,598 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 20:48:35,598 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 20:48:35,598 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [535974100] [2019-11-23 20:48:35,599 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 20:48:35,599 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 20:48:35,599 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 20:48:35,599 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 20:48:35,599 INFO L87 Difference]: Start difference. First operand 208 states and 275 transitions. Second operand 3 states. [2019-11-23 20:48:35,632 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 20:48:35,632 INFO L93 Difference]: Finished difference Result 320 states and 410 transitions. [2019-11-23 20:48:35,632 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 20:48:35,632 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 31 [2019-11-23 20:48:35,632 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 20:48:35,634 INFO L225 Difference]: With dead ends: 320 [2019-11-23 20:48:35,634 INFO L226 Difference]: Without dead ends: 235 [2019-11-23 20:48:35,637 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 20:48:35,637 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 235 states. [2019-11-23 20:48:35,649 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 235 to 201. [2019-11-23 20:48:35,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 201 states. [2019-11-23 20:48:35,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 201 states to 201 states and 262 transitions. [2019-11-23 20:48:35,650 INFO L78 Accepts]: Start accepts. Automaton has 201 states and 262 transitions. Word has length 31 [2019-11-23 20:48:35,650 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 20:48:35,651 INFO L462 AbstractCegarLoop]: Abstraction has 201 states and 262 transitions. [2019-11-23 20:48:35,651 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 20:48:35,651 INFO L276 IsEmpty]: Start isEmpty. Operand 201 states and 262 transitions. [2019-11-23 20:48:35,652 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-11-23 20:48:35,652 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 20:48:35,652 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 20:48:35,652 INFO L410 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 20:48:35,653 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 20:48:35,653 INFO L82 PathProgramCache]: Analyzing trace with hash 368940585, now seen corresponding path program 1 times [2019-11-23 20:48:35,653 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 20:48:35,653 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [979660210] [2019-11-23 20:48:35,653 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 20:48:35,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 20:48:35,670 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-11-23 20:48:35,671 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [979660210] [2019-11-23 20:48:35,671 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 20:48:35,671 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 20:48:35,671 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1773387165] [2019-11-23 20:48:35,671 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 20:48:35,671 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 20:48:35,672 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 20:48:35,672 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 20:48:35,672 INFO L87 Difference]: Start difference. First operand 201 states and 262 transitions. Second operand 3 states. [2019-11-23 20:48:35,701 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 20:48:35,702 INFO L93 Difference]: Finished difference Result 251 states and 317 transitions. [2019-11-23 20:48:35,703 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 20:48:35,703 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 31 [2019-11-23 20:48:35,703 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 20:48:35,704 INFO L225 Difference]: With dead ends: 251 [2019-11-23 20:48:35,704 INFO L226 Difference]: Without dead ends: 171 [2019-11-23 20:48:35,704 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 20:48:35,705 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171 states. [2019-11-23 20:48:35,717 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171 to 155. [2019-11-23 20:48:35,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 155 states. [2019-11-23 20:48:35,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 155 states and 197 transitions. [2019-11-23 20:48:35,718 INFO L78 Accepts]: Start accepts. Automaton has 155 states and 197 transitions. Word has length 31 [2019-11-23 20:48:35,718 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 20:48:35,718 INFO L462 AbstractCegarLoop]: Abstraction has 155 states and 197 transitions. [2019-11-23 20:48:35,718 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 20:48:35,718 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 197 transitions. [2019-11-23 20:48:35,719 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-11-23 20:48:35,719 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 20:48:35,719 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 20:48:35,719 INFO L410 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 20:48:35,720 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 20:48:35,720 INFO L82 PathProgramCache]: Analyzing trace with hash -899548069, now seen corresponding path program 3 times [2019-11-23 20:48:35,720 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 20:48:35,720 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1630891651] [2019-11-23 20:48:35,720 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 20:48:35,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 20:48:35,867 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 6 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 20:48:35,867 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1630891651] [2019-11-23 20:48:35,867 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [838771302] [2019-11-23 20:48:35,867 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 20:48:35,914 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2019-11-23 20:48:35,915 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-23 20:48:35,916 INFO L255 TraceCheckSpWp]: Trace formula consists of 108 conjuncts, 21 conjunts are in the unsatisfiable core [2019-11-23 20:48:35,918 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-23 20:48:35,951 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 16 treesize of output 12 [2019-11-23 20:48:35,951 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 20:48:35,963 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 20:48:35,964 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 20:48:35,964 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:26, output treesize:19 [2019-11-23 20:48:35,972 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 28 treesize of output 23 [2019-11-23 20:48:35,983 INFO L343 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2019-11-23 20:48:35,984 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 26 treesize of output 30 [2019-11-23 20:48:35,984 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-23 20:48:35,994 INFO L567 ElimStorePlain]: treesize reduction 8, result has 70.4 percent of original size [2019-11-23 20:48:35,995 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-23 20:48:36,001 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 20:48:36,001 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-23 20:48:36,001 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:31, output treesize:22 [2019-11-23 20:48:36,106 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:48:36,159 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 6 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 20:48:36,160 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-23 20:48:36,160 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11] total 18 [2019-11-23 20:48:36,160 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1511667760] [2019-11-23 20:48:36,160 INFO L442 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-11-23 20:48:36,161 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 20:48:36,161 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-11-23 20:48:36,161 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=254, Unknown=0, NotChecked=0, Total=306 [2019-11-23 20:48:36,162 INFO L87 Difference]: Start difference. First operand 155 states and 197 transitions. Second operand 18 states. [2019-11-23 20:48:36,863 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 20:48:36,864 INFO L93 Difference]: Finished difference Result 280 states and 335 transitions. [2019-11-23 20:48:36,864 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-11-23 20:48:36,864 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 36 [2019-11-23 20:48:36,865 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 20:48:36,866 INFO L225 Difference]: With dead ends: 280 [2019-11-23 20:48:36,866 INFO L226 Difference]: Without dead ends: 248 [2019-11-23 20:48:36,867 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 29 SyntacticMatches, 2 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 160 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=163, Invalid=707, Unknown=0, NotChecked=0, Total=870 [2019-11-23 20:48:36,868 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 248 states. [2019-11-23 20:48:36,880 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 248 to 170. [2019-11-23 20:48:36,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 170 states. [2019-11-23 20:48:36,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 170 states to 170 states and 214 transitions. [2019-11-23 20:48:36,881 INFO L78 Accepts]: Start accepts. Automaton has 170 states and 214 transitions. Word has length 36 [2019-11-23 20:48:36,882 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 20:48:36,882 INFO L462 AbstractCegarLoop]: Abstraction has 170 states and 214 transitions. [2019-11-23 20:48:36,882 INFO L463 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-11-23 20:48:36,882 INFO L276 IsEmpty]: Start isEmpty. Operand 170 states and 214 transitions. [2019-11-23 20:48:36,882 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-11-23 20:48:36,883 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 20:48:36,883 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 20:48:37,086 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 20:48:37,086 INFO L410 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 20:48:37,086 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 20:48:37,087 INFO L82 PathProgramCache]: Analyzing trace with hash 1023679965, now seen corresponding path program 2 times [2019-11-23 20:48:37,087 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 20:48:37,087 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [71916409] [2019-11-23 20:48:37,087 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 20:48:37,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 20:48:37,211 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 6 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 20:48:37,212 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [71916409] [2019-11-23 20:48:37,212 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1562367169] [2019-11-23 20:48:37,212 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 20:48:37,249 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-11-23 20:48:37,250 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-23 20:48:37,251 INFO L255 TraceCheckSpWp]: Trace formula consists of 108 conjuncts, 20 conjunts are in the unsatisfiable core [2019-11-23 20:48:37,252 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-23 20:48:37,313 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 16 treesize of output 12 [2019-11-23 20:48:37,313 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 20:48:37,324 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 20:48:37,324 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 20:48:37,325 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:29, output treesize:22 [2019-11-23 20:48:37,346 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:48:37,347 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 20:48:37,348 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 20:48:37,361 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 20:48:37,362 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-23 20:48:37,362 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:29, output treesize:25 [2019-11-23 20:48:37,513 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:48:37,519 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 6 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 20:48:37,520 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-23 20:48:37,520 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 21 [2019-11-23 20:48:37,520 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2049882611] [2019-11-23 20:48:37,520 INFO L442 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-11-23 20:48:37,521 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 20:48:37,521 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-11-23 20:48:37,521 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=354, Unknown=0, NotChecked=0, Total=420 [2019-11-23 20:48:37,521 INFO L87 Difference]: Start difference. First operand 170 states and 214 transitions. Second operand 21 states. [2019-11-23 20:48:38,986 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 20:48:38,986 INFO L93 Difference]: Finished difference Result 428 states and 512 transitions. [2019-11-23 20:48:38,987 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-11-23 20:48:38,987 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 36 [2019-11-23 20:48:38,987 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 20:48:38,990 INFO L225 Difference]: With dead ends: 428 [2019-11-23 20:48:38,990 INFO L226 Difference]: Without dead ends: 366 [2019-11-23 20:48:38,991 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 28 SyntacticMatches, 1 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 449 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=331, Invalid=1561, Unknown=0, NotChecked=0, Total=1892 [2019-11-23 20:48:38,992 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 366 states. [2019-11-23 20:48:39,009 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 366 to 204. [2019-11-23 20:48:39,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 204 states. [2019-11-23 20:48:39,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 204 states to 204 states and 254 transitions. [2019-11-23 20:48:39,011 INFO L78 Accepts]: Start accepts. Automaton has 204 states and 254 transitions. Word has length 36 [2019-11-23 20:48:39,011 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 20:48:39,011 INFO L462 AbstractCegarLoop]: Abstraction has 204 states and 254 transitions. [2019-11-23 20:48:39,011 INFO L463 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-11-23 20:48:39,011 INFO L276 IsEmpty]: Start isEmpty. Operand 204 states and 254 transitions. [2019-11-23 20:48:39,012 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-11-23 20:48:39,012 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 20:48:39,012 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 20:48:39,215 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 20:48:39,215 INFO L410 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 20:48:39,215 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 20:48:39,216 INFO L82 PathProgramCache]: Analyzing trace with hash 1725279839, now seen corresponding path program 3 times [2019-11-23 20:48:39,216 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 20:48:39,216 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2093272846] [2019-11-23 20:48:39,216 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 20:48:39,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 20:48:39,308 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 6 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 20:48:39,308 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2093272846] [2019-11-23 20:48:39,308 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1553574845] [2019-11-23 20:48:39,308 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 20:48:39,367 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-11-23 20:48:39,368 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-23 20:48:39,369 INFO L255 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 16 conjunts are in the unsatisfiable core [2019-11-23 20:48:39,370 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-23 20:48:39,402 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 16 treesize of output 12 [2019-11-23 20:48:39,402 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 20:48:39,408 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 20:48:39,408 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-23 20:48:39,408 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:26, output treesize:22 [2019-11-23 20:48:39,438 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:48:39,439 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 20:48:39,439 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 20:48:39,450 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 20:48:39,450 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 20:48:39,450 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:38, output treesize:22 [2019-11-23 20:48:39,455 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:48:39,455 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 20:48:39,456 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 20:48:39,465 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 20:48:39,465 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 20:48:39,465 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:38, output treesize:22 [2019-11-23 20:48:39,474 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:48:39,475 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 20:48:39,476 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 20:48:39,486 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 20:48:39,486 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 20:48:39,486 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:38, output treesize:22 [2019-11-23 20:48:39,498 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:48:39,498 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 21 treesize of output 20 [2019-11-23 20:48:39,498 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 20:48:39,505 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 20:48:39,505 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-23 20:48:39,505 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:27, output treesize:23 [2019-11-23 20:48:39,545 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:48:39,559 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 6 proven. 1 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2019-11-23 20:48:39,559 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-23 20:48:39,560 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8] total 16 [2019-11-23 20:48:39,560 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [408907309] [2019-11-23 20:48:39,560 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-11-23 20:48:39,561 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 20:48:39,561 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-11-23 20:48:39,561 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=203, Unknown=0, NotChecked=0, Total=240 [2019-11-23 20:48:39,561 INFO L87 Difference]: Start difference. First operand 204 states and 254 transitions. Second operand 16 states. [2019-11-23 20:48:41,658 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 20:48:41,659 INFO L93 Difference]: Finished difference Result 489 states and 573 transitions. [2019-11-23 20:48:41,659 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2019-11-23 20:48:41,659 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 36 [2019-11-23 20:48:41,659 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 20:48:41,662 INFO L225 Difference]: With dead ends: 489 [2019-11-23 20:48:41,662 INFO L226 Difference]: Without dead ends: 437 [2019-11-23 20:48:41,663 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 31 SyntacticMatches, 1 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1062 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=539, Invalid=3001, Unknown=0, NotChecked=0, Total=3540 [2019-11-23 20:48:41,664 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 437 states. [2019-11-23 20:48:41,682 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 437 to 226. [2019-11-23 20:48:41,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 226 states. [2019-11-23 20:48:41,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 226 states to 226 states and 281 transitions. [2019-11-23 20:48:41,683 INFO L78 Accepts]: Start accepts. Automaton has 226 states and 281 transitions. Word has length 36 [2019-11-23 20:48:41,684 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 20:48:41,684 INFO L462 AbstractCegarLoop]: Abstraction has 226 states and 281 transitions. [2019-11-23 20:48:41,684 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-11-23 20:48:41,684 INFO L276 IsEmpty]: Start isEmpty. Operand 226 states and 281 transitions. [2019-11-23 20:48:41,684 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-11-23 20:48:41,685 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 20:48:41,685 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 20:48:41,888 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 20:48:41,888 INFO L410 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 20:48:41,888 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 20:48:41,889 INFO L82 PathProgramCache]: Analyzing trace with hash 1434661467, now seen corresponding path program 1 times [2019-11-23 20:48:41,889 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 20:48:41,889 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [404884937] [2019-11-23 20:48:41,889 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 20:48:41,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 20:48:41,979 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 0 proven. 31 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 20:48:41,979 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [404884937] [2019-11-23 20:48:41,979 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1757605587] [2019-11-23 20:48:41,979 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 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 20:48:42,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 20:48:42,022 INFO L255 TraceCheckSpWp]: Trace formula consists of 111 conjuncts, 24 conjunts are in the unsatisfiable core [2019-11-23 20:48:42,023 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-23 20:48:42,054 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 16 treesize of output 12 [2019-11-23 20:48:42,054 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 20:48:42,060 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 20:48:42,060 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-23 20:48:42,060 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:23, output treesize:19 [2019-11-23 20:48:42,086 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:48:42,086 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 20:48:42,086 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 20:48:42,091 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 20:48:42,091 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-23 20:48:42,092 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:26, output treesize:22 [2019-11-23 20:48:42,209 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:48:42,229 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 0 proven. 31 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 20:48:42,230 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-23 20:48:42,230 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 12] total 20 [2019-11-23 20:48:42,230 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [359085494] [2019-11-23 20:48:42,230 INFO L442 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-11-23 20:48:42,231 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 20:48:42,231 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-11-23 20:48:42,231 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=306, Unknown=0, NotChecked=0, Total=380 [2019-11-23 20:48:42,231 INFO L87 Difference]: Start difference. First operand 226 states and 281 transitions. Second operand 20 states. [2019-11-23 20:48:43,787 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 20:48:43,787 INFO L93 Difference]: Finished difference Result 470 states and 558 transitions. [2019-11-23 20:48:43,790 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2019-11-23 20:48:43,790 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 36 [2019-11-23 20:48:43,791 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 20:48:43,793 INFO L225 Difference]: With dead ends: 470 [2019-11-23 20:48:43,793 INFO L226 Difference]: Without dead ends: 468 [2019-11-23 20:48:43,794 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 28 SyntacticMatches, 1 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1146 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=713, Invalid=3193, Unknown=0, NotChecked=0, Total=3906 [2019-11-23 20:48:43,795 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 468 states. [2019-11-23 20:48:43,819 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 468 to 278. [2019-11-23 20:48:43,819 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 278 states. [2019-11-23 20:48:43,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 278 states to 278 states and 343 transitions. [2019-11-23 20:48:43,820 INFO L78 Accepts]: Start accepts. Automaton has 278 states and 343 transitions. Word has length 36 [2019-11-23 20:48:43,820 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 20:48:43,820 INFO L462 AbstractCegarLoop]: Abstraction has 278 states and 343 transitions. [2019-11-23 20:48:43,821 INFO L463 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-11-23 20:48:43,821 INFO L276 IsEmpty]: Start isEmpty. Operand 278 states and 343 transitions. [2019-11-23 20:48:43,821 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-11-23 20:48:43,822 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 20:48:43,822 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 20:48:44,024 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 20:48:44,025 INFO L410 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 20:48:44,025 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 20:48:44,026 INFO L82 PathProgramCache]: Analyzing trace with hash -518224242, now seen corresponding path program 4 times [2019-11-23 20:48:44,026 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 20:48:44,026 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [61527192] [2019-11-23 20:48:44,026 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 20:48:44,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 20:48:44,176 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 8 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 20:48:44,177 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [61527192] [2019-11-23 20:48:44,177 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1082323785] [2019-11-23 20:48:44,177 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 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 20:48:44,220 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-11-23 20:48:44,221 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-23 20:48:44,222 INFO L255 TraceCheckSpWp]: Trace formula consists of 121 conjuncts, 19 conjunts are in the unsatisfiable core [2019-11-23 20:48:44,223 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-23 20:48:44,259 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 13 treesize of output 9 [2019-11-23 20:48:44,260 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 20:48:44,264 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 20:48:44,265 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 20:48:44,265 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:20, output treesize:13 [2019-11-23 20:48:44,413 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:48:44,418 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 8 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 20:48:44,419 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-23 20:48:44,419 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11] total 20 [2019-11-23 20:48:44,419 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1686535492] [2019-11-23 20:48:44,419 INFO L442 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-11-23 20:48:44,419 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 20:48:44,420 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-11-23 20:48:44,420 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=326, Unknown=0, NotChecked=0, Total=380 [2019-11-23 20:48:44,420 INFO L87 Difference]: Start difference. First operand 278 states and 343 transitions. Second operand 20 states. [2019-11-23 20:48:45,522 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 20:48:45,523 INFO L93 Difference]: Finished difference Result 382 states and 453 transitions. [2019-11-23 20:48:45,523 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-11-23 20:48:45,523 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 42 [2019-11-23 20:48:45,523 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 20:48:45,525 INFO L225 Difference]: With dead ends: 382 [2019-11-23 20:48:45,525 INFO L226 Difference]: Without dead ends: 372 [2019-11-23 20:48:45,526 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 166 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=216, Invalid=974, Unknown=0, NotChecked=0, Total=1190 [2019-11-23 20:48:45,527 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 372 states. [2019-11-23 20:48:45,550 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 372 to 285. [2019-11-23 20:48:45,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 285 states. [2019-11-23 20:48:45,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 285 states to 285 states and 350 transitions. [2019-11-23 20:48:45,550 INFO L78 Accepts]: Start accepts. Automaton has 285 states and 350 transitions. Word has length 42 [2019-11-23 20:48:45,551 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 20:48:45,551 INFO L462 AbstractCegarLoop]: Abstraction has 285 states and 350 transitions. [2019-11-23 20:48:45,551 INFO L463 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-11-23 20:48:45,551 INFO L276 IsEmpty]: Start isEmpty. Operand 285 states and 350 transitions. [2019-11-23 20:48:45,551 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-11-23 20:48:45,551 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 20:48:45,551 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 20:48:45,752 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 20:48:45,752 INFO L410 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 20:48:45,753 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 20:48:45,753 INFO L82 PathProgramCache]: Analyzing trace with hash -590610800, now seen corresponding path program 3 times [2019-11-23 20:48:45,753 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 20:48:45,754 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1033220546] [2019-11-23 20:48:45,754 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 20:48:45,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 20:48:45,881 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 0 proven. 53 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 20:48:45,882 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1033220546] [2019-11-23 20:48:45,882 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1901478314] [2019-11-23 20:48:45,882 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 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 20:48:45,947 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2019-11-23 20:48:45,947 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-23 20:48:45,948 INFO L255 TraceCheckSpWp]: Trace formula consists of 121 conjuncts, 25 conjunts are in the unsatisfiable core [2019-11-23 20:48:45,950 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-23 20:48:45,959 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 13 treesize of output 9 [2019-11-23 20:48:45,960 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 20:48:45,961 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 20:48:45,962 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-23 20:48:45,962 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:9 [2019-11-23 20:48:46,016 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:48:46,032 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 0 proven. 53 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 20:48:46,033 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-23 20:48:46,033 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11] total 16 [2019-11-23 20:48:46,033 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1434229106] [2019-11-23 20:48:46,033 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-11-23 20:48:46,033 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 20:48:46,034 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-11-23 20:48:46,034 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=200, Unknown=0, NotChecked=0, Total=240 [2019-11-23 20:48:46,034 INFO L87 Difference]: Start difference. First operand 285 states and 350 transitions. Second operand 16 states. [2019-11-23 20:48:48,554 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 20:48:48,554 INFO L93 Difference]: Finished difference Result 769 states and 910 transitions. [2019-11-23 20:48:48,559 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 80 states. [2019-11-23 20:48:48,559 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 42 [2019-11-23 20:48:48,559 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 20:48:48,562 INFO L225 Difference]: With dead ends: 769 [2019-11-23 20:48:48,562 INFO L226 Difference]: Without dead ends: 767 [2019-11-23 20:48:48,565 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 121 GetRequests, 38 SyntacticMatches, 1 SemanticMatches, 82 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2477 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=849, Invalid=6123, Unknown=0, NotChecked=0, Total=6972 [2019-11-23 20:48:48,566 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 767 states. [2019-11-23 20:48:48,618 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 767 to 407. [2019-11-23 20:48:48,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 407 states. [2019-11-23 20:48:48,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 407 states to 407 states and 500 transitions. [2019-11-23 20:48:48,619 INFO L78 Accepts]: Start accepts. Automaton has 407 states and 500 transitions. Word has length 42 [2019-11-23 20:48:48,619 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 20:48:48,619 INFO L462 AbstractCegarLoop]: Abstraction has 407 states and 500 transitions. [2019-11-23 20:48:48,619 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-11-23 20:48:48,620 INFO L276 IsEmpty]: Start isEmpty. Operand 407 states and 500 transitions. [2019-11-23 20:48:48,620 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2019-11-23 20:48:48,620 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 20:48:48,621 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 20:48:48,823 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 20:48:48,824 INFO L410 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 20:48:48,824 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 20:48:48,824 INFO L82 PathProgramCache]: Analyzing trace with hash 966590985, now seen corresponding path program 1 times [2019-11-23 20:48:48,824 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 20:48:48,824 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [547134085] [2019-11-23 20:48:48,824 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 20:48:48,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 20:48:48,841 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2019-11-23 20:48:48,842 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [547134085] [2019-11-23 20:48:48,842 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 20:48:48,842 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 20:48:48,842 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [741449483] [2019-11-23 20:48:48,843 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 20:48:48,843 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 20:48:48,843 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 20:48:48,843 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 20:48:48,843 INFO L87 Difference]: Start difference. First operand 407 states and 500 transitions. Second operand 3 states. [2019-11-23 20:48:48,910 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 20:48:48,910 INFO L93 Difference]: Finished difference Result 546 states and 655 transitions. [2019-11-23 20:48:48,911 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 20:48:48,911 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 43 [2019-11-23 20:48:48,911 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 20:48:48,913 INFO L225 Difference]: With dead ends: 546 [2019-11-23 20:48:48,913 INFO L226 Difference]: Without dead ends: 408 [2019-11-23 20:48:48,913 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 20:48:48,914 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 408 states. [2019-11-23 20:48:48,952 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 408 to 353. [2019-11-23 20:48:48,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 353 states. [2019-11-23 20:48:48,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 353 states to 353 states and 418 transitions. [2019-11-23 20:48:48,955 INFO L78 Accepts]: Start accepts. Automaton has 353 states and 418 transitions. Word has length 43 [2019-11-23 20:48:48,955 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 20:48:48,955 INFO L462 AbstractCegarLoop]: Abstraction has 353 states and 418 transitions. [2019-11-23 20:48:48,955 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 20:48:48,956 INFO L276 IsEmpty]: Start isEmpty. Operand 353 states and 418 transitions. [2019-11-23 20:48:48,956 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-11-23 20:48:48,957 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 20:48:48,957 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 20:48:48,957 INFO L410 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 20:48:48,957 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 20:48:48,957 INFO L82 PathProgramCache]: Analyzing trace with hash -1863128600, now seen corresponding path program 1 times [2019-11-23 20:48:48,958 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 20:48:48,958 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1122712259] [2019-11-23 20:48:48,958 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 20:48:48,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 20:48:48,991 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2019-11-23 20:48:48,991 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1122712259] [2019-11-23 20:48:48,991 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 20:48:48,991 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 20:48:48,992 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1146598821] [2019-11-23 20:48:48,992 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 20:48:48,992 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 20:48:48,992 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 20:48:48,992 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 20:48:48,993 INFO L87 Difference]: Start difference. First operand 353 states and 418 transitions. Second operand 3 states. [2019-11-23 20:48:49,063 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 20:48:49,063 INFO L93 Difference]: Finished difference Result 499 states and 586 transitions. [2019-11-23 20:48:49,063 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 20:48:49,064 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 44 [2019-11-23 20:48:49,064 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 20:48:49,065 INFO L225 Difference]: With dead ends: 499 [2019-11-23 20:48:49,065 INFO L226 Difference]: Without dead ends: 347 [2019-11-23 20:48:49,066 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 20:48:49,066 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 347 states. [2019-11-23 20:48:49,108 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 347 to 286. [2019-11-23 20:48:49,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 286 states. [2019-11-23 20:48:49,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 286 states to 286 states and 330 transitions. [2019-11-23 20:48:49,109 INFO L78 Accepts]: Start accepts. Automaton has 286 states and 330 transitions. Word has length 44 [2019-11-23 20:48:49,110 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 20:48:49,110 INFO L462 AbstractCegarLoop]: Abstraction has 286 states and 330 transitions. [2019-11-23 20:48:49,110 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 20:48:49,110 INFO L276 IsEmpty]: Start isEmpty. Operand 286 states and 330 transitions. [2019-11-23 20:48:49,111 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-11-23 20:48:49,111 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 20:48:49,112 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 20:48:49,113 INFO L410 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 20:48:49,114 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 20:48:49,114 INFO L82 PathProgramCache]: Analyzing trace with hash 601841256, now seen corresponding path program 2 times [2019-11-23 20:48:49,114 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 20:48:49,115 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [821695416] [2019-11-23 20:48:49,115 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 20:48:49,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 20:48:49,138 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-11-23 20:48:49,139 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [821695416] [2019-11-23 20:48:49,139 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 20:48:49,139 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 20:48:49,139 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [861335161] [2019-11-23 20:48:49,139 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 20:48:49,139 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 20:48:49,139 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 20:48:49,139 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 20:48:49,140 INFO L87 Difference]: Start difference. First operand 286 states and 330 transitions. Second operand 3 states. [2019-11-23 20:48:49,195 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 20:48:49,196 INFO L93 Difference]: Finished difference Result 345 states and 397 transitions. [2019-11-23 20:48:49,196 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 20:48:49,196 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 44 [2019-11-23 20:48:49,196 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 20:48:49,197 INFO L225 Difference]: With dead ends: 345 [2019-11-23 20:48:49,198 INFO L226 Difference]: Without dead ends: 280 [2019-11-23 20:48:49,198 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 20:48:49,199 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 280 states. [2019-11-23 20:48:49,230 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 280 to 251. [2019-11-23 20:48:49,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 251 states. [2019-11-23 20:48:49,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 251 states to 251 states and 287 transitions. [2019-11-23 20:48:49,231 INFO L78 Accepts]: Start accepts. Automaton has 251 states and 287 transitions. Word has length 44 [2019-11-23 20:48:49,231 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 20:48:49,231 INFO L462 AbstractCegarLoop]: Abstraction has 251 states and 287 transitions. [2019-11-23 20:48:49,231 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 20:48:49,231 INFO L276 IsEmpty]: Start isEmpty. Operand 251 states and 287 transitions. [2019-11-23 20:48:49,232 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-11-23 20:48:49,232 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 20:48:49,232 INFO L410 BasicCegarLoop]: trace histogram [6, 6, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 20:48:49,233 INFO L410 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 20:48:49,233 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 20:48:49,233 INFO L82 PathProgramCache]: Analyzing trace with hash 707092097, now seen corresponding path program 5 times [2019-11-23 20:48:49,233 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 20:48:49,233 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1997027328] [2019-11-23 20:48:49,233 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 20:48:49,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 20:48:49,632 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 55 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 20:48:49,632 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1997027328] [2019-11-23 20:48:49,633 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [744645714] [2019-11-23 20:48:49,633 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 20:48:49,676 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2019-11-23 20:48:49,676 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-23 20:48:49,677 INFO L255 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 12 conjunts are in the unsatisfiable core [2019-11-23 20:48:49,678 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-23 20:48:49,736 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:48:49,737 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 20:48:49,737 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 20:48:49,932 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 80 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 20:48:49,933 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-23 20:48:49,933 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 22 [2019-11-23 20:48:49,933 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1087763373] [2019-11-23 20:48:49,933 INFO L442 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-11-23 20:48:49,934 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 20:48:49,934 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-11-23 20:48:49,934 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=119, Invalid=343, Unknown=0, NotChecked=0, Total=462 [2019-11-23 20:48:49,934 INFO L87 Difference]: Start difference. First operand 251 states and 287 transitions. Second operand 22 states. [2019-11-23 20:48:50,266 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 20:48:50,267 INFO L93 Difference]: Finished difference Result 405 states and 451 transitions. [2019-11-23 20:48:50,267 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-11-23 20:48:50,267 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 48 [2019-11-23 20:48:50,267 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 20:48:50,268 INFO L225 Difference]: With dead ends: 405 [2019-11-23 20:48:50,268 INFO L226 Difference]: Without dead ends: 288 [2019-11-23 20:48:50,269 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 117 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=165, Invalid=485, Unknown=0, NotChecked=0, Total=650 [2019-11-23 20:48:50,269 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 288 states. [2019-11-23 20:48:50,299 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 288 to 264. [2019-11-23 20:48:50,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 264 states. [2019-11-23 20:48:50,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 264 states to 264 states and 298 transitions. [2019-11-23 20:48:50,300 INFO L78 Accepts]: Start accepts. Automaton has 264 states and 298 transitions. Word has length 48 [2019-11-23 20:48:50,300 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 20:48:50,300 INFO L462 AbstractCegarLoop]: Abstraction has 264 states and 298 transitions. [2019-11-23 20:48:50,301 INFO L463 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-11-23 20:48:50,301 INFO L276 IsEmpty]: Start isEmpty. Operand 264 states and 298 transitions. [2019-11-23 20:48:50,301 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-11-23 20:48:50,302 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 20:48:50,302 INFO L410 BasicCegarLoop]: trace histogram [6, 6, 5, 5, 5, 5, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 20:48:50,505 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 20:48:50,505 INFO L410 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 20:48:50,505 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 20:48:50,505 INFO L82 PathProgramCache]: Analyzing trace with hash 1775022515, now seen corresponding path program 6 times [2019-11-23 20:48:50,505 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 20:48:50,506 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1448288454] [2019-11-23 20:48:50,506 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 20:48:50,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 20:48:50,816 INFO L134 CoverageAnalysis]: Checked inductivity of 89 backedges. 10 proven. 79 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 20:48:50,817 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1448288454] [2019-11-23 20:48:50,817 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [66584108] [2019-11-23 20:48:50,817 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 20:48:50,976 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 6 check-sat command(s) [2019-11-23 20:48:50,976 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-23 20:48:50,978 INFO L255 TraceCheckSpWp]: Trace formula consists of 147 conjuncts, 30 conjunts are in the unsatisfiable core [2019-11-23 20:48:50,981 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-23 20:48:51,027 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 16 treesize of output 12 [2019-11-23 20:48:51,028 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 20:48:51,038 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 20:48:51,039 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 20:48:51,039 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:26, output treesize:19 [2019-11-23 20:48:51,088 INFO L343 Elim1Store]: treesize reduction 42, result has 22.2 percent of original size [2019-11-23 20:48:51,089 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 29 treesize of output 28 [2019-11-23 20:48:51,089 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 20:48:51,097 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 20:48:51,097 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 20:48:51,097 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:35, output treesize:19 [2019-11-23 20:48:51,115 INFO L343 Elim1Store]: treesize reduction 42, result has 22.2 percent of original size [2019-11-23 20:48:51,116 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 29 treesize of output 28 [2019-11-23 20:48:51,116 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 20:48:51,128 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 20:48:51,128 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 20:48:51,129 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:35, output treesize:19 [2019-11-23 20:48:51,150 INFO L343 Elim1Store]: treesize reduction 42, result has 22.2 percent of original size [2019-11-23 20:48:51,151 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 29 treesize of output 28 [2019-11-23 20:48:51,151 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 20:48:51,162 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 20:48:51,163 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 20:48:51,163 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:35, output treesize:19 [2019-11-23 20:48:51,175 INFO L343 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2019-11-23 20:48:51,176 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 23 treesize of output 22 [2019-11-23 20:48:51,176 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 20:48:51,184 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 20:48:51,184 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-23 20:48:51,185 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:26, output treesize:22 [2019-11-23 20:48:51,415 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:48:51,473 INFO L134 CoverageAnalysis]: Checked inductivity of 89 backedges. 10 proven. 79 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 20:48:51,474 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-23 20:48:51,474 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 14] total 26 [2019-11-23 20:48:51,474 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1479288540] [2019-11-23 20:48:51,474 INFO L442 AbstractCegarLoop]: Interpolant automaton has 26 states [2019-11-23 20:48:51,474 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 20:48:51,474 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2019-11-23 20:48:51,475 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=572, Unknown=0, NotChecked=0, Total=650 [2019-11-23 20:48:51,475 INFO L87 Difference]: Start difference. First operand 264 states and 298 transitions. Second operand 26 states. [2019-11-23 20:48:53,119 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 20:48:53,119 INFO L93 Difference]: Finished difference Result 542 states and 599 transitions. [2019-11-23 20:48:53,119 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-11-23 20:48:53,119 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 55 [2019-11-23 20:48:53,120 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 20:48:53,121 INFO L225 Difference]: With dead ends: 542 [2019-11-23 20:48:53,121 INFO L226 Difference]: Without dead ends: 463 [2019-11-23 20:48:53,122 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 45 SyntacticMatches, 4 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 388 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=265, Invalid=1715, Unknown=0, NotChecked=0, Total=1980 [2019-11-23 20:48:53,123 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 463 states. [2019-11-23 20:48:53,157 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 463 to 349. [2019-11-23 20:48:53,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 349 states. [2019-11-23 20:48:53,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 349 states to 349 states and 390 transitions. [2019-11-23 20:48:53,158 INFO L78 Accepts]: Start accepts. Automaton has 349 states and 390 transitions. Word has length 55 [2019-11-23 20:48:53,159 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 20:48:53,159 INFO L462 AbstractCegarLoop]: Abstraction has 349 states and 390 transitions. [2019-11-23 20:48:53,159 INFO L463 AbstractCegarLoop]: Interpolant automaton has 26 states. [2019-11-23 20:48:53,159 INFO L276 IsEmpty]: Start isEmpty. Operand 349 states and 390 transitions. [2019-11-23 20:48:53,160 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-11-23 20:48:53,160 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 20:48:53,160 INFO L410 BasicCegarLoop]: trace histogram [6, 6, 5, 5, 5, 5, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 20:48:53,369 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 20:48:53,369 INFO L410 AbstractCegarLoop]: === Iteration 30 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 20:48:53,369 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 20:48:53,370 INFO L82 PathProgramCache]: Analyzing trace with hash 1857928051, now seen corresponding path program 4 times [2019-11-23 20:48:53,370 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 20:48:53,370 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [861013508] [2019-11-23 20:48:53,370 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 20:48:53,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 20:48:53,539 INFO L134 CoverageAnalysis]: Checked inductivity of 89 backedges. 10 proven. 79 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 20:48:53,540 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [861013508] [2019-11-23 20:48:53,540 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1670206776] [2019-11-23 20:48:53,540 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 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 20:48:53,581 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-11-23 20:48:53,581 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-23 20:48:53,582 INFO L255 TraceCheckSpWp]: Trace formula consists of 147 conjuncts, 27 conjunts are in the unsatisfiable core [2019-11-23 20:48:53,583 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-23 20:48:53,676 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 16 treesize of output 12 [2019-11-23 20:48:53,677 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 20:48:53,684 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 20:48:53,684 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 20:48:53,684 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:26, output treesize:19 [2019-11-23 20:48:53,716 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:48:53,717 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 20:48:53,717 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 20:48:53,725 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 20:48:53,725 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 20:48:53,725 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:35, output treesize:19 [2019-11-23 20:48:53,729 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:48:53,730 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 20:48:53,731 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 20:48:53,740 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 20:48:53,741 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 20:48:53,741 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:35, output treesize:19 [2019-11-23 20:48:53,746 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:48:53,747 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 20:48:53,747 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 20:48:53,757 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 20:48:53,757 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 20:48:53,758 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:35, output treesize:19 [2019-11-23 20:48:53,767 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:48:53,768 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 20:48:53,768 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 20:48:53,773 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 20:48:53,773 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-23 20:48:53,773 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:26, output treesize:22 [2019-11-23 20:48:54,019 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:48:54,041 INFO L134 CoverageAnalysis]: Checked inductivity of 89 backedges. 10 proven. 79 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 20:48:54,042 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-23 20:48:54,042 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 15] total 26 [2019-11-23 20:48:54,042 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1675874386] [2019-11-23 20:48:54,042 INFO L442 AbstractCegarLoop]: Interpolant automaton has 26 states [2019-11-23 20:48:54,042 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 20:48:54,043 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2019-11-23 20:48:54,043 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=95, Invalid=555, Unknown=0, NotChecked=0, Total=650 [2019-11-23 20:48:54,043 INFO L87 Difference]: Start difference. First operand 349 states and 390 transitions. Second operand 26 states. [2019-11-23 20:48:56,703 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 20:48:56,703 INFO L93 Difference]: Finished difference Result 638 states and 701 transitions. [2019-11-23 20:48:56,703 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 68 states. [2019-11-23 20:48:56,703 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 55 [2019-11-23 20:48:56,704 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 20:48:56,705 INFO L225 Difference]: With dead ends: 638 [2019-11-23 20:48:56,705 INFO L226 Difference]: Without dead ends: 628 [2019-11-23 20:48:56,707 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 127 GetRequests, 44 SyntacticMatches, 4 SemanticMatches, 79 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2148 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=811, Invalid=5669, Unknown=0, NotChecked=0, Total=6480 [2019-11-23 20:48:56,708 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 628 states. [2019-11-23 20:48:56,752 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 628 to 345. [2019-11-23 20:48:56,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 345 states. [2019-11-23 20:48:56,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 345 states to 345 states and 386 transitions. [2019-11-23 20:48:56,753 INFO L78 Accepts]: Start accepts. Automaton has 345 states and 386 transitions. Word has length 55 [2019-11-23 20:48:56,754 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 20:48:56,754 INFO L462 AbstractCegarLoop]: Abstraction has 345 states and 386 transitions. [2019-11-23 20:48:56,754 INFO L463 AbstractCegarLoop]: Interpolant automaton has 26 states. [2019-11-23 20:48:56,754 INFO L276 IsEmpty]: Start isEmpty. Operand 345 states and 386 transitions. [2019-11-23 20:48:56,755 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-11-23 20:48:56,755 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 20:48:56,755 INFO L410 BasicCegarLoop]: trace histogram [6, 6, 5, 5, 5, 4, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 20:48:56,958 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 20:48:56,958 INFO L410 AbstractCegarLoop]: === Iteration 31 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 20:48:56,959 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 20:48:56,959 INFO L82 PathProgramCache]: Analyzing trace with hash -1764528783, now seen corresponding path program 4 times [2019-11-23 20:48:56,959 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 20:48:56,960 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [927202810] [2019-11-23 20:48:56,960 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 20:48:56,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 20:48:57,126 INFO L134 CoverageAnalysis]: Checked inductivity of 89 backedges. 0 proven. 89 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 20:48:57,127 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [927202810] [2019-11-23 20:48:57,128 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [596216062] [2019-11-23 20:48:57,128 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 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 20:48:57,190 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-11-23 20:48:57,190 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-23 20:48:57,192 INFO L255 TraceCheckSpWp]: Trace formula consists of 150 conjuncts, 33 conjunts are in the unsatisfiable core [2019-11-23 20:48:57,193 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-23 20:48:57,254 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 16 treesize of output 12 [2019-11-23 20:48:57,255 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 20:48:57,260 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 20:48:57,261 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-23 20:48:57,261 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:23, output treesize:19 [2019-11-23 20:48:57,287 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:48:57,288 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 20:48:57,288 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 20:48:57,298 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 20:48:57,299 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 20:48:57,299 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:35, output treesize:19 [2019-11-23 20:48:57,306 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:48:57,307 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 20:48:57,307 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 20:48:57,317 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 20:48:57,317 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 20:48:57,318 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:35, output treesize:19 [2019-11-23 20:48:57,323 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:48:57,323 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 20:48:57,324 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 20:48:57,334 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 20:48:57,334 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 20:48:57,335 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:35, output treesize:19 [2019-11-23 20:48:57,340 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:48:57,341 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 20:48:57,341 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 20:48:57,348 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 20:48:57,348 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-23 20:48:57,349 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:26, output treesize:22 [2019-11-23 20:48:57,566 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:48:57,602 INFO L134 CoverageAnalysis]: Checked inductivity of 89 backedges. 0 proven. 89 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 20:48:57,602 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-23 20:48:57,603 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 15] total 26 [2019-11-23 20:48:57,603 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [722610202] [2019-11-23 20:48:57,603 INFO L442 AbstractCegarLoop]: Interpolant automaton has 26 states [2019-11-23 20:48:57,603 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 20:48:57,603 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2019-11-23 20:48:57,604 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=553, Unknown=0, NotChecked=0, Total=650 [2019-11-23 20:48:57,604 INFO L87 Difference]: Start difference. First operand 345 states and 386 transitions. Second operand 26 states. [2019-11-23 20:49:02,416 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 20:49:02,416 INFO L93 Difference]: Finished difference Result 883 states and 983 transitions. [2019-11-23 20:49:02,418 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 124 states. [2019-11-23 20:49:02,418 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 55 [2019-11-23 20:49:02,418 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 20:49:02,421 INFO L225 Difference]: With dead ends: 883 [2019-11-23 20:49:02,421 INFO L226 Difference]: Without dead ends: 881 [2019-11-23 20:49:02,426 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 184 GetRequests, 44 SyntacticMatches, 4 SemanticMatches, 136 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7285 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=2183, Invalid=16723, Unknown=0, NotChecked=0, Total=18906 [2019-11-23 20:49:02,426 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 881 states. [2019-11-23 20:49:02,460 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 881 to 381. [2019-11-23 20:49:02,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 381 states. [2019-11-23 20:49:02,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 381 states to 381 states and 430 transitions. [2019-11-23 20:49:02,461 INFO L78 Accepts]: Start accepts. Automaton has 381 states and 430 transitions. Word has length 55 [2019-11-23 20:49:02,461 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 20:49:02,461 INFO L462 AbstractCegarLoop]: Abstraction has 381 states and 430 transitions. [2019-11-23 20:49:02,461 INFO L463 AbstractCegarLoop]: Interpolant automaton has 26 states. [2019-11-23 20:49:02,462 INFO L276 IsEmpty]: Start isEmpty. Operand 381 states and 430 transitions. [2019-11-23 20:49:02,462 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-11-23 20:49:02,463 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 20:49:02,463 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 20:49:02,666 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 20:49:02,666 INFO L410 AbstractCegarLoop]: === Iteration 32 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 20:49:02,666 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 20:49:02,667 INFO L82 PathProgramCache]: Analyzing trace with hash -980435187, now seen corresponding path program 2 times [2019-11-23 20:49:02,667 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 20:49:02,667 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [688424584] [2019-11-23 20:49:02,667 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 20:49:02,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 20:49:02,687 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 33 proven. 0 refuted. 0 times theorem prover too weak. 43 trivial. 0 not checked. [2019-11-23 20:49:02,687 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [688424584] [2019-11-23 20:49:02,687 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 20:49:02,687 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 20:49:02,688 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1615635195] [2019-11-23 20:49:02,688 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 20:49:02,688 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 20:49:02,688 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 20:49:02,688 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 20:49:02,689 INFO L87 Difference]: Start difference. First operand 381 states and 430 transitions. Second operand 3 states. [2019-11-23 20:49:02,767 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 20:49:02,768 INFO L93 Difference]: Finished difference Result 506 states and 576 transitions. [2019-11-23 20:49:02,768 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 20:49:02,768 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 57 [2019-11-23 20:49:02,768 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 20:49:02,770 INFO L225 Difference]: With dead ends: 506 [2019-11-23 20:49:02,770 INFO L226 Difference]: Without dead ends: 393 [2019-11-23 20:49:02,770 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 20:49:02,771 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 393 states. [2019-11-23 20:49:02,816 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 393 to 330. [2019-11-23 20:49:02,817 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 330 states. [2019-11-23 20:49:02,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 330 states to 330 states and 370 transitions. [2019-11-23 20:49:02,818 INFO L78 Accepts]: Start accepts. Automaton has 330 states and 370 transitions. Word has length 57 [2019-11-23 20:49:02,819 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 20:49:02,819 INFO L462 AbstractCegarLoop]: Abstraction has 330 states and 370 transitions. [2019-11-23 20:49:02,819 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 20:49:02,819 INFO L276 IsEmpty]: Start isEmpty. Operand 330 states and 370 transitions. [2019-11-23 20:49:02,820 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2019-11-23 20:49:02,820 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 20:49:02,820 INFO L410 BasicCegarLoop]: trace histogram [7, 7, 6, 6, 6, 6, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 20:49:02,820 INFO L410 AbstractCegarLoop]: === Iteration 33 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 20:49:02,820 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 20:49:02,820 INFO L82 PathProgramCache]: Analyzing trace with hash -1072703002, now seen corresponding path program 7 times [2019-11-23 20:49:02,821 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 20:49:02,821 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1940089165] [2019-11-23 20:49:02,821 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 20:49:02,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 20:49:03,145 INFO L134 CoverageAnalysis]: Checked inductivity of 123 backedges. 12 proven. 111 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 20:49:03,145 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1940089165] [2019-11-23 20:49:03,146 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [620569110] [2019-11-23 20:49:03,146 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 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 20:49:03,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 20:49:03,204 INFO L255 TraceCheckSpWp]: Trace formula consists of 160 conjuncts, 30 conjunts are in the unsatisfiable core [2019-11-23 20:49:03,206 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-23 20:49:03,325 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 16 treesize of output 12 [2019-11-23 20:49:03,326 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 20:49:03,334 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 20:49:03,334 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 20:49:03,335 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:29, output treesize:22 [2019-11-23 20:49:03,365 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:49:03,365 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 20:49:03,366 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 20:49:03,376 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 20:49:03,377 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 20:49:03,377 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:38, output treesize:22 [2019-11-23 20:49:03,381 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:49:03,383 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 20:49:03,383 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 20:49:03,393 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 20:49:03,394 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 20:49:03,394 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:38, output treesize:22 [2019-11-23 20:49:03,401 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:49:03,402 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 20:49:03,402 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 20:49:03,409 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 20:49:03,410 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 20:49:03,410 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:29, output treesize:16 [2019-11-23 20:49:03,647 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:49:03,663 INFO L134 CoverageAnalysis]: Checked inductivity of 123 backedges. 12 proven. 111 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 20:49:03,664 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-23 20:49:03,664 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 15] total 29 [2019-11-23 20:49:03,664 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [205940056] [2019-11-23 20:49:03,664 INFO L442 AbstractCegarLoop]: Interpolant automaton has 29 states [2019-11-23 20:49:03,664 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 20:49:03,664 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2019-11-23 20:49:03,665 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=742, Unknown=0, NotChecked=0, Total=812 [2019-11-23 20:49:03,665 INFO L87 Difference]: Start difference. First operand 330 states and 370 transitions. Second operand 29 states. [2019-11-23 20:49:07,005 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 20:49:07,005 INFO L93 Difference]: Finished difference Result 590 states and 655 transitions. [2019-11-23 20:49:07,005 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2019-11-23 20:49:07,005 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 61 [2019-11-23 20:49:07,005 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 20:49:07,007 INFO L225 Difference]: With dead ends: 590 [2019-11-23 20:49:07,007 INFO L226 Difference]: Without dead ends: 580 [2019-11-23 20:49:07,008 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 49 SyntacticMatches, 3 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 900 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=557, Invalid=4135, Unknown=0, NotChecked=0, Total=4692 [2019-11-23 20:49:07,008 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 580 states. [2019-11-23 20:49:07,052 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 580 to 336. [2019-11-23 20:49:07,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 336 states. [2019-11-23 20:49:07,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 336 states to 336 states and 376 transitions. [2019-11-23 20:49:07,053 INFO L78 Accepts]: Start accepts. Automaton has 336 states and 376 transitions. Word has length 61 [2019-11-23 20:49:07,053 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 20:49:07,054 INFO L462 AbstractCegarLoop]: Abstraction has 336 states and 376 transitions. [2019-11-23 20:49:07,054 INFO L463 AbstractCegarLoop]: Interpolant automaton has 29 states. [2019-11-23 20:49:07,054 INFO L276 IsEmpty]: Start isEmpty. Operand 336 states and 376 transitions. [2019-11-23 20:49:07,054 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2019-11-23 20:49:07,054 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 20:49:07,055 INFO L410 BasicCegarLoop]: trace histogram [7, 7, 6, 6, 6, 5, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 20:49:07,257 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 20:49:07,258 INFO L410 AbstractCegarLoop]: === Iteration 34 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 20:49:07,258 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 20:49:07,259 INFO L82 PathProgramCache]: Analyzing trace with hash 12472100, now seen corresponding path program 5 times [2019-11-23 20:49:07,259 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 20:49:07,259 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1567850559] [2019-11-23 20:49:07,259 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 20:49:07,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 20:49:07,543 INFO L134 CoverageAnalysis]: Checked inductivity of 123 backedges. 12 proven. 111 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 20:49:07,543 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1567850559] [2019-11-23 20:49:07,544 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1419640429] [2019-11-23 20:49:07,544 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 20:49:07,709 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 7 check-sat command(s) [2019-11-23 20:49:07,709 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-23 20:49:07,710 INFO L255 TraceCheckSpWp]: Trace formula consists of 163 conjuncts, 24 conjunts are in the unsatisfiable core [2019-11-23 20:49:07,712 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-23 20:49:07,789 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 16 treesize of output 12 [2019-11-23 20:49:07,789 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 20:49:07,795 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 20:49:07,795 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-23 20:49:07,795 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:23, output treesize:19 [2019-11-23 20:49:07,862 INFO L343 Elim1Store]: treesize reduction 33, result has 21.4 percent of original size [2019-11-23 20:49:07,863 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 26 treesize of output 25 [2019-11-23 20:49:07,863 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 20:49:07,871 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 20:49:07,871 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-23 20:49:07,871 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:32, output treesize:28 [2019-11-23 20:49:07,928 INFO L343 Elim1Store]: treesize reduction 88, result has 20.0 percent of original size [2019-11-23 20:49:07,928 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 38 treesize of output 40 [2019-11-23 20:49:07,929 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 20:49:07,939 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 20:49:07,940 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 20:49:07,940 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:44, output treesize:28 [2019-11-23 20:49:07,964 INFO L343 Elim1Store]: treesize reduction 88, result has 20.0 percent of original size [2019-11-23 20:49:07,965 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 38 treesize of output 40 [2019-11-23 20:49:07,965 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 20:49:07,975 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 20:49:07,976 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 20:49:07,976 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:44, output treesize:28 [2019-11-23 20:49:08,003 INFO L343 Elim1Store]: treesize reduction 88, result has 20.0 percent of original size [2019-11-23 20:49:08,003 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 38 treesize of output 40 [2019-11-23 20:49:08,004 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 20:49:08,013 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 20:49:08,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 20:49:08,014 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:44, output treesize:28 [2019-11-23 20:49:08,052 INFO L343 Elim1Store]: treesize reduction 56, result has 49.1 percent of original size [2019-11-23 20:49:08,053 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 38 treesize of output 72 [2019-11-23 20:49:08,053 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 20:49:08,080 INFO L567 ElimStorePlain]: treesize reduction 32, result has 55.6 percent of original size [2019-11-23 20:49:08,080 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 20:49:08,081 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:44, output treesize:40 [2019-11-23 20:49:10,444 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:49:10,501 INFO L134 CoverageAnalysis]: Checked inductivity of 123 backedges. 60 proven. 53 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-11-23 20:49:10,502 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-23 20:49:10,502 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 15] total 29 [2019-11-23 20:49:10,502 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1974712925] [2019-11-23 20:49:10,502 INFO L442 AbstractCegarLoop]: Interpolant automaton has 29 states [2019-11-23 20:49:10,502 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 20:49:10,502 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2019-11-23 20:49:10,503 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=739, Unknown=1, NotChecked=0, Total=812 [2019-11-23 20:49:10,503 INFO L87 Difference]: Start difference. First operand 336 states and 376 transitions. Second operand 29 states. [2019-11-23 20:49:19,087 WARN L192 SmtUtils]: Spent 4.05 s on a formula simplification. DAG size of input: 52 DAG size of output: 50 [2019-11-23 20:49:21,617 WARN L192 SmtUtils]: Spent 2.02 s on a formula simplification that was a NOOP. DAG size: 34 [2019-11-23 20:49:24,900 WARN L192 SmtUtils]: Spent 861.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 47 [2019-11-23 20:49:26,589 WARN L192 SmtUtils]: Spent 979.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 47 [2019-11-23 20:49:28,017 WARN L192 SmtUtils]: Spent 458.00 ms on a formula simplification that was a NOOP. DAG size: 40 [2019-11-23 20:49:28,832 WARN L192 SmtUtils]: Spent 244.00 ms on a formula simplification that was a NOOP. DAG size: 40 [2019-11-23 20:49:29,507 WARN L192 SmtUtils]: Spent 110.00 ms on a formula simplification that was a NOOP. DAG size: 38 [2019-11-23 20:49:29,928 WARN L192 SmtUtils]: Spent 142.00 ms on a formula simplification that was a NOOP. DAG size: 35 [2019-11-23 20:49:30,443 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 20:49:30,443 INFO L93 Difference]: Finished difference Result 641 states and 707 transitions. [2019-11-23 20:49:30,443 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 69 states. [2019-11-23 20:49:30,443 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 61 [2019-11-23 20:49:30,443 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 20:49:30,445 INFO L225 Difference]: With dead ends: 641 [2019-11-23 20:49:30,445 INFO L226 Difference]: Without dead ends: 595 [2019-11-23 20:49:30,446 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 146 GetRequests, 49 SyntacticMatches, 3 SemanticMatches, 94 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2422 ImplicationChecksByTransitivity, 20.1s TimeCoverageRelationStatistics Valid=951, Invalid=8165, Unknown=4, NotChecked=0, Total=9120 [2019-11-23 20:49:30,446 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 595 states. [2019-11-23 20:49:30,493 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 595 to 396. [2019-11-23 20:49:30,493 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 396 states. [2019-11-23 20:49:30,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 396 states to 396 states and 439 transitions. [2019-11-23 20:49:30,494 INFO L78 Accepts]: Start accepts. Automaton has 396 states and 439 transitions. Word has length 61 [2019-11-23 20:49:30,494 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 20:49:30,494 INFO L462 AbstractCegarLoop]: Abstraction has 396 states and 439 transitions. [2019-11-23 20:49:30,494 INFO L463 AbstractCegarLoop]: Interpolant automaton has 29 states. [2019-11-23 20:49:30,494 INFO L276 IsEmpty]: Start isEmpty. Operand 396 states and 439 transitions. [2019-11-23 20:49:30,495 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2019-11-23 20:49:30,495 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 20:49:30,495 INFO L410 BasicCegarLoop]: trace histogram [7, 7, 6, 6, 6, 4, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 20:49:30,697 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 23 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 20:49:30,697 INFO L410 AbstractCegarLoop]: === Iteration 35 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 20:49:30,698 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 20:49:30,698 INFO L82 PathProgramCache]: Analyzing trace with hash 1363577122, now seen corresponding path program 2 times [2019-11-23 20:49:30,698 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 20:49:30,699 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1594100118] [2019-11-23 20:49:30,699 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 20:49:30,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 20:49:30,919 INFO L134 CoverageAnalysis]: Checked inductivity of 123 backedges. 12 proven. 111 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 20:49:30,919 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1594100118] [2019-11-23 20:49:30,920 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [472608938] [2019-11-23 20:49:30,920 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 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 20:49:30,980 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-11-23 20:49:30,980 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-23 20:49:30,981 INFO L255 TraceCheckSpWp]: Trace formula consists of 166 conjuncts, 28 conjunts are in the unsatisfiable core [2019-11-23 20:49:30,983 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-23 20:49:31,071 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 16 treesize of output 12 [2019-11-23 20:49:31,072 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 20:49:31,078 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 20:49:31,078 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 20:49:31,079 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:26, output treesize:19 [2019-11-23 20:49:31,101 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:49:31,102 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 20:49:31,103 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 20:49:31,112 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 20:49:31,112 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 20:49:31,112 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:35, output treesize:19 [2019-11-23 20:49:31,116 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:49:31,117 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 20:49:31,117 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 20:49:31,126 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 20:49:31,127 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-23 20:49:31,127 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:35, output treesize:31 [2019-11-23 20:49:31,162 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:49:31,164 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:49:31,165 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:49:31,166 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 20:49:31,166 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 20:49:31,166 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 20:49:31,174 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 20:49:31,174 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-23 20:49:31,174 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:35, output treesize:31 [2019-11-23 20:49:31,456 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:49:31,480 INFO L134 CoverageAnalysis]: Checked inductivity of 123 backedges. 12 proven. 111 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 20:49:31,480 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-23 20:49:31,480 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 17] total 29 [2019-11-23 20:49:31,480 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1660460786] [2019-11-23 20:49:31,480 INFO L442 AbstractCegarLoop]: Interpolant automaton has 29 states [2019-11-23 20:49:31,481 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 20:49:31,481 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2019-11-23 20:49:31,481 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=111, Invalid=701, Unknown=0, NotChecked=0, Total=812 [2019-11-23 20:49:31,481 INFO L87 Difference]: Start difference. First operand 396 states and 439 transitions. Second operand 29 states. [2019-11-23 20:49:34,862 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 20:49:34,862 INFO L93 Difference]: Finished difference Result 787 states and 883 transitions. [2019-11-23 20:49:34,862 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 73 states. [2019-11-23 20:49:34,862 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 61 [2019-11-23 20:49:34,862 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 20:49:34,864 INFO L225 Difference]: With dead ends: 787 [2019-11-23 20:49:34,864 INFO L226 Difference]: Without dead ends: 755 [2019-11-23 20:49:34,865 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 138 GetRequests, 48 SyntacticMatches, 3 SemanticMatches, 87 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2614 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=930, Invalid=6902, Unknown=0, NotChecked=0, Total=7832 [2019-11-23 20:49:34,866 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 755 states. [2019-11-23 20:49:34,910 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 755 to 366. [2019-11-23 20:49:34,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 366 states. [2019-11-23 20:49:34,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 366 states to 366 states and 407 transitions. [2019-11-23 20:49:34,912 INFO L78 Accepts]: Start accepts. Automaton has 366 states and 407 transitions. Word has length 61 [2019-11-23 20:49:34,912 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 20:49:34,912 INFO L462 AbstractCegarLoop]: Abstraction has 366 states and 407 transitions. [2019-11-23 20:49:34,912 INFO L463 AbstractCegarLoop]: Interpolant automaton has 29 states. [2019-11-23 20:49:34,912 INFO L276 IsEmpty]: Start isEmpty. Operand 366 states and 407 transitions. [2019-11-23 20:49:34,913 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2019-11-23 20:49:34,913 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 20:49:34,913 INFO L410 BasicCegarLoop]: trace histogram [7, 7, 6, 6, 6, 4, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 20:49:35,117 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 24 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 20:49:35,117 INFO L410 AbstractCegarLoop]: === Iteration 36 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 20:49:35,117 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 20:49:35,117 INFO L82 PathProgramCache]: Analyzing trace with hash 394557282, now seen corresponding path program 3 times [2019-11-23 20:49:35,117 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 20:49:35,118 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1979498998] [2019-11-23 20:49:35,118 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 20:49:35,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 20:49:35,304 INFO L134 CoverageAnalysis]: Checked inductivity of 123 backedges. 0 proven. 123 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 20:49:35,304 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1979498998] [2019-11-23 20:49:35,304 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1531774184] [2019-11-23 20:49:35,304 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 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 20:49:35,408 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) [2019-11-23 20:49:35,408 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-23 20:49:35,410 INFO L255 TraceCheckSpWp]: Trace formula consists of 166 conjuncts, 26 conjunts are in the unsatisfiable core [2019-11-23 20:49:35,412 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-23 20:49:35,469 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 16 treesize of output 12 [2019-11-23 20:49:35,470 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 20:49:35,475 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 20:49:35,475 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-23 20:49:35,476 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:23, output treesize:19 [2019-11-23 20:49:35,513 INFO L343 Elim1Store]: treesize reduction 42, result has 22.2 percent of original size [2019-11-23 20:49:35,514 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 29 treesize of output 28 [2019-11-23 20:49:35,514 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 20:49:35,522 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 20:49:35,522 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-23 20:49:35,522 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:35, output treesize:31 [2019-11-23 20:49:35,572 INFO L343 Elim1Store]: treesize reduction 100, result has 20.0 percent of original size [2019-11-23 20:49:35,572 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 41 treesize of output 43 [2019-11-23 20:49:35,573 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 20:49:35,586 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 20:49:35,587 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 20:49:35,587 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:47, output treesize:31 [2019-11-23 20:49:35,613 INFO L343 Elim1Store]: treesize reduction 100, result has 20.0 percent of original size [2019-11-23 20:49:35,614 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 41 treesize of output 43 [2019-11-23 20:49:35,614 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 20:49:35,626 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 20:49:35,627 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-23 20:49:35,627 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:47, output treesize:43 [2019-11-23 20:49:35,693 INFO L343 Elim1Store]: treesize reduction 114, result has 19.7 percent of original size [2019-11-23 20:49:35,693 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 41 treesize of output 46 [2019-11-23 20:49:35,694 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 20:49:35,703 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 20:49:35,704 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-23 20:49:35,704 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:44, output treesize:40 [2019-11-23 20:49:36,010 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:49:36,068 INFO L134 CoverageAnalysis]: Checked inductivity of 123 backedges. 42 proven. 79 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-11-23 20:49:36,068 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-23 20:49:36,068 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 16] total 29 [2019-11-23 20:49:36,069 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1883278224] [2019-11-23 20:49:36,069 INFO L442 AbstractCegarLoop]: Interpolant automaton has 29 states [2019-11-23 20:49:36,069 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 20:49:36,069 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2019-11-23 20:49:36,070 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=113, Invalid=699, Unknown=0, NotChecked=0, Total=812 [2019-11-23 20:49:36,070 INFO L87 Difference]: Start difference. First operand 366 states and 407 transitions. Second operand 29 states. [2019-11-23 20:49:42,177 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 20:49:42,178 INFO L93 Difference]: Finished difference Result 734 states and 813 transitions. [2019-11-23 20:49:42,178 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 102 states. [2019-11-23 20:49:42,178 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 61 [2019-11-23 20:49:42,179 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 20:49:42,182 INFO L225 Difference]: With dead ends: 734 [2019-11-23 20:49:42,182 INFO L226 Difference]: Without dead ends: 682 [2019-11-23 20:49:42,184 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 175 GetRequests, 48 SyntacticMatches, 3 SemanticMatches, 124 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5789 ImplicationChecksByTransitivity, 3.7s TimeCoverageRelationStatistics Valid=1939, Invalid=13811, Unknown=0, NotChecked=0, Total=15750 [2019-11-23 20:49:42,185 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 682 states. [2019-11-23 20:49:42,246 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 682 to 434. [2019-11-23 20:49:42,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 434 states. [2019-11-23 20:49:42,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 434 states to 434 states and 479 transitions. [2019-11-23 20:49:42,247 INFO L78 Accepts]: Start accepts. Automaton has 434 states and 479 transitions. Word has length 61 [2019-11-23 20:49:42,248 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 20:49:42,248 INFO L462 AbstractCegarLoop]: Abstraction has 434 states and 479 transitions. [2019-11-23 20:49:42,248 INFO L463 AbstractCegarLoop]: Interpolant automaton has 29 states. [2019-11-23 20:49:42,248 INFO L276 IsEmpty]: Start isEmpty. Operand 434 states and 479 transitions. [2019-11-23 20:49:42,249 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-11-23 20:49:42,249 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 20:49:42,249 INFO L410 BasicCegarLoop]: trace histogram [8, 8, 7, 7, 7, 7, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 20:49:42,453 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 25 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 20:49:42,453 INFO L410 AbstractCegarLoop]: === Iteration 37 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 20:49:42,453 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 20:49:42,453 INFO L82 PathProgramCache]: Analyzing trace with hash -1691168807, now seen corresponding path program 8 times [2019-11-23 20:49:42,453 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 20:49:42,454 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1600492837] [2019-11-23 20:49:42,454 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 20:49:42,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 20:49:42,750 INFO L134 CoverageAnalysis]: Checked inductivity of 163 backedges. 14 proven. 149 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 20:49:42,751 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1600492837] [2019-11-23 20:49:42,751 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [154013125] [2019-11-23 20:49:42,751 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 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 20:49:42,800 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-11-23 20:49:42,801 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-23 20:49:42,802 INFO L255 TraceCheckSpWp]: Trace formula consists of 173 conjuncts, 33 conjunts are in the unsatisfiable core [2019-11-23 20:49:42,803 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-23 20:49:42,910 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 16 treesize of output 12 [2019-11-23 20:49:42,911 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 20:49:42,922 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 20:49:42,923 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 20:49:42,923 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:32, output treesize:25 [2019-11-23 20:49:42,960 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:49:42,960 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 20:49:42,961 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 20:49:42,973 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 20:49:42,974 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 20:49:42,974 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:41, output treesize:25 [2019-11-23 20:49:42,979 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:49:42,979 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 20:49:42,979 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 20:49:42,990 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 20:49:42,991 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 20:49:42,991 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:32, output treesize:31 [2019-11-23 20:49:43,340 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:49:43,420 INFO L134 CoverageAnalysis]: Checked inductivity of 163 backedges. 14 proven. 149 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 20:49:43,420 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-23 20:49:43,421 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 17] total 33 [2019-11-23 20:49:43,421 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1978515900] [2019-11-23 20:49:43,421 INFO L442 AbstractCegarLoop]: Interpolant automaton has 33 states [2019-11-23 20:49:43,421 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 20:49:43,421 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2019-11-23 20:49:43,422 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=104, Invalid=952, Unknown=0, NotChecked=0, Total=1056 [2019-11-23 20:49:43,422 INFO L87 Difference]: Start difference. First operand 434 states and 479 transitions. Second operand 33 states. [2019-11-23 20:49:46,249 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 20:49:46,249 INFO L93 Difference]: Finished difference Result 559 states and 612 transitions. [2019-11-23 20:49:46,249 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-11-23 20:49:46,249 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 67 [2019-11-23 20:49:46,250 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 20:49:46,252 INFO L225 Difference]: With dead ends: 559 [2019-11-23 20:49:46,252 INFO L226 Difference]: Without dead ends: 549 [2019-11-23 20:49:46,253 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 53 SyntacticMatches, 1 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 667 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=387, Invalid=2805, Unknown=0, NotChecked=0, Total=3192 [2019-11-23 20:49:46,253 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 549 states. [2019-11-23 20:49:46,317 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 549 to 440. [2019-11-23 20:49:46,317 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 440 states. [2019-11-23 20:49:46,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 440 states to 440 states and 485 transitions. [2019-11-23 20:49:46,318 INFO L78 Accepts]: Start accepts. Automaton has 440 states and 485 transitions. Word has length 67 [2019-11-23 20:49:46,318 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 20:49:46,318 INFO L462 AbstractCegarLoop]: Abstraction has 440 states and 485 transitions. [2019-11-23 20:49:46,318 INFO L463 AbstractCegarLoop]: Interpolant automaton has 33 states. [2019-11-23 20:49:46,318 INFO L276 IsEmpty]: Start isEmpty. Operand 440 states and 485 transitions. [2019-11-23 20:49:46,319 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-11-23 20:49:46,319 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 20:49:46,319 INFO L410 BasicCegarLoop]: trace histogram [8, 8, 7, 7, 7, 7, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 20:49:46,521 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 26 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 20:49:46,521 INFO L410 AbstractCegarLoop]: === Iteration 38 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 20:49:46,521 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 20:49:46,522 INFO L82 PathProgramCache]: Analyzing trace with hash -1257439721, now seen corresponding path program 1 times [2019-11-23 20:49:46,522 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 20:49:46,522 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [94170094] [2019-11-23 20:49:46,522 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 20:49:46,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 20:49:46,541 INFO L134 CoverageAnalysis]: Checked inductivity of 163 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 154 trivial. 0 not checked. [2019-11-23 20:49:46,541 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [94170094] [2019-11-23 20:49:46,541 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 20:49:46,541 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 20:49:46,541 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [542781751] [2019-11-23 20:49:46,542 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 20:49:46,542 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 20:49:46,542 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 20:49:46,542 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 20:49:46,542 INFO L87 Difference]: Start difference. First operand 440 states and 485 transitions. Second operand 3 states. [2019-11-23 20:49:46,624 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 20:49:46,624 INFO L93 Difference]: Finished difference Result 525 states and 577 transitions. [2019-11-23 20:49:46,625 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 20:49:46,625 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 67 [2019-11-23 20:49:46,625 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 20:49:46,626 INFO L225 Difference]: With dead ends: 525 [2019-11-23 20:49:46,626 INFO L226 Difference]: Without dead ends: 403 [2019-11-23 20:49:46,627 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 20:49:46,627 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 403 states. [2019-11-23 20:49:46,679 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 403 to 362. [2019-11-23 20:49:46,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 362 states. [2019-11-23 20:49:46,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 362 states to 362 states and 393 transitions. [2019-11-23 20:49:46,679 INFO L78 Accepts]: Start accepts. Automaton has 362 states and 393 transitions. Word has length 67 [2019-11-23 20:49:46,680 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 20:49:46,680 INFO L462 AbstractCegarLoop]: Abstraction has 362 states and 393 transitions. [2019-11-23 20:49:46,680 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 20:49:46,680 INFO L276 IsEmpty]: Start isEmpty. Operand 362 states and 393 transitions. [2019-11-23 20:49:46,680 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-11-23 20:49:46,680 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 20:49:46,680 INFO L410 BasicCegarLoop]: trace histogram [8, 8, 7, 7, 7, 7, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 20:49:46,680 INFO L410 AbstractCegarLoop]: === Iteration 39 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 20:49:46,681 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 20:49:46,681 INFO L82 PathProgramCache]: Analyzing trace with hash 1008941465, now seen corresponding path program 5 times [2019-11-23 20:49:46,681 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 20:49:46,681 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [510878698] [2019-11-23 20:49:46,681 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 20:49:46,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 20:49:46,929 INFO L134 CoverageAnalysis]: Checked inductivity of 163 backedges. 14 proven. 149 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 20:49:46,929 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [510878698] [2019-11-23 20:49:46,929 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1264448921] [2019-11-23 20:49:46,929 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 20:49:47,000 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 8 check-sat command(s) [2019-11-23 20:49:47,000 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-23 20:49:47,001 INFO L255 TraceCheckSpWp]: Trace formula consists of 173 conjuncts, 26 conjunts are in the unsatisfiable core [2019-11-23 20:49:47,002 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-23 20:49:47,047 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 16 treesize of output 12 [2019-11-23 20:49:47,048 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 20:49:47,057 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 20:49:47,057 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-23 20:49:47,058 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:26, output treesize:22 [2019-11-23 20:49:47,118 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:49:47,119 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 26 treesize of output 25 [2019-11-23 20:49:47,119 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 20:49:47,131 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 20:49:47,131 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 20:49:47,131 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:35, output treesize:19 [2019-11-23 20:49:47,137 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:49:47,138 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 26 treesize of output 25 [2019-11-23 20:49:47,138 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 20:49:47,148 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 20:49:47,149 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 20:49:47,149 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:35, output treesize:19 [2019-11-23 20:49:47,155 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:49:47,156 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 26 treesize of output 25 [2019-11-23 20:49:47,156 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 20:49:47,167 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 20:49:47,168 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 20:49:47,168 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:35, output treesize:19 [2019-11-23 20:49:47,172 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:49:47,173 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 26 treesize of output 25 [2019-11-23 20:49:47,173 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 20:49:47,185 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 20:49:47,185 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 20:49:47,185 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:35, output treesize:19 [2019-11-23 20:49:47,193 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:49:47,194 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 26 treesize of output 25 [2019-11-23 20:49:47,195 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 20:49:47,206 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 20:49:47,207 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 20:49:47,207 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:35, output treesize:31 [2019-11-23 20:49:47,488 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:49:47,527 INFO L134 CoverageAnalysis]: Checked inductivity of 163 backedges. 86 proven. 53 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2019-11-23 20:49:47,528 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-23 20:49:47,528 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 13] total 28 [2019-11-23 20:49:47,528 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2856052] [2019-11-23 20:49:47,528 INFO L442 AbstractCegarLoop]: Interpolant automaton has 28 states [2019-11-23 20:49:47,528 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 20:49:47,529 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2019-11-23 20:49:47,529 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=689, Unknown=0, NotChecked=0, Total=756 [2019-11-23 20:49:47,529 INFO L87 Difference]: Start difference. First operand 362 states and 393 transitions. Second operand 28 states. [2019-11-23 20:49:53,082 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 20:49:53,082 INFO L93 Difference]: Finished difference Result 625 states and 668 transitions. [2019-11-23 20:49:53,083 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2019-11-23 20:49:53,083 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 67 [2019-11-23 20:49:53,089 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 20:49:53,090 INFO L225 Difference]: With dead ends: 625 [2019-11-23 20:49:53,091 INFO L226 Difference]: Without dead ends: 603 [2019-11-23 20:49:53,091 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 150 GetRequests, 57 SyntacticMatches, 2 SemanticMatches, 91 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2197 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=906, Invalid=7650, Unknown=0, NotChecked=0, Total=8556 [2019-11-23 20:49:53,091 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 603 states. [2019-11-23 20:49:53,154 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 603 to 417. [2019-11-23 20:49:53,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 417 states. [2019-11-23 20:49:53,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 417 states to 417 states and 451 transitions. [2019-11-23 20:49:53,155 INFO L78 Accepts]: Start accepts. Automaton has 417 states and 451 transitions. Word has length 67 [2019-11-23 20:49:53,155 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 20:49:53,155 INFO L462 AbstractCegarLoop]: Abstraction has 417 states and 451 transitions. [2019-11-23 20:49:53,155 INFO L463 AbstractCegarLoop]: Interpolant automaton has 28 states. [2019-11-23 20:49:53,155 INFO L276 IsEmpty]: Start isEmpty. Operand 417 states and 451 transitions. [2019-11-23 20:49:53,156 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-11-23 20:49:53,156 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 20:49:53,156 INFO L410 BasicCegarLoop]: trace histogram [8, 8, 7, 7, 7, 5, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 20:49:53,359 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 27 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 20:49:53,360 INFO L410 AbstractCegarLoop]: === Iteration 40 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 20:49:53,360 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 20:49:53,360 INFO L82 PathProgramCache]: Analyzing trace with hash 927159253, now seen corresponding path program 6 times [2019-11-23 20:49:53,361 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 20:49:53,361 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [81067686] [2019-11-23 20:49:53,361 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 20:49:53,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 20:49:53,637 INFO L134 CoverageAnalysis]: Checked inductivity of 163 backedges. 14 proven. 149 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 20:49:53,637 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [81067686] [2019-11-23 20:49:53,638 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1473831332] [2019-11-23 20:49:53,638 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 20:49:53,805 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 8 check-sat command(s) [2019-11-23 20:49:53,806 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-23 20:49:53,808 INFO L255 TraceCheckSpWp]: Trace formula consists of 179 conjuncts, 28 conjunts are in the unsatisfiable core [2019-11-23 20:49:53,810 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-23 20:49:53,890 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 16 treesize of output 12 [2019-11-23 20:49:53,890 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 20:49:53,898 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 20:49:53,898 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-23 20:49:53,899 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:26, output treesize:22 [2019-11-23 20:49:53,935 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:49:53,936 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 20:49:53,936 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 20:49:53,946 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 20:49:53,947 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 20:49:53,947 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:38, output treesize:22 [2019-11-23 20:49:53,952 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:49:53,953 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 20:49:53,953 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 20:49:53,963 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 20:49:53,963 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 20:49:53,963 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:38, output treesize:22 [2019-11-23 20:49:53,968 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:49:53,968 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 20:49:53,969 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 20:49:53,978 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 20:49:53,979 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 20:49:53,979 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:38, output treesize:22 [2019-11-23 20:49:53,983 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:49:53,984 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 20:49:53,984 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 20:49:53,991 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 20:49:53,992 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-23 20:49:53,992 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:29, output treesize:25 [2019-11-23 20:49:54,270 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:49:54,316 INFO L134 CoverageAnalysis]: Checked inductivity of 163 backedges. 74 proven. 79 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-11-23 20:49:54,316 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-23 20:49:54,316 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 14] total 29 [2019-11-23 20:49:54,316 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [292576964] [2019-11-23 20:49:54,317 INFO L442 AbstractCegarLoop]: Interpolant automaton has 29 states [2019-11-23 20:49:54,317 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 20:49:54,317 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2019-11-23 20:49:54,317 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=744, Unknown=0, NotChecked=0, Total=812 [2019-11-23 20:49:54,317 INFO L87 Difference]: Start difference. First operand 417 states and 451 transitions. Second operand 29 states.