/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/array-multidimensional/copy-2-u.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-fb55353 [2019-11-06 18:49:33,043 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-06 18:49:33,045 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-06 18:49:33,057 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-06 18:49:33,057 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-06 18:49:33,058 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-06 18:49:33,060 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-06 18:49:33,061 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-06 18:49:33,063 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-06 18:49:33,064 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-06 18:49:33,065 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-06 18:49:33,066 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-06 18:49:33,066 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-06 18:49:33,067 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-06 18:49:33,068 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-06 18:49:33,069 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-06 18:49:33,070 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-06 18:49:33,071 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-06 18:49:33,073 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-06 18:49:33,075 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-06 18:49:33,076 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-06 18:49:33,077 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-06 18:49:33,078 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-06 18:49:33,079 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-06 18:49:33,082 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-06 18:49:33,082 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-06 18:49:33,082 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-06 18:49:33,083 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-06 18:49:33,083 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-06 18:49:33,084 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-06 18:49:33,085 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-06 18:49:33,085 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-06 18:49:33,086 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-06 18:49:33,087 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-06 18:49:33,088 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-06 18:49:33,088 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-06 18:49:33,089 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-06 18:49:33,089 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-06 18:49:33,089 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-06 18:49:33,090 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-06 18:49:33,091 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-06 18:49:33,091 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-11-06 18:49:33,105 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-06 18:49:33,106 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-06 18:49:33,107 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-06 18:49:33,107 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-06 18:49:33,107 INFO L138 SettingsManager]: * Use SBE=true [2019-11-06 18:49:33,108 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-06 18:49:33,108 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-06 18:49:33,108 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-06 18:49:33,108 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-06 18:49:33,108 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-06 18:49:33,109 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-06 18:49:33,109 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-06 18:49:33,109 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-06 18:49:33,109 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-06 18:49:33,109 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-06 18:49:33,109 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-06 18:49:33,110 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-06 18:49:33,110 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-06 18:49:33,110 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-06 18:49:33,110 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-06 18:49:33,111 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-06 18:49:33,111 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-06 18:49:33,111 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-06 18:49:33,111 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-06 18:49:33,111 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-06 18:49:33,112 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-06 18:49:33,112 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-06 18:49:33,112 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-06 18:49:33,112 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-11-06 18:49:33,395 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-06 18:49:33,407 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-06 18:49:33,411 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-06 18:49:33,412 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-06 18:49:33,413 INFO L275 PluginConnector]: CDTParser initialized [2019-11-06 18:49:33,414 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-multidimensional/copy-2-u.c [2019-11-06 18:49:33,472 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1b4b49c3a/2d10fb2606a2470eaccc278dfbb349d7/FLAGc65cd67ee [2019-11-06 18:49:33,909 INFO L306 CDTParser]: Found 1 translation units. [2019-11-06 18:49:33,910 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/array-multidimensional/copy-2-u.c [2019-11-06 18:49:33,916 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1b4b49c3a/2d10fb2606a2470eaccc278dfbb349d7/FLAGc65cd67ee [2019-11-06 18:49:34,279 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1b4b49c3a/2d10fb2606a2470eaccc278dfbb349d7 [2019-11-06 18:49:34,288 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-06 18:49:34,290 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-11-06 18:49:34,291 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-06 18:49:34,291 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-06 18:49:34,294 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-06 18:49:34,296 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 06:49:34" (1/1) ... [2019-11-06 18:49:34,299 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4f437f01 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 06:49:34, skipping insertion in model container [2019-11-06 18:49:34,299 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 06:49:34" (1/1) ... [2019-11-06 18:49:34,307 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-06 18:49:34,331 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-06 18:49:34,552 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-06 18:49:34,556 INFO L188 MainTranslator]: Completed pre-run [2019-11-06 18:49:34,581 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-06 18:49:34,600 INFO L192 MainTranslator]: Completed translation [2019-11-06 18:49:34,600 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 06:49:34 WrapperNode [2019-11-06 18:49:34,600 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-06 18:49:34,601 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-06 18:49:34,601 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-06 18:49:34,601 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-06 18:49:34,689 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 06:49:34" (1/1) ... [2019-11-06 18:49:34,689 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 06:49:34" (1/1) ... [2019-11-06 18:49:34,696 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 06:49:34" (1/1) ... [2019-11-06 18:49:34,696 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 06:49:34" (1/1) ... [2019-11-06 18:49:34,703 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 06:49:34" (1/1) ... [2019-11-06 18:49:34,709 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 06:49:34" (1/1) ... [2019-11-06 18:49:34,711 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 06:49:34" (1/1) ... [2019-11-06 18:49:34,713 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-06 18:49:34,714 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-06 18:49:34,714 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-06 18:49:34,714 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-06 18:49:34,715 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 06:49:34" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-06 18:49:34,767 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-11-06 18:49:34,767 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-06 18:49:34,767 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2019-11-06 18:49:34,767 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-11-06 18:49:34,767 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-11-06 18:49:34,768 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2019-11-06 18:49:34,768 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-11-06 18:49:34,769 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-11-06 18:49:34,769 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-06 18:49:34,769 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-11-06 18:49:34,769 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-11-06 18:49:34,769 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-06 18:49:34,769 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-11-06 18:49:34,770 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-06 18:49:35,065 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-06 18:49:35,065 INFO L284 CfgBuilder]: Removed 6 assume(true) statements. [2019-11-06 18:49:35,066 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 06:49:35 BoogieIcfgContainer [2019-11-06 18:49:35,066 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-06 18:49:35,067 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-06 18:49:35,068 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-06 18:49:35,072 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-06 18:49:35,073 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.11 06:49:34" (1/3) ... [2019-11-06 18:49:35,074 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@634a0ef1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 06:49:35, skipping insertion in model container [2019-11-06 18:49:35,074 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 06:49:34" (2/3) ... [2019-11-06 18:49:35,074 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@634a0ef1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 06:49:35, skipping insertion in model container [2019-11-06 18:49:35,075 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 06:49:35" (3/3) ... [2019-11-06 18:49:35,076 INFO L109 eAbstractionObserver]: Analyzing ICFG copy-2-u.c [2019-11-06 18:49:35,084 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-06 18:49:35,090 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-06 18:49:35,101 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-06 18:49:35,125 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-06 18:49:35,126 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-06 18:49:35,126 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-06 18:49:35,126 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-06 18:49:35,126 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-06 18:49:35,126 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-06 18:49:35,127 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-06 18:49:35,127 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-06 18:49:35,143 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states. [2019-11-06 18:49:35,148 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-11-06 18:49:35,148 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 18:49:35,149 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-06 18:49:35,151 INFO L410 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 18:49:35,157 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 18:49:35,157 INFO L82 PathProgramCache]: Analyzing trace with hash -1035913628, now seen corresponding path program 1 times [2019-11-06 18:49:35,164 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 18:49:35,164 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1862294731] [2019-11-06 18:49:35,165 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 18:49:35,240 ERROR L268 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2019-11-06 18:49:35,241 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1914877275] [2019-11-06 18:49:35,241 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-06 18:49:35,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 18:49:35,315 INFO L256 TraceCheckSpWp]: Trace formula consists of 74 conjuncts, 3 conjunts are in the unsatisfiable core [2019-11-06 18:49:35,321 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-06 18:49:35,371 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-06 18:49:35,372 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1862294731] [2019-11-06 18:49:35,372 INFO L332 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-11-06 18:49:35,373 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1914877275] [2019-11-06 18:49:35,373 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-06 18:49:35,374 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-06 18:49:35,374 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1816373133] [2019-11-06 18:49:35,379 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-06 18:49:35,379 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 18:49:35,391 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-06 18:49:35,392 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-06 18:49:35,395 INFO L87 Difference]: Start difference. First operand 30 states. Second operand 3 states. [2019-11-06 18:49:35,480 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 18:49:35,481 INFO L93 Difference]: Finished difference Result 57 states and 86 transitions. [2019-11-06 18:49:35,481 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-06 18:49:35,483 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2019-11-06 18:49:35,483 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 18:49:35,492 INFO L225 Difference]: With dead ends: 57 [2019-11-06 18:49:35,492 INFO L226 Difference]: Without dead ends: 28 [2019-11-06 18:49:35,496 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-06 18:49:35,514 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2019-11-06 18:49:35,535 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 26. [2019-11-06 18:49:35,536 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2019-11-06 18:49:35,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 31 transitions. [2019-11-06 18:49:35,540 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 31 transitions. Word has length 16 [2019-11-06 18:49:35,540 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 18:49:35,540 INFO L462 AbstractCegarLoop]: Abstraction has 26 states and 31 transitions. [2019-11-06 18:49:35,540 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-06 18:49:35,541 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 31 transitions. [2019-11-06 18:49:35,541 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-11-06 18:49:35,542 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 18:49:35,542 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-06 18:49:35,745 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-06 18:49:35,746 INFO L410 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 18:49:35,747 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 18:49:35,747 INFO L82 PathProgramCache]: Analyzing trace with hash 573516244, now seen corresponding path program 1 times [2019-11-06 18:49:35,748 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 18:49:35,749 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [120069159] [2019-11-06 18:49:35,749 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 18:49:35,759 ERROR L268 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2019-11-06 18:49:35,759 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1612087822] [2019-11-06 18:49:35,760 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-06 18:49:35,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 18:49:35,813 INFO L256 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 3 conjunts are in the unsatisfiable core [2019-11-06 18:49:35,815 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-06 18:49:35,838 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-06 18:49:35,839 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [120069159] [2019-11-06 18:49:35,839 INFO L332 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-11-06 18:49:35,839 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1612087822] [2019-11-06 18:49:35,840 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-06 18:49:35,840 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-06 18:49:35,840 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [918400064] [2019-11-06 18:49:35,844 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-06 18:49:35,845 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 18:49:35,845 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-06 18:49:35,846 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-06 18:49:35,846 INFO L87 Difference]: Start difference. First operand 26 states and 31 transitions. Second operand 4 states. [2019-11-06 18:49:35,928 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 18:49:35,928 INFO L93 Difference]: Finished difference Result 53 states and 68 transitions. [2019-11-06 18:49:35,929 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-06 18:49:35,929 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 19 [2019-11-06 18:49:35,930 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 18:49:35,932 INFO L225 Difference]: With dead ends: 53 [2019-11-06 18:49:35,932 INFO L226 Difference]: Without dead ends: 34 [2019-11-06 18:49:35,933 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-06 18:49:35,934 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2019-11-06 18:49:35,944 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 29. [2019-11-06 18:49:35,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2019-11-06 18:49:35,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 34 transitions. [2019-11-06 18:49:35,946 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 34 transitions. Word has length 19 [2019-11-06 18:49:35,946 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 18:49:35,946 INFO L462 AbstractCegarLoop]: Abstraction has 29 states and 34 transitions. [2019-11-06 18:49:35,946 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-06 18:49:35,946 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 34 transitions. [2019-11-06 18:49:35,947 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-11-06 18:49:35,947 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 18:49:35,948 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-06 18:49:36,159 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-06 18:49:36,159 INFO L410 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 18:49:36,160 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 18:49:36,160 INFO L82 PathProgramCache]: Analyzing trace with hash -1173975853, now seen corresponding path program 1 times [2019-11-06 18:49:36,161 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 18:49:36,161 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1921565789] [2019-11-06 18:49:36,162 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 18:49:36,170 ERROR L268 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2019-11-06 18:49:36,170 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1567962303] [2019-11-06 18:49:36,170 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-06 18:49:36,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 18:49:36,220 INFO L256 TraceCheckSpWp]: Trace formula consists of 86 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-06 18:49:36,222 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-06 18:49:36,263 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-06 18:49:36,263 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1921565789] [2019-11-06 18:49:36,263 INFO L332 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-11-06 18:49:36,264 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1567962303] [2019-11-06 18:49:36,264 INFO L218 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-11-06 18:49:36,264 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2019-11-06 18:49:36,264 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [11421200] [2019-11-06 18:49:36,265 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-06 18:49:36,265 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 18:49:36,266 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-06 18:49:36,266 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-11-06 18:49:36,266 INFO L87 Difference]: Start difference. First operand 29 states and 34 transitions. Second operand 5 states. [2019-11-06 18:49:36,380 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 18:49:36,380 INFO L93 Difference]: Finished difference Result 61 states and 77 transitions. [2019-11-06 18:49:36,381 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-06 18:49:36,381 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 20 [2019-11-06 18:49:36,382 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 18:49:36,384 INFO L225 Difference]: With dead ends: 61 [2019-11-06 18:49:36,384 INFO L226 Difference]: Without dead ends: 39 [2019-11-06 18:49:36,385 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-11-06 18:49:36,385 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2019-11-06 18:49:36,397 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 34. [2019-11-06 18:49:36,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2019-11-06 18:49:36,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 40 transitions. [2019-11-06 18:49:36,399 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 40 transitions. Word has length 20 [2019-11-06 18:49:36,399 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 18:49:36,399 INFO L462 AbstractCegarLoop]: Abstraction has 34 states and 40 transitions. [2019-11-06 18:49:36,399 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-06 18:49:36,399 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 40 transitions. [2019-11-06 18:49:36,400 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-11-06 18:49:36,400 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 18:49:36,401 INFO L410 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-06 18:49:36,603 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-06 18:49:36,604 INFO L410 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 18:49:36,604 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 18:49:36,604 INFO L82 PathProgramCache]: Analyzing trace with hash 488343988, now seen corresponding path program 2 times [2019-11-06 18:49:36,604 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 18:49:36,605 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1083209489] [2019-11-06 18:49:36,605 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 18:49:36,614 ERROR L268 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2019-11-06 18:49:36,614 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1646788415] [2019-11-06 18:49:36,614 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-06 18:49:36,686 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2019-11-06 18:49:36,686 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-06 18:49:36,687 INFO L256 TraceCheckSpWp]: Trace formula consists of 74 conjuncts, 3 conjunts are in the unsatisfiable core [2019-11-06 18:49:36,689 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-06 18:49:36,714 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-11-06 18:49:36,715 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1083209489] [2019-11-06 18:49:36,715 INFO L332 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-11-06 18:49:36,715 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1646788415] [2019-11-06 18:49:36,715 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-06 18:49:36,716 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-06 18:49:36,716 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [530231624] [2019-11-06 18:49:36,717 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-06 18:49:36,717 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 18:49:36,717 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-06 18:49:36,718 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-06 18:49:36,719 INFO L87 Difference]: Start difference. First operand 34 states and 40 transitions. Second operand 4 states. [2019-11-06 18:49:36,804 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 18:49:36,804 INFO L93 Difference]: Finished difference Result 68 states and 82 transitions. [2019-11-06 18:49:36,805 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-06 18:49:36,805 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 21 [2019-11-06 18:49:36,805 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 18:49:36,806 INFO L225 Difference]: With dead ends: 68 [2019-11-06 18:49:36,806 INFO L226 Difference]: Without dead ends: 52 [2019-11-06 18:49:36,807 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-06 18:49:36,807 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2019-11-06 18:49:36,814 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 35. [2019-11-06 18:49:36,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2019-11-06 18:49:36,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 41 transitions. [2019-11-06 18:49:36,816 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 41 transitions. Word has length 21 [2019-11-06 18:49:36,816 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 18:49:36,816 INFO L462 AbstractCegarLoop]: Abstraction has 35 states and 41 transitions. [2019-11-06 18:49:36,817 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-06 18:49:36,817 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 41 transitions. [2019-11-06 18:49:36,817 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-11-06 18:49:36,818 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 18:49:36,818 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-06 18:49:37,029 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-06 18:49:37,030 INFO L410 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 18:49:37,030 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 18:49:37,030 INFO L82 PathProgramCache]: Analyzing trace with hash -1641208904, now seen corresponding path program 1 times [2019-11-06 18:49:37,031 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 18:49:37,031 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [824885524] [2019-11-06 18:49:37,032 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 18:49:37,041 ERROR L268 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2019-11-06 18:49:37,041 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [465345214] [2019-11-06 18:49:37,041 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-06 18:49:37,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 18:49:37,102 INFO L256 TraceCheckSpWp]: Trace formula consists of 106 conjuncts, 5 conjunts are in the unsatisfiable core [2019-11-06 18:49:37,104 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-06 18:49:37,136 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-11-06 18:49:37,137 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [824885524] [2019-11-06 18:49:37,137 INFO L332 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-11-06 18:49:37,137 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [465345214] [2019-11-06 18:49:37,137 INFO L218 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-11-06 18:49:37,138 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2019-11-06 18:49:37,138 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1775651935] [2019-11-06 18:49:37,138 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-06 18:49:37,138 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 18:49:37,139 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-06 18:49:37,139 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-11-06 18:49:37,139 INFO L87 Difference]: Start difference. First operand 35 states and 41 transitions. Second operand 6 states. [2019-11-06 18:49:37,229 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 18:49:37,229 INFO L93 Difference]: Finished difference Result 71 states and 88 transitions. [2019-11-06 18:49:37,230 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-06 18:49:37,230 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 26 [2019-11-06 18:49:37,230 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 18:49:37,231 INFO L225 Difference]: With dead ends: 71 [2019-11-06 18:49:37,231 INFO L226 Difference]: Without dead ends: 43 [2019-11-06 18:49:37,232 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-11-06 18:49:37,232 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2019-11-06 18:49:37,239 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 40. [2019-11-06 18:49:37,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2019-11-06 18:49:37,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 47 transitions. [2019-11-06 18:49:37,241 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 47 transitions. Word has length 26 [2019-11-06 18:49:37,241 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 18:49:37,241 INFO L462 AbstractCegarLoop]: Abstraction has 40 states and 47 transitions. [2019-11-06 18:49:37,241 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-06 18:49:37,241 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 47 transitions. [2019-11-06 18:49:37,242 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-11-06 18:49:37,242 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 18:49:37,243 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-06 18:49:37,454 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-06 18:49:37,454 INFO L410 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 18:49:37,454 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 18:49:37,454 INFO L82 PathProgramCache]: Analyzing trace with hash 1483393922, now seen corresponding path program 2 times [2019-11-06 18:49:37,455 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 18:49:37,455 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [736668917] [2019-11-06 18:49:37,455 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 18:49:37,469 ERROR L268 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2019-11-06 18:49:37,470 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1647585501] [2019-11-06 18:49:37,470 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-06 18:49:37,531 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-11-06 18:49:37,531 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-06 18:49:37,532 INFO L256 TraceCheckSpWp]: Trace formula consists of 116 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-06 18:49:37,535 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-06 18:49:37,575 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2019-11-06 18:49:37,575 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [736668917] [2019-11-06 18:49:37,576 INFO L332 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-11-06 18:49:37,576 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1647585501] [2019-11-06 18:49:37,576 INFO L218 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-11-06 18:49:37,576 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2019-11-06 18:49:37,577 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1570327649] [2019-11-06 18:49:37,578 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-06 18:49:37,578 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 18:49:37,578 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-06 18:49:37,578 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-11-06 18:49:37,578 INFO L87 Difference]: Start difference. First operand 40 states and 47 transitions. Second operand 5 states. [2019-11-06 18:49:37,703 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 18:49:37,703 INFO L93 Difference]: Finished difference Result 113 states and 139 transitions. [2019-11-06 18:49:37,703 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-06 18:49:37,704 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 28 [2019-11-06 18:49:37,704 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 18:49:37,705 INFO L225 Difference]: With dead ends: 113 [2019-11-06 18:49:37,705 INFO L226 Difference]: Without dead ends: 86 [2019-11-06 18:49:37,707 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-11-06 18:49:37,707 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2019-11-06 18:49:37,726 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 52. [2019-11-06 18:49:37,726 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2019-11-06 18:49:37,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 61 transitions. [2019-11-06 18:49:37,727 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 61 transitions. Word has length 28 [2019-11-06 18:49:37,728 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 18:49:37,728 INFO L462 AbstractCegarLoop]: Abstraction has 52 states and 61 transitions. [2019-11-06 18:49:37,728 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-06 18:49:37,728 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 61 transitions. [2019-11-06 18:49:37,732 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-11-06 18:49:37,732 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 18:49:37,732 INFO L410 BasicCegarLoop]: trace histogram [6, 6, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-06 18:49:37,932 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-06 18:49:37,933 INFO L410 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 18:49:37,933 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 18:49:37,933 INFO L82 PathProgramCache]: Analyzing trace with hash -347991136, now seen corresponding path program 3 times [2019-11-06 18:49:37,934 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 18:49:37,934 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1422179033] [2019-11-06 18:49:37,934 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 18:49:37,943 ERROR L268 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2019-11-06 18:49:37,943 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1549509300] [2019-11-06 18:49:37,943 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-06 18:49:38,022 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2019-11-06 18:49:38,022 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-06 18:49:38,024 INFO L256 TraceCheckSpWp]: Trace formula consists of 146 conjuncts, 41 conjunts are in the unsatisfiable core [2019-11-06 18:49:38,028 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-06 18:49:38,093 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2019-11-06 18:49:38,093 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-06 18:49:38,102 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 18:49:38,103 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-06 18:49:38,103 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:18, output treesize:14 [2019-11-06 18:49:38,130 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 16 [2019-11-06 18:49:38,130 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-06 18:49:38,145 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 18:49:38,146 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-06 18:49:38,146 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:34, output treesize:14 [2019-11-06 18:49:38,191 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 27 treesize of output 27 [2019-11-06 18:49:38,192 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-06 18:49:38,207 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 18:49:38,208 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-06 18:49:38,208 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:47, output treesize:43 [2019-11-06 18:49:38,248 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-06 18:49:38,250 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-06 18:49:38,252 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 57 treesize of output 62 [2019-11-06 18:49:38,254 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-06 18:49:38,278 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 18:49:38,279 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-06 18:49:38,280 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:81, output treesize:77 [2019-11-06 18:49:38,343 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-06 18:49:38,345 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-06 18:49:38,347 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-06 18:49:38,349 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-06 18:49:38,351 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-06 18:49:38,353 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-06 18:49:38,356 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 7 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 65 [2019-11-06 18:49:38,357 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-06 18:49:38,394 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 18:49:38,396 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-11-06 18:49:38,396 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:75, output treesize:71 [2019-11-06 18:49:38,461 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-06 18:49:38,462 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-06 18:49:38,464 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-06 18:49:38,465 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-06 18:49:38,468 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-06 18:49:38,469 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-06 18:49:38,536 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 18:49:38,537 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 7 select indices, 7 select index equivalence classes, 7 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 6 case distinctions, treesize of input 85 treesize of output 296 [2019-11-06 18:49:38,540 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-06 18:49:38,635 INFO L567 ElimStorePlain]: treesize reduction 298, result has 25.5 percent of original size [2019-11-06 18:49:38,636 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-11-06 18:49:38,636 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:106, output treesize:102 [2019-11-06 18:49:38,719 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-06 18:49:38,720 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-06 18:49:38,721 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-06 18:49:38,722 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-06 18:49:38,723 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-06 18:49:38,727 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-06 18:49:38,928 WARN L191 SmtUtils]: Spent 196.00 ms on a formula simplification. DAG size of input: 103 DAG size of output: 82 [2019-11-06 18:49:38,929 INFO L341 Elim1Store]: treesize reduction 153, result has 65.8 percent of original size [2019-11-06 18:49:38,930 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 9 select indices, 9 select index equivalence classes, 7 disjoint index pairs (out of 36 index pairs), introduced 9 new quantified variables, introduced 14 case distinctions, treesize of input 114 treesize of output 384 [2019-11-06 18:49:38,934 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-06 18:49:39,057 WARN L191 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 54 [2019-11-06 18:49:39,057 INFO L567 ElimStorePlain]: treesize reduction 407, result has 24.3 percent of original size [2019-11-06 18:49:39,059 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 1 xjuncts. [2019-11-06 18:49:39,059 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:135, output treesize:131 [2019-11-06 18:49:43,192 WARN L191 SmtUtils]: Spent 2.02 s on a formula simplification that was a NOOP. DAG size: 58 [2019-11-06 18:49:43,248 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-06 18:49:43,249 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-06 18:49:43,251 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-06 18:49:43,252 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-06 18:49:43,253 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-06 18:49:43,254 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-06 18:49:43,777 WARN L191 SmtUtils]: Spent 517.00 ms on a formula simplification. DAG size of input: 152 DAG size of output: 144 [2019-11-06 18:49:43,777 INFO L341 Elim1Store]: treesize reduction 54, result has 92.5 percent of original size [2019-11-06 18:49:43,778 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 11 select indices, 11 select index equivalence classes, 7 disjoint index pairs (out of 55 index pairs), introduced 11 new quantified variables, introduced 24 case distinctions, treesize of input 143 treesize of output 777 [2019-11-06 18:49:43,786 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-06 18:49:44,043 WARN L191 SmtUtils]: Spent 256.00 ms on a formula simplification. DAG size of input: 151 DAG size of output: 64 [2019-11-06 18:49:44,043 INFO L567 ElimStorePlain]: treesize reduction 1024, result has 13.9 percent of original size [2019-11-06 18:49:44,045 INFO L496 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-11-06 18:49:44,045 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:169, output treesize:165 [2019-11-06 18:49:49,028 WARN L191 SmtUtils]: Spent 4.04 s on a formula simplification that was a NOOP. DAG size: 70 [2019-11-06 18:49:49,595 WARN L191 SmtUtils]: Spent 399.00 ms on a formula simplification that was a NOOP. DAG size: 69 [2019-11-06 18:50:01,723 WARN L191 SmtUtils]: Spent 2.03 s on a formula simplification that was a NOOP. DAG size: 70 [2019-11-06 18:50:06,123 WARN L191 SmtUtils]: Spent 2.03 s on a formula simplification that was a NOOP. DAG size: 69 [2019-11-06 18:50:14,378 WARN L191 SmtUtils]: Spent 2.04 s on a formula simplification that was a NOOP. DAG size: 71 [2019-11-06 18:50:24,472 WARN L191 SmtUtils]: Spent 2.03 s on a formula simplification that was a NOOP. DAG size: 73 [2019-11-06 18:50:24,490 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-06 18:50:24,491 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-06 18:50:24,492 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-06 18:50:24,496 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-06 18:50:24,835 WARN L191 SmtUtils]: Spent 336.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 90 [2019-11-06 18:50:24,835 INFO L341 Elim1Store]: treesize reduction 42, result has 88.9 percent of original size [2019-11-06 18:50:24,836 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 12 select indices, 12 select index equivalence classes, 5 disjoint index pairs (out of 66 index pairs), introduced 12 new quantified variables, introduced 22 case distinctions, treesize of input 127 treesize of output 361 [2019-11-06 18:50:24,840 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 18:50:24,841 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 18:50:24,842 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 18:50:24,842 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 18:50:24,843 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 18:50:24,844 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 18:50:24,844 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 18:50:24,845 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 18:50:24,846 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 18:50:24,849 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 18:50:24,850 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 18:50:24,851 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 18:50:24,852 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 18:50:24,853 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 18:50:24,853 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 18:50:24,854 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 18:50:24,855 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 18:50:24,856 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 18:50:24,857 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 18:50:24,858 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 18:50:24,858 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 18:50:24,859 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 18:50:24,860 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 18:50:24,861 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 18:50:24,862 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 18:50:24,862 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 18:50:24,863 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 18:50:24,864 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 18:50:24,865 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 18:50:24,866 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 18:50:24,867 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 18:50:24,867 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 18:50:24,868 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 18:50:24,869 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 18:50:24,870 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 18:50:24,870 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 18:50:24,871 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 18:50:24,872 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 18:50:24,873 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 18:50:24,874 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 18:50:24,875 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 18:50:24,875 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 18:50:24,876 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 18:50:24,877 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 18:50:24,878 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 18:50:24,879 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 18:50:24,880 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 18:50:24,880 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 18:50:24,881 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 18:50:24,882 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 18:50:24,883 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 18:50:24,883 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 18:50:24,884 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 18:50:24,885 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 18:50:24,886 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 18:50:24,886 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 18:50:24,887 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 18:50:24,888 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 18:50:24,888 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 18:50:24,889 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 18:50:24,890 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 18:50:24,891 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 18:50:24,891 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 18:50:24,892 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 18:50:24,893 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 18:50:24,894 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 18:50:24,894 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 18:50:24,895 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 18:50:24,895 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 18:50:24,896 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 18:50:24,897 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 18:50:24,898 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 18:50:24,899 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 18:50:24,900 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 18:50:24,901 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 18:50:24,901 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 18:50:24,902 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 18:50:24,902 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 18:50:24,903 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 18:50:24,904 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 18:50:24,905 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 18:50:24,905 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 18:50:24,906 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 18:50:24,906 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 18:50:24,907 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 18:50:24,908 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 18:50:24,909 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 18:50:24,909 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 18:50:24,911 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 18:50:24,911 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 18:50:24,912 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 18:50:24,913 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 18:50:24,914 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 18:50:24,914 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 18:50:24,915 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 18:50:24,916 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 18:50:24,916 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 18:50:24,917 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 18:50:24,917 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 18:50:24,918 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 18:50:24,919 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 18:50:24,920 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 18:50:24,920 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 18:50:24,921 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 18:50:24,921 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 18:50:24,923 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 18:50:24,923 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 18:50:24,924 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 18:50:24,925 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 18:50:24,925 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 18:50:24,926 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 18:50:24,927 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 18:50:24,928 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 18:50:24,928 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 18:50:24,929 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 18:50:24,930 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 18:50:24,931 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 18:50:24,931 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 18:50:24,932 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 18:50:24,933 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 18:50:24,934 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 18:50:24,934 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 18:50:24,935 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 18:50:24,936 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 18:50:24,937 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 18:50:24,938 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 18:50:24,938 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 18:50:24,939 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 18:50:24,940 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 18:50:24,940 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 18:50:24,941 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 18:50:24,941 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 18:50:24,942 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 18:50:24,943 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 18:50:24,944 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 18:50:24,944 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 18:50:24,945 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 18:50:24,946 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 18:50:24,947 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 18:50:24,948 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 18:50:24,948 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 18:50:24,949 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 18:50:24,950 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 18:50:24,951 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 18:50:24,951 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 18:50:24,952 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 18:50:24,953 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 18:50:24,953 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 18:50:24,954 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 18:50:24,955 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 18:50:24,955 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 18:50:24,956 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 18:50:24,957 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 18:50:24,958 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 18:50:24,959 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 18:50:24,959 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 18:50:24,960 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 18:50:24,960 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 18:50:24,961 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 18:50:24,962 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 18:50:24,963 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 18:50:24,963 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 18:50:24,964 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 18:50:24,965 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 18:50:24,965 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 18:50:24,966 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 18:50:24,967 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 18:50:24,967 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 18:50:24,968 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 18:50:24,969 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 18:50:24,970 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 18:50:24,970 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 18:50:24,971 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 18:50:24,971 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 18:50:24,972 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 18:50:24,973 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 18:50:24,974 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 18:50:24,974 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 18:50:24,975 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 18:50:24,976 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 18:50:24,977 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 18:50:24,977 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 18:50:24,978 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 18:50:24,979 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 18:50:24,980 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 18:50:24,981 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 18:50:24,981 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 18:50:24,982 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 18:50:24,983 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 18:50:24,984 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 18:50:24,985 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 18:50:24,986 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 18:50:24,987 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 18:50:24,987 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 18:50:24,988 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 18:50:24,989 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 18:50:24,989 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 18:50:24,990 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 18:50:24,990 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 18:50:24,991 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 18:50:24,992 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 18:50:24,992 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 18:50:24,993 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 18:50:24,994 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 18:50:24,995 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 18:50:24,996 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 18:50:24,996 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 18:50:24,997 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 18:50:24,998 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 18:50:24,999 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 18:50:25,000 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-06 18:50:25,017 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 18:50:25,018 INFO L496 ElimStorePlain]: Start of recursive call 1: 7 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-06 18:50:25,018 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 8 variables, input treesize:145, output treesize:3 [2019-11-06 18:50:25,117 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 10 proven. 21 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2019-11-06 18:50:25,117 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1422179033] [2019-11-06 18:50:25,118 INFO L332 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-11-06 18:50:25,118 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1549509300] [2019-11-06 18:50:25,118 INFO L218 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-11-06 18:50:25,118 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2019-11-06 18:50:25,118 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1653156519] [2019-11-06 18:50:25,119 INFO L442 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-11-06 18:50:25,119 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 18:50:25,119 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-11-06 18:50:25,121 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=260, Unknown=14, NotChecked=0, Total=342 [2019-11-06 18:50:25,121 INFO L87 Difference]: Start difference. First operand 52 states and 61 transitions. Second operand 19 states. [2019-11-06 18:50:26,142 WARN L191 SmtUtils]: Spent 651.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 62