java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/array-tiling/rewnif.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-13a467a-m [2019-10-14 21:50:35,430 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-14 21:50:35,433 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-14 21:50:35,452 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-14 21:50:35,452 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-14 21:50:35,454 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-14 21:50:35,456 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-14 21:50:35,466 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-14 21:50:35,470 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-14 21:50:35,473 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-14 21:50:35,475 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-14 21:50:35,477 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-14 21:50:35,477 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-14 21:50:35,479 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-14 21:50:35,482 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-14 21:50:35,484 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-14 21:50:35,485 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-14 21:50:35,486 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-14 21:50:35,487 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-14 21:50:35,492 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-14 21:50:35,497 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-14 21:50:35,500 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-14 21:50:35,502 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-14 21:50:35,503 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-14 21:50:35,505 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-14 21:50:35,506 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-14 21:50:35,506 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-14 21:50:35,508 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-14 21:50:35,509 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-14 21:50:35,511 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-14 21:50:35,511 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-14 21:50:35,513 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-14 21:50:35,514 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-14 21:50:35,515 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-14 21:50:35,516 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-14 21:50:35,516 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-14 21:50:35,518 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-14 21:50:35,518 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-14 21:50:35,518 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-14 21:50:35,519 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-14 21:50:35,520 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-14 21:50:35,521 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-10-14 21:50:35,554 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-14 21:50:35,555 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-14 21:50:35,559 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-14 21:50:35,559 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-14 21:50:35,560 INFO L138 SettingsManager]: * Use SBE=true [2019-10-14 21:50:35,560 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-14 21:50:35,562 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-14 21:50:35,562 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-14 21:50:35,563 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-14 21:50:35,563 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-14 21:50:35,563 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-14 21:50:35,563 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-14 21:50:35,563 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-14 21:50:35,564 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-14 21:50:35,564 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-14 21:50:35,564 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-14 21:50:35,564 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-14 21:50:35,564 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-14 21:50:35,565 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-14 21:50:35,565 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-14 21:50:35,565 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-14 21:50:35,567 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-14 21:50:35,568 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-14 21:50:35,568 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-14 21:50:35,568 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-14 21:50:35,568 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-14 21:50:35,568 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-14 21:50:35,569 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-14 21:50:35,569 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-10-14 21:50:35,894 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-14 21:50:35,915 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-14 21:50:35,920 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-14 21:50:35,921 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-14 21:50:35,922 INFO L275 PluginConnector]: CDTParser initialized [2019-10-14 21:50:35,923 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-tiling/rewnif.c [2019-10-14 21:50:35,995 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/210324e6e/db32ca3499c9409699111559a334e3f8/FLAG22f01914c [2019-10-14 21:50:36,419 INFO L306 CDTParser]: Found 1 translation units. [2019-10-14 21:50:36,420 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/array-tiling/rewnif.c [2019-10-14 21:50:36,428 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/210324e6e/db32ca3499c9409699111559a334e3f8/FLAG22f01914c [2019-10-14 21:50:36,833 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/210324e6e/db32ca3499c9409699111559a334e3f8 [2019-10-14 21:50:36,843 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-14 21:50:36,845 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-14 21:50:36,850 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-14 21:50:36,850 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-14 21:50:36,854 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-14 21:50:36,855 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 09:50:36" (1/1) ... [2019-10-14 21:50:36,858 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@247dfb19 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 09:50:36, skipping insertion in model container [2019-10-14 21:50:36,858 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 09:50:36" (1/1) ... [2019-10-14 21:50:36,867 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-14 21:50:36,889 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-14 21:50:37,115 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-14 21:50:37,132 INFO L188 MainTranslator]: Completed pre-run [2019-10-14 21:50:37,159 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-14 21:50:37,179 INFO L192 MainTranslator]: Completed translation [2019-10-14 21:50:37,180 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 09:50:37 WrapperNode [2019-10-14 21:50:37,180 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-14 21:50:37,181 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-14 21:50:37,181 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-14 21:50:37,181 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-14 21:50:37,280 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 09:50:37" (1/1) ... [2019-10-14 21:50:37,281 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 09:50:37" (1/1) ... [2019-10-14 21:50:37,290 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 09:50:37" (1/1) ... [2019-10-14 21:50:37,290 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 09:50:37" (1/1) ... [2019-10-14 21:50:37,311 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 09:50:37" (1/1) ... [2019-10-14 21:50:37,316 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 09:50:37" (1/1) ... [2019-10-14 21:50:37,317 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 09:50:37" (1/1) ... [2019-10-14 21:50:37,319 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-14 21:50:37,319 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-14 21:50:37,320 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-14 21:50:37,320 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-14 21:50:37,321 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 09:50:37" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-14 21:50:37,379 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-14 21:50:37,379 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-14 21:50:37,379 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2019-10-14 21:50:37,380 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-14 21:50:37,380 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-14 21:50:37,380 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-10-14 21:50:37,380 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2019-10-14 21:50:37,380 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-10-14 21:50:37,381 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-10-14 21:50:37,381 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-14 21:50:37,382 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-10-14 21:50:37,382 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-10-14 21:50:37,383 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-10-14 21:50:37,383 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-14 21:50:37,384 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-14 21:50:37,384 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-10-14 21:50:37,683 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-14 21:50:37,683 INFO L284 CfgBuilder]: Removed 2 assume(true) statements. [2019-10-14 21:50:37,685 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 09:50:37 BoogieIcfgContainer [2019-10-14 21:50:37,685 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-14 21:50:37,686 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-14 21:50:37,686 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-14 21:50:37,689 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-14 21:50:37,690 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.10 09:50:36" (1/3) ... [2019-10-14 21:50:37,691 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5eb4539f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 09:50:37, skipping insertion in model container [2019-10-14 21:50:37,691 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 09:50:37" (2/3) ... [2019-10-14 21:50:37,691 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5eb4539f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 09:50:37, skipping insertion in model container [2019-10-14 21:50:37,691 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 09:50:37" (3/3) ... [2019-10-14 21:50:37,693 INFO L109 eAbstractionObserver]: Analyzing ICFG rewnif.c [2019-10-14 21:50:37,703 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-14 21:50:37,709 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-14 21:50:37,719 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-14 21:50:37,743 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-10-14 21:50:37,743 INFO L374 AbstractCegarLoop]: Hoare is true [2019-10-14 21:50:37,743 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-14 21:50:37,743 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-14 21:50:37,743 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-14 21:50:37,744 INFO L378 AbstractCegarLoop]: Difference is false [2019-10-14 21:50:37,744 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-14 21:50:37,744 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-14 21:50:37,758 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states. [2019-10-14 21:50:37,764 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-10-14 21:50:37,764 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 21:50:37,765 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 21:50:37,767 INFO L410 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 21:50:37,772 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 21:50:37,772 INFO L82 PathProgramCache]: Analyzing trace with hash 1294486485, now seen corresponding path program 1 times [2019-10-14 21:50:37,779 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 21:50:37,780 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2058187769] [2019-10-14 21:50:37,780 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 21:50:37,780 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 21:50:37,780 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 21:50:37,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 21:50:37,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 21:50:37,984 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-14 21:50:37,985 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2058187769] [2019-10-14 21:50:37,988 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 21:50:37,988 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-14 21:50:37,989 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [552061736] [2019-10-14 21:50:37,992 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-14 21:50:37,993 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 21:50:38,002 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-14 21:50:38,003 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-14 21:50:38,005 INFO L87 Difference]: Start difference. First operand 27 states. Second operand 3 states. [2019-10-14 21:50:38,108 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 21:50:38,108 INFO L93 Difference]: Finished difference Result 43 states and 52 transitions. [2019-10-14 21:50:38,109 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-14 21:50:38,110 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 14 [2019-10-14 21:50:38,111 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 21:50:38,119 INFO L225 Difference]: With dead ends: 43 [2019-10-14 21:50:38,120 INFO L226 Difference]: Without dead ends: 22 [2019-10-14 21:50:38,123 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-14 21:50:38,138 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2019-10-14 21:50:38,154 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2019-10-14 21:50:38,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2019-10-14 21:50:38,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 24 transitions. [2019-10-14 21:50:38,158 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 24 transitions. Word has length 14 [2019-10-14 21:50:38,158 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 21:50:38,158 INFO L462 AbstractCegarLoop]: Abstraction has 22 states and 24 transitions. [2019-10-14 21:50:38,159 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-14 21:50:38,159 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 24 transitions. [2019-10-14 21:50:38,159 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-10-14 21:50:38,160 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 21:50:38,160 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 21:50:38,160 INFO L410 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 21:50:38,160 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 21:50:38,161 INFO L82 PathProgramCache]: Analyzing trace with hash -1653126776, now seen corresponding path program 1 times [2019-10-14 21:50:38,161 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 21:50:38,161 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1203108840] [2019-10-14 21:50:38,161 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 21:50:38,162 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 21:50:38,162 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 21:50:38,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 21:50:38,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 21:50:38,286 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-14 21:50:38,286 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1203108840] [2019-10-14 21:50:38,287 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 21:50:38,287 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-14 21:50:38,287 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [245149734] [2019-10-14 21:50:38,289 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-14 21:50:38,289 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 21:50:38,290 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-14 21:50:38,290 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-14 21:50:38,291 INFO L87 Difference]: Start difference. First operand 22 states and 24 transitions. Second operand 4 states. [2019-10-14 21:50:38,387 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 21:50:38,388 INFO L93 Difference]: Finished difference Result 41 states and 47 transitions. [2019-10-14 21:50:38,388 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-14 21:50:38,389 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2019-10-14 21:50:38,389 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 21:50:38,390 INFO L225 Difference]: With dead ends: 41 [2019-10-14 21:50:38,390 INFO L226 Difference]: Without dead ends: 26 [2019-10-14 21:50:38,392 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-14 21:50:38,392 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2019-10-14 21:50:38,398 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 24. [2019-10-14 21:50:38,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2019-10-14 21:50:38,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 26 transitions. [2019-10-14 21:50:38,400 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 26 transitions. Word has length 14 [2019-10-14 21:50:38,400 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 21:50:38,400 INFO L462 AbstractCegarLoop]: Abstraction has 24 states and 26 transitions. [2019-10-14 21:50:38,401 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-14 21:50:38,401 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 26 transitions. [2019-10-14 21:50:38,402 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-10-14 21:50:38,402 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 21:50:38,402 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 21:50:38,402 INFO L410 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 21:50:38,403 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 21:50:38,403 INFO L82 PathProgramCache]: Analyzing trace with hash -1007604157, now seen corresponding path program 1 times [2019-10-14 21:50:38,403 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 21:50:38,404 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [161633451] [2019-10-14 21:50:38,404 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 21:50:38,404 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 21:50:38,404 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 21:50:38,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 21:50:38,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 21:50:38,513 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-14 21:50:38,513 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [161633451] [2019-10-14 21:50:38,514 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 21:50:38,514 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-14 21:50:38,514 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1508930157] [2019-10-14 21:50:38,515 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-14 21:50:38,515 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 21:50:38,515 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-14 21:50:38,516 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-10-14 21:50:38,516 INFO L87 Difference]: Start difference. First operand 24 states and 26 transitions. Second operand 5 states. [2019-10-14 21:50:38,606 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 21:50:38,607 INFO L93 Difference]: Finished difference Result 38 states and 41 transitions. [2019-10-14 21:50:38,607 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-14 21:50:38,607 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 18 [2019-10-14 21:50:38,608 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 21:50:38,608 INFO L225 Difference]: With dead ends: 38 [2019-10-14 21:50:38,609 INFO L226 Difference]: Without dead ends: 27 [2019-10-14 21:50:38,609 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-10-14 21:50:38,610 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2019-10-14 21:50:38,615 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2019-10-14 21:50:38,615 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2019-10-14 21:50:38,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 29 transitions. [2019-10-14 21:50:38,617 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 29 transitions. Word has length 18 [2019-10-14 21:50:38,617 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 21:50:38,617 INFO L462 AbstractCegarLoop]: Abstraction has 27 states and 29 transitions. [2019-10-14 21:50:38,617 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-14 21:50:38,618 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 29 transitions. [2019-10-14 21:50:38,618 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-10-14 21:50:38,619 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 21:50:38,619 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 21:50:38,619 INFO L410 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 21:50:38,620 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 21:50:38,620 INFO L82 PathProgramCache]: Analyzing trace with hash -2051596356, now seen corresponding path program 1 times [2019-10-14 21:50:38,620 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 21:50:38,621 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1504544434] [2019-10-14 21:50:38,621 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 21:50:38,621 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 21:50:38,621 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 21:50:38,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 21:50:38,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 21:50:38,989 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-14 21:50:38,990 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1504544434] [2019-10-14 21:50:38,990 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1541358064] [2019-10-14 21:50:38,991 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-10-14 21:50:39,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 21:50:39,043 INFO L256 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 14 conjunts are in the unsatisfiable core [2019-10-14 21:50:39,050 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-14 21:50:39,128 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2019-10-14 21:50:39,129 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 21:50:39,138 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 21:50:39,139 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-14 21:50:39,139 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:19, output treesize:15 [2019-10-14 21:50:39,209 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 21:50:39,210 INFO L375 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 46 [2019-10-14 21:50:39,211 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 21:50:39,230 INFO L567 ElimStorePlain]: treesize reduction 24, result has 47.8 percent of original size [2019-10-14 21:50:39,231 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-10-14 21:50:39,232 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:26, output treesize:22 [2019-10-14 21:50:39,315 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 21:50:39,315 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 30 treesize of output 50 [2019-10-14 21:50:39,317 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 21:50:39,317 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 21:50:39,321 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 21:50:39,343 INFO L567 ElimStorePlain]: treesize reduction 51, result has 16.4 percent of original size [2019-10-14 21:50:39,344 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-14 21:50:39,344 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:36, output treesize:7 [2019-10-14 21:50:39,364 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 21:50:39,397 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-14 21:50:39,397 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-14 21:50:39,398 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 18 [2019-10-14 21:50:39,398 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [466805948] [2019-10-14 21:50:39,398 INFO L442 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-10-14 21:50:39,399 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 21:50:39,399 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-10-14 21:50:39,400 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=256, Unknown=0, NotChecked=0, Total=306 [2019-10-14 21:50:39,400 INFO L87 Difference]: Start difference. First operand 27 states and 29 transitions. Second operand 18 states. [2019-10-14 21:50:39,785 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 21:50:39,786 INFO L93 Difference]: Finished difference Result 42 states and 45 transitions. [2019-10-14 21:50:39,786 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-10-14 21:50:39,786 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 22 [2019-10-14 21:50:39,787 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 21:50:39,788 INFO L225 Difference]: With dead ends: 42 [2019-10-14 21:50:39,788 INFO L226 Difference]: Without dead ends: 40 [2019-10-14 21:50:39,789 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 16 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 129 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=103, Invalid=497, Unknown=0, NotChecked=0, Total=600 [2019-10-14 21:50:39,789 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2019-10-14 21:50:39,796 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 33. [2019-10-14 21:50:39,796 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2019-10-14 21:50:39,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 35 transitions. [2019-10-14 21:50:39,798 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 35 transitions. Word has length 22 [2019-10-14 21:50:39,798 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 21:50:39,798 INFO L462 AbstractCegarLoop]: Abstraction has 33 states and 35 transitions. [2019-10-14 21:50:39,799 INFO L463 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-10-14 21:50:39,799 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 35 transitions. [2019-10-14 21:50:39,800 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-10-14 21:50:39,800 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 21:50:39,800 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 21:50:40,003 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-14 21:50:40,004 INFO L410 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 21:50:40,004 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 21:50:40,005 INFO L82 PathProgramCache]: Analyzing trace with hash -730987952, now seen corresponding path program 1 times [2019-10-14 21:50:40,005 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 21:50:40,006 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2031791307] [2019-10-14 21:50:40,006 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 21:50:40,006 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 21:50:40,007 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 21:50:40,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 21:50:40,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 21:50:40,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 21:50:40,293 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 2 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-14 21:50:40,294 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2031791307] [2019-10-14 21:50:40,294 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [430796285] [2019-10-14 21:50:40,294 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-10-14 21:50:40,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 21:50:40,347 INFO L256 TraceCheckSpWp]: Trace formula consists of 104 conjuncts, 21 conjunts are in the unsatisfiable core [2019-10-14 21:50:40,349 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-14 21:50:40,358 INFO L375 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-10-14 21:50:40,359 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 21:50:40,363 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 21:50:40,363 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-14 21:50:40,363 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:9 [2019-10-14 21:50:42,488 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 7 [2019-10-14 21:50:42,489 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 21:50:42,493 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 21:50:42,493 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-14 21:50:42,494 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:26, output treesize:7 [2019-10-14 21:50:42,513 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 21:50:42,548 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-14 21:50:42,549 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-14 21:50:42,549 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 13] total 18 [2019-10-14 21:50:42,549 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1254057669] [2019-10-14 21:50:42,550 INFO L442 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-10-14 21:50:42,550 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 21:50:42,552 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-10-14 21:50:42,552 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=258, Unknown=1, NotChecked=0, Total=306 [2019-10-14 21:50:42,552 INFO L87 Difference]: Start difference. First operand 33 states and 35 transitions. Second operand 18 states. [2019-10-14 21:50:43,561 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 21:50:43,562 INFO L93 Difference]: Finished difference Result 81 states and 87 transitions. [2019-10-14 21:50:43,562 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-10-14 21:50:43,562 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 30 [2019-10-14 21:50:43,563 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 21:50:43,566 INFO L225 Difference]: With dead ends: 81 [2019-10-14 21:50:43,566 INFO L226 Difference]: Without dead ends: 79 [2019-10-14 21:50:43,567 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 28 SyntacticMatches, 2 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 112 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=104, Invalid=495, Unknown=1, NotChecked=0, Total=600 [2019-10-14 21:50:43,567 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2019-10-14 21:50:43,582 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 53. [2019-10-14 21:50:43,582 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2019-10-14 21:50:43,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 58 transitions. [2019-10-14 21:50:43,584 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 58 transitions. Word has length 30 [2019-10-14 21:50:43,584 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 21:50:43,584 INFO L462 AbstractCegarLoop]: Abstraction has 53 states and 58 transitions. [2019-10-14 21:50:43,584 INFO L463 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-10-14 21:50:43,585 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 58 transitions. [2019-10-14 21:50:43,586 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2019-10-14 21:50:43,586 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 21:50:43,586 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 21:50:43,790 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-14 21:50:43,790 INFO L410 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 21:50:43,791 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 21:50:43,791 INFO L82 PathProgramCache]: Analyzing trace with hash 783487204, now seen corresponding path program 2 times [2019-10-14 21:50:43,791 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 21:50:43,792 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [452096769] [2019-10-14 21:50:43,792 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 21:50:43,793 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 21:50:43,793 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 21:50:43,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 21:50:43,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 21:50:43,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 21:50:43,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 21:50:43,949 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 7 proven. 11 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-10-14 21:50:43,950 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [452096769] [2019-10-14 21:50:43,950 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [723991151] [2019-10-14 21:50:43,950 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 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-14 21:50:43,994 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-10-14 21:50:43,994 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-14 21:50:43,995 INFO L256 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 7 conjunts are in the unsatisfiable core [2019-10-14 21:50:43,998 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-14 21:50:44,073 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 12 proven. 6 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-10-14 21:50:44,073 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-14 21:50:44,073 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 13 [2019-10-14 21:50:44,074 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [944386362] [2019-10-14 21:50:44,075 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-10-14 21:50:44,075 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 21:50:44,075 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-10-14 21:50:44,076 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=115, Unknown=0, NotChecked=0, Total=156 [2019-10-14 21:50:44,076 INFO L87 Difference]: Start difference. First operand 53 states and 58 transitions. Second operand 13 states. [2019-10-14 21:50:44,366 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 21:50:44,367 INFO L93 Difference]: Finished difference Result 119 states and 131 transitions. [2019-10-14 21:50:44,367 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-10-14 21:50:44,367 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 38 [2019-10-14 21:50:44,367 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 21:50:44,370 INFO L225 Difference]: With dead ends: 119 [2019-10-14 21:50:44,370 INFO L226 Difference]: Without dead ends: 61 [2019-10-14 21:50:44,371 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=64, Invalid=208, Unknown=0, NotChecked=0, Total=272 [2019-10-14 21:50:44,371 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2019-10-14 21:50:44,379 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 53. [2019-10-14 21:50:44,380 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2019-10-14 21:50:44,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 55 transitions. [2019-10-14 21:50:44,381 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 55 transitions. Word has length 38 [2019-10-14 21:50:44,381 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 21:50:44,382 INFO L462 AbstractCegarLoop]: Abstraction has 53 states and 55 transitions. [2019-10-14 21:50:44,382 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-10-14 21:50:44,382 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 55 transitions. [2019-10-14 21:50:44,383 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2019-10-14 21:50:44,383 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 21:50:44,383 INFO L380 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 21:50:44,586 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-14 21:50:44,590 INFO L410 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 21:50:44,590 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 21:50:44,590 INFO L82 PathProgramCache]: Analyzing trace with hash -1123005882, now seen corresponding path program 3 times [2019-10-14 21:50:44,590 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 21:50:44,590 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [317745842] [2019-10-14 21:50:44,591 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 21:50:44,591 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 21:50:44,591 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 21:50:44,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 21:50:44,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 21:50:44,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 21:50:44,814 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 3 proven. 29 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-14 21:50:44,814 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [317745842] [2019-10-14 21:50:44,815 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1880348390] [2019-10-14 21:50:44,815 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 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-14 21:50:44,873 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2019-10-14 21:50:44,873 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-14 21:50:44,875 INFO L256 TraceCheckSpWp]: Trace formula consists of 116 conjuncts, 36 conjunts are in the unsatisfiable core [2019-10-14 21:50:44,878 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-14 21:50:44,935 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2019-10-14 21:50:44,936 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 21:50:44,941 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 21:50:44,942 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-14 21:50:44,942 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:18 [2019-10-14 21:50:45,009 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 21:50:45,011 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 25 [2019-10-14 21:50:45,012 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 21:50:45,019 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 21:50:45,019 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-14 21:50:45,019 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:32, output treesize:28 [2019-10-14 21:50:45,057 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 21:50:45,059 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 21:50:45,061 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 21:50:45,062 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 21:50:45,063 INFO L375 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 37 treesize of output 39 [2019-10-14 21:50:45,064 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 21:50:45,073 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 21:50:45,074 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-14 21:50:45,074 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:43, output treesize:39 [2019-10-14 21:50:45,184 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 21:50:45,185 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 21:50:45,185 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 21:50:45,186 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 21:50:45,187 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 45 treesize of output 41 [2019-10-14 21:50:45,189 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 21:50:45,199 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 21:50:45,199 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-14 21:50:45,200 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:48, output treesize:31 [2019-10-14 21:50:45,466 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 21:50:45,467 INFO L172 IndexEqualityManager]: detected equality via solver [2019-10-14 21:50:45,469 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 21:50:45,470 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 31 treesize of output 16 [2019-10-14 21:50:45,470 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 21:50:45,474 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 21:50:45,475 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-14 21:50:45,475 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:34, output treesize:7 [2019-10-14 21:50:45,497 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 21:50:45,562 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 32 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-14 21:50:45,563 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-14 21:50:45,563 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 19] total 31 [2019-10-14 21:50:45,563 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [617700541] [2019-10-14 21:50:45,564 INFO L442 AbstractCegarLoop]: Interpolant automaton has 31 states [2019-10-14 21:50:45,564 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 21:50:45,564 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2019-10-14 21:50:45,565 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=126, Invalid=804, Unknown=0, NotChecked=0, Total=930 [2019-10-14 21:50:45,565 INFO L87 Difference]: Start difference. First operand 53 states and 55 transitions. Second operand 31 states. [2019-10-14 21:50:47,230 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 21:50:47,231 INFO L93 Difference]: Finished difference Result 118 states and 125 transitions. [2019-10-14 21:50:47,231 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2019-10-14 21:50:47,231 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 38 [2019-10-14 21:50:47,232 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 21:50:47,235 INFO L225 Difference]: With dead ends: 118 [2019-10-14 21:50:47,236 INFO L226 Difference]: Without dead ends: 116 [2019-10-14 21:50:47,237 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 26 SyntacticMatches, 3 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 785 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=326, Invalid=2326, Unknown=0, NotChecked=0, Total=2652 [2019-10-14 21:50:47,238 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2019-10-14 21:50:47,252 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 83. [2019-10-14 21:50:47,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. [2019-10-14 21:50:47,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 89 transitions. [2019-10-14 21:50:47,254 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 89 transitions. Word has length 38 [2019-10-14 21:50:47,254 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 21:50:47,255 INFO L462 AbstractCegarLoop]: Abstraction has 83 states and 89 transitions. [2019-10-14 21:50:47,255 INFO L463 AbstractCegarLoop]: Interpolant automaton has 31 states. [2019-10-14 21:50:47,255 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 89 transitions. [2019-10-14 21:50:47,257 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-10-14 21:50:47,257 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 21:50:47,257 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 21:50:47,465 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-14 21:50:47,466 INFO L410 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 21:50:47,467 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 21:50:47,467 INFO L82 PathProgramCache]: Analyzing trace with hash 1309226143, now seen corresponding path program 4 times [2019-10-14 21:50:47,467 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 21:50:47,468 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1450330802] [2019-10-14 21:50:47,468 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 21:50:47,468 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 21:50:47,469 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 21:50:47,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 21:50:47,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 21:50:47,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 21:50:47,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 21:50:47,667 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 4 proven. 23 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-10-14 21:50:47,668 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1450330802] [2019-10-14 21:50:47,668 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2014175880] [2019-10-14 21:50:47,668 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 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-14 21:50:47,717 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-10-14 21:50:47,717 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-14 21:50:47,718 INFO L256 TraceCheckSpWp]: Trace formula consists of 112 conjuncts, 25 conjunts are in the unsatisfiable core [2019-10-14 21:50:47,721 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-14 21:50:47,748 INFO L375 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-10-14 21:50:47,748 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 21:50:47,750 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 21:50:47,750 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-14 21:50:47,750 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:9 [2019-10-14 21:50:47,927 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 7 [2019-10-14 21:50:47,928 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 21:50:47,933 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 21:50:47,933 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-14 21:50:47,933 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:28, output treesize:9 [2019-10-14 21:50:47,952 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 21:50:47,985 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-10-14 21:50:47,986 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-14 21:50:47,986 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 15] total 23 [2019-10-14 21:50:47,986 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1727633333] [2019-10-14 21:50:47,987 INFO L442 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-10-14 21:50:47,987 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 21:50:47,987 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-10-14 21:50:47,988 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=437, Unknown=0, NotChecked=0, Total=506 [2019-10-14 21:50:47,988 INFO L87 Difference]: Start difference. First operand 83 states and 89 transitions. Second operand 23 states. [2019-10-14 21:50:49,189 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 21:50:49,189 INFO L93 Difference]: Finished difference Result 159 states and 167 transitions. [2019-10-14 21:50:49,190 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-10-14 21:50:49,190 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 42 [2019-10-14 21:50:49,190 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 21:50:49,191 INFO L225 Difference]: With dead ends: 159 [2019-10-14 21:50:49,191 INFO L226 Difference]: Without dead ends: 157 [2019-10-14 21:50:49,192 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 35 SyntacticMatches, 6 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 301 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=170, Invalid=1090, Unknown=0, NotChecked=0, Total=1260 [2019-10-14 21:50:49,193 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states. [2019-10-14 21:50:49,212 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 125. [2019-10-14 21:50:49,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 125 states. [2019-10-14 21:50:49,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 132 transitions. [2019-10-14 21:50:49,214 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 132 transitions. Word has length 42 [2019-10-14 21:50:49,214 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 21:50:49,215 INFO L462 AbstractCegarLoop]: Abstraction has 125 states and 132 transitions. [2019-10-14 21:50:49,215 INFO L463 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-10-14 21:50:49,215 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 132 transitions. [2019-10-14 21:50:49,216 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-10-14 21:50:49,216 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 21:50:49,217 INFO L380 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 21:50:49,420 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-14 21:50:49,421 INFO L410 AbstractCegarLoop]: === Iteration 9 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 21:50:49,421 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 21:50:49,422 INFO L82 PathProgramCache]: Analyzing trace with hash -65371085, now seen corresponding path program 5 times [2019-10-14 21:50:49,422 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 21:50:49,422 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [656136487] [2019-10-14 21:50:49,423 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 21:50:49,423 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 21:50:49,423 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 21:50:49,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 21:50:49,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 21:50:49,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 21:50:49,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 21:50:49,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 21:50:49,568 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 15 proven. 24 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2019-10-14 21:50:49,569 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [656136487] [2019-10-14 21:50:49,569 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2098170125] [2019-10-14 21:50:49,569 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 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-14 21:50:49,630 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2019-10-14 21:50:49,630 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-14 21:50:49,631 INFO L256 TraceCheckSpWp]: Trace formula consists of 140 conjuncts, 9 conjunts are in the unsatisfiable core [2019-10-14 21:50:49,634 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-14 21:50:49,701 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 24 proven. 15 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2019-10-14 21:50:49,701 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-14 21:50:49,702 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10] total 16 [2019-10-14 21:50:49,702 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [749135239] [2019-10-14 21:50:49,702 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-10-14 21:50:49,703 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 21:50:49,703 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-10-14 21:50:49,703 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=180, Unknown=0, NotChecked=0, Total=240 [2019-10-14 21:50:49,703 INFO L87 Difference]: Start difference. First operand 125 states and 132 transitions. Second operand 16 states. [2019-10-14 21:50:50,010 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 21:50:50,011 INFO L93 Difference]: Finished difference Result 158 states and 166 transitions. [2019-10-14 21:50:50,011 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-10-14 21:50:50,011 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 50 [2019-10-14 21:50:50,012 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 21:50:50,013 INFO L225 Difference]: With dead ends: 158 [2019-10-14 21:50:50,013 INFO L226 Difference]: Without dead ends: 119 [2019-10-14 21:50:50,014 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 85 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=95, Invalid=325, Unknown=0, NotChecked=0, Total=420 [2019-10-14 21:50:50,014 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2019-10-14 21:50:50,038 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 113. [2019-10-14 21:50:50,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 113 states. [2019-10-14 21:50:50,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 119 transitions. [2019-10-14 21:50:50,043 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 119 transitions. Word has length 50 [2019-10-14 21:50:50,043 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 21:50:50,043 INFO L462 AbstractCegarLoop]: Abstraction has 113 states and 119 transitions. [2019-10-14 21:50:50,043 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-10-14 21:50:50,044 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 119 transitions. [2019-10-14 21:50:50,045 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-10-14 21:50:50,045 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 21:50:50,045 INFO L380 BasicCegarLoop]: trace histogram [6, 6, 6, 5, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 21:50:50,245 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-14 21:50:50,246 INFO L410 AbstractCegarLoop]: === Iteration 10 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 21:50:50,246 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 21:50:50,247 INFO L82 PathProgramCache]: Analyzing trace with hash -833577264, now seen corresponding path program 6 times [2019-10-14 21:50:50,247 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 21:50:50,247 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [255816925] [2019-10-14 21:50:50,248 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 21:50:50,248 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 21:50:50,248 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 21:50:50,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 21:50:50,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 21:50:50,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 21:50:50,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 21:50:50,586 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 9 proven. 69 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-10-14 21:50:50,588 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [255816925] [2019-10-14 21:50:50,588 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1240437327] [2019-10-14 21:50:50,588 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 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-14 21:50:50,710 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2019-10-14 21:50:50,711 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-14 21:50:50,712 INFO L256 TraceCheckSpWp]: Trace formula consists of 143 conjuncts, 37 conjunts are in the unsatisfiable core [2019-10-14 21:50:50,716 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-14 21:50:50,785 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2019-10-14 21:50:50,786 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 21:50:50,792 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 21:50:50,792 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-14 21:50:50,792 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:18 [2019-10-14 21:50:50,849 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 21:50:50,850 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 30 [2019-10-14 21:50:50,851 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 21:50:50,858 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 21:50:50,858 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-14 21:50:50,858 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:37, output treesize:33 [2019-10-14 21:50:50,896 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 21:50:50,897 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 21:50:50,900 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 21:50:50,902 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 21:50:50,902 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 44 [2019-10-14 21:50:50,903 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 21:50:50,912 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 21:50:50,912 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-14 21:50:50,913 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:48, output treesize:44 [2019-10-14 21:50:50,989 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 21:50:50,990 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 21:50:50,991 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 21:50:50,993 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 21:50:50,994 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 21:50:50,995 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 21:50:50,996 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 21:50:50,996 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 44 treesize of output 49 [2019-10-14 21:50:50,997 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 21:50:51,009 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 21:50:51,009 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-14 21:50:51,010 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:50, output treesize:46 [2019-10-14 21:50:51,060 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 21:50:51,062 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 21:50:51,063 INFO L172 IndexEqualityManager]: detected equality via solver [2019-10-14 21:50:51,064 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 21:50:51,065 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 21:50:51,066 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 21:50:51,067 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 21:50:51,068 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 21:50:51,069 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 55 treesize of output 63 [2019-10-14 21:50:51,069 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 21:50:51,089 INFO L567 ElimStorePlain]: treesize reduction 9, result has 84.2 percent of original size [2019-10-14 21:50:51,089 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-14 21:50:51,090 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:61, output treesize:48 [2019-10-14 21:50:51,179 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 21:50:51,180 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 21:50:51,181 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 21:50:51,184 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 21:50:51,185 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 21:50:51,185 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 21:50:51,186 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 21:50:51,187 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 50 treesize of output 49 [2019-10-14 21:50:51,188 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 21:50:51,201 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 21:50:51,201 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-14 21:50:51,201 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:53, output treesize:40 [2019-10-14 21:50:51,539 INFO L172 IndexEqualityManager]: detected equality via solver [2019-10-14 21:50:51,540 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 21:50:51,540 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 21:50:51,541 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 21:50:51,542 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 21:50:51,543 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 6 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 38 treesize of output 19 [2019-10-14 21:50:51,544 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 21:50:51,547 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 21:50:51,547 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-14 21:50:51,547 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:41, output treesize:7 [2019-10-14 21:50:51,573 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 21:50:51,639 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 0 proven. 78 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-10-14 21:50:51,639 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-14 21:50:51,639 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 21] total 36 [2019-10-14 21:50:51,639 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1514807100] [2019-10-14 21:50:51,640 INFO L442 AbstractCegarLoop]: Interpolant automaton has 36 states [2019-10-14 21:50:51,640 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 21:50:51,641 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2019-10-14 21:50:51,641 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=156, Invalid=1104, Unknown=0, NotChecked=0, Total=1260 [2019-10-14 21:50:51,641 INFO L87 Difference]: Start difference. First operand 113 states and 119 transitions. Second operand 36 states. [2019-10-14 21:50:53,882 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 21:50:53,883 INFO L93 Difference]: Finished difference Result 192 states and 204 transitions. [2019-10-14 21:50:53,884 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2019-10-14 21:50:53,884 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 54 [2019-10-14 21:50:53,885 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 21:50:53,886 INFO L225 Difference]: With dead ends: 192 [2019-10-14 21:50:53,887 INFO L226 Difference]: Without dead ends: 190 [2019-10-14 21:50:53,888 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 40 SyntacticMatches, 7 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1008 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=360, Invalid=2946, Unknown=0, NotChecked=0, Total=3306 [2019-10-14 21:50:53,888 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 190 states. [2019-10-14 21:50:53,905 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 190 to 141. [2019-10-14 21:50:53,905 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 141 states. [2019-10-14 21:50:53,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 150 transitions. [2019-10-14 21:50:53,906 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 150 transitions. Word has length 54 [2019-10-14 21:50:53,907 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 21:50:53,907 INFO L462 AbstractCegarLoop]: Abstraction has 141 states and 150 transitions. [2019-10-14 21:50:53,907 INFO L463 AbstractCegarLoop]: Interpolant automaton has 36 states. [2019-10-14 21:50:53,907 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 150 transitions. [2019-10-14 21:50:53,908 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2019-10-14 21:50:53,908 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 21:50:53,909 INFO L380 BasicCegarLoop]: trace histogram [5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 21:50:54,116 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-14 21:50:54,116 INFO L410 AbstractCegarLoop]: === Iteration 11 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 21:50:54,116 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 21:50:54,116 INFO L82 PathProgramCache]: Analyzing trace with hash 345962498, now seen corresponding path program 7 times [2019-10-14 21:50:54,116 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 21:50:54,117 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [96184282] [2019-10-14 21:50:54,117 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 21:50:54,117 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 21:50:54,117 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 21:50:54,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 21:50:54,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 21:50:54,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 21:50:54,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 21:50:54,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 21:50:54,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 21:50:54,255 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 27 proven. 41 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2019-10-14 21:50:54,258 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [96184282] [2019-10-14 21:50:54,258 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [756785657] [2019-10-14 21:50:54,258 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 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-14 21:50:54,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 21:50:54,312 INFO L256 TraceCheckSpWp]: Trace formula consists of 161 conjuncts, 11 conjunts are in the unsatisfiable core [2019-10-14 21:50:54,326 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-14 21:50:54,427 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 40 proven. 28 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2019-10-14 21:50:54,427 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-14 21:50:54,428 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12] total 19 [2019-10-14 21:50:54,428 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [786448537] [2019-10-14 21:50:54,428 INFO L442 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-10-14 21:50:54,429 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 21:50:54,429 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-10-14 21:50:54,429 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=259, Unknown=0, NotChecked=0, Total=342 [2019-10-14 21:50:54,429 INFO L87 Difference]: Start difference. First operand 141 states and 150 transitions. Second operand 19 states. [2019-10-14 21:50:54,810 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 21:50:54,810 INFO L93 Difference]: Finished difference Result 190 states and 201 transitions. [2019-10-14 21:50:54,810 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-10-14 21:50:54,811 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 62 [2019-10-14 21:50:54,811 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 21:50:54,812 INFO L225 Difference]: With dead ends: 190 [2019-10-14 21:50:54,812 INFO L226 Difference]: Without dead ends: 147 [2019-10-14 21:50:54,813 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 66 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 130 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=133, Invalid=467, Unknown=0, NotChecked=0, Total=600 [2019-10-14 21:50:54,814 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2019-10-14 21:50:54,830 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 141. [2019-10-14 21:50:54,831 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 141 states. [2019-10-14 21:50:54,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 149 transitions. [2019-10-14 21:50:54,832 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 149 transitions. Word has length 62 [2019-10-14 21:50:54,832 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 21:50:54,832 INFO L462 AbstractCegarLoop]: Abstraction has 141 states and 149 transitions. [2019-10-14 21:50:54,832 INFO L463 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-10-14 21:50:54,832 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 149 transitions. [2019-10-14 21:50:54,834 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-10-14 21:50:54,834 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 21:50:54,834 INFO L380 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 21:50:55,044 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-14 21:50:55,045 INFO L410 AbstractCegarLoop]: === Iteration 12 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 21:50:55,045 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 21:50:55,045 INFO L82 PathProgramCache]: Analyzing trace with hash 1002724029, now seen corresponding path program 8 times [2019-10-14 21:50:55,045 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 21:50:55,046 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [493991647] [2019-10-14 21:50:55,046 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 21:50:55,046 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 21:50:55,046 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 21:50:55,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 21:50:55,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 21:50:55,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 21:50:55,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 21:50:55,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 21:50:55,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 21:50:55,513 INFO L134 CoverageAnalysis]: Checked inductivity of 109 backedges. 8 proven. 77 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2019-10-14 21:50:55,513 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [493991647] [2019-10-14 21:50:55,513 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1908355370] [2019-10-14 21:50:55,514 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-10-14 21:50:55,600 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-10-14 21:50:55,601 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-14 21:50:55,603 INFO L256 TraceCheckSpWp]: Trace formula consists of 167 conjuncts, 37 conjunts are in the unsatisfiable core [2019-10-14 21:50:55,607 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-14 21:50:55,637 INFO L375 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-10-14 21:50:55,637 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 21:50:55,644 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 21:50:55,645 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-14 21:50:55,645 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:13 [2019-10-14 21:50:56,187 INFO L172 IndexEqualityManager]: detected equality via solver [2019-10-14 21:50:56,188 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 21:50:56,189 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 17 treesize of output 10 [2019-10-14 21:50:56,189 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 21:50:56,194 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 21:50:56,195 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-14 21:50:56,195 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:20, output treesize:7 [2019-10-14 21:50:56,229 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 21:50:56,282 INFO L134 CoverageAnalysis]: Checked inductivity of 109 backedges. 0 proven. 94 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2019-10-14 21:50:56,282 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-14 21:50:56,282 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 19] total 30 [2019-10-14 21:50:56,282 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1833395267] [2019-10-14 21:50:56,283 INFO L442 AbstractCegarLoop]: Interpolant automaton has 30 states [2019-10-14 21:50:56,283 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 21:50:56,283 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2019-10-14 21:50:56,283 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=96, Invalid=774, Unknown=0, NotChecked=0, Total=870 [2019-10-14 21:50:56,284 INFO L87 Difference]: Start difference. First operand 141 states and 149 transitions. Second operand 30 states. [2019-10-14 21:50:57,638 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 21:50:57,638 INFO L93 Difference]: Finished difference Result 205 states and 215 transitions. [2019-10-14 21:50:57,638 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2019-10-14 21:50:57,638 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 66 [2019-10-14 21:50:57,638 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 21:50:57,639 INFO L225 Difference]: With dead ends: 205 [2019-10-14 21:50:57,640 INFO L226 Difference]: Without dead ends: 203 [2019-10-14 21:50:57,640 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 57 SyntacticMatches, 9 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 524 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=226, Invalid=1936, Unknown=0, NotChecked=0, Total=2162 [2019-10-14 21:50:57,641 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 203 states. [2019-10-14 21:50:57,660 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 203 to 183. [2019-10-14 21:50:57,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 183 states. [2019-10-14 21:50:57,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 183 states to 183 states and 193 transitions. [2019-10-14 21:50:57,661 INFO L78 Accepts]: Start accepts. Automaton has 183 states and 193 transitions. Word has length 66 [2019-10-14 21:50:57,662 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 21:50:57,662 INFO L462 AbstractCegarLoop]: Abstraction has 183 states and 193 transitions. [2019-10-14 21:50:57,662 INFO L463 AbstractCegarLoop]: Interpolant automaton has 30 states. [2019-10-14 21:50:57,662 INFO L276 IsEmpty]: Start isEmpty. Operand 183 states and 193 transitions. [2019-10-14 21:50:57,663 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2019-10-14 21:50:57,663 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 21:50:57,664 INFO L380 BasicCegarLoop]: trace histogram [8, 8, 8, 7, 4, 4, 4, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 21:50:57,871 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-14 21:50:57,872 INFO L410 AbstractCegarLoop]: === Iteration 13 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 21:50:57,872 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 21:50:57,872 INFO L82 PathProgramCache]: Analyzing trace with hash -1618600614, now seen corresponding path program 9 times [2019-10-14 21:50:57,872 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 21:50:57,873 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [606128797] [2019-10-14 21:50:57,873 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 21:50:57,873 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 21:50:57,873 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 21:50:57,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 21:50:58,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 21:50:58,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 21:50:58,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 21:50:58,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 21:50:58,266 INFO L134 CoverageAnalysis]: Checked inductivity of 156 backedges. 19 proven. 125 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2019-10-14 21:50:58,266 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [606128797] [2019-10-14 21:50:58,266 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1076482739] [2019-10-14 21:50:58,267 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 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-14 21:50:58,370 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 9 check-sat command(s) [2019-10-14 21:50:58,370 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-14 21:50:58,371 INFO L256 TraceCheckSpWp]: Trace formula consists of 170 conjuncts, 35 conjunts are in the unsatisfiable core [2019-10-14 21:50:58,374 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-14 21:50:58,393 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2019-10-14 21:50:58,393 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 21:50:58,398 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 21:50:58,398 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-14 21:50:58,399 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:21, output treesize:17 [2019-10-14 21:50:58,442 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 21:50:58,442 INFO L375 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 57 [2019-10-14 21:50:58,443 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 21:50:58,465 INFO L567 ElimStorePlain]: treesize reduction 32, result has 43.9 percent of original size [2019-10-14 21:50:58,465 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-14 21:50:58,466 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:29, output treesize:25 [2019-10-14 21:50:58,544 INFO L341 Elim1Store]: treesize reduction 54, result has 49.1 percent of original size [2019-10-14 21:50:58,544 INFO L375 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 37 treesize of output 69 [2019-10-14 21:50:58,545 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 21:50:58,571 INFO L567 ElimStorePlain]: treesize reduction 30, result has 54.5 percent of original size [2019-10-14 21:50:58,572 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-14 21:50:58,572 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:40, output treesize:36 [2019-10-14 21:50:58,746 INFO L341 Elim1Store]: treesize reduction 17, result has 91.1 percent of original size [2019-10-14 21:50:58,747 INFO L375 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 49 treesize of output 194 [2019-10-14 21:50:58,748 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 21:50:58,800 INFO L567 ElimStorePlain]: treesize reduction 140, result has 27.5 percent of original size [2019-10-14 21:50:58,801 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-10-14 21:50:58,802 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:57, output treesize:53 [2019-10-14 21:50:58,996 WARN L191 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 51 [2019-10-14 21:50:58,997 INFO L341 Elim1Store]: treesize reduction 106, result has 62.8 percent of original size [2019-10-14 21:50:58,998 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 10 case distinctions, treesize of input 60 treesize of output 202 [2019-10-14 21:50:58,999 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 21:50:59,059 INFO L567 ElimStorePlain]: treesize reduction 121, result has 38.9 percent of original size [2019-10-14 21:50:59,060 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 21:50:59,062 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-10-14 21:50:59,062 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:68, output treesize:77 [2019-10-14 21:50:59,063 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 21:50:59,111 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 21:50:59,264 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 21:50:59,273 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 21:50:59,274 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 21:50:59,276 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 21:50:59,278 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 21:50:59,279 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 21:50:59,283 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 21:50:59,284 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 21:50:59,286 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 21:50:59,288 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 21:50:59,290 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 21:50:59,329 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 73 treesize of output 81 [2019-10-14 21:50:59,330 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 21:50:59,334 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 21:50:59,337 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 21:50:59,338 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 21:50:59,340 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 21:50:59,341 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 21:50:59,343 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 21:50:59,344 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 21:50:59,346 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 21:50:59,347 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 21:50:59,348 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 21:50:59,350 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 21:50:59,351 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 21:50:59,353 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 21:50:59,354 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 21:50:59,369 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 21:50:59,369 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 14 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 1 case distinctions, treesize of input 85 treesize of output 113 [2019-10-14 21:50:59,370 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-14 21:50:59,465 INFO L567 ElimStorePlain]: treesize reduction 25, result has 85.8 percent of original size [2019-10-14 21:50:59,467 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 2 xjuncts. [2019-10-14 21:50:59,467 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:159, output treesize:151 [2019-10-14 21:50:59,599 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 21:50:59,614 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 21:50:59,618 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 21:50:59,620 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 21:50:59,622 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 21:50:59,623 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 21:50:59,625 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 21:50:59,631 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 21:50:59,637 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 21:50:59,639 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 21:50:59,643 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 21:50:59,645 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 21:50:59,646 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 21:50:59,648 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 21:50:59,649 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 21:50:59,651 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 21:50:59,653 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 21:50:59,658 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 21:50:59,659 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 21:50:59,660 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 21:50:59,721 INFO L235 Elim1Store]: Index analysis took 108 ms [2019-10-14 21:50:59,763 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 21:50:59,764 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 19 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 2 case distinctions, treesize of input 96 treesize of output 166 [2019-10-14 21:50:59,765 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 21:50:59,775 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 21:50:59,776 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 21:50:59,777 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 21:50:59,778 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 21:50:59,779 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 21:50:59,780 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 21:50:59,782 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 21:50:59,783 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 21:50:59,785 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 21:50:59,786 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 21:50:59,788 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 21:50:59,791 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 21:50:59,793 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 21:50:59,794 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 21:50:59,819 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 21:50:59,820 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 14 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 1 case distinctions, treesize of input 84 treesize of output 134 [2019-10-14 21:50:59,821 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-14 21:50:59,966 WARN L191 SmtUtils]: Spent 144.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 64 [2019-10-14 21:50:59,967 INFO L567 ElimStorePlain]: treesize reduction 78, result has 71.8 percent of original size [2019-10-14 21:50:59,968 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 21:50:59,969 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 21:50:59,970 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 2 xjuncts. [2019-10-14 21:50:59,971 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:181, output treesize:199 [2019-10-14 21:50:59,971 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 21:50:59,971 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 21:51:00,103 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 21:51:00,104 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 21:51:00,105 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 21:51:00,106 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 21:51:00,108 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 21:51:00,755 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-10-14 21:51:00,801 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 21:51:00,820 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 21:51:00,823 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 21:51:00,828 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 21:51:00,836 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 21:51:00,838 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 21:51:00,842 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 21:51:00,845 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 21:51:00,854 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 21:51:00,858 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 21:51:00,872 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 21:51:00,875 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 21:51:00,881 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 21:51:00,884 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 21:51:00,893 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 21:51:00,901 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 21:51:00,904 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 21:51:00,908 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 21:51:00,916 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 21:51:01,106 INFO L235 Elim1Store]: Index analysis took 309 ms [2019-10-14 21:51:01,204 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 21:51:01,205 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 19 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 2 case distinctions, treesize of input 100 treesize of output 170 [2019-10-14 21:51:01,206 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 21:51:01,232 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 21:51:01,234 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 21:51:01,236 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 21:51:01,238 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 21:51:01,240 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 21:51:01,243 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 21:51:01,245 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 21:51:01,250 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 21:51:01,252 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 21:51:01,255 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 21:51:01,264 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 21:51:01,267 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 21:51:01,269 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 21:51:01,271 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 21:51:01,274 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 21:51:01,282 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 21:51:01,288 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 21:51:01,292 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 21:51:01,296 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 21:51:01,399 INFO L235 Elim1Store]: Index analysis took 177 ms [2019-10-14 21:51:01,452 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 21:51:01,453 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 19 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 2 case distinctions, treesize of input 100 treesize of output 170 [2019-10-14 21:51:01,454 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-14 21:51:01,471 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 21:51:01,474 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 21:51:01,476 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 21:51:01,478 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 21:51:01,481 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 21:51:01,483 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 21:51:01,485 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 21:51:01,489 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 21:51:01,491 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 21:51:01,493 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 21:51:01,496 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 21:51:01,498 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 21:51:01,503 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 21:51:01,505 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 21:51:01,507 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 21:51:01,509 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 21:51:01,511 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 21:51:01,514 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 21:51:01,516 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 21:51:01,517 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 21:51:01,519 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 21:51:01,521 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 21:51:01,524 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 21:51:01,526 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 21:51:01,528 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 21:51:01,628 INFO L235 Elim1Store]: Index analysis took 162 ms [2019-10-14 21:51:01,680 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 21:51:01,681 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 7 select indices, 7 select index equivalence classes, 25 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 3 case distinctions, treesize of input 112 treesize of output 202 [2019-10-14 21:51:01,682 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-10-14 21:51:01,693 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 21:51:01,694 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 21:51:01,696 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 21:51:01,697 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 21:51:01,700 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 21:51:01,701 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 21:51:01,703 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 21:51:01,704 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 21:51:01,706 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 21:51:01,707 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 21:51:01,709 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 21:51:01,710 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 21:51:01,712 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 21:51:01,713 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 21:51:01,738 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 21:51:01,739 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 14 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 1 case distinctions, treesize of input 84 treesize of output 134 [2019-10-14 21:51:01,740 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-10-14 21:51:02,076 WARN L191 SmtUtils]: Spent 334.00 ms on a formula simplification. DAG size of input: 162 DAG size of output: 134 [2019-10-14 21:51:02,076 INFO L567 ElimStorePlain]: treesize reduction 207, result has 67.7 percent of original size [2019-10-14 21:51:02,077 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 21:51:02,079 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 21:51:02,080 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 21:51:02,082 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 21:51:02,083 INFO L496 ElimStorePlain]: Start of recursive call 1: 9 dim-0 vars, 1 dim-2 vars, End of recursive call: 12 dim-0 vars, and 4 xjuncts. [2019-10-14 21:51:02,084 INFO L221 ElimStorePlain]: Needed 5 recursive calls to eliminate 10 variables, input treesize:397, output treesize:433 [2019-10-14 21:51:02,084 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 21:51:02,085 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 21:51:02,086 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 21:51:02,087 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 21:51:02,405 WARN L191 SmtUtils]: Spent 134.00 ms on a formula simplification that was a NOOP. DAG size: 169 [2019-10-14 21:51:02,407 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 21:51:02,408 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 21:51:02,409 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 21:51:02,411 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 21:51:05,235 WARN L191 SmtUtils]: Spent 451.00 ms on a formula simplification that was a NOOP. DAG size: 174 [2019-10-14 21:51:06,557 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 21:51:06,558 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 21:51:06,559 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 21:51:06,560 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 21:51:09,893 WARN L191 SmtUtils]: Spent 620.00 ms on a formula simplification that was a NOOP. DAG size: 174 [2019-10-14 21:51:15,386 WARN L191 SmtUtils]: Spent 168.00 ms on a formula simplification that was a NOOP. DAG size: 291