java -Xmx8000000000 -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data --traceabstraction.dump.automata.to.the.following.directory dump --rcfgbuilder.size.of.a.code.block SingleStatement --cacsl2boogietranslator.bitprecise.bitfields false -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/memsafety/test-memleak_nexttime_true-valid-memsafety_true-termination.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-c5b1954-m [2018-10-10 14:45:21,644 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-10 14:45:21,646 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-10 14:45:21,670 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-10 14:45:21,670 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-10 14:45:21,671 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-10 14:45:21,675 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-10 14:45:21,676 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-10 14:45:21,678 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-10 14:45:21,679 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-10 14:45:21,680 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-10 14:45:21,680 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-10 14:45:21,681 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-10 14:45:21,682 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-10 14:45:21,684 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-10 14:45:21,684 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-10 14:45:21,685 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-10 14:45:21,687 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-10 14:45:21,689 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-10 14:45:21,691 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-10 14:45:21,692 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-10 14:45:21,694 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-10 14:45:21,696 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-10 14:45:21,696 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-10 14:45:21,697 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-10 14:45:21,698 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-10 14:45:21,699 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-10 14:45:21,700 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-10 14:45:21,700 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-10 14:45:21,702 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-10 14:45:21,702 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-10 14:45:21,703 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-10 14:45:21,703 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-10 14:45:21,703 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-10 14:45:21,704 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-10 14:45:21,705 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-10 14:45:21,705 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2018-10-10 14:45:21,733 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-10 14:45:21,734 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-10 14:45:21,738 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-10-10 14:45:21,738 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-10-10 14:45:21,739 INFO L133 SettingsManager]: * Use SBE=true [2018-10-10 14:45:21,739 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-10-10 14:45:21,739 INFO L133 SettingsManager]: * sizeof long=4 [2018-10-10 14:45:21,739 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-10-10 14:45:21,739 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-10-10 14:45:21,740 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-10-10 14:45:21,740 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-10-10 14:45:21,740 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-10-10 14:45:21,741 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-10-10 14:45:21,741 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-10-10 14:45:21,741 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-10-10 14:45:21,741 INFO L133 SettingsManager]: * sizeof long double=12 [2018-10-10 14:45:21,741 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-10 14:45:21,742 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-10-10 14:45:21,742 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-10-10 14:45:21,742 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-10-10 14:45:21,742 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-10-10 14:45:21,742 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-10 14:45:21,743 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-10-10 14:45:21,743 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-10-10 14:45:21,743 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-10-10 14:45:21,743 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Dump automata to the following directory -> dump Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder: Size of a code block -> SingleStatement Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Bitprecise bitfields -> false [2018-10-10 14:45:21,802 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-10 14:45:21,820 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-10 14:45:21,823 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-10 14:45:21,825 INFO L271 PluginConnector]: Initializing CDTParser... [2018-10-10 14:45:21,825 INFO L276 PluginConnector]: CDTParser initialized [2018-10-10 14:45:21,826 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/memsafety/test-memleak_nexttime_true-valid-memsafety_true-termination.i [2018-10-10 14:45:22,140 INFO L217 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/939f55b03/fe1e103d2fe54bc8854e5706f0f6514a/FLAGbd881b718 [2018-10-10 14:45:22,469 INFO L289 CDTParser]: Found 1 translation units. [2018-10-10 14:45:22,471 INFO L157 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/memsafety/test-memleak_nexttime_true-valid-memsafety_true-termination.i [2018-10-10 14:45:22,491 INFO L337 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/939f55b03/fe1e103d2fe54bc8854e5706f0f6514a/FLAGbd881b718 [2018-10-10 14:45:22,508 INFO L345 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/939f55b03/fe1e103d2fe54bc8854e5706f0f6514a [2018-10-10 14:45:22,518 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-10 14:45:22,519 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-10-10 14:45:22,520 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-10-10 14:45:22,521 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-10-10 14:45:22,525 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-10-10 14:45:22,526 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.10 02:45:22" (1/1) ... [2018-10-10 14:45:22,529 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@65e6d644 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 02:45:22, skipping insertion in model container [2018-10-10 14:45:22,529 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.10 02:45:22" (1/1) ... [2018-10-10 14:45:22,540 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-10-10 14:45:22,590 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-10-10 14:45:22,832 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-10 14:45:22,841 INFO L189 MainTranslator]: Completed pre-run [2018-10-10 14:45:22,913 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-10 14:45:23,007 INFO L193 MainTranslator]: Completed translation [2018-10-10 14:45:23,007 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 02:45:23 WrapperNode [2018-10-10 14:45:23,008 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-10-10 14:45:23,009 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-10-10 14:45:23,009 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-10-10 14:45:23,009 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-10-10 14:45:23,018 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 02:45:23" (1/1) ... [2018-10-10 14:45:23,039 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 02:45:23" (1/1) ... [2018-10-10 14:45:23,068 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-10-10 14:45:23,069 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-10 14:45:23,069 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-10 14:45:23,069 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-10 14:45:23,080 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 02:45:23" (1/1) ... [2018-10-10 14:45:23,080 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 02:45:23" (1/1) ... [2018-10-10 14:45:23,086 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 02:45:23" (1/1) ... [2018-10-10 14:45:23,086 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 02:45:23" (1/1) ... [2018-10-10 14:45:23,094 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 02:45:23" (1/1) ... [2018-10-10 14:45:23,099 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 02:45:23" (1/1) ... [2018-10-10 14:45:23,102 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 02:45:23" (1/1) ... [2018-10-10 14:45:23,105 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-10 14:45:23,109 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-10 14:45:23,109 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-10 14:45:23,109 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-10 14:45:23,110 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 02:45:23" (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 [2018-10-10 14:45:23,242 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-10-10 14:45:23,242 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-10-10 14:45:24,225 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-10-10 14:45:24,226 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.10 02:45:24 BoogieIcfgContainer [2018-10-10 14:45:24,226 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-10 14:45:24,227 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-10-10 14:45:24,227 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-10-10 14:45:24,230 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-10-10 14:45:24,231 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.10 02:45:22" (1/3) ... [2018-10-10 14:45:24,232 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@22a52f01 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.10 02:45:24, skipping insertion in model container [2018-10-10 14:45:24,232 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 02:45:23" (2/3) ... [2018-10-10 14:45:24,232 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@22a52f01 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.10 02:45:24, skipping insertion in model container [2018-10-10 14:45:24,232 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.10 02:45:24" (3/3) ... [2018-10-10 14:45:24,234 INFO L112 eAbstractionObserver]: Analyzing ICFG test-memleak_nexttime_true-valid-memsafety_true-termination.i [2018-10-10 14:45:24,244 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-10-10 14:45:24,253 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 15 error locations. [2018-10-10 14:45:24,270 INFO L257 AbstractCegarLoop]: Starting to check reachability of 15 error locations. [2018-10-10 14:45:24,299 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-10-10 14:45:24,300 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-10-10 14:45:24,300 INFO L383 AbstractCegarLoop]: Hoare is false [2018-10-10 14:45:24,300 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-10-10 14:45:24,300 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-10-10 14:45:24,301 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-10-10 14:45:24,301 INFO L387 AbstractCegarLoop]: Difference is false [2018-10-10 14:45:24,301 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-10-10 14:45:24,301 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-10-10 14:45:24,325 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states. [2018-10-10 14:45:24,335 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2018-10-10 14:45:24,336 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 14:45:24,337 INFO L375 BasicCegarLoop]: trace histogram [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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 14:45:24,340 INFO L424 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-10-10 14:45:24,346 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 14:45:24,346 INFO L82 PathProgramCache]: Analyzing trace with hash 1319572679, now seen corresponding path program 1 times [2018-10-10 14:45:24,348 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-10 14:45:24,349 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-10 14:45:24,398 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:45:24,399 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-10 14:45:24,399 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:45:24,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 14:45:24,788 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 14:45:24,791 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-10 14:45:24,791 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-10-10 14:45:24,796 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-10-10 14:45:24,812 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-10-10 14:45:24,813 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-10-10 14:45:24,816 INFO L87 Difference]: Start difference. First operand 189 states. Second operand 7 states. [2018-10-10 14:45:25,396 WARN L178 SmtUtils]: Spent 117.00 ms on a formula simplification that was a NOOP. DAG size: 15 [2018-10-10 14:45:25,873 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 14:45:25,873 INFO L93 Difference]: Finished difference Result 188 states and 189 transitions. [2018-10-10 14:45:25,874 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-10-10 14:45:25,875 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 74 [2018-10-10 14:45:25,876 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 14:45:25,890 INFO L225 Difference]: With dead ends: 188 [2018-10-10 14:45:25,890 INFO L226 Difference]: Without dead ends: 183 [2018-10-10 14:45:25,892 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2018-10-10 14:45:25,911 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 183 states. [2018-10-10 14:45:25,940 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 183 to 183. [2018-10-10 14:45:25,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 183 states. [2018-10-10 14:45:25,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 183 states to 183 states and 184 transitions. [2018-10-10 14:45:25,946 INFO L78 Accepts]: Start accepts. Automaton has 183 states and 184 transitions. Word has length 74 [2018-10-10 14:45:25,947 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 14:45:25,947 INFO L481 AbstractCegarLoop]: Abstraction has 183 states and 184 transitions. [2018-10-10 14:45:25,948 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-10-10 14:45:25,948 INFO L276 IsEmpty]: Start isEmpty. Operand 183 states and 184 transitions. [2018-10-10 14:45:25,950 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2018-10-10 14:45:25,951 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 14:45:25,951 INFO L375 BasicCegarLoop]: trace histogram [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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 14:45:25,952 INFO L424 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-10-10 14:45:25,952 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 14:45:25,952 INFO L82 PathProgramCache]: Analyzing trace with hash -2042919804, now seen corresponding path program 1 times [2018-10-10 14:45:25,952 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-10 14:45:25,953 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-10 14:45:25,954 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:45:25,954 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-10 14:45:25,954 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:45:26,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 14:45:26,388 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 14:45:26,388 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-10 14:45:26,389 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-10-10 14:45:26,391 INFO L460 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-10-10 14:45:26,391 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-10-10 14:45:26,391 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2018-10-10 14:45:26,393 INFO L87 Difference]: Start difference. First operand 183 states and 184 transitions. Second operand 11 states. [2018-10-10 14:45:27,553 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 14:45:27,554 INFO L93 Difference]: Finished difference Result 182 states and 183 transitions. [2018-10-10 14:45:27,554 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-10-10 14:45:27,555 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 75 [2018-10-10 14:45:27,556 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 14:45:27,558 INFO L225 Difference]: With dead ends: 182 [2018-10-10 14:45:27,558 INFO L226 Difference]: Without dead ends: 182 [2018-10-10 14:45:27,559 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=132, Invalid=374, Unknown=0, NotChecked=0, Total=506 [2018-10-10 14:45:27,560 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 182 states. [2018-10-10 14:45:27,570 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 182 to 182. [2018-10-10 14:45:27,571 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 182 states. [2018-10-10 14:45:27,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 182 states to 182 states and 183 transitions. [2018-10-10 14:45:27,575 INFO L78 Accepts]: Start accepts. Automaton has 182 states and 183 transitions. Word has length 75 [2018-10-10 14:45:27,576 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 14:45:27,576 INFO L481 AbstractCegarLoop]: Abstraction has 182 states and 183 transitions. [2018-10-10 14:45:27,576 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-10-10 14:45:27,576 INFO L276 IsEmpty]: Start isEmpty. Operand 182 states and 183 transitions. [2018-10-10 14:45:27,579 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2018-10-10 14:45:27,579 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 14:45:27,579 INFO L375 BasicCegarLoop]: trace histogram [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, 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, 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] [2018-10-10 14:45:27,580 INFO L424 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-10-10 14:45:27,580 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 14:45:27,581 INFO L82 PathProgramCache]: Analyzing trace with hash -221458807, now seen corresponding path program 1 times [2018-10-10 14:45:27,581 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-10 14:45:27,581 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-10 14:45:27,582 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:45:27,582 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-10 14:45:27,582 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:45:27,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 14:45:27,813 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 14:45:27,814 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-10 14:45:27,814 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-10-10 14:45:27,815 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-10-10 14:45:27,815 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-10-10 14:45:27,815 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2018-10-10 14:45:27,816 INFO L87 Difference]: Start difference. First operand 182 states and 183 transitions. Second operand 8 states. [2018-10-10 14:45:28,232 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 14:45:28,233 INFO L93 Difference]: Finished difference Result 181 states and 182 transitions. [2018-10-10 14:45:28,233 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-10-10 14:45:28,233 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 83 [2018-10-10 14:45:28,234 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 14:45:28,237 INFO L225 Difference]: With dead ends: 181 [2018-10-10 14:45:28,237 INFO L226 Difference]: Without dead ends: 181 [2018-10-10 14:45:28,237 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 1 SyntacticMatches, 3 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=61, Invalid=121, Unknown=0, NotChecked=0, Total=182 [2018-10-10 14:45:28,238 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 181 states. [2018-10-10 14:45:28,248 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 181 to 181. [2018-10-10 14:45:28,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 181 states. [2018-10-10 14:45:28,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 181 states to 181 states and 182 transitions. [2018-10-10 14:45:28,249 INFO L78 Accepts]: Start accepts. Automaton has 181 states and 182 transitions. Word has length 83 [2018-10-10 14:45:28,250 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 14:45:28,250 INFO L481 AbstractCegarLoop]: Abstraction has 181 states and 182 transitions. [2018-10-10 14:45:28,250 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-10-10 14:45:28,250 INFO L276 IsEmpty]: Start isEmpty. Operand 181 states and 182 transitions. [2018-10-10 14:45:28,252 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2018-10-10 14:45:28,253 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 14:45:28,253 INFO L375 BasicCegarLoop]: trace histogram [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, 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, 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] [2018-10-10 14:45:28,254 INFO L424 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-10-10 14:45:28,254 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 14:45:28,254 INFO L82 PathProgramCache]: Analyzing trace with hash 1724711693, now seen corresponding path program 1 times [2018-10-10 14:45:28,254 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-10 14:45:28,254 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-10 14:45:28,255 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:45:28,256 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-10 14:45:28,256 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:45:28,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 14:45:28,360 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 14:45:28,361 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-10 14:45:28,361 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-10 14:45:28,361 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-10 14:45:28,361 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-10 14:45:28,362 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-10-10 14:45:28,362 INFO L87 Difference]: Start difference. First operand 181 states and 182 transitions. Second operand 5 states. [2018-10-10 14:45:28,524 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 14:45:28,525 INFO L93 Difference]: Finished difference Result 180 states and 181 transitions. [2018-10-10 14:45:28,525 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-10-10 14:45:28,525 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 84 [2018-10-10 14:45:28,526 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 14:45:28,528 INFO L225 Difference]: With dead ends: 180 [2018-10-10 14:45:28,529 INFO L226 Difference]: Without dead ends: 180 [2018-10-10 14:45:28,529 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-10-10 14:45:28,530 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 180 states. [2018-10-10 14:45:28,537 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 180 to 180. [2018-10-10 14:45:28,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 180 states. [2018-10-10 14:45:28,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 180 states to 180 states and 181 transitions. [2018-10-10 14:45:28,538 INFO L78 Accepts]: Start accepts. Automaton has 180 states and 181 transitions. Word has length 84 [2018-10-10 14:45:28,539 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 14:45:28,539 INFO L481 AbstractCegarLoop]: Abstraction has 180 states and 181 transitions. [2018-10-10 14:45:28,539 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-10 14:45:28,539 INFO L276 IsEmpty]: Start isEmpty. Operand 180 states and 181 transitions. [2018-10-10 14:45:28,540 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2018-10-10 14:45:28,541 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 14:45:28,541 INFO L375 BasicCegarLoop]: trace histogram [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, 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, 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] [2018-10-10 14:45:28,542 INFO L424 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-10-10 14:45:28,542 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 14:45:28,542 INFO L82 PathProgramCache]: Analyzing trace with hash 1926455051, now seen corresponding path program 1 times [2018-10-10 14:45:28,542 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-10 14:45:28,542 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-10 14:45:28,543 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:45:28,543 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-10 14:45:28,544 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:45:28,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 14:45:29,249 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 14:45:29,249 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-10 14:45:29,249 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2018-10-10 14:45:29,250 INFO L460 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-10-10 14:45:29,250 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-10-10 14:45:29,250 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=147, Unknown=0, NotChecked=0, Total=182 [2018-10-10 14:45:29,250 INFO L87 Difference]: Start difference. First operand 180 states and 181 transitions. Second operand 14 states. [2018-10-10 14:45:29,422 WARN L178 SmtUtils]: Spent 109.00 ms on a formula simplification that was a NOOP. DAG size: 15 [2018-10-10 14:45:30,959 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 14:45:30,959 INFO L93 Difference]: Finished difference Result 179 states and 180 transitions. [2018-10-10 14:45:30,960 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-10-10 14:45:30,960 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 85 [2018-10-10 14:45:30,961 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 14:45:30,962 INFO L225 Difference]: With dead ends: 179 [2018-10-10 14:45:30,962 INFO L226 Difference]: Without dead ends: 179 [2018-10-10 14:45:30,964 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 286 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=311, Invalid=1021, Unknown=0, NotChecked=0, Total=1332 [2018-10-10 14:45:30,965 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 179 states. [2018-10-10 14:45:30,970 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 179 to 179. [2018-10-10 14:45:30,970 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 179 states. [2018-10-10 14:45:30,971 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 179 states to 179 states and 180 transitions. [2018-10-10 14:45:30,971 INFO L78 Accepts]: Start accepts. Automaton has 179 states and 180 transitions. Word has length 85 [2018-10-10 14:45:30,972 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 14:45:30,972 INFO L481 AbstractCegarLoop]: Abstraction has 179 states and 180 transitions. [2018-10-10 14:45:30,972 INFO L482 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-10-10 14:45:30,972 INFO L276 IsEmpty]: Start isEmpty. Operand 179 states and 180 transitions. [2018-10-10 14:45:30,973 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2018-10-10 14:45:30,974 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 14:45:30,974 INFO L375 BasicCegarLoop]: trace histogram [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, 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, 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] [2018-10-10 14:45:30,975 INFO L424 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-10-10 14:45:30,975 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 14:45:30,975 INFO L82 PathProgramCache]: Analyzing trace with hash -409435441, now seen corresponding path program 1 times [2018-10-10 14:45:30,975 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-10 14:45:30,976 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-10 14:45:30,976 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:45:30,977 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-10 14:45:30,977 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:45:30,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 14:45:31,322 WARN L178 SmtUtils]: Spent 111.00 ms on a formula simplification that was a NOOP. DAG size: 12 [2018-10-10 14:45:31,393 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 14:45:31,394 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-10 14:45:31,394 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-10-10 14:45:31,394 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-10-10 14:45:31,395 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-10-10 14:45:31,395 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2018-10-10 14:45:31,395 INFO L87 Difference]: Start difference. First operand 179 states and 180 transitions. Second operand 8 states. [2018-10-10 14:45:31,617 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 14:45:31,618 INFO L93 Difference]: Finished difference Result 178 states and 179 transitions. [2018-10-10 14:45:31,618 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-10-10 14:45:31,618 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 86 [2018-10-10 14:45:31,618 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 14:45:31,620 INFO L225 Difference]: With dead ends: 178 [2018-10-10 14:45:31,620 INFO L226 Difference]: Without dead ends: 178 [2018-10-10 14:45:31,621 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=52, Invalid=104, Unknown=0, NotChecked=0, Total=156 [2018-10-10 14:45:31,622 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 178 states. [2018-10-10 14:45:31,626 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 178 to 178. [2018-10-10 14:45:31,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 178 states. [2018-10-10 14:45:31,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 178 states to 178 states and 179 transitions. [2018-10-10 14:45:31,627 INFO L78 Accepts]: Start accepts. Automaton has 178 states and 179 transitions. Word has length 86 [2018-10-10 14:45:31,628 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 14:45:31,628 INFO L481 AbstractCegarLoop]: Abstraction has 178 states and 179 transitions. [2018-10-10 14:45:31,628 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-10-10 14:45:31,628 INFO L276 IsEmpty]: Start isEmpty. Operand 178 states and 179 transitions. [2018-10-10 14:45:31,630 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2018-10-10 14:45:31,630 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 14:45:31,631 INFO L375 BasicCegarLoop]: trace histogram [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, 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, 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, 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, 1, 1, 1, 1, 1] [2018-10-10 14:45:31,631 INFO L424 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-10-10 14:45:31,632 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 14:45:31,632 INFO L82 PathProgramCache]: Analyzing trace with hash 1611345279, now seen corresponding path program 1 times [2018-10-10 14:45:31,632 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-10 14:45:31,632 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-10 14:45:31,633 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:45:31,633 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-10 14:45:31,633 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:45:31,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 14:45:31,775 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 14:45:31,776 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-10 14:45:31,776 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-10 14:45:31,777 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-10 14:45:31,777 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-10 14:45:31,777 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-10-10 14:45:31,778 INFO L87 Difference]: Start difference. First operand 178 states and 179 transitions. Second operand 5 states. [2018-10-10 14:45:32,068 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 14:45:32,069 INFO L93 Difference]: Finished difference Result 177 states and 178 transitions. [2018-10-10 14:45:32,069 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-10-10 14:45:32,069 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 121 [2018-10-10 14:45:32,070 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 14:45:32,071 INFO L225 Difference]: With dead ends: 177 [2018-10-10 14:45:32,071 INFO L226 Difference]: Without dead ends: 177 [2018-10-10 14:45:32,072 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2018-10-10 14:45:32,073 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 177 states. [2018-10-10 14:45:32,076 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 177 to 177. [2018-10-10 14:45:32,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 177 states. [2018-10-10 14:45:32,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 177 states to 177 states and 178 transitions. [2018-10-10 14:45:32,079 INFO L78 Accepts]: Start accepts. Automaton has 177 states and 178 transitions. Word has length 121 [2018-10-10 14:45:32,080 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 14:45:32,080 INFO L481 AbstractCegarLoop]: Abstraction has 177 states and 178 transitions. [2018-10-10 14:45:32,080 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-10 14:45:32,080 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 178 transitions. [2018-10-10 14:45:32,082 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2018-10-10 14:45:32,082 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 14:45:32,082 INFO L375 BasicCegarLoop]: trace histogram [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, 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, 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, 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, 1, 1, 1, 1, 1, 1] [2018-10-10 14:45:32,083 INFO L424 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-10-10 14:45:32,083 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 14:45:32,083 INFO L82 PathProgramCache]: Analyzing trace with hash -1587903733, now seen corresponding path program 1 times [2018-10-10 14:45:32,084 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-10 14:45:32,084 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-10 14:45:32,085 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:45:32,085 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-10 14:45:32,085 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:45:32,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 14:45:32,324 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 14:45:32,325 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-10 14:45:32,325 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-10 14:45:32,326 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-10 14:45:32,326 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-10 14:45:32,326 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-10 14:45:32,326 INFO L87 Difference]: Start difference. First operand 177 states and 178 transitions. Second operand 4 states. [2018-10-10 14:45:32,924 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 14:45:32,925 INFO L93 Difference]: Finished difference Result 185 states and 186 transitions. [2018-10-10 14:45:32,925 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-10 14:45:32,925 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 122 [2018-10-10 14:45:32,926 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 14:45:32,927 INFO L225 Difference]: With dead ends: 185 [2018-10-10 14:45:32,927 INFO L226 Difference]: Without dead ends: 185 [2018-10-10 14:45:32,928 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-10 14:45:32,928 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2018-10-10 14:45:32,931 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 179. [2018-10-10 14:45:32,931 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 179 states. [2018-10-10 14:45:32,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 179 states to 179 states and 180 transitions. [2018-10-10 14:45:32,932 INFO L78 Accepts]: Start accepts. Automaton has 179 states and 180 transitions. Word has length 122 [2018-10-10 14:45:32,933 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 14:45:32,933 INFO L481 AbstractCegarLoop]: Abstraction has 179 states and 180 transitions. [2018-10-10 14:45:32,933 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-10 14:45:32,933 INFO L276 IsEmpty]: Start isEmpty. Operand 179 states and 180 transitions. [2018-10-10 14:45:32,935 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2018-10-10 14:45:32,935 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 14:45:32,935 INFO L375 BasicCegarLoop]: trace histogram [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, 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, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 14:45:32,936 INFO L424 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-10-10 14:45:32,943 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 14:45:32,944 INFO L82 PathProgramCache]: Analyzing trace with hash -1903143799, now seen corresponding path program 1 times [2018-10-10 14:45:32,944 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-10 14:45:32,944 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-10 14:45:32,945 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:45:32,945 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-10 14:45:32,945 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:45:32,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 14:45:33,163 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 14:45:33,164 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-10 14:45:33,164 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-10 14:45:33,184 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-10 14:45:33,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 14:45:33,269 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-10 14:45:33,668 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 14:45:33,701 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-10 14:45:33,702 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 7 [2018-10-10 14:45:33,795 WARN L240 PathProgramDumper]: Writing path program to file /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/dump/test-memleak_nexttime_true-valid-memsafety_true-termination.i_9.bpl [2018-10-10 14:45:33,800 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-10-10 14:45:33,800 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-10-10 14:45:33,807 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=22, Unknown=0, NotChecked=0, Total=42 [2018-10-10 14:45:33,807 INFO L87 Difference]: Start difference. First operand 179 states and 180 transitions. Second operand 7 states. [2018-10-10 14:45:33,977 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 14:45:33,978 INFO L93 Difference]: Finished difference Result 193 states and 194 transitions. [2018-10-10 14:45:33,979 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-10-10 14:45:33,979 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 126 [2018-10-10 14:45:33,980 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 14:45:33,982 INFO L225 Difference]: With dead ends: 193 [2018-10-10 14:45:33,982 INFO L226 Difference]: Without dead ends: 193 [2018-10-10 14:45:33,982 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 130 GetRequests, 125 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=20, Invalid=22, Unknown=0, NotChecked=0, Total=42 [2018-10-10 14:45:33,983 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 193 states. [2018-10-10 14:45:33,986 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 193 to 187. [2018-10-10 14:45:33,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 187 states. [2018-10-10 14:45:33,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 187 states to 187 states and 188 transitions. [2018-10-10 14:45:33,987 INFO L78 Accepts]: Start accepts. Automaton has 187 states and 188 transitions. Word has length 126 [2018-10-10 14:45:33,987 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 14:45:33,987 INFO L481 AbstractCegarLoop]: Abstraction has 187 states and 188 transitions. [2018-10-10 14:45:33,988 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-10-10 14:45:33,988 INFO L276 IsEmpty]: Start isEmpty. Operand 187 states and 188 transitions. [2018-10-10 14:45:33,989 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2018-10-10 14:45:33,989 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 14:45:33,989 INFO L375 BasicCegarLoop]: trace histogram [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, 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, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 14:45:33,990 INFO L424 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-10-10 14:45:33,990 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 14:45:33,990 INFO L82 PathProgramCache]: Analyzing trace with hash 1634023175, now seen corresponding path program 2 times [2018-10-10 14:45:33,991 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-10 14:45:33,991 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-10 14:45:33,992 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:45:33,992 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-10 14:45:33,992 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:45:34,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 14:45:34,255 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 14:45:34,255 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-10 14:45:34,255 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-10 14:45:34,263 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-10 14:45:34,321 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2018-10-10 14:45:34,321 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-10 14:45:34,330 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-10 14:45:34,379 INFO L477 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 [2018-10-10 14:45:34,385 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-10 14:45:34,408 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-10 14:45:34,409 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-10-10 14:45:34,529 INFO L700 Elim1Store]: detected not equals via solver [2018-10-10 14:45:34,530 INFO L700 Elim1Store]: detected not equals via solver [2018-10-10 14:45:34,531 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-10-10 14:45:34,532 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-10 14:45:34,546 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-10 14:45:34,546 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:11, output treesize:4 [2018-10-10 14:45:34,657 INFO L700 Elim1Store]: detected not equals via solver [2018-10-10 14:45:34,658 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 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 12 treesize of output 21 [2018-10-10 14:45:34,658 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-10 14:45:34,665 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-10-10 14:45:34,665 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:16, output treesize:11 [2018-10-10 14:45:34,863 INFO L700 Elim1Store]: detected not equals via solver [2018-10-10 14:45:34,887 INFO L700 Elim1Store]: detected not equals via solver [2018-10-10 14:45:34,899 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 24 [2018-10-10 14:45:34,900 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2018-10-10 14:45:34,919 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 2 xjuncts. [2018-10-10 14:45:34,920 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:17, output treesize:32 [2018-10-10 14:45:35,202 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-10-10 14:45:35,234 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-10 14:45:35,234 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [14] imperfect sequences [6] total 19 [2018-10-10 14:45:35,235 INFO L460 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-10-10 14:45:35,236 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-10-10 14:45:35,236 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=295, Unknown=0, NotChecked=0, Total=342 [2018-10-10 14:45:35,236 INFO L87 Difference]: Start difference. First operand 187 states and 188 transitions. Second operand 19 states. [2018-10-10 14:45:36,052 WARN L178 SmtUtils]: Spent 215.00 ms on a formula simplification. DAG size of input: 30 DAG size of output: 22 [2018-10-10 14:45:36,858 WARN L178 SmtUtils]: Spent 231.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 30 [2018-10-10 14:45:38,497 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 14:45:38,497 INFO L93 Difference]: Finished difference Result 200 states and 201 transitions. [2018-10-10 14:45:38,497 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2018-10-10 14:45:38,497 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 130 [2018-10-10 14:45:38,498 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 14:45:38,500 INFO L225 Difference]: With dead ends: 200 [2018-10-10 14:45:38,500 INFO L226 Difference]: Without dead ends: 200 [2018-10-10 14:45:38,502 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 165 GetRequests, 118 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 481 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=556, Invalid=1796, Unknown=0, NotChecked=0, Total=2352 [2018-10-10 14:45:38,502 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 200 states. [2018-10-10 14:45:38,505 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 200 to 194. [2018-10-10 14:45:38,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 194 states. [2018-10-10 14:45:38,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194 states to 194 states and 195 transitions. [2018-10-10 14:45:38,506 INFO L78 Accepts]: Start accepts. Automaton has 194 states and 195 transitions. Word has length 130 [2018-10-10 14:45:38,507 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 14:45:38,507 INFO L481 AbstractCegarLoop]: Abstraction has 194 states and 195 transitions. [2018-10-10 14:45:38,507 INFO L482 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-10-10 14:45:38,507 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 195 transitions. [2018-10-10 14:45:38,508 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2018-10-10 14:45:38,508 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 14:45:38,509 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 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, 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, 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, 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, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 14:45:38,509 INFO L424 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-10-10 14:45:38,510 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 14:45:38,510 INFO L82 PathProgramCache]: Analyzing trace with hash 455911111, now seen corresponding path program 1 times [2018-10-10 14:45:38,510 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-10 14:45:38,510 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-10 14:45:38,511 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:45:38,511 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-10 14:45:38,511 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:45:38,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 14:45:38,667 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 14:45:38,668 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-10 14:45:38,668 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-10 14:45:38,675 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-10 14:45:38,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 14:45:38,725 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-10 14:45:38,818 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 14:45:38,845 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-10 14:45:38,845 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 11 [2018-10-10 14:45:38,869 WARN L240 PathProgramDumper]: Writing path program to file /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/dump/test-memleak_nexttime_true-valid-memsafety_true-termination.i_11.bpl [2018-10-10 14:45:38,871 INFO L460 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-10-10 14:45:38,871 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-10-10 14:45:38,871 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=61, Unknown=0, NotChecked=0, Total=110 [2018-10-10 14:45:38,872 INFO L87 Difference]: Start difference. First operand 194 states and 195 transitions. Second operand 11 states. [2018-10-10 14:45:39,133 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 14:45:39,134 INFO L93 Difference]: Finished difference Result 208 states and 209 transitions. [2018-10-10 14:45:39,136 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-10-10 14:45:39,137 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 135 [2018-10-10 14:45:39,137 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 14:45:39,138 INFO L225 Difference]: With dead ends: 208 [2018-10-10 14:45:39,138 INFO L226 Difference]: Without dead ends: 208 [2018-10-10 14:45:39,139 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 142 GetRequests, 132 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2018-10-10 14:45:39,139 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 208 states. [2018-10-10 14:45:39,142 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 208 to 202. [2018-10-10 14:45:39,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 202 states. [2018-10-10 14:45:39,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 202 states to 202 states and 203 transitions. [2018-10-10 14:45:39,144 INFO L78 Accepts]: Start accepts. Automaton has 202 states and 203 transitions. Word has length 135 [2018-10-10 14:45:39,144 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 14:45:39,144 INFO L481 AbstractCegarLoop]: Abstraction has 202 states and 203 transitions. [2018-10-10 14:45:39,144 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-10-10 14:45:39,144 INFO L276 IsEmpty]: Start isEmpty. Operand 202 states and 203 transitions. [2018-10-10 14:45:39,146 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2018-10-10 14:45:39,146 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 14:45:39,146 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 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, 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, 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, 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, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 14:45:39,147 INFO L424 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-10-10 14:45:39,147 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 14:45:39,147 INFO L82 PathProgramCache]: Analyzing trace with hash 1222357513, now seen corresponding path program 2 times [2018-10-10 14:45:39,147 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-10 14:45:39,148 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-10 14:45:39,148 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:45:39,149 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-10 14:45:39,149 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:45:39,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 14:45:39,412 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2018-10-10 14:45:39,413 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-10 14:45:39,413 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-10-10 14:45:39,413 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-10-10 14:45:39,414 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-10-10 14:45:39,414 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-10-10 14:45:39,414 INFO L87 Difference]: Start difference. First operand 202 states and 203 transitions. Second operand 7 states. [2018-10-10 14:45:39,664 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 14:45:39,665 INFO L93 Difference]: Finished difference Result 201 states and 202 transitions. [2018-10-10 14:45:39,665 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-10-10 14:45:39,665 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 139 [2018-10-10 14:45:39,666 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 14:45:39,667 INFO L225 Difference]: With dead ends: 201 [2018-10-10 14:45:39,667 INFO L226 Difference]: Without dead ends: 201 [2018-10-10 14:45:39,668 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2018-10-10 14:45:39,668 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 201 states. [2018-10-10 14:45:39,671 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 201 to 201. [2018-10-10 14:45:39,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 201 states. [2018-10-10 14:45:39,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 201 states to 201 states and 202 transitions. [2018-10-10 14:45:39,673 INFO L78 Accepts]: Start accepts. Automaton has 201 states and 202 transitions. Word has length 139 [2018-10-10 14:45:39,673 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 14:45:39,673 INFO L481 AbstractCegarLoop]: Abstraction has 201 states and 202 transitions. [2018-10-10 14:45:39,673 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-10-10 14:45:39,674 INFO L276 IsEmpty]: Start isEmpty. Operand 201 states and 202 transitions. [2018-10-10 14:45:39,674 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2018-10-10 14:45:39,674 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 14:45:39,675 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 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, 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, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 14:45:39,675 INFO L424 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-10-10 14:45:39,676 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 14:45:39,676 INFO L82 PathProgramCache]: Analyzing trace with hash -761622587, now seen corresponding path program 1 times [2018-10-10 14:45:39,676 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-10 14:45:39,676 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-10 14:45:39,677 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:45:39,677 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-10 14:45:39,677 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:45:39,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 14:45:40,012 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2018-10-10 14:45:40,013 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-10 14:45:40,013 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-10-10 14:45:40,013 INFO L460 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-10-10 14:45:40,014 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-10-10 14:45:40,014 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2018-10-10 14:45:40,014 INFO L87 Difference]: Start difference. First operand 201 states and 202 transitions. Second operand 11 states. [2018-10-10 14:45:40,464 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 14:45:40,464 INFO L93 Difference]: Finished difference Result 200 states and 201 transitions. [2018-10-10 14:45:40,464 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-10-10 14:45:40,465 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 140 [2018-10-10 14:45:40,465 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 14:45:40,467 INFO L225 Difference]: With dead ends: 200 [2018-10-10 14:45:40,467 INFO L226 Difference]: Without dead ends: 200 [2018-10-10 14:45:40,468 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=113, Invalid=267, Unknown=0, NotChecked=0, Total=380 [2018-10-10 14:45:40,468 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 200 states. [2018-10-10 14:45:40,472 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 200 to 200. [2018-10-10 14:45:40,472 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 200 states. [2018-10-10 14:45:40,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 200 states to 200 states and 201 transitions. [2018-10-10 14:45:40,473 INFO L78 Accepts]: Start accepts. Automaton has 200 states and 201 transitions. Word has length 140 [2018-10-10 14:45:40,473 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 14:45:40,473 INFO L481 AbstractCegarLoop]: Abstraction has 200 states and 201 transitions. [2018-10-10 14:45:40,473 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-10-10 14:45:40,474 INFO L276 IsEmpty]: Start isEmpty. Operand 200 states and 201 transitions. [2018-10-10 14:45:40,474 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2018-10-10 14:45:40,475 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 14:45:40,475 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 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, 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, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 14:45:40,475 INFO L424 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-10-10 14:45:40,476 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 14:45:40,476 INFO L82 PathProgramCache]: Analyzing trace with hash 2146191035, now seen corresponding path program 1 times [2018-10-10 14:45:40,476 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-10 14:45:40,476 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-10 14:45:40,477 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:45:40,477 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-10 14:45:40,477 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:45:40,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 14:45:40,866 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2018-10-10 14:45:40,867 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-10 14:45:40,867 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-10-10 14:45:40,867 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-10-10 14:45:40,867 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-10 14:45:40,868 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-10-10 14:45:40,871 INFO L87 Difference]: Start difference. First operand 200 states and 201 transitions. Second operand 6 states. [2018-10-10 14:45:41,280 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 14:45:41,281 INFO L93 Difference]: Finished difference Result 199 states and 200 transitions. [2018-10-10 14:45:41,281 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-10-10 14:45:41,281 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 171 [2018-10-10 14:45:41,282 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 14:45:41,283 INFO L225 Difference]: With dead ends: 199 [2018-10-10 14:45:41,283 INFO L226 Difference]: Without dead ends: 199 [2018-10-10 14:45:41,284 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-10-10 14:45:41,284 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 199 states. [2018-10-10 14:45:41,288 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 199 to 199. [2018-10-10 14:45:41,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 199 states. [2018-10-10 14:45:41,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 199 states to 199 states and 200 transitions. [2018-10-10 14:45:41,289 INFO L78 Accepts]: Start accepts. Automaton has 199 states and 200 transitions. Word has length 171 [2018-10-10 14:45:41,289 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 14:45:41,289 INFO L481 AbstractCegarLoop]: Abstraction has 199 states and 200 transitions. [2018-10-10 14:45:41,289 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-10-10 14:45:41,290 INFO L276 IsEmpty]: Start isEmpty. Operand 199 states and 200 transitions. [2018-10-10 14:45:41,290 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2018-10-10 14:45:41,290 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 14:45:41,291 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 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, 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, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 14:45:41,291 INFO L424 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-10-10 14:45:41,291 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 14:45:41,292 INFO L82 PathProgramCache]: Analyzing trace with hash 2107412846, now seen corresponding path program 1 times [2018-10-10 14:45:41,292 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-10 14:45:41,292 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-10 14:45:41,293 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:45:41,293 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-10 14:45:41,293 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:45:41,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 14:45:41,632 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2018-10-10 14:45:41,632 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-10 14:45:41,632 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-10-10 14:45:41,632 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-10-10 14:45:41,633 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-10-10 14:45:41,633 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-10-10 14:45:41,633 INFO L87 Difference]: Start difference. First operand 199 states and 200 transitions. Second operand 7 states. [2018-10-10 14:45:41,808 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 14:45:41,808 INFO L93 Difference]: Finished difference Result 198 states and 199 transitions. [2018-10-10 14:45:41,809 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-10-10 14:45:41,809 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 172 [2018-10-10 14:45:41,809 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 14:45:41,811 INFO L225 Difference]: With dead ends: 198 [2018-10-10 14:45:41,811 INFO L226 Difference]: Without dead ends: 198 [2018-10-10 14:45:41,812 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2018-10-10 14:45:41,812 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 198 states. [2018-10-10 14:45:41,815 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 198 to 198. [2018-10-10 14:45:41,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 198 states. [2018-10-10 14:45:41,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 198 states to 198 states and 199 transitions. [2018-10-10 14:45:41,816 INFO L78 Accepts]: Start accepts. Automaton has 198 states and 199 transitions. Word has length 172 [2018-10-10 14:45:41,816 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 14:45:41,816 INFO L481 AbstractCegarLoop]: Abstraction has 198 states and 199 transitions. [2018-10-10 14:45:41,817 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-10-10 14:45:41,817 INFO L276 IsEmpty]: Start isEmpty. Operand 198 states and 199 transitions. [2018-10-10 14:45:41,817 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2018-10-10 14:45:41,818 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 14:45:41,818 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 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, 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, 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, 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, 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, 1, 1] [2018-10-10 14:45:41,818 INFO L424 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-10-10 14:45:41,818 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 14:45:41,819 INFO L82 PathProgramCache]: Analyzing trace with hash -1950537664, now seen corresponding path program 1 times [2018-10-10 14:45:41,819 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-10 14:45:41,819 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-10 14:45:41,819 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:45:41,820 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-10 14:45:41,820 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:45:41,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 14:45:44,804 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 56 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 14:45:44,804 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-10 14:45:44,804 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-10 14:45:44,813 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-10 14:45:44,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 14:45:44,893 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-10 14:45:45,151 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-10-10 14:45:45,153 INFO L477 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 8 treesize of output 7 [2018-10-10 14:45:45,153 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-10 14:45:45,156 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-10 14:45:45,161 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-10 14:45:45,161 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:15, output treesize:11 [2018-10-10 14:45:45,536 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 27 treesize of output 37 [2018-10-10 14:45:45,546 INFO L477 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 28 treesize of output 27 [2018-10-10 14:45:45,546 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-10 14:45:45,565 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-10 14:45:45,579 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-10 14:45:45,579 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:42, output treesize:38 [2018-10-10 14:45:45,714 INFO L477 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 2 new quantified variables, introduced 4 case distinctions, treesize of input 38 treesize of output 47 [2018-10-10 14:45:45,728 INFO L700 Elim1Store]: detected not equals via solver [2018-10-10 14:45:45,729 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 47 [2018-10-10 14:45:45,730 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-10 14:45:45,770 INFO L700 Elim1Store]: detected not equals via solver [2018-10-10 14:45:45,771 INFO L700 Elim1Store]: detected not equals via solver [2018-10-10 14:45:45,792 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 30 treesize of output 54 [2018-10-10 14:45:45,794 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2018-10-10 14:45:45,853 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-10-10 14:45:45,885 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-10-10 14:45:45,886 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 1 variables, input treesize:53, output treesize:96 [2018-10-10 14:45:46,221 INFO L477 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 71 treesize of output 60 [2018-10-10 14:45:46,230 INFO L700 Elim1Store]: detected not equals via solver [2018-10-10 14:45:46,233 INFO L700 Elim1Store]: detected not equals via solver [2018-10-10 14:45:46,236 INFO L700 Elim1Store]: detected not equals via solver [2018-10-10 14:45:46,238 INFO L700 Elim1Store]: detected not equals via solver [2018-10-10 14:45:46,239 INFO L700 Elim1Store]: detected not equals via solver [2018-10-10 14:45:46,240 INFO L700 Elim1Store]: detected not equals via solver [2018-10-10 14:45:46,242 INFO L700 Elim1Store]: detected not equals via solver [2018-10-10 14:45:46,244 INFO L700 Elim1Store]: detected not equals via solver [2018-10-10 14:45:46,246 INFO L700 Elim1Store]: detected not equals via solver [2018-10-10 14:45:46,288 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 33 treesize of output 123 [2018-10-10 14:45:46,290 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-10-10 14:45:46,396 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-10-10 14:45:46,538 INFO L477 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 2 new quantified variables, introduced 4 case distinctions, treesize of input 73 treesize of output 75 [2018-10-10 14:45:46,574 INFO L700 Elim1Store]: detected not equals via solver [2018-10-10 14:45:46,578 INFO L700 Elim1Store]: detected not equals via solver [2018-10-10 14:45:46,584 INFO L700 Elim1Store]: detected not equals via solver [2018-10-10 14:45:46,585 INFO L700 Elim1Store]: detected not equals via solver [2018-10-10 14:45:46,587 INFO L700 Elim1Store]: detected not equals via solver [2018-10-10 14:45:46,590 INFO L700 Elim1Store]: detected not equals via solver [2018-10-10 14:45:46,641 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 6 disjoint index pairs (out of 10 index pairs), introduced 2 new quantified variables, introduced 8 case distinctions, treesize of input 61 treesize of output 128 [2018-10-10 14:45:46,645 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 4 xjuncts. [2018-10-10 14:45:46,863 INFO L700 Elim1Store]: detected not equals via solver [2018-10-10 14:45:46,865 INFO L700 Elim1Store]: detected not equals via solver [2018-10-10 14:45:46,867 INFO L700 Elim1Store]: detected not equals via solver [2018-10-10 14:45:46,873 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 66 treesize of output 89 [2018-10-10 14:45:46,874 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-10-10 14:45:46,993 INFO L267 ElimStorePlain]: Start of recursive call 4: 2 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-10-10 14:45:47,163 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 5 xjuncts. [2018-10-10 14:45:47,163 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 3 variables, input treesize:145, output treesize:314 [2018-10-10 14:45:48,413 WARN L178 SmtUtils]: Spent 1.04 s on a formula simplification that was a NOOP. DAG size: 78 [2018-10-10 14:45:49,766 WARN L178 SmtUtils]: Spent 352.00 ms on a formula simplification that was a NOOP. DAG size: 109 [2018-10-10 14:45:49,827 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 87 treesize of output 85 [2018-10-10 14:45:49,850 INFO L700 Elim1Store]: detected not equals via solver [2018-10-10 14:45:49,853 INFO L700 Elim1Store]: detected not equals via solver [2018-10-10 14:45:49,854 INFO L700 Elim1Store]: detected not equals via solver [2018-10-10 14:45:49,855 INFO L700 Elim1Store]: detected not equals via solver [2018-10-10 14:45:49,855 INFO L700 Elim1Store]: detected not equals via solver [2018-10-10 14:45:49,856 INFO L700 Elim1Store]: detected not equals via solver [2018-10-10 14:45:49,865 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 82 treesize of output 129 [2018-10-10 14:45:49,866 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-10 14:45:49,956 INFO L700 Elim1Store]: detected not equals via solver [2018-10-10 14:45:49,959 INFO L700 Elim1Store]: detected not equals via solver [2018-10-10 14:45:49,965 INFO L700 Elim1Store]: detected not equals via solver [2018-10-10 14:45:49,968 INFO L700 Elim1Store]: detected not equals via solver [2018-10-10 14:45:49,973 INFO L700 Elim1Store]: detected not equals via solver [2018-10-10 14:45:49,975 INFO L700 Elim1Store]: detected not equals via solver [2018-10-10 14:45:49,977 INFO L700 Elim1Store]: detected not equals via solver [2018-10-10 14:45:49,979 INFO L700 Elim1Store]: detected not equals via solver [2018-10-10 14:45:49,983 INFO L700 Elim1Store]: detected not equals via solver [2018-10-10 14:45:49,984 INFO L700 Elim1Store]: detected not equals via solver [2018-10-10 14:45:49,990 INFO L700 Elim1Store]: detected not equals via solver [2018-10-10 14:45:49,992 INFO L700 Elim1Store]: detected not equals via solver [2018-10-10 14:45:50,182 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 7 select indices, 7 select index equivalence classes, 12 disjoint index pairs (out of 21 index pairs), introduced 3 new quantified variables, introduced 15 case distinctions, treesize of input 71 treesize of output 197 [2018-10-10 14:45:50,188 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 8 xjuncts. [2018-10-10 14:45:50,502 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 4 xjuncts. [2018-10-10 14:45:51,328 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 82 treesize of output 67 [2018-10-10 14:45:51,353 INFO L700 Elim1Store]: detected not equals via solver [2018-10-10 14:45:51,354 INFO L700 Elim1Store]: detected not equals via solver [2018-10-10 14:45:51,356 INFO L700 Elim1Store]: detected not equals via solver [2018-10-10 14:45:51,357 INFO L700 Elim1Store]: detected not equals via solver [2018-10-10 14:45:51,358 INFO L700 Elim1Store]: detected not equals via solver [2018-10-10 14:45:51,362 INFO L700 Elim1Store]: detected not equals via solver [2018-10-10 14:45:51,364 INFO L700 Elim1Store]: detected not equals via solver [2018-10-10 14:45:51,365 INFO L700 Elim1Store]: detected not equals via solver [2018-10-10 14:45:51,369 INFO L700 Elim1Store]: detected not equals via solver [2018-10-10 14:45:51,370 INFO L700 Elim1Store]: detected not equals via solver [2018-10-10 14:45:51,371 INFO L700 Elim1Store]: detected not equals via solver [2018-10-10 14:45:51,373 INFO L700 Elim1Store]: detected not equals via solver [2018-10-10 14:45:51,393 INFO L700 Elim1Store]: detected not equals via solver [2018-10-10 14:45:51,394 INFO L700 Elim1Store]: detected not equals via solver [2018-10-10 14:45:51,396 INFO L700 Elim1Store]: detected not equals via solver [2018-10-10 14:45:51,397 INFO L700 Elim1Store]: detected not equals via solver [2018-10-10 14:45:51,398 INFO L700 Elim1Store]: detected not equals via solver [2018-10-10 14:45:51,400 INFO L700 Elim1Store]: detected not equals via solver [2018-10-10 14:45:51,439 INFO L303 Elim1Store]: Index analysis took 108 ms [2018-10-10 14:45:51,465 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 18 disjoint index pairs (out of 15 index pairs), introduced 2 new quantified variables, introduced 5 case distinctions, treesize of input 44 treesize of output 217 [2018-10-10 14:45:51,469 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 4 xjuncts. [2018-10-10 14:45:51,710 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-10-10 14:45:52,376 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 72 treesize of output 59 [2018-10-10 14:45:52,381 INFO L700 Elim1Store]: detected not equals via solver [2018-10-10 14:45:52,381 INFO L700 Elim1Store]: detected not equals via solver [2018-10-10 14:45:52,382 INFO L700 Elim1Store]: detected not equals via solver [2018-10-10 14:45:52,383 INFO L700 Elim1Store]: detected not equals via solver [2018-10-10 14:45:52,385 INFO L700 Elim1Store]: detected not equals via solver [2018-10-10 14:45:52,386 INFO L700 Elim1Store]: detected not equals via solver [2018-10-10 14:45:52,387 INFO L700 Elim1Store]: detected not equals via solver [2018-10-10 14:45:52,388 INFO L700 Elim1Store]: detected not equals via solver [2018-10-10 14:45:52,390 INFO L700 Elim1Store]: detected not equals via solver [2018-10-10 14:45:52,391 INFO L700 Elim1Store]: detected not equals via solver [2018-10-10 14:45:52,392 INFO L700 Elim1Store]: detected not equals via solver [2018-10-10 14:45:52,395 INFO L700 Elim1Store]: detected not equals via solver [2018-10-10 14:45:52,396 INFO L700 Elim1Store]: detected not equals via solver [2018-10-10 14:45:52,397 INFO L700 Elim1Store]: detected not equals via solver [2018-10-10 14:45:52,422 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 14 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 36 treesize of output 148 [2018-10-10 14:45:52,425 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 2 xjuncts. [2018-10-10 14:45:52,556 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-10-10 14:45:53,257 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 72 treesize of output 61 [2018-10-10 14:45:53,293 INFO L700 Elim1Store]: detected not equals via solver [2018-10-10 14:45:53,316 INFO L700 Elim1Store]: detected not equals via solver [2018-10-10 14:45:53,341 INFO L700 Elim1Store]: detected not equals via solver [2018-10-10 14:45:53,394 INFO L700 Elim1Store]: detected not equals via solver [2018-10-10 14:45:53,415 INFO L700 Elim1Store]: detected not equals via solver [2018-10-10 14:45:53,442 INFO L700 Elim1Store]: detected not equals via solver [2018-10-10 14:45:53,467 INFO L700 Elim1Store]: detected not equals via solver [2018-10-10 14:45:53,472 INFO L700 Elim1Store]: detected not equals via solver [2018-10-10 14:45:53,475 INFO L700 Elim1Store]: detected not equals via solver [2018-10-10 14:45:53,485 INFO L303 Elim1Store]: Index analysis took 226 ms [2018-10-10 14:45:53,498 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 39 treesize of output 153 [2018-10-10 14:45:53,501 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 2 xjuncts. [2018-10-10 14:45:53,582 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-10-10 14:45:54,093 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 81 treesize of output 66 [2018-10-10 14:45:54,159 INFO L700 Elim1Store]: detected not equals via solver [2018-10-10 14:45:54,182 INFO L700 Elim1Store]: detected not equals via solver [2018-10-10 14:45:54,205 INFO L700 Elim1Store]: detected not equals via solver [2018-10-10 14:45:54,231 INFO L700 Elim1Store]: detected not equals via solver [2018-10-10 14:45:54,252 INFO L700 Elim1Store]: detected not equals via solver [2018-10-10 14:45:54,294 INFO L700 Elim1Store]: detected not equals via solver [2018-10-10 14:45:54,315 INFO L700 Elim1Store]: detected not equals via solver [2018-10-10 14:45:54,333 INFO L700 Elim1Store]: detected not equals via solver [2018-10-10 14:45:54,336 INFO L700 Elim1Store]: detected not equals via solver [2018-10-10 14:45:54,340 INFO L700 Elim1Store]: detected not equals via solver [2018-10-10 14:45:54,341 INFO L700 Elim1Store]: detected not equals via solver [2018-10-10 14:45:54,348 INFO L700 Elim1Store]: detected not equals via solver [2018-10-10 14:45:54,350 INFO L700 Elim1Store]: detected not equals via solver [2018-10-10 14:45:54,357 INFO L700 Elim1Store]: detected not equals via solver [2018-10-10 14:45:54,359 INFO L700 Elim1Store]: detected not equals via solver [2018-10-10 14:45:54,360 INFO L700 Elim1Store]: detected not equals via solver [2018-10-10 14:45:54,361 INFO L700 Elim1Store]: detected not equals via solver [2018-10-10 14:45:54,364 INFO L700 Elim1Store]: detected not equals via solver [2018-10-10 14:45:54,366 INFO L700 Elim1Store]: detected not equals via solver [2018-10-10 14:45:54,414 INFO L303 Elim1Store]: Index analysis took 319 ms [2018-10-10 14:45:54,446 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 19 disjoint index pairs (out of 15 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 44 treesize of output 229 [2018-10-10 14:45:54,449 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 4 xjuncts. [2018-10-10 14:45:55,074 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-10-10 14:45:55,544 INFO L267 ElimStorePlain]: Start of recursive call 1: 16 dim-0 vars, 5 dim-2 vars, End of recursive call: 36 dim-0 vars, and 14 xjuncts. [2018-10-10 14:45:55,545 INFO L202 ElimStorePlain]: Needed 12 recursive calls to eliminate 21 variables, input treesize:395, output treesize:944 [2018-10-10 14:45:56,152 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 27 treesize of output 37 [2018-10-10 14:45:56,157 INFO L682 Elim1Store]: detected equality via solver [2018-10-10 14:45:56,157 INFO L682 Elim1Store]: detected equality via solver [2018-10-10 14:45:56,158 INFO L477 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 32 [2018-10-10 14:45:56,158 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-10 14:45:56,180 INFO L477 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 24 treesize of output 23 [2018-10-10 14:45:56,180 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-10-10 14:45:56,191 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-10 14:45:56,208 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-10 14:45:56,209 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 1 variables, input treesize:45, output treesize:41 [2018-10-10 14:45:56,380 INFO L477 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 2 new quantified variables, introduced 4 case distinctions, treesize of input 38 treesize of output 47 [2018-10-10 14:45:56,384 INFO L682 Elim1Store]: detected equality via solver [2018-10-10 14:45:56,386 INFO L700 Elim1Store]: detected not equals via solver [2018-10-10 14:45:56,387 INFO L700 Elim1Store]: detected not equals via solver [2018-10-10 14:45:56,387 INFO L682 Elim1Store]: detected equality via solver [2018-10-10 14:45:56,397 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 48 [2018-10-10 14:45:56,397 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-10 14:45:56,424 INFO L700 Elim1Store]: detected not equals via solver [2018-10-10 14:45:56,426 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 40 [2018-10-10 14:45:56,427 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-10-10 14:45:56,441 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-10 14:45:56,459 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-10 14:45:56,460 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 1 variables, input treesize:56, output treesize:52 [2018-10-10 14:45:56,699 INFO L477 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 2 new quantified variables, introduced 4 case distinctions, treesize of input 53 treesize of output 58 [2018-10-10 14:45:56,708 INFO L700 Elim1Store]: detected not equals via solver [2018-10-10 14:45:56,709 INFO L700 Elim1Store]: detected not equals via solver [2018-10-10 14:45:56,710 INFO L700 Elim1Store]: detected not equals via solver [2018-10-10 14:45:56,715 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 76 [2018-10-10 14:45:56,716 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-10 14:45:56,766 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-10 14:45:56,793 INFO L267 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. [2018-10-10 14:45:56,794 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:76, output treesize:72 [2018-10-10 14:45:57,068 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 62 treesize of output 60 [2018-10-10 14:45:57,077 INFO L700 Elim1Store]: detected not equals via solver [2018-10-10 14:45:57,079 INFO L700 Elim1Store]: detected not equals via solver [2018-10-10 14:45:57,080 INFO L700 Elim1Store]: detected not equals via solver [2018-10-10 14:45:57,081 INFO L682 Elim1Store]: detected equality via solver [2018-10-10 14:45:57,083 INFO L700 Elim1Store]: detected not equals via solver [2018-10-10 14:45:57,084 INFO L700 Elim1Store]: detected not equals via solver [2018-10-10 14:45:57,088 INFO L700 Elim1Store]: detected not equals via solver [2018-10-10 14:45:57,089 INFO L682 Elim1Store]: detected equality via solver [2018-10-10 14:45:57,090 INFO L700 Elim1Store]: detected not equals via solver [2018-10-10 14:45:57,091 INFO L700 Elim1Store]: detected not equals via solver [2018-10-10 14:45:57,092 INFO L700 Elim1Store]: detected not equals via solver [2018-10-10 14:45:57,094 INFO L700 Elim1Store]: detected not equals via solver [2018-10-10 14:45:57,095 INFO L700 Elim1Store]: detected not equals via solver [2018-10-10 14:45:57,096 INFO L682 Elim1Store]: detected equality via solver [2018-10-10 14:45:57,098 INFO L700 Elim1Store]: detected not equals via solver [2018-10-10 14:45:57,098 INFO L682 Elim1Store]: detected equality via solver [2018-10-10 14:45:57,145 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 7 select indices, 7 select index equivalence classes, 6 disjoint index pairs (out of 21 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 106 [2018-10-10 14:45:57,146 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-10 14:45:57,184 INFO L700 Elim1Store]: detected not equals via solver [2018-10-10 14:45:57,186 INFO L700 Elim1Store]: detected not equals via solver [2018-10-10 14:45:57,187 INFO L700 Elim1Store]: detected not equals via solver [2018-10-10 14:45:57,190 INFO L700 Elim1Store]: detected not equals via solver [2018-10-10 14:45:57,191 INFO L700 Elim1Store]: detected not equals via solver [2018-10-10 14:45:57,193 INFO L700 Elim1Store]: detected not equals via solver [2018-10-10 14:45:57,203 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 100 [2018-10-10 14:45:57,204 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-10-10 14:45:57,237 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-10 14:45:57,262 INFO L267 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. [2018-10-10 14:45:57,262 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 5 variables, input treesize:81, output treesize:77 [2018-10-10 14:45:57,618 INFO L477 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 65 treesize of output 53 [2018-10-10 14:45:57,659 INFO L700 Elim1Store]: detected not equals via solver [2018-10-10 14:45:57,668 INFO L682 Elim1Store]: detected equality via solver [2018-10-10 14:45:57,677 INFO L700 Elim1Store]: detected not equals via solver [2018-10-10 14:45:57,678 INFO L700 Elim1Store]: detected not equals via solver [2018-10-10 14:45:57,679 INFO L700 Elim1Store]: detected not equals via solver [2018-10-10 14:45:57,680 INFO L700 Elim1Store]: detected not equals via solver [2018-10-10 14:45:57,681 INFO L700 Elim1Store]: detected not equals via solver [2018-10-10 14:45:57,682 INFO L682 Elim1Store]: detected equality via solver [2018-10-10 14:45:57,684 INFO L700 Elim1Store]: detected not equals via solver [2018-10-10 14:45:57,685 INFO L700 Elim1Store]: detected not equals via solver [2018-10-10 14:45:57,686 INFO L700 Elim1Store]: detected not equals via solver [2018-10-10 14:45:57,688 INFO L700 Elim1Store]: detected not equals via solver [2018-10-10 14:45:57,689 INFO L700 Elim1Store]: detected not equals via solver [2018-10-10 14:45:57,690 INFO L700 Elim1Store]: detected not equals via solver [2018-10-10 14:45:57,691 INFO L682 Elim1Store]: detected equality via solver [2018-10-10 14:45:57,692 INFO L682 Elim1Store]: detected equality via solver [2018-10-10 14:45:57,725 INFO L303 Elim1Store]: Index analysis took 103 ms [2018-10-10 14:45:57,727 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 8 select indices, 8 select index equivalence classes, 6 disjoint index pairs (out of 28 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 90 [2018-10-10 14:45:57,728 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-10 14:45:57,767 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-10 14:45:57,779 INFO L267 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-10 14:45:57,779 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 7 variables, input treesize:84, output treesize:7 [2018-10-10 14:45:57,932 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 10 proven. 46 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 14:45:57,966 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-10 14:45:57,967 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37, 32] total 65 [2018-10-10 14:45:57,989 WARN L240 PathProgramDumper]: Writing path program to file /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/dump/test-memleak_nexttime_true-valid-memsafety_true-termination.i_16.bpl [2018-10-10 14:45:57,990 INFO L460 AbstractCegarLoop]: Interpolant automaton has 66 states [2018-10-10 14:45:57,991 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 66 interpolants. [2018-10-10 14:45:57,992 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=382, Invalid=3908, Unknown=0, NotChecked=0, Total=4290 [2018-10-10 14:45:57,992 INFO L87 Difference]: Start difference. First operand 198 states and 199 transitions. Second operand 66 states. [2018-10-10 14:45:59,847 WARN L178 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 45 [2018-10-10 14:46:00,036 WARN L178 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 51 [2018-10-10 14:46:00,325 WARN L178 SmtUtils]: Spent 161.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 56 [2018-10-10 14:46:00,584 WARN L178 SmtUtils]: Spent 169.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 69 [2018-10-10 14:46:00,978 WARN L178 SmtUtils]: Spent 228.00 ms on a formula simplification. DAG size of input: 144 DAG size of output: 73 [2018-10-10 14:46:01,294 WARN L178 SmtUtils]: Spent 199.00 ms on a formula simplification. DAG size of input: 170 DAG size of output: 73 [2018-10-10 14:46:01,707 WARN L178 SmtUtils]: Spent 225.00 ms on a formula simplification. DAG size of input: 184 DAG size of output: 68 [2018-10-10 14:46:02,127 WARN L178 SmtUtils]: Spent 295.00 ms on a formula simplification. DAG size of input: 161 DAG size of output: 63 [2018-10-10 14:46:02,469 WARN L178 SmtUtils]: Spent 141.00 ms on a formula simplification. DAG size of input: 145 DAG size of output: 60 [2018-10-10 14:46:02,698 WARN L178 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 132 DAG size of output: 48 [2018-10-10 14:46:02,913 WARN L178 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 128 DAG size of output: 46 [2018-10-10 14:46:03,159 WARN L178 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 134 DAG size of output: 50 [2018-10-10 14:46:05,827 WARN L178 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 76 [2018-10-10 14:46:06,197 WARN L178 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 78 [2018-10-10 14:46:06,446 WARN L178 SmtUtils]: Spent 150.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 80 [2018-10-10 14:46:06,731 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 14:46:06,731 INFO L93 Difference]: Finished difference Result 197 states and 198 transitions. [2018-10-10 14:46:06,732 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2018-10-10 14:46:06,732 INFO L78 Accepts]: Start accepts. Automaton has 66 states. Word has length 179 [2018-10-10 14:46:06,732 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 14:46:06,734 INFO L225 Difference]: With dead ends: 197 [2018-10-10 14:46:06,734 INFO L226 Difference]: Without dead ends: 197 [2018-10-10 14:46:06,737 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 258 GetRequests, 151 SyntacticMatches, 12 SemanticMatches, 95 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3031 ImplicationChecksByTransitivity, 12.6s TimeCoverageRelationStatistics Valid=1308, Invalid=7999, Unknown=5, NotChecked=0, Total=9312 [2018-10-10 14:46:06,737 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 197 states. [2018-10-10 14:46:06,739 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 197 to 197. [2018-10-10 14:46:06,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 197 states. [2018-10-10 14:46:06,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 197 states to 197 states and 198 transitions. [2018-10-10 14:46:06,740 INFO L78 Accepts]: Start accepts. Automaton has 197 states and 198 transitions. Word has length 179 [2018-10-10 14:46:06,741 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 14:46:06,741 INFO L481 AbstractCegarLoop]: Abstraction has 197 states and 198 transitions. [2018-10-10 14:46:06,741 INFO L482 AbstractCegarLoop]: Interpolant automaton has 66 states. [2018-10-10 14:46:06,741 INFO L276 IsEmpty]: Start isEmpty. Operand 197 states and 198 transitions. [2018-10-10 14:46:06,742 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2018-10-10 14:46:06,742 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 14:46:06,742 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 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, 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, 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, 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, 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, 1, 1, 1] [2018-10-10 14:46:06,743 INFO L424 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-10-10 14:46:06,743 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 14:46:06,743 INFO L82 PathProgramCache]: Analyzing trace with hash -337125229, now seen corresponding path program 1 times [2018-10-10 14:46:06,743 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-10 14:46:06,743 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-10 14:46:06,744 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:46:06,744 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-10 14:46:06,744 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:46:06,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 14:46:08,637 WARN L178 SmtUtils]: Spent 210.00 ms on a formula simplification. DAG size of input: 17 DAG size of output: 15 [2018-10-10 14:46:09,801 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 56 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 14:46:09,802 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-10 14:46:09,802 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-10 14:46:09,812 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-10 14:46:09,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 14:46:09,883 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-10 14:46:09,992 INFO L477 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 [2018-10-10 14:46:09,993 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-10 14:46:10,048 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-10 14:46:10,048 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-10-10 14:46:10,228 INFO L700 Elim1Store]: detected not equals via solver [2018-10-10 14:46:10,231 INFO L700 Elim1Store]: detected not equals via solver [2018-10-10 14:46:10,232 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 21 [2018-10-10 14:46:10,232 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-10 14:46:10,241 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-10 14:46:10,241 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:20, output treesize:18 [2018-10-10 14:46:10,626 INFO L477 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 11 treesize of output 8 [2018-10-10 14:46:10,628 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 8 treesize of output 7 [2018-10-10 14:46:10,628 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-10 14:46:10,630 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-10 14:46:10,638 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-10 14:46:10,639 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:29, output treesize:26 [2018-10-10 14:46:10,939 INFO L477 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 2 new quantified variables, introduced 6 case distinctions, treesize of input 37 treesize of output 48 [2018-10-10 14:46:10,944 INFO L477 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 41 treesize of output 40 [2018-10-10 14:46:10,945 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-10 14:46:10,970 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-10 14:46:10,991 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-10 14:46:10,992 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:60, output treesize:56 [2018-10-10 14:46:11,237 INFO L477 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 2 new quantified variables, introduced 4 case distinctions, treesize of input 48 treesize of output 55 [2018-10-10 14:46:11,327 INFO L700 Elim1Store]: detected not equals via solver [2018-10-10 14:46:11,350 INFO L700 Elim1Store]: detected not equals via solver [2018-10-10 14:46:11,478 INFO L303 Elim1Store]: Index analysis took 237 ms [2018-10-10 14:46:11,630 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 41 treesize of output 66 [2018-10-10 14:46:11,632 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-10-10 14:46:11,724 INFO L700 Elim1Store]: detected not equals via solver [2018-10-10 14:46:11,741 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 50 [2018-10-10 14:46:11,741 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-10-10 14:46:11,772 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-10-10 14:46:11,812 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-10-10 14:46:11,813 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 1 variables, input treesize:71, output treesize:132 [2018-10-10 14:46:12,301 INFO L303 Elim1Store]: Index analysis took 140 ms [2018-10-10 14:46:12,507 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 91 treesize of output 91 [2018-10-10 14:46:12,545 INFO L700 Elim1Store]: detected not equals via solver [2018-10-10 14:46:12,570 INFO L700 Elim1Store]: detected not equals via solver [2018-10-10 14:46:12,594 INFO L700 Elim1Store]: detected not equals via solver [2018-10-10 14:46:12,603 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 88 treesize of output 111 [2018-10-10 14:46:12,604 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-10 14:46:12,762 INFO L700 Elim1Store]: detected not equals via solver [2018-10-10 14:46:12,764 INFO L700 Elim1Store]: detected not equals via solver [2018-10-10 14:46:12,765 INFO L700 Elim1Store]: detected not equals via solver [2018-10-10 14:46:12,767 INFO L700 Elim1Store]: detected not equals via solver [2018-10-10 14:46:12,773 INFO L700 Elim1Store]: detected not equals via solver [2018-10-10 14:46:12,781 INFO L700 Elim1Store]: detected not equals via solver [2018-10-10 14:46:12,842 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 7 disjoint index pairs (out of 10 index pairs), introduced 3 new quantified variables, introduced 8 case distinctions, treesize of input 77 treesize of output 145 [2018-10-10 14:46:12,845 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 4 xjuncts. [2018-10-10 14:46:13,025 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-10-10 14:46:13,259 INFO L477 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 89 treesize of output 76 [2018-10-10 14:46:13,293 INFO L700 Elim1Store]: detected not equals via solver [2018-10-10 14:46:13,294 INFO L700 Elim1Store]: detected not equals via solver [2018-10-10 14:46:13,295 INFO L700 Elim1Store]: detected not equals via solver [2018-10-10 14:46:13,297 INFO L700 Elim1Store]: detected not equals via solver [2018-10-10 14:46:13,298 INFO L700 Elim1Store]: detected not equals via solver [2018-10-10 14:46:13,299 INFO L700 Elim1Store]: detected not equals via solver [2018-10-10 14:46:13,303 INFO L700 Elim1Store]: detected not equals via solver [2018-10-10 14:46:13,304 INFO L700 Elim1Store]: detected not equals via solver [2018-10-10 14:46:13,305 INFO L700 Elim1Store]: detected not equals via solver [2018-10-10 14:46:13,332 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 41 treesize of output 133 [2018-10-10 14:46:13,333 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 2 xjuncts. [2018-10-10 14:46:13,438 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-10-10 14:46:13,643 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 5 xjuncts. [2018-10-10 14:46:13,644 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 3 variables, input treesize:181, output treesize:408 [2018-10-10 14:46:14,982 WARN L178 SmtUtils]: Spent 1.11 s on a formula simplification that was a NOOP. DAG size: 93 [2018-10-10 14:46:15,932 WARN L178 SmtUtils]: Spent 543.00 ms on a formula simplification that was a NOOP. DAG size: 124 [2018-10-10 14:46:16,081 INFO L303 Elim1Store]: Index analysis took 117 ms [2018-10-10 14:46:16,287 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 102 treesize of output 98 [2018-10-10 14:46:16,368 INFO L700 Elim1Store]: detected not equals via solver [2018-10-10 14:46:16,400 INFO L700 Elim1Store]: detected not equals via solver [2018-10-10 14:46:16,421 INFO L700 Elim1Store]: detected not equals via solver [2018-10-10 14:46:16,493 INFO L700 Elim1Store]: detected not equals via solver [2018-10-10 14:46:16,584 INFO L700 Elim1Store]: detected not equals via solver [2018-10-10 14:46:16,605 INFO L700 Elim1Store]: detected not equals via solver [2018-10-10 14:46:16,696 INFO L700 Elim1Store]: detected not equals via solver [2018-10-10 14:46:16,720 INFO L700 Elim1Store]: detected not equals via solver [2018-10-10 14:46:16,742 INFO L700 Elim1Store]: detected not equals via solver [2018-10-10 14:46:16,768 INFO L700 Elim1Store]: detected not equals via solver [2018-10-10 14:46:16,842 INFO L700 Elim1Store]: detected not equals via solver [2018-10-10 14:46:16,949 INFO L700 Elim1Store]: detected not equals via solver [2018-10-10 14:46:17,448 INFO L303 Elim1Store]: Index analysis took 1157 ms [2018-10-10 14:46:17,664 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 7 select indices, 7 select index equivalence classes, 13 disjoint index pairs (out of 21 index pairs), introduced 4 new quantified variables, introduced 15 case distinctions, treesize of input 84 treesize of output 211 [2018-10-10 14:46:17,669 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 8 xjuncts. [2018-10-10 14:46:18,026 INFO L700 Elim1Store]: detected not equals via solver [2018-10-10 14:46:18,028 INFO L700 Elim1Store]: detected not equals via solver [2018-10-10 14:46:18,030 INFO L700 Elim1Store]: detected not equals via solver [2018-10-10 14:46:18,031 INFO L700 Elim1Store]: detected not equals via solver [2018-10-10 14:46:18,032 INFO L700 Elim1Store]: detected not equals via solver [2018-10-10 14:46:18,034 INFO L700 Elim1Store]: detected not equals via solver [2018-10-10 14:46:18,045 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 93 treesize of output 140 [2018-10-10 14:46:18,045 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-10-10 14:46:18,224 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 4 xjuncts. [2018-10-10 14:46:19,617 INFO L477 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 90 treesize of output 77 [2018-10-10 14:46:19,632 INFO L700 Elim1Store]: detected not equals via solver [2018-10-10 14:46:19,633 INFO L700 Elim1Store]: detected not equals via solver [2018-10-10 14:46:19,634 INFO L700 Elim1Store]: detected not equals via solver [2018-10-10 14:46:19,635 INFO L700 Elim1Store]: detected not equals via solver [2018-10-10 14:46:19,636 INFO L700 Elim1Store]: detected not equals via solver [2018-10-10 14:46:19,638 INFO L700 Elim1Store]: detected not equals via solver [2018-10-10 14:46:19,639 INFO L700 Elim1Store]: detected not equals via solver [2018-10-10 14:46:19,641 INFO L700 Elim1Store]: detected not equals via solver [2018-10-10 14:46:19,642 INFO L700 Elim1Store]: detected not equals via solver [2018-10-10 14:46:19,666 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 47 treesize of output 163 [2018-10-10 14:46:19,668 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 2 xjuncts. [2018-10-10 14:46:19,772 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-10-10 14:46:20,508 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 94 treesize of output 77 [2018-10-10 14:46:20,513 INFO L700 Elim1Store]: detected not equals via solver [2018-10-10 14:46:20,514 INFO L700 Elim1Store]: detected not equals via solver [2018-10-10 14:46:20,515 INFO L700 Elim1Store]: detected not equals via solver [2018-10-10 14:46:20,516 INFO L700 Elim1Store]: detected not equals via solver [2018-10-10 14:46:20,518 INFO L700 Elim1Store]: detected not equals via solver [2018-10-10 14:46:20,519 INFO L700 Elim1Store]: detected not equals via solver [2018-10-10 14:46:20,521 INFO L700 Elim1Store]: detected not equals via solver [2018-10-10 14:46:20,523 INFO L700 Elim1Store]: detected not equals via solver [2018-10-10 14:46:20,524 INFO L700 Elim1Store]: detected not equals via solver [2018-10-10 14:46:20,526 INFO L700 Elim1Store]: detected not equals via solver [2018-10-10 14:46:20,528 INFO L700 Elim1Store]: detected not equals via solver [2018-10-10 14:46:20,532 INFO L700 Elim1Store]: detected not equals via solver [2018-10-10 14:46:20,533 INFO L700 Elim1Store]: detected not equals via solver [2018-10-10 14:46:20,535 INFO L700 Elim1Store]: detected not equals via solver [2018-10-10 14:46:20,567 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 46 treesize of output 162 [2018-10-10 14:46:20,568 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 2 xjuncts. [2018-10-10 14:46:20,721 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-10-10 14:46:21,355 INFO L477 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 100 treesize of output 83 [2018-10-10 14:46:21,360 INFO L700 Elim1Store]: detected not equals via solver [2018-10-10 14:46:21,362 INFO L700 Elim1Store]: detected not equals via solver [2018-10-10 14:46:21,364 INFO L700 Elim1Store]: detected not equals via solver [2018-10-10 14:46:21,366 INFO L700 Elim1Store]: detected not equals via solver [2018-10-10 14:46:21,370 INFO L700 Elim1Store]: detected not equals via solver [2018-10-10 14:46:21,372 INFO L700 Elim1Store]: detected not equals via solver [2018-10-10 14:46:21,374 INFO L700 Elim1Store]: detected not equals via solver [2018-10-10 14:46:21,375 INFO L700 Elim1Store]: detected not equals via solver [2018-10-10 14:46:21,377 INFO L700 Elim1Store]: detected not equals via solver [2018-10-10 14:46:21,379 INFO L700 Elim1Store]: detected not equals via solver [2018-10-10 14:46:21,381 INFO L700 Elim1Store]: detected not equals via solver [2018-10-10 14:46:21,383 INFO L700 Elim1Store]: detected not equals via solver [2018-10-10 14:46:21,385 INFO L700 Elim1Store]: detected not equals via solver [2018-10-10 14:46:21,386 INFO L700 Elim1Store]: detected not equals via solver [2018-10-10 14:46:21,388 INFO L700 Elim1Store]: detected not equals via solver [2018-10-10 14:46:21,390 INFO L700 Elim1Store]: detected not equals via solver [2018-10-10 14:46:21,392 INFO L700 Elim1Store]: detected not equals via solver [2018-10-10 14:46:21,394 INFO L700 Elim1Store]: detected not equals via solver [2018-10-10 14:46:21,462 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 19 disjoint index pairs (out of 15 index pairs), introduced 2 new quantified variables, introduced 5 case distinctions, treesize of input 52 treesize of output 227 [2018-10-10 14:46:21,464 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 4 xjuncts. [2018-10-10 14:46:21,727 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-10-10 14:46:22,330 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 99 treesize of output 82 [2018-10-10 14:46:22,334 INFO L700 Elim1Store]: detected not equals via solver [2018-10-10 14:46:22,336 INFO L700 Elim1Store]: detected not equals via solver [2018-10-10 14:46:22,337 INFO L700 Elim1Store]: detected not equals via solver [2018-10-10 14:46:22,338 INFO L700 Elim1Store]: detected not equals via solver [2018-10-10 14:46:22,340 INFO L700 Elim1Store]: detected not equals via solver [2018-10-10 14:46:22,341 INFO L700 Elim1Store]: detected not equals via solver [2018-10-10 14:46:22,342 INFO L700 Elim1Store]: detected not equals via solver [2018-10-10 14:46:22,344 INFO L700 Elim1Store]: detected not equals via solver [2018-10-10 14:46:22,345 INFO L700 Elim1Store]: detected not equals via solver [2018-10-10 14:46:22,346 INFO L700 Elim1Store]: detected not equals via solver [2018-10-10 14:46:22,349 INFO L700 Elim1Store]: detected not equals via solver [2018-10-10 14:46:22,350 INFO L700 Elim1Store]: detected not equals via solver [2018-10-10 14:46:22,352 INFO L700 Elim1Store]: detected not equals via solver [2018-10-10 14:46:22,353 INFO L700 Elim1Store]: detected not equals via solver [2018-10-10 14:46:22,354 INFO L700 Elim1Store]: detected not equals via solver [2018-10-10 14:46:22,356 INFO L700 Elim1Store]: detected not equals via solver [2018-10-10 14:46:22,359 INFO L700 Elim1Store]: detected not equals via solver [2018-10-10 14:46:22,360 INFO L700 Elim1Store]: detected not equals via solver [2018-10-10 14:46:22,361 INFO L700 Elim1Store]: detected not equals via solver [2018-10-10 14:46:22,410 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 20 disjoint index pairs (out of 15 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 52 treesize of output 239 [2018-10-10 14:46:22,413 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 4 xjuncts. [2018-10-10 14:46:22,681 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-10-10 14:46:23,266 INFO L267 ElimStorePlain]: Start of recursive call 1: 15 dim-0 vars, 5 dim-2 vars, End of recursive call: 35 dim-0 vars, and 14 xjuncts. [2018-10-10 14:46:23,267 INFO L202 ElimStorePlain]: Needed 12 recursive calls to eliminate 20 variables, input treesize:486, output treesize:1216 [2018-10-10 14:46:30,743 WARN L178 SmtUtils]: Spent 921.00 ms on a formula simplification. DAG size of input: 365 DAG size of output: 47 [2018-10-10 14:46:31,001 INFO L700 Elim1Store]: detected not equals via solver [2018-10-10 14:46:31,002 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 23 [2018-10-10 14:46:31,002 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-10 14:46:31,030 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-1 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2018-10-10 14:46:31,031 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:104, output treesize:90 [2018-10-10 14:46:31,847 INFO L700 Elim1Store]: detected not equals via solver [2018-10-10 14:46:31,849 INFO L700 Elim1Store]: detected not equals via solver [2018-10-10 14:46:31,856 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 32 [2018-10-10 14:46:31,857 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2018-10-10 14:46:31,908 INFO L267 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 1 dim-1 vars, End of recursive call: 11 dim-0 vars, and 2 xjuncts. [2018-10-10 14:46:31,908 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 7 variables, input treesize:96, output treesize:194 [2018-10-10 14:46:39,871 WARN L178 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 83 [2018-10-10 14:46:44,467 WARN L178 SmtUtils]: Spent 1.50 s on a formula simplification that was a NOOP. DAG size: 91 [2018-10-10 14:46:44,773 WARN L178 SmtUtils]: Spent 108.00 ms on a formula simplification that was a NOOP. DAG size: 93 [2018-10-10 14:46:44,843 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 7 case distinctions, treesize of input 132 treesize of output 137 [2018-10-10 14:46:44,850 INFO L477 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 137 treesize of output 136 [2018-10-10 14:46:44,850 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-10 14:46:45,180 INFO L700 Elim1Store]: detected not equals via solver [2018-10-10 14:46:45,182 INFO L700 Elim1Store]: detected not equals via solver [2018-10-10 14:46:45,184 INFO L700 Elim1Store]: detected not equals via solver [2018-10-10 14:46:45,187 INFO L700 Elim1Store]: detected not equals via solver [2018-10-10 14:46:45,189 INFO L700 Elim1Store]: detected not equals via solver [2018-10-10 14:46:45,191 INFO L700 Elim1Store]: detected not equals via solver [2018-10-10 14:46:45,205 INFO L682 Elim1Store]: detected equality via solver [2018-10-10 14:46:45,244 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 6 case distinctions, treesize of input 124 treesize of output 220 [2018-10-10 14:46:45,247 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 8 xjuncts. [2018-10-10 14:46:45,761 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 4 xjuncts. [2018-10-10 14:46:46,265 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 7 case distinctions, treesize of input 124 treesize of output 131 [2018-10-10 14:46:46,275 INFO L477 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 129 treesize of output 128 [2018-10-10 14:46:46,275 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-10-10 14:46:46,576 INFO L700 Elim1Store]: detected not equals via solver [2018-10-10 14:46:46,577 INFO L700 Elim1Store]: detected not equals via solver [2018-10-10 14:46:46,578 INFO L700 Elim1Store]: detected not equals via solver [2018-10-10 14:46:46,581 INFO L700 Elim1Store]: detected not equals via solver [2018-10-10 14:46:46,583 INFO L700 Elim1Store]: detected not equals via solver [2018-10-10 14:46:46,586 INFO L700 Elim1Store]: detected not equals via solver [2018-10-10 14:46:46,601 INFO L682 Elim1Store]: detected equality via solver [2018-10-10 14:46:46,640 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 6 case distinctions, treesize of input 118 treesize of output 210 [2018-10-10 14:46:46,643 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 8 xjuncts. [2018-10-10 14:46:47,050 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-1 vars, End of recursive call: and 4 xjuncts. [2018-10-10 14:46:47,651 INFO L267 ElimStorePlain]: Start of recursive call 1: 10 dim-0 vars, 2 dim-2 vars, End of recursive call: 28 dim-0 vars, and 8 xjuncts. [2018-10-10 14:46:47,651 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 12 variables, input treesize:257, output treesize:1009 [2018-10-10 14:47:02,101 WARN L178 SmtUtils]: Spent 13.96 s on a formula simplification. DAG size of input: 257 DAG size of output: 257 [2018-10-10 14:47:13,211 WARN L178 SmtUtils]: Spent 10.67 s on a formula simplification that was a NOOP. DAG size: 251 [2018-10-10 14:47:13,276 INFO L477 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 2 new quantified variables, introduced 4 case distinctions, treesize of input 138 treesize of output 126 [2018-10-10 14:47:13,283 INFO L700 Elim1Store]: detected not equals via solver [2018-10-10 14:47:13,284 INFO L700 Elim1Store]: detected not equals via solver [2018-10-10 14:47:13,286 INFO L700 Elim1Store]: detected not equals via solver [2018-10-10 14:47:13,288 INFO L700 Elim1Store]: detected not equals via solver [2018-10-10 14:47:13,289 INFO L700 Elim1Store]: detected not equals via solver [2018-10-10 14:47:13,291 INFO L700 Elim1Store]: detected not equals via solver [2018-10-10 14:47:13,293 INFO L700 Elim1Store]: detected not equals via solver [2018-10-10 14:47:13,294 INFO L700 Elim1Store]: detected not equals via solver [2018-10-10 14:47:13,296 INFO L700 Elim1Store]: detected not equals via solver [2018-10-10 14:47:13,298 INFO L700 Elim1Store]: detected not equals via solver [2018-10-10 14:47:13,317 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 131 treesize of output 242 [2018-10-10 14:47:13,318 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-10 14:47:13,430 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-10 14:47:14,605 INFO L477 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 2 new quantified variables, introduced 4 case distinctions, treesize of input 130 treesize of output 120 [2018-10-10 14:47:14,612 INFO L700 Elim1Store]: detected not equals via solver [2018-10-10 14:47:14,613 INFO L700 Elim1Store]: detected not equals via solver [2018-10-10 14:47:14,614 INFO L700 Elim1Store]: detected not equals via solver [2018-10-10 14:47:14,618 INFO L700 Elim1Store]: detected not equals via solver [2018-10-10 14:47:14,620 INFO L700 Elim1Store]: detected not equals via solver [2018-10-10 14:47:14,621 INFO L700 Elim1Store]: detected not equals via solver [2018-10-10 14:47:14,623 INFO L700 Elim1Store]: detected not equals via solver [2018-10-10 14:47:14,624 INFO L700 Elim1Store]: detected not equals via solver [2018-10-10 14:47:14,666 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 8 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 4 case distinctions, treesize of input 123 treesize of output 234 [2018-10-10 14:47:14,669 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 4 xjuncts. [2018-10-10 14:47:14,969 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-10-10 14:47:16,406 INFO L477 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 2 new quantified variables, introduced 4 case distinctions, treesize of input 132 treesize of output 120 [2018-10-10 14:47:16,418 INFO L700 Elim1Store]: detected not equals via solver [2018-10-10 14:47:16,420 INFO L700 Elim1Store]: detected not equals via solver [2018-10-10 14:47:16,423 INFO L700 Elim1Store]: detected not equals via solver [2018-10-10 14:47:16,428 INFO L700 Elim1Store]: detected not equals via solver [2018-10-10 14:47:16,431 INFO L700 Elim1Store]: detected not equals via solver [2018-10-10 14:47:16,435 INFO L700 Elim1Store]: detected not equals via solver [2018-10-10 14:47:16,437 INFO L700 Elim1Store]: detected not equals via solver [2018-10-10 14:47:16,440 INFO L700 Elim1Store]: detected not equals via solver [2018-10-10 14:47:16,494 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 8 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 4 case distinctions, treesize of input 125 treesize of output 196 [2018-10-10 14:47:16,496 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 4 xjuncts. [2018-10-10 14:47:16,860 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-10-10 14:47:18,408 INFO L477 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 2 new quantified variables, introduced 4 case distinctions, treesize of input 121 treesize of output 111 [2018-10-10 14:47:18,414 INFO L700 Elim1Store]: detected not equals via solver [2018-10-10 14:47:18,415 INFO L700 Elim1Store]: detected not equals via solver [2018-10-10 14:47:18,416 INFO L700 Elim1Store]: detected not equals via solver [2018-10-10 14:47:18,417 INFO L700 Elim1Store]: detected not equals via solver [2018-10-10 14:47:18,419 INFO L700 Elim1Store]: detected not equals via solver [2018-10-10 14:47:18,420 INFO L700 Elim1Store]: detected not equals via solver [2018-10-10 14:47:18,422 INFO L700 Elim1Store]: detected not equals via solver [2018-10-10 14:47:18,424 INFO L700 Elim1Store]: detected not equals via solver [2018-10-10 14:47:18,426 INFO L700 Elim1Store]: detected not equals via solver [2018-10-10 14:47:18,427 INFO L700 Elim1Store]: detected not equals via solver [2018-10-10 14:47:18,445 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 114 treesize of output 185 [2018-10-10 14:47:18,446 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-10-10 14:47:18,606 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-10-10 14:47:19,997 INFO L477 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 3 new quantified variables, introduced 9 case distinctions, treesize of input 143 treesize of output 144 [2018-10-10 14:47:20,005 INFO L700 Elim1Store]: detected not equals via solver [2018-10-10 14:47:20,006 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 146 treesize of output 153 [2018-10-10 14:47:20,007 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-10-10 14:47:20,213 INFO L700 Elim1Store]: detected not equals via solver [2018-10-10 14:47:20,214 INFO L700 Elim1Store]: detected not equals via solver [2018-10-10 14:47:20,216 INFO L700 Elim1Store]: detected not equals via solver [2018-10-10 14:47:20,226 INFO L700 Elim1Store]: detected not equals via solver [2018-10-10 14:47:20,228 INFO L700 Elim1Store]: detected not equals via solver [2018-10-10 14:47:20,230 INFO L700 Elim1Store]: detected not equals via solver [2018-10-10 14:47:20,234 INFO L700 Elim1Store]: detected not equals via solver [2018-10-10 14:47:20,321 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 8 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 11 case distinctions, treesize of input 133 treesize of output 224 [2018-10-10 14:47:20,327 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 16 xjuncts. [2018-10-10 14:47:20,886 INFO L267 ElimStorePlain]: Start of recursive call 10: 2 dim-1 vars, End of recursive call: and 5 xjuncts. [2018-10-10 14:47:22,708 INFO L477 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 142 treesize of output 131 [2018-10-10 14:47:22,715 INFO L700 Elim1Store]: detected not equals via solver [2018-10-10 14:47:22,717 INFO L700 Elim1Store]: detected not equals via solver [2018-10-10 14:47:22,719 INFO L700 Elim1Store]: detected not equals via solver [2018-10-10 14:47:22,720 INFO L700 Elim1Store]: detected not equals via solver [2018-10-10 14:47:22,722 INFO L700 Elim1Store]: detected not equals via solver [2018-10-10 14:47:22,723 INFO L700 Elim1Store]: detected not equals via solver [2018-10-10 14:47:22,725 INFO L700 Elim1Store]: detected not equals via solver [2018-10-10 14:47:22,727 INFO L700 Elim1Store]: detected not equals via solver [2018-10-10 14:47:22,731 INFO L700 Elim1Store]: detected not equals via solver [2018-10-10 14:47:22,763 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 71 treesize of output 182 [2018-10-10 14:47:22,764 INFO L267 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 2 xjuncts. [2018-10-10 14:47:22,920 INFO L267 ElimStorePlain]: Start of recursive call 13: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-10-10 14:47:24,666 INFO L477 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 3 new quantified variables, introduced 9 case distinctions, treesize of input 135 treesize of output 138 [2018-10-10 14:47:24,680 INFO L700 Elim1Store]: detected not equals via solver [2018-10-10 14:47:24,681 INFO L700 Elim1Store]: detected not equals via solver [2018-10-10 14:47:24,683 INFO L700 Elim1Store]: detected not equals via solver [2018-10-10 14:47:24,685 INFO L700 Elim1Store]: detected not equals via solver [2018-10-10 14:47:24,688 INFO L700 Elim1Store]: detected not equals via solver [2018-10-10 14:47:24,690 INFO L700 Elim1Store]: detected not equals via solver [2018-10-10 14:47:24,694 INFO L700 Elim1Store]: detected not equals via solver [2018-10-10 14:47:24,778 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 7 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 11 case distinctions, treesize of input 127 treesize of output 216 [2018-10-10 14:47:24,785 INFO L267 ElimStorePlain]: Start of recursive call 16: End of recursive call: and 16 xjuncts. [2018-10-10 14:47:25,584 INFO L700 Elim1Store]: detected not equals via solver [2018-10-10 14:47:25,586 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 130 treesize of output 137 [2018-10-10 14:47:25,586 INFO L267 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 1 xjuncts. [2018-10-10 14:47:25,936 INFO L267 ElimStorePlain]: Start of recursive call 15: 2 dim-1 vars, End of recursive call: and 5 xjuncts. [2018-10-10 14:47:27,970 INFO L477 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 2 new quantified variables, introduced 4 case distinctions, treesize of input 123 treesize of output 113 [2018-10-10 14:47:27,975 INFO L700 Elim1Store]: detected not equals via solver [2018-10-10 14:47:27,977 INFO L700 Elim1Store]: detected not equals via solver [2018-10-10 14:47:27,979 INFO L700 Elim1Store]: detected not equals via solver [2018-10-10 14:47:27,980 INFO L700 Elim1Store]: detected not equals via solver [2018-10-10 14:47:27,982 INFO L700 Elim1Store]: detected not equals via solver [2018-10-10 14:47:27,983 INFO L700 Elim1Store]: detected not equals via solver [2018-10-10 14:47:27,985 INFO L700 Elim1Store]: detected not equals via solver [2018-10-10 14:47:27,986 INFO L700 Elim1Store]: detected not equals via solver [2018-10-10 14:47:27,988 INFO L700 Elim1Store]: detected not equals via solver [2018-10-10 14:47:28,038 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 116 treesize of output 187 [2018-10-10 14:47:28,040 INFO L267 ElimStorePlain]: Start of recursive call 19: End of recursive call: and 2 xjuncts. [2018-10-10 14:47:28,263 INFO L267 ElimStorePlain]: Start of recursive call 18: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-10-10 14:47:30,023 INFO L267 ElimStorePlain]: Start of recursive call 1: 28 dim-0 vars, 8 dim-2 vars, End of recursive call: 64 dim-0 vars, and 22 xjuncts. [2018-10-10 14:47:30,023 INFO L202 ElimStorePlain]: Needed 19 recursive calls to eliminate 36 variables, input treesize:1065, output treesize:2782 [2018-10-10 14:49:46,137 WARN L178 SmtUtils]: Spent 2.25 m on a formula simplification. DAG size of input: 569 DAG size of output: 521 [2018-10-10 14:50:20,775 WARN L178 SmtUtils]: Spent 33.05 s on a formula simplification that was a NOOP. DAG size: 700 [2018-10-10 14:50:21,050 INFO L303 Elim1Store]: Index analysis took 137 ms [2018-10-10 14:50:21,051 INFO L477 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 125 treesize of output 114 [2018-10-10 14:50:21,078 INFO L700 Elim1Store]: detected not equals via solver [2018-10-10 14:50:21,080 INFO L700 Elim1Store]: detected not equals via solver [2018-10-10 14:50:21,085 INFO L700 Elim1Store]: detected not equals via solver [2018-10-10 14:50:21,087 INFO L700 Elim1Store]: detected not equals via solver [2018-10-10 14:50:21,088 INFO L700 Elim1Store]: detected not equals via solver [2018-10-10 14:50:21,090 INFO L700 Elim1Store]: detected not equals via solver [2018-10-10 14:50:21,092 INFO L700 Elim1Store]: detected not equals via solver [2018-10-10 14:50:21,094 INFO L700 Elim1Store]: detected not equals via solver [2018-10-10 14:50:21,096 INFO L700 Elim1Store]: detected not equals via solver [2018-10-10 14:50:21,098 INFO L700 Elim1Store]: detected not equals via solver [2018-10-10 14:50:21,116 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 61 treesize of output 132 [2018-10-10 14:50:21,117 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-10 14:50:21,196 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-10 14:51:20,181 INFO L477 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 135 treesize of output 124 [2018-10-10 14:51:20,185 INFO L700 Elim1Store]: detected not equals via solver [2018-10-10 14:51:20,187 INFO L700 Elim1Store]: detected not equals via solver [2018-10-10 14:51:20,188 INFO L700 Elim1Store]: detected not equals via solver [2018-10-10 14:51:20,189 INFO L700 Elim1Store]: detected not equals via solver [2018-10-10 14:51:20,191 INFO L700 Elim1Store]: detected not equals via solver [2018-10-10 14:51:20,193 INFO L700 Elim1Store]: detected not equals via solver [2018-10-10 14:51:20,194 INFO L700 Elim1Store]: detected not equals via solver [2018-10-10 14:51:20,196 INFO L700 Elim1Store]: detected not equals via solver [2018-10-10 14:51:20,200 INFO L700 Elim1Store]: detected not equals via solver [2018-10-10 14:51:20,233 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 70 treesize of output 177 [2018-10-10 14:51:20,234 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 2 xjuncts. [2018-10-10 14:51:20,411 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-10-10 14:52:15,517 INFO L477 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 147 treesize of output 136 [2018-10-10 14:52:15,528 INFO L700 Elim1Store]: detected not equals via solver [2018-10-10 14:52:15,530 INFO L700 Elim1Store]: detected not equals via solver [2018-10-10 14:52:15,531 INFO L700 Elim1Store]: detected not equals via solver [2018-10-10 14:52:15,532 INFO L700 Elim1Store]: detected not equals via solver [2018-10-10 14:52:15,534 INFO L700 Elim1Store]: detected not equals via solver [2018-10-10 14:52:15,536 INFO L700 Elim1Store]: detected not equals via solver [2018-10-10 14:52:15,538 INFO L700 Elim1Store]: detected not equals via solver [2018-10-10 14:52:15,540 INFO L700 Elim1Store]: detected not equals via solver [2018-10-10 14:52:15,542 INFO L700 Elim1Store]: detected not equals via solver [2018-10-10 14:52:15,544 INFO L700 Elim1Store]: detected not equals via solver [2018-10-10 14:52:15,564 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 70 treesize of output 177 [2018-10-10 14:52:15,564 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-10-10 14:52:15,649 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-10 14:53:05,788 INFO L477 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 155 treesize of output 142 [2018-10-10 14:53:05,821 INFO L700 Elim1Store]: detected not equals via solver [2018-10-10 14:53:05,822 INFO L700 Elim1Store]: detected not equals via solver [2018-10-10 14:53:05,823 INFO L700 Elim1Store]: detected not equals via solver [2018-10-10 14:53:05,825 INFO L700 Elim1Store]: detected not equals via solver [2018-10-10 14:53:05,827 INFO L700 Elim1Store]: detected not equals via solver [2018-10-10 14:53:05,830 INFO L700 Elim1Store]: detected not equals via solver [2018-10-10 14:53:05,832 INFO L700 Elim1Store]: detected not equals via solver [2018-10-10 14:53:05,834 INFO L700 Elim1Store]: detected not equals via solver [2018-10-10 14:53:05,840 INFO L700 Elim1Store]: detected not equals via solver [2018-10-10 14:53:05,842 INFO L700 Elim1Store]: detected not equals via solver [2018-10-10 14:53:05,844 INFO L700 Elim1Store]: detected not equals via solver [2018-10-10 14:53:05,846 INFO L700 Elim1Store]: detected not equals via solver [2018-10-10 14:53:05,879 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 12 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 74 treesize of output 167 [2018-10-10 14:53:05,880 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-10-10 14:53:05,981 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-10 14:53:54,150 INFO L477 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 165 treesize of output 152 [2018-10-10 14:53:54,157 INFO L700 Elim1Store]: detected not equals via solver [2018-10-10 14:53:54,158 INFO L700 Elim1Store]: detected not equals via solver [2018-10-10 14:53:54,160 INFO L700 Elim1Store]: detected not equals via solver [2018-10-10 14:53:54,163 INFO L700 Elim1Store]: detected not equals via solver [2018-10-10 14:53:54,165 INFO L700 Elim1Store]: detected not equals via solver [2018-10-10 14:53:54,167 INFO L700 Elim1Store]: detected not equals via solver [2018-10-10 14:53:54,169 INFO L700 Elim1Store]: detected not equals via solver [2018-10-10 14:53:54,172 INFO L700 Elim1Store]: detected not equals via solver [2018-10-10 14:53:54,183 INFO L700 Elim1Store]: detected not equals via solver [2018-10-10 14:53:54,185 INFO L700 Elim1Store]: detected not equals via solver [2018-10-10 14:53:54,188 INFO L700 Elim1Store]: detected not equals via solver [2018-10-10 14:53:54,190 INFO L700 Elim1Store]: detected not equals via solver [2018-10-10 14:53:54,242 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 12 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 3 case distinctions, treesize of input 87 treesize of output 242 [2018-10-10 14:53:54,243 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 2 xjuncts. [2018-10-10 14:53:54,479 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-10-10 14:54:42,992 INFO L477 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 2 new quantified variables, introduced 4 case distinctions, treesize of input 143 treesize of output 129 [2018-10-10 14:54:42,999 INFO L700 Elim1Store]: detected not equals via solver [2018-10-10 14:54:43,000 INFO L700 Elim1Store]: detected not equals via solver [2018-10-10 14:54:43,004 INFO L700 Elim1Store]: detected not equals via solver [2018-10-10 14:54:43,006 INFO L700 Elim1Store]: detected not equals via solver [2018-10-10 14:54:43,007 INFO L700 Elim1Store]: detected not equals via solver [2018-10-10 14:54:43,009 INFO L700 Elim1Store]: detected not equals via solver [2018-10-10 14:54:43,011 INFO L700 Elim1Store]: detected not equals via solver [2018-10-10 14:54:43,013 INFO L700 Elim1Store]: detected not equals via solver [2018-10-10 14:54:43,015 INFO L700 Elim1Store]: detected not equals via solver [2018-10-10 14:54:43,016 INFO L700 Elim1Store]: detected not equals via solver [2018-10-10 14:54:43,018 INFO L700 Elim1Store]: detected not equals via solver [2018-10-10 14:54:43,020 INFO L700 Elim1Store]: detected not equals via solver [2018-10-10 14:54:43,024 INFO L700 Elim1Store]: detected not equals via solver [2018-10-10 14:54:43,069 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 3 case distinctions, treesize of input 134 treesize of output 235 [2018-10-10 14:54:43,071 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 2 xjuncts. [2018-10-10 14:54:43,383 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 2 xjuncts.