/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/forester-heap/sll-sorted-2.i -------------------------------------------------------------------------------- This is Ultimate 0.1.24-6598664 [2019-11-23 21:29:15,890 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-23 21:29:15,893 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-23 21:29:15,905 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-23 21:29:15,905 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-23 21:29:15,906 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-23 21:29:15,908 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-23 21:29:15,909 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-23 21:29:15,921 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-23 21:29:15,923 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-23 21:29:15,924 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-23 21:29:15,927 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-23 21:29:15,927 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-23 21:29:15,929 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-23 21:29:15,930 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-23 21:29:15,933 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-23 21:29:15,935 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-23 21:29:15,938 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-23 21:29:15,940 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-23 21:29:15,941 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-23 21:29:15,945 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-23 21:29:15,948 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-23 21:29:15,950 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-23 21:29:15,951 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-23 21:29:15,956 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-23 21:29:15,956 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-23 21:29:15,956 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-23 21:29:15,958 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-23 21:29:15,959 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-23 21:29:15,961 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-23 21:29:15,962 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-23 21:29:15,963 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-23 21:29:15,964 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-23 21:29:15,964 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-23 21:29:15,966 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-23 21:29:15,966 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-23 21:29:15,967 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-23 21:29:15,967 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-23 21:29:15,967 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-23 21:29:15,972 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-23 21:29:15,973 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-23 21:29:15,973 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:29:15,988 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-23 21:29:15,988 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-23 21:29:15,991 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-23 21:29:15,991 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-23 21:29:15,991 INFO L138 SettingsManager]: * Use SBE=true [2019-11-23 21:29:15,991 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-23 21:29:15,992 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-23 21:29:15,992 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-23 21:29:15,992 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-23 21:29:15,992 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-23 21:29:15,993 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-23 21:29:15,994 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-23 21:29:15,994 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-23 21:29:15,994 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2019-11-23 21:29:15,994 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-23 21:29:15,995 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-23 21:29:15,995 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-23 21:29:15,995 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-23 21:29:15,995 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-23 21:29:15,996 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-23 21:29:15,996 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-23 21:29:15,996 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-23 21:29:15,996 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-23 21:29:15,996 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-23 21:29:15,997 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-23 21:29:15,997 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-23 21:29:15,997 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-23 21:29:15,997 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-23 21:29:15,997 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-23 21:29:15,998 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-11-23 21:29:16,343 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-23 21:29:16,363 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-23 21:29:16,367 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-23 21:29:16,368 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-23 21:29:16,369 INFO L275 PluginConnector]: CDTParser initialized [2019-11-23 21:29:16,370 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/forester-heap/sll-sorted-2.i [2019-11-23 21:29:16,440 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f42208021/98a772b19a47435590555fe62a70797b/FLAG49cb29b44 [2019-11-23 21:29:16,957 INFO L306 CDTParser]: Found 1 translation units. [2019-11-23 21:29:16,958 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/forester-heap/sll-sorted-2.i [2019-11-23 21:29:16,973 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f42208021/98a772b19a47435590555fe62a70797b/FLAG49cb29b44 [2019-11-23 21:29:17,240 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f42208021/98a772b19a47435590555fe62a70797b [2019-11-23 21:29:17,249 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-23 21:29:17,251 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-11-23 21:29:17,252 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-23 21:29:17,252 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-23 21:29:17,255 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-23 21:29:17,256 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 09:29:17" (1/1) ... [2019-11-23 21:29:17,259 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4d3ccae1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:29:17, skipping insertion in model container [2019-11-23 21:29:17,259 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 09:29:17" (1/1) ... [2019-11-23 21:29:17,267 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-23 21:29:17,309 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-11-23 21:29:17,746 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-23 21:29:17,758 INFO L203 MainTranslator]: Completed pre-run [2019-11-23 21:29:17,827 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-23 21:29:17,872 INFO L208 MainTranslator]: Completed translation [2019-11-23 21:29:17,873 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:29:17 WrapperNode [2019-11-23 21:29:17,873 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-23 21:29:17,874 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-23 21:29:17,874 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-23 21:29:17,874 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-23 21:29:17,883 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:29:17" (1/1) ... [2019-11-23 21:29:17,909 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:29:17" (1/1) ... [2019-11-23 21:29:17,933 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-23 21:29:17,934 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-23 21:29:17,934 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-23 21:29:17,934 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-23 21:29:17,944 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:29:17" (1/1) ... [2019-11-23 21:29:17,944 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:29:17" (1/1) ... [2019-11-23 21:29:17,949 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:29:17" (1/1) ... [2019-11-23 21:29:17,949 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:29:17" (1/1) ... [2019-11-23 21:29:17,959 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:29:17" (1/1) ... [2019-11-23 21:29:17,967 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:29:17" (1/1) ... [2019-11-23 21:29:17,969 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:29:17" (1/1) ... [2019-11-23 21:29:17,973 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-23 21:29:17,974 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-23 21:29:17,974 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-23 21:29:17,974 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-23 21:29:17,975 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:29:17" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-23 21:29:18,042 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-11-23 21:29:18,042 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-11-23 21:29:18,042 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-11-23 21:29:18,042 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-11-23 21:29:18,043 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-11-23 21:29:18,043 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-23 21:29:18,043 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-23 21:29:18,043 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-23 21:29:18,574 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-23 21:29:18,574 INFO L284 CfgBuilder]: Removed 24 assume(true) statements. [2019-11-23 21:29:18,576 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 09:29:18 BoogieIcfgContainer [2019-11-23 21:29:18,576 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-23 21:29:18,578 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-23 21:29:18,578 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-23 21:29:18,582 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-23 21:29:18,582 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 09:29:17" (1/3) ... [2019-11-23 21:29:18,583 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@11083e39 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 09:29:18, skipping insertion in model container [2019-11-23 21:29:18,583 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:29:17" (2/3) ... [2019-11-23 21:29:18,584 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@11083e39 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 09:29:18, skipping insertion in model container [2019-11-23 21:29:18,584 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 09:29:18" (3/3) ... [2019-11-23 21:29:18,586 INFO L109 eAbstractionObserver]: Analyzing ICFG sll-sorted-2.i [2019-11-23 21:29:18,596 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-23 21:29:18,603 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 7 error locations. [2019-11-23 21:29:18,613 INFO L249 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2019-11-23 21:29:18,635 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-23 21:29:18,635 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-23 21:29:18,636 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-23 21:29:18,636 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-23 21:29:18,636 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-23 21:29:18,636 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-23 21:29:18,636 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-23 21:29:18,636 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-23 21:29:18,653 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states. [2019-11-23 21:29:18,659 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-11-23 21:29:18,660 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 21:29:18,661 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-11-23 21:29:18,662 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 21:29:18,668 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 21:29:18,668 INFO L82 PathProgramCache]: Analyzing trace with hash 890153286, now seen corresponding path program 1 times [2019-11-23 21:29:18,675 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 21:29:18,676 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1757708196] [2019-11-23 21:29:18,676 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 21:29:18,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 21:29:18,813 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:29:18,814 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1757708196] [2019-11-23 21:29:18,815 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 21:29:18,816 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-23 21:29:18,817 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1102126118] [2019-11-23 21:29:18,822 INFO L442 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-11-23 21:29:18,823 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 21:29:18,837 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-11-23 21:29:18,838 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-11-23 21:29:18,841 INFO L87 Difference]: Start difference. First operand 62 states. Second operand 2 states. [2019-11-23 21:29:18,871 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 21:29:18,871 INFO L93 Difference]: Finished difference Result 118 states and 190 transitions. [2019-11-23 21:29:18,872 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-11-23 21:29:18,873 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 6 [2019-11-23 21:29:18,873 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 21:29:18,886 INFO L225 Difference]: With dead ends: 118 [2019-11-23 21:29:18,886 INFO L226 Difference]: Without dead ends: 56 [2019-11-23 21:29:18,889 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:29:18,911 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2019-11-23 21:29:18,930 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 56. [2019-11-23 21:29:18,931 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2019-11-23 21:29:18,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 66 transitions. [2019-11-23 21:29:18,934 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 66 transitions. Word has length 6 [2019-11-23 21:29:18,935 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 21:29:18,935 INFO L462 AbstractCegarLoop]: Abstraction has 56 states and 66 transitions. [2019-11-23 21:29:18,935 INFO L463 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-11-23 21:29:18,935 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 66 transitions. [2019-11-23 21:29:18,936 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-11-23 21:29:18,936 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 21:29:18,936 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-11-23 21:29:18,937 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 21:29:18,937 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 21:29:18,937 INFO L82 PathProgramCache]: Analyzing trace with hash 1806859191, now seen corresponding path program 1 times [2019-11-23 21:29:18,938 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 21:29:18,938 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1122646071] [2019-11-23 21:29:18,938 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 21:29:18,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 21:29:18,993 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:29:18,993 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1122646071] [2019-11-23 21:29:18,993 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 21:29:18,993 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 21:29:18,994 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1076294461] [2019-11-23 21:29:18,996 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 21:29:18,996 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 21:29:18,997 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 21:29:18,997 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 21:29:18,997 INFO L87 Difference]: Start difference. First operand 56 states and 66 transitions. Second operand 3 states. [2019-11-23 21:29:19,073 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 21:29:19,073 INFO L93 Difference]: Finished difference Result 115 states and 138 transitions. [2019-11-23 21:29:19,074 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 21:29:19,074 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 7 [2019-11-23 21:29:19,075 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 21:29:19,076 INFO L225 Difference]: With dead ends: 115 [2019-11-23 21:29:19,077 INFO L226 Difference]: Without dead ends: 61 [2019-11-23 21:29:19,078 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:29:19,080 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2019-11-23 21:29:19,092 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 60. [2019-11-23 21:29:19,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2019-11-23 21:29:19,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 71 transitions. [2019-11-23 21:29:19,095 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 71 transitions. Word has length 7 [2019-11-23 21:29:19,096 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 21:29:19,096 INFO L462 AbstractCegarLoop]: Abstraction has 60 states and 71 transitions. [2019-11-23 21:29:19,096 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 21:29:19,096 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 71 transitions. [2019-11-23 21:29:19,097 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-11-23 21:29:19,097 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 21:29:19,098 INFO L410 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 21:29:19,098 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 21:29:19,099 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 21:29:19,100 INFO L82 PathProgramCache]: Analyzing trace with hash 443319948, now seen corresponding path program 1 times [2019-11-23 21:29:19,100 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 21:29:19,101 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [141408130] [2019-11-23 21:29:19,101 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 21:29:19,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 21:29:19,236 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-11-23 21:29:19,236 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [141408130] [2019-11-23 21:29:19,237 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 21:29:19,237 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-23 21:29:19,237 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1439603321] [2019-11-23 21:29:19,238 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-23 21:29:19,238 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 21:29:19,238 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-23 21:29:19,239 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-23 21:29:19,239 INFO L87 Difference]: Start difference. First operand 60 states and 71 transitions. Second operand 4 states. [2019-11-23 21:29:19,384 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 21:29:19,384 INFO L93 Difference]: Finished difference Result 99 states and 117 transitions. [2019-11-23 21:29:19,385 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-23 21:29:19,385 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-11-23 21:29:19,385 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 21:29:19,387 INFO L225 Difference]: With dead ends: 99 [2019-11-23 21:29:19,387 INFO L226 Difference]: Without dead ends: 97 [2019-11-23 21:29:19,387 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:29:19,388 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2019-11-23 21:29:19,395 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 58. [2019-11-23 21:29:19,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2019-11-23 21:29:19,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 69 transitions. [2019-11-23 21:29:19,397 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 69 transitions. Word has length 11 [2019-11-23 21:29:19,397 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 21:29:19,397 INFO L462 AbstractCegarLoop]: Abstraction has 58 states and 69 transitions. [2019-11-23 21:29:19,397 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-23 21:29:19,397 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 69 transitions. [2019-11-23 21:29:19,398 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-11-23 21:29:19,398 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 21:29:19,398 INFO L410 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 21:29:19,399 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 21:29:19,399 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 21:29:19,399 INFO L82 PathProgramCache]: Analyzing trace with hash 2064961448, now seen corresponding path program 1 times [2019-11-23 21:29:19,400 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 21:29:19,400 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1499963333] [2019-11-23 21:29:19,400 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 21:29:19,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 21:29:19,752 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 21:29:19,756 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1499963333] [2019-11-23 21:29:19,757 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [963550685] [2019-11-23 21:29:19,757 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:29:19,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 21:29:19,837 INFO L255 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 30 conjunts are in the unsatisfiable core [2019-11-23 21:29:19,844 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-23 21:29:19,896 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:29:19,897 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 21:29:19,914 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:29:19,915 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-23 21:29:19,915 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:12 [2019-11-23 21:29:19,961 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:29:19,962 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:29:19,963 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 21:29:19,976 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:29:19,985 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 27 treesize of output 15 [2019-11-23 21:29:19,986 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-23 21:29:19,998 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:29:20,004 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 27 treesize of output 15 [2019-11-23 21:29:20,005 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-23 21:29:20,018 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:29:20,018 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-23 21:29:20,019 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:65, output treesize:33 [2019-11-23 21:29:20,061 INFO L392 ElimStorePlain]: Different costs {0=[|v_#memory_int_30|], 6=[|v_#memory_$Pointer$.offset_29|, |v_#memory_$Pointer$.base_29|]} [2019-11-23 21:29:20,068 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 25 treesize of output 17 [2019-11-23 21:29:20,068 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 21:29:20,090 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:29:20,107 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:29:20,108 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 4 new quantified variables, introduced 1 case distinctions, treesize of input 126 treesize of output 136 [2019-11-23 21:29:20,111 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-23 21:29:20,143 INFO L567 ElimStorePlain]: treesize reduction 58, result has 62.1 percent of original size [2019-11-23 21:29:20,209 INFO L343 Elim1Store]: treesize reduction 66, result has 49.6 percent of original size [2019-11-23 21:29:20,209 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 95 treesize of output 122 [2019-11-23 21:29:20,211 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:29:20,215 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-23 21:29:20,235 INFO L567 ElimStorePlain]: treesize reduction 40, result has 58.3 percent of original size [2019-11-23 21:29:20,236 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-23 21:29:20,236 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:142, output treesize:56 [2019-11-23 21:29:20,298 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:29:20,314 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 21:29:20,315 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-23 21:29:20,315 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7] total 12 [2019-11-23 21:29:20,316 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [945544357] [2019-11-23 21:29:20,316 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-11-23 21:29:20,316 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 21:29:20,317 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-11-23 21:29:20,317 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=110, Unknown=0, NotChecked=0, Total=132 [2019-11-23 21:29:20,317 INFO L87 Difference]: Start difference. First operand 58 states and 69 transitions. Second operand 12 states. [2019-11-23 21:29:21,032 WARN L192 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 55 [2019-11-23 21:29:21,348 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 21:29:21,349 INFO L93 Difference]: Finished difference Result 132 states and 160 transitions. [2019-11-23 21:29:21,350 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-11-23 21:29:21,350 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 18 [2019-11-23 21:29:21,350 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 21:29:21,351 INFO L225 Difference]: With dead ends: 132 [2019-11-23 21:29:21,352 INFO L226 Difference]: Without dead ends: 88 [2019-11-23 21:29:21,352 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=72, Invalid=270, Unknown=0, NotChecked=0, Total=342 [2019-11-23 21:29:21,353 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2019-11-23 21:29:21,360 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 71. [2019-11-23 21:29:21,360 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2019-11-23 21:29:21,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 86 transitions. [2019-11-23 21:29:21,361 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 86 transitions. Word has length 18 [2019-11-23 21:29:21,361 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 21:29:21,361 INFO L462 AbstractCegarLoop]: Abstraction has 71 states and 86 transitions. [2019-11-23 21:29:21,362 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-11-23 21:29:21,362 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 86 transitions. [2019-11-23 21:29:21,362 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-11-23 21:29:21,363 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 21:29:21,363 INFO L410 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 21:29:21,567 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 21:29:21,575 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 21:29:21,575 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 21:29:21,575 INFO L82 PathProgramCache]: Analyzing trace with hash -644381054, now seen corresponding path program 1 times [2019-11-23 21:29:21,575 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 21:29:21,576 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2068134183] [2019-11-23 21:29:21,576 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 21:29:21,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 21:29:21,844 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 21:29:21,844 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2068134183] [2019-11-23 21:29:21,845 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1549626573] [2019-11-23 21:29:21,845 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:29:21,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 21:29:21,898 INFO L255 TraceCheckSpWp]: Trace formula consists of 103 conjuncts, 35 conjunts are in the unsatisfiable core [2019-11-23 21:29:21,901 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-23 21:29:21,906 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:29:21,907 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 21:29:21,912 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:29:21,913 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-23 21:29:21,913 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:12 [2019-11-23 21:29:21,952 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:29:21,953 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:29:21,954 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 21:29:21,972 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:29:21,980 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 27 treesize of output 15 [2019-11-23 21:29:21,980 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-23 21:29:21,992 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:29:22,002 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 15 [2019-11-23 21:29:22,003 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-23 21:29:22,013 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:29:22,014 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-23 21:29:22,014 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:68, output treesize:36 [2019-11-23 21:29:22,056 INFO L392 ElimStorePlain]: Different costs {0=[|v_#memory_int_31|], 4=[|v_#memory_$Pointer$.base_31|, |v_#memory_$Pointer$.offset_31|]} [2019-11-23 21:29:22,061 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 19 treesize of output 11 [2019-11-23 21:29:22,061 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 21:29:22,079 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:29:22,110 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:29:22,110 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 2 case distinctions, treesize of input 96 treesize of output 105 [2019-11-23 21:29:22,112 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:29:22,113 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-23 21:29:22,141 INFO L567 ElimStorePlain]: treesize reduction 56, result has 57.6 percent of original size [2019-11-23 21:29:22,151 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 46 treesize of output 25 [2019-11-23 21:29:22,152 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-23 21:29:22,161 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:29:22,161 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-23 21:29:22,162 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:111, output treesize:49 [2019-11-23 21:29:22,252 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:29:22,252 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 49 treesize of output 40 [2019-11-23 21:29:22,253 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 21:29:22,278 INFO L567 ElimStorePlain]: treesize reduction 12, result has 73.3 percent of original size [2019-11-23 21:29:22,281 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:29:22,282 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-23 21:29:22,288 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:29:22,288 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:29:22,288 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:63, output treesize:11 [2019-11-23 21:29:22,300 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:29:22,301 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 21:29:22,303 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:29:22,303 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 21:29:22,303 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:3 [2019-11-23 21:29:22,306 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 21:29:22,306 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-23 21:29:22,306 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 13 [2019-11-23 21:29:22,307 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1677666696] [2019-11-23 21:29:22,307 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-11-23 21:29:22,307 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 21:29:22,308 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-11-23 21:29:22,308 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=130, Unknown=0, NotChecked=0, Total=156 [2019-11-23 21:29:22,308 INFO L87 Difference]: Start difference. First operand 71 states and 86 transitions. Second operand 13 states. [2019-11-23 21:29:23,117 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 21:29:23,118 INFO L93 Difference]: Finished difference Result 99 states and 121 transitions. [2019-11-23 21:29:23,118 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-11-23 21:29:23,119 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 21 [2019-11-23 21:29:23,119 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 21:29:23,120 INFO L225 Difference]: With dead ends: 99 [2019-11-23 21:29:23,120 INFO L226 Difference]: Without dead ends: 97 [2019-11-23 21:29:23,121 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 17 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=72, Invalid=308, Unknown=0, NotChecked=0, Total=380 [2019-11-23 21:29:23,122 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2019-11-23 21:29:23,129 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 77. [2019-11-23 21:29:23,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2019-11-23 21:29:23,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 94 transitions. [2019-11-23 21:29:23,130 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 94 transitions. Word has length 21 [2019-11-23 21:29:23,130 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 21:29:23,130 INFO L462 AbstractCegarLoop]: Abstraction has 77 states and 94 transitions. [2019-11-23 21:29:23,130 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-11-23 21:29:23,130 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 94 transitions. [2019-11-23 21:29:23,131 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-11-23 21:29:23,131 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 21:29:23,131 INFO L410 BasicCegarLoop]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 21:29:23,334 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 21:29:23,335 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 21:29:23,336 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 21:29:23,336 INFO L82 PathProgramCache]: Analyzing trace with hash -1244226061, now seen corresponding path program 1 times [2019-11-23 21:29:23,337 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 21:29:23,337 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1697046503] [2019-11-23 21:29:23,338 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 21:29:23,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 21:29:23,551 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 21:29:23,551 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1697046503] [2019-11-23 21:29:23,552 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1373179754] [2019-11-23 21:29:23,552 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:29:23,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 21:29:23,611 INFO L255 TraceCheckSpWp]: Trace formula consists of 117 conjuncts, 34 conjunts are in the unsatisfiable core [2019-11-23 21:29:23,616 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-23 21:29:23,625 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:29:23,625 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 21:29:23,637 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:29:23,641 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 21:29:23,642 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-23 21:29:23,648 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:29:23,649 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-23 21:29:23,649 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:29, output treesize:24 [2019-11-23 21:29:23,689 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:29:23,690 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:29:23,691 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 21:29:23,733 INFO L567 ElimStorePlain]: treesize reduction 14, result has 80.3 percent of original size [2019-11-23 21:29:23,739 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 21:29:23,755 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:29:23,759 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 21:29:23,760 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 41 treesize of output 20 [2019-11-23 21:29:23,761 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-23 21:29:23,774 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:29:23,775 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-23 21:29:23,776 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:59, output treesize:27 [2019-11-23 21:29:23,803 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2019-11-23 21:29:23,804 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 21:29:23,814 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:29:23,815 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-23 21:29:23,815 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:40, output treesize:36 [2019-11-23 21:29:23,854 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:29:23,854 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:29:23,855 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 21:29:23,874 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:29:23,876 INFO L392 ElimStorePlain]: Different costs {2=[|v_#memory_int_34|], 6=[|v_#memory_int_37|]} [2019-11-23 21:29:23,878 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 21:29:23,905 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:29:23,916 INFO L343 Elim1Store]: treesize reduction 23, result has 28.1 percent of original size [2019-11-23 21:29:23,917 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 50 treesize of output 32 [2019-11-23 21:29:23,918 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-23 21:29:23,930 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:29:23,932 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-11-23 21:29:23,932 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 5 variables, input treesize:71, output treesize:34 [2019-11-23 21:29:23,984 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 32 treesize of output 34 [2019-11-23 21:29:23,985 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 21:29:23,996 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:29:23,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 21:29:23,998 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:47, output treesize:43 [2019-11-23 21:29:24,098 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 33 treesize of output 13 [2019-11-23 21:29:24,098 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 21:29:24,105 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:29:24,106 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:29:24,106 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:45, output treesize:3 [2019-11-23 21:29:24,126 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 21:29:24,126 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-23 21:29:24,126 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 15 [2019-11-23 21:29:24,127 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1198998618] [2019-11-23 21:29:24,127 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-11-23 21:29:24,127 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 21:29:24,127 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-11-23 21:29:24,127 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=159, Unknown=0, NotChecked=0, Total=210 [2019-11-23 21:29:24,128 INFO L87 Difference]: Start difference. First operand 77 states and 94 transitions. Second operand 15 states. [2019-11-23 21:29:25,331 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 21:29:25,331 INFO L93 Difference]: Finished difference Result 238 states and 287 transitions. [2019-11-23 21:29:25,331 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-11-23 21:29:25,331 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 22 [2019-11-23 21:29:25,332 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 21:29:25,335 INFO L225 Difference]: With dead ends: 238 [2019-11-23 21:29:25,335 INFO L226 Difference]: Without dead ends: 223 [2019-11-23 21:29:25,336 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 17 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 127 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=154, Invalid=446, Unknown=0, NotChecked=0, Total=600 [2019-11-23 21:29:25,336 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 223 states. [2019-11-23 21:29:25,348 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 223 to 101. [2019-11-23 21:29:25,348 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 101 states. [2019-11-23 21:29:25,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 127 transitions. [2019-11-23 21:29:25,349 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 127 transitions. Word has length 22 [2019-11-23 21:29:25,350 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 21:29:25,350 INFO L462 AbstractCegarLoop]: Abstraction has 101 states and 127 transitions. [2019-11-23 21:29:25,350 INFO L463 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-11-23 21:29:25,350 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 127 transitions. [2019-11-23 21:29:25,351 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-11-23 21:29:25,351 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 21:29:25,351 INFO L410 BasicCegarLoop]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 21:29:25,554 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 21:29:25,555 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 21:29:25,555 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 21:29:25,555 INFO L82 PathProgramCache]: Analyzing trace with hash 2029850711, now seen corresponding path program 1 times [2019-11-23 21:29:25,556 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 21:29:25,556 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1997470520] [2019-11-23 21:29:25,556 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 21:29:25,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 21:29:25,965 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 21:29:25,968 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1997470520] [2019-11-23 21:29:25,968 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [719462233] [2019-11-23 21:29:25,968 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:29:26,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 21:29:26,028 INFO L255 TraceCheckSpWp]: Trace formula consists of 131 conjuncts, 50 conjunts are in the unsatisfiable core [2019-11-23 21:29:26,031 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-23 21:29:26,041 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:29:26,042 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 21:29:26,047 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:29:26,047 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-23 21:29:26,047 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:12 [2019-11-23 21:29:26,094 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:29:26,095 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:29:26,096 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 21:29:26,153 INFO L567 ElimStorePlain]: treesize reduction 14, result has 83.7 percent of original size [2019-11-23 21:29:26,159 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 27 treesize of output 15 [2019-11-23 21:29:26,159 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-23 21:29:26,177 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:29:26,187 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 27 treesize of output 15 [2019-11-23 21:29:26,187 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-23 21:29:26,201 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:29:26,202 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-23 21:29:26,202 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:74, output treesize:46 [2019-11-23 21:29:26,233 INFO L392 ElimStorePlain]: Different costs {0=[|v_#memory_int_40|], 6=[|v_#memory_$Pointer$.offset_33|, |v_#memory_$Pointer$.base_33|]} [2019-11-23 21:29:26,238 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:29:26,239 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 21:29:26,265 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:29:26,270 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 21:29:26,271 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 34 treesize of output 21 [2019-11-23 21:29:26,271 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-23 21:29:26,291 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:29:26,295 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 21:29:26,295 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 34 treesize of output 21 [2019-11-23 21:29:26,296 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-23 21:29:26,327 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:29:26,328 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-23 21:29:26,328 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:97, output treesize:55 [2019-11-23 21:29:26,399 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:29:26,400 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:29:26,400 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 21:29:26,458 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:29:26,459 INFO L392 ElimStorePlain]: Different costs {0=[|v_#memory_int_41|], 2=[|v_#memory_int_39|], 9=[|v_#memory_$Pointer$.base_34|, |v_#memory_$Pointer$.offset_34|]} [2019-11-23 21:29:26,469 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 39 treesize of output 15 [2019-11-23 21:29:26,470 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-23 21:29:26,513 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:29:26,521 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 15 [2019-11-23 21:29:26,521 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-23 21:29:26,580 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:29:26,632 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:29:26,632 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 4 case distinctions, treesize of input 136 treesize of output 137 [2019-11-23 21:29:26,633 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:29:26,634 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:29:26,635 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-11-23 21:29:26,694 INFO L567 ElimStorePlain]: treesize reduction 64, result has 63.4 percent of original size [2019-11-23 21:29:26,698 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 62 treesize of output 32 [2019-11-23 21:29:26,699 INFO L496 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-11-23 21:29:26,719 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:29:26,720 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, 4 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-23 21:29:26,720 INFO L221 ElimStorePlain]: Needed 6 recursive calls to eliminate 6 variables, input treesize:196, output treesize:64 [2019-11-23 21:29:26,767 INFO L392 ElimStorePlain]: Different costs {2=[|v_#memory_int_42|], 6=[|v_#memory_$Pointer$.offset_35|], 12=[|v_#memory_$Pointer$.base_35|]} [2019-11-23 21:29:26,771 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 41 treesize of output 32 [2019-11-23 21:29:26,772 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 21:29:26,809 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:29:26,816 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 21:29:26,817 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 66 treesize of output 29 [2019-11-23 21:29:26,817 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-23 21:29:26,843 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:29:26,957 WARN L192 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 46 [2019-11-23 21:29:26,958 INFO L343 Elim1Store]: treesize reduction 50, result has 67.1 percent of original size [2019-11-23 21:29:26,958 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 6 case distinctions, treesize of input 138 treesize of output 161 [2019-11-23 21:29:26,960 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:29:26,961 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:29:26,962 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:29:26,962 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:29:26,963 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:29:26,964 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:29:26,965 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:29:26,966 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:29:26,967 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:29:26,968 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:29:26,969 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:29:26,970 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:29:26,971 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:29:26,972 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 4 xjuncts. [2019-11-23 21:29:27,081 WARN L192 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 37 [2019-11-23 21:29:27,082 INFO L567 ElimStorePlain]: treesize reduction 785, result has 11.5 percent of original size [2019-11-23 21:29:27,082 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 21:29:27,082 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:200, output treesize:102 [2019-11-23 21:29:27,214 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:29:27,246 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:29:27,247 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 5 new quantified variables, introduced 3 case distinctions, treesize of input 122 treesize of output 104 [2019-11-23 21:29:27,249 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:29:27,250 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:29:27,250 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:29:27,251 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:29:27,252 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:29:27,253 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:29:27,254 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:29:27,255 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:29:27,255 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:29:27,256 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:29:27,256 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:29:27,257 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:29:27,258 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 21:29:27,289 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:29:27,289 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 5 new quantified variables, introduced 3 case distinctions, treesize of input 120 treesize of output 102 [2019-11-23 21:29:27,290 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:29:27,291 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:29:27,292 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:29:27,293 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:29:27,293 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:29:27,294 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:29:27,295 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:29:27,296 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:29:27,297 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:29:27,298 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:29:27,299 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:29:27,300 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:29:27,301 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:29:27,301 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:29:27,302 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:29:27,303 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:29:27,304 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:29:27,304 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:29:27,305 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 21:29:27,372 INFO L567 ElimStorePlain]: treesize reduction 139, result has 26.5 percent of original size [2019-11-23 21:29:27,375 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 23 treesize of output 7 [2019-11-23 21:29:27,376 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-23 21:29:27,389 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:29:27,390 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 21:29:27,390 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:243, output treesize:20 [2019-11-23 21:29:27,425 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 21:29:27,425 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-23 21:29:27,425 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9] total 17 [2019-11-23 21:29:27,426 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1156736367] [2019-11-23 21:29:27,426 INFO L442 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-11-23 21:29:27,426 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 21:29:27,426 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-11-23 21:29:27,427 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=233, Unknown=0, NotChecked=0, Total=272 [2019-11-23 21:29:27,427 INFO L87 Difference]: Start difference. First operand 101 states and 127 transitions. Second operand 17 states. [2019-11-23 21:29:28,417 WARN L192 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 80 [2019-11-23 21:29:28,627 WARN L192 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 81 [2019-11-23 21:29:29,099 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 21:29:29,100 INFO L93 Difference]: Finished difference Result 250 states and 310 transitions. [2019-11-23 21:29:29,100 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-11-23 21:29:29,100 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 25 [2019-11-23 21:29:29,101 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 21:29:29,102 INFO L225 Difference]: With dead ends: 250 [2019-11-23 21:29:29,103 INFO L226 Difference]: Without dead ends: 197 [2019-11-23 21:29:29,104 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 20 SyntacticMatches, 1 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 113 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=111, Invalid=591, Unknown=0, NotChecked=0, Total=702 [2019-11-23 21:29:29,105 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 197 states. [2019-11-23 21:29:29,115 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 197 to 115. [2019-11-23 21:29:29,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 115 states. [2019-11-23 21:29:29,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 145 transitions. [2019-11-23 21:29:29,117 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 145 transitions. Word has length 25 [2019-11-23 21:29:29,117 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 21:29:29,117 INFO L462 AbstractCegarLoop]: Abstraction has 115 states and 145 transitions. [2019-11-23 21:29:29,117 INFO L463 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-11-23 21:29:29,117 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 145 transitions. [2019-11-23 21:29:29,118 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-11-23 21:29:29,118 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 21:29:29,119 INFO L410 BasicCegarLoop]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 21:29:29,324 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 21:29:29,328 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 21:29:29,328 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 21:29:29,328 INFO L82 PathProgramCache]: Analyzing trace with hash 1220504085, now seen corresponding path program 1 times [2019-11-23 21:29:29,328 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 21:29:29,328 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1866548908] [2019-11-23 21:29:29,329 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 21:29:29,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 21:29:29,383 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-11-23 21:29:29,384 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1866548908] [2019-11-23 21:29:29,384 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 21:29:29,384 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-23 21:29:29,384 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1912276114] [2019-11-23 21:29:29,385 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-23 21:29:29,385 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 21:29:29,385 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-23 21:29:29,385 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-11-23 21:29:29,385 INFO L87 Difference]: Start difference. First operand 115 states and 145 transitions. Second operand 5 states. [2019-11-23 21:29:29,462 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 21:29:29,463 INFO L93 Difference]: Finished difference Result 184 states and 235 transitions. [2019-11-23 21:29:29,463 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-23 21:29:29,463 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 25 [2019-11-23 21:29:29,463 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 21:29:29,464 INFO L225 Difference]: With dead ends: 184 [2019-11-23 21:29:29,464 INFO L226 Difference]: Without dead ends: 130 [2019-11-23 21:29:29,465 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-11-23 21:29:29,466 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2019-11-23 21:29:29,492 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 121. [2019-11-23 21:29:29,492 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 121 states. [2019-11-23 21:29:29,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 151 transitions. [2019-11-23 21:29:29,493 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 151 transitions. Word has length 25 [2019-11-23 21:29:29,493 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 21:29:29,493 INFO L462 AbstractCegarLoop]: Abstraction has 121 states and 151 transitions. [2019-11-23 21:29:29,494 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-23 21:29:29,494 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 151 transitions. [2019-11-23 21:29:29,497 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-11-23 21:29:29,497 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 21:29:29,497 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] [2019-11-23 21:29:29,497 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 21:29:29,498 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 21:29:29,499 INFO L82 PathProgramCache]: Analyzing trace with hash 836449433, now seen corresponding path program 1 times [2019-11-23 21:29:29,499 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 21:29:29,500 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [734262476] [2019-11-23 21:29:29,500 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 21:29:29,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 21:29:29,908 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 21:29:29,908 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [734262476] [2019-11-23 21:29:29,908 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [880326178] [2019-11-23 21:29:29,908 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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:29:29,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 21:29:29,958 INFO L255 TraceCheckSpWp]: Trace formula consists of 130 conjuncts, 51 conjunts are in the unsatisfiable core [2019-11-23 21:29:29,961 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-23 21:29:29,965 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:29:29,966 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 21:29:29,971 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:29:29,972 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-23 21:29:29,972 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:12 [2019-11-23 21:29:30,015 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:29:30,015 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:29:30,016 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 21:29:30,064 INFO L567 ElimStorePlain]: treesize reduction 14, result has 83.7 percent of original size [2019-11-23 21:29:30,070 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 27 treesize of output 15 [2019-11-23 21:29:30,071 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-23 21:29:30,090 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:29:30,101 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 27 treesize of output 15 [2019-11-23 21:29:30,102 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-23 21:29:30,117 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:29:30,118 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-23 21:29:30,118 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:74, output treesize:46 [2019-11-23 21:29:30,152 INFO L392 ElimStorePlain]: Different costs {0=[|v_#memory_int_44|], 6=[|v_#memory_$Pointer$.base_37|, |v_#memory_$Pointer$.offset_37|]} [2019-11-23 21:29:30,157 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:29:30,158 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 21:29:30,193 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:29:30,199 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 21:29:30,201 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 34 treesize of output 21 [2019-11-23 21:29:30,202 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-23 21:29:30,227 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:29:30,233 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 21:29:30,235 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 34 treesize of output 21 [2019-11-23 21:29:30,236 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-23 21:29:30,256 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:29:30,257 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-23 21:29:30,257 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:97, output treesize:55 [2019-11-23 21:29:30,345 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:29:30,346 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:29:30,347 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 21:29:30,416 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:29:30,419 INFO L392 ElimStorePlain]: Different costs {0=[|v_#memory_int_45|], 2=[|v_#memory_int_43|], 9=[|v_#memory_$Pointer$.base_38|, |v_#memory_$Pointer$.offset_38|]} [2019-11-23 21:29:30,428 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 39 treesize of output 15 [2019-11-23 21:29:30,428 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-23 21:29:30,474 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:29:30,486 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 15 [2019-11-23 21:29:30,487 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-23 21:29:30,522 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:29:30,570 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:29:30,571 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 4 case distinctions, treesize of input 136 treesize of output 137 [2019-11-23 21:29:30,572 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:29:30,573 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:29:30,573 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:29:30,574 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:29:30,575 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:29:30,576 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-11-23 21:29:30,733 WARN L192 SmtUtils]: Spent 156.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 43 [2019-11-23 21:29:30,734 INFO L567 ElimStorePlain]: treesize reduction 1094, result has 9.2 percent of original size [2019-11-23 21:29:30,739 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 62 treesize of output 32 [2019-11-23 21:29:30,739 INFO L496 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-11-23 21:29:30,758 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:29:30,758 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, 4 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-23 21:29:30,759 INFO L221 ElimStorePlain]: Needed 6 recursive calls to eliminate 6 variables, input treesize:196, output treesize:64 [2019-11-23 21:29:30,801 INFO L392 ElimStorePlain]: Different costs {2=[|v_#memory_int_46|], 6=[|v_#memory_$Pointer$.offset_39|], 12=[|v_#memory_$Pointer$.base_39|]} [2019-11-23 21:29:30,806 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 41 treesize of output 32 [2019-11-23 21:29:30,806 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 21:29:30,840 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:29:30,846 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 21:29:30,851 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 66 treesize of output 29 [2019-11-23 21:29:30,851 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-23 21:29:30,876 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:29:30,989 WARN L192 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 46 [2019-11-23 21:29:30,989 INFO L343 Elim1Store]: treesize reduction 50, result has 67.1 percent of original size [2019-11-23 21:29:30,990 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 6 case distinctions, treesize of input 138 treesize of output 161 [2019-11-23 21:29:30,991 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:29:30,992 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:29:30,993 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-23 21:29:31,040 INFO L567 ElimStorePlain]: treesize reduction 116, result has 46.8 percent of original size [2019-11-23 21:29:31,040 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 21:29:31,041 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:200, output treesize:102 [2019-11-23 21:29:31,172 INFO L392 ElimStorePlain]: Different costs {2=[|#memory_$Pointer$.offset|], 6=[|#memory_$Pointer$.base|]} [2019-11-23 21:29:31,175 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 30 treesize of output 10 [2019-11-23 21:29:31,176 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 21:29:31,196 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:29:31,216 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:29:31,216 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 5 new quantified variables, introduced 3 case distinctions, treesize of input 87 treesize of output 77 [2019-11-23 21:29:31,218 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:29:31,218 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:29:31,218 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:29:31,219 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:29:31,220 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:29:31,220 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:29:31,221 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 21:29:31,263 INFO L567 ElimStorePlain]: treesize reduction 36, result has 47.1 percent of original size [2019-11-23 21:29:31,264 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-11-23 21:29:31,264 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:116, output treesize:24 [2019-11-23 21:29:31,304 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 24 treesize of output 10 [2019-11-23 21:29:31,305 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 21:29:31,308 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:29:31,308 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:29:31,308 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:28, output treesize:3 [2019-11-23 21:29:31,314 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 21:29:31,314 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-23 21:29:31,314 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10] total 18 [2019-11-23 21:29:31,314 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1227131736] [2019-11-23 21:29:31,315 INFO L442 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-11-23 21:29:31,315 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 21:29:31,315 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-11-23 21:29:31,315 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=263, Unknown=0, NotChecked=0, Total=306 [2019-11-23 21:29:31,315 INFO L87 Difference]: Start difference. First operand 121 states and 151 transitions. Second operand 18 states. [2019-11-23 21:29:32,584 WARN L192 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 78 [2019-11-23 21:29:33,846 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 21:29:33,846 INFO L93 Difference]: Finished difference Result 262 states and 323 transitions. [2019-11-23 21:29:33,847 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-11-23 21:29:33,847 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 25 [2019-11-23 21:29:33,847 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 21:29:33,849 INFO L225 Difference]: With dead ends: 262 [2019-11-23 21:29:33,850 INFO L226 Difference]: Without dead ends: 260 [2019-11-23 21:29:33,851 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 212 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=158, Invalid=964, Unknown=0, NotChecked=0, Total=1122 [2019-11-23 21:29:33,851 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 260 states. [2019-11-23 21:29:33,863 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 260 to 132. [2019-11-23 21:29:33,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 132 states. [2019-11-23 21:29:33,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 167 transitions. [2019-11-23 21:29:33,864 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 167 transitions. Word has length 25 [2019-11-23 21:29:33,865 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 21:29:33,865 INFO L462 AbstractCegarLoop]: Abstraction has 132 states and 167 transitions. [2019-11-23 21:29:33,865 INFO L463 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-11-23 21:29:33,865 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 167 transitions. [2019-11-23 21:29:33,866 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-11-23 21:29:33,866 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 21:29:33,867 INFO L410 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 21:29:34,069 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 21:29:34,070 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 21:29:34,071 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 21:29:34,071 INFO L82 PathProgramCache]: Analyzing trace with hash -2046348832, now seen corresponding path program 1 times [2019-11-23 21:29:34,071 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 21:29:34,072 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2108757153] [2019-11-23 21:29:34,072 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 21:29:34,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 21:29:34,474 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 21:29:34,475 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2108757153] [2019-11-23 21:29:34,475 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2045089395] [2019-11-23 21:29:34,475 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:29:34,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 21:29:34,555 INFO L255 TraceCheckSpWp]: Trace formula consists of 139 conjuncts, 44 conjunts are in the unsatisfiable core [2019-11-23 21:29:34,560 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-23 21:29:34,567 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:29:34,568 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 21:29:34,578 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:29:34,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, 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 21:29:34,587 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-23 21:29:34,596 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:29:34,597 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-23 21:29:34,597 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:29, output treesize:24 [2019-11-23 21:29:34,631 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:29:34,632 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:29:34,632 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 21:29:34,647 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:29:34,652 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 21:29:34,655 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 25 treesize of output 13 [2019-11-23 21:29:34,656 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-23 21:29:34,665 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:29:34,668 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 25 treesize of output 13 [2019-11-23 21:29:34,669 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-23 21:29:34,678 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:29:34,679 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-23 21:29:34,679 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:53, output treesize:17 [2019-11-23 21:29:34,701 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2019-11-23 21:29:34,702 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 21:29:34,712 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:29:34,713 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:29:34,713 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:30, output treesize:26 [2019-11-23 21:29:34,789 INFO L392 ElimStorePlain]: Different costs {1=[|v_#memory_$Pointer$.base_40|, |v_#memory_$Pointer$.offset_40|], 10=[|v_#memory_int_52|]} [2019-11-23 21:29:34,793 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-23 21:29:34,798 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 20 treesize of output 16 [2019-11-23 21:29:34,798 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-11-23 21:29:34,858 INFO L567 ElimStorePlain]: treesize reduction 4, result has 95.1 percent of original size [2019-11-23 21:29:34,862 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-23 21:29:34,867 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 20 treesize of output 16 [2019-11-23 21:29:34,867 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2019-11-23 21:29:34,928 INFO L567 ElimStorePlain]: treesize reduction 4, result has 94.7 percent of original size [2019-11-23 21:29:34,934 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 21:29:34,935 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-23 21:29:35,009 INFO L343 Elim1Store]: treesize reduction 33, result has 70.8 percent of original size [2019-11-23 21:29:35,010 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 39 treesize of output 95 [2019-11-23 21:29:35,011 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-23 21:29:35,098 INFO L567 ElimStorePlain]: treesize reduction 47, result has 61.2 percent of original size [2019-11-23 21:29:35,099 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:29:35,100 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 21:29:35,100 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 5 variables, input treesize:85, output treesize:74 [2019-11-23 21:29:35,100 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:29:35,162 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:29:35,162 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:29:35,163 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:29:35,163 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:29:35,163 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:29:35,164 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:29:35,164 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:29:35,167 INFO L392 ElimStorePlain]: Different costs {2=[|v_#memory_int_49|], 10=[|v_#memory_int_53|]} [2019-11-23 21:29:35,170 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:29:35,177 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 21:29:35,280 WARN L192 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 43 [2019-11-23 21:29:35,280 INFO L567 ElimStorePlain]: treesize reduction 8, result has 93.5 percent of original size [2019-11-23 21:29:35,287 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 21:29:35,300 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-23 21:29:35,319 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:29:35,320 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 2 case distinctions, treesize of input 51 treesize of output 61 [2019-11-23 21:29:35,320 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-23 21:29:35,331 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 21:29:35,341 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-23 21:29:35,389 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:29:35,389 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 4 case distinctions, treesize of input 64 treesize of output 121 [2019-11-23 21:29:35,391 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-11-23 21:29:35,499 WARN L192 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 35 [2019-11-23 21:29:35,499 INFO L567 ElimStorePlain]: treesize reduction 82, result has 48.8 percent of original size [2019-11-23 21:29:35,500 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:29:35,501 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: 4 dim-0 vars, and 2 xjuncts. [2019-11-23 21:29:35,501 INFO L221 ElimStorePlain]: Needed 5 recursive calls to eliminate 5 variables, input treesize:122, output treesize:64 [2019-11-23 21:29:35,502 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:29:35,590 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:29:35,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, 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 21:29:35,591 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 21:29:35,600 INFO L567 ElimStorePlain]: treesize reduction 4, result has 66.7 percent of original size [2019-11-23 21:29:35,600 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:29:35,600 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:22, output treesize:3 [2019-11-23 21:29:35,607 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 21:29:35,607 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-23 21:29:35,607 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 17 [2019-11-23 21:29:35,607 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1391915309] [2019-11-23 21:29:35,608 INFO L442 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-11-23 21:29:35,608 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 21:29:35,608 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-11-23 21:29:35,609 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=220, Unknown=0, NotChecked=0, Total=272 [2019-11-23 21:29:35,609 INFO L87 Difference]: Start difference. First operand 132 states and 167 transitions. Second operand 17 states. [2019-11-23 21:29:36,710 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 21:29:36,710 INFO L93 Difference]: Finished difference Result 229 states and 279 transitions. [2019-11-23 21:29:36,710 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-11-23 21:29:36,711 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 27 [2019-11-23 21:29:36,711 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 21:29:36,712 INFO L225 Difference]: With dead ends: 229 [2019-11-23 21:29:36,713 INFO L226 Difference]: Without dead ends: 214 [2019-11-23 21:29:36,713 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 21 SyntacticMatches, 1 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 150 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=154, Invalid=602, Unknown=0, NotChecked=0, Total=756 [2019-11-23 21:29:36,714 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 214 states. [2019-11-23 21:29:36,724 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 214 to 147. [2019-11-23 21:29:36,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 147 states. [2019-11-23 21:29:36,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 187 transitions. [2019-11-23 21:29:36,724 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 187 transitions. Word has length 27 [2019-11-23 21:29:36,725 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 21:29:36,725 INFO L462 AbstractCegarLoop]: Abstraction has 147 states and 187 transitions. [2019-11-23 21:29:36,725 INFO L463 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-11-23 21:29:36,725 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 187 transitions. [2019-11-23 21:29:36,726 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-11-23 21:29:36,726 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 21:29:36,726 INFO L410 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 21:29:36,929 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 21:29:36,930 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 21:29:36,930 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 21:29:36,931 INFO L82 PathProgramCache]: Analyzing trace with hash -1237002206, now seen corresponding path program 1 times [2019-11-23 21:29:36,931 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 21:29:36,931 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [992895928] [2019-11-23 21:29:36,931 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 21:29:36,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 21:29:37,076 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 21:29:37,077 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [992895928] [2019-11-23 21:29:37,077 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [361467423] [2019-11-23 21:29:37,077 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:29:37,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 21:29:37,134 INFO L255 TraceCheckSpWp]: Trace formula consists of 141 conjuncts, 31 conjunts are in the unsatisfiable core [2019-11-23 21:29:37,145 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-23 21:29:37,154 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:29:37,154 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 21:29:37,163 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:29:37,164 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-23 21:29:37,164 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:12 [2019-11-23 21:29:37,192 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:29:37,192 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 2 case distinctions, treesize of input 17 treesize of output 39 [2019-11-23 21:29:37,193 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 21:29:37,220 INFO L567 ElimStorePlain]: treesize reduction 14, result has 76.7 percent of original size [2019-11-23 21:29:37,224 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 27 treesize of output 15 [2019-11-23 21:29:37,224 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-23 21:29:37,234 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:29:37,235 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-23 21:29:37,235 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:48, output treesize:33 [2019-11-23 21:29:37,303 INFO L343 Elim1Store]: treesize reduction 38, result has 56.3 percent of original size [2019-11-23 21:29:37,304 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 68 treesize of output 83 [2019-11-23 21:29:37,305 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:29:37,306 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 21:29:37,328 INFO L567 ElimStorePlain]: treesize reduction 32, result has 56.8 percent of original size [2019-11-23 21:29:37,329 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 21:29:37,329 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:73, output treesize:42 [2019-11-23 21:29:37,427 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:29:37,428 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 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:29:37,428 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 21:29:37,445 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:29:37,446 INFO L392 ElimStorePlain]: Different costs {3=[|v_#memory_$Pointer$.base_41|], 6=[|v_#memory_$Pointer$.base_44|]} [2019-11-23 21:29:37,448 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 21:29:37,460 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:29:37,461 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 21:29:37,467 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:29:37,468 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 43 treesize of output 34 [2019-11-23 21:29:37,468 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-23 21:29:37,488 INFO L567 ElimStorePlain]: treesize reduction 12, result has 58.6 percent of original size [2019-11-23 21:29:37,489 INFO L496 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-1 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-23 21:29:37,489 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 8 variables, input treesize:81, output treesize:4 [2019-11-23 21:29:37,493 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 21:29:37,493 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-23 21:29:37,494 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 7] total 13 [2019-11-23 21:29:37,494 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2086871721] [2019-11-23 21:29:37,494 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-11-23 21:29:37,494 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 21:29:37,495 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-11-23 21:29:37,495 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=128, Unknown=0, NotChecked=0, Total=156 [2019-11-23 21:29:37,495 INFO L87 Difference]: Start difference. First operand 147 states and 187 transitions. Second operand 13 states. [2019-11-23 21:29:38,844 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 21:29:38,844 INFO L93 Difference]: Finished difference Result 315 states and 383 transitions. [2019-11-23 21:29:38,844 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-11-23 21:29:38,844 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 27 [2019-11-23 21:29:38,844 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 21:29:38,846 INFO L225 Difference]: With dead ends: 315 [2019-11-23 21:29:38,846 INFO L226 Difference]: Without dead ends: 278 [2019-11-23 21:29:38,847 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 24 SyntacticMatches, 1 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 173 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=201, Invalid=669, Unknown=0, NotChecked=0, Total=870 [2019-11-23 21:29:38,848 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 278 states. [2019-11-23 21:29:38,858 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 278 to 150. [2019-11-23 21:29:38,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 150 states. [2019-11-23 21:29:38,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 189 transitions. [2019-11-23 21:29:38,858 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 189 transitions. Word has length 27 [2019-11-23 21:29:38,858 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 21:29:38,859 INFO L462 AbstractCegarLoop]: Abstraction has 150 states and 189 transitions. [2019-11-23 21:29:38,859 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-11-23 21:29:38,859 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 189 transitions. [2019-11-23 21:29:38,860 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-11-23 21:29:38,860 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 21:29:38,860 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 21:29:39,062 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 21:29:39,063 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 21:29:39,063 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 21:29:39,063 INFO L82 PathProgramCache]: Analyzing trace with hash 485990957, now seen corresponding path program 1 times [2019-11-23 21:29:39,063 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 21:29:39,064 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [228849105] [2019-11-23 21:29:39,064 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 21:29:39,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 21:29:39,199 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 21:29:39,199 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [228849105] [2019-11-23 21:29:39,199 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [333150328] [2019-11-23 21:29:39,199 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 21:29:39,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 21:29:39,249 INFO L255 TraceCheckSpWp]: Trace formula consists of 122 conjuncts, 33 conjunts are in the unsatisfiable core [2019-11-23 21:29:39,251 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-23 21:29:39,262 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:29:39,263 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 21:29:39,268 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:29:39,268 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-23 21:29:39,268 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:12 [2019-11-23 21:29:39,288 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:29:39,289 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:29:39,289 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 21:29:39,306 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:29:39,311 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 27 treesize of output 15 [2019-11-23 21:29:39,312 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-23 21:29:39,325 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:29:39,334 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 27 treesize of output 15 [2019-11-23 21:29:39,334 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-23 21:29:39,343 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:29:39,344 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-23 21:29:39,344 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:68, output treesize:36 [2019-11-23 21:29:39,376 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:29:39,376 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 2 case distinctions, treesize of input 85 treesize of output 98 [2019-11-23 21:29:39,377 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:29:39,378 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 21:29:39,403 INFO L567 ElimStorePlain]: treesize reduction 56, result has 53.7 percent of original size [2019-11-23 21:29:39,408 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 46 treesize of output 25 [2019-11-23 21:29:39,409 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-23 21:29:39,425 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:29:39,425 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-23 21:29:39,425 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:92, output treesize:38 [2019-11-23 21:29:39,495 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:29:39,508 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 21:29:39,508 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-23 21:29:39,508 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8] total 13 [2019-11-23 21:29:39,508 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [323809280] [2019-11-23 21:29:39,509 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-11-23 21:29:39,509 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 21:29:39,509 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-11-23 21:29:39,509 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2019-11-23 21:29:39,510 INFO L87 Difference]: Start difference. First operand 150 states and 189 transitions. Second operand 13 states. [2019-11-23 21:29:40,273 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 21:29:40,274 INFO L93 Difference]: Finished difference Result 200 states and 248 transitions. [2019-11-23 21:29:40,274 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-11-23 21:29:40,274 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 27 [2019-11-23 21:29:40,274 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 21:29:40,276 INFO L225 Difference]: With dead ends: 200 [2019-11-23 21:29:40,276 INFO L226 Difference]: Without dead ends: 164 [2019-11-23 21:29:40,277 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 23 SyntacticMatches, 2 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=91, Invalid=329, Unknown=0, NotChecked=0, Total=420 [2019-11-23 21:29:40,277 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164 states. [2019-11-23 21:29:40,287 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164 to 153. [2019-11-23 21:29:40,287 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 153 states. [2019-11-23 21:29:40,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 192 transitions. [2019-11-23 21:29:40,288 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 192 transitions. Word has length 27 [2019-11-23 21:29:40,288 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 21:29:40,288 INFO L462 AbstractCegarLoop]: Abstraction has 153 states and 192 transitions. [2019-11-23 21:29:40,288 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-11-23 21:29:40,288 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 192 transitions. [2019-11-23 21:29:40,289 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-11-23 21:29:40,289 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 21:29:40,289 INFO L410 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 21:29:40,491 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 21:29:40,492 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 21:29:40,493 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 21:29:40,493 INFO L82 PathProgramCache]: Analyzing trace with hash 987204315, now seen corresponding path program 1 times [2019-11-23 21:29:40,493 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 21:29:40,493 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1294548791] [2019-11-23 21:29:40,494 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 21:29:40,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 21:29:40,529 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-11-23 21:29:40,531 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1294548791] [2019-11-23 21:29:40,531 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 21:29:40,532 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-23 21:29:40,532 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2056707822] [2019-11-23 21:29:40,532 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-23 21:29:40,532 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 21:29:40,533 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-23 21:29:40,533 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-11-23 21:29:40,533 INFO L87 Difference]: Start difference. First operand 153 states and 192 transitions. Second operand 5 states. [2019-11-23 21:29:40,617 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 21:29:40,617 INFO L93 Difference]: Finished difference Result 172 states and 215 transitions. [2019-11-23 21:29:40,618 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-23 21:29:40,618 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 28 [2019-11-23 21:29:40,618 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 21:29:40,619 INFO L225 Difference]: With dead ends: 172 [2019-11-23 21:29:40,619 INFO L226 Difference]: Without dead ends: 170 [2019-11-23 21:29:40,620 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-11-23 21:29:40,620 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 170 states. [2019-11-23 21:29:40,631 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 170 to 162. [2019-11-23 21:29:40,631 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 162 states. [2019-11-23 21:29:40,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 162 states and 204 transitions. [2019-11-23 21:29:40,632 INFO L78 Accepts]: Start accepts. Automaton has 162 states and 204 transitions. Word has length 28 [2019-11-23 21:29:40,632 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 21:29:40,632 INFO L462 AbstractCegarLoop]: Abstraction has 162 states and 204 transitions. [2019-11-23 21:29:40,632 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-23 21:29:40,632 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 204 transitions. [2019-11-23 21:29:40,633 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-11-23 21:29:40,633 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 21:29:40,633 INFO L410 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 21:29:40,633 INFO L410 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 21:29:40,634 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 21:29:40,634 INFO L82 PathProgramCache]: Analyzing trace with hash 1044462617, now seen corresponding path program 1 times [2019-11-23 21:29:40,634 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 21:29:40,634 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1858493274] [2019-11-23 21:29:40,634 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 21:29:40,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 21:29:40,686 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-11-23 21:29:40,687 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1858493274] [2019-11-23 21:29:40,687 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 21:29:40,687 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-23 21:29:40,687 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1322619723] [2019-11-23 21:29:40,687 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-23 21:29:40,688 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 21:29:40,688 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-23 21:29:40,688 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-23 21:29:40,688 INFO L87 Difference]: Start difference. First operand 162 states and 204 transitions. Second operand 5 states. [2019-11-23 21:29:40,794 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 21:29:40,795 INFO L93 Difference]: Finished difference Result 223 states and 271 transitions. [2019-11-23 21:29:40,795 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-23 21:29:40,795 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 28 [2019-11-23 21:29:40,795 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 21:29:40,796 INFO L225 Difference]: With dead ends: 223 [2019-11-23 21:29:40,796 INFO L226 Difference]: Without dead ends: 182 [2019-11-23 21:29:40,797 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-11-23 21:29:40,797 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 182 states. [2019-11-23 21:29:40,808 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 182 to 159. [2019-11-23 21:29:40,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 159 states. [2019-11-23 21:29:40,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159 states to 159 states and 196 transitions. [2019-11-23 21:29:40,809 INFO L78 Accepts]: Start accepts. Automaton has 159 states and 196 transitions. Word has length 28 [2019-11-23 21:29:40,810 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 21:29:40,810 INFO L462 AbstractCegarLoop]: Abstraction has 159 states and 196 transitions. [2019-11-23 21:29:40,810 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-23 21:29:40,810 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 196 transitions. [2019-11-23 21:29:40,811 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-11-23 21:29:40,811 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 21:29:40,811 INFO L410 BasicCegarLoop]: trace histogram [4, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 21:29:40,811 INFO L410 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 21:29:40,811 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 21:29:40,811 INFO L82 PathProgramCache]: Analyzing trace with hash 1949280172, now seen corresponding path program 2 times [2019-11-23 21:29:40,811 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 21:29:40,812 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [475449636] [2019-11-23 21:29:40,812 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 21:29:40,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 21:29:41,178 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 21:29:41,179 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [475449636] [2019-11-23 21:29:41,179 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1623782199] [2019-11-23 21:29:41,179 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 21:29:41,244 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-11-23 21:29:41,244 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-23 21:29:41,246 INFO L255 TraceCheckSpWp]: Trace formula consists of 159 conjuncts, 72 conjunts are in the unsatisfiable core [2019-11-23 21:29:41,249 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-23 21:29:41,256 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:29:41,256 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 21:29:41,263 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:29:41,263 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-23 21:29:41,263 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:15 [2019-11-23 21:29:41,288 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:29:41,288 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:29:41,289 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 21:29:41,346 INFO L567 ElimStorePlain]: treesize reduction 14, result has 84.3 percent of original size [2019-11-23 21:29:41,352 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 27 treesize of output 15 [2019-11-23 21:29:41,352 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-23 21:29:41,371 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:29:41,376 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 27 treesize of output 15 [2019-11-23 21:29:41,376 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-23 21:29:41,393 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:29:41,393 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-23 21:29:41,393 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:77, output treesize:49 [2019-11-23 21:29:41,444 INFO L392 ElimStorePlain]: Different costs {0=[|v_#memory_int_56|], 6=[|v_#memory_$Pointer$.base_48|, |v_#memory_$Pointer$.offset_44|]} [2019-11-23 21:29:41,448 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:29:41,449 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 21:29:41,482 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:29:41,487 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 21:29:41,490 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 34 treesize of output 21 [2019-11-23 21:29:41,492 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-23 21:29:41,514 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:29:41,519 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 21:29:41,522 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 34 treesize of output 21 [2019-11-23 21:29:41,522 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-23 21:29:41,545 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:29:41,546 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-23 21:29:41,546 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:100, output treesize:58 [2019-11-23 21:29:41,642 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:29:41,642 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 26 treesize of output 89 [2019-11-23 21:29:41,643 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 21:29:41,806 WARN L192 SmtUtils]: Spent 162.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 68 [2019-11-23 21:29:41,807 INFO L567 ElimStorePlain]: treesize reduction 40, result has 86.2 percent of original size [2019-11-23 21:29:41,809 INFO L392 ElimStorePlain]: Different costs {2=[|v_#memory_int_57|, |v_#memory_int_54|], 10=[|v_#memory_$Pointer$.base_49|, |v_#memory_$Pointer$.offset_45|]} [2019-11-23 21:29:41,817 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 21:29:41,821 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 21 [2019-11-23 21:29:41,822 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-23 21:29:41,882 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:29:41,888 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 33 treesize of output 21 [2019-11-23 21:29:41,889 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-23 21:29:41,937 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:29:41,976 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:29:41,977 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 4 case distinctions, treesize of input 175 treesize of output 164 [2019-11-23 21:29:41,977 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:29:41,978 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:29:41,978 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:29:41,979 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:29:41,980 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:29:41,980 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:29:41,981 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:29:41,982 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:29:41,982 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:29:41,983 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:29:41,984 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:29:41,984 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:29:41,986 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-11-23 21:29:42,269 WARN L192 SmtUtils]: Spent 281.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 50 [2019-11-23 21:29:42,269 INFO L567 ElimStorePlain]: treesize reduction 1281, result has 10.3 percent of original size [2019-11-23 21:29:42,295 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:29:42,296 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 106 treesize of output 107 [2019-11-23 21:29:42,297 INFO L496 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-11-23 21:29:42,354 INFO L567 ElimStorePlain]: treesize reduction 32, result has 73.6 percent of original size [2019-11-23 21:29:42,355 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, 4 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-23 21:29:42,355 INFO L221 ElimStorePlain]: Needed 6 recursive calls to eliminate 6 variables, input treesize:243, output treesize:78 [2019-11-23 21:29:42,397 INFO L392 ElimStorePlain]: Different costs {2=[|v_#memory_int_58|], 6=[|v_#memory_$Pointer$.offset_46|], 12=[|v_#memory_$Pointer$.base_50|]} [2019-11-23 21:29:42,404 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 25 treesize of output 24 [2019-11-23 21:29:42,405 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 21:29:42,451 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:29:42,457 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 21:29:42,458 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 21:29:42,459 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-23 21:29:42,496 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:29:42,499 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 21:29:42,544 INFO L343 Elim1Store]: treesize reduction 24, result has 61.3 percent of original size [2019-11-23 21:29:42,544 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 4 new quantified variables, introduced 3 case distinctions, treesize of input 66 treesize of output 77 [2019-11-23 21:29:42,545 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-23 21:29:42,608 INFO L567 ElimStorePlain]: treesize reduction 46, result has 65.4 percent of original size [2019-11-23 21:29:42,608 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-23 21:29:42,609 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:129, output treesize:87 [2019-11-23 21:29:42,685 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 21:29:42,711 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:29:42,711 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 33 treesize of output 49 [2019-11-23 21:29:42,712 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 21:29:42,829 WARN L192 SmtUtils]: Spent 117.00 ms on a formula simplification that was a NOOP. DAG size: 70 [2019-11-23 21:29:42,830 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:29:42,831 INFO L392 ElimStorePlain]: Different costs {2=[|v_#memory_int_55|], 6=[|v_#memory_int_59|], 10=[|v_#memory_$Pointer$.offset_47|], 18=[|v_#memory_$Pointer$.base_51|]} [2019-11-23 21:29:42,836 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 21:29:42,954 WARN L192 SmtUtils]: Spent 117.00 ms on a formula simplification that was a NOOP. DAG size: 67 [2019-11-23 21:29:42,955 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:29:42,964 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 21:29:42,965 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 92 treesize of output 50 [2019-11-23 21:29:42,965 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-23 21:29:43,042 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:29:43,050 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 82 treesize of output 36 [2019-11-23 21:29:43,051 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-11-23 21:29:43,111 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:29:43,340 WARN L192 SmtUtils]: Spent 220.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 59 [2019-11-23 21:29:43,341 INFO L343 Elim1Store]: treesize reduction 23, result has 85.3 percent of original size [2019-11-23 21:29:43,341 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 5 new quantified variables, introduced 7 case distinctions, treesize of input 181 treesize of output 195 [2019-11-23 21:29:43,344 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:29:43,344 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:29:43,345 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:29:43,347 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:29:43,348 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:29:43,348 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:29:43,349 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:29:43,350 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:29:43,353 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:29:43,354 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:29:43,355 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:29:43,357 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:29:43,358 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:29:43,359 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:29:43,360 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:29:43,361 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:29:43,362 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:29:43,364 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:29:43,365 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:29:43,366 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:29:43,368 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:29:43,369 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:29:43,369 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:29:43,370 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:29:43,370 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:29:43,372 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:29:43,373 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:29:43,374 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:29:43,374 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:29:43,375 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:29:43,376 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:29:43,377 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:29:43,379 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:29:43,380 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:29:43,381 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:29:43,382 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:29:43,383 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:29:43,385 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:29:43,386 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:29:43,387 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:29:43,390 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:29:43,390 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:29:43,391 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:29:43,394 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:29:43,395 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:29:43,396 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:29:43,397 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:29:43,398 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:29:43,399 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:29:43,400 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:29:43,402 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:29:43,403 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:29:43,404 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:29:43,406 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:29:43,407 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:29:43,408 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:29:43,410 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:29:43,411 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:29:43,413 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:29:43,414 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:29:43,416 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:29:43,418 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:29:43,419 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:29:43,420 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:29:43,424 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:29:43,425 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:29:43,426 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:29:43,428 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:29:43,429 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:29:43,430 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:29:43,431 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:29:43,432 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:29:43,443 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:29:43,444 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:29:43,445 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:29:43,446 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:29:43,447 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:29:43,448 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:29:43,450 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:29:43,451 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:29:43,452 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:29:43,454 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:29:43,456 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:29:43,474 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:29:43,477 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:29:43,478 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:29:43,479 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:29:43,480 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:29:43,482 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:29:43,484 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:29:43,484 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:29:43,485 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:29:43,488 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:29:43,489 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:29:43,489 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:29:43,493 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:29:43,494 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:29:43,500 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:29:43,502 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:29:43,503 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:29:43,504 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:29:43,505 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:29:43,506 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:29:43,508 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:29:43,509 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:29:43,510 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:29:43,512 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:29:43,513 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:29:43,514 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:29:43,515 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:29:43,516 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:29:43,517 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:29:43,518 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:29:43,520 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:29:43,521 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:29:43,522 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:29:43,523 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:29:43,524 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:29:43,526 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:29:43,527 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:29:43,527 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:29:43,529 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:29:43,530 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:29:43,531 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:29:43,532 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:29:43,534 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:29:43,535 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:29:43,535 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:29:43,537 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:29:43,537 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:29:43,538 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:29:43,538 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:29:43,539 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:29:43,540 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:29:43,541 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:29:43,542 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:29:43,542 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:29:43,543 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:29:43,544 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:29:43,545 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:29:43,545 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:29:43,547 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:29:43,547 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:29:43,548 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:29:43,550 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:29:43,551 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:29:43,552 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:29:43,553 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:29:43,554 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:29:43,556 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:29:43,557 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:29:43,558 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:29:43,559 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:29:43,561 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:29:43,562 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:29:43,563 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:29:43,565 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:29:43,566 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:29:43,567 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:29:43,568 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:29:43,569 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:29:43,573 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:29:43,574 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:29:43,574 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:29:43,576 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:29:43,577 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:29:43,578 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:29:43,579 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:29:43,581 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:29:43,582 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:29:43,583 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:29:43,585 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:29:43,586 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:29:43,587 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:29:43,590 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:29:43,591 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:29:43,592 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:29:43,593 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:29:43,599 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:29:43,600 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:29:43,602 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:29:43,603 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:29:43,604 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:29:43,605 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:29:43,606 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:29:43,607 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:29:43,609 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:29:43,610 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:29:43,612 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:29:43,613 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:29:43,614 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:29:43,615 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:29:43,616 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:29:43,619 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:29:43,619 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:29:43,620 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:29:43,621 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:29:43,622 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:29:43,625 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:29:43,626 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:29:43,627 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:29:43,628 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:29:43,629 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:29:43,630 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:29:43,631 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:29:43,632 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:29:43,633 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:29:43,637 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:29:43,638 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:29:43,638 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:29:43,640 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:29:43,641 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:29:43,642 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:29:43,643 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:29:43,646 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:29:43,647 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:29:43,648 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:29:43,649 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:29:43,650 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:29:43,652 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:29:43,653 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:29:43,653 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:29:43,656 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:29:43,656 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:29:43,657 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:29:43,659 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:29:43,660 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:29:43,661 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:29:43,662 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:29:43,666 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:29:43,667 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:29:43,668 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:29:43,669 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:29:43,670 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:29:43,670 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:29:43,671 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:29:43,672 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:29:43,675 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:29:43,676 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:29:43,677 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:29:43,678 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:29:43,679 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:29:43,680 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:29:43,682 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:29:43,683 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:29:43,684 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:29:43,686 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:29:43,687 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:29:43,688 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:29:43,690 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:29:43,691 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:29:43,693 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:29:43,694 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:29:43,694 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:29:43,696 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:29:43,697 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:29:43,698 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:29:43,699 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:29:43,701 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:29:43,702 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:29:43,703 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:29:43,705 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:29:43,706 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:29:43,707 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:29:43,708 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:29:43,709 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:29:43,711 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:29:43,712 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:29:43,713 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:29:43,715 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:29:43,716 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:29:43,717 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:29:43,719 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:29:43,720 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:29:43,721 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:29:43,722 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:29:43,724 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:29:43,725 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:29:43,726 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:29:43,727 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:29:43,728 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:29:43,729 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:29:43,731 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:29:43,732 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:29:43,733 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:29:43,735 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:29:43,736 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:29:43,737 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:29:43,738 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:29:43,740 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:29:43,741 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:29:43,742 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:29:43,743 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:29:43,745 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:29:43,746 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:29:43,747 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:29:43,749 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:29:43,750 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:29:43,751 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:29:43,752 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:29:43,753 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:29:43,756 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:29:43,757 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:29:43,758 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:29:43,759 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:29:43,760 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:29:43,761 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:29:43,763 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:29:43,763 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:29:43,764 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:29:43,767 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:29:43,768 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:29:43,768 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:29:43,770 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:29:43,771 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:29:43,773 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:29:43,774 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:29:43,774 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:29:43,776 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:29:43,777 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:29:43,778 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:29:43,780 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:29:43,781 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:29:43,782 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:29:43,785 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:29:43,785 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:29:43,786 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:29:43,787 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:29:43,788 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:29:43,789 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:29:43,790 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:29:43,791 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:29:43,793 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:29:43,794 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:29:43,795 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:29:43,797 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:29:43,798 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:29:43,799 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:29:43,800 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:29:43,802 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:29:43,802 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:29:43,803 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:29:43,805 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:29:43,808 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:29:43,809 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:29:43,809 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:29:43,811 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:29:43,812 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:29:43,813 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:29:43,814 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:29:43,816 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:29:43,817 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:29:43,818 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:29:43,819 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:29:43,821 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:29:43,822 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:29:43,823 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:29:43,824 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:29:43,825 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:29:43,826 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:29:43,827 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:29:43,828 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:29:43,829 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:29:43,831 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:29:43,832 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:29:43,833 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:29:43,835 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:29:43,836 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:29:43,837 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:29:43,838 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:29:43,839 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:29:43,840 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:29:43,841 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:29:43,843 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:29:43,843 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:29:43,845 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:29:43,846 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:29:43,847 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:29:43,848 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:29:43,849 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:29:43,850 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:29:43,851 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:29:43,852 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:29:43,852 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:29:43,853 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:29:43,855 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:29:43,855 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:29:43,856 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:29:43,856 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:29:43,857 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:29:43,858 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:29:43,859 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:29:43,860 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:29:43,861 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:29:43,862 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:29:43,863 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:29:43,864 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:29:43,866 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:29:43,867 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:29:43,868 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:29:43,870 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:29:43,871 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:29:43,871 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:29:43,873 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:29:43,874 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:29:43,875 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:29:43,876 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:29:43,878 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:29:43,879 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:29:43,881 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:29:43,882 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:29:43,883 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:29:43,884 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:29:43,885 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:29:43,886 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:29:43,888 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:29:43,889 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:29:43,890 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:29:43,892 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:29:43,893 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:29:43,894 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:29:43,895 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:29:43,898 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:29:43,898 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:29:43,899 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:29:43,900 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:29:43,901 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:29:43,903 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:29:43,904 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:29:43,905 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:29:43,906 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:29:43,907 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:29:43,908 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:29:43,910 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:29:43,911 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:29:43,912 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:29:43,914 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:29:43,915 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:29:43,915 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:29:43,917 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:29:43,918 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:29:43,919 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:29:43,920 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:29:43,923 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:29:43,924 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:29:43,925 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:29:43,926 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:29:43,927 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:29:43,929 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:29:43,930 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:29:43,930 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:29:43,932 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:29:43,933 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:29:43,934 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:29:43,936 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:29:43,937 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:29:43,938 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:29:43,939 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:29:43,941 INFO L496 ElimStorePlain]: Start of recursive call 6: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-11-23 21:29:44,109 WARN L192 SmtUtils]: Spent 166.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 56 [2019-11-23 21:29:44,110 INFO L567 ElimStorePlain]: treesize reduction 111, result has 46.4 percent of original size [2019-11-23 21:29:44,111 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, 4 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-23 21:29:44,112 INFO L221 ElimStorePlain]: Needed 6 recursive calls to eliminate 7 variables, input treesize:301, output treesize:120 [2019-11-23 21:29:44,193 INFO L392 ElimStorePlain]: Different costs {6=[|v_#memory_int_60|, |v_#memory_$Pointer$.offset_48|], 20=[|v_#memory_$Pointer$.base_52|]} [2019-11-23 21:29:44,202 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 66 treesize of output 56 [2019-11-23 21:29:44,203 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 21:29:44,278 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:29:44,286 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 21:29:44,287 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 82 treesize of output 33 [2019-11-23 21:29:44,288 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-23 21:29:44,351 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:29:44,587 WARN L192 SmtUtils]: Spent 229.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 70 [2019-11-23 21:29:44,587 INFO L343 Elim1Store]: treesize reduction 62, result has 72.4 percent of original size [2019-11-23 21:29:44,588 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 7 new quantified variables, introduced 10 case distinctions, treesize of input 231 treesize of output 242 [2019-11-23 21:29:44,589 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:29:44,590 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:29:44,590 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:29:44,591 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:29:44,592 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:29:44,592 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:29:44,593 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:29:44,594 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:29:44,594 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:29:44,595 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:29:44,597 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:29:44,598 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:29:44,598 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:29:44,599 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:29:44,600 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:29:44,601 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:29:44,602 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:29:44,603 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:29:44,603 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:29:44,604 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:29:44,605 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:29:44,606 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:29:44,607 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:29:44,608 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:29:44,609 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:29:44,610 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:29:44,611 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:29:44,612 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:29:44,613 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:29:44,614 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:29:44,615 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:29:44,616 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:29:44,617 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:29:44,617 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:29:44,618 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:29:44,619 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:29:44,620 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:29:44,621 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:29:44,622 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:29:44,622 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:29:44,623 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:29:44,624 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:29:44,625 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:29:44,626 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:29:44,627 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:29:44,627 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:29:44,628 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:29:44,629 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:29:44,630 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:29:44,631 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:29:44,632 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:29:44,633 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:29:44,634 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:29:44,634 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:29:44,635 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:29:44,636 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:29:44,637 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:29:44,638 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:29:44,639 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:29:44,640 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:29:44,641 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:29:44,642 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:29:44,643 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:29:44,644 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:29:44,645 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:29:44,646 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:29:44,646 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:29:44,647 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:29:44,648 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:29:44,649 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:29:44,650 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:29:44,651 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:29:44,651 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:29:44,652 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:29:44,653 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:29:44,653 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:29:44,654 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:29:44,655 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:29:44,656 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:29:44,657 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:29:44,658 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:29:44,658 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:29:44,659 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:29:44,660 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:29:44,661 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:29:44,662 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:29:44,663 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:29:44,664 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:29:44,664 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:29:44,665 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:29:44,666 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:29:44,667 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:29:44,668 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:29:44,669 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:29:44,669 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:29:44,670 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:29:44,671 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:29:44,672 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:29:44,673 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:29:44,673 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:29:44,674 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:29:44,675 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:29:44,675 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:29:44,676 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:29:44,678 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:29:44,679 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:29:44,679 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:29:44,680 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:29:44,681 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:29:44,682 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:29:44,683 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:29:44,684 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:29:44,685 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:29:44,687 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:29:44,688 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:29:44,688 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:29:44,689 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:29:44,691 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:29:44,693 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:29:44,694 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:29:44,695 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:29:44,695 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:29:44,696 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:29:44,697 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:29:44,699 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:29:44,700 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:29:44,701 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:29:44,701 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:29:44,702 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:29:44,703 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:29:44,703 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:29:44,713 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:29:44,715 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:29:44,716 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:29:44,717 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:29:44,717 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:29:44,718 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:29:44,719 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:29:44,720 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:29:44,721 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:29:44,721 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:29:44,722 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:29:44,723 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:29:44,723 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:29:44,724 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:29:44,725 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:29:44,726 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:29:44,727 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:29:44,728 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:29:44,729 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:29:44,729 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:29:44,730 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:29:44,731 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:29:44,732 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:29:44,733 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:29:44,734 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:29:44,734 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:29:44,735 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:29:44,736 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:29:44,737 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:29:44,738 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:29:44,739 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:29:44,739 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:29:44,740 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:29:44,741 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:29:44,746 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 21 xjuncts. [2019-11-23 21:29:45,284 WARN L192 SmtUtils]: Spent 537.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 49 [2019-11-23 21:29:45,285 INFO L567 ElimStorePlain]: treesize reduction 23228, result has 0.8 percent of original size [2019-11-23 21:29:45,286 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 21:29:45,286 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 5 variables, input treesize:312, output treesize:186 [2019-11-23 21:29:45,393 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:29:45,419 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 21:29:45,420 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 21:29:45,421 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-23 21:29:45,421 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-23 21:29:45,429 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-23 21:29:45,430 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 3 new quantified variables, introduced 0 case distinctions, treesize of input 206 treesize of output 1 [2019-11-23 21:29:45,430 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 21:29:45,435 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 21:29:45,443 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 21:29:45,444 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-23 21:29:45,444 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-23 21:29:45,445 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 3 new quantified variables, introduced 0 case distinctions, treesize of input 204 treesize of output 147 [2019-11-23 21:29:45,446 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-23 21:29:45,470 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:29:45,471 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:29:45,471 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:411, output treesize:138 [2019-11-23 21:29:45,532 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 21:29:45,532 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-23 21:29:45,532 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 19 [2019-11-23 21:29:45,532 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [17262240] [2019-11-23 21:29:45,533 INFO L442 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-11-23 21:29:45,533 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 21:29:45,533 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-11-23 21:29:45,533 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=280, Unknown=0, NotChecked=0, Total=342 [2019-11-23 21:29:45,534 INFO L87 Difference]: Start difference. First operand 159 states and 196 transitions. Second operand 19 states. [2019-11-23 21:29:47,734 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 21:29:47,734 INFO L93 Difference]: Finished difference Result 382 states and 461 transitions. [2019-11-23 21:29:47,735 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-11-23 21:29:47,735 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 29 [2019-11-23 21:29:47,735 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 21:29:47,738 INFO L225 Difference]: With dead ends: 382 [2019-11-23 21:29:47,738 INFO L226 Difference]: Without dead ends: 334 [2019-11-23 21:29:47,739 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 22 SyntacticMatches, 3 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 235 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=180, Invalid=812, Unknown=0, NotChecked=0, Total=992 [2019-11-23 21:29:47,740 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 334 states. [2019-11-23 21:29:47,752 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 334 to 160. [2019-11-23 21:29:47,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 160 states. [2019-11-23 21:29:47,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160 states to 160 states and 198 transitions. [2019-11-23 21:29:47,754 INFO L78 Accepts]: Start accepts. Automaton has 160 states and 198 transitions. Word has length 29 [2019-11-23 21:29:47,754 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 21:29:47,754 INFO L462 AbstractCegarLoop]: Abstraction has 160 states and 198 transitions. [2019-11-23 21:29:47,754 INFO L463 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-11-23 21:29:47,754 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 198 transitions. [2019-11-23 21:29:47,755 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-11-23 21:29:47,755 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 21:29:47,755 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:29:47,958 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 21:29:47,958 INFO L410 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 21:29:47,959 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 21:29:47,959 INFO L82 PathProgramCache]: Analyzing trace with hash -1955841147, now seen corresponding path program 1 times [2019-11-23 21:29:47,959 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 21:29:47,959 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1881657844] [2019-11-23 21:29:47,960 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 21:29:47,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 21:29:48,247 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 2 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 21:29:48,247 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1881657844] [2019-11-23 21:29:48,248 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2107531744] [2019-11-23 21:29:48,248 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 21:29:48,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 21:29:48,302 INFO L255 TraceCheckSpWp]: Trace formula consists of 140 conjuncts, 49 conjunts are in the unsatisfiable core [2019-11-23 21:29:48,305 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-23 21:29:48,314 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:29:48,314 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 21:29:48,320 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:29:48,321 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-23 21:29:48,321 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:12 [2019-11-23 21:29:48,375 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:29:48,376 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:29:48,376 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 21:29:48,426 INFO L567 ElimStorePlain]: treesize reduction 14, result has 83.7 percent of original size [2019-11-23 21:29:48,431 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 27 treesize of output 15 [2019-11-23 21:29:48,432 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-23 21:29:48,449 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:29:48,453 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 27 treesize of output 15 [2019-11-23 21:29:48,454 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-23 21:29:48,475 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:29:48,475 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-23 21:29:48,475 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:74, output treesize:46 [2019-11-23 21:29:48,522 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 21:29:48,523 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 34 treesize of output 21 [2019-11-23 21:29:48,523 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 21:29:48,543 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:29:48,551 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 21:29:48,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, 2 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 21:29:48,553 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-23 21:29:48,573 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:29:48,573 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-23 21:29:48,574 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:84, output treesize:46 [2019-11-23 21:29:48,597 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:29:48,597 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:29:48,598 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 21:29:48,627 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:29:48,634 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 62 treesize of output 32 [2019-11-23 21:29:48,635 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-23 21:29:48,658 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:29:48,702 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:29:48,702 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 4 case distinctions, treesize of input 82 treesize of output 103 [2019-11-23 21:29:48,703 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:29:48,703 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:29:48,704 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:29:48,704 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:29:48,705 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:29:48,705 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:29:48,706 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:29:48,707 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-23 21:29:48,807 INFO L567 ElimStorePlain]: treesize reduction 626, result has 9.3 percent of original size [2019-11-23 21:29:48,808 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-23 21:29:48,808 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:143, output treesize:64 [2019-11-23 21:29:48,873 INFO L392 ElimStorePlain]: Different costs {0=[|v_#memory_int_61|], 12=[|v_#memory_$Pointer$.base_56|, |v_#memory_$Pointer$.offset_52|]} [2019-11-23 21:29:48,878 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 37 treesize of output 25 [2019-11-23 21:29:48,878 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 21:29:48,914 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:29:49,007 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:29:49,007 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 226 treesize of output 257 [2019-11-23 21:29:49,009 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:29:49,010 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:29:49,011 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-23 21:29:49,079 INFO L567 ElimStorePlain]: treesize reduction 310, result has 36.0 percent of original size [2019-11-23 21:29:49,095 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:29:49,096 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 5 new quantified variables, introduced 1 case distinctions, treesize of input 138 treesize of output 147 [2019-11-23 21:29:49,097 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-23 21:29:49,158 INFO L567 ElimStorePlain]: treesize reduction 90, result has 56.1 percent of original size [2019-11-23 21:29:49,158 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-23 21:29:49,158 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:245, output treesize:115 [2019-11-23 21:29:49,295 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:29:49,307 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 2 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 21:29:49,307 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-23 21:29:49,307 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9] total 17 [2019-11-23 21:29:49,307 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1465513681] [2019-11-23 21:29:49,307 INFO L442 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-11-23 21:29:49,308 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 21:29:49,308 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-11-23 21:29:49,308 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=239, Unknown=0, NotChecked=0, Total=272 [2019-11-23 21:29:49,308 INFO L87 Difference]: Start difference. First operand 160 states and 198 transitions. Second operand 17 states. [2019-11-23 21:29:50,344 WARN L192 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 62 [2019-11-23 21:29:50,621 WARN L192 SmtUtils]: Spent 145.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 69 [2019-11-23 21:29:50,839 WARN L192 SmtUtils]: Spent 151.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 71 [2019-11-23 21:29:51,725 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 21:29:51,725 INFO L93 Difference]: Finished difference Result 293 states and 353 transitions. [2019-11-23 21:29:51,725 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-11-23 21:29:51,726 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 29 [2019-11-23 21:29:51,726 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 21:29:51,727 INFO L225 Difference]: With dead ends: 293 [2019-11-23 21:29:51,727 INFO L226 Difference]: Without dead ends: 239 [2019-11-23 21:29:51,728 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 114 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=140, Invalid=852, Unknown=0, NotChecked=0, Total=992 [2019-11-23 21:29:51,728 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 239 states. [2019-11-23 21:29:51,743 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 239 to 181. [2019-11-23 21:29:51,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 181 states. [2019-11-23 21:29:51,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 181 states to 181 states and 224 transitions. [2019-11-23 21:29:51,744 INFO L78 Accepts]: Start accepts. Automaton has 181 states and 224 transitions. Word has length 29 [2019-11-23 21:29:51,745 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 21:29:51,745 INFO L462 AbstractCegarLoop]: Abstraction has 181 states and 224 transitions. [2019-11-23 21:29:51,745 INFO L463 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-11-23 21:29:51,745 INFO L276 IsEmpty]: Start isEmpty. Operand 181 states and 224 transitions. [2019-11-23 21:29:51,745 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-11-23 21:29:51,746 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 21:29:51,746 INFO L410 BasicCegarLoop]: trace histogram [4, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 21:29:51,949 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 21:29:51,949 INFO L410 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 21:29:51,949 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 21:29:51,950 INFO L82 PathProgramCache]: Analyzing trace with hash 1172045616, now seen corresponding path program 2 times [2019-11-23 21:29:51,950 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 21:29:51,950 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1264993505] [2019-11-23 21:29:51,951 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 21:29:51,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 21:29:52,303 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 21:29:52,303 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1264993505] [2019-11-23 21:29:52,303 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [301401917] [2019-11-23 21:29:52,303 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 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 21:29:52,361 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-11-23 21:29:52,362 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-23 21:29:52,364 INFO L255 TraceCheckSpWp]: Trace formula consists of 157 conjuncts, 74 conjunts are in the unsatisfiable core [2019-11-23 21:29:52,369 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-23 21:29:52,374 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:29:52,374 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 21:29:52,381 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:29:52,381 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-23 21:29:52,381 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:15 [2019-11-23 21:29:52,408 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:29:52,409 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:29:52,409 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 21:29:52,467 INFO L567 ElimStorePlain]: treesize reduction 14, result has 84.3 percent of original size [2019-11-23 21:29:52,479 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 27 treesize of output 15 [2019-11-23 21:29:52,479 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-23 21:29:52,506 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:29:52,510 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 27 treesize of output 15 [2019-11-23 21:29:52,510 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-23 21:29:52,534 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:29:52,535 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-23 21:29:52,535 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:77, output treesize:49 [2019-11-23 21:29:52,635 INFO L392 ElimStorePlain]: Different costs {0=[|v_#memory_int_64|], 6=[|v_#memory_$Pointer$.base_58|, |v_#memory_$Pointer$.offset_54|]} [2019-11-23 21:29:52,642 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:29:52,643 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 21:29:52,691 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:29:52,701 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 21:29:52,702 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 34 treesize of output 21 [2019-11-23 21:29:52,703 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-23 21:29:52,737 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:29:52,742 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 21:29:52,743 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 34 treesize of output 21 [2019-11-23 21:29:52,743 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-23 21:29:52,765 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:29:52,766 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-23 21:29:52,766 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:103, output treesize:61 [2019-11-23 21:29:52,859 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:29:52,859 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 26 treesize of output 89 [2019-11-23 21:29:52,860 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 21:29:53,027 WARN L192 SmtUtils]: Spent 167.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 69 [2019-11-23 21:29:53,028 INFO L567 ElimStorePlain]: treesize reduction 40, result has 84.3 percent of original size [2019-11-23 21:29:53,030 INFO L392 ElimStorePlain]: Different costs {0=[|v_#memory_int_65|], 2=[|v_#memory_int_62|], 9=[|v_#memory_$Pointer$.base_59|, |v_#memory_$Pointer$.offset_55|]} [2019-11-23 21:29:53,041 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 39 treesize of output 15 [2019-11-23 21:29:53,041 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-23 21:29:53,101 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:29:53,110 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 15 [2019-11-23 21:29:53,110 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-23 21:29:53,163 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:29:53,204 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:29:53,205 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 4 case distinctions, treesize of input 145 treesize of output 130 [2019-11-23 21:29:53,206 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:29:53,207 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:29:53,207 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:29:53,208 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:29:53,208 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:29:53,209 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:29:53,209 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:29:53,211 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-11-23 21:29:53,472 WARN L192 SmtUtils]: Spent 260.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 51 [2019-11-23 21:29:53,473 INFO L567 ElimStorePlain]: treesize reduction 1147, result has 10.0 percent of original size [2019-11-23 21:29:53,478 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 21:29:53,480 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 62 treesize of output 32 [2019-11-23 21:29:53,480 INFO L496 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-11-23 21:29:53,512 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:29:53,513 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, 4 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-23 21:29:53,513 INFO L221 ElimStorePlain]: Needed 6 recursive calls to eliminate 6 variables, input treesize:208, output treesize:81 [2019-11-23 21:29:53,566 INFO L392 ElimStorePlain]: Different costs {2=[|v_#memory_int_66|], 6=[|v_#memory_$Pointer$.offset_56|], 12=[|v_#memory_$Pointer$.base_60|]} [2019-11-23 21:29:53,595 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 25 treesize of output 24 [2019-11-23 21:29:53,596 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 21:29:53,649 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:29:53,659 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 21:29:53,660 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 21:29:53,661 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-23 21:29:53,707 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:29:53,714 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 21:29:53,769 INFO L343 Elim1Store]: treesize reduction 24, result has 61.3 percent of original size [2019-11-23 21:29:53,770 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 4 new quantified variables, introduced 3 case distinctions, treesize of input 66 treesize of output 77 [2019-11-23 21:29:53,771 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-23 21:29:53,853 INFO L567 ElimStorePlain]: treesize reduction 50, result has 64.3 percent of original size [2019-11-23 21:29:53,854 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-23 21:29:53,854 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:132, output treesize:90 [2019-11-23 21:29:53,927 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 21:29:53,949 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:29:53,950 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 33 treesize of output 49 [2019-11-23 21:29:53,950 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 21:29:54,034 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:29:54,038 INFO L392 ElimStorePlain]: Different costs {2=[|v_#memory_int_63|], 6=[|v_#memory_int_67|], 10=[|v_#memory_$Pointer$.offset_57|], 18=[|v_#memory_$Pointer$.base_61|]} [2019-11-23 21:29:54,042 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 21:29:54,124 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:29:54,132 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 21:29:54,133 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 92 treesize of output 50 [2019-11-23 21:29:54,133 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-23 21:29:54,193 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:29:54,201 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 82 treesize of output 36 [2019-11-23 21:29:54,201 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-11-23 21:29:54,246 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:29:54,419 WARN L192 SmtUtils]: Spent 167.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 59 [2019-11-23 21:29:54,420 INFO L343 Elim1Store]: treesize reduction 23, result has 85.3 percent of original size [2019-11-23 21:29:54,420 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 5 new quantified variables, introduced 7 case distinctions, treesize of input 181 treesize of output 195 [2019-11-23 21:29:54,422 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:29:54,423 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:29:54,423 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:29:54,424 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:29:54,424 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:29:54,424 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:29:54,425 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:29:54,425 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:29:54,426 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:29:54,426 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:29:54,427 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:29:54,427 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:29:54,427 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:29:54,428 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:29:54,429 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:29:54,429 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:29:54,429 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:29:54,430 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:29:54,430 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:29:54,431 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:29:54,431 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:29:54,432 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:29:54,432 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:29:54,432 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:29:54,433 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:29:54,433 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:29:54,433 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:29:54,435 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:29:54,435 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:29:54,436 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:29:54,436 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:29:54,437 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:29:54,437 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:29:54,438 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:29:54,439 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:29:54,439 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:29:54,440 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:29:54,440 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:29:54,441 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:29:54,441 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:29:54,443 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 21:29:54,549 WARN L192 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 57 [2019-11-23 21:29:54,549 INFO L567 ElimStorePlain]: treesize reduction 135, result has 44.4 percent of original size [2019-11-23 21:29:54,550 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, 4 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-23 21:29:54,551 INFO L221 ElimStorePlain]: Needed 6 recursive calls to eliminate 7 variables, input treesize:304, output treesize:123 [2019-11-23 21:29:54,609 INFO L392 ElimStorePlain]: Different costs {6=[|v_#memory_$Pointer$.offset_58|, |v_#memory_int_68|], 20=[|v_#memory_$Pointer$.base_62|]} [2019-11-23 21:29:54,615 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 21:29:54,616 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 82 treesize of output 33 [2019-11-23 21:29:54,616 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 21:29:54,655 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:29:54,660 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 66 treesize of output 56 [2019-11-23 21:29:54,661 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-23 21:29:54,700 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:29:54,888 WARN L192 SmtUtils]: Spent 184.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 70 [2019-11-23 21:29:54,889 INFO L343 Elim1Store]: treesize reduction 62, result has 72.4 percent of original size [2019-11-23 21:29:54,889 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 7 new quantified variables, introduced 10 case distinctions, treesize of input 231 treesize of output 242 [2019-11-23 21:29:54,891 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:29:54,892 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:29:54,893 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:29:54,893 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:29:54,894 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:29:54,894 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:29:54,895 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:29:54,895 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:29:54,895 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:29:54,896 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:29:54,896 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:29:54,897 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:29:54,897 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:29:54,898 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:29:54,898 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:29:54,898 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:29:54,899 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:29:54,900 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:29:54,900 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:29:54,900 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:29:54,901 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:29:54,901 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:29:54,902 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:29:54,903 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:29:54,903 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:29:54,904 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:29:54,904 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:29:54,904 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:29:54,905 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:29:54,905 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:29:54,905 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:29:54,906 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:29:54,906 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:29:54,907 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:29:54,907 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:29:54,908 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:29:54,908 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:29:54,909 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:29:54,909 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:29:54,910 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:29:54,910 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:29:54,910 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:29:54,912 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:29:54,913 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:29:54,914 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:29:54,914 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:29:54,915 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:29:54,915 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:29:54,916 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:29:54,916 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:29:54,917 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:29:54,917 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:29:54,918 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:29:54,918 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:29:54,919 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:29:54,919 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:29:54,919 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:29:54,920 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:29:54,920 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:29:54,921 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:29:54,921 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:29:54,925 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 3 xjuncts. [2019-11-23 21:29:55,216 WARN L192 SmtUtils]: Spent 290.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 52 [2019-11-23 21:29:55,217 INFO L567 ElimStorePlain]: treesize reduction 16377, result has 1.1 percent of original size [2019-11-23 21:29:55,217 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 21:29:55,218 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 5 variables, input treesize:315, output treesize:189 [2019-11-23 21:29:55,405 INFO L392 ElimStorePlain]: Different costs {2=[|#memory_$Pointer$.offset|], 11=[|#memory_$Pointer$.base|]} [2019-11-23 21:29:55,408 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 34 treesize of output 10 [2019-11-23 21:29:55,408 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 21:29:55,440 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:29:55,481 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:29:55,482 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 7 new quantified variables, introduced 6 case distinctions, treesize of input 164 treesize of output 129 [2019-11-23 21:29:55,483 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:29:55,484 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:29:55,484 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:29:55,485 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:29:55,485 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:29:55,486 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:29:55,486 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:29:55,487 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:29:55,487 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:29:55,488 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:29:55,488 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:29:55,489 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:29:55,489 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:29:55,490 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:29:55,490 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:29:55,491 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:29:55,491 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:29:55,492 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:29:55,493 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:29:55,494 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:29:55,494 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:29:55,494 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:29:55,495 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:29:55,496 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:29:55,497 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:29:55,498 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:29:55,498 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:29:55,499 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:29:55,499 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:29:55,500 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:29:55,500 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:29:55,501 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:29:55,502 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:29:55,503 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:29:55,503 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:29:55,504 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:29:55,505 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:29:55,505 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:29:55,506 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:29:55,507 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:29:55,507 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:29:55,508 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:29:55,508 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:29:55,509 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:29:55,510 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:29:55,510 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:29:55,511 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:29:55,512 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:29:55,513 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:29:55,513 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:29:55,523 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 21:29:55,601 INFO L567 ElimStorePlain]: treesize reduction 64, result has 45.3 percent of original size [2019-11-23 21:29:55,602 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-11-23 21:29:55,603 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:197, output treesize:41 [2019-11-23 21:29:55,657 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 33 treesize of output 13 [2019-11-23 21:29:55,658 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 21:29:55,664 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:29:55,665 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:29:55,665 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:45, output treesize:3 [2019-11-23 21:29:55,687 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 21:29:55,687 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-23 21:29:55,687 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 14] total 22 [2019-11-23 21:29:55,688 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [861928468] [2019-11-23 21:29:55,688 INFO L442 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-11-23 21:29:55,688 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 21:29:55,688 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-11-23 21:29:55,689 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=386, Unknown=0, NotChecked=0, Total=462 [2019-11-23 21:29:55,689 INFO L87 Difference]: Start difference. First operand 181 states and 224 transitions. Second operand 22 states. [2019-11-23 21:29:56,496 WARN L192 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 77 [2019-11-23 21:29:58,181 WARN L192 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 72 [2019-11-23 21:29:58,731 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 21:29:58,731 INFO L93 Difference]: Finished difference Result 527 states and 646 transitions. [2019-11-23 21:29:58,732 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2019-11-23 21:29:58,732 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 29 [2019-11-23 21:29:58,732 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 21:29:58,734 INFO L225 Difference]: With dead ends: 527 [2019-11-23 21:29:58,734 INFO L226 Difference]: Without dead ends: 396 [2019-11-23 21:29:58,735 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 19 SyntacticMatches, 2 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 450 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=247, Invalid=1475, Unknown=0, NotChecked=0, Total=1722 [2019-11-23 21:29:58,736 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 396 states. [2019-11-23 21:29:58,754 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 396 to 196. [2019-11-23 21:29:58,754 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 196 states. [2019-11-23 21:29:58,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 196 states to 196 states and 244 transitions. [2019-11-23 21:29:58,755 INFO L78 Accepts]: Start accepts. Automaton has 196 states and 244 transitions. Word has length 29 [2019-11-23 21:29:58,755 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 21:29:58,755 INFO L462 AbstractCegarLoop]: Abstraction has 196 states and 244 transitions. [2019-11-23 21:29:58,755 INFO L463 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-11-23 21:29:58,756 INFO L276 IsEmpty]: Start isEmpty. Operand 196 states and 244 transitions. [2019-11-23 21:29:58,756 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-11-23 21:29:58,756 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 21:29:58,756 INFO L410 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 21:29:58,966 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 21:29:58,967 INFO L410 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 21:29:58,967 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 21:29:58,967 INFO L82 PathProgramCache]: Analyzing trace with hash -484292801, now seen corresponding path program 1 times [2019-11-23 21:29:58,967 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 21:29:58,968 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1025743416] [2019-11-23 21:29:58,968 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 21:29:58,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 21:29:58,996 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-11-23 21:29:58,996 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1025743416] [2019-11-23 21:29:58,997 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 21:29:58,997 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-23 21:29:58,997 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [233036254] [2019-11-23 21:29:58,997 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-23 21:29:58,997 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 21:29:58,998 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-23 21:29:58,998 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-23 21:29:58,998 INFO L87 Difference]: Start difference. First operand 196 states and 244 transitions. Second operand 5 states. [2019-11-23 21:29:59,106 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 21:29:59,106 INFO L93 Difference]: Finished difference Result 302 states and 374 transitions. [2019-11-23 21:29:59,106 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-23 21:29:59,106 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 30 [2019-11-23 21:29:59,107 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 21:29:59,107 INFO L225 Difference]: With dead ends: 302 [2019-11-23 21:29:59,108 INFO L226 Difference]: Without dead ends: 186 [2019-11-23 21:29:59,108 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-11-23 21:29:59,109 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 186 states. [2019-11-23 21:29:59,124 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 186 to 185. [2019-11-23 21:29:59,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 185 states. [2019-11-23 21:29:59,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 185 states to 185 states and 226 transitions. [2019-11-23 21:29:59,125 INFO L78 Accepts]: Start accepts. Automaton has 185 states and 226 transitions. Word has length 30 [2019-11-23 21:29:59,125 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 21:29:59,126 INFO L462 AbstractCegarLoop]: Abstraction has 185 states and 226 transitions. [2019-11-23 21:29:59,126 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-23 21:29:59,126 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 226 transitions. [2019-11-23 21:29:59,126 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-11-23 21:29:59,126 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 21:29:59,127 INFO L410 BasicCegarLoop]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 21:29:59,127 INFO L410 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 21:29:59,127 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 21:29:59,127 INFO L82 PathProgramCache]: Analyzing trace with hash 1819689141, now seen corresponding path program 1 times [2019-11-23 21:29:59,127 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 21:29:59,127 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [936667864] [2019-11-23 21:29:59,127 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 21:29:59,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 21:29:59,245 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-11-23 21:29:59,245 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [936667864] [2019-11-23 21:29:59,246 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 21:29:59,246 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-11-23 21:29:59,246 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [953039513] [2019-11-23 21:29:59,246 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-23 21:29:59,246 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 21:29:59,246 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-23 21:29:59,247 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-11-23 21:29:59,247 INFO L87 Difference]: Start difference. First operand 185 states and 226 transitions. Second operand 7 states. [2019-11-23 21:29:59,528 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 21:29:59,528 INFO L93 Difference]: Finished difference Result 246 states and 291 transitions. [2019-11-23 21:29:59,528 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-23 21:29:59,528 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 31 [2019-11-23 21:29:59,529 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 21:29:59,530 INFO L225 Difference]: With dead ends: 246 [2019-11-23 21:29:59,530 INFO L226 Difference]: Without dead ends: 203 [2019-11-23 21:29:59,530 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2019-11-23 21:29:59,531 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 203 states. [2019-11-23 21:29:59,549 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 203 to 182. [2019-11-23 21:29:59,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 182 states. [2019-11-23 21:29:59,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 182 states to 182 states and 221 transitions. [2019-11-23 21:29:59,551 INFO L78 Accepts]: Start accepts. Automaton has 182 states and 221 transitions. Word has length 31 [2019-11-23 21:29:59,551 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 21:29:59,551 INFO L462 AbstractCegarLoop]: Abstraction has 182 states and 221 transitions. [2019-11-23 21:29:59,551 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-23 21:29:59,551 INFO L276 IsEmpty]: Start isEmpty. Operand 182 states and 221 transitions. [2019-11-23 21:29:59,552 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-11-23 21:29:59,552 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 21:29:59,552 INFO L410 BasicCegarLoop]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 21:29:59,553 INFO L410 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 21:29:59,553 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 21:29:59,553 INFO L82 PathProgramCache]: Analyzing trace with hash -1665931529, now seen corresponding path program 1 times [2019-11-23 21:29:59,553 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 21:29:59,553 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1815967932] [2019-11-23 21:29:59,554 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 21:29:59,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 21:29:59,660 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 21:29:59,661 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1815967932] [2019-11-23 21:29:59,661 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [923103416] [2019-11-23 21:29:59,661 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 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 21:29:59,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 21:29:59,725 INFO L255 TraceCheckSpWp]: Trace formula consists of 159 conjuncts, 29 conjunts are in the unsatisfiable core [2019-11-23 21:29:59,727 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-23 21:29:59,732 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:29:59,733 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 21:29:59,738 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:29:59,738 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-23 21:29:59,738 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:12 [2019-11-23 21:29:59,760 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:29:59,760 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 2 case distinctions, treesize of input 17 treesize of output 39 [2019-11-23 21:29:59,761 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 21:29:59,794 INFO L567 ElimStorePlain]: treesize reduction 14, result has 76.7 percent of original size [2019-11-23 21:29:59,797 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 27 treesize of output 15 [2019-11-23 21:29:59,798 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-23 21:29:59,811 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:29:59,811 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-23 21:29:59,811 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:48, output treesize:33 [2019-11-23 21:29:59,840 INFO L343 Elim1Store]: treesize reduction 27, result has 20.6 percent of original size [2019-11-23 21:29:59,840 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 1 case distinctions, treesize of input 34 treesize of output 21 [2019-11-23 21:29:59,840 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 21:29:59,851 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:29:59,852 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-23 21:29:59,852 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:52, output treesize:33 [2019-11-23 21:29:59,872 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:29:59,873 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 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:29:59,873 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 21:29:59,890 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:29:59,934 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:29:59,935 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 4 case distinctions, treesize of input 79 treesize of output 100 [2019-11-23 21:29:59,935 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:29:59,936 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:29:59,936 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:29:59,937 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:29:59,937 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:29:59,937 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:29:59,938 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-23 21:30:00,026 INFO L567 ElimStorePlain]: treesize reduction 740, result has 6.0 percent of original size [2019-11-23 21:30:00,026 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-23 21:30:00,027 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:90, output treesize:47 [2019-11-23 21:30:00,172 WARN L192 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 46 [2019-11-23 21:30:00,172 INFO L343 Elim1Store]: treesize reduction 50, result has 67.1 percent of original size [2019-11-23 21:30:00,173 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 6 case distinctions, treesize of input 103 treesize of output 142 [2019-11-23 21:30:00,174 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:30:00,174 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:30:00,175 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:30:00,175 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:30:00,176 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:30:00,176 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:30:00,177 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:30:00,177 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:30:00,178 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:30:00,178 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:30:00,178 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:30:00,179 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:30:00,179 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:30:00,179 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:30:00,180 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:30:00,180 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:30:00,180 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:30:00,181 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:30:00,181 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:30:00,181 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:30:00,182 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:30:00,182 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:30:00,182 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:30:00,183 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:30:00,183 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:30:00,183 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:30:00,184 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:30:00,184 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:30:00,185 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 11 xjuncts. [2019-11-23 21:30:00,292 WARN L192 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 22 [2019-11-23 21:30:00,293 INFO L567 ElimStorePlain]: treesize reduction 1365, result has 4.2 percent of original size [2019-11-23 21:30:00,293 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:30:00,294 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:103, output treesize:60 [2019-11-23 21:30:00,348 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:30:00,361 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 21:30:00,362 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-23 21:30:00,362 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 13 [2019-11-23 21:30:00,362 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1880274970] [2019-11-23 21:30:00,363 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-11-23 21:30:00,363 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 21:30:00,363 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-11-23 21:30:00,363 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=118, Unknown=0, NotChecked=0, Total=156 [2019-11-23 21:30:00,363 INFO L87 Difference]: Start difference. First operand 182 states and 221 transitions. Second operand 13 states. [2019-11-23 21:30:01,378 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 21:30:01,378 INFO L93 Difference]: Finished difference Result 344 states and 408 transitions. [2019-11-23 21:30:01,379 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-11-23 21:30:01,379 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 31 [2019-11-23 21:30:01,379 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 21:30:01,381 INFO L225 Difference]: With dead ends: 344 [2019-11-23 21:30:01,381 INFO L226 Difference]: Without dead ends: 304 [2019-11-23 21:30:01,382 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 28 SyntacticMatches, 1 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 85 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=130, Invalid=376, Unknown=0, NotChecked=0, Total=506 [2019-11-23 21:30:01,382 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 304 states. [2019-11-23 21:30:01,401 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 304 to 170. [2019-11-23 21:30:01,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 170 states. [2019-11-23 21:30:01,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 170 states to 170 states and 203 transitions. [2019-11-23 21:30:01,402 INFO L78 Accepts]: Start accepts. Automaton has 170 states and 203 transitions. Word has length 31 [2019-11-23 21:30:01,402 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 21:30:01,402 INFO L462 AbstractCegarLoop]: Abstraction has 170 states and 203 transitions. [2019-11-23 21:30:01,402 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-11-23 21:30:01,402 INFO L276 IsEmpty]: Start isEmpty. Operand 170 states and 203 transitions. [2019-11-23 21:30:01,403 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-11-23 21:30:01,403 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 21:30:01,403 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, 1, 1, 1, 1, 1] [2019-11-23 21:30:01,615 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 21:30:01,615 INFO L410 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 21:30:01,615 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 21:30:01,616 INFO L82 PathProgramCache]: Analyzing trace with hash -1660964169, now seen corresponding path program 1 times [2019-11-23 21:30:01,616 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 21:30:01,616 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1702403760] [2019-11-23 21:30:01,616 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 21:30:01,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 21:30:02,121 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 21:30:02,121 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1702403760] [2019-11-23 21:30:02,121 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [535353562] [2019-11-23 21:30:02,121 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 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 21:30:02,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 21:30:02,185 INFO L255 TraceCheckSpWp]: Trace formula consists of 166 conjuncts, 55 conjunts are in the unsatisfiable core [2019-11-23 21:30:02,187 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-23 21:30:02,191 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:30:02,192 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 21:30:02,203 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:30:02,212 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 21:30:02,212 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-23 21:30:02,220 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:30:02,221 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-23 21:30:02,221 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:29, output treesize:24 [2019-11-23 21:30:02,248 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:30:02,248 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:30:02,249 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 21:30:02,289 INFO L567 ElimStorePlain]: treesize reduction 14, result has 80.3 percent of original size [2019-11-23 21:30:02,291 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 21:30:02,309 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:30:02,313 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 21:30:02,314 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 41 treesize of output 20 [2019-11-23 21:30:02,315 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-23 21:30:02,328 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:30:02,328 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-23 21:30:02,329 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:59, output treesize:27 [2019-11-23 21:30:02,378 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2019-11-23 21:30:02,379 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 21:30:02,401 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:30:02,402 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-23 21:30:02,402 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:40, output treesize:36 [2019-11-23 21:30:02,449 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:30:02,449 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:30:02,450 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 21:30:02,471 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:30:02,472 INFO L392 ElimStorePlain]: Different costs {2=[|v_#memory_int_71|], 6=[|v_#memory_int_75|]} [2019-11-23 21:30:02,473 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 21:30:02,493 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:30:02,505 INFO L343 Elim1Store]: treesize reduction 23, result has 28.1 percent of original size [2019-11-23 21:30:02,506 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 50 treesize of output 32 [2019-11-23 21:30:02,507 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-23 21:30:02,526 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:30:02,527 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-11-23 21:30:02,527 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 5 variables, input treesize:71, output treesize:34 [2019-11-23 21:30:02,560 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 32 treesize of output 34 [2019-11-23 21:30:02,561 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 21:30:02,574 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:30:02,575 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:30:02,575 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:47, output treesize:43 [2019-11-23 21:30:02,684 INFO L392 ElimStorePlain]: Different costs {1=[|v_#memory_$Pointer$.base_67|, |v_#memory_$Pointer$.offset_59|], 18=[|v_#memory_int_77|]} [2019-11-23 21:30:02,687 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-23 21:30:02,690 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 20 treesize of output 16 [2019-11-23 21:30:02,690 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-11-23 21:30:02,787 INFO L567 ElimStorePlain]: treesize reduction 4, result has 96.0 percent of original size [2019-11-23 21:30:02,791 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-23 21:30:02,795 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 20 treesize of output 16 [2019-11-23 21:30:02,795 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2019-11-23 21:30:02,881 INFO L567 ElimStorePlain]: treesize reduction 4, result has 95.7 percent of original size [2019-11-23 21:30:02,888 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 21:30:02,889 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-23 21:30:03,039 WARN L192 SmtUtils]: Spent 148.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 53 [2019-11-23 21:30:03,039 INFO L343 Elim1Store]: treesize reduction 66, result has 66.7 percent of original size [2019-11-23 21:30:03,040 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 3 case distinctions, treesize of input 48 treesize of output 150 [2019-11-23 21:30:03,041 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-23 21:30:03,192 WARN L192 SmtUtils]: Spent 150.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 59 [2019-11-23 21:30:03,192 INFO L567 ElimStorePlain]: treesize reduction 80, result has 55.8 percent of original size [2019-11-23 21:30:03,193 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:30:03,193 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:30:03,194 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:30:03,195 INFO L496 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 3 dim-2 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-11-23 21:30:03,195 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 7 variables, input treesize:102, output treesize:101 [2019-11-23 21:30:03,195 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:30:03,196 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:30:03,196 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:30:03,278 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:30:03,279 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:30:03,279 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:30:03,280 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:30:03,280 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:30:03,281 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:30:03,281 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:30:03,282 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:30:03,282 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:30:03,283 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:30:03,283 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:30:03,283 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:30:03,284 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:30:03,287 INFO L392 ElimStorePlain]: Different costs {5=[|v_#memory_int_72|], 31=[|v_#memory_int_78|]} [2019-11-23 21:30:03,291 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:30:03,299 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 21:30:03,304 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 21:30:03,546 WARN L192 SmtUtils]: Spent 241.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 65 [2019-11-23 21:30:03,547 INFO L567 ElimStorePlain]: treesize reduction 12, result has 94.8 percent of original size [2019-11-23 21:30:03,556 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 21:30:03,585 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-23 21:30:03,602 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:30:03,602 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 68 treesize of output 81 [2019-11-23 21:30:03,603 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-11-23 21:30:03,611 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 21:30:03,632 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-23 21:30:03,648 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:30:03,649 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 68 treesize of output 81 [2019-11-23 21:30:03,649 INFO L496 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-11-23 21:30:03,656 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 21:30:03,670 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-23 21:30:03,749 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:30:03,750 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 6 case distinctions, treesize of input 81 treesize of output 185 [2019-11-23 21:30:03,751 INFO L496 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-11-23 21:30:03,960 WARN L192 SmtUtils]: Spent 208.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 56 [2019-11-23 21:30:03,961 INFO L567 ElimStorePlain]: treesize reduction 178, result has 48.3 percent of original size [2019-11-23 21:30:03,961 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:30:03,962 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:30:03,962 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:30:03,964 INFO L496 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 2 dim-2 vars, End of recursive call: 11 dim-0 vars, and 3 xjuncts. [2019-11-23 21:30:03,965 INFO L221 ElimStorePlain]: Needed 7 recursive calls to eliminate 7 variables, input treesize:227, output treesize:145 [2019-11-23 21:30:03,965 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:30:03,969 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:30:03,969 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:30:04,103 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:30:04,103 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 21 [2019-11-23 21:30:04,104 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 21:30:04,124 INFO L567 ElimStorePlain]: treesize reduction 4, result has 80.0 percent of original size [2019-11-23 21:30:04,124 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 21:30:04,124 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:39, output treesize:3 [2019-11-23 21:30:04,133 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 21:30:04,133 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-23 21:30:04,133 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 22 [2019-11-23 21:30:04,134 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1701312753] [2019-11-23 21:30:04,134 INFO L442 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-11-23 21:30:04,134 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 21:30:04,134 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-11-23 21:30:04,134 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=382, Unknown=0, NotChecked=0, Total=462 [2019-11-23 21:30:04,135 INFO L87 Difference]: Start difference. First operand 170 states and 203 transitions. Second operand 22 states. [2019-11-23 21:30:07,819 WARN L192 SmtUtils]: Spent 2.08 s on a formula simplification. DAG size of input: 108 DAG size of output: 48 [2019-11-23 21:30:10,397 WARN L192 SmtUtils]: Spent 2.09 s on a formula simplification. DAG size of input: 110 DAG size of output: 50 [2019-11-23 21:30:10,795 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 21:30:10,796 INFO L93 Difference]: Finished difference Result 354 states and 416 transitions. [2019-11-23 21:30:10,796 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-11-23 21:30:10,796 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 31 [2019-11-23 21:30:10,796 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 21:30:10,799 INFO L225 Difference]: With dead ends: 354 [2019-11-23 21:30:10,799 INFO L226 Difference]: Without dead ends: 336 [2019-11-23 21:30:10,800 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 22 SyntacticMatches, 1 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 353 ImplicationChecksByTransitivity, 5.9s TimeCoverageRelationStatistics Valid=332, Invalid=1150, Unknown=0, NotChecked=0, Total=1482 [2019-11-23 21:30:10,801 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 336 states. [2019-11-23 21:30:10,820 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 336 to 167. [2019-11-23 21:30:10,820 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 167 states. [2019-11-23 21:30:10,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 167 states to 167 states and 200 transitions. [2019-11-23 21:30:10,821 INFO L78 Accepts]: Start accepts. Automaton has 167 states and 200 transitions. Word has length 31 [2019-11-23 21:30:10,821 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 21:30:10,821 INFO L462 AbstractCegarLoop]: Abstraction has 167 states and 200 transitions. [2019-11-23 21:30:10,821 INFO L463 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-11-23 21:30:10,821 INFO L276 IsEmpty]: Start isEmpty. Operand 167 states and 200 transitions. [2019-11-23 21:30:10,822 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-11-23 21:30:10,822 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 21:30:10,822 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, 1, 1] [2019-11-23 21:30:11,024 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 21:30:11,025 INFO L410 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 21:30:11,025 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 21:30:11,025 INFO L82 PathProgramCache]: Analyzing trace with hash 871375620, now seen corresponding path program 1 times [2019-11-23 21:30:11,026 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 21:30:11,026 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1228307660] [2019-11-23 21:30:11,026 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 21:30:11,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 21:30:11,294 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 21:30:11,294 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1228307660] [2019-11-23 21:30:11,294 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1917026060] [2019-11-23 21:30:11,294 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 21:30:11,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 21:30:11,390 INFO L255 TraceCheckSpWp]: Trace formula consists of 149 conjuncts, 54 conjunts are in the unsatisfiable core [2019-11-23 21:30:11,392 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-23 21:30:11,399 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:30:11,400 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 21:30:11,422 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:30:11,423 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-23 21:30:11,423 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:12 [2019-11-23 21:30:11,481 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:30:11,481 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:30:11,482 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 21:30:11,535 INFO L567 ElimStorePlain]: treesize reduction 14, result has 83.7 percent of original size [2019-11-23 21:30:11,543 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 27 treesize of output 15 [2019-11-23 21:30:11,543 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-23 21:30:11,560 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:30:11,563 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 27 treesize of output 15 [2019-11-23 21:30:11,564 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-23 21:30:11,578 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:30:11,579 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-23 21:30:11,579 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:74, output treesize:46 [2019-11-23 21:30:11,622 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 21:30:11,623 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 34 treesize of output 21 [2019-11-23 21:30:11,623 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 21:30:11,643 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:30:11,647 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 21:30:11,648 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 34 treesize of output 21 [2019-11-23 21:30:11,648 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-23 21:30:11,664 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:30:11,664 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-23 21:30:11,664 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:84, output treesize:46 [2019-11-23 21:30:11,687 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:30:11,687 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:30:11,688 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 21:30:11,724 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:30:11,760 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:30:11,761 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 4 case distinctions, treesize of input 125 treesize of output 122 [2019-11-23 21:30:11,762 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:30:11,762 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:30:11,763 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-23 21:30:11,821 INFO L567 ElimStorePlain]: treesize reduction 60, result has 63.2 percent of original size [2019-11-23 21:30:11,825 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 62 treesize of output 32 [2019-11-23 21:30:11,825 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-23 21:30:11,843 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:30:11,844 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-23 21:30:11,844 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:146, output treesize:67 [2019-11-23 21:30:11,896 INFO L392 ElimStorePlain]: Different costs {0=[|v_#memory_int_79|], 7=[|v_#memory_$Pointer$.base_71|, |v_#memory_$Pointer$.offset_63|]} [2019-11-23 21:30:11,901 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 27 treesize of output 15 [2019-11-23 21:30:11,901 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 21:30:11,928 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:30:11,978 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:30:11,979 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 5 new quantified variables, introduced 4 case distinctions, treesize of input 171 treesize of output 150 [2019-11-23 21:30:11,980 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:30:11,981 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:30:11,981 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:30:11,982 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:30:11,983 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 5 xjuncts. [2019-11-23 21:30:12,201 WARN L192 SmtUtils]: Spent 217.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 41 [2019-11-23 21:30:12,202 INFO L567 ElimStorePlain]: treesize reduction 1201, result has 10.4 percent of original size [2019-11-23 21:30:12,208 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 73 treesize of output 43 [2019-11-23 21:30:12,209 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-23 21:30:12,229 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:30:12,229 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-23 21:30:12,230 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:190, output treesize:100 [2019-11-23 21:30:12,439 INFO L343 Elim1Store]: treesize reduction 8, result has 86.7 percent of original size [2019-11-23 21:30:12,440 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 6 case distinctions, treesize of input 123 treesize of output 108 [2019-11-23 21:30:12,441 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:30:12,441 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:30:12,442 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:30:12,442 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:30:12,443 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:30:12,443 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:30:12,444 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:30:12,444 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:30:12,444 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:30:12,444 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:30:12,445 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:30:12,445 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:30:12,445 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:30:12,494 INFO L567 ElimStorePlain]: treesize reduction 48, result has 52.0 percent of original size [2019-11-23 21:30:12,502 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:30:12,503 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 5 new quantified variables, introduced 1 case distinctions, treesize of input 33 treesize of output 24 [2019-11-23 21:30:12,503 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-23 21:30:12,511 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:30:12,512 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:30:12,512 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:130, output treesize:11 [2019-11-23 21:30:12,526 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:30:12,527 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 21:30:12,528 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:30:12,528 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 21:30:12,528 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:3 [2019-11-23 21:30:12,537 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 21:30:12,537 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-23 21:30:12,537 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 10] total 18 [2019-11-23 21:30:12,537 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [933939050] [2019-11-23 21:30:12,538 INFO L442 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-11-23 21:30:12,538 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 21:30:12,538 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-11-23 21:30:12,538 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=269, Unknown=0, NotChecked=0, Total=306 [2019-11-23 21:30:12,539 INFO L87 Difference]: Start difference. First operand 167 states and 200 transitions. Second operand 18 states. [2019-11-23 21:30:13,600 WARN L192 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 60 [2019-11-23 21:30:13,818 WARN L192 SmtUtils]: Spent 141.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 71 [2019-11-23 21:30:14,983 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 21:30:14,984 INFO L93 Difference]: Finished difference Result 237 states and 284 transitions. [2019-11-23 21:30:14,986 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-11-23 21:30:14,986 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 31 [2019-11-23 21:30:14,987 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 21:30:14,987 INFO L225 Difference]: With dead ends: 237 [2019-11-23 21:30:14,987 INFO L226 Difference]: Without dead ends: 235 [2019-11-23 21:30:14,988 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 25 SyntacticMatches, 1 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 187 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=148, Invalid=1042, Unknown=0, NotChecked=0, Total=1190 [2019-11-23 21:30:14,988 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 235 states. [2019-11-23 21:30:15,007 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 235 to 176. [2019-11-23 21:30:15,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 176 states. [2019-11-23 21:30:15,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 176 states to 176 states and 213 transitions. [2019-11-23 21:30:15,008 INFO L78 Accepts]: Start accepts. Automaton has 176 states and 213 transitions. Word has length 31 [2019-11-23 21:30:15,008 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 21:30:15,009 INFO L462 AbstractCegarLoop]: Abstraction has 176 states and 213 transitions. [2019-11-23 21:30:15,009 INFO L463 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-11-23 21:30:15,009 INFO L276 IsEmpty]: Start isEmpty. Operand 176 states and 213 transitions. [2019-11-23 21:30:15,009 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-11-23 21:30:15,009 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 21:30:15,009 INFO L410 BasicCegarLoop]: trace histogram [4, 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:30:15,209 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 21:30:15,210 INFO L410 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 21:30:15,210 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 21:30:15,211 INFO L82 PathProgramCache]: Analyzing trace with hash -232185766, now seen corresponding path program 2 times [2019-11-23 21:30:15,211 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 21:30:15,211 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1689239395] [2019-11-23 21:30:15,212 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 21:30:15,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 21:30:15,370 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 19 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-11-23 21:30:15,370 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1689239395] [2019-11-23 21:30:15,370 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1385652958] [2019-11-23 21:30:15,371 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 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 21:30:15,435 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-11-23 21:30:15,435 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-23 21:30:15,436 INFO L255 TraceCheckSpWp]: Trace formula consists of 168 conjuncts, 19 conjunts are in the unsatisfiable core [2019-11-23 21:30:15,437 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-23 21:30:15,494 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 25 treesize of output 17 [2019-11-23 21:30:15,495 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 21:30:15,499 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:30:15,501 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 21 treesize of output 13 [2019-11-23 21:30:15,501 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-23 21:30:15,504 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:30:15,504 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:30:15,504 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:32, output treesize:9 [2019-11-23 21:30:15,517 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 21:30:15,518 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 21:30:15,519 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:30:15,519 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:30:15,519 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:19, output treesize:3 [2019-11-23 21:30:15,521 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-11-23 21:30:15,521 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-23 21:30:15,521 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 6] total 15 [2019-11-23 21:30:15,522 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2110066027] [2019-11-23 21:30:15,522 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-11-23 21:30:15,522 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 21:30:15,523 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-11-23 21:30:15,523 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=173, Unknown=0, NotChecked=0, Total=210 [2019-11-23 21:30:15,523 INFO L87 Difference]: Start difference. First operand 176 states and 213 transitions. Second operand 15 states. [2019-11-23 21:30:16,594 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 21:30:16,594 INFO L93 Difference]: Finished difference Result 227 states and 279 transitions. [2019-11-23 21:30:16,594 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-11-23 21:30:16,594 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 33 [2019-11-23 21:30:16,595 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 21:30:16,596 INFO L225 Difference]: With dead ends: 227 [2019-11-23 21:30:16,596 INFO L226 Difference]: Without dead ends: 225 [2019-11-23 21:30:16,598 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 187 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=187, Invalid=805, Unknown=0, NotChecked=0, Total=992 [2019-11-23 21:30:16,598 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 225 states. [2019-11-23 21:30:16,618 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 225 to 172. [2019-11-23 21:30:16,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 172 states. [2019-11-23 21:30:16,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172 states to 172 states and 209 transitions. [2019-11-23 21:30:16,619 INFO L78 Accepts]: Start accepts. Automaton has 172 states and 209 transitions. Word has length 33 [2019-11-23 21:30:16,619 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 21:30:16,619 INFO L462 AbstractCegarLoop]: Abstraction has 172 states and 209 transitions. [2019-11-23 21:30:16,620 INFO L463 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-11-23 21:30:16,620 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 209 transitions. [2019-11-23 21:30:16,620 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-11-23 21:30:16,620 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 21:30:16,620 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 21:30:16,824 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 21:30:16,824 INFO L410 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 21:30:16,825 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 21:30:16,825 INFO L82 PathProgramCache]: Analyzing trace with hash -1992685875, now seen corresponding path program 1 times [2019-11-23 21:30:16,825 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 21:30:16,825 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1120923095] [2019-11-23 21:30:16,825 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 21:30:16,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 21:30:16,972 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 21:30:16,972 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1120923095] [2019-11-23 21:30:16,972 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1372656435] [2019-11-23 21:30:16,972 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 21:30:17,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 21:30:17,045 INFO L255 TraceCheckSpWp]: Trace formula consists of 155 conjuncts, 39 conjunts are in the unsatisfiable core [2019-11-23 21:30:17,047 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-23 21:30:17,051 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:30:17,051 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 21:30:17,056 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:30:17,057 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-23 21:30:17,057 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:12 [2019-11-23 21:30:17,078 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:30:17,079 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:30:17,079 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 21:30:17,105 INFO L567 ElimStorePlain]: treesize reduction 14, result has 75.0 percent of original size [2019-11-23 21:30:17,109 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 27 treesize of output 15 [2019-11-23 21:30:17,110 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-23 21:30:17,118 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:30:17,119 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-23 21:30:17,119 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:44, output treesize:29 [2019-11-23 21:30:17,183 INFO L343 Elim1Store]: treesize reduction 38, result has 56.3 percent of original size [2019-11-23 21:30:17,183 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 60 treesize of output 79 [2019-11-23 21:30:17,184 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:30:17,184 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 21:30:17,201 INFO L567 ElimStorePlain]: treesize reduction 32, result has 51.5 percent of original size [2019-11-23 21:30:17,201 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 21:30:17,202 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:65, output treesize:34 [2019-11-23 21:30:17,413 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:30:17,413 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:30:17,414 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 21:30:17,457 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:30:17,459 INFO L392 ElimStorePlain]: Different costs {2=[|v_#memory_$Pointer$.offset_65|], 3=[|v_#memory_$Pointer$.base_72|, |v_#memory_$Pointer$.offset_64|], 12=[|v_#memory_$Pointer$.base_75|]} [2019-11-23 21:30:17,467 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 31 treesize of output 15 [2019-11-23 21:30:17,467 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-23 21:30:17,499 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:30:17,501 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 21:30:17,521 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:30:17,524 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 21:30:17,534 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 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 23 treesize of output 7 [2019-11-23 21:30:17,535 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-11-23 21:30:17,551 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:30:17,571 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:30:17,571 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 141 treesize of output 120 [2019-11-23 21:30:17,572 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:30:17,572 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:30:17,573 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:30:17,573 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:30:17,574 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:30:17,574 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:30:17,575 INFO L496 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-11-23 21:30:17,578 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:30:17,579 INFO L496 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 1 dim-1 vars, 4 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-23 21:30:17,579 INFO L221 ElimStorePlain]: Needed 6 recursive calls to eliminate 11 variables, input treesize:137, output treesize:7 [2019-11-23 21:30:17,586 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 21:30:17,586 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-23 21:30:17,586 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10] total 17 [2019-11-23 21:30:17,586 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [689430241] [2019-11-23 21:30:17,587 INFO L442 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-11-23 21:30:17,587 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 21:30:17,587 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-11-23 21:30:17,587 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=220, Unknown=0, NotChecked=0, Total=272 [2019-11-23 21:30:17,587 INFO L87 Difference]: Start difference. First operand 172 states and 209 transitions. Second operand 17 states. [2019-11-23 21:30:18,576 WARN L192 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 41 [2019-11-23 21:30:19,181 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 21:30:19,182 INFO L93 Difference]: Finished difference Result 313 states and 364 transitions. [2019-11-23 21:30:19,182 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-11-23 21:30:19,182 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 33 [2019-11-23 21:30:19,183 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 21:30:19,184 INFO L225 Difference]: With dead ends: 313 [2019-11-23 21:30:19,184 INFO L226 Difference]: Without dead ends: 273 [2019-11-23 21:30:19,185 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 27 SyntacticMatches, 1 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 327 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=296, Invalid=1036, Unknown=0, NotChecked=0, Total=1332 [2019-11-23 21:30:19,186 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 273 states. [2019-11-23 21:30:19,212 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 273 to 177. [2019-11-23 21:30:19,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 177 states. [2019-11-23 21:30:19,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 177 states to 177 states and 213 transitions. [2019-11-23 21:30:19,213 INFO L78 Accepts]: Start accepts. Automaton has 177 states and 213 transitions. Word has length 33 [2019-11-23 21:30:19,213 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 21:30:19,213 INFO L462 AbstractCegarLoop]: Abstraction has 177 states and 213 transitions. [2019-11-23 21:30:19,213 INFO L463 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-11-23 21:30:19,213 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 213 transitions. [2019-11-23 21:30:19,213 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-11-23 21:30:19,213 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 21:30:19,213 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 21:30:19,414 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 21:30:19,414 INFO L410 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 21:30:19,415 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 21:30:19,415 INFO L82 PathProgramCache]: Analyzing trace with hash -1183339249, now seen corresponding path program 1 times [2019-11-23 21:30:19,415 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 21:30:19,415 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [661143215] [2019-11-23 21:30:19,416 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 21:30:19,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 21:30:19,683 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 21:30:19,684 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [661143215] [2019-11-23 21:30:19,684 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [265385446] [2019-11-23 21:30:19,684 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 21:30:19,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 21:30:19,743 INFO L255 TraceCheckSpWp]: Trace formula consists of 157 conjuncts, 41 conjunts are in the unsatisfiable core [2019-11-23 21:30:19,744 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-23 21:30:19,749 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:30:19,749 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 21:30:19,759 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:30:19,762 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 21:30:19,762 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-23 21:30:19,771 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:30:19,771 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-23 21:30:19,771 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:29, output treesize:24 [2019-11-23 21:30:19,815 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:30:19,815 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:30:19,816 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 21:30:19,883 INFO L567 ElimStorePlain]: treesize reduction 14, result has 85.7 percent of original size [2019-11-23 21:30:19,887 INFO L392 ElimStorePlain]: Different costs {0=[|v_#memory_$Pointer$.base_76|], 2=[|v_#memory_int_81|, |v_#memory_int_82|]} [2019-11-23 21:30:19,894 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 27 treesize of output 15 [2019-11-23 21:30:19,894 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-23 21:30:19,924 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:30:19,926 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 21:30:19,950 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:30:19,954 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 21:30:19,955 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 41 treesize of output 20 [2019-11-23 21:30:19,956 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-11-23 21:30:19,974 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:30:19,975 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-23 21:30:19,975 INFO L221 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:86, output treesize:41 [2019-11-23 21:30:20,005 INFO L392 ElimStorePlain]: Different costs {2=[|v_#memory_int_83|], 6=[|v_#memory_$Pointer$.base_77|]} [2019-11-23 21:30:20,009 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 26 [2019-11-23 21:30:20,009 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 21:30:20,033 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:30:20,088 INFO L343 Elim1Store]: treesize reduction 38, result has 56.3 percent of original size [2019-11-23 21:30:20,088 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 73 treesize of output 88 [2019-11-23 21:30:20,089 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:30:20,090 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:30:20,090 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:30:20,091 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 3 xjuncts. [2019-11-23 21:30:20,138 INFO L567 ElimStorePlain]: treesize reduction 109, result has 35.1 percent of original size [2019-11-23 21:30:20,139 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 21:30:20,139 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:98, output treesize:59 [2019-11-23 21:30:20,238 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:30:20,239 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 49 treesize of output 40 [2019-11-23 21:30:20,239 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 21:30:20,266 INFO L567 ElimStorePlain]: treesize reduction 12, result has 75.0 percent of original size [2019-11-23 21:30:20,267 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 21:30:20,267 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:66, output treesize:36 [2019-11-23 21:30:20,316 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:30:20,317 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:30:20,317 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 21:30:20,334 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:30:20,350 INFO L343 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2019-11-23 21:30:20,350 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 39 treesize of output 34 [2019-11-23 21:30:20,351 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-23 21:30:20,365 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:30:20,366 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-11-23 21:30:20,366 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:61, output treesize:43 [2019-11-23 21:30:20,412 INFO L343 Elim1Store]: treesize reduction 21, result has 41.7 percent of original size [2019-11-23 21:30:20,412 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 43 treesize of output 43 [2019-11-23 21:30:20,413 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 21:30:20,431 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:30:20,432 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:30:20,434 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:30:20,434 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:58, output treesize:59 [2019-11-23 21:30:20,527 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 24 treesize of output 10 [2019-11-23 21:30:20,527 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 21:30:20,530 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:30:20,530 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:30:20,531 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:28, output treesize:3 [2019-11-23 21:30:20,540 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 21:30:20,540 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-23 21:30:20,540 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11] total 20 [2019-11-23 21:30:20,540 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1006281701] [2019-11-23 21:30:20,541 INFO L442 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-11-23 21:30:20,541 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 21:30:20,541 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-11-23 21:30:20,541 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=303, Unknown=0, NotChecked=0, Total=380 [2019-11-23 21:30:20,541 INFO L87 Difference]: Start difference. First operand 177 states and 213 transitions. Second operand 20 states. [2019-11-23 21:30:22,693 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 21:30:22,693 INFO L93 Difference]: Finished difference Result 355 states and 413 transitions. [2019-11-23 21:30:22,694 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-11-23 21:30:22,694 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 33 [2019-11-23 21:30:22,695 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 21:30:22,696 INFO L225 Difference]: With dead ends: 355 [2019-11-23 21:30:22,696 INFO L226 Difference]: Without dead ends: 332 [2019-11-23 21:30:22,696 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 340 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=320, Invalid=1162, Unknown=0, NotChecked=0, Total=1482 [2019-11-23 21:30:22,697 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 332 states. [2019-11-23 21:30:22,715 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 332 to 198. [2019-11-23 21:30:22,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 198 states. [2019-11-23 21:30:22,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 198 states to 198 states and 240 transitions. [2019-11-23 21:30:22,716 INFO L78 Accepts]: Start accepts. Automaton has 198 states and 240 transitions. Word has length 33 [2019-11-23 21:30:22,716 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 21:30:22,716 INFO L462 AbstractCegarLoop]: Abstraction has 198 states and 240 transitions. [2019-11-23 21:30:22,716 INFO L463 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-11-23 21:30:22,716 INFO L276 IsEmpty]: Start isEmpty. Operand 198 states and 240 transitions. [2019-11-23 21:30:22,717 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-11-23 21:30:22,717 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 21:30:22,717 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 21:30:22,920 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 21:30:22,920 INFO L410 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 21:30:22,921 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 21:30:22,921 INFO L82 PathProgramCache]: Analyzing trace with hash 645816411, now seen corresponding path program 2 times [2019-11-23 21:30:22,921 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 21:30:22,922 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [583283804] [2019-11-23 21:30:22,922 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 21:30:22,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 21:30:23,364 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 23 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 21:30:23,364 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [583283804] [2019-11-23 21:30:23,364 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1705177386] [2019-11-23 21:30:23,364 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 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 21:30:23,444 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-11-23 21:30:23,444 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-23 21:30:23,446 INFO L255 TraceCheckSpWp]: Trace formula consists of 176 conjuncts, 79 conjunts are in the unsatisfiable core [2019-11-23 21:30:23,449 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-23 21:30:23,459 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:30:23,459 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 21:30:23,466 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:30:23,466 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-23 21:30:23,466 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:15 [2019-11-23 21:30:23,495 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:30:23,496 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:30:23,496 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 21:30:23,555 INFO L567 ElimStorePlain]: treesize reduction 14, result has 84.3 percent of original size [2019-11-23 21:30:23,563 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 27 treesize of output 15 [2019-11-23 21:30:23,563 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-23 21:30:23,585 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:30:23,589 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 27 treesize of output 15 [2019-11-23 21:30:23,590 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-23 21:30:23,610 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:30:23,611 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-23 21:30:23,611 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:77, output treesize:49 [2019-11-23 21:30:23,709 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 21:30:23,709 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 34 treesize of output 21 [2019-11-23 21:30:23,710 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 21:30:23,738 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:30:23,743 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 21:30:23,744 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 34 treesize of output 21 [2019-11-23 21:30:23,744 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-23 21:30:23,767 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:30:23,768 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-23 21:30:23,768 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:90, output treesize:52 [2019-11-23 21:30:23,815 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:30:23,816 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 26 treesize of output 89 [2019-11-23 21:30:23,816 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 21:30:23,952 WARN L192 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 51 [2019-11-23 21:30:23,952 INFO L567 ElimStorePlain]: treesize reduction 40, result has 80.4 percent of original size [2019-11-23 21:30:23,983 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:30:23,984 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 4 case distinctions, treesize of input 134 treesize of output 115 [2019-11-23 21:30:23,985 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:30:23,985 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:30:23,986 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:30:23,986 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:30:23,987 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:30:23,987 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:30:23,988 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-23 21:30:24,105 WARN L192 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 46 [2019-11-23 21:30:24,105 INFO L567 ElimStorePlain]: treesize reduction 238, result has 33.5 percent of original size [2019-11-23 21:30:24,109 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 21:30:24,110 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 62 treesize of output 32 [2019-11-23 21:30:24,110 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-23 21:30:24,154 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:30:24,154 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-23 21:30:24,154 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:158, output treesize:84 [2019-11-23 21:30:24,213 INFO L392 ElimStorePlain]: Different costs {0=[|v_#memory_int_87|], 12=[|v_#memory_$Pointer$.offset_69|, |v_#memory_$Pointer$.base_81|]} [2019-11-23 21:30:24,217 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 13 treesize of output 9 [2019-11-23 21:30:24,217 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 21:30:24,272 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:30:24,277 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 21:30:24,278 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 21:30:24,279 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 45 treesize of output 35 [2019-11-23 21:30:24,280 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-23 21:30:24,322 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:30:24,327 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 21:30:24,338 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:30:24,338 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 4 new quantified variables, introduced 2 case distinctions, treesize of input 66 treesize of output 63 [2019-11-23 21:30:24,339 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-23 21:30:24,413 INFO L567 ElimStorePlain]: treesize reduction 48, result has 66.0 percent of original size [2019-11-23 21:30:24,413 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-23 21:30:24,413 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:135, output treesize:93 [2019-11-23 21:30:24,500 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 21:30:24,529 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:30:24,529 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 33 treesize of output 49 [2019-11-23 21:30:24,530 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 21:30:24,619 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:30:24,620 INFO L392 ElimStorePlain]: Different costs {2=[|v_#memory_int_88|, |v_#memory_int_86|], 18=[|v_#memory_$Pointer$.offset_70|, |v_#memory_$Pointer$.base_82|]} [2019-11-23 21:30:24,650 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 21:30:24,656 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 81 treesize of output 29 [2019-11-23 21:30:24,657 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-23 21:30:24,732 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:30:24,738 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 29 [2019-11-23 21:30:24,739 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-23 21:30:24,810 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:30:24,816 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 21:30:24,817 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 4 new quantified variables, introduced 0 case distinctions, treesize of input 240 treesize of output 144 [2019-11-23 21:30:24,818 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-11-23 21:30:24,867 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:30:25,018 WARN L192 SmtUtils]: Spent 142.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 50 [2019-11-23 21:30:25,018 INFO L343 Elim1Store]: treesize reduction 19, result has 85.6 percent of original size [2019-11-23 21:30:25,019 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 5 new quantified variables, introduced 7 case distinctions, treesize of input 164 treesize of output 166 [2019-11-23 21:30:25,020 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:30:25,020 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:30:25,021 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:30:25,021 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:30:25,022 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:30:25,022 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:30:25,023 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:30:25,024 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:30:25,024 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:30:25,025 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:30:25,025 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:30:25,026 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:30:25,026 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:30:25,027 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:30:25,028 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:30:25,029 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:30:25,030 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:30:25,030 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:30:25,031 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:30:25,032 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:30:25,032 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:30:25,033 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:30:25,034 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:30:25,034 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:30:25,035 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:30:25,035 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:30:25,036 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:30:25,037 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:30:25,037 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:30:25,038 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:30:25,038 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:30:25,039 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:30:25,040 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:30:25,041 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:30:25,042 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:30:25,042 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:30:25,043 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:30:25,043 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:30:25,044 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:30:25,044 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:30:25,045 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:30:25,046 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:30:25,047 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:30:25,047 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:30:25,049 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:30:25,049 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:30:25,049 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:30:25,050 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:30:25,050 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:30:25,051 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:30:25,051 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:30:25,052 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:30:25,052 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:30:25,053 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:30:25,054 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:30:25,055 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:30:25,055 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:30:25,055 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:30:25,056 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:30:25,056 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:30:25,057 INFO L496 ElimStorePlain]: Start of recursive call 6: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-11-23 21:30:25,179 WARN L192 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 50 [2019-11-23 21:30:25,179 INFO L567 ElimStorePlain]: treesize reduction 99, result has 45.3 percent of original size [2019-11-23 21:30:25,180 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, 4 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-23 21:30:25,180 INFO L221 ElimStorePlain]: Needed 6 recursive calls to eliminate 6 variables, input treesize:376, output treesize:93 [2019-11-23 21:30:25,240 INFO L392 ElimStorePlain]: Different costs {2=[|v_#memory_int_89|], 12=[|v_#memory_$Pointer$.offset_71|], 19=[|v_#memory_$Pointer$.base_83|]} [2019-11-23 21:30:25,245 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 53 treesize of output 40 [2019-11-23 21:30:25,246 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 21:30:25,292 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:30:25,299 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 21:30:25,300 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 21:30:25,301 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 93 treesize of output 47 [2019-11-23 21:30:25,302 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-23 21:30:25,342 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:30:25,517 WARN L192 SmtUtils]: Spent 171.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 63 [2019-11-23 21:30:25,518 INFO L343 Elim1Store]: treesize reduction 62, result has 71.4 percent of original size [2019-11-23 21:30:25,518 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 7 new quantified variables, introduced 10 case distinctions, treesize of input 201 treesize of output 224 [2019-11-23 21:30:25,520 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:30:25,520 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:30:25,521 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:30:25,522 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:30:25,523 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:30:25,523 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:30:25,524 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:30:25,524 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:30:25,525 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:30:25,525 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:30:25,525 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:30:25,526 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:30:25,526 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:30:25,527 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:30:25,527 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:30:25,528 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:30:25,528 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:30:25,529 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:30:25,529 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:30:25,529 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:30:25,530 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:30:25,530 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:30:25,531 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:30:25,531 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:30:25,532 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:30:25,532 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:30:25,533 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:30:25,533 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:30:25,534 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:30:25,534 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:30:25,534 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:30:25,535 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:30:25,535 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:30:25,536 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:30:25,536 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:30:25,537 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:30:25,537 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:30:25,538 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:30:25,538 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:30:25,539 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:30:25,539 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:30:25,540 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:30:25,540 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:30:25,542 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 7 xjuncts. [2019-11-23 21:30:25,800 WARN L192 SmtUtils]: Spent 257.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 46 [2019-11-23 21:30:25,801 INFO L567 ElimStorePlain]: treesize reduction 6371, result has 2.4 percent of original size [2019-11-23 21:30:25,801 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 21:30:25,801 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:285, output treesize:159 [2019-11-23 21:30:26,043 INFO L392 ElimStorePlain]: Different costs {11=[|#memory_$Pointer$.offset|], 17=[|#memory_$Pointer$.base|]} [2019-11-23 21:30:26,048 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 21:30:26,054 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:30:26,054 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 1 case distinctions, treesize of input 68 treesize of output 35 [2019-11-23 21:30:26,055 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 21:30:26,074 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:30:26,112 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:30:26,112 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 7 new quantified variables, introduced 6 case distinctions, treesize of input 127 treesize of output 104 [2019-11-23 21:30:26,114 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:30:26,115 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:30:26,115 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:30:26,115 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:30:26,115 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:30:26,116 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:30:26,116 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:30:26,117 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:30:26,117 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:30:26,117 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:30:26,118 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:30:26,118 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:30:26,119 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:30:26,119 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:30:26,119 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:30:26,121 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:30:26,121 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:30:26,121 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:30:26,121 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:30:26,123 INFO L496 ElimStorePlain]: Start of recursive call 3: 13 dim-0 vars, End of recursive call: 13 dim-0 vars, and 1 xjuncts. [2019-11-23 21:30:26,558 WARN L192 SmtUtils]: Spent 434.00 ms on a formula simplification. DAG size of input: 165 DAG size of output: 158 [2019-11-23 21:30:26,559 INFO L567 ElimStorePlain]: treesize reduction 150, result has 69.1 percent of original size [2019-11-23 21:30:26,560 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:30:26,561 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:30:26,561 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:30:26,562 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:30:26,563 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:30:26,564 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:30:26,565 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:30:26,566 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 27 dim-0 vars, and 1 xjuncts. [2019-11-23 21:30:26,566 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:183, output treesize:262 [2019-11-23 21:30:26,758 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 24 treesize of output 10 [2019-11-23 21:30:26,758 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 21:30:26,772 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:30:26,773 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:30:26,773 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:28, output treesize:3 [2019-11-23 21:30:26,793 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 23 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 21:30:26,793 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-23 21:30:26,793 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 24 [2019-11-23 21:30:26,793 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1163142223] [2019-11-23 21:30:26,794 INFO L442 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-11-23 21:30:26,794 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 21:30:26,794 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-11-23 21:30:26,794 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=479, Unknown=0, NotChecked=0, Total=552 [2019-11-23 21:30:26,795 INFO L87 Difference]: Start difference. First operand 198 states and 240 transitions. Second operand 24 states. [2019-11-23 21:30:28,940 WARN L192 SmtUtils]: Spent 152.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 91 [2019-11-23 21:30:30,848 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 21:30:30,848 INFO L93 Difference]: Finished difference Result 350 states and 422 transitions. [2019-11-23 21:30:30,849 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2019-11-23 21:30:30,849 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 35 [2019-11-23 21:30:30,849 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 21:30:30,850 INFO L225 Difference]: With dead ends: 350 [2019-11-23 21:30:30,850 INFO L226 Difference]: Without dead ends: 348 [2019-11-23 21:30:30,851 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 25 SyntacticMatches, 1 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 576 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=222, Invalid=1940, Unknown=0, NotChecked=0, Total=2162 [2019-11-23 21:30:30,852 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 348 states. [2019-11-23 21:30:30,872 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 348 to 215. [2019-11-23 21:30:30,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 215 states. [2019-11-23 21:30:30,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 215 states to 215 states and 261 transitions. [2019-11-23 21:30:30,873 INFO L78 Accepts]: Start accepts. Automaton has 215 states and 261 transitions. Word has length 35 [2019-11-23 21:30:30,873 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 21:30:30,873 INFO L462 AbstractCegarLoop]: Abstraction has 215 states and 261 transitions. [2019-11-23 21:30:30,873 INFO L463 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-11-23 21:30:30,873 INFO L276 IsEmpty]: Start isEmpty. Operand 215 states and 261 transitions. [2019-11-23 21:30:30,874 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-11-23 21:30:30,874 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 21:30:30,874 INFO L410 BasicCegarLoop]: trace histogram [4, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 21:30:31,074 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 21:30:31,075 INFO L410 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 21:30:31,075 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 21:30:31,076 INFO L82 PathProgramCache]: Analyzing trace with hash 1051861136, now seen corresponding path program 1 times [2019-11-23 21:30:31,076 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 21:30:31,076 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1500995024] [2019-11-23 21:30:31,077 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 21:30:31,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 21:30:31,487 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 21:30:31,488 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1500995024] [2019-11-23 21:30:31,488 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1778906928] [2019-11-23 21:30:31,488 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 21:30:31,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 21:30:31,568 INFO L255 TraceCheckSpWp]: Trace formula consists of 182 conjuncts, 71 conjunts are in the unsatisfiable core [2019-11-23 21:30:31,570 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-23 21:30:31,573 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:30:31,574 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 21:30:31,580 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:30:31,580 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-23 21:30:31,581 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:15 [2019-11-23 21:30:31,606 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:30:31,606 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:30:31,607 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 21:30:31,664 INFO L567 ElimStorePlain]: treesize reduction 14, result has 84.3 percent of original size [2019-11-23 21:30:31,670 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 27 treesize of output 15 [2019-11-23 21:30:31,671 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-23 21:30:31,693 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:30:31,697 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 27 treesize of output 15 [2019-11-23 21:30:31,698 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-23 21:30:31,718 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:30:31,718 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-23 21:30:31,718 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:77, output treesize:49 [2019-11-23 21:30:31,758 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 21:30:31,759 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 34 treesize of output 21 [2019-11-23 21:30:31,759 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 21:30:31,785 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:30:31,789 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 21:30:31,790 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 34 treesize of output 21 [2019-11-23 21:30:31,791 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-23 21:30:31,810 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:30:31,811 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-23 21:30:31,811 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:87, output treesize:49 [2019-11-23 21:30:31,858 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:30:31,858 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 26 treesize of output 89 [2019-11-23 21:30:31,859 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 21:30:31,991 WARN L192 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 49 [2019-11-23 21:30:31,992 INFO L567 ElimStorePlain]: treesize reduction 40, result has 80.1 percent of original size [2019-11-23 21:30:32,023 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:30:32,023 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 4 case distinctions, treesize of input 134 treesize of output 115 [2019-11-23 21:30:32,024 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:30:32,025 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:30:32,025 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:30:32,025 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:30:32,025 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:30:32,026 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-23 21:30:32,122 INFO L567 ElimStorePlain]: treesize reduction 160, result has 42.2 percent of original size [2019-11-23 21:30:32,125 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 21:30:32,126 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 62 treesize of output 32 [2019-11-23 21:30:32,126 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-23 21:30:32,152 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:30:32,152 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-23 21:30:32,153 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:155, output treesize:81 [2019-11-23 21:30:32,207 INFO L392 ElimStorePlain]: Different costs {0=[|v_#memory_int_91|], 12=[|v_#memory_$Pointer$.offset_75|, |v_#memory_$Pointer$.base_87|]} [2019-11-23 21:30:32,211 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 13 treesize of output 9 [2019-11-23 21:30:32,211 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 21:30:32,254 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:30:32,259 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 21:30:32,261 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 21:30:32,262 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 45 treesize of output 35 [2019-11-23 21:30:32,263 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-23 21:30:32,303 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:30:32,317 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 21:30:32,326 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:30:32,327 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 4 new quantified variables, introduced 2 case distinctions, treesize of input 66 treesize of output 63 [2019-11-23 21:30:32,328 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-23 21:30:32,405 INFO L567 ElimStorePlain]: treesize reduction 28, result has 76.3 percent of original size [2019-11-23 21:30:32,406 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-23 21:30:32,406 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:132, output treesize:90 [2019-11-23 21:30:32,481 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 21:30:32,512 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:30:32,513 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 33 treesize of output 49 [2019-11-23 21:30:32,513 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 21:30:32,591 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:30:32,592 INFO L392 ElimStorePlain]: Different costs {0=[|v_#memory_int_92|], 2=[|v_#memory_int_90|], 15=[|v_#memory_$Pointer$.offset_76|, |v_#memory_$Pointer$.base_88|]} [2019-11-23 21:30:32,603 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 55 treesize of output 19 [2019-11-23 21:30:32,603 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-23 21:30:32,673 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:30:32,679 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 19 [2019-11-23 21:30:32,680 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-23 21:30:32,731 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:30:32,735 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 21:30:32,736 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 93 treesize of output 50 [2019-11-23 21:30:32,737 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-11-23 21:30:32,780 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:30:32,918 WARN L192 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 50 [2019-11-23 21:30:32,919 INFO L343 Elim1Store]: treesize reduction 19, result has 85.6 percent of original size [2019-11-23 21:30:32,920 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 5 new quantified variables, introduced 7 case distinctions, treesize of input 164 treesize of output 166 [2019-11-23 21:30:32,921 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:30:32,921 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:30:32,922 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:30:32,923 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:30:32,923 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:30:32,924 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:30:32,924 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:30:32,925 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:30:32,925 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:30:32,926 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:30:32,926 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:30:32,926 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:30:32,927 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:30:32,927 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:30:32,928 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:30:32,928 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:30:32,928 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:30:32,928 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:30:32,929 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:30:32,929 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:30:32,930 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:30:32,930 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:30:32,930 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:30:32,931 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:30:32,931 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:30:32,932 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:30:32,932 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:30:32,932 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:30:32,932 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:30:32,933 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:30:32,933 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:30:32,934 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:30:32,934 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:30:32,934 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:30:32,935 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:30:32,935 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:30:32,935 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:30:32,936 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:30:32,936 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:30:32,937 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:30:32,937 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:30:32,937 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:30:32,938 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:30:32,939 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:30:32,939 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:30:32,940 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:30:32,940 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:30:32,941 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:30:32,942 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:30:32,942 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:30:32,942 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:30:32,943 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:30:32,944 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:30:32,944 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:30:32,944 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:30:32,945 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:30:32,945 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:30:32,947 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:30:32,947 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:30:32,948 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:30:32,948 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:30:32,949 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:30:32,949 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:30:32,950 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:30:32,950 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:30:32,951 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:30:32,951 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:30:32,953 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:30:32,953 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:30:32,953 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:30:32,954 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:30:32,954 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:30:32,955 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:30:32,955 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:30:32,956 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:30:32,956 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:30:32,957 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:30:32,958 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:30:32,958 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:30:32,959 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:30:32,959 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:30:32,959 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:30:32,961 INFO L496 ElimStorePlain]: Start of recursive call 6: 3 dim-0 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-11-23 21:30:33,289 WARN L192 SmtUtils]: Spent 326.00 ms on a formula simplification. DAG size of input: 114 DAG size of output: 78 [2019-11-23 21:30:33,289 INFO L567 ElimStorePlain]: treesize reduction 321, result has 39.4 percent of original size [2019-11-23 21:30:33,290 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, 4 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-23 21:30:33,291 INFO L221 ElimStorePlain]: Needed 6 recursive calls to eliminate 6 variables, input treesize:299, output treesize:235 [2019-11-23 21:30:33,384 INFO L392 ElimStorePlain]: Different costs {2=[|v_#memory_int_93|], 12=[|v_#memory_$Pointer$.offset_77|], 19=[|v_#memory_$Pointer$.base_89|]} [2019-11-23 21:30:33,389 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 53 treesize of output 40 [2019-11-23 21:30:33,390 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 21:30:33,430 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:30:33,437 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 21:30:33,438 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 21:30:33,439 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 93 treesize of output 47 [2019-11-23 21:30:33,440 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-23 21:30:33,478 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:30:33,655 WARN L192 SmtUtils]: Spent 171.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 63 [2019-11-23 21:30:33,655 INFO L343 Elim1Store]: treesize reduction 62, result has 71.4 percent of original size [2019-11-23 21:30:33,656 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 7 new quantified variables, introduced 10 case distinctions, treesize of input 201 treesize of output 224 [2019-11-23 21:30:33,657 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:30:33,659 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:30:33,660 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:30:33,661 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:30:33,661 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:30:33,662 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:30:33,663 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:30:33,664 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:30:33,664 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:30:33,665 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:30:33,666 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:30:33,667 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:30:33,667 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:30:33,669 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 3 xjuncts. [2019-11-23 21:30:33,780 WARN L192 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 43 [2019-11-23 21:30:33,781 INFO L567 ElimStorePlain]: treesize reduction 753, result has 17.2 percent of original size [2019-11-23 21:30:33,782 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 21:30:33,782 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:282, output treesize:156 [2019-11-23 21:30:33,938 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:30:33,948 INFO L392 ElimStorePlain]: Different costs {6=[|#memory_int|], 17=[|#memory_$Pointer$.base|]} [2019-11-23 21:30:33,954 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 21:30:33,954 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-23 21:30:33,955 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-23 21:30:33,958 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-23 21:30:33,959 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 185 treesize of output 138 [2019-11-23 21:30:33,960 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 21:30:33,965 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 21:30:33,966 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-23 21:30:33,967 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-23 21:30:33,968 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 187 treesize of output 1 [2019-11-23 21:30:33,969 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-23 21:30:33,993 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:30:34,024 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:30:34,025 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 7 new quantified variables, introduced 6 case distinctions, treesize of input 117 treesize of output 102 [2019-11-23 21:30:34,025 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:30:34,026 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:30:34,026 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:30:34,026 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:30:34,027 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:30:34,027 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:30:34,027 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:30:34,028 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:30:34,028 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:30:34,028 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:30:34,029 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:30:34,029 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:30:34,029 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:30:34,030 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:30:34,030 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:30:34,030 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:30:34,031 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:30:34,031 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:30:34,032 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:30:34,033 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:30:34,034 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:30:34,034 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:30:34,035 INFO L496 ElimStorePlain]: Start of recursive call 4: 13 dim-0 vars, End of recursive call: 13 dim-0 vars, and 1 xjuncts. [2019-11-23 21:30:34,473 WARN L192 SmtUtils]: Spent 436.00 ms on a formula simplification. DAG size of input: 158 DAG size of output: 150 [2019-11-23 21:30:34,473 INFO L567 ElimStorePlain]: treesize reduction 90, result has 79.1 percent of original size [2019-11-23 21:30:34,474 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 7 terms [2019-11-23 21:30:34,475 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 6 terms [2019-11-23 21:30:34,477 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:30:34,478 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 15 dim-0 vars, and 1 xjuncts. [2019-11-23 21:30:34,479 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:373, output treesize:340 [2019-11-23 21:30:34,479 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 7 terms [2019-11-23 21:30:34,479 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 6 terms [2019-11-23 21:30:34,482 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:30:34,601 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 21:30:34,602 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-23 21:30:34,602 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11] total 20 [2019-11-23 21:30:34,602 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [95574211] [2019-11-23 21:30:34,602 INFO L442 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-11-23 21:30:34,602 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 21:30:34,602 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-11-23 21:30:34,603 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=326, Unknown=0, NotChecked=0, Total=380 [2019-11-23 21:30:34,603 INFO L87 Difference]: Start difference. First operand 215 states and 261 transitions. Second operand 20 states. [2019-11-23 21:30:35,877 WARN L192 SmtUtils]: Spent 155.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 96 [2019-11-23 21:30:47,150 WARN L194 Executor]: External (z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000) stderr output: (error "out of memory") [2019-11-23 21:30:47,151 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-11-23 21:30:47,351 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 21:30:47,352 FATAL L? ?]: An unrecoverable error occured during an interaction with an SMT solver: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: External (z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000)Received EOF on stdin. stderr output: (error "out of memory") at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:208) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parseCheckSatResult(Executor.java:225) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Scriptor.checkSat(Scriptor.java:153) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.checkSat(WrapperScript.java:163) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.checkSat(WrapperScript.java:163) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.checkSat(WrapperScript.java:163) at de.uni_freiburg.informatik.ultimate.logic.Util.checkSat(Util.java:61) at de.uni_freiburg.informatik.ultimate.logic.simplification.SimplifyDDA.getRedundancy(SimplifyDDA.java:621) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.SimplifyDDAWithTimeout.getRedundancy(SimplifyDDAWithTimeout.java:118) at de.uni_freiburg.informatik.ultimate.logic.simplification.SimplifyDDA$Simplifier.walk(SimplifyDDA.java:371) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive.run(NonRecursive.java:115) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive.run(NonRecursive.java:106) at de.uni_freiburg.informatik.ultimate.logic.simplification.SimplifyDDA.simplifyOnce(SimplifyDDA.java:650) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.SimplifyDDAWithTimeout.getSimplifiedTerm(SimplifyDDAWithTimeout.java:178) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.SmtUtils.simplify(SmtUtils.java:163) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.SmtUtils.simplify(SmtUtils.java:133) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate(PredicateUnifier.java:360) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicateForConjunction(PredicateUnifier.java:388) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicateForConjunction(PredicateUnifier.java:229) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.DeterministicInterpolantAutomaton.getOrConstructPredicate(DeterministicInterpolantAutomaton.java:281) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.DeterministicInterpolantAutomaton.constructSuccessorsAndTransitions(DeterministicInterpolantAutomaton.java:303) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.BasicAbstractInterpolantAutomaton.computeSuccs(BasicAbstractInterpolantAutomaton.java:78) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.BasicAbstractInterpolantAutomaton.computeSuccs(BasicAbstractInterpolantAutomaton.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.AbstractInterpolantAutomaton.internalSuccessors(AbstractInterpolantAutomaton.java:234) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.AbstractInterpolantAutomaton.internalSuccessors(AbstractInterpolantAutomaton.java:1) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.TotalizeNwa.internalSuccessors(TotalizeNwa.java:213) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.ComplementDeterministicNwa.internalSuccessors(ComplementDeterministicNwa.java:121) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.ProductNwa.internalSuccessors(ProductNwa.java:216) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.ProductNwa.internalSuccessors(ProductNwa.java:208) at de.uni_freiburg.informatik.ultimate.automata.nestedword.reachablestates.NestedWordAutomatonReachableStates$ReachableStatesComputation.addInternalsAndSuccessors(NestedWordAutomatonReachableStates.java:1066) at de.uni_freiburg.informatik.ultimate.automata.nestedword.reachablestates.NestedWordAutomatonReachableStates$ReachableStatesComputation.(NestedWordAutomatonReachableStates.java:968) at de.uni_freiburg.informatik.ultimate.automata.nestedword.reachablestates.NestedWordAutomatonReachableStates.(NestedWordAutomatonReachableStates.java:188) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.Difference.computeDifference(Difference.java:137) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.Difference.(Difference.java:90) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.computeAutomataDifference(BasicCegarLoop.java:698) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.refineAbstraction(BasicCegarLoop.java:627) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:454) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:368) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterate(TraceAbstractionStarter.java:333) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:171) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:123) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:120) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:316) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) Caused by: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: EOF at de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser$Action$.CUP$do_action(Parser.java:1461) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser.do_action(Parser.java:654) at com.github.jhoenicke.javacup.runtime.LRParser.parse(LRParser.java:419) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:205) ... 51 more [2019-11-23 21:30:47,358 INFO L168 Benchmark]: Toolchain (without parser) took 90108.45 ms. Allocated memory was 145.8 MB in the beginning and 480.8 MB in the end (delta: 335.0 MB). Free memory was 102.3 MB in the beginning and 262.8 MB in the end (delta: -160.5 MB). Peak memory consumption was 174.5 MB. Max. memory is 7.1 GB. [2019-11-23 21:30:47,359 INFO L168 Benchmark]: CDTParser took 0.57 ms. Allocated memory is still 145.8 MB. Free memory was 122.1 MB in the beginning and 121.9 MB in the end (delta: 209.9 kB). Peak memory consumption was 209.9 kB. Max. memory is 7.1 GB. [2019-11-23 21:30:47,359 INFO L168 Benchmark]: CACSL2BoogieTranslator took 621.69 ms. Allocated memory was 145.8 MB in the beginning and 203.4 MB in the end (delta: 57.7 MB). Free memory was 102.1 MB in the beginning and 170.2 MB in the end (delta: -68.0 MB). Peak memory consumption was 22.5 MB. Max. memory is 7.1 GB. [2019-11-23 21:30:47,359 INFO L168 Benchmark]: Boogie Procedure Inliner took 59.90 ms. Allocated memory is still 203.4 MB. Free memory was 170.2 MB in the beginning and 167.5 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. [2019-11-23 21:30:47,359 INFO L168 Benchmark]: Boogie Preprocessor took 39.41 ms. Allocated memory is still 203.4 MB. Free memory was 167.5 MB in the beginning and 165.5 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. [2019-11-23 21:30:47,359 INFO L168 Benchmark]: RCFGBuilder took 603.05 ms. Allocated memory is still 203.4 MB. Free memory was 165.5 MB in the beginning and 135.9 MB in the end (delta: 29.6 MB). Peak memory consumption was 29.6 MB. Max. memory is 7.1 GB. [2019-11-23 21:30:47,360 INFO L168 Benchmark]: TraceAbstraction took 88779.71 ms. Allocated memory was 203.4 MB in the beginning and 480.8 MB in the end (delta: 277.3 MB). Free memory was 135.2 MB in the beginning and 262.8 MB in the end (delta: -127.6 MB). Peak memory consumption was 149.7 MB. Max. memory is 7.1 GB. [2019-11-23 21:30:47,361 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.57 ms. Allocated memory is still 145.8 MB. Free memory was 122.1 MB in the beginning and 121.9 MB in the end (delta: 209.9 kB). Peak memory consumption was 209.9 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 621.69 ms. Allocated memory was 145.8 MB in the beginning and 203.4 MB in the end (delta: 57.7 MB). Free memory was 102.1 MB in the beginning and 170.2 MB in the end (delta: -68.0 MB). Peak memory consumption was 22.5 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 59.90 ms. Allocated memory is still 203.4 MB. Free memory was 170.2 MB in the beginning and 167.5 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 39.41 ms. Allocated memory is still 203.4 MB. Free memory was 167.5 MB in the beginning and 165.5 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. * RCFGBuilder took 603.05 ms. Allocated memory is still 203.4 MB. Free memory was 165.5 MB in the beginning and 135.9 MB in the end (delta: 29.6 MB). Peak memory consumption was 29.6 MB. Max. memory is 7.1 GB. * TraceAbstraction took 88779.71 ms. Allocated memory was 203.4 MB in the beginning and 480.8 MB in the end (delta: 277.3 MB). Free memory was 135.2 MB in the beginning and 262.8 MB in the end (delta: -127.6 MB). Peak memory consumption was 149.7 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: SMTLIBException: External (z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000)Received EOF on stdin. stderr output: (error "out of memory") de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: SMTLIBException: External (z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000)Received EOF on stdin. stderr output: (error "out of memory") : de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:208) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request...