/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/list-properties/splice-2.i -------------------------------------------------------------------------------- This is Ultimate 0.1.24-6598664 [2019-11-23 21:59:39,867 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-23 21:59:39,869 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-23 21:59:39,881 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-23 21:59:39,881 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-23 21:59:39,882 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-23 21:59:39,884 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-23 21:59:39,886 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-23 21:59:39,887 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-23 21:59:39,888 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-23 21:59:39,889 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-23 21:59:39,890 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-23 21:59:39,891 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-23 21:59:39,892 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-23 21:59:39,892 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-23 21:59:39,894 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-23 21:59:39,894 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-23 21:59:39,895 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-23 21:59:39,897 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-23 21:59:39,899 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-23 21:59:39,900 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-23 21:59:39,901 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-23 21:59:39,902 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-23 21:59:39,903 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-23 21:59:39,905 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-23 21:59:39,905 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-23 21:59:39,905 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-23 21:59:39,906 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-23 21:59:39,907 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-23 21:59:39,908 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-23 21:59:39,908 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-23 21:59:39,909 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-23 21:59:39,909 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-23 21:59:39,910 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-23 21:59:39,911 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-23 21:59:39,911 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-23 21:59:39,912 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-23 21:59:39,912 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-23 21:59:39,912 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-23 21:59:39,913 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-23 21:59:39,914 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-23 21:59:39,915 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-11-23 21:59:39,933 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-23 21:59:39,933 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-23 21:59:39,935 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-23 21:59:39,936 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-23 21:59:39,936 INFO L138 SettingsManager]: * Use SBE=true [2019-11-23 21:59:39,936 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-23 21:59:39,936 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-23 21:59:39,936 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-23 21:59:39,937 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-23 21:59:39,937 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-23 21:59:39,938 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-23 21:59:39,938 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-23 21:59:39,938 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-23 21:59:39,939 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2019-11-23 21:59:39,939 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-23 21:59:39,939 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-23 21:59:39,939 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-23 21:59:39,940 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-23 21:59:39,940 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-23 21:59:39,940 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-23 21:59:39,940 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-23 21:59:39,941 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-23 21:59:39,941 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-23 21:59:39,941 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-23 21:59:39,941 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-23 21:59:39,941 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-23 21:59:39,941 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-23 21:59:39,942 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-23 21:59:39,942 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-23 21:59:39,942 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-11-23 21:59:40,221 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-23 21:59:40,235 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-23 21:59:40,238 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-23 21:59:40,240 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-23 21:59:40,240 INFO L275 PluginConnector]: CDTParser initialized [2019-11-23 21:59:40,241 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/list-properties/splice-2.i [2019-11-23 21:59:40,314 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0eb12eeb0/7a0bf41d4d1544beb8a3d8071dd44d16/FLAG2c695bcf6 [2019-11-23 21:59:40,840 INFO L306 CDTParser]: Found 1 translation units. [2019-11-23 21:59:40,841 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/list-properties/splice-2.i [2019-11-23 21:59:40,853 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0eb12eeb0/7a0bf41d4d1544beb8a3d8071dd44d16/FLAG2c695bcf6 [2019-11-23 21:59:41,203 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0eb12eeb0/7a0bf41d4d1544beb8a3d8071dd44d16 [2019-11-23 21:59:41,217 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-23 21:59:41,219 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-11-23 21:59:41,220 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-23 21:59:41,220 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-23 21:59:41,224 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-23 21:59:41,225 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 09:59:41" (1/1) ... [2019-11-23 21:59:41,228 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@33b3ce2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:59:41, skipping insertion in model container [2019-11-23 21:59:41,229 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 09:59:41" (1/1) ... [2019-11-23 21:59:41,237 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-23 21:59:41,297 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-11-23 21:59:41,791 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-23 21:59:41,803 INFO L203 MainTranslator]: Completed pre-run [2019-11-23 21:59:41,878 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-23 21:59:41,937 INFO L208 MainTranslator]: Completed translation [2019-11-23 21:59:41,937 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:59:41 WrapperNode [2019-11-23 21:59:41,938 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-23 21:59:41,938 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-23 21:59:41,938 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-23 21:59:41,939 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-23 21:59:41,947 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:59:41" (1/1) ... [2019-11-23 21:59:41,977 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:59:41" (1/1) ... [2019-11-23 21:59:42,007 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-23 21:59:42,008 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-23 21:59:42,008 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-23 21:59:42,008 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-23 21:59:42,018 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:59:41" (1/1) ... [2019-11-23 21:59:42,018 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:59:41" (1/1) ... [2019-11-23 21:59:42,022 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:59:41" (1/1) ... [2019-11-23 21:59:42,023 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:59:41" (1/1) ... [2019-11-23 21:59:42,037 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:59:41" (1/1) ... [2019-11-23 21:59:42,042 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:59:41" (1/1) ... [2019-11-23 21:59:42,044 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:59:41" (1/1) ... [2019-11-23 21:59:42,047 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-23 21:59:42,047 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-23 21:59:42,048 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-23 21:59:42,048 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-23 21:59:42,049 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:59:41" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-23 21:59:42,115 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-11-23 21:59:42,115 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-11-23 21:59:42,115 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-11-23 21:59:42,116 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-11-23 21:59:42,116 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-11-23 21:59:42,116 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-23 21:59:42,116 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-23 21:59:42,507 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-23 21:59:42,507 INFO L284 CfgBuilder]: Removed 12 assume(true) statements. [2019-11-23 21:59:42,509 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 09:59:42 BoogieIcfgContainer [2019-11-23 21:59:42,509 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-23 21:59:42,510 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-23 21:59:42,510 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-23 21:59:42,513 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-23 21:59:42,514 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 09:59:41" (1/3) ... [2019-11-23 21:59:42,515 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@30e57fbc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 09:59:42, skipping insertion in model container [2019-11-23 21:59:42,515 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:59:41" (2/3) ... [2019-11-23 21:59:42,515 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@30e57fbc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 09:59:42, skipping insertion in model container [2019-11-23 21:59:42,516 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 09:59:42" (3/3) ... [2019-11-23 21:59:42,517 INFO L109 eAbstractionObserver]: Analyzing ICFG splice-2.i [2019-11-23 21:59:42,527 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-23 21:59:42,534 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-23 21:59:42,546 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-23 21:59:42,576 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-23 21:59:42,576 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-23 21:59:42,576 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-23 21:59:42,577 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-23 21:59:42,577 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-23 21:59:42,577 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-23 21:59:42,577 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-23 21:59:42,578 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-23 21:59:42,594 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states. [2019-11-23 21:59:42,600 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-11-23 21:59:42,601 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 21:59:42,602 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 21:59:42,602 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 21:59:42,608 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 21:59:42,608 INFO L82 PathProgramCache]: Analyzing trace with hash -427823588, now seen corresponding path program 1 times [2019-11-23 21:59:42,618 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 21:59:42,618 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [703089328] [2019-11-23 21:59:42,618 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 21:59:42,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 21:59:42,743 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 21:59:42,744 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [703089328] [2019-11-23 21:59:42,745 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 21:59:42,745 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-23 21:59:42,746 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [724260805] [2019-11-23 21:59:42,751 INFO L442 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-11-23 21:59:42,751 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 21:59:42,761 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-11-23 21:59:42,762 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-11-23 21:59:42,763 INFO L87 Difference]: Start difference. First operand 29 states. Second operand 2 states. [2019-11-23 21:59:42,780 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 21:59:42,780 INFO L93 Difference]: Finished difference Result 46 states and 69 transitions. [2019-11-23 21:59:42,781 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-11-23 21:59:42,782 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 12 [2019-11-23 21:59:42,782 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 21:59:42,791 INFO L225 Difference]: With dead ends: 46 [2019-11-23 21:59:42,791 INFO L226 Difference]: Without dead ends: 23 [2019-11-23 21:59:42,795 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-11-23 21:59:42,808 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2019-11-23 21:59:42,820 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2019-11-23 21:59:42,821 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2019-11-23 21:59:42,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 29 transitions. [2019-11-23 21:59:42,823 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 29 transitions. Word has length 12 [2019-11-23 21:59:42,824 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 21:59:42,824 INFO L462 AbstractCegarLoop]: Abstraction has 23 states and 29 transitions. [2019-11-23 21:59:42,824 INFO L463 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-11-23 21:59:42,824 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 29 transitions. [2019-11-23 21:59:42,825 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-11-23 21:59:42,825 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 21:59:42,825 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 21:59:42,825 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 21:59:42,826 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 21:59:42,826 INFO L82 PathProgramCache]: Analyzing trace with hash 1140031955, now seen corresponding path program 1 times [2019-11-23 21:59:42,826 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 21:59:42,827 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1907648888] [2019-11-23 21:59:42,827 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 21:59:42,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 21:59:42,922 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 21:59:42,923 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1907648888] [2019-11-23 21:59:42,923 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 21:59:42,923 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-23 21:59:42,924 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1244734592] [2019-11-23 21:59:42,925 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-23 21:59:42,925 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 21:59:42,926 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-23 21:59:42,926 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-23 21:59:42,926 INFO L87 Difference]: Start difference. First operand 23 states and 29 transitions. Second operand 4 states. [2019-11-23 21:59:43,017 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 21:59:43,018 INFO L93 Difference]: Finished difference Result 40 states and 51 transitions. [2019-11-23 21:59:43,018 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-23 21:59:43,019 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2019-11-23 21:59:43,019 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 21:59:43,020 INFO L225 Difference]: With dead ends: 40 [2019-11-23 21:59:43,020 INFO L226 Difference]: Without dead ends: 33 [2019-11-23 21:59:43,021 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-23 21:59:43,021 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2019-11-23 21:59:43,026 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 28. [2019-11-23 21:59:43,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2019-11-23 21:59:43,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 36 transitions. [2019-11-23 21:59:43,027 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 36 transitions. Word has length 14 [2019-11-23 21:59:43,028 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 21:59:43,028 INFO L462 AbstractCegarLoop]: Abstraction has 28 states and 36 transitions. [2019-11-23 21:59:43,028 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-23 21:59:43,028 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 36 transitions. [2019-11-23 21:59:43,029 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-11-23 21:59:43,029 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 21:59:43,029 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 21:59:43,029 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 21:59:43,030 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 21:59:43,030 INFO L82 PathProgramCache]: Analyzing trace with hash 352372424, now seen corresponding path program 1 times [2019-11-23 21:59:43,030 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 21:59:43,030 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [759770147] [2019-11-23 21:59:43,031 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 21:59:43,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 21:59:43,117 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 21:59:43,118 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [759770147] [2019-11-23 21:59:43,118 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 21:59:43,118 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-23 21:59:43,119 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1380139662] [2019-11-23 21:59:43,119 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-23 21:59:43,119 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 21:59:43,125 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-23 21:59:43,125 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-23 21:59:43,125 INFO L87 Difference]: Start difference. First operand 28 states and 36 transitions. Second operand 4 states. [2019-11-23 21:59:43,203 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 21:59:43,204 INFO L93 Difference]: Finished difference Result 47 states and 60 transitions. [2019-11-23 21:59:43,205 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-23 21:59:43,205 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2019-11-23 21:59:43,205 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 21:59:43,207 INFO L225 Difference]: With dead ends: 47 [2019-11-23 21:59:43,208 INFO L226 Difference]: Without dead ends: 39 [2019-11-23 21:59:43,209 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-23 21:59:43,209 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2019-11-23 21:59:43,215 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 37. [2019-11-23 21:59:43,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2019-11-23 21:59:43,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 49 transitions. [2019-11-23 21:59:43,217 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 49 transitions. Word has length 16 [2019-11-23 21:59:43,217 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 21:59:43,217 INFO L462 AbstractCegarLoop]: Abstraction has 37 states and 49 transitions. [2019-11-23 21:59:43,217 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-23 21:59:43,218 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 49 transitions. [2019-11-23 21:59:43,218 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-11-23 21:59:43,219 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 21:59:43,219 INFO L410 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 21:59:43,219 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 21:59:43,219 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 21:59:43,220 INFO L82 PathProgramCache]: Analyzing trace with hash -1051666739, now seen corresponding path program 1 times [2019-11-23 21:59:43,220 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 21:59:43,220 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1519294338] [2019-11-23 21:59:43,221 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 21:59:43,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 21:59:43,326 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 21:59:43,327 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1519294338] [2019-11-23 21:59:43,327 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 21:59:43,328 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-23 21:59:43,328 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [731189021] [2019-11-23 21:59:43,329 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-23 21:59:43,329 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 21:59:43,330 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-23 21:59:43,330 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-11-23 21:59:43,331 INFO L87 Difference]: Start difference. First operand 37 states and 49 transitions. Second operand 6 states. [2019-11-23 21:59:43,525 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 21:59:43,525 INFO L93 Difference]: Finished difference Result 70 states and 94 transitions. [2019-11-23 21:59:43,527 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-23 21:59:43,527 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 17 [2019-11-23 21:59:43,527 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 21:59:43,528 INFO L225 Difference]: With dead ends: 70 [2019-11-23 21:59:43,528 INFO L226 Difference]: Without dead ends: 43 [2019-11-23 21:59:43,530 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2019-11-23 21:59:43,531 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2019-11-23 21:59:43,537 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 39. [2019-11-23 21:59:43,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2019-11-23 21:59:43,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 51 transitions. [2019-11-23 21:59:43,539 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 51 transitions. Word has length 17 [2019-11-23 21:59:43,539 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 21:59:43,540 INFO L462 AbstractCegarLoop]: Abstraction has 39 states and 51 transitions. [2019-11-23 21:59:43,540 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-23 21:59:43,541 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 51 transitions. [2019-11-23 21:59:43,542 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-11-23 21:59:43,542 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 21:59:43,542 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] [2019-11-23 21:59:43,542 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 21:59:43,543 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 21:59:43,543 INFO L82 PathProgramCache]: Analyzing trace with hash -86042878, now seen corresponding path program 1 times [2019-11-23 21:59:43,544 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 21:59:43,544 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2117148887] [2019-11-23 21:59:43,544 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 21:59:43,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 21:59:43,867 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 21:59:43,867 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2117148887] [2019-11-23 21:59:43,868 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [914997955] [2019-11-23 21:59:43,868 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 21:59:43,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 21:59:43,949 INFO L255 TraceCheckSpWp]: Trace formula consists of 114 conjuncts, 41 conjunts are in the unsatisfiable core [2019-11-23 21:59:43,956 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-23 21:59:44,013 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 6 treesize of output 5 [2019-11-23 21:59:44,013 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 21:59:44,023 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:59:44,024 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-23 21:59:44,024 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-11-23 21:59:44,043 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-11-23 21:59:44,043 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 21:59:44,054 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:59:44,055 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-23 21:59:44,055 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:26, output treesize:22 [2019-11-23 21:59:44,069 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:59:44,070 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 11 treesize of output 15 [2019-11-23 21:59:44,071 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 21:59:44,087 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:59:44,088 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-23 21:59:44,088 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:27, output treesize:21 [2019-11-23 21:59:44,111 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 21:59:44,114 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 11 [2019-11-23 21:59:44,115 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 21:59:44,124 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:59:44,125 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-23 21:59:44,125 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:34, output treesize:15 [2019-11-23 21:59:44,161 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2019-11-23 21:59:44,161 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 21:59:44,173 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:59:44,174 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-23 21:59:44,175 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:26, output treesize:22 [2019-11-23 21:59:44,302 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 21 [2019-11-23 21:59:44,303 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 21:59:44,313 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:59:44,314 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-23 21:59:44,315 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:37, output treesize:22 [2019-11-23 21:59:44,407 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2019-11-23 21:59:44,409 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 21:59:44,414 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:59:44,415 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-23 21:59:44,415 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:26, output treesize:3 [2019-11-23 21:59:44,423 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 21:59:44,424 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-23 21:59:44,424 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12] total 18 [2019-11-23 21:59:44,424 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1930708953] [2019-11-23 21:59:44,426 INFO L442 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-11-23 21:59:44,426 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 21:59:44,427 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-11-23 21:59:44,428 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=256, Unknown=0, NotChecked=0, Total=306 [2019-11-23 21:59:44,429 INFO L87 Difference]: Start difference. First operand 39 states and 51 transitions. Second operand 18 states. [2019-11-23 21:59:45,938 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 21:59:45,939 INFO L93 Difference]: Finished difference Result 125 states and 161 transitions. [2019-11-23 21:59:45,939 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2019-11-23 21:59:45,939 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 23 [2019-11-23 21:59:45,940 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 21:59:45,941 INFO L225 Difference]: With dead ends: 125 [2019-11-23 21:59:45,941 INFO L226 Difference]: Without dead ends: 123 [2019-11-23 21:59:45,942 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 17 SyntacticMatches, 2 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 478 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=349, Invalid=1543, Unknown=0, NotChecked=0, Total=1892 [2019-11-23 21:59:45,943 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2019-11-23 21:59:45,953 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 63. [2019-11-23 21:59:45,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2019-11-23 21:59:45,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 83 transitions. [2019-11-23 21:59:45,955 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 83 transitions. Word has length 23 [2019-11-23 21:59:45,955 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 21:59:45,955 INFO L462 AbstractCegarLoop]: Abstraction has 63 states and 83 transitions. [2019-11-23 21:59:45,955 INFO L463 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-11-23 21:59:45,955 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 83 transitions. [2019-11-23 21:59:45,956 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-11-23 21:59:45,956 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 21:59:45,957 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] [2019-11-23 21:59:46,160 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 21:59:46,163 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 21:59:46,164 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 21:59:46,164 INFO L82 PathProgramCache]: Analyzing trace with hash -1674390780, now seen corresponding path program 1 times [2019-11-23 21:59:46,165 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 21:59:46,165 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [450020402] [2019-11-23 21:59:46,165 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 21:59:46,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 21:59:46,232 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-11-23 21:59:46,233 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [450020402] [2019-11-23 21:59:46,233 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 21:59:46,233 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 21:59:46,234 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [979469597] [2019-11-23 21:59:46,235 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 21:59:46,235 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 21:59:46,235 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 21:59:46,236 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 21:59:46,236 INFO L87 Difference]: Start difference. First operand 63 states and 83 transitions. Second operand 3 states. [2019-11-23 21:59:46,267 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 21:59:46,268 INFO L93 Difference]: Finished difference Result 120 states and 159 transitions. [2019-11-23 21:59:46,268 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 21:59:46,268 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2019-11-23 21:59:46,268 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 21:59:46,269 INFO L225 Difference]: With dead ends: 120 [2019-11-23 21:59:46,269 INFO L226 Difference]: Without dead ends: 74 [2019-11-23 21:59:46,271 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 21:59:46,272 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2019-11-23 21:59:46,284 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 64. [2019-11-23 21:59:46,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2019-11-23 21:59:46,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 79 transitions. [2019-11-23 21:59:46,286 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 79 transitions. Word has length 23 [2019-11-23 21:59:46,287 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 21:59:46,287 INFO L462 AbstractCegarLoop]: Abstraction has 64 states and 79 transitions. [2019-11-23 21:59:46,287 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 21:59:46,287 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 79 transitions. [2019-11-23 21:59:46,289 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-11-23 21:59:46,289 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 21:59:46,289 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 21:59:46,289 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 21:59:46,289 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 21:59:46,289 INFO L82 PathProgramCache]: Analyzing trace with hash -1082792963, now seen corresponding path program 1 times [2019-11-23 21:59:46,290 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 21:59:46,290 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1321969421] [2019-11-23 21:59:46,290 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 21:59:46,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 21:59:46,513 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 21:59:46,513 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1321969421] [2019-11-23 21:59:46,514 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1416182657] [2019-11-23 21:59:46,514 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 21:59:46,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 21:59:46,567 INFO L255 TraceCheckSpWp]: Trace formula consists of 123 conjuncts, 27 conjunts are in the unsatisfiable core [2019-11-23 21:59:46,569 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-23 21:59:46,580 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-11-23 21:59:46,581 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 21:59:46,587 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:59:46,590 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-11-23 21:59:46,591 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-23 21:59:46,599 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:59:46,599 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-23 21:59:46,599 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:26, output treesize:18 [2019-11-23 21:59:46,621 INFO L377 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 15 treesize of output 7 [2019-11-23 21:59:46,621 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 21:59:46,627 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:59:46,630 INFO L377 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 15 treesize of output 7 [2019-11-23 21:59:46,631 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-23 21:59:46,636 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:59:46,636 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-23 21:59:46,637 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:29, output treesize:7 [2019-11-23 21:59:46,639 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-11-23 21:59:46,639 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-23 21:59:46,639 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 9 [2019-11-23 21:59:46,640 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [225304869] [2019-11-23 21:59:46,640 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-11-23 21:59:46,641 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 21:59:46,641 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-11-23 21:59:46,641 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2019-11-23 21:59:46,641 INFO L87 Difference]: Start difference. First operand 64 states and 79 transitions. Second operand 9 states. [2019-11-23 21:59:46,877 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 21:59:46,878 INFO L93 Difference]: Finished difference Result 79 states and 96 transitions. [2019-11-23 21:59:46,878 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-11-23 21:59:46,878 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 25 [2019-11-23 21:59:46,878 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 21:59:46,879 INFO L225 Difference]: With dead ends: 79 [2019-11-23 21:59:46,879 INFO L226 Difference]: Without dead ends: 71 [2019-11-23 21:59:46,881 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 26 SyntacticMatches, 2 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=49, Invalid=161, Unknown=0, NotChecked=0, Total=210 [2019-11-23 21:59:46,882 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2019-11-23 21:59:46,898 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 68. [2019-11-23 21:59:46,898 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2019-11-23 21:59:46,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 83 transitions. [2019-11-23 21:59:46,900 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 83 transitions. Word has length 25 [2019-11-23 21:59:46,901 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 21:59:46,901 INFO L462 AbstractCegarLoop]: Abstraction has 68 states and 83 transitions. [2019-11-23 21:59:46,901 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-11-23 21:59:46,901 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 83 transitions. [2019-11-23 21:59:46,902 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-11-23 21:59:46,902 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 21:59:46,903 INFO L410 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 21:59:47,115 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 21:59:47,116 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 21:59:47,116 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 21:59:47,116 INFO L82 PathProgramCache]: Analyzing trace with hash -870124096, now seen corresponding path program 1 times [2019-11-23 21:59:47,117 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 21:59:47,117 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1316117147] [2019-11-23 21:59:47,117 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 21:59:47,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 21:59:47,476 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 21:59:47,477 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1316117147] [2019-11-23 21:59:47,477 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1050344675] [2019-11-23 21:59:47,477 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 21:59:47,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 21:59:47,540 INFO L255 TraceCheckSpWp]: Trace formula consists of 136 conjuncts, 34 conjunts are in the unsatisfiable core [2019-11-23 21:59:47,542 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-23 21:59:47,548 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 6 treesize of output 5 [2019-11-23 21:59:47,549 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 21:59:47,551 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:59:47,551 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-23 21:59:47,551 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2019-11-23 21:59:47,602 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:59:47,603 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 11 treesize of output 15 [2019-11-23 21:59:47,603 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 21:59:47,607 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:59:47,608 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-23 21:59:47,608 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:11 [2019-11-23 21:59:47,632 INFO L377 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 13 treesize of output 9 [2019-11-23 21:59:47,633 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 21:59:47,642 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:59:47,647 INFO L377 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 13 treesize of output 9 [2019-11-23 21:59:47,647 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-23 21:59:47,659 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:59:47,660 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-23 21:59:47,660 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:49, output treesize:29 [2019-11-23 21:59:47,699 INFO L392 ElimStorePlain]: Different costs {0=[|v_#memory_int_20|], 2=[|v_#memory_$Pointer$.offset_18|, |v_#memory_$Pointer$.base_19|]} [2019-11-23 21:59:47,704 INFO L377 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 29 treesize of output 19 [2019-11-23 21:59:47,704 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 21:59:47,717 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:59:47,723 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 110 treesize of output 82 [2019-11-23 21:59:47,724 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-23 21:59:47,736 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:59:47,761 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:59:47,762 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 75 treesize of output 105 [2019-11-23 21:59:47,763 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:59:47,763 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:59:47,766 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:59:47,767 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 3 xjuncts. [2019-11-23 21:59:47,784 INFO L567 ElimStorePlain]: treesize reduction 98, result has 23.4 percent of original size [2019-11-23 21:59:47,784 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-23 21:59:47,784 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:130, output treesize:30 [2019-11-23 21:59:47,844 INFO L377 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 39 treesize of output 21 [2019-11-23 21:59:47,844 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 21:59:47,851 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:59:47,854 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2019-11-23 21:59:47,855 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-23 21:59:47,864 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:59:47,864 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-23 21:59:47,865 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:48, output treesize:12 [2019-11-23 21:59:47,897 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 11 [2019-11-23 21:59:47,900 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 21:59:47,904 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:59:47,905 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-23 21:59:47,905 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:31, output treesize:7 [2019-11-23 21:59:47,931 INFO L377 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 15 treesize of output 7 [2019-11-23 21:59:47,932 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 21:59:47,934 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:59:47,935 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-23 21:59:47,935 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:15, output treesize:3 [2019-11-23 21:59:47,961 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 5 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 21:59:47,961 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-23 21:59:47,961 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 11] total 24 [2019-11-23 21:59:47,961 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2070576748] [2019-11-23 21:59:47,962 INFO L442 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-11-23 21:59:47,962 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 21:59:47,962 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-11-23 21:59:47,964 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=491, Unknown=0, NotChecked=0, Total=552 [2019-11-23 21:59:47,965 INFO L87 Difference]: Start difference. First operand 68 states and 83 transitions. Second operand 24 states. [2019-11-23 21:59:49,905 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 21:59:49,905 INFO L93 Difference]: Finished difference Result 134 states and 172 transitions. [2019-11-23 21:59:49,911 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2019-11-23 21:59:49,911 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 26 [2019-11-23 21:59:49,911 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 21:59:49,912 INFO L225 Difference]: With dead ends: 134 [2019-11-23 21:59:49,912 INFO L226 Difference]: Without dead ends: 100 [2019-11-23 21:59:49,917 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 400 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=308, Invalid=1948, Unknown=0, NotChecked=0, Total=2256 [2019-11-23 21:59:49,917 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2019-11-23 21:59:49,934 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 65. [2019-11-23 21:59:49,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2019-11-23 21:59:49,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 82 transitions. [2019-11-23 21:59:49,935 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 82 transitions. Word has length 26 [2019-11-23 21:59:49,935 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 21:59:49,935 INFO L462 AbstractCegarLoop]: Abstraction has 65 states and 82 transitions. [2019-11-23 21:59:49,935 INFO L463 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-11-23 21:59:49,935 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 82 transitions. [2019-11-23 21:59:49,938 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-11-23 21:59:49,938 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 21:59:49,939 INFO L410 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 21:59:50,142 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 21:59:50,143 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 21:59:50,143 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 21:59:50,143 INFO L82 PathProgramCache]: Analyzing trace with hash -731407497, now seen corresponding path program 2 times [2019-11-23 21:59:50,144 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 21:59:50,144 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2093992174] [2019-11-23 21:59:50,144 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 21:59:50,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 21:59:50,195 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-11-23 21:59:50,196 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2093992174] [2019-11-23 21:59:50,196 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 21:59:50,196 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 21:59:50,196 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1259039913] [2019-11-23 21:59:50,197 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 21:59:50,198 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 21:59:50,198 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 21:59:50,198 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 21:59:50,198 INFO L87 Difference]: Start difference. First operand 65 states and 82 transitions. Second operand 3 states. [2019-11-23 21:59:50,213 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 21:59:50,214 INFO L93 Difference]: Finished difference Result 112 states and 141 transitions. [2019-11-23 21:59:50,214 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 21:59:50,214 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 29 [2019-11-23 21:59:50,215 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 21:59:50,215 INFO L225 Difference]: With dead ends: 112 [2019-11-23 21:59:50,215 INFO L226 Difference]: Without dead ends: 59 [2019-11-23 21:59:50,217 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 21:59:50,217 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2019-11-23 21:59:50,225 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 48. [2019-11-23 21:59:50,226 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2019-11-23 21:59:50,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 55 transitions. [2019-11-23 21:59:50,227 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 55 transitions. Word has length 29 [2019-11-23 21:59:50,227 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 21:59:50,228 INFO L462 AbstractCegarLoop]: Abstraction has 48 states and 55 transitions. [2019-11-23 21:59:50,228 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 21:59:50,228 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 55 transitions. [2019-11-23 21:59:50,232 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-11-23 21:59:50,232 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 21:59:50,232 INFO L410 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 21:59:50,232 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 21:59:50,233 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 21:59:50,235 INFO L82 PathProgramCache]: Analyzing trace with hash 1975211897, now seen corresponding path program 1 times [2019-11-23 21:59:50,235 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 21:59:50,236 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2108081545] [2019-11-23 21:59:50,236 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 21:59:50,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 21:59:50,530 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 21:59:50,531 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2108081545] [2019-11-23 21:59:50,531 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [426772018] [2019-11-23 21:59:50,531 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 21:59:50,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 21:59:50,593 INFO L255 TraceCheckSpWp]: Trace formula consists of 144 conjuncts, 51 conjunts are in the unsatisfiable core [2019-11-23 21:59:50,595 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-23 21:59:50,600 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 6 treesize of output 5 [2019-11-23 21:59:50,601 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 21:59:50,615 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:59:50,616 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-23 21:59:50,616 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-11-23 21:59:50,638 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-11-23 21:59:50,638 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 21:59:50,653 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:59:50,654 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-23 21:59:50,654 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:26, output treesize:22 [2019-11-23 21:59:50,674 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:59:50,675 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 2 case distinctions, treesize of input 17 treesize of output 39 [2019-11-23 21:59:50,676 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 21:59:50,708 INFO L567 ElimStorePlain]: treesize reduction 14, result has 68.9 percent of original size [2019-11-23 21:59:50,709 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-23 21:59:50,709 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:33, output treesize:31 [2019-11-23 21:59:50,744 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 21:59:50,746 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 11 [2019-11-23 21:59:50,746 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 21:59:50,754 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:59:50,755 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-23 21:59:50,755 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:44, output treesize:25 [2019-11-23 21:59:50,791 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2019-11-23 21:59:50,791 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 21:59:50,808 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:59:50,808 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-23 21:59:50,809 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:36, output treesize:32 [2019-11-23 21:59:50,870 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:59:50,870 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 26 [2019-11-23 21:59:50,871 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 21:59:50,879 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:59:50,880 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-23 21:59:50,880 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:37, output treesize:30 [2019-11-23 21:59:50,920 INFO L343 Elim1Store]: treesize reduction 27, result has 20.6 percent of original size [2019-11-23 21:59:50,921 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 21 [2019-11-23 21:59:50,922 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 21:59:50,939 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:59:50,940 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-23 21:59:50,940 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:49, output treesize:30 [2019-11-23 21:59:50,981 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 28 [2019-11-23 21:59:50,982 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 21:59:50,994 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:59:50,995 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-23 21:59:50,995 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:41, output treesize:37 [2019-11-23 21:59:51,109 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 31 [2019-11-23 21:59:51,109 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 21:59:51,128 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:59:51,129 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-23 21:59:51,129 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:52, output treesize:37 [2019-11-23 21:59:51,179 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 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 29 treesize of output 13 [2019-11-23 21:59:51,180 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 21:59:51,186 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:59:51,187 INFO L496 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-23 21:59:51,187 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:41, output treesize:3 [2019-11-23 21:59:51,192 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 21:59:51,193 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-23 21:59:51,193 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 15] total 25 [2019-11-23 21:59:51,193 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [15587151] [2019-11-23 21:59:51,194 INFO L442 AbstractCegarLoop]: Interpolant automaton has 25 states [2019-11-23 21:59:51,194 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 21:59:51,194 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2019-11-23 21:59:51,194 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=503, Unknown=0, NotChecked=0, Total=600 [2019-11-23 21:59:51,195 INFO L87 Difference]: Start difference. First operand 48 states and 55 transitions. Second operand 25 states. [2019-11-23 21:59:52,148 WARN L192 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 76 [2019-11-23 21:59:52,331 WARN L192 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 73 [2019-11-23 21:59:53,682 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 21:59:53,682 INFO L93 Difference]: Finished difference Result 96 states and 108 transitions. [2019-11-23 21:59:53,683 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2019-11-23 21:59:53,683 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 29 [2019-11-23 21:59:53,683 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 21:59:53,684 INFO L225 Difference]: With dead ends: 96 [2019-11-23 21:59:53,684 INFO L226 Difference]: Without dead ends: 88 [2019-11-23 21:59:53,688 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 20 SyntacticMatches, 2 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 887 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=492, Invalid=2478, Unknown=0, NotChecked=0, Total=2970 [2019-11-23 21:59:53,698 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2019-11-23 21:59:53,711 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 67. [2019-11-23 21:59:53,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2019-11-23 21:59:53,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 76 transitions. [2019-11-23 21:59:53,713 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 76 transitions. Word has length 29 [2019-11-23 21:59:53,713 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 21:59:53,713 INFO L462 AbstractCegarLoop]: Abstraction has 67 states and 76 transitions. [2019-11-23 21:59:53,713 INFO L463 AbstractCegarLoop]: Interpolant automaton has 25 states. [2019-11-23 21:59:53,713 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 76 transitions. [2019-11-23 21:59:53,714 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-11-23 21:59:53,714 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 21:59:53,714 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 21:59:53,914 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 21:59:53,915 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 21:59:53,915 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 21:59:53,915 INFO L82 PathProgramCache]: Analyzing trace with hash 823447017, now seen corresponding path program 1 times [2019-11-23 21:59:53,916 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 21:59:53,916 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1237987557] [2019-11-23 21:59:53,916 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 21:59:53,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 21:59:54,362 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 21:59:54,362 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1237987557] [2019-11-23 21:59:54,362 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1540563409] [2019-11-23 21:59:54,363 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 21:59:54,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 21:59:54,440 INFO L255 TraceCheckSpWp]: Trace formula consists of 166 conjuncts, 58 conjunts are in the unsatisfiable core [2019-11-23 21:59:54,444 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-23 21:59:54,449 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 6 treesize of output 5 [2019-11-23 21:59:54,449 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 21:59:54,453 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:59:54,453 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-23 21:59:54,453 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-11-23 21:59:54,470 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-11-23 21:59:54,470 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 21:59:54,484 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:59:54,485 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-23 21:59:54,485 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:26, output treesize:22 [2019-11-23 21:59:54,505 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:59:54,506 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 2 case distinctions, treesize of input 17 treesize of output 39 [2019-11-23 21:59:54,506 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 21:59:54,539 INFO L567 ElimStorePlain]: treesize reduction 14, result has 68.9 percent of original size [2019-11-23 21:59:54,540 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-23 21:59:54,540 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:33, output treesize:31 [2019-11-23 21:59:54,581 INFO L392 ElimStorePlain]: Different costs {0=[|v_#memory_$Pointer$.base_22|], 2=[|v_#memory_int_29|]} [2019-11-23 21:59:54,587 INFO L377 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 13 treesize of output 9 [2019-11-23 21:59:54,587 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 21:59:54,611 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:59:54,616 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 21:59:54,617 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 11 [2019-11-23 21:59:54,617 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-23 21:59:54,633 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:59:54,634 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-23 21:59:54,634 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:66, output treesize:46 [2019-11-23 21:59:54,699 INFO L343 Elim1Store]: treesize reduction 25, result has 43.2 percent of original size [2019-11-23 21:59:54,699 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 46 treesize of output 32 [2019-11-23 21:59:54,699 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 21:59:54,729 INFO L567 ElimStorePlain]: treesize reduction 10, result has 81.8 percent of original size [2019-11-23 21:59:54,731 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2019-11-23 21:59:54,732 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-23 21:59:54,746 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:59:54,746 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-23 21:59:54,746 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:72, output treesize:41 [2019-11-23 21:59:54,794 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:59:54,795 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 26 [2019-11-23 21:59:54,795 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 21:59:54,808 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:59:54,808 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-23 21:59:54,809 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:46, output treesize:39 [2019-11-23 21:59:54,852 INFO L392 ElimStorePlain]: Different costs {2=[|v_#memory_$Pointer$.base_24|], 6=[|v_#memory_int_31|]} [2019-11-23 21:59:54,876 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:59:54,877 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 111 treesize of output 99 [2019-11-23 21:59:54,878 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:59:54,879 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 21:59:54,941 INFO L567 ElimStorePlain]: treesize reduction 28, result has 80.4 percent of original size [2019-11-23 21:59:54,946 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 21:59:54,947 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 27 [2019-11-23 21:59:54,948 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-23 21:59:54,965 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:59:54,966 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-23 21:59:54,966 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:125, output treesize:87 [2019-11-23 21:59:55,064 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:59:55,065 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 148 treesize of output 150 [2019-11-23 21:59:55,066 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:59:55,066 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:59:55,067 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:59:55,069 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:59:55,070 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:59:55,071 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-11-23 21:59:55,135 INFO L567 ElimStorePlain]: treesize reduction 323, result has 24.9 percent of original size [2019-11-23 21:59:55,139 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 46 [2019-11-23 21:59:55,140 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-23 21:59:55,169 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:59:55,170 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-11-23 21:59:55,170 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:158, output treesize:91 [2019-11-23 21:59:55,263 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-23 21:59:55,269 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:59:55,269 INFO L377 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 2 case distinctions, treesize of input 78 treesize of output 49 [2019-11-23 21:59:55,270 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:59:55,271 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:59:55,272 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-23 21:59:55,300 INFO L567 ElimStorePlain]: treesize reduction 16, result has 69.8 percent of original size [2019-11-23 21:59:55,301 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-11-23 21:59:55,302 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:88, output treesize:37 [2019-11-23 21:59:55,345 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 31 [2019-11-23 21:59:55,346 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 21:59:55,359 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:59:55,360 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-23 21:59:55,361 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:52, output treesize:37 [2019-11-23 21:59:55,465 INFO L343 Elim1Store]: treesize reduction 21, result has 38.2 percent of original size [2019-11-23 21:59:55,466 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 41 treesize of output 37 [2019-11-23 21:59:55,467 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 21:59:55,483 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:59:55,483 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:59:55,485 INFO L496 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-2 vars, End of recursive call: 6 dim-0 vars, and 1 xjuncts. [2019-11-23 21:59:55,486 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:56, output treesize:51 [2019-11-23 21:59:55,590 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2019-11-23 21:59:55,591 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 21:59:55,595 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:59:55,595 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-23 21:59:55,595 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:26, output treesize:3 [2019-11-23 21:59:55,605 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 21:59:55,605 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-23 21:59:55,605 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18] total 30 [2019-11-23 21:59:55,606 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1950305754] [2019-11-23 21:59:55,606 INFO L442 AbstractCegarLoop]: Interpolant automaton has 30 states [2019-11-23 21:59:55,606 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 21:59:55,606 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2019-11-23 21:59:55,607 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=107, Invalid=763, Unknown=0, NotChecked=0, Total=870 [2019-11-23 21:59:55,607 INFO L87 Difference]: Start difference. First operand 67 states and 76 transitions. Second operand 30 states. [2019-11-23 21:59:58,291 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 21:59:58,291 INFO L93 Difference]: Finished difference Result 111 states and 129 transitions. [2019-11-23 21:59:58,292 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2019-11-23 21:59:58,292 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 32 [2019-11-23 21:59:58,292 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 21:59:58,293 INFO L225 Difference]: With dead ends: 111 [2019-11-23 21:59:58,294 INFO L226 Difference]: Without dead ends: 109 [2019-11-23 21:59:58,296 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 20 SyntacticMatches, 2 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1116 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=475, Invalid=3431, Unknown=0, NotChecked=0, Total=3906 [2019-11-23 21:59:58,296 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2019-11-23 21:59:58,303 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 73. [2019-11-23 21:59:58,303 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2019-11-23 21:59:58,303 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 84 transitions. [2019-11-23 21:59:58,304 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 84 transitions. Word has length 32 [2019-11-23 21:59:58,304 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 21:59:58,304 INFO L462 AbstractCegarLoop]: Abstraction has 73 states and 84 transitions. [2019-11-23 21:59:58,304 INFO L463 AbstractCegarLoop]: Interpolant automaton has 30 states. [2019-11-23 21:59:58,304 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 84 transitions. [2019-11-23 21:59:58,305 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-11-23 21:59:58,305 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 21:59:58,305 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 21:59:58,508 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 21:59:58,509 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 21:59:58,509 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 21:59:58,510 INFO L82 PathProgramCache]: Analyzing trace with hash 1056925022, now seen corresponding path program 1 times [2019-11-23 21:59:58,510 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 21:59:58,510 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1466139656] [2019-11-23 21:59:58,511 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 21:59:58,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 21:59:58,573 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2019-11-23 21:59:58,573 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1466139656] [2019-11-23 21:59:58,573 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1628018802] [2019-11-23 21:59:58,573 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 21:59:58,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 21:59:58,635 INFO L255 TraceCheckSpWp]: Trace formula consists of 174 conjuncts, 15 conjunts are in the unsatisfiable core [2019-11-23 21:59:58,637 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-23 21:59:58,650 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2019-11-23 21:59:58,650 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-23 21:59:58,651 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7] total 7 [2019-11-23 21:59:58,656 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2061598126] [2019-11-23 21:59:58,657 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-23 21:59:58,657 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 21:59:58,657 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-23 21:59:58,657 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-11-23 21:59:58,657 INFO L87 Difference]: Start difference. First operand 73 states and 84 transitions. Second operand 7 states. [2019-11-23 21:59:58,804 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 21:59:58,805 INFO L93 Difference]: Finished difference Result 96 states and 110 transitions. [2019-11-23 21:59:58,805 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-11-23 21:59:58,805 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 34 [2019-11-23 21:59:58,805 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 21:59:58,806 INFO L225 Difference]: With dead ends: 96 [2019-11-23 21:59:58,806 INFO L226 Difference]: Without dead ends: 91 [2019-11-23 21:59:58,807 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=74, Invalid=136, Unknown=0, NotChecked=0, Total=210 [2019-11-23 21:59:58,807 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2019-11-23 21:59:58,814 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 78. [2019-11-23 21:59:58,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2019-11-23 21:59:58,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 89 transitions. [2019-11-23 21:59:58,815 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 89 transitions. Word has length 34 [2019-11-23 21:59:58,815 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 21:59:58,815 INFO L462 AbstractCegarLoop]: Abstraction has 78 states and 89 transitions. [2019-11-23 21:59:58,815 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-23 21:59:58,815 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 89 transitions. [2019-11-23 21:59:58,816 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-11-23 21:59:58,816 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 21:59:58,816 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 21:59:59,019 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 21:59:59,019 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 21:59:59,020 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 21:59:59,020 INFO L82 PathProgramCache]: Analyzing trace with hash 1058635044, now seen corresponding path program 1 times [2019-11-23 21:59:59,020 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 21:59:59,020 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1180273422] [2019-11-23 21:59:59,020 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 21:59:59,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 21:59:59,460 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 1 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 21:59:59,461 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1180273422] [2019-11-23 21:59:59,461 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [208843718] [2019-11-23 21:59:59,461 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 21:59:59,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 21:59:59,521 INFO L255 TraceCheckSpWp]: Trace formula consists of 175 conjuncts, 69 conjunts are in the unsatisfiable core [2019-11-23 21:59:59,524 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-23 21:59:59,530 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 6 treesize of output 5 [2019-11-23 21:59:59,531 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 21:59:59,534 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:59:59,534 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-23 21:59:59,535 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-11-23 21:59:59,556 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:59:59,557 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 2 case distinctions, treesize of input 17 treesize of output 39 [2019-11-23 21:59:59,557 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 21:59:59,590 INFO L567 ElimStorePlain]: treesize reduction 14, result has 65.9 percent of original size [2019-11-23 21:59:59,590 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-23 21:59:59,591 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:29, output treesize:27 [2019-11-23 21:59:59,653 INFO L377 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 11 treesize of output 7 [2019-11-23 21:59:59,653 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 21:59:59,669 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:59:59,674 INFO L377 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 11 treesize of output 7 [2019-11-23 21:59:59,674 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-23 21:59:59,692 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:59:59,693 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-23 21:59:59,693 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:47, output treesize:40 [2019-11-23 21:59:59,770 INFO L343 Elim1Store]: treesize reduction 21, result has 41.7 percent of original size [2019-11-23 21:59:59,770 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 40 treesize of output 28 [2019-11-23 21:59:59,771 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 21:59:59,803 INFO L567 ElimStorePlain]: treesize reduction 8, result has 85.5 percent of original size [2019-11-23 21:59:59,807 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2019-11-23 21:59:59,807 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-23 21:59:59,818 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:59:59,818 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-23 21:59:59,818 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:70, output treesize:32 [2019-11-23 21:59:59,848 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:59:59,849 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 20 treesize of output 30 [2019-11-23 21:59:59,849 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 21:59:59,861 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:59:59,861 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-23 21:59:59,861 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:45, output treesize:38 [2019-11-23 21:59:59,911 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:59:59,911 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 72 treesize of output 78 [2019-11-23 21:59:59,912 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:59:59,913 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 21:59:59,956 INFO L567 ElimStorePlain]: treesize reduction 22, result has 78.0 percent of original size [2019-11-23 21:59:59,965 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 24 [2019-11-23 21:59:59,965 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-23 21:59:59,980 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:59:59,981 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-23 21:59:59,982 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:86, output treesize:64 [2019-11-23 22:00:00,021 INFO L392 ElimStorePlain]: Different costs {2=[|v_#memory_$Pointer$.offset_22|], 6=[|v_#memory_$Pointer$.base_29|]} [2019-11-23 22:00:00,024 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 11 [2019-11-23 22:00:00,025 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 22:00:00,042 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 22:00:00,094 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 22:00:00,095 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 86 treesize of output 122 [2019-11-23 22:00:00,096 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 22:00:00,097 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 22:00:00,097 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 22:00:00,098 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 22:00:00,098 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 22:00:00,099 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 3 xjuncts. [2019-11-23 22:00:00,138 INFO L567 ElimStorePlain]: treesize reduction 333, result has 13.3 percent of original size [2019-11-23 22:00:00,139 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-23 22:00:00,140 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:141, output treesize:51 [2019-11-23 22:00:00,278 INFO L392 ElimStorePlain]: Different costs {1=[|v_#memory_$Pointer$.offset_23|], 5=[|v_#memory_$Pointer$.base_30|]} [2019-11-23 22:00:00,287 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2019-11-23 22:00:00,287 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 22:00:00,304 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 22:00:00,330 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 22:00:00,330 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 59 treesize of output 79 [2019-11-23 22:00:00,331 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 22:00:00,332 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 22:00:00,333 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-23 22:00:00,367 INFO L567 ElimStorePlain]: treesize reduction 62, result has 40.4 percent of original size [2019-11-23 22:00:00,368 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-23 22:00:00,368 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:80, output treesize:42 [2019-11-23 22:00:02,468 INFO L392 ElimStorePlain]: Different costs {2=[|v_#memory_$Pointer$.offset_24|], 6=[|v_#memory_$Pointer$.base_31|]} [2019-11-23 22:00:02,472 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2019-11-23 22:00:02,473 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 22:00:02,492 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 22:00:02,508 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 22:00:02,508 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 41 treesize of output 63 [2019-11-23 22:00:02,509 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 22:00:02,509 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-23 22:00:02,554 INFO L567 ElimStorePlain]: treesize reduction 18, result has 79.3 percent of original size [2019-11-23 22:00:02,555 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 22:00:02,556 INFO L496 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-23 22:00:02,557 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 7 variables, input treesize:68, output treesize:18 [2019-11-23 22:00:02,584 INFO L377 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 15 treesize of output 7 [2019-11-23 22:00:02,585 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 22:00:02,590 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 22:00:02,593 INFO L377 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 15 treesize of output 7 [2019-11-23 22:00:02,593 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-23 22:00:02,596 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 22:00:02,596 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-23 22:00:02,597 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:29, output treesize:7 [2019-11-23 22:00:02,604 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 1 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 22:00:02,604 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-23 22:00:02,605 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 16] total 26 [2019-11-23 22:00:02,605 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [744666328] [2019-11-23 22:00:02,605 INFO L442 AbstractCegarLoop]: Interpolant automaton has 26 states [2019-11-23 22:00:02,605 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:00:02,605 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2019-11-23 22:00:02,606 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=570, Unknown=1, NotChecked=0, Total=650 [2019-11-23 22:00:02,606 INFO L87 Difference]: Start difference. First operand 78 states and 89 transitions. Second operand 26 states. [2019-11-23 22:00:21,520 WARN L192 SmtUtils]: Spent 8.08 s on a formula simplification. DAG size of input: 65 DAG size of output: 62 [2019-11-23 22:00:30,789 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:00:30,790 INFO L93 Difference]: Finished difference Result 107 states and 121 transitions. [2019-11-23 22:00:30,790 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2019-11-23 22:00:30,790 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 34 [2019-11-23 22:00:30,790 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:00:30,791 INFO L225 Difference]: With dead ends: 107 [2019-11-23 22:00:30,791 INFO L226 Difference]: Without dead ends: 100 [2019-11-23 22:00:30,793 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 24 SyntacticMatches, 4 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 592 ImplicationChecksByTransitivity, 16.1s TimeCoverageRelationStatistics Valid=305, Invalid=2142, Unknown=3, NotChecked=0, Total=2450 [2019-11-23 22:00:30,793 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2019-11-23 22:00:30,800 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 80. [2019-11-23 22:00:30,801 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80 states. [2019-11-23 22:00:30,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 92 transitions. [2019-11-23 22:00:30,801 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 92 transitions. Word has length 34 [2019-11-23 22:00:30,801 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:00:30,801 INFO L462 AbstractCegarLoop]: Abstraction has 80 states and 92 transitions. [2019-11-23 22:00:30,802 INFO L463 AbstractCegarLoop]: Interpolant automaton has 26 states. [2019-11-23 22:00:30,802 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 92 transitions. [2019-11-23 22:00:30,802 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-11-23 22:00:30,802 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:00:30,802 INFO L410 BasicCegarLoop]: trace histogram [4, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 22:00:31,003 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 22:00:31,003 INFO L410 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:00:31,003 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:00:31,004 INFO L82 PathProgramCache]: Analyzing trace with hash -685372681, now seen corresponding path program 2 times [2019-11-23 22:00:31,004 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:00:31,004 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1039903522] [2019-11-23 22:00:31,004 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:00:31,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:00:31,664 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 10 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 22:00:31,664 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1039903522] [2019-11-23 22:00:31,664 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [397896231] [2019-11-23 22:00:31,664 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 22:00:31,723 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-11-23 22:00:31,724 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-23 22:00:31,726 INFO L255 TraceCheckSpWp]: Trace formula consists of 187 conjuncts, 62 conjunts are in the unsatisfiable core [2019-11-23 22:00:31,728 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-23 22:00:31,733 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 6 treesize of output 5 [2019-11-23 22:00:31,734 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 22:00:31,738 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 22:00:31,738 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-23 22:00:31,738 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-11-23 22:00:31,769 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 22:00:31,770 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 2 case distinctions, treesize of input 17 treesize of output 39 [2019-11-23 22:00:31,770 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 22:00:31,800 INFO L567 ElimStorePlain]: treesize reduction 14, result has 63.2 percent of original size [2019-11-23 22:00:31,801 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-23 22:00:31,801 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:26, output treesize:24 [2019-11-23 22:00:31,843 INFO L377 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 11 treesize of output 7 [2019-11-23 22:00:31,844 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 22:00:31,861 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 22:00:31,871 INFO L377 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 11 treesize of output 7 [2019-11-23 22:00:31,871 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-23 22:00:31,886 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 22:00:31,887 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-23 22:00:31,887 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:54, output treesize:40 [2019-11-23 22:00:31,934 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 22:00:31,935 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2019-11-23 22:00:31,935 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 22:00:31,955 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 22:00:31,991 INFO L343 Elim1Store]: treesize reduction 21, result has 41.7 percent of original size [2019-11-23 22:00:31,991 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 40 treesize of output 28 [2019-11-23 22:00:31,992 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-23 22:00:32,040 INFO L567 ElimStorePlain]: treesize reduction 8, result has 80.0 percent of original size [2019-11-23 22:00:32,041 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-23 22:00:32,041 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:70, output treesize:32 [2019-11-23 22:00:32,081 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 22:00:32,081 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 20 treesize of output 30 [2019-11-23 22:00:32,082 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 22:00:32,093 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 22:00:32,094 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-23 22:00:32,094 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:45, output treesize:38 [2019-11-23 22:00:32,160 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 22:00:32,160 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 101 treesize of output 111 [2019-11-23 22:00:32,161 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 22:00:32,162 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 22:00:32,210 INFO L567 ElimStorePlain]: treesize reduction 26, result has 79.4 percent of original size [2019-11-23 22:00:32,213 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 77 treesize of output 63 [2019-11-23 22:00:32,214 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-23 22:00:32,243 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 22:00:32,243 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-23 22:00:32,243 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:108, output treesize:86 [2019-11-23 22:00:32,293 INFO L392 ElimStorePlain]: Different costs {0=[|v_#memory_int_35|], 6=[|v_#memory_$Pointer$.base_35|, |v_#memory_$Pointer$.offset_28|]} [2019-11-23 22:00:32,298 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 35 [2019-11-23 22:00:32,299 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 22:00:32,319 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 22:00:32,371 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 22:00:32,371 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 5 new quantified variables, introduced 3 case distinctions, treesize of input 254 treesize of output 237 [2019-11-23 22:00:32,373 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 22:00:32,374 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 22:00:32,374 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 22:00:32,375 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 22:00:32,375 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 22:00:32,376 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 22:00:32,377 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 22:00:32,378 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 22:00:32,378 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 22:00:32,379 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 22:00:32,380 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 22:00:32,380 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 22:00:32,381 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 22:00:32,382 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 22:00:32,382 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 22:00:32,383 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 22:00:32,384 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 22:00:32,384 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 22:00:32,385 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 22:00:32,385 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 22:00:32,386 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 22:00:32,387 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 22:00:32,387 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 22:00:32,388 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 22:00:32,389 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 22:00:32,389 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 22:00:32,390 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 22:00:32,391 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 22:00:32,393 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 10 xjuncts. [2019-11-23 22:00:32,510 WARN L192 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 36 [2019-11-23 22:00:32,511 INFO L567 ElimStorePlain]: treesize reduction 3667, result has 4.5 percent of original size [2019-11-23 22:00:32,551 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 22:00:32,552 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 5 new quantified variables, introduced 2 case distinctions, treesize of input 161 treesize of output 198 [2019-11-23 22:00:32,553 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 22:00:32,554 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 22:00:32,555 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-23 22:00:32,581 INFO L567 ElimStorePlain]: treesize reduction 172, result has 33.6 percent of original size [2019-11-23 22:00:32,582 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-23 22:00:32,582 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:275, output treesize:87 [2019-11-23 22:00:32,709 INFO L392 ElimStorePlain]: Different costs {2=[|v_#memory_int_36|], 6=[|v_#memory_$Pointer$.offset_29|, |v_#memory_$Pointer$.base_36|]} [2019-11-23 22:00:32,723 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 39 [2019-11-23 22:00:32,723 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 22:00:32,754 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 22:00:32,774 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 22:00:32,774 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 96 treesize of output 105 [2019-11-23 22:00:32,775 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-23 22:00:32,835 INFO L567 ElimStorePlain]: treesize reduction 14, result has 88.7 percent of original size [2019-11-23 22:00:32,886 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 22:00:32,887 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 88 treesize of output 125 [2019-11-23 22:00:32,888 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 22:00:32,889 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 22:00:32,890 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 22:00:32,891 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 22:00:32,892 INFO L496 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-23 22:00:32,978 INFO L567 ElimStorePlain]: treesize reduction 62, result has 56.0 percent of original size [2019-11-23 22:00:32,979 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 22:00:32,980 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 22:00:32,982 INFO L496 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-23 22:00:32,982 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 7 variables, input treesize:143, output treesize:30 [2019-11-23 22:00:33,045 INFO L377 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 39 treesize of output 21 [2019-11-23 22:00:33,046 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 22:00:33,056 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 22:00:33,059 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2019-11-23 22:00:33,059 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-23 22:00:33,064 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 22:00:33,064 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-23 22:00:33,064 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:48, output treesize:12 [2019-11-23 22:00:33,118 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 11 [2019-11-23 22:00:33,119 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 22:00:33,123 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 22:00:33,123 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-23 22:00:33,123 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:31, output treesize:7 [2019-11-23 22:00:33,164 INFO L377 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 15 treesize of output 7 [2019-11-23 22:00:33,164 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 22:00:33,166 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 22:00:33,166 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-23 22:00:33,167 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:3 [2019-11-23 22:00:33,210 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 8 proven. 17 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 22:00:33,210 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-23 22:00:33,210 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 15] total 27 [2019-11-23 22:00:33,211 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1474285363] [2019-11-23 22:00:33,211 INFO L442 AbstractCegarLoop]: Interpolant automaton has 27 states [2019-11-23 22:00:33,211 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:00:33,211 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2019-11-23 22:00:33,212 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=630, Unknown=0, NotChecked=0, Total=702 [2019-11-23 22:00:33,212 INFO L87 Difference]: Start difference. First operand 80 states and 92 transitions. Second operand 27 states. [2019-11-23 22:00:33,500 WARN L192 SmtUtils]: Spent 166.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 72 [2019-11-23 22:00:33,687 WARN L192 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 54 [2019-11-23 22:00:34,465 WARN L192 SmtUtils]: Spent 227.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 88 [2019-11-23 22:00:34,645 WARN L192 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 65 [2019-11-23 22:00:34,899 WARN L192 SmtUtils]: Spent 189.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 63 [2019-11-23 22:00:35,114 WARN L192 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 75 [2019-11-23 22:00:35,389 WARN L192 SmtUtils]: Spent 172.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 74 [2019-11-23 22:00:36,258 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:00:36,259 INFO L93 Difference]: Finished difference Result 106 states and 123 transitions. [2019-11-23 22:00:36,261 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-11-23 22:00:36,261 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 35 [2019-11-23 22:00:36,261 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:00:36,262 INFO L225 Difference]: With dead ends: 106 [2019-11-23 22:00:36,262 INFO L226 Difference]: Without dead ends: 92 [2019-11-23 22:00:36,263 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 24 SyntacticMatches, 2 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 333 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=244, Invalid=1826, Unknown=0, NotChecked=0, Total=2070 [2019-11-23 22:00:36,264 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2019-11-23 22:00:36,272 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 90. [2019-11-23 22:00:36,272 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 90 states. [2019-11-23 22:00:36,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 102 transitions. [2019-11-23 22:00:36,273 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 102 transitions. Word has length 35 [2019-11-23 22:00:36,273 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:00:36,273 INFO L462 AbstractCegarLoop]: Abstraction has 90 states and 102 transitions. [2019-11-23 22:00:36,273 INFO L463 AbstractCegarLoop]: Interpolant automaton has 27 states. [2019-11-23 22:00:36,274 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 102 transitions. [2019-11-23 22:00:36,275 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-11-23 22:00:36,275 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:00:36,275 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 22:00:36,478 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 22:00:36,479 INFO L410 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:00:36,479 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:00:36,479 INFO L82 PathProgramCache]: Analyzing trace with hash -560647719, now seen corresponding path program 1 times [2019-11-23 22:00:36,479 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:00:36,480 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [377643788] [2019-11-23 22:00:36,480 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:00:36,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:00:36,946 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-23 22:00:36,947 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [377643788] [2019-11-23 22:00:36,947 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1682713417] [2019-11-23 22:00:36,947 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 22:00:37,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:00:37,024 INFO L255 TraceCheckSpWp]: Trace formula consists of 183 conjuncts, 64 conjunts are in the unsatisfiable core [2019-11-23 22:00:37,032 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-23 22:00:37,036 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 6 treesize of output 5 [2019-11-23 22:00:37,036 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 22:00:37,038 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 22:00:37,038 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-23 22:00:37,038 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2019-11-23 22:00:37,105 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 22:00:37,105 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 2 case distinctions, treesize of input 17 treesize of output 39 [2019-11-23 22:00:37,105 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 22:00:37,131 INFO L567 ElimStorePlain]: treesize reduction 14, result has 63.2 percent of original size [2019-11-23 22:00:37,131 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-23 22:00:37,132 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:26, output treesize:24 [2019-11-23 22:00:37,175 INFO L377 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 13 treesize of output 9 [2019-11-23 22:00:37,176 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 22:00:37,190 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 22:00:37,194 INFO L377 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 13 treesize of output 9 [2019-11-23 22:00:37,194 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-23 22:00:37,208 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 22:00:37,208 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-23 22:00:37,209 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:59, output treesize:54 [2019-11-23 22:00:37,252 INFO L392 ElimStorePlain]: Different costs {0=[|v_#memory_int_38|], 2=[|v_#memory_$Pointer$.base_38|, |v_#memory_$Pointer$.offset_31|]} [2019-11-23 22:00:37,257 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-11-23 22:00:37,257 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 22:00:37,280 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 22:00:37,304 INFO L343 Elim1Store]: treesize reduction 25, result has 43.2 percent of original size [2019-11-23 22:00:37,305 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 46 treesize of output 32 [2019-11-23 22:00:37,305 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-23 22:00:37,349 INFO L567 ElimStorePlain]: treesize reduction 10, result has 86.5 percent of original size [2019-11-23 22:00:37,357 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 16 [2019-11-23 22:00:37,357 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-23 22:00:37,372 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 22:00:37,372 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-23 22:00:37,372 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:95, output treesize:49 [2019-11-23 22:00:37,424 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 22:00:37,425 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 26 [2019-11-23 22:00:37,425 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 22:00:37,441 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 22:00:37,442 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-23 22:00:37,442 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:54, output treesize:47 [2019-11-23 22:00:37,515 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 22:00:37,516 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 172 treesize of output 160 [2019-11-23 22:00:37,517 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 22:00:37,518 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 22:00:37,575 INFO L567 ElimStorePlain]: treesize reduction 34, result has 83.7 percent of original size [2019-11-23 22:00:37,580 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 22:00:37,581 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 69 treesize of output 23 [2019-11-23 22:00:37,582 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-23 22:00:37,606 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 22:00:37,610 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 102 treesize of output 74 [2019-11-23 22:00:37,611 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-23 22:00:37,631 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 22:00:37,632 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-23 22:00:37,632 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 5 variables, input treesize:185, output treesize:80 [2019-11-23 22:00:37,683 INFO L392 ElimStorePlain]: Different costs {2=[|v_#memory_$Pointer$.offset_33|, |v_#memory_int_40|], 6=[|v_#memory_$Pointer$.base_40|]} [2019-11-23 22:00:37,688 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 13 [2019-11-23 22:00:37,688 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 22:00:37,716 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 22:00:37,721 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 34 [2019-11-23 22:00:37,722 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-23 22:00:37,743 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 22:00:37,802 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 22:00:37,802 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 120 treesize of output 136 [2019-11-23 22:00:37,804 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 22:00:37,804 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 22:00:37,805 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 22:00:37,805 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 22:00:37,806 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 22:00:37,806 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 22:00:37,807 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 22:00:37,808 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 22:00:37,808 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 22:00:37,809 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 22:00:37,809 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 22:00:37,810 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 22:00:37,811 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 22:00:37,812 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 9 xjuncts. [2019-11-23 22:00:37,915 WARN L192 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 32 [2019-11-23 22:00:37,916 INFO L567 ElimStorePlain]: treesize reduction 1633, result has 4.9 percent of original size [2019-11-23 22:00:37,916 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 3 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-23 22:00:37,917 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:188, output treesize:84 [2019-11-23 22:00:38,109 INFO L392 ElimStorePlain]: Different costs {0=[|#memory_$Pointer$.offset|], 2=[|#memory_$Pointer$.base|]} [2019-11-23 22:00:38,113 INFO L377 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 19 treesize of output 7 [2019-11-23 22:00:38,114 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 22:00:38,135 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 22:00:38,147 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 22:00:38,147 INFO L377 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 84 treesize of output 47 [2019-11-23 22:00:38,148 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 22:00:38,149 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 22:00:38,150 INFO L496 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-23 22:00:38,188 INFO L567 ElimStorePlain]: treesize reduction 14, result has 68.2 percent of original size [2019-11-23 22:00:38,189 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-11-23 22:00:38,189 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:102, output treesize:30 [2019-11-23 22:00:38,269 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 21 [2019-11-23 22:00:38,270 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 22:00:38,286 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 22:00:38,287 INFO L496 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-11-23 22:00:38,287 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:49, output treesize:22 [2019-11-23 22:00:38,424 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 21 [2019-11-23 22:00:38,425 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 22:00:38,434 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 22:00:38,434 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-23 22:00:38,435 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:37, output treesize:22 [2019-11-23 22:00:38,510 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2019-11-23 22:00:38,511 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 22:00:38,515 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 22:00:38,516 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-23 22:00:38,516 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:26, output treesize:3 [2019-11-23 22:00:38,535 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-23 22:00:38,535 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-23 22:00:38,536 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 16] total 30 [2019-11-23 22:00:38,536 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1835433264] [2019-11-23 22:00:38,537 INFO L442 AbstractCegarLoop]: Interpolant automaton has 30 states [2019-11-23 22:00:38,537 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:00:38,538 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2019-11-23 22:00:38,538 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=86, Invalid=784, Unknown=0, NotChecked=0, Total=870 [2019-11-23 22:00:38,538 INFO L87 Difference]: Start difference. First operand 90 states and 102 transitions. Second operand 30 states. [2019-11-23 22:00:38,803 WARN L192 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 40 [2019-11-23 22:00:38,956 WARN L192 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 43 [2019-11-23 22:00:39,734 WARN L192 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 60 [2019-11-23 22:00:39,920 WARN L192 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 61 [2019-11-23 22:00:40,231 WARN L192 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 59 [2019-11-23 22:00:41,467 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:00:41,467 INFO L93 Difference]: Finished difference Result 105 states and 117 transitions. [2019-11-23 22:00:41,468 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-11-23 22:00:41,468 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 36 [2019-11-23 22:00:41,468 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:00:41,469 INFO L225 Difference]: With dead ends: 105 [2019-11-23 22:00:41,469 INFO L226 Difference]: Without dead ends: 103 [2019-11-23 22:00:41,470 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 584 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=327, Invalid=2325, Unknown=0, NotChecked=0, Total=2652 [2019-11-23 22:00:41,473 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2019-11-23 22:00:41,482 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 97. [2019-11-23 22:00:41,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97 states. [2019-11-23 22:00:41,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 109 transitions. [2019-11-23 22:00:41,483 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 109 transitions. Word has length 36 [2019-11-23 22:00:41,484 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:00:41,485 INFO L462 AbstractCegarLoop]: Abstraction has 97 states and 109 transitions. [2019-11-23 22:00:41,485 INFO L463 AbstractCegarLoop]: Interpolant automaton has 30 states. [2019-11-23 22:00:41,485 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 109 transitions. [2019-11-23 22:00:41,485 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2019-11-23 22:00:41,485 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:00:41,485 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 22:00:41,688 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 22:00:41,689 INFO L410 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:00:41,689 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:00:41,689 INFO L82 PathProgramCache]: Analyzing trace with hash -1911493932, now seen corresponding path program 1 times [2019-11-23 22:00:41,689 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:00:41,689 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [102112593] [2019-11-23 22:00:41,690 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:00:41,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:00:42,103 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 1 proven. 18 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-23 22:00:42,104 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [102112593] [2019-11-23 22:00:42,104 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1420394455] [2019-11-23 22:00:42,104 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 22:00:42,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:00:42,163 INFO L255 TraceCheckSpWp]: Trace formula consists of 192 conjuncts, 19 conjunts are in the unsatisfiable core [2019-11-23 22:00:42,164 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-23 22:00:42,193 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2019-11-23 22:00:42,194 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 22:00:42,199 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 22:00:42,201 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2019-11-23 22:00:42,201 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-23 22:00:42,204 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 22:00:42,204 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-23 22:00:42,205 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:27, output treesize:19 [2019-11-23 22:00:42,263 INFO L377 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 19 treesize of output 7 [2019-11-23 22:00:42,263 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 22:00:42,269 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 22:00:42,272 INFO L377 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 19 treesize of output 7 [2019-11-23 22:00:42,272 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-23 22:00:42,275 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 22:00:42,276 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-23 22:00:42,276 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:37, output treesize:7 [2019-11-23 22:00:42,279 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2019-11-23 22:00:42,279 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-23 22:00:42,279 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 6] total 20 [2019-11-23 22:00:42,279 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1399881413] [2019-11-23 22:00:42,280 INFO L442 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-11-23 22:00:42,280 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:00:42,280 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-11-23 22:00:42,280 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=332, Unknown=0, NotChecked=0, Total=380 [2019-11-23 22:00:42,280 INFO L87 Difference]: Start difference. First operand 97 states and 109 transitions. Second operand 20 states. [2019-11-23 22:00:43,141 WARN L192 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 43 [2019-11-23 22:00:44,069 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:00:44,069 INFO L93 Difference]: Finished difference Result 115 states and 125 transitions. [2019-11-23 22:00:44,073 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-11-23 22:00:44,073 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 38 [2019-11-23 22:00:44,073 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:00:44,074 INFO L225 Difference]: With dead ends: 115 [2019-11-23 22:00:44,074 INFO L226 Difference]: Without dead ends: 93 [2019-11-23 22:00:44,075 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 37 SyntacticMatches, 1 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 265 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=247, Invalid=1313, Unknown=0, NotChecked=0, Total=1560 [2019-11-23 22:00:44,075 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2019-11-23 22:00:44,083 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 83. [2019-11-23 22:00:44,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. [2019-11-23 22:00:44,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 94 transitions. [2019-11-23 22:00:44,084 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 94 transitions. Word has length 38 [2019-11-23 22:00:44,084 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:00:44,084 INFO L462 AbstractCegarLoop]: Abstraction has 83 states and 94 transitions. [2019-11-23 22:00:44,084 INFO L463 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-11-23 22:00:44,084 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 94 transitions. [2019-11-23 22:00:44,085 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-11-23 22:00:44,085 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:00:44,085 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 22:00:44,288 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 22:00:44,289 INFO L410 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:00:44,289 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:00:44,290 INFO L82 PathProgramCache]: Analyzing trace with hash -198762900, now seen corresponding path program 3 times [2019-11-23 22:00:44,290 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:00:44,290 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1299135302] [2019-11-23 22:00:44,290 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:00:44,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:00:44,670 WARN L192 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 41 [2019-11-23 22:00:45,409 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 0 proven. 39 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 22:00:45,410 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1299135302] [2019-11-23 22:00:45,410 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1390383251] [2019-11-23 22:00:45,410 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 22:00:45,542 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2019-11-23 22:00:45,543 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-23 22:00:45,545 WARN L253 TraceCheckSpWp]: Trace formula consists of 216 conjuncts, 114 conjunts are in the unsatisfiable core [2019-11-23 22:00:45,549 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-23 22:00:45,555 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 6 treesize of output 5 [2019-11-23 22:00:45,556 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 22:00:45,559 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 22:00:45,559 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-23 22:00:45,559 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-11-23 22:00:45,585 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 22:00:45,586 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 2 case distinctions, treesize of input 17 treesize of output 39 [2019-11-23 22:00:45,586 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 22:00:45,615 INFO L567 ElimStorePlain]: treesize reduction 14, result has 65.9 percent of original size [2019-11-23 22:00:45,616 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-23 22:00:45,616 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:29, output treesize:27 [2019-11-23 22:00:45,622 INFO L377 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 11 treesize of output 7 [2019-11-23 22:00:45,622 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 22:00:45,639 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 22:00:45,644 INFO L377 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 11 treesize of output 7 [2019-11-23 22:00:45,645 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-23 22:00:45,661 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 22:00:45,661 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-23 22:00:45,662 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:54, output treesize:47 [2019-11-23 22:00:45,674 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2019-11-23 22:00:45,674 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 22:00:45,694 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 22:00:45,697 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2019-11-23 22:00:45,698 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-23 22:00:45,713 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 22:00:45,713 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-23 22:00:45,714 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:65, output treesize:35 [2019-11-23 22:00:45,758 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 22:00:45,759 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 22 treesize of output 69 [2019-11-23 22:00:45,759 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 22:00:45,822 INFO L567 ElimStorePlain]: treesize reduction 28, result has 64.6 percent of original size [2019-11-23 22:00:45,823 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-23 22:00:45,823 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:49, output treesize:51 [2019-11-23 22:00:45,897 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 22 [2019-11-23 22:00:45,898 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 22:00:45,930 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 22:00:45,943 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 22:00:45,943 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 78 treesize of output 68 [2019-11-23 22:00:45,944 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 22:00:45,945 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-23 22:00:46,001 INFO L567 ElimStorePlain]: treesize reduction 24, result has 78.2 percent of original size [2019-11-23 22:00:46,002 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-23 22:00:46,002 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:110, output treesize:99 [2019-11-23 22:00:46,064 INFO L392 ElimStorePlain]: Different costs {0=[|v_#memory_int_43|], 5=[|v_#memory_$Pointer$.base_45|, |v_#memory_$Pointer$.offset_38|]} [2019-11-23 22:00:46,069 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-11-23 22:00:46,069 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 22:00:46,107 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 22:00:46,164 INFO L343 Elim1Store]: treesize reduction 40, result has 49.4 percent of original size [2019-11-23 22:00:46,165 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 99 treesize of output 77 [2019-11-23 22:00:46,165 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 22:00:46,166 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 22:00:46,166 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 22:00:46,168 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 22:00:46,168 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 22:00:46,169 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 22:00:46,169 INFO L496 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-23 22:00:46,271 WARN L192 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 47 [2019-11-23 22:00:46,271 INFO L567 ElimStorePlain]: treesize reduction 24, result has 77.8 percent of original size [2019-11-23 22:00:46,277 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 22:00:46,278 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 24 [2019-11-23 22:00:46,278 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-23 22:00:46,304 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 22:00:46,305 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-23 22:00:46,305 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:140, output treesize:82 [2019-11-23 22:00:46,381 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 22:00:46,398 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 22:00:46,398 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 3 case distinctions, treesize of input 25 treesize of output 41 [2019-11-23 22:00:46,399 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 22:00:46,423 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 22:00:46,424 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-23 22:00:46,424 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:90, output treesize:82 [2019-11-23 22:00:46,489 INFO L392 ElimStorePlain]: Different costs {2=[|v_#memory_int_44|], 5=[|v_#memory_$Pointer$.base_46|, |v_#memory_$Pointer$.offset_39|]} [2019-11-23 22:00:46,493 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 22:00:46,494 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 83 treesize of output 27 [2019-11-23 22:00:46,495 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 22:00:46,536 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 22:00:46,580 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 22:00:46,580 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 5 new quantified variables, introduced 3 case distinctions, treesize of input 207 treesize of output 170 [2019-11-23 22:00:46,582 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 22:00:46,582 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 22:00:46,582 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 22:00:46,583 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 22:00:46,583 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 22:00:46,585 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 22:00:46,585 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 22:00:46,586 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 22:00:46,587 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 22:00:46,587 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 22:00:46,588 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 22:00:46,589 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 22:00:46,590 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 22:00:46,590 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 22:00:46,591 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 22:00:46,592 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 22:00:46,593 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 22:00:46,594 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 22:00:46,595 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 22:00:46,596 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 22:00:46,597 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 22:00:46,598 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 22:00:46,598 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 22:00:46,599 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 22:00:46,600 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 22:00:46,601 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2019-11-23 22:00:46,714 WARN L192 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 46 [2019-11-23 22:00:46,714 INFO L567 ElimStorePlain]: treesize reduction 253, result has 41.7 percent of original size [2019-11-23 22:00:46,768 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 22:00:46,769 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 154 treesize of output 215 [2019-11-23 22:00:46,770 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-23 22:00:46,855 INFO L567 ElimStorePlain]: treesize reduction 76, result has 61.4 percent of original size [2019-11-23 22:00:46,856 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-23 22:00:46,856 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:280, output treesize:142 [2019-11-23 22:00:46,923 INFO L392 ElimStorePlain]: Different costs {2=[|v_#memory_int_45|], 9=[|v_#memory_$Pointer$.base_47|, |v_#memory_$Pointer$.offset_40|]} [2019-11-23 22:00:46,932 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 63 treesize of output 50 [2019-11-23 22:00:46,933 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 22:00:47,001 INFO L567 ElimStorePlain]: treesize reduction 24, result has 92.0 percent of original size [2019-11-23 22:00:47,110 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 22:00:47,111 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 7 new quantified variables, introduced 6 case distinctions, treesize of input 259 treesize of output 236 [2019-11-23 22:00:47,113 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 22:00:47,114 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 22:00:47,116 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 22:00:47,117 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 22:00:47,118 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 22:00:47,119 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 22:00:47,120 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 22:00:47,121 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 22:00:47,124 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 22:00:47,126 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 22:00:47,127 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 22:00:47,128 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 22:00:47,130 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 22:00:47,131 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 22:00:47,132 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 22:00:47,133 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 22:00:47,134 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 22:00:47,135 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 22:00:47,136 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 22:00:47,137 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 22:00:47,138 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 22:00:47,140 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 22:00:47,145 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 7 xjuncts. [2019-11-23 22:00:47,359 WARN L192 SmtUtils]: Spent 213.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 48 [2019-11-23 22:00:47,359 INFO L567 ElimStorePlain]: treesize reduction 2321, result has 8.0 percent of original size [2019-11-23 22:00:47,366 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 22:00:47,368 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 22:00:47,370 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 22:00:47,402 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 22:00:47,403 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 1 case distinctions, treesize of input 140 treesize of output 188 [2019-11-23 22:00:47,403 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-23 22:00:47,435 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 22:00:47,435 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-23 22:00:47,435 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:316, output treesize:114 [2019-11-23 22:00:47,773 INFO L392 ElimStorePlain]: Different costs {3=[|v_#memory_int_46|], 6=[|v_#memory_$Pointer$.base_48|, |v_#memory_$Pointer$.offset_41|]} [2019-11-23 22:00:47,781 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 22:00:47,796 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 22:00:47,796 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 58 treesize of output 100 [2019-11-23 22:00:47,797 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 22:00:47,865 INFO L567 ElimStorePlain]: treesize reduction 84, result has 61.1 percent of original size [2019-11-23 22:00:47,939 INFO L343 Elim1Store]: treesize reduction 8, result has 88.7 percent of original size [2019-11-23 22:00:47,940 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 5 case distinctions, treesize of input 99 treesize of output 111 [2019-11-23 22:00:47,941 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 22:00:47,942 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 22:00:47,942 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 22:00:47,943 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 22:00:47,943 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 22:00:47,943 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 22:00:47,944 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 22:00:47,944 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 22:00:47,945 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 22:00:47,946 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 22:00:47,946 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 22:00:47,947 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 22:00:47,947 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 22:00:47,948 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 22:00:47,948 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 22:00:47,948 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 22:00:47,949 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 22:00:47,949 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 22:00:47,950 INFO L496 ElimStorePlain]: Start of recursive call 3: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-11-23 22:00:48,042 INFO L567 ElimStorePlain]: treesize reduction 40, result has 70.4 percent of original size [2019-11-23 22:00:48,047 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 22:00:48,049 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 34 [2019-11-23 22:00:48,049 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-23 22:00:48,078 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 22:00:48,079 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 3 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-23 22:00:48,079 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 5 variables, input treesize:147, output treesize:87 [2019-11-23 22:00:48,228 INFO L392 ElimStorePlain]: Different costs {1=[|#memory_$Pointer$.base|], 3=[|#memory_$Pointer$.offset|]} [2019-11-23 22:00:48,236 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 22:00:48,236 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 65 treesize of output 44 [2019-11-23 22:00:48,237 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 22:00:48,238 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 22:00:48,239 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-23 22:00:48,315 INFO L567 ElimStorePlain]: treesize reduction 8, result has 90.2 percent of original size [2019-11-23 22:00:48,322 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 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 29 treesize of output 13 [2019-11-23 22:00:48,322 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-23 22:00:48,342 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 22:00:48,342 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-11-23 22:00:48,343 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:109, output treesize:49 [2019-11-23 22:00:48,444 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 22:00:48,445 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 46 treesize of output 67 [2019-11-23 22:00:48,446 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 22:00:48,484 INFO L567 ElimStorePlain]: treesize reduction 44, result has 51.1 percent of original size [2019-11-23 22:00:48,485 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-23 22:00:48,485 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:61, output treesize:46 [2019-11-23 22:00:48,659 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 22:00:48,659 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 46 treesize of output 67 [2019-11-23 22:00:48,660 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 22:00:48,703 INFO L567 ElimStorePlain]: treesize reduction 36, result has 56.1 percent of original size [2019-11-23 22:00:48,703 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-23 22:00:48,704 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:61, output treesize:46 [2019-11-23 22:00:48,893 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 22:00:48,893 INFO L377 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 3 case distinctions, treesize of input 38 treesize of output 42 [2019-11-23 22:00:48,894 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 22:00:48,894 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 22:00:48,894 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 22:00:48,906 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 22:00:48,907 INFO L496 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-23 22:00:48,907 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:50, output treesize:3 [2019-11-23 22:00:48,927 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 0 proven. 39 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 22:00:48,927 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-23 22:00:48,928 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 21] total 36 [2019-11-23 22:00:48,928 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [893445138] [2019-11-23 22:00:48,928 INFO L442 AbstractCegarLoop]: Interpolant automaton has 36 states [2019-11-23 22:00:48,928 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:00:48,928 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2019-11-23 22:00:48,929 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=110, Invalid=1150, Unknown=0, NotChecked=0, Total=1260 [2019-11-23 22:00:48,929 INFO L87 Difference]: Start difference. First operand 83 states and 94 transitions. Second operand 36 states. [2019-11-23 22:00:50,138 WARN L192 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 49 [2019-11-23 22:00:51,190 WARN L192 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 117 DAG size of output: 71 [2019-11-23 22:00:51,388 WARN L192 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 121 DAG size of output: 75 [2019-11-23 22:00:53,532 WARN L192 SmtUtils]: Spent 2.07 s on a formula simplification. DAG size of input: 93 DAG size of output: 44 [2019-11-23 22:00:56,904 WARN L192 SmtUtils]: Spent 2.05 s on a formula simplification. DAG size of input: 97 DAG size of output: 42 [2019-11-23 22:00:59,078 WARN L192 SmtUtils]: Spent 2.09 s on a formula simplification. DAG size of input: 119 DAG size of output: 51 [2019-11-23 22:01:01,349 WARN L192 SmtUtils]: Spent 2.10 s on a formula simplification. DAG size of input: 121 DAG size of output: 53 [2019-11-23 22:01:01,524 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:01:01,524 INFO L93 Difference]: Finished difference Result 118 states and 136 transitions. [2019-11-23 22:01:01,524 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-11-23 22:01:01,524 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 41 [2019-11-23 22:01:01,524 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:01:01,525 INFO L225 Difference]: With dead ends: 118 [2019-11-23 22:01:01,525 INFO L226 Difference]: Without dead ends: 116 [2019-11-23 22:01:01,527 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 26 SyntacticMatches, 3 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 884 ImplicationChecksByTransitivity, 12.6s TimeCoverageRelationStatistics Valid=373, Invalid=3287, Unknown=0, NotChecked=0, Total=3660 [2019-11-23 22:01:01,528 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2019-11-23 22:01:01,536 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 89. [2019-11-23 22:01:01,536 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2019-11-23 22:01:01,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 102 transitions. [2019-11-23 22:01:01,537 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 102 transitions. Word has length 41 [2019-11-23 22:01:01,537 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:01:01,537 INFO L462 AbstractCegarLoop]: Abstraction has 89 states and 102 transitions. [2019-11-23 22:01:01,537 INFO L463 AbstractCegarLoop]: Interpolant automaton has 36 states. [2019-11-23 22:01:01,537 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 102 transitions. [2019-11-23 22:01:01,538 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-11-23 22:01:01,538 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:01:01,538 INFO L410 BasicCegarLoop]: trace histogram [5, 4, 4, 4, 4, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 22:01:01,740 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 22:01:01,741 INFO L410 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:01:01,741 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:01:01,741 INFO L82 PathProgramCache]: Analyzing trace with hash -1636944347, now seen corresponding path program 2 times [2019-11-23 22:01:01,742 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:01:01,742 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1096197771] [2019-11-23 22:01:01,742 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:01:01,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:01:02,191 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 0 proven. 46 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 22:01:02,191 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1096197771] [2019-11-23 22:01:02,192 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [983112007] [2019-11-23 22:01:02,192 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 22:01:02,267 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-11-23 22:01:02,267 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-23 22:01:02,268 INFO L255 TraceCheckSpWp]: Trace formula consists of 203 conjuncts, 73 conjunts are in the unsatisfiable core [2019-11-23 22:01:02,270 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-23 22:01:02,278 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 6 treesize of output 5 [2019-11-23 22:01:02,278 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 22:01:02,281 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 22:01:02,281 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-23 22:01:02,281 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-11-23 22:01:02,289 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-11-23 22:01:02,290 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 22:01:02,300 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 22:01:02,300 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-23 22:01:02,300 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:26, output treesize:22 [2019-11-23 22:01:02,322 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 22:01:02,323 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 2 case distinctions, treesize of input 17 treesize of output 39 [2019-11-23 22:01:02,323 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 22:01:02,355 INFO L567 ElimStorePlain]: treesize reduction 14, result has 68.9 percent of original size [2019-11-23 22:01:02,355 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-23 22:01:02,355 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:33, output treesize:31 [2019-11-23 22:01:02,396 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 22:01:02,397 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 11 [2019-11-23 22:01:02,397 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 22:01:02,408 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 22:01:02,408 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-23 22:01:02,409 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:44, output treesize:25 [2019-11-23 22:01:02,455 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2019-11-23 22:01:02,455 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 22:01:02,466 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 22:01:02,466 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-23 22:01:02,467 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:36, output treesize:32 [2019-11-23 22:01:02,536 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 22:01:02,536 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 22 treesize of output 69 [2019-11-23 22:01:02,537 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 22:01:02,585 INFO L567 ElimStorePlain]: treesize reduction 28, result has 61.6 percent of original size [2019-11-23 22:01:02,585 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-23 22:01:02,586 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:43, output treesize:45 [2019-11-23 22:01:02,634 INFO L343 Elim1Store]: treesize reduction 27, result has 20.6 percent of original size [2019-11-23 22:01:02,635 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 21 [2019-11-23 22:01:02,635 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 22:01:02,653 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 22:01:02,654 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-23 22:01:02,654 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:64, output treesize:45 [2019-11-23 22:01:02,699 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 28 [2019-11-23 22:01:02,700 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 22:01:02,721 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 22:01:02,721 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-23 22:01:02,722 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:56, output treesize:52 [2019-11-23 22:01:02,783 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 22:01:02,783 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 3 case distinctions, treesize of input 21 treesize of output 37 [2019-11-23 22:01:02,784 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 22:01:02,803 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 22:01:02,804 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-11-23 22:01:02,804 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:57, output treesize:49 [2019-11-23 22:01:02,865 INFO L343 Elim1Store]: treesize reduction 27, result has 20.6 percent of original size [2019-11-23 22:01:02,865 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 41 treesize of output 31 [2019-11-23 22:01:02,866 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 22:01:02,887 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 22:01:02,888 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-23 22:01:02,888 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:68, output treesize:49 [2019-11-23 22:01:02,959 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 38 [2019-11-23 22:01:02,959 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 22:01:02,997 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 22:01:02,998 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-23 22:01:02,999 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:60, output treesize:56 [2019-11-23 22:01:03,136 INFO L343 Elim1Store]: treesize reduction 27, result has 20.6 percent of original size [2019-11-23 22:01:03,136 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 1 case distinctions, treesize of input 48 treesize of output 41 [2019-11-23 22:01:03,137 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 22:01:03,160 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 22:01:03,160 INFO L496 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 1 dim-2 vars, End of recursive call: 6 dim-0 vars, and 1 xjuncts. [2019-11-23 22:01:03,161 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 7 variables, input treesize:78, output treesize:59 [2019-11-23 22:01:03,295 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 22:01:03,295 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 40 treesize of output 136 [2019-11-23 22:01:03,296 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 22:01:03,425 WARN L192 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 59 [2019-11-23 22:01:03,426 INFO L567 ElimStorePlain]: treesize reduction 60, result has 62.0 percent of original size [2019-11-23 22:01:03,426 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 22:01:03,429 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 22:01:03,430 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 22:01:03,430 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 22:01:03,432 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 22:01:03,432 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 22:01:03,433 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 22:01:03,434 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 22:01:03,434 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 22:01:03,435 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 22:01:03,436 INFO L496 ElimStorePlain]: Start of recursive call 1: 7 dim-0 vars, 1 dim-2 vars, End of recursive call: 7 dim-0 vars, and 1 xjuncts. [2019-11-23 22:01:03,436 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 8 variables, input treesize:74, output treesize:98 [2019-11-23 22:01:03,437 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 22:01:03,437 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 22:01:03,438 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 22:01:03,438 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 22:01:03,439 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 22:01:03,439 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 22:01:03,440 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 22:01:03,440 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 22:01:03,441 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 22:01:03,441 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 22:01:03,519 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 22:01:03,520 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 22:01:03,520 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 22:01:03,520 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 22:01:03,521 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 22:01:03,523 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 22:01:03,523 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 22:01:03,524 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 22:01:03,525 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 22:01:03,525 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 22:01:03,739 WARN L192 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 57 [2019-11-23 22:01:03,904 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 22:01:03,912 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 22:01:03,922 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 75 treesize of output 68 [2019-11-23 22:01:03,922 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 22:01:03,932 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 22:01:03,935 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 75 treesize of output 68 [2019-11-23 22:01:03,936 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-23 22:01:04,041 WARN L192 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 62 [2019-11-23 22:01:04,041 INFO L567 ElimStorePlain]: treesize reduction 8, result has 92.9 percent of original size [2019-11-23 22:01:04,042 INFO L496 ElimStorePlain]: Start of recursive call 1: 10 dim-0 vars, 1 dim-2 vars, End of recursive call: 10 dim-0 vars, and 2 xjuncts. [2019-11-23 22:01:04,043 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 11 variables, input treesize:151, output treesize:105 [2019-11-23 22:01:04,326 WARN L192 SmtUtils]: Spent 226.00 ms on a formula simplification that was a NOOP. DAG size: 66 [2019-11-23 22:01:04,398 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 22:01:04,405 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 40 [2019-11-23 22:01:04,405 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 22:01:04,485 INFO L567 ElimStorePlain]: treesize reduction 4, result has 95.5 percent of original size [2019-11-23 22:01:04,494 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 22:01:04,494 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 1 case distinctions, treesize of input 56 treesize of output 44 [2019-11-23 22:01:04,495 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-23 22:01:04,526 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 22:01:04,527 INFO L496 ElimStorePlain]: Start of recursive call 1: 12 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-23 22:01:04,527 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 14 variables, input treesize:121, output treesize:3 [2019-11-23 22:01:04,548 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 3 proven. 43 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 22:01:04,548 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-23 22:01:04,548 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21] total 36 [2019-11-23 22:01:04,549 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1538702337] [2019-11-23 22:01:04,549 INFO L442 AbstractCegarLoop]: Interpolant automaton has 36 states [2019-11-23 22:01:04,549 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:01:04,549 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2019-11-23 22:01:04,550 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=176, Invalid=1084, Unknown=0, NotChecked=0, Total=1260 [2019-11-23 22:01:04,550 INFO L87 Difference]: Start difference. First operand 89 states and 102 transitions. Second operand 36 states. [2019-11-23 22:01:06,433 WARN L192 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 86 [2019-11-23 22:01:06,747 WARN L192 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 68 [2019-11-23 22:01:07,014 WARN L192 SmtUtils]: Spent 145.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 94 [2019-11-23 22:01:07,860 WARN L192 SmtUtils]: Spent 571.00 ms on a formula simplification. DAG size of input: 130 DAG size of output: 128 [2019-11-23 22:01:08,110 WARN L192 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 78 [2019-11-23 22:01:10,642 WARN L192 SmtUtils]: Spent 2.32 s on a formula simplification. DAG size of input: 136 DAG size of output: 135 [2019-11-23 22:01:13,072 WARN L192 SmtUtils]: Spent 2.28 s on a formula simplification. DAG size of input: 138 DAG size of output: 137 [2019-11-23 22:01:13,270 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:01:13,270 INFO L93 Difference]: Finished difference Result 113 states and 127 transitions. [2019-11-23 22:01:13,270 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2019-11-23 22:01:13,270 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 41 [2019-11-23 22:01:13,270 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:01:13,271 INFO L225 Difference]: With dead ends: 113 [2019-11-23 22:01:13,272 INFO L226 Difference]: Without dead ends: 105 [2019-11-23 22:01:13,273 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 24 SyntacticMatches, 5 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1266 ImplicationChecksByTransitivity, 8.9s TimeCoverageRelationStatistics Valid=575, Invalid=3585, Unknown=0, NotChecked=0, Total=4160 [2019-11-23 22:01:13,274 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2019-11-23 22:01:13,281 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 86. [2019-11-23 22:01:13,281 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 86 states. [2019-11-23 22:01:13,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 98 transitions. [2019-11-23 22:01:13,281 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 98 transitions. Word has length 41 [2019-11-23 22:01:13,281 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:01:13,282 INFO L462 AbstractCegarLoop]: Abstraction has 86 states and 98 transitions. [2019-11-23 22:01:13,282 INFO L463 AbstractCegarLoop]: Interpolant automaton has 36 states. [2019-11-23 22:01:13,282 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 98 transitions. [2019-11-23 22:01:13,282 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-11-23 22:01:13,282 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:01:13,282 INFO L410 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 22:01:13,482 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 22:01:13,483 INFO L410 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:01:13,483 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:01:13,483 INFO L82 PathProgramCache]: Analyzing trace with hash 1639353604, now seen corresponding path program 2 times [2019-11-23 22:01:13,484 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:01:13,484 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1587845063] [2019-11-23 22:01:13,484 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:01:13,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:01:14,200 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 31 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-23 22:01:14,200 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1587845063] [2019-11-23 22:01:14,200 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [347044067] [2019-11-23 22:01:14,200 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 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 22:01:14,275 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-11-23 22:01:14,275 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-23 22:01:14,277 INFO L255 TraceCheckSpWp]: Trace formula consists of 212 conjuncts, 93 conjunts are in the unsatisfiable core [2019-11-23 22:01:14,279 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-23 22:01:14,289 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 6 treesize of output 5 [2019-11-23 22:01:14,290 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 22:01:14,294 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 22:01:14,295 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-23 22:01:14,295 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:12 [2019-11-23 22:01:14,396 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 22:01:14,396 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 2 case distinctions, treesize of input 17 treesize of output 39 [2019-11-23 22:01:14,397 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 22:01:14,429 INFO L567 ElimStorePlain]: treesize reduction 14, result has 65.9 percent of original size [2019-11-23 22:01:14,429 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-23 22:01:14,430 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:29, output treesize:27 [2019-11-23 22:01:14,480 INFO L377 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 11 treesize of output 7 [2019-11-23 22:01:14,480 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 22:01:14,500 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 22:01:14,509 INFO L377 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 11 treesize of output 7 [2019-11-23 22:01:14,509 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-23 22:01:14,526 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 22:01:14,526 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-23 22:01:14,526 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:54, output treesize:47 [2019-11-23 22:01:14,584 INFO L392 ElimStorePlain]: Different costs {0=[|v_#memory_int_59|], 2=[|v_#memory_$Pointer$.offset_44|, |v_#memory_$Pointer$.base_53|]} [2019-11-23 22:01:14,598 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-11-23 22:01:14,599 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 22:01:14,623 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 22:01:14,626 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 22:01:14,627 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 14 [2019-11-23 22:01:14,627 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-23 22:01:14,651 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 22:01:14,656 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 22:01:14,657 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 20 [2019-11-23 22:01:14,657 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-23 22:01:14,675 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 22:01:14,675 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-23 22:01:14,675 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:88, output treesize:54 [2019-11-23 22:01:14,740 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 22:01:14,740 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 20 treesize of output 30 [2019-11-23 22:01:14,741 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 22:01:14,758 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 22:01:14,759 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-23 22:01:14,759 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:59, output treesize:52 [2019-11-23 22:01:14,813 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 22:01:14,814 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 19 [2019-11-23 22:01:14,815 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 22:01:14,841 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 22:01:14,845 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 90 treesize of output 72 [2019-11-23 22:01:14,846 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-23 22:01:14,867 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 22:01:14,872 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-23 22:01:14,885 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 22:01:14,886 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 91 treesize of output 85 [2019-11-23 22:01:14,886 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 22:01:14,887 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-23 22:01:14,930 INFO L567 ElimStorePlain]: treesize reduction 24, result has 78.8 percent of original size [2019-11-23 22:01:14,931 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-23 22:01:14,931 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 5 variables, input treesize:152, output treesize:83 [2019-11-23 22:01:14,977 INFO L392 ElimStorePlain]: Different costs {2=[|v_#memory_int_61|, |v_#memory_$Pointer$.offset_46|], 6=[|v_#memory_$Pointer$.base_55|]} [2019-11-23 22:01:14,986 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 22:01:14,987 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 26 [2019-11-23 22:01:14,988 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 22:01:15,010 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 22:01:15,036 INFO L343 Elim1Store]: treesize reduction 21, result has 41.7 percent of original size [2019-11-23 22:01:15,036 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 95 treesize of output 75 [2019-11-23 22:01:15,037 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-23 22:01:15,080 INFO L567 ElimStorePlain]: treesize reduction 8, result has 91.2 percent of original size [2019-11-23 22:01:15,139 INFO L343 Elim1Store]: treesize reduction 40, result has 49.4 percent of original size [2019-11-23 22:01:15,140 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 66 treesize of output 60 [2019-11-23 22:01:15,140 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 22:01:15,141 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 22:01:15,141 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 22:01:15,142 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 22:01:15,142 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 22:01:15,142 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 22:01:15,143 INFO L496 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-23 22:01:15,189 INFO L567 ElimStorePlain]: treesize reduction 24, result has 66.2 percent of original size [2019-11-23 22:01:15,189 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-23 22:01:15,190 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:124, output treesize:52 [2019-11-23 22:01:15,289 INFO L392 ElimStorePlain]: Different costs {2=[|v_#memory_$Pointer$.offset_47|], 5=[|v_#memory_$Pointer$.base_56|], 6=[|v_#memory_int_62|]} [2019-11-23 22:01:15,298 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 28 [2019-11-23 22:01:15,298 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 22:01:15,328 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 22:01:15,374 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 22:01:15,374 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 161 treesize of output 153 [2019-11-23 22:01:15,376 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 22:01:15,377 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 22:01:15,378 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-23 22:01:15,454 INFO L567 ElimStorePlain]: treesize reduction 84, result has 65.4 percent of original size [2019-11-23 22:01:15,460 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 22:01:15,461 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 70 treesize of output 33 [2019-11-23 22:01:15,462 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-23 22:01:15,486 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 22:01:15,487 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 3 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-23 22:01:15,487 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 5 variables, input treesize:183, output treesize:99 [2019-11-23 22:01:15,556 INFO L392 ElimStorePlain]: Different costs {5=[|v_#memory_$Pointer$.base_57|], 6=[|v_#memory_$Pointer$.offset_48|, |v_#memory_int_63|]} [2019-11-23 22:01:15,600 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 22:01:15,600 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 183 treesize of output 195 [2019-11-23 22:01:15,601 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 22:01:15,602 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 22:01:15,602 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 22:01:15,603 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 22:01:15,603 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 22:01:15,604 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 22:01:15,605 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 22:01:15,605 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 22:01:15,606 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 22:01:15,607 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 22:01:15,607 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 22:01:15,608 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 22:01:15,609 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 22:01:15,609 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 22:01:15,610 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 22:01:15,611 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 22:01:15,611 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 22:01:15,613 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 22:01:15,613 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 22:01:15,613 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 22:01:15,614 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 22:01:15,615 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 22:01:15,615 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 22:01:15,616 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 22:01:15,616 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 22:01:15,617 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 22:01:15,618 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 22:01:15,619 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 22:01:15,619 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 22:01:15,620 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 22:01:15,620 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 22:01:15,621 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 22:01:15,622 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 22:01:15,622 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 22:01:15,623 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 22:01:15,624 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 22:01:15,625 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 22:01:15,625 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 22:01:15,626 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 22:01:15,626 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 22:01:15,627 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 22:01:15,628 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 22:01:15,629 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 22:01:15,630 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 22:01:15,630 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 22:01:15,631 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 22:01:15,631 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 22:01:15,632 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 22:01:15,633 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 22:01:15,633 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 22:01:15,633 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 22:01:15,634 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 22:01:15,635 INFO L496 ElimStorePlain]: Start of recursive call 2: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-11-23 22:01:15,735 INFO L567 ElimStorePlain]: treesize reduction 100, result has 51.7 percent of original size [2019-11-23 22:01:15,770 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 22:01:15,771 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 61 treesize of output 110 [2019-11-23 22:01:15,771 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-23 22:01:15,847 INFO L567 ElimStorePlain]: treesize reduction 24, result has 77.8 percent of original size [2019-11-23 22:01:15,890 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 22:01:15,890 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 26 treesize of output 68 [2019-11-23 22:01:15,891 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-23 22:01:15,990 INFO L567 ElimStorePlain]: treesize reduction 28, result has 76.7 percent of original size [2019-11-23 22:01:15,991 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 22:01:15,991 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 22:01:15,992 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 22:01:15,993 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 3 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-11-23 22:01:15,993 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 5 variables, input treesize:200, output treesize:138 [2019-11-23 22:01:15,993 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 22:01:15,993 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 22:01:15,993 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 22:01:16,063 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 22:01:16,064 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 22:01:16,064 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 22:01:16,065 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 22:01:16,065 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 22:01:16,377 WARN L192 SmtUtils]: Spent 211.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 57 [2019-11-23 22:01:16,465 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-11-23 22:01:16,475 INFO L392 ElimStorePlain]: Different costs {0=[|#memory_$Pointer$.offset|], 1=[v_prenex_21, |#memory_$Pointer$.base|, v_prenex_24, v_prenex_23, v_prenex_18], 2=[v_prenex_19, v_prenex_22]} [2019-11-23 22:01:16,483 INFO L377 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 71 treesize of output 63 [2019-11-23 22:01:16,484 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 22:01:16,571 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 22:01:16,584 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 22:01:16,584 INFO L377 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 101 treesize of output 68 [2019-11-23 22:01:16,585 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 22:01:16,586 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 22:01:16,586 INFO L496 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-23 22:01:16,756 WARN L192 SmtUtils]: Spent 169.00 ms on a formula simplification. DAG size of input: 108 DAG size of output: 105 [2019-11-23 22:01:16,757 INFO L567 ElimStorePlain]: treesize reduction 8, result has 97.4 percent of original size [2019-11-23 22:01:16,768 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 22:01:16,769 INFO L377 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 60 treesize of output 47 [2019-11-23 22:01:16,770 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 22:01:16,770 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 22:01:16,771 INFO L496 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-23 22:01:16,937 WARN L192 SmtUtils]: Spent 165.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 100 [2019-11-23 22:01:16,938 INFO L567 ElimStorePlain]: treesize reduction 4, result has 98.5 percent of original size [2019-11-23 22:01:16,946 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 22:01:16,947 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 71 treesize of output 51 [2019-11-23 22:01:16,948 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-11-23 22:01:17,028 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 22:01:17,040 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 22:01:17,041 INFO L377 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 45 treesize of output 40 [2019-11-23 22:01:17,041 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 22:01:17,042 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 22:01:17,043 INFO L496 ElimStorePlain]: Start of recursive call 6: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-23 22:01:17,206 WARN L192 SmtUtils]: Spent 162.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 84 [2019-11-23 22:01:17,207 INFO L567 ElimStorePlain]: treesize reduction 4, result has 98.3 percent of original size [2019-11-23 22:01:17,217 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 22:01:17,217 INFO L377 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 108 treesize of output 75 [2019-11-23 22:01:17,218 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 22:01:17,219 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 22:01:17,219 INFO L496 ElimStorePlain]: Start of recursive call 7: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-23 22:01:17,378 WARN L192 SmtUtils]: Spent 157.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 76 [2019-11-23 22:01:17,379 INFO L567 ElimStorePlain]: treesize reduction 4, result has 97.9 percent of original size [2019-11-23 22:01:17,388 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 65 treesize of output 51 [2019-11-23 22:01:17,389 INFO L496 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-11-23 22:01:17,455 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 22:01:17,464 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 40 [2019-11-23 22:01:17,465 INFO L496 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-11-23 22:01:17,536 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 22:01:17,537 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 8 dim-2 vars, End of recursive call: 7 dim-0 vars, and 4 xjuncts. [2019-11-23 22:01:17,538 INFO L221 ElimStorePlain]: Needed 9 recursive calls to eliminate 11 variables, input treesize:352, output treesize:147 [2019-11-23 22:01:17,668 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 22:01:17,735 INFO L343 Elim1Store]: treesize reduction 50, result has 45.1 percent of original size [2019-11-23 22:01:17,735 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 49 treesize of output 65 [2019-11-23 22:01:17,736 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 22:01:17,736 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 22:01:17,737 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 22:01:17,786 INFO L343 Elim1Store]: treesize reduction 50, result has 39.8 percent of original size [2019-11-23 22:01:17,787 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 53 treesize of output 61 [2019-11-23 22:01:17,787 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 22:01:17,788 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 22:01:17,788 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-23 22:01:17,883 INFO L567 ElimStorePlain]: treesize reduction 33, result has 72.3 percent of original size [2019-11-23 22:01:17,884 INFO L496 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 2 xjuncts. [2019-11-23 22:01:17,884 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:103, output treesize:66 [2019-11-23 22:01:18,071 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 22:01:18,203 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 22:01:18,204 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 29 [2019-11-23 22:01:18,204 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 22:01:18,231 INFO L567 ElimStorePlain]: treesize reduction 12, result has 68.4 percent of original size [2019-11-23 22:01:18,232 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-23 22:01:18,232 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:41, output treesize:26 [2019-11-23 22:01:18,463 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 22:01:18,464 INFO L377 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 22 treesize of output 18 [2019-11-23 22:01:18,464 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 22:01:18,474 INFO L567 ElimStorePlain]: treesize reduction 4, result has 66.7 percent of original size [2019-11-23 22:01:18,475 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-23 22:01:18,475 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:22, output treesize:3 [2019-11-23 22:01:18,494 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 31 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-23 22:01:18,494 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-23 22:01:18,494 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 23] total 39 [2019-11-23 22:01:18,495 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1398527887] [2019-11-23 22:01:18,496 INFO L442 AbstractCegarLoop]: Interpolant automaton has 39 states [2019-11-23 22:01:18,496 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:01:18,496 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2019-11-23 22:01:18,497 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=1362, Unknown=0, NotChecked=0, Total=1482 [2019-11-23 22:01:18,497 INFO L87 Difference]: Start difference. First operand 86 states and 98 transitions. Second operand 39 states.